关于三叶图的能量变换

图的能量是图的邻接矩阵的特征值的绝对值之和，记为E（G）。用G（n，r）表示为具r个圈的n阶仙人掌图集，当r=3且每个圈为三角形时，称图G为三叶图。主要讨论n阶三叶图之间的能量变换关系。首先得到m（G，k）与bi（G）的关系；其次得到此类图之间满足变换关系Ⅰ、Ⅱ下的能量关系；并证得当T≌Sk，k〉12时的三叶图具有最小能量。     

Buffer Overflow Detection on Binary Code

Introduction Bufferoverflowvulnerabilityisareoneofthe mostcommonsecurityflaws[1].Accordingtothe reportfromLvMengtechnologycompany,more than50%securityvulnerabilitiesarecausedby bufferoverflowinthepast5years.Withthe growingofthesizeandcomplexityofsoftwaresys-tems,itbecomeshardertodiscovertheunknown flaws.Inclassicattackscenario,thebufferislocated ontheprogramstack,andthevaluewrittenoveris thereturnaddressforthecurrentstackframe[2].Thereturnaddressistamperedtopointbackinto thebufferwherethemal…     

图的反符号星k控制数

设G=(V,E)是一个图,一个函数f:E→-1,+1如果∑f(e)≤0 e∈E[v]对于至少k个顶点v∈V(G)成立,则称f为图G的一个反符号星k控制函数,其中E(v)表示G中与v点相关联的边集.图G的反符号星k控制数定义为γrkss(G)=max{∑f(e) e∈E│f为图G的反符号星k控制数}。得到了一般图的反符号星k控制数的若干上界,对文[6]中的结果进行了推广,还确定了路Pn和圈Cn的反符号星k控制数。     

On Codes with w-identifiable Parent Property

A code is said to be a w-identifiable parent property code (or w-IPP code for short) if whenever d is a descendant of w (or fewer) codewords, and one can always identify at least one of the parents of d. Let C be an (N, w 1, q)-code and C* an (w 1)-color graph for C. If a graph G is a subgraph of C* and consists of w 1 edges with different colors, then G is called a (w 1)-pattern of C*. In this paper, we proved that C is a w-IPP code if and only if there exists at most one vertex with color degree more than 1 in any (w 1)-pattern of C*.     

小松PC200-8挖掘机转速传感器故障判断

分析了小松PC200-8型液压挖掘机发动机转速传感器的工作原理,给出了关于转速传感器的故障代码,提出了故障代码E15-CA689出现时的转速传感器故障诊断程序,对发动机出现闷车、功率不足等故障现象时提出了解决方法。对于用户判断处理由于转速传感器引起的挖掘机故障有借鉴意义。     

关于冠图与queens-图的若干结果

文献[3]引入了queens-图的概念.一个(0,1)-矩阵A的queens-图的点集对应于A中的1,两个点邻接当且仅当它们对应的1在A的同一条线上.一个基本问题是判断哪些图是queens-图,该文证明了两类冠图是queens-图.     

图的反符号全控制数

设G=(VE)是一个无孤立顶点的图,一个函数f:V{-1,+1}称为图G的一个反符号全控制函数,如果f(N(v))≤1对任何点v V(G)成立。图G的反符号全控制数记为γrst(G)=max{f(V)|f为图G的一个反符号全控制函数}。该文对图的反符号全控制函数进行了研究,获得了一般图的反符号全控制数的若干界限,确定了完全图和完全二部图的反符号全控制数。     

Simulation study of foundations reinforced with horizontal-vertical inclusions using particle flow code

A two-dimensional discrete element code, particle flow code (PFC2D), is employed to investigate foundations reinforced with horizontal-vertical (H-V) inclusions. The initial states and loading processes of both unreinforced and H-V reinforced foundations are simulated by PFC 2D method. The interface between particles and reinforcements, and the reinforcement mechanism of the H-V reinforced foundations are studied through stress distribution graphs, displacement vector graphs and contact force graphs. The simulation results demonstrate that the vertical elements of the H-V reinforcement keep the particles from being displaced under the applied load. The H-V reinforcement can distribute the load uniformly over a wider area, thereby improving the bearing capacity of soil foundation.     

关于图的集控制数

设G是一个图,如果V(G)能划分为t个两两不交的控制集Dt(i=1,2,…,t),则称G有t-控制集划分.图G的集控制数定义为d(G)=max{ t|G有t-控制集划分}.该文主要研究乘积图与联图的集控制问题,给出其集控制数的界限,并确定一些特殊图的集控制数.     

求简单有向图所有基本回路的强核图论算法

求系统动力学模型的所有反馈环等价于求对应的简单有向图的所有基本回路，其核心问题是算法的时间复杂度，针对这一问题，提出强核的概念，基于强核概念设计了求简单有向图所有基本回路的算法，给出相应算例，并分析了算法复杂性．在时间复杂度上，本算法优于基于核概念的有向图的行列式算法。     

基于光正交码的不规则LDPC码

基于光正交码构造了一类新的不规则OOC LDPC码.新的LDPC码是准循环码,其编码复杂度与码长成线性关系,具有编码复杂度低的特点,它所对应的双向图中没有四线循环.用和积译码算法对新的码字进行了仿真,结果表明,与具有类似参数的随机码和规则OOC LDPC码相比,当信道误码率为10-5时,译码增益分别为0.3和0.15dB.     

图的上符号控制数的上界

令Гs（G）=max{w（f）｜f是图G的极小符号控制函数}是图的上符号控制数上界,根据最小度最大度等参数改进了上符号控制数的上界,是对Favaron在正则图中给出的上符号控制数上界及Wang C．X．和MaoJ．Z．在几乎正则图中给出的上符号控制数上界的一个推广．与Tang Huajun,Chen Yaojun在[3]中确立的解相比,结果更为精确。     

ON THE EXISTENCE OF THE h-RESTRICTED EDGE CONNECTIVITY OF A GRAPH

IntroductionLet G=(V,E) be a finite,simple and undi-rected graph with vertex set V and edge set E.We' ll follow the terminology and notation of Ref.[1 ]and terms not defined here can be found inRefs.[1 ,2 ].A set S of edges of G is called an edgedisconnecting set if G - S is disconnected. Theusual edge connectivityλ(G) of G is the minimumcardinality over the all edge disconnecting sets ofG.Note that,in the above definition,absolutelyno conditions or restrictions are imposed either onthe…     

一类四正则图的完全亏格分布

一个图G的完全亏格多项式表征了图G的亏格（可定向，不可定向）分布情况．本文推广了Yang和Liu提出的图类，得到了一类新的四正则图，并得出了此类四正则图的完全亏格分布．     

偶图符号控制数的下界

设G=（V,E）是一个图,一个实值函数f：V→{-1,＋1}满足∑v∈N[u]f（v）≥1对一切u∈V（G）都成立,则称f为图G的一个符号控制函数。图G的符号控制数定义为γs（G）=min{∑v∈V（G）f（v）｜f为图G的符号控制函数}。研究了偶图的符号控制问题,主要给出了偶图符号控制数的两个下界。     

轮图与舵轮图的超边优美标号

1994年, Mitchem和Simoson在研究标号图的问题时,提出了超边优美图的概念。在随后的研究中,一些图被证明具有超边优美性质,同时关于超边优美图的一些猜想也被提出。本文利用递归方法构造了轮图Wn与舵轮图Hn的超边优美标号,证明了这两类图是超边优美图。     

关于图的Grundy着色

设G=(V,E)为一个图,函数f:V→{1,2,…,k}被称为图G的一个Grundyk-着色函数,如果f为图G的一个真k-着色函数且对于任何两种颜色i和j(1≤i≤j≤k),每个j色点的邻域中至少有一个i色点。图G的Grundy色数定义为Γ(G)=max{k|存在图G的Grundyk-着色函数}。给出了图的Grundy色数的若干上界,并确定了几类特殊图的Grundy色数。     

基于联合迭代译码的LDPC编码协作系统

为提高系统性能,提出了分别采用正规LDPC(low-density parity-check code)和非正规系统LDPC码的编码协作通信系统,并给出了用于源节点和中继点的双LDPC码的构造方法.导出了基于双LDPC码的总体校验矩阵,据此校验矩阵给出了相应的双层结构Tanner图,目的点采用基于该双层结构Tanner图的联合迭代译码新算法译码.理论分析和数值模拟表明,在相同条件下,理想LDPC编码协作系统的性能明显优于编码非协作系统的性能,当误比特率为10-5、译码迭代10次时,理想正规LDPC码和非正规系统LDPC码编码协作系统较相应的编码非协作系统分别具有1.0和0.6 dB增益.     

On codes with <Emphasis Type="Italic">w</Emphasis>-identifiable parent property

A code is said to be a w-identifiable parent property code (or w-IPP code for short) if whenever d is a descendant of w (or fewer) codewords, and one can always identify at least one of the parents of d. Let C be an (N, w + 1, q)-code and C* an (w + 1)-color graph for C. If a graph G is a subgraph of C* and consists of w + 1 edges with different colors, then G is called a (w + 1)-pattern of C*. In this paper, we proved that C is a w-IPP code if and only if there exists at most one vertex with color degree more than 1 in any (w + 1)-pattern of C*. Foundation item: the National Natural Science Foundation of China (No. 10471093)     

Network Decomposition and Maximum Independent Set Part Ⅱ：Application Research

According to the researches on theoretic basis in part I of the paper，the spanning tree algorithms solving the maximum independent set both in even network and in odd network have been developed in this part，part Ⅱ of the paper．The algorithms trans form first the general network into the pair sets network，and then decompose the pair sets network into a series of pair subsets by use of the characteristic of maximum flow passing through the pair sets network．As for the even network，the algorithm requires only one time of trans formation and decomposition，the maximum independent set can be gained without any iteration processes，and the time complexity of the algorithm is within the bound of O(｜V｜^3)．However，as for the odd network，the algorithm consists of two stages．In the first stage，the general odd network is transformed and decomposed into the pseudo-negative envelope graphs and generalized reverse pseudo-negative envelope graphs alternately distributed at first；then the algorithm turns to the second stage，searching for the negative envelope graphs within the pseudo-negative envelope graphs only．Each time as a negative envelope graphhas been found．renew the pair sets network by iteration at once．and then tum back to the first stage．So both stages form a circulation process up to the optimum．Two available methods，the adjusting search and the picking-off search are specially developed to deal with the problems resulted from the odd network．Both of them link up with each other harmoniously and are embedded together in the algorithm．Analysis and study indicate that the time complexity of this algorithm is within the bound of O(｜V｜^5)．