查询词典 labeled graph

In order to check bisimulation for value--passing processes with infinite data domain, the symbolic transition graph and the symbolic transition graph with assignment are introduced by Hennessy and Lin as semantic models of value-passing processes, and strong bisimulation algorithms based on such graphs are also proposed.

为刻画和验证无穷值域上的传值进程，Hennessy和Lin先后提出符号迁移图和带赋值符号迁移图作为传值进程的语义表示模型，并给出了相应的强互模拟算法。

In order to check bisimulation for value-passing processes with infinite data domain,the symbolic transition graph STG and the symbolic transition graph with assignment STGA are introduced by Hennessy and Lin as semantic models of value-passing processes,and strong bisimulation algorithms based on such graphs are also proposed.

为刻画和验证无穷值域上的传值进程， Hennessy和Lin先后提出符号迁移图STG和带赋值符号迁移图STGA作为传值进程的语义表示模型，并给出了相应的强互模拟算法。

Since all elements on the primary diagonal are 1' s and the dimensions are less than 2006, the graph with A 2006 as its adjacency matrix is the transitive closure of the graph represented by A .

由于主对角线上的元素都是1，而且矩阵的阶小于2006，所以为 A 2006邻接矩阵的图就是由 A 表示的图的传递闭包。

In chapter 4, we studythe cyclic edge connectedness of regular half vertex transitive graphs, we showthat a connected k(≥4)-regular half vertex transitive graph X with girthg≥6 isλ_c-optimal, and we also obtain a su?cient and necessary conditionfor a connected k(≥4)-regular half vertex transitive graph X with girth 4 tobeλ_c-optimal.

第四章，我们研究了正则半点传递图的圈边连通性问题，主要结果是证明了一个围长为g≥6的k(≥4)-正则连通半点传递图X是λ_c-最优的，并且得到了一个围长为g = 4的k(≥4)-正则连通半点传递图X是λ_c-最优的充分必要条件。

First, the distance matrix of public transportation line is introduced, then the directed relation graph is constructed. In the directed relation graph, we can give the optimal line by revised shortest path algorithms.

首先通过引入各条公交线路直达最短距离矩阵构造了公交网络直达关系图，在直达关系图上，利用修改了的最短路算法，即可求得最优换乘路线。

With this interface, the setting of initial conditions, the combination of arbitrary parameters, the geometrical display of power spectrums, trochoid chart of phase portraits, Poincare mapping, analogous dynamic graph of displacements and the analogous vibration graph of mass blocks can be realized in an interactive way.

通过该可视化分析模型可以对非线性振动系统的混沌动力特性等进行全面地研究。该可视化分析模型具有操作简单、可视化程度高、可变参数调节方便、计算机仿真准确和分析问题全面等优点。

By the help of numerical analysis and graphic recognition, Duffing-van der Pol non-linear vibration system with 9 parameters has been researched, the Graphic User Interface contains initial conditions, 9 parameters, power spectrums, trochoid chart of phase portraits, Poincaré mapping, analogous dynamic graph of displacements and the analogous vibration graph of mass blocks, the various dynamic characteristics of the non-linear vibration can be attained, which makes it possible to fully implement the visualized computer experiments and study of Duffing-van der Pol non-linear vibration system.

因为混沌运动十分复杂，在研究和模拟混沌运动的过程中，不但要进行大量的数值计算，而且要将计算结果直观地展示出来以便观察混沌现象，完成这一任务非计算机不可。自从洛伦茨利用计算机发现了第一个混沌吸引子以后，30多年来正是有赖于计算机技术的发展，促使混沌的研究取得迅速的发展。另一方面，混沌运动是确定性系统中出现的一种貌似随机的现象，走向混沌有其独特的过程，只有展示出它的演化过程，才能很好地了解混沌运动。也就是说，混沌是一门关于过程、演化的科学而不是一门关于状态、存在的科学。因此，只有利用计算机才能将混沌的动态过程和演化的方式真正地体现出来。

I will give you an undirected graph, and you just need to tell me whether the graph is just a circle.

我会给你一个无向图，你需要告诉我这个图标是否仅仅是个圆圈。

Ore gave an upper bound of the number of edges of an undirected graph in terms of order and diameter of the graph.

Ore通过图的顶点数和直径给出无向图的最大边数。

In the algorithm, at first a weighted and undirected graph is constructed among data points in a dataset according to the model, where each data point corresponds to a vertex in the graph, and is regarded as an agent who can move randomly in space.

在此算法中，数据集中的样本点根据改进的随机游动模型，生成有权无向图，其中每个样本点对应图的一个顶点，并且假设每个顶点为可以在空间中移动的Agent。

Alternatively, the con- trollers can use the synchronous rectifier itself or loss- less inductor current-sensing methods to provide overload protection with lower power dissipation.

另外，康威特罗勒斯可以使用同步整流器本身或亏损减少电感电流检测方法，以提供低功耗过载保护。

Mr. Dauber's other Schatz hangs in his home movie studio.

多伯把沙兹的另一件作品挂在家里的电影室。