覆盖粗糙集的不确定性度量研究进展

覆盖粗糙集作为经典粗糙集一种较为流行的扩充模型,其现有不确定性度量方法主要包括覆盖粒度、粗糙度、粗糙熵、模糊度和模糊熵等。本文从纯粗糙集、信息论和模糊性三个视角对覆盖粗糙集的不确定性度量方法进行了分类梳理,通过结合覆盖粒度对覆盖粗糙度、覆盖精确度和覆盖粗糙熵进行了修正定义;设计了基于最小描述交的隶属函数,结合隶属函数对覆盖模糊度和覆盖模糊熵重新定义,给出了相关推论,分析了相关性质,为后续研究覆盖粗糙集不确定性的相关问题提供了新思路。     

覆盖信息系统一种新的约简方法北大核心

本文建立了一类基于元素最大描述的覆盖粗糙集,给出了与经典粗糙集理论相对应的覆盖粗糙集的基本性质,并讨论了不同覆盖生成相同覆盖近似算子的充要条件以及一个覆盖的约简。最后,通过构造区分矩阵来给出覆盖信息系统的约简与核心的判断定理,从而给出了求覆盖信息系统约简的一种方法。     

基于最小描述交的覆盖广义粗糙集

针对Bonikowski覆盖广义粗糙集模型的不足,给出了基于最小描述史的覆盖上下近似算子.通过和Pawlak经典粗糙集以及Bonikowski的覆盖广义粗糙集比较,发现给出的覆盖上、下近似算子具有了对偶关系,并得到了相关重要性质;进一步讨论了在新定义下覆盖广义粗糙集的约简和公理化问题,丰富了覆盖广义粗糙条理论,并为覆盖广义粗糙集的应用提供了更确切的理论根据.     

非汉字符号~*-覆盖正则半群的构造(Ⅰ)

本文刻画了■*-覆盖正则半群的结构,得到了弱覆盖正则半群和覆盖正则半 群的分类.作为其主要结论的应用, 我们还得到了(？)-覆盖完全正则半群, 弱覆盖完 全正则半群和覆盖完全正则半群的结构刻画.     

非汉字符号~*-覆盖正则半群的构造(Ⅰ)

本文刻画了■*-覆盖正则半群的结构,得到了弱覆盖正则半群和覆盖正则半 群的分类.作为其主要结论的应用, 我们还得到了(？)-覆盖完全正则半群, 弱覆盖完 全正则半群和覆盖完全正则半群的结构刻画.     

Ad Hoc网络区域划分和资源分配问题研究

主要利用图论、概率统计及优化理论对Ad-Hoc网络进行了数学建模.研究了等圆(不等圆)区域覆盖、带障碍区域的覆盖、确定性点覆盖、信道分配、抗毁度、节能性和通信质量等问题.定义了覆盖效率、抗毁性概率指标、覆盖系数、期望覆盖系数、网络寿命等一系列评价系数和衡量标准,提出了基于单位距离覆盖系数和期望覆盖系数的启发式寻优算法,并编程加以实现,得到较满意的近似解.     

覆盖近似空间的连续与同胚映射

利用一般映射研究了覆盖近似空间的一些性质,并证明了一些结论.接着定义了覆盖空间的粗糙连续映射及粗糙同胚映射.最后在覆盖粗糙连续映射和覆盖粗糙同胚映射的条件下,研究了两个覆盖近似空间的有关性质,进而在某种程度上为覆盖近似空间的分类提供了理论依据.     

变精度覆盖粗糙集模型近似算子的性质

变精度覆盖粗糙集模型是在放宽了覆盖标准的前提下给出的,因而导致近似算子发生了变化。在介绍覆盖粗糙集模型和变精度覆盖粗糙集模型的概念的基础上,给出并证明变精度覆盖粗糙集模型的近似算子的几个性质。     

基于模糊乘积有限自动机的覆盖关系

对Mealy-型模糊有限自动机乘积结构作了进一步的研究,并且对覆盖关系作了细致的刻画,推广了原有的覆盖概念.针对Mealy-型这类模糊有限自动机,通过性质考察了此覆盖概念的合理有效性,新的覆盖概念在乘积自动机间建立了更多的联系.特别证明了直积、级联积、圈积三种乘积之间的覆盖关系.得到了一些乘积自动机覆盖关系的传递性质.     

覆盖信息系统一种新的约简方法

本文建立了一类基于元素最大描述的覆盖粗糙集,给出了与经典粗糙集理论相对应的覆盖粗糙集的基本性质,并讨论了不同覆盖生成相同覆盖近似算子的充要条件以及一个覆盖的约简。最后,通过构造区分矩阵来给出覆盖信息系统的约简与核心的判断定理,从而给出了求覆盖信息系统约简的一种方法。     

The fundamental existence theorem on invariant fiber bundles

For discrete dynamical systems the theory of invariant manifolds is well known to be of vital importance. In terms of difference equations this theory is basically concerned with autonomous equations. However, the crucial and currently most difficult questions in this field are related to non-periodic, in particular chaotic motions. Since this topic - even in the autonomous context is an intrinsically time-variant matter. There is and urgent need for a non-autonomous version of invariant manifold theory. In this paper we present we present a very general version of the classical result on stable and unstable manifolds for hyperbolic fixed points of diffeomorphisms. In fact, we drop the assumption of invertibility of the mapping, we consider non-autonomous difference equations rather than mappings In effect, we generalize the notion of invariant manifold to the concept of invariant fiber bundle.     

Summatory Functions of Digital Sums Occurring in Cryptography

Morain and Olivos gave two algorithms that allow fast exponentiation in elliptic curve cryptosystems. These algorithms are based on representations of integers in certain redundant binary number systems. In this paper we consider the weight and the sum of digits function of these representations. In particular, we give formulas for their summatory functions. In the proofs we use the Mellin-Perron formula. In order to apply this formula, we have to compute the analytic continuation of a class of Dirichlet series.     

A quasilinear Neumann problem with discontinuous nonlinearity

In this paper we study a quasilinear boundary value problem of Neumann type with discontinuous terms. In particular we consider a problem in which the p–Laplacian is involved. In order to prove the existence of solutions we replace this problem with a multivalued approximation of it and, using a variational approach for locally Lipschitz functionals, we prove two existence results for it.     

On the Stability of the Directional Regularity

In this paper we select two tools of investigation of the classical metric regularity of set-valued mappings, namely the Ioffe criterion and the Ekeland Variational Principle, which we adapt to the study of the directional setting. In this way, we obtain in a unitary manner new necessary and/or sufficient conditions for directional metric regularity. As an application, we establish stability of this property at composition and sum of set-valued mappings. In this process, we introduce directional tangent cones and the associated generalized primal differentiation objects and concepts. Moreover, we underline several links between our main assertions by providing alternative proofs for several results.

     

A review of open queueing network models of manufacturing systems

In this paper we review open queueing network models of manufacturing systems. The paper consists of two parts. In the first part we discuss design and planning problems arising in manufacturing. In doing so we focus on those problems that are best addressed by queueing network models. In the second part of the paper we describe developments in queueing network methodology. We are primarily concerned with features such as general service times, deterministic product routings, and machine failures — features that are prevalent in manufacturing settings. Since these features have eluded exact analysis, approximation procedures have been proposed. In the second part of this paper we review the developments in approximation procedures and highlight the assumptions that underlie these approaches.     

New advances in permutation decoding of first-order Reed-Muller codes

In this paper we describe a variation of the classical permutation decoding algorithm that can be applied to any affine-invariant code with respect to certain type of information sets. In particular, we can apply it to the family of first-order Reed-Muller codes with respect to the information sets introduced in [2]. Using this algorithm we improve considerably the number of errors we can correct in comparison with the known results in this topic.     

小波分析中的一个非线性算子

在这篇文章里,我们以算子的观点考虑了小波的构造问题．结果,我们得到了小波分析中一个非线性算子并调查了这个非线性算子的一些性质．     

Rotation number values at a discontinuity

In the space of orientation-preserving circle maps that are not necessarily surjective nor injective, the rotation number does not vary continuously. Each map where one of these discontinuities occurs is itself discontinuous and we can consider the possible values of the rotation number when we modify this map only at its discontinuities. These values are always rational numbers that necessarily obey a certain arithmetic relation. In this paper we show that in several examples this relation totally characterizes the possible values of the rotation number on its discontinuities, but we also prove that in certain circumstances this relation is not sufficient for this characterization.     

不可约圈与路之并补图的色唯一性

讨论了形如ｋＣＲＵｒＰＲ的一类图的补图的色性．在一定的条件下证明了这类图是色唯一的．本文推广了文［１］的结果．     

Graph homomorphisms and nodal domains

In this paper, we derive some necessary spectral conditions for the existence of graph homomorphisms in which we also consider some parameters related to the corresponding eigenspaces such as nodal domains. In this approach, we consider the combinatorial Laplacian and co-Laplacian as well as the adjacency matrix. Also, we present some applications in graph decompositions where we prove a general version of Fisher’s inequality for G-designs.