共查询到20条相似文献,搜索用时 15 毫秒
1.
Doklady Mathematics - Methods for improving upper and lower bounds for various coverings of planar sets are proposed. New bounds for various numbers of partition constituents are presented, and... 相似文献
2.
基于覆盖的模糊粗糙集模型 总被引:16,自引:1,他引:15
讨论基于覆盖理论的模糊粗糙集模型。给出了模糊集的粗糙上、下近似算子,讨论了算子的基本性质,证明了覆盖粗糙集模型下所有模糊集的下近似构成一个模糊拓扑,并得到了覆盖模糊粗糙集模型的公理化描述。 相似文献
3.
覆盖广义粗糙集的模糊性 总被引:5,自引:0,他引:5
在研究覆盖广义粗糙集的基础上,利用两个距离函数Hamming和Euclidean距离函数,结合模糊集的最近寻常集,引入了覆盖广义粗糙集模糊度的概念,给出了一种模糊度计算方法,并证明了该模糊度的一些重要性质。这些结果在覆盖广义粗糙集的理论研究和应用都发挥着一定作用。 相似文献
4.
覆盖空间及粗糙集与拓扑的统一 总被引:3,自引:0,他引:3
引入覆盖空间,定义了其邻域、内部、闭包、测度等概念,研究了它们的性质.得出了粗糙集近似空间和拓扑空间都是具体覆盖空间的重要结论,从而用覆盖空间统一了粗糙集和拓扑.利用覆盖空间,得到了粗糙集和拓扑中更深刻的性质,从算子论和集合论的角度丰富和深化了粗糙集与拓扑的内容. 相似文献
5.
6.
Adrian Dumitrescu Dániel Gerbner Balázs Keszegh Csaba D. Tóth 《Discrete and Computational Geometry》2014,51(2):462-484
Given n points in the plane, a covering path is a polygonal path that visits all the points. If no three points are collinear, every covering path requires at least n/2 segments, and n?1 straight line segments obviously suffice even if the covering path is required to be noncrossing. We show that every set of n points in the plane admits a (possibly self-crossing) covering path consisting of n/2+O(n/logn) straight line segments. If the path is required to be noncrossing, we prove that (1?ε)n straight line segments suffice for a small constant ε>0, and we exhibit n-element point sets that require at least 5n/9?O(1) segments in every such path. Further, the analogous question for noncrossing covering trees is considered and similar bounds are obtained. Finally, it is shown that computing a noncrossing covering path for n points in the plane requires Ω(nlogn) time in the worst case. 相似文献
7.
8.
On the Number of Sum-Free Sets 总被引:1,自引:0,他引:1
Cameron and Erds have considered the question: how many sum-freesets are contained in the first n integers;they have shown (personalcommunication) that the number of sum-free sets contained withinthe integers {n, n + 1, ..., n} is c.2n/2. We prove that thenumber of sets contained within {l, 2, ...,n} is o(2n(+)) forevery > 0. 相似文献
9.
M. Dellnitz O. Schütze T. Hestermeyer 《Journal of Optimization Theory and Applications》2005,124(1):113-136
In this work, we present a new set-oriented numerical method for the numerical solution of multiobjective optimization problems. These methods are global in nature and allow to approximate the entire set of (global) Pareto points. After proving convergence of an associated abstract subdivision procedure, we use this result as a basis for the development of three different algorithms. We consider also appropriate combinations of them in order to improve the total performance. Finally, we illustrate the efficiency of these techniques via academic examples plus a real technical application, namely, the optimization of an active suspension system for cars.The authors thank Joachim Lückel for his suggestion to get into the interesting field of multiobjective optimization. Katrin Baptist as well as Frank Scharfeld helped the authors with fruitful discussions. This work was partly supported by the
Deutsche Forschungsgemeinschaft within SFB 376 and SFB 614. 相似文献
10.
Yu Qing Chen 《Designs, Codes and Cryptography》1999,17(1-3):69-72
Recently Davis and Jedwab introduced the notion of covering extended building sets to construct abelian difference sets. In this paper we consider a family of covering extended building sets similar to the ones corresponding to Hadamard difference sets and Spence difference sets and derive some numerical restrictions on the parameters. 相似文献
11.
覆盖粗糙模糊集的不确定性度量 总被引:2,自引:0,他引:2
在覆盖粗糙模糊集模型下,将粗糙集理论中的粗糙度和粗糙熵的概念引入到此模型中,用来度量模糊集的不确定的程度,并讨论了这些度量的一些性质. 相似文献
12.
定义了一种新的诱导覆盖粗糙集,这种定义可以保证其满足对偶性.然后证明了该诱导覆盖粗糙集具备的性质.最后讨论了两种诱导覆盖粗糙集之间的关系. 相似文献
13.
14.
将集合论中的覆盖概念抽象到完全分配格L上,利用它定义格L上关于覆盖的上(下)近似算子,给出格L上覆盖粗糙集模型.文中先讨论格L上覆盖的相关性质,进而研究了覆盖上(下)近似算子的性质,得到若干结果. 相似文献
15.
We study the structure of trees minimizing their number of stable sets for given order n and stability number α. Our main result is that the edges of a non-trivial extremal tree can be partitioned into n ? α stars, each of size \({\lceil\frac{n-1}{n-\alpha}\rceil}\) or \({\lfloor\frac{n-1}{n-\alpha}\rfloor}\) , so that every vertex is included in at most two distinct stars, and the centers of these stars form a stable set of the tree. 相似文献
16.
覆盖广义粗糙集是Pawlak粗糙集的重要推广,其属性约简是粗糙集理论中最重要的问题之一.Tsang等基于一种生成覆盖设计了覆盖信息系统属性约简算法,但并未明确指出其适用的覆盖粗糙集类型.在本文中,我们首先指出Tsang的属性约简算法适用的覆盖粗糙集是第五,第六和第七类.其次,我们通过建立覆盖与自反且传递的二元关系之间的等价关系,提出了一种时间复杂度更低的属性约简算法,并证明了本文中的属性约简方法就是Wang等所提出的一般二元关系属性约简的特例.本文不仅提出了属性约简的简化算法,还首次建立起覆盖属性约简与二元关系属性约简之间的联系,具有理论和实际的双重意义. 相似文献
17.
本文主要讨论 Petersen图的一类推广图—— n圈中辐图的团覆盖数和团划分数 ,由此得出该图的团覆盖数和团划分数相等的结论 ,同时给出了其在不同情况下的计算公式 . 相似文献
18.
19.
考虑了单位圆T=R/Z上的随机区间I_n(ω)=ω_n+(-l_n/2,l_n/2)(mod 1),其中{l_n}_n≥1为一列单调下降并趋于0的正实数,{ω_n}_n≥1为T上的一列独立同分布且具有Gibbs分布测度的随机变量.借助于重分形分析中的工具,估计了被随机区间序列{I_n(ω)}有限次覆盖以及无穷多次覆盖的集合的Hausdorff维数. 相似文献