FORBIDDEN SUBGRAPHS,DEGREES,NEIGHBORHOOD UNIONS AND CIRCUMFERENCES OF GRAPHS

Combining forbidden subgraphs with degree restrictions and neighborhood unionrestrictions,respectively,we prove the following results:(1) Let G be a 2-connected graph of order n,and 3≤c≤n.If for each induced subgraphL of order four of G(?)|V_1(L)∩S_c|≥2 if L≌K_(1,3),and |V(L)∩S_c|≥1 if L≌P_4,then thecircumference of G is at least c,where V_1(L)is the set of vertices with degree 1 of L,S_c isthe set of vertices with degree at least c/2 of G and P_4 is a path of order 4.(2) Let G be a 2-connected graph of order n,and n≥s+2.If for each induced subgraphL of G isomorphic to K_(1,3)or P_4,d_L(u,v)=2(?)|N(u)∪N(v)|≥s,then the circumferencec (G) of G is at least s+2.Moreover,if n≥s+3 and s is odd,then c(G)≥s+3.     

基于距离图的决策表简化方法

首先给出知识表达系统及决策表的距离图的概念 ;随后 ,借助距离图的性质 ,得到一种知识表达系统相容性判定与求核的方法 .特别地 ,这种方法可用于决策表相容性判定及条件属性核的求解 .最后 ,建立了一个利用约简决策表的距离图求决策规则的核值及最小决策算法的算法框架 .     

(4m, m)-CHOOSABILITY OF PLANE GRAPHS

1 IntroductionAll graphs considered in tabs paper are abate and sable. Undecked notations and termalnologies can be found in [if.Let G = (V, E,F) be a plase graph, where V, E and F denote the s6t of venices, edgesand faces of G, respectively. We use NG(v) and dG(v) to denote the set and nUmber of venicesadjacent to a vertex yi respectively, and use 6(G) to denote the inininuun degree of G. A vertexv is called a k-vertex if v has degree k. A face of a plane graph is said to be incident w…     

机场停机位分配问题的图着色模型及其算法

停机位分配作业关系到整个机场的系统运作,其作用相当重要。通过对停机位分配的分析,把停机位的分配转化为图着色,建立停机位分配问题的图着色模型,并引入时间片算法确定航班使用机位的时间冲突集合,根据"先到先服务"的原则给出了停机位分配的顶点序列着色算法,该算法的计算复杂性为O(n2k2),最后将该算法应用于一个算例。     

A DEGREE CONDITION FOR THE EXISTENCE OF CONNECTED [k, k 1]-FACTORS

ＡＤＥＧＲＥＥＣＯＮＤＩＴＩＯＮＦＯＲＴＨＥＥＸＩＳＴＥＮＣＥＯＦＣＯＮＮＥＣＴＥＤ［ｋ，ｋ＋１］－ＦＡＣＴＯＲＳＡＤＥＧＲＥＥＣＯＮＤＩＴＩＯＮＦＯＲＴＨＥＥＸＩＳＴＥＮＣＥＯＦＣＯＮＮＥＣＴＥＤ［ｋ，ｋ＋１］－ＦＡＣＴＯＲＳ￥ＣＡＩＭａｏｃｈｅｎ...     

THE PERIODIC CAPACITATED ARC ROUTING PROBLEM LINEAR PROGRAMMING MODEL, METAHEURISTIC AND LOWER BOUNDS

1. Introduction The Capacitated Arc Routing Problem(CARP) is defined on an undirected network inwhich a fleet of identical vehicles with limitedcapacity is based at a depot node. Each edge hasa non-negative traversal cost and can betraversed any number…     

PATH EXTENSIBILITY OF CONNECTED,LOCALLY 2-CONNECTED K_(1,3)-FREE GRAPHS

1.IntroductionandNotationqInthispaperswewillconsideronlyfinite,undirectedgraphs,withoutloopsandmultipleedges.Weusethenotationsandterminologyin[1].Inaddition,ifGisagraph,wedenotebyV(G)andE(G),respectively,thevertexsetandtheedgesetofG.ForanyaEV(G),ACV(G),BC…     

A Degree Condition on Long Paths and Large Cycles

We present a new condition ensuring the existence of a large cycle of passing throughgiven edge.Let l(C)denote the length of the cycle C.Suppose G is a 4-connected graph withvertices set{x_1,x_2….x_n}and edge set E and with the property that,for any two positiveintegers j and k,j相似文献   

Involved in Praxis and Analytical at a Distance

Lately, society has pressed for more direct societal relevance of social research. The argument of this special issue is that engaged research is an answer to the demand for a social science that matters. We define engaged research as a praxis where researchers actively engage in a social field in the pursuit of solving important local problems, while at the same time combining this with a scientific knowledge generation process. In other words, we discuss the conditions for research when researchers “go native” to solve problems and reflect along with participants. We have been able to find several sources of arguments supporting such a research strategy, but our search for methodological guidance on how to act as an engaged researcher has been in vain. What does it take for a researcher to do engaged research? The set of articles in this special issue all address certain aspects of this challenge. Some discuss the researcher’s path towards deep field engagement, whereas others discover various challenges and skills involved in engagement, and the task of developing scientific knowledge based on engaged research.     

分布式环境下多任务调度问题的分析与求解

将约束条件归纳为任务约束、链路约束和资源约束,在允许任务复制的情况下,建立了问题的约束与目标的完整数学模型;提出了一种基于任务复制的模拟人类社会中关系演化过程的簇调度算法IREA,包括前沿调度、动态分簇和分离图三个子算法.IREA采用全新的优先级规则,定义了关系数、依赖度、归并度等表示簇的优先级.通过对两个经典算例的计算,发现IREA能求出比算例所在文献算法所得解更优的解;对MJD算例,还得到了一个不同于原文献所给理论最优格局的一个新的最优格局.     

CONNECTED [1, k]-FACTORS OF BALANCE BIPARTITE GRAPHS

1.IntroductionAllgraphsconsideredaresimpleandfinite.Wereferthereaderto[1]forstandardgraphterminologiesnotdefinedinthispaper.LetGbeagraphwithvertexsetV(G)andedgesetE(G).ForanySCV(G),wedenotebyNG(S)theneighborsetofSinG,anddefineNG[S]=NG(S)US.LetdG(v)denotethedegreeofvinG.IfwewriteG=(VI,VZ),itmeansthatGisabipartitegraphwiththepartition(VI,V2)ofV(G).IfIVII=IVZI,wecallGabalancebipartitegraph.LetafbbetwopositiveintegerssuchthataSb.AspanningsubgraphFofGiscalledan[a,b]-factorofGi…     

军事系统工程中的知识图谱应用及研究

目前随着通用知识图谱构建技术的发展、自然语言处理技术的进步以及各个行业挖掘数据深层关系的需要, 军事同电商、金融证券、医疗等行业一样, 也需要构建属于自己领域的知识图谱。通过定义军事知识图谱以及明确军事知识图谱使用时的特殊性, 总结了构建过程中的难点, 介绍了当前构建军事知识图谱的思路以及使用的技术手段, 汇总了军事领域应用知识图谱的现状。最后, 给出了知识图谱最新的研究进展, 并针对军事领域知识图谱中一部分未解决的困难问题提供了一种可能的解决思路。     

战斗部与HTK允许脱靶量的仿真分析

通过建立战斗部和直接碰撞杀伤方式命中目标的允许脱靶量模型,针对空中目标尺寸、速度、机动等特性的变化进行了仿真计算和比较分析。结果表明在不同具体情况下,战斗部和HTK拦截各有优劣;但从普遍意义上看,HTK方式对特性变化目标和不同类型目标具有更好的通用性,对高性能目标也具有更好的适用性。     

On the Toughness and Fractional Perfect Matching of Graphs

In this paper, we prove the following results： let G be a graph with even order P ≥ 2k ＋ 2, if t（G） 〉 k, then the subgraph of G obtained by deleting any 2k-edges or 2k-vertices has a fractional perfect matching.     

连通、几乎局部连通无爪图是完全圈可扩的

设Ｇ是一个图,Ｂ ＝ ｛ｖ ∈Ｖ（Ｇ）｜〈Ｎ（ｖ）〉不连通｝．如果Ｂ是独立集,并且ｖ ∈Ｂ,ｕ ∈Ｖ（Ｇ）, 使〈Ｎ（ｕ） ∪｛ｕ｝〉连通,则称Ｇ是几乎局部连通图．本文证明：连通、几乎局部连通无爪图是完全圈可扩的．     

任务/资源图模型的任务调度与资源访问仿真分析(Ⅱ)-"爱国者"拦截作战目标过程实例分析

任务/资源图仿真建模方法由于包含丰富的时间属性而非常有利于分析复杂离散实时系统，通过一个仿真实例来分析任务/资源图模型的任务调度和资源访问。首先利用任务资源图模型对“爱国者”防空导弹拦截作战目标过程进行了仿真建模，然后利用RM任务调度方法和PCP资源访问控制协议对该系统进行了可调度性分析，包括单节点调度、多节点调度和端对端调度分析。复杂系统任务执行过程中会出现各种抢占、挂起、资源冲突情况，尤其是对于最坏情况下的任务调度和资源使用情况，通过仿真分析验证了对这些复杂情况的时间序列属性。可调度性分析和仿真分析结果表明任务/资源图模型是一种强有力的复杂离散实时系统分析仿真方法。     

新型公交网络模型与最优出行路径算法

给出一种标号的二分图公交网络模型,在此模型基础上给出线路换乘与最优出行路径的算法,这种算法充分利用标号信息给出站点网络图的边权函数.基于站点网络图不仅能够搜索换乘线路而且能够找到最短路径.最后利用天津市部分公交系统验证了该模型及方法的有效性.     

动态光线跟踪算法与实现

提出动态光线跟踪的动态可视区域重跟踪算法理论规则及实现算法,有效解决了传统光线跟踪算法由于计算量大而难以应用于动态模型的难题,是将光线跟踪技术真正有效应用于计算机实时动画领域的新算法。本算法包括运动物体及其反射、折射可视区域和运动背景在离散时间序列的重跟踪算法,以及两种针对动态可视区域重跟踪的消隐算法。     

DEGREE CONDITIONS FOR GRAPHS TO BE FRACTIONAL （a, b, n）-CRITICAL GRAPHS

Let G be a graph, and a and b be integers with a ≤ b. A graph G is called a fraetional （a, b, n）-critical graph if after any n vertices of G are deleted the remaining subgraph has a fractional [a, b]-factor. In this paper two degree conditions for graphs to be fractional （a, b, n）-eritical graphs are presented, and the degree conditions are sharp in some sense.     

基于颜色与空间距离的置信度传播立体匹配算法

立体匹配是计算机视觉领域的一个重要研究课题,为了得到准确、稠密的视差图,提出了一种基于颜色与空间距离的置信度传播立体匹配算法.该算法首先将立体匹配表示成马尔科夫随机场模型,然后利用置信度传播方法来解决马尔科夫随机场中的最大后验估计问题,以达到建立稠密视差图的目的.算法中利用了彩色图像的颜色与空间信息建立视差空间图,并使用削减的线性模型来定义视差图的平滑项.采用了标准测试图像进行了测试,结果表明算法具有很好的性能.