查询词典 operation method expressed in graphs

Chapter one is "Introduction". On the basis of summarizing the history of the study of the pictophonetic characters, we suppose some theoretical principle, such as the principle of the correspondence between the form and the meaning of the individual graph of Chinese characters, the principle of the total graphs of Chinese characters being a character-formation system, and the principle of the optimum development of the character -formation system in the history, and som analytic methods, such as the methods of structrue-function analysis, form-position analysis and meaning factor analysis, in the study of the pictophonetic characters. Chapter two is titled"General knwledge of the pictophonetic character." We discuss their origins, nature and some standards of distingnishing them, introduce the knowledge about the editions of SHUO WEN JIE ZI, analyse the functions of the modules of pictophonetic characters in detail, discuss concretely the function of phonetic graphs showing origins and pronunciations, the function of meaning graphs showing meanings and analogies, and the function of distinguishment when the two kinds of graphs are conbined. Chapter three is"The system of meaning graphs of Xiao Zhuan system."After we describe the structure of the meaning graph system, the relations between meaning graphs, the distributions of the function of meaning graphs showing meanings, and the frequency of all this kind of graphs, we get a table of all meaning graphs, a table of the frequency. Chapter four is"The system of phonetic graphs of Xiao Zhuan system."We describe the structure of the phonetic graph system, the relations between phonetic graphs, and between their function showing origins and their function showing pronunciations, and their frequency, then we get ageneral table of phonetic graphs and table of their frequency. Chapter five is "conclusion". We think that systematical methodology is useful in describing and analysing the formation system of Chinese characters. The methodology is adaptable in describing the formation system of modern Chinese characters as well as the historical character systems, adaptable in describing horizontally as well as comparing vertically. Only when we finish the systematical vertical compare on the base of systematical horizontal decription, could we know the true history of the system of Chinese characters, recover the rule of the system's development, and supply the theoretical supports for the scientifical arrangement of modern Chinese characters.

第一部分—绪论，在总结形声字研究历史状况的基础上，提出了研究形声系统的理论原则和分析方法，即汉字个体字符形义统一的思想，汉字字符集合构形系统的思想，汉字构形系统历史演变系统优化的思想等三项理论原则和结构功能分析法，形位分析法，义素分析法等三种分析方法，还扼要地介绍了具体的工作程序和论文的主要内容；第二部分—形声字概述，论述了形声字的来源、性质和鉴别标准，介绍了对《说文解字》正篆形声字说解中的传抄讹误，版本异文，说解错误校勘和考证的经过，详细分析了形声字构件的功能，具体讨论了声符的示源功能与示音功能，义符的示意功能与类化功能以及声符与义符组合中的相互区别功能；第三部分—小篆字系的义符系统，从义符系统的构成、义符间的相互关系，义符示意功能的分布及义符的构字频度等不同侧面，对义符系统进行了全面的描写，产生了义符总表、义符间意义关系总表和义符构字频度总表；第四部分—小篆字系形声字的声符系统，从声符系统的构成、声符间的相互关系，声符的示源功能与示音功能的关系以及声符的构字频度等不同侧面，对声符系统进行了全面描写，产生了声符总表和声符构字频度总表；第五部分—结束语，在全面测查小篆字系形声字的基础上，对研究汉字的方法和现代汉字发展方向的问题提出了一些看法，认为系统论的方法是描写和分析汉字构形系统行之有效的方法，系统论方法，不仅适用于历史上文字系统的描写，也适用于现代汉字构形系统的描写，不仅适用了断代描写，也适用于历史比较，只有在对汉字断代系统描写的基础上进行系统的历史比较，才能认清汉字系统历史演变的真相，揭示汉字系统发展的客观规律，为科学地整理现代汉字提供理论上的依据。

In this master thesis, we mainly discuss the adjacent vertex- distinguishing total chromatic numbers of some special graphs and prove that Zhang"s conjecture holds for these graphs. Then we get the adjacent vertex-distinguishing total chromatic numbers of the Halin Graphs. Moreover, we investigate the Generalized Petersen Graphs, prove that some classes of positive integers can"t structure the Generalized Petersen Graphs and get the result that the adjacent vertex-distinguishing total chromatic number is 5. Finally, based on the number and the parity of circles contained by the graph, we get the adjacent vertex-distinguishing total chromatic number of two classes of graphs.

本学位论文首先主要针对几个特殊图类讨论其邻点可区别全色数，验证了其满足图的邻点可区别全色数的猜想；再证明了非轮的Halin图的邻点可区别全色数；接着研究的是广义Petersen图，讨论了不能构成广义Petersen图的几类正整数，并证明了该图的邻点可区别全色数等于5；最后，根据图所含圈的个数及其奇偶性得到了两类图的邻点可区别全色数。

Several invariants of star graphs and hypercubes, such as Mobius cubes, arrangement graphs,-star graphs, split star graphs, cluster-star graphs, alternating group graphs are advantageous over n-cube in many aspects.

近几年内，除了超立方体之外，有许多类似星状图和超立方体的多处理机架构被提出来讨论，其中较具代表性的有：Mobius cubes、排列图、-星图(n，k-star graphs 、分星图、聚星图(Clustered-star graphs)、变换群图等。

Interconnection networks; fault-tolerant embedding; Mbius cubes; hypercubes; star graphs; arrangement graphs-star graphs; split star graphs; cluster-star graphs; alternating group graphs

中文关键字连结网路；容错嵌入；超立方体； Mbius cubes、星状图；排列图；星图；分星图；变换群图

Some necessary conditions are obtained for sequential graphs, regular sequential graphs and Euler sequential graphs; several non-sequential graphs classes are showed for conglutinating graphs. The sequential graphs that contain even cycle with the same vertices have been constructed.

使用这种方法，得到了一般序列图、正则序列图、Euler序列图、圈的粘接序列图和圈的并序列图的必要条件，证明了边数为2k， k是奇数的Euler图是非序列图类，讨论了m个n圈的粘接图中的非序列图类；分析偶圈的特征，构造了偶圈的具有同顶点集的序列母图井给出其序列标号表达式。

Nullities of bipartite graphs, cycle graphs, bicycle graphs, tree graphs, line graphs of trees, and graphs with large nullities were discussed.

具体介绍了二部图、树、单圈图、双圈图和树的线图等的零度刻划，还讨论了大零度图等问题。

The half scenery search method and the maximum superiority search method developed for searching ideal AND/OR graphs can be extended to searching ideal non-AND/OR graphs containing SUB and COM operators, and the maximum reliability search method for searching ideal AND/OR graphs is applicable to the non-ideal AND/OR graphs containing circuit structures.

建立在理想AND/OR图上的半景搜索法和最大优势搜索法可以推广到包含SUB和COM算子的理想非AND/OR图的搜索，而最大超越搜索法则可推广到包含回路结构的非理想AND/OR图的搜索。

Simulation results demostrate that the circuit simulation algorithmperforms better and it is applicable to more kinds of graphs,such as undirected graphs,directed graphs,and mixed graphs.6 At the end of the article,the applications of the algorithm in several fields aredescribed and the value of the method is pointed out.

测试表明，本算法在对几类常见图的同构判定中表现优于Nauty算法，而且可以适用于无向图、有向图及混合图等多种类型的图。6最后给出了电路模拟法在应用领域的成功应用实例，指出了电路模拟法的应用价值。

The course contains four sections as follows: mathematical logic (including basic concepts of propositional logic and predicate logic, propositional calculuses and inference theories), set theory (including set algebras, relations, functions and cardinal numbers), algebraic structure (including algebraic systems, semigroups and groups, rings and fields, lattices and Boolean algebras), graph theory (including basic concepts of graph, Euler graphs and Hamiltonian graphs, trees, planar graphs and coloring graphs, some special vertex subsets and edge subsets).

本课程包含四部分内容：数理逻辑（包含命题逻辑与一阶逻辑的基本概念、等值演算以及推理理论），集合论（包含集合代数、二元关系、函数和基数），代数结构（包含代数系统、半群与群、环与域、格与布尔代数），图论（包含图的基本概念、欧拉图与哈密顿图、树、平面图及图的着色、图的某些特殊的顶点子集与边子集）。

The main work of this paper is that we have given the edge game chromatic number of cycle likes, fan graphs, flowers, Halin graphs, and the upbound is sharp for cycle likes and Halin graphs, it is also a good example for the study of planar and outerplanar graphs.

主要的工作是对一些特殊图类的边对策色数进行了研究，给出了类圈图，扇图，花形图和Halin图的边对策色数的上界，并且证明了关于类圈图和Halin图的结果是紧的，这就给平面图，外平面图的研究提供了很好的例子。

The receding calculations and experiment analyses in this subject are built on the blood cast of pig tongue.

本研究课题的前期工作是采用猪舌血管铸型模拟人舌而进行的数值计算与实验分析。

"Each human infection constitutes an opportunity for genetic modification of the virus through reassortment, mutation, or both...."

&每一次人类的感染都暗藏着一次基因修改的机会，无论是通过病毒的整合、突变或者兼而有之。。。。&