一种改进的基于规则实例多覆盖分类算法

基于规则分类算法提取的规则集通常存在3个问题:首先,提取的分类规则集中短规则过少,致使高质量的规则不多;其次,规则集中规则数量少,训练数据中几乎所有实例仅被规则覆盖一次;第三,虽然提取大量的规则,但是训练数据中存在一些小类样本的实例不能被任何一条规则覆盖。本文提出一种改进的基于规则的实例多覆盖分类算法(Rule-based classification with instances covered by multiple rules, RCIM),其特点是:(1)为了提高规则的质量,在选择生成规则的第1项时不仅考虑属性值的好坏,而且还考虑了属性值补的好坏;(2)一次产生尽量多,高质量的规则,而且当训练数据的实例至少被两条规则覆盖后才将其删除;(3)当遇上难以判断的测试数据时,对测试数据的各个属性值进行二次学习提取规则。算法RCIM不仅可以有效地提取大量的规则,而且较大程度地提高了规则的质量。通 过在大量数据上实验结果表明,RCIM比许多其他算法取得了更高的分类准确率。     

Group path covering and distance two labeling of graphs

For a positive integer d, an L(d,1)-labeling f of a graph G is an assignment of integers to the vertices of G such that |f(u)−f(v)|?d if uv∈E(G), and |f(u)−f(v)|?1 if u and u are at distance two. The span of an L(d,1)-labeling f of a graph is the absolute difference between the maximum and minimum integers used by f. The L(d,1)-labeling number of G, denoted by λd,1(G), is the minimum span over all L(d,1)-labelings of G. An L^′(d,1)-labeling of a graph G is an L(d,1)-labeling of G which assigns different labels to different vertices. Denote by the L^′(d,1)-labeling number of G. Georges et al. [Discrete Math. 135 (1994) 103-111] established relationship between the L(2,1)-labeling number of a graph G and the path covering number of Gc, the complement of G. In this paper we first generalize the concept of the path covering of a graph to the t-group path covering. Then we establish the relationship between the L^′(d,1)-labeling number of a graph G and the (d−1)-group path covering number of Gc. Using this result, we prove that and for bipartite graphs G can be computed in polynomial time.     

确定简单多边形旋转时碰撞部位的扫描算法

给定平面内任意两个互不相交的简单多边形Ｐ是Ｑ。若Ｐ在平面内绕０点旋转时与ＡＱ碰撞,讨论其碰撞部位的判定问题,通过分析多边形关于０点的单调边,在平面扫描算法的榧耻提出了曲线扫描法,给这一总理２的Ｏ（（ｍ＋ｎ）ｌｏｇ（ｍ＋ｎ））算法,与现有的算法相比,降低了时间复杂性,这一方法在计算几何和计算机图形学等领域具有一定的理论和实吓价值。     

逻辑函数的无冗余覆盖选择问题

逻辑函数的最小化算法可分为两大步骤：产生本源蕴涵项和在这些蕴涵项中选择一个最小覆盖。人说后者比前者更加困难,这的确是事实。我们这里提出一个无冗余和选择一个最小覆盖的算法。给定函数ｆ的一个本源覆盖Ｇ,首先将Ｇ分为三个子集：实质本源项子集Ｅ,完全冗余项子集Ｒ和相对冗余项子集Ｐ。然后在Ｐ中选择一个子集Ｐ＾＊,使Ｐ＾＊∪Ｅ为ｆ的一个近似最小覆盖。很明显,后一项任务比前者要复杂得多。所以,我们的讨论侧重于后     

具有遍历特性的移动机器人规划方法的研究

本文提出了遍历规划的概念和数学描述,以及完全遍历规划的设计方法,给出了常用 的几种性能评价函数．在此基础上,设计了基于带有综合性能评价指标的基本遍历运动序列 的完全遍历规划器．     

零件几何参数的计算机测量系统

介绍了一种利用视频测量、计算机图像处理技术实现的零件几何参数测量系统。该系统具有较高的测量效率 ,能够达到较高的测量精度。阐述了系统组成原理、图像处理算法以及影响系统测量精度的主要原因     

轴承腔两相流动流型特征参数及鲁棒性分析

航空发动机轴承腔的润滑设计和换热分析依赖于对轴承腔中润滑介质两相流动特性的理解,依据流型进行轴承腔油气两相介质流动研究是获取流动特性的有效途径。针对通过试验判断油气两相介质流动形式的需要,结合数值分析和试验数据,在辨识能力和试验获取等方面的考虑前提下,提出了辨识航空发动机轴承腔中均相流动与含油滴气/液分层流动两种主要油气两相流型的特征参数——体积含油率和无量纲速度,探讨了两个特征参数在较宽工况范围内保持流型辨识能力的鲁棒性。研究工作对于借助于试验判断油气两相流型,从而可以在严谨理论指导下基于流型进行航空发动机轴承腔润滑介质两相流动特性分析,实现准确高效的润滑设计和换热分析的设计路线实施是很有意义的工作。     

DOP与CPE的含量对BaSO4填充聚氯乙烯基隔音复合材料性能的影响

将邻苯二甲酸二辛酯(DOP)与氯化聚乙烯(CPE)按照不同的质量份数加入到BaSO4填充聚氯乙烯基(PVC)隔音复合材料中,探讨DOP与CPE的含量对BaSO4填充聚氯乙烯基隔音复合材料隔声性能的影响,利用BSWA VS302USB双通道声学分析仪,万能材料试验机,动态热机械分析仪测试了材料的隔声性能,力学性能,阻尼性能。结果显示:当PVC相对质量为100份,DOP为50份,CPE为20份时对低频具有较好的隔声性能,当DOP相对质量为80份,CPE为20份时对中频具有较好的隔声性能,对高频影响较小。     

Location allocation modeling for healthcare facility planning in Malaysia

Malaysia has seen tremendous growth in the standard of living and household per capita income. The demand for a more systematic and efficient planning has become increasingly more important, one of the keys to achieving a high standard in healthcare. In this paper, a Maximal Covering Location Problem (MCLP) is used to study the healthcare facilities of one of the districts in Malaysia. We address the limited capacity of the facilities and the problem is formulated as Capacitated MCLP (CMCLP). We propose a new solution approach based on genetic algorithm to examine the percentage of coverage of the existing facilities within the allowable distance specified/targeted by Malaysian government. The algorithm was shown to generate good results when compared to results obtained using CPLEX version 12.2 on a medium size problem consisting of 179 nodes network. The algorithm was extended to solve larger network consisting of 809 nodes where CPLEX failed to produce non-trivial solutions. We show that the proposed solution approach produces significant results in determining good locations for the facility such that the population coverage is maximized.     

Covering a convex 3D polytope by a minimal number of congruent spheres

The problem of covering a convex 3D polytope by the minimal number of congruent spheres is reduced to a sequence of problems of minimising sphere radius when fixing the number of the spheres. We form a mathematical model of the problem using the Voronoi polytopes. Characteristics of the model are investigated. Extrema are attained at the vertices of the Voronoi polytopes constructed for sphere centres. To search for local minima, a modification of the Zoutendijk feasible directions method in a combination with random search is developed. Some numerical results for a cube and a non-regular octahedron are obtained.