Constructing three-dimension space graph for outlier detection algorithms in data mining

Outlier detection has very important applied value in data mining literature. Different outlier detection algorithms based on distinct theories have different definitions and mining processes. The three-dimensional space graph for constructing applied algorithms and an improved GridOf algorithm were proposed in terms of analyzing the existing outlier detection algorithms from criterion and theory.     

The refinement algorithm consideration in text clustering scheme based on multilevel graph

To construct a high efficient text clustering algorithm, the multilevel graph model and the refinement algorithm used in the uncoarsening phase is discussed, The model is applied to text clustering. The performance of clustering algorithm has to be improved with the refinement algorithm application, The experiment result demonstrated that the muhilevel graph text clustering algorithm is available,     

步数可变循环图中生成树的计数

生成树的个数是评估图(网络)可靠性的一个重要且被广泛研究的量.一般的图还无简单有效的算法计算生成树的个数,利用切比雪夫多项式的性质推出了步数可变循环图中生成树计数的在线性时间内即可实现的算法,并应用于具体的图中.     

一类Cayley图的边Hamilton性

设G为有限群,|G|=p3,p为素数,M是G的一个生成集.证明了p3阶的Cayley图X(G,M)是边-Hamilton图.     

再论图Pn^3的优美性

给出图Pn3的另一种优美标号,证明其图是优美图且是交错图.另外指出文献[1]中的一个错误和给出了相应正确的结果,同时证明了严谦泰,张忠辅给出的标号以及我们改正的标号都是交错的.     

基于有向循环图的多学科设计优化模型调度方法

复杂产品的多学科设计优化过程中，往往会涉及到不同学科的专业分析模型以及各种商业软件应用的集成调度运行问题。在多学科设计优化过程中模型应用集成的基础上，结合设计模型的调度需求，研究了多学科模型的调度运行，并给出了基于有向循环图的通用模型调度解决方案，包括回路探测算法和模型调度算法。最后设计并实现了支持复杂产品多学科设计优化软件框架——iDesign的调度引擎，并以一个设计模型的调度为例，验证了方法的正确性和可行性。     

高级Petri网：基于ISO/IEC15909的理解

ISO/IEC15909从构成角度给出了高级Petri网的定义,对其的理解分为结点、扩展、关联矩阵和初始标识四个层次。高级Petri网的本质特征是扩展域D和扩展映射Type,二者的不同取值衍生了着色Petri网、谓词/变迁网和时间Petri网等类型。高级Petri网实际上是＂高层Petri网＂。高级Petri网图形是对库所/变迁网图形的折叠,具体方法是减少图元数量而增加图元信息。高级Petri网图形的结构可概括为＂三类图元及其注释＂。     

停机位分配问题的顶点着色模型及算法

给出了停机位分配问题顶点着色模型及其分解算法.通过改良一种时间冲突算法,构建了航班使用停机位的时间冲突集合.以"先到先服务"原则为基础,把停机位分配问题转化为顶点着色问题,并建立了相应模型.利用笔者独创的分解算法,停机位的作业能力可得到改善.算法的计算复杂度为O(n2).该算法的特点在于:1)将顶点、颜色划分为若干个不同等级的集合;2)将顶点按照所属集合的等级、度进行分解,得到顶点的分解序列.在用一种颜色ck(1≤k≤K;K是可用颜色数)给顶点着色时,优先给这样一个顶点着色:该顶点能被着ck色,且其分解序列号最大.最后将该算法应用于一个算例,得到了最优解.     

Conflict analysis approaches for investigating attitudes and misperceptions in the War of 1812

Formal systems engineering approaches to modeling misperceptions and attitudes are employed within the framework of the graph model for conflict resolution to systematically study the War of 1812 between the United States of America and Great Britain in order to provide enhanced insights into the causes of the war. More specifically, relational definitions for preferences, movements and stability concepts are defined for describing the attitudes and associated behavior of decision makers involved in a conflict. To capture misperceptions of decision makers in the War of 1812, attitudes are studied within the structure of a hypergame. Combining attitudes and misperceptions within the paradigm of the graph model furnishes the flexible analytical tool which demonstrates that misunderstanding of attitudes by Great Britain and the United States may have contributed to the outbreak of this nasty war.     

笛卡尔积图K3,3×Pn的交叉数

两个图G1和G2的笛卡尔积图G1×G2是这样一个图:V(G1×G2)=V(G1)×V(G2),E(G1×G2)={(u1,u2)(v1,v2)|u1=v1且u2v2∈E(G2),或者u2=v2且u1v1∈E(G1)}.确定了笛卡尔积图K3,3×Pn的交叉数为7n-1.