英语人>网络例句>graph 相关的网络例句
graph相关的网络例句

查询词典 graph

与 graph 相关的网络例句 [注:此内容来源于网络,仅供参考]

A simple connected graph is called bicyclic if it has n vertices and n + 1 edges.

双圈图是指边数等于顶点数加1的简单连通图。

The traditional search algorithm has been improved based on the features of connected graph so that it can calculate operation steps of any specific scheduled task automatically.

针对连接图的这一特点,改进传统的搜索算法,使之可以针对调度任务自动计算操作步骤。

An algorithm is proposed to split a single-pixel-width connected line graph into line segments by the Hit-and-Miss transformation.

我在 CodeProject 上写了一篇文章,提供一个利用Hit-and-Miss变换分割图形成线段的算法以及C#的源代码。

Let G = be a simple connected graph with vertex set V and edge set E.

中文摘要:设G=是一个简单连通图,V和E分别为G的顶点集和边集。

The statistics represented in their graph reflect animals connected to particular crime types, and in some cases the animal was not a victim of that particular cruelty type.

统计代表在他们的图反映了连接到动物,特别是犯罪类型,并在某些情况下,动物是不是一个受害者认为,手段特别残忍,类型。

Comment: A graph is CONNECTED if there is a path connecting every two vertices.

说明:如果任意两个顶点之间都存在路径相连,那么称这个图为"连接图"

In Graph Theory,we shall also be interested in connected graphs in which there is only one path connecting each pair of vertices;such graphs are called trees(generalizing the idea of a family tree).

在图论中,人们还对树感兴趣,树是每一对顶点间只有一条路的连通图。

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.

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

It takesthe weighted average of the L2 norm of the difference of the observation and thesolution of the system and the L2 norm of the difference of conormal derivativeat the different sides of the interface for every subdomain as cost functional andthe smooth coefficients of the subproblem and the value of solution of the originalproblem at interface as identification parameters;Using the property of continu-ous functional defined on compact set,the existence of the optimal solution of theidentification problem is proved;The necessary conditions of optimality charac-terized by the system equation,the adjoit equation and the variational inequalitysimultaneously are given by introducing the conception ofdifferential andadjoit variable;An algorithm is devised and its flow graph is given.

其次,针对分片光滑动力系统的特征,结合正演过程的区域分解算法,建立了分片光滑系统的分解区域参数辨识模型,该模型以子区域上解的实测值与计算值之差的L2范数和界面两侧的通量差的L2范数的加权平均作目标泛函,各子问题的光滑系数及界面上真解的值为待辨识参量;利用紧致集上连续泛函的性质,证明了子区域上参数辨识问题最优辨识参量的存在性;引入微分的概念,借助伴随变量,给出了由系统方程,伴随方程和变分不等式共同表征的最优性必要条件;根据此必要条件设计了算法,给出了算法的程序框图。

第66/100页 首页 < ... 62 63 64 65 66 67 68 69 70 ... > 尾页
相关中文对照歌词
Skin Graph
推荐网络例句

She gently rebuff ed him, but agreed that they could be friends

她婉言拒绝了,但同意作为朋友相处。

If in the penal farm, you were sure to be criticized.

要是在劳改农场,你等着挨绳子吧!

Several theories about reigniting and extinguishing of the arc have been refered.

本文综合考虑了几种电弧重燃和熄灭理论。