查询词典 acceleration-time graph

A graph in which any two vertices are connected by a path is called connected graph.

一个图中如果任意两个顶点都有一条路相连，则称之为连通图。

If any two nodes in a graph can be connected by a path along edges ,the graph is said to be connected.

如果图中任意两个结点间都能够用一条路径沿着边线连接起来，那么该图则被称为连通的。

In general,given two vertices V and W in a graph,it is not always possible to find a path connecting them;such a path will exist only when the graph is 'in one piece'.

D8 |一般而言，给定图的两个顶点V和W并非总能找到连接它们的路；只有当图是"在一块中"时，这样的路才存在。

In general,given two vertices V and W in a graph,it is not always possible to find a path connecting them（see Fig.3-9）;such a path will exist only when the graph is"in one piece".

一般而言，给定图的两个顶点V和W并非总能找到连接它们的路（如图3-9所示）；只有图"在一块之中"时，这样的路才存在。

The Cayley graph and the Sabidussi coset graph are two classical representations for these graphs.

这类图的典型代表是Cayley图和Sabidussi陪集图。

The second part points out the weakness in the planar graph of Heawood's counter example and also its types by GR graph. It also offers a new type of counter example so as to replace the former one.

第二部分通过GR图对希伍德反例进行了深入的探讨，指出该类型的平面图自身有破绽并给出新的反例类型以取代原反例。

ABSTRACT To improve the parametric design method which is based on points, lines and circles, this dissertation presents the theory and methodology of parametric design which is based on relating-graph. The expression, organization, cyclic problem, covariation and extension method of relating-graph are studied.

针对当前二维参数化方法中存在的考虑线素较为简单、循环约束问题较难解决等一系列问题，本文系统地研究了基于高层次图素的关联图形的表达、关联图形的组织、关联图形循环约束问题的解决、关联图形的联动以及关联图形的拓广等方法。

Detail are introduced as following: transfering the LS equation to difference equation, setting the initial conditions for different shape explosive at different initiation way (point, line, plane, divergent or convergent); the dealing method of different edge conditions; how to draw the curve graph in two dimensional space or surface graph in three dimensional space with the calculated data.

本文提出了在三维直角坐标系中爆轰波传播LS方程离散化方法，建立了相应的差分方程，研究了对不同形状炸药在多种起爆形式（点、线、面、散心、聚心）下初值条件的设定，以及各种边界条件的处理方法。

One is by knowledge Petri net First AND/OR graph was evolved by calculating cut set of relationship Matrix of parts which shows the assembly relation between the parts. Then the KPN was generated with AND/OR graph automatically. Running the KPN, an optimum assembly sequences was obtained last. The other is by Hopfield neural network.

一是利用知识PETRI网对装配过程进行建模，并自动规划出最佳装配序列的方法；这种方法首先根据产品装配的关联图，利用割集计算，自动生成产品装配的与/或图，由产品装配的与/或图转化成知识PETRI网，然后，运行此知识PETRI网，便可得产品的最佳装配序列。

With this method, the reliability to direct the constraint graph is increased, the computation complexity is reduced, and the cyclic constraint graph can be solved expediently.

应用此方法，可提高约束图有向化的可靠性、降低计算复杂度，且能方便地求解带有循环约束的约束图。

This is the inheritance of the tribe of the children of Issachar according to their families, the cities and their villages.

19：23 这些城并属城的村庄就是以萨迦支派按着宗族所得的地业。

I've have enough of your garbage.

我听了你的废话。