图

The relational database is used to organize data. The pre-processing with graphical human-computer interaction and 3D visual output is applied as a dramatic analysis method for engineer including data form, sample contour, isobar graph, vector graph, histogram and so on.

该系统以关系型数据库组织各种数据，完全实现了人机图形交互式前处理及三维可视化输出，为工程人员提供了包括数据表格、取样曲线、等位线、等位面图、向量图及二元函数图等一系列生动形象的数据分析手段。

The basic idea is that using the "point" function of software UTHSCSA Imagetool to acquire the pixel values of the event in the scanned chart image and then process these arc-shaped isochronal data with algorithms proposed by us to render these data.

基本方法是利用图象软件Imagetool中的"Point"功能获取小气候自记图图象上的记录曲线上点的像素值，然后通过我们给出的算法转换成相应的数据资料。

The paper discusses ways to perfect drawing isogram with the aid of a minicomputer technique.

本文探讨了完善微机绘制等值线图方法的途径，阐述了 LP9002软件的特点，研究分析了绘制等值线图的主要原理，并给出了 LP9002软件绘制等值线图的方法。

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

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

To change the subject a little,the reader will recall that when we were discussing,we pointed out that there were graphs which were isomorphic to the graph under consideration but which contained no crossings.

让我们稍微改变一下话题，读者将会记住我们在讨论图时，曾经指出一些图，它们与另一些不包含交叉线的图同构。

In this paper a new necessary and sufficient condition of graphic isomorphism is proved which is stated as following: two graphs are isomorphic if and only if their subgraphs are isomorphic and the new vertices as well as their adjancy edges are corresponding with the property of isomorphism.

提出了一个新的判定图同构的充分必要条件，即在子图同构的前提下，根据新增顶点及相应关联边的关系，判断母图同构的充分必要条件。

Since the graph isomorphism problem is neither known to be NP-complete nor to be tractable, researchers have sought to gain insight into the problem by defining a new class GI, the set of problems with a polynomial-time Turing reduction to the graph isomorphism problem.

由于图同构的问题既不是已知的NP完全问题，也不是听话的，研究人员设法深入了解这个问题，确定了一类新基的一系列问题，多项式时间图灵减少的图同构问题。

Graph's isomorphism is one of the basic problems and NP problems in graph theory.

图的同构是图论学科中的基本问题之1，属于图论中多个NP—完全问题之1。

By using Jordan Curve Theorem and classical combination, we obtain the formulas for computing the flexibility of wheels and wheel-like graphs on the torus. 2. By C.Thomassen's work on Large Edge Width embeddings, we obtain some properties of some locally LEW-embedded graphs.

利用Jordan曲线定理和经典的组合计数方法，得到了轮图在环面上柔性的计算公式，结合轮图的结果以及环面的性质，得到了轮型图在环面上柔性的计算公式。

By using Jordan Curve Theorem and classical combination, we obtain the formulas for computing the flexibility of wheels and wheel-like graphs on the torus.2. By C.Thomassens work on Large Edge Width embeddings, we obtain some properties of some locally LEW-embedded graphs.

利用Jordan曲线定理和经典的组合计数方法，得到了轮图在环面上柔性的计算公式，结合轮图的结果以及环面的性质，得到了轮型图在环面上柔性的计算公式。

In the negative and interrogative forms, of course, this is identical to the non-emphatic forms.

。但是，在否定句或疑问句里，这种带有"do"的方法表达的效果却没有什么强调的意思。

Go down on one's knees;kneel down

屈膝跪下。。。下跪祈祷