有向图

Based on this extended directed graph, an algorithm for creating it is proposed, the time complexity analysis of the algorithm is given, and its correctness is proved.

基于这种扩充有向图，提出了一种对象范式生成算法，并给出了算法的时间复杂度分析和正确性证明。

A relational database can be viewed as a directed graph constructed by tuples and foreign key references.

关系数据库可以看作是元组以及外键关系构成的有向图。

Under some conditions, SISM can be extended to the general Directed Graph.

在一定条件下，简化解释结构建模法还可以扩展到全体有向图。

A novel approach to output-based speech quality evaluation using fuzzy directed graph support vector machine is proposed.

提出了采用模糊有向图支持向量机对基于输出的多语言语音样本进行语音质量评价的一种新方法。

Finally, the author proves the sharp bound for the indices of convergence of n*n reducible Boolean matrices with f〓≥2 the writer lets f〓 be the greatest common divisor of the distinct lengths of the elementary cycles of the associated digraph D (A for a reducible Boolean matrix A , and characterizes the matrices with the largest index.

最后，设f〓为可约布尔矩阵A的伴随有向图D的所有圈长的最大公约数，当f〓≥2时，我们得到了可约布尔矩阵幂敛指数的一个上界和达到最大幂敛指数的矩阵的完全刻划。

In 2002, L.Volkmann [6] raised a problem: Determine other sufficient conditions for emicomplete multipartite digraphs such that every arc is contained in a Hamiltonian path.

Volkmann [6]提出这样一个问题：给出半完全多部有向图中每一条弧都在Hamilton-路上的充分条件。

It is proved that the problem of determining whether there is a Hamiltonian path from a specified vertex s to another t on a given digraph can be reducible at polynomial time to the problem of constructing a minimum spanning flow in a two-terminal extended network Ns,t, with the unit capacity for all arcs.

在此基础上，利用网络最小生成流的概念提出了一个修正模型，并证明了无环最小生成流问题可以在多项式时间内转换为哈密顿圈问题。文中最后指出，这一新的模型为解决在有向图内构造哈密顿轨的有效算法提供了一个新的思路和方法。

In chapter 4, we propose a transitive signature scheme that satisfies generalized homomorphism.

在第四章中，针对有向图，我们给出了满足广义同态性质的传递性签名系统。

Its directed graph structure and mixed contents consist of correct candidates and wrong candidates, not only result in very low retrieval accuary for traditional retrieval methods, but also need much more index space and searching time.

其中的一个核心问题就在于，Lattice并不是一个易于索引的数据形式，它的有向图结构，以及正确信息与错误信息相混杂的特点，不但直接导致了传统的检索方法性能不佳，而且也需要较大的存储开销和搜索时间。

Motivated by this problem, in this paper, we give an upper-embeddable property of one kind of digraphs in orientable surfaces.

受此问题的启发，本文给出了一类有向图在可定向曲面上是上可嵌入的性质。

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.

这是凯特，那个是爱朗。