查询词典 acceleration-time graph

Introduced in this paper is the forest graph of a connected graph which is a generalization of the tree graph.

本文中引进了连通图的森林图，它是树图的推广。

Graph free counted cross stiutch graph free counted crosse stitch graph fre counted cross stitch ...

图免费计数两岸stiutch图免费计数crosse十字绣图频率计数跨缝。。。

To solve this problem,the prerequisite condition for the similarity of bond graph of system is explored and the dynamic similarity conditions for the elements of bond graph are derived on the basis of bond graph which is ...

基于此，以适用于多能域系统建模的键合图为工具，论述复杂机电系统键合图相似的前提条件，推导出键合图各要素相似所对应的动力学相似条件。

In this paper, the L(d,1)-labeling is studied and the upper bounds of λd of plane triangulation graph, solid tetrahedron subdivision graph, plane near quadrangle subdivision graph are derived, and as corollaries, the conjecture is proved to be true for the above several classes of graphs.

此文研究了作为L(2，1)-标号问题的推广的L(d，1)-标号问题，并得出了平面三角剖分图、立体四面体剖分图、平面近四边形剖分图的L(d，1)-标号的上界，作为推论证明了对上述几类图该猜想成立。

The High-level Petri Net Graph is derived from the Predicate/Transition Net by the way of folding, that is, decreasing the number of the graph elements and increasing the information carried by a graph element.

高级Petri网图形是对库所／变迁网图形的折迭，具体方法是减少图元数量而增加图元信息。

Aiming at the multiple loop structures in quality management process network, an improved graph pattern mining approach based on Apriori algorithm is put forward, where a frequent pattern of size k, denoted as G, is joined with another frequent pattern of size k, denoted as G, to form a candidate frequent pattern of size (k+1), if there exists a source vertex s in G and a sink vertex e in G such that the graph derived from G by subtracting node s equals with the graph derived from G G by subtracting node e.

采用基于APriori方法的频繁活动序列挖掘算法，认为k-频繁图集中，当一个图减去其中的一个源顶点后，如果所得到的图与另一个图减去其中的一个沉顶点后的图相同时，可以连接生成一个(k+1)-候选频繁图，从而减少了传统Apriori算法迭代过程中生成的冗余候选频繁图的数目。

As a graphical framework for formally describing interactive system, basic graph can represent processes and the interaction between processes in two ways: one is graphical representation, where a graph corresponds to a process and reduction in a graph corresponds to interaction between processes; the other is using term algebra consisting a set of terms and an equational theory on terms.

基本图是一种描述并发交互系统的形式化方法，它具有描述简洁、清晰和直观的特点。在基本图中，进程以及进程间的交互行为，既可以用图表示方法(其中一个图对应一个进程，图之间的归约对应进程之间的交互行为)，又可以用项代数来表示。

With the popularization and application of computer-making-graph technique in all trades and professions, this new technical medium is widely used in graph of function teaching as auxiliary mathematical classroom teaching at home and abroad, as strongly advances an in-depth study in graph of function teaching.

伴随着电脑作图技术在各行业的普及与应用，国内外函数图像教学中普遍采用这一新的技术手段辅助数学课堂教学，有力的促进了函数教学向纵深阶段发展。

Let G = V(G,E be a simple graph with |V| vertices and |E| edges. Let |V|= p,|E|= q, if there exists f: V →{1,2,...,p} be an injective mapping, and define an inducedfunction f":E→{1,2,...,q} by setting f"=|f-f| for all∈E. If f maps E onto {1,2,...,q}, then f is said to be a Skolem-graceful labeling of G, the graph G is said to be a Skolem-graceful graph.

对一个给定的简单图G=V(G，E，|V|和|E|分别是图G的顶点数和边数，令|V|=p，|E|=q，如果存在一个一一映射f：V→{1，2，…，p}，使得对所有边∈E，由f′=|f-f|所导出的映射函数f′：E→{1，2，…，q}是一一对应关系，则称f是图G的一个Skolem优美标号，图G被称为Skolem优美图。

A graph G is edge reconstructible if every edge reconstruction of graph G is isomorphic to graph G.

如果图G的每个边重构图都与图G同构，则称图G是边可重构的。

The system can be widely used in belt weighing and batching process control,etc.

介绍了基于智能模糊控制的嵌入式配料系统的设计方法，对模糊PID控制过程和系统调零作了重点的讨论，同时给出了PID控制的程序流程图和系统定长调零子程序。

"I dunno," she answered,"but if you show me aroun', I'll recognize it from the lighthouse just outside the porthole."

"我不知道，"她回答说，"如果你能带我转转，我能认出来的，因为灯塔就在舷窗外。"