查询词典 graph paper

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优美图。

By using the algebraic method, we obtain a new formula for the expected hitting time of random walks on strong-connected and aperiodic digrahs (irreducible and aperiodic Markov chain). From this formula, we obtain the explicit expressions for the expected hitting times of random walks on directed de Bruijn graph, directed Kautz graph and some graphs constructed from strong regular graph, etc.

利用代数方法给出了强连通非周期有向图上随机游动（即不可约非周期马尔可夫链）平均首达时间一个新的表达式，并利用这个表达式得到了有向de Bruijn图，有向Kautz图以及和强正则图相关的几类图上随机游动任意两点之间的平均首达时间。

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

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

E. MCNG-ISOMAP (Minimal Connected Neighborhood Graph-based ISOMAP), which can prune effectively "shortcut" edges, existed possibly in the neighborhood graph, based on that the minimal connected neighborhood graph can avoid "shortcut" edges effectively.

该算法能在一定程度上避免邻域大小难以有效选取的问题，同时还能在不依赖于邻域大小的情况下发现数据真正的固有维数。

A free edge in a Ramsey graph of K n is defined as whatever does the edge to be colored by one of two colors respectively,the graph will keep to be a Ramsey graph of K n.

在 Ramsey图 Kn中一条自由边定义为，即使单独改变这条边的颜色，所得到的新图仍是一个二色 Ramsey图 Kn 。

To prove one edge union of k-shell graph is cordial, firstly fix the labeling of vertex of common edge(label u with 0 and v with 1), then according to the value of the graph order n module 4 to class the k shell gaphs to four cases, and to divide to small cases in every shell graph.

本文研究k-贝壳图的亲切标号时，在固定了公共边上的点的标号(对u标号0且v标号为1)之后，我们采用如下方法：首先，以每个贝壳图的顶点数对4取模的余数来分类，这样就得到了四种(来源：d1ABC论文网www.abclunwen.com)不同情况的贝壳图；然后在每个贝壳图中再分情形进行标号；最后，通过证明得到这种标号方法是满足亲切标号的定义的，从而证明了k-贝壳图的亲切性，成功的解决了Sethuramam和Selvaraju猜想，证明了其正确性。

By using the graph-theoretic method, the completion problems for a partial inverse Mmatrix with any order are discussed when its corresponding graph of the partial inverse M-matrix is a 2-chordal graph .

本文采用图论的方法对任意阶部分逆M矩阵，当其对应的图为2-弦图时，研究了其逆M矩阵的完备问题。

The multilevel partitioner of MVP achieves the better partitioning of weighted undirected graph by introducing the graph core during the coarsening phase,the spectral graph theory during the initial partitioning phase and swarm intelligence during the refinement phase.

MVP系统的多水平剖分程序引入图核到粗化阶段，谱图论到初始剖分阶段，群智能到投影优化阶段，得到了无向赋权图更优的剖分。

Vishnu entered a dark fourth dimensional dream that did not support his field or continued life.

毗瑟挐进入了一个第四密度的黑暗梦想，那里并不支持他的能量场或继续生命。

Leaders and decision-making persons use it to collect the data, including the information of unit work, handing in fee, oweing fee, prepaying fee,changing and afterpaying and account transfering of joining-insurance employee, and account paying of all kinds of insurances from hospitalization insurance institutions.The collected data is picked up, organized, switched and showed to user.

该子系统主要面向各级领导、决策分析人员；从各个医疗保险经办机构和定点医疗机构采集数据，包括在各个医疗保险经办机构处理的单位办公信息，单位缴费、欠费、预缴费信息，参保职工变更信息，参保职工增减变动信息，参保职工补缴信息，参保职工帐户划拨信息：包括各定点医疗机构处理的各险种帐户支出信息，各险种的统筹金支付信息等；将采集的数据提取，组织和转换，然后展示给用户。