Roughness in MV-algebras

In this paper, by considering the notion of an MV-algebra, we consider a relationship between rough sets and MV-algebra theory. We introduce the notion of rough ideal with respect to an ideal of an MV-algebra, which is an extended notion of ideal in an MV-algebra, and we give some properties of the lower and the upper approximations in an MV-algebra.     

Honeycomb toroidal graphs are Cayley graphs

There is a particular family of trivalent vertex-transitive graphs that have been called generalized honeycomb tori by some and brick products by others. They have been studied as hexagonal embeddings on the torus as well. We show that all these graphs are Cayley graphs on generalized dihedral groups.     

粗糙集的粗糙度

设U是全集,R是U上的等价关系,(U,R)是相应的近似空间,则粗相等关系≈是幂集P(U)上的等价关系,其商集为P(U)／≈,而商集P(U)／≈是一个分配格,本文考虑两种特殊情况,使得在这两种特殊情况下粗糙度有类似于集合论的包容排斥原理,同时我们还把此结论推广到粗糙模糊集上。     

Roughness based on fuzzy ideals

The theory of rough set, proposed by Pawlak and the theory of fuzzy set, proposed by Zadeh are complementary generalizations of classical set theory. Many sets are naturally endowed with two binary operations: addition and multiplication. One concept which does this is a ring. This paper concerns a relationship between rough sets, fuzzy sets and ring theory. It is a continuation of ideas presented by Kuroki and Wang [N. Kuroki, P.P. Wang, The lower and upper approximations in a fuzzy group, Inform. Sci. 90 (1996) 203-220]. We consider a ring as a universal set and we assume that the knowledge about objects is restricted by a fuzzy ideal. In fact, we apply the notion of fuzzy ideal of a ring for definitions of the lower and upper approximations in a ring. Some characterizations of the above approximations are made and some examples are presented.     

The Cayley network of expanded Pancake graphs

Signed permutation group has important applications in genome rearrangement as well as the construction of networks. In this paper, we propose a new interconnection network named extended Pancake graph, we investigate its topological properties, and give a routing algorithm with the diameter upper bounded by 2n?1. Some embedding properties are also derived. In conclusion, we present a comparison of some familiar networks with the Cayley graph EP _n .     

Linearly many faults in Cayley graphs generated by transposition trees

We prove that when linearly many vertices are deleted in a Cayley graph generated by a transposition tree, the resulting graph has a large connected component containing almost all remaining vertices.     

粗糙集的两种相似性度量

粗糙集理论是一种新的处理模糊和不确定性知识的软计算工具.在近似空间中,首先基于集合的上下近似给出了一种粗糙集间的相似度量方法.然后通过定义一种基于粗糙隶属函数的包含度,给出了另外一种粗糙集间的相似度量方法,并分别研究了这两种相似度量方法的有关性质.最后讨论了这两种相似度量方法之间的关系.     

A channel assignment problem for optical networks modelled by Cayley graphs

A problem arising from a recent study of scalability of optical networks seeks to assign channels to the vertices of a network so that vertices distance 2 apart receive distinct channels. In this paper we introduce a general channel assignment scheme for Cayley graphs on abelian groups, and derive upper bounds for the minimum number of channels needed for such graphs. As application we give a systematic way of producing near-optimal channel assignments for connected graphs admitting a vertex-transitive abelian group of automorphisms. Hypercubes are examples of such graphs, and for them our near-optimal upper bound gives rise to the one obtained recently by Wan.     

Cayley graphs as models of deterministic small-world networks

Many real networks, including those in social, technological, and biological realms, are small-world networks. The two distinguishing characteristics of small-world networks are high local clustering and small average internode distance. A great deal of previous research on small-world networks has been based on probabilistic methods, with a rather small number of researchers advocating deterministic models. In this paper, we further the study of deterministic small-world networks and show that Cayley graphs may be good models for such networks. Small-world networks based on Cayley graphs possess simple structures and significant adaptability. The Cayley-graph model has pedagogical value and can also be used for designing and analyzing communication and the other real networks.     

Roughness in modules

The theory of rough sets was proposed by Pawlak in 1982. The relations between rough sets and algebraic systems have been already considered by many mathematicians. Important algebraic structures are groups, rings and modules. Rough groups and rough rings have been investigated by Biswas and Nanda, Kuroki and Wang, and Davvaz. In this paper, we consider an R-module as a universal set and we introduce the notion of rough submodule with respect to a submodule of an R-module, which is an extended notion of a submodule in an R-module. We also give some properties of the lower and the upper approximations in an R-module.     

一种改进的图像增强算法及其应用

为改进图像增强算法,使之更适合医学领域图片的处理,采用了粗糙集的上逼近和下逼近思想,将图像分为物体区和背景区,使用不同的函数进行增强,进而提出了一种改进的基于粗糙集的增强算法,并首次应用于医学图像处理领域.实验结果显示改进的基于粗糙集的增强效果优于直方图均衡化方法.     

模糊关系下的粗集粗糙度

本文研究粗糙集的粗糙度问题。首先仔细分析了Pawlak粗糙集的粗糙度,得到了粗糙集粗糙度包容相斥原理;然后将结果推广到模糊集理论领域,对研究模糊关系下模糊粗糙集理论有一定的作用。     

The lower and upper approximations in a quotient hypermodule with respect to fuzzy sets

This paper provides a continuation of ideas presented by Davvaz and Mahdavipour [B. Davvaz, M. Mahdavipour, Roughness in modules, Inform. Sci. 176 (2006) 3658-3674]. The notion of hypermodule is a generalization of the notion of module. In this paper, we consider the quotient hypermodule M/A and interpret the lower and upper approximations as subsets of the quotient hypermodule M/A. Then, we introduce the concept of quotient rough sub-hypermodule. Also, using the concept of fuzzy sets, we introduce and discuss the concept of fuzzy rough hypermodules and then we obtain the relation between fuzzy rough sub-hypermodules and level rough sets. This relation is characterized as a necessary and sufficient condition.     

Nowhere-zero 3-flows in dihedral Cayley graphs

In this paper we prove that every k-valent Cayley graph of a dihedral group, where k?4, admits a nowhere-zero 3-flow.     

粗糙集与BCK代数

粗糙集的代数刻画是粗糙集理论中研究的一个重要方向,在偶序对[R(X),R(X)]构成的集合中定义了二元运算[*],证明了序偶对构成的集合构成了一个有界BCK代数,给出了基本的性质,为粗糙逻辑和粗糙推理奠定了基础。     

合成信息系统与子信息系统

本文给出了对象合成信息系统、属性合成信息系统、对象子信息系统及属性子信息系统的定义,分别讨论了它们的上下近似算子与原信息系统的上下近似算子之间的关系．并给出了它们的一些实际应用。     

The (strong) rainbow connection numbers of Cayley graphs on Abelian groups

A path in an edge-colored graph G, whose adjacent edges may have the same color, is called a rainbow path if no two edges of the path are colored the same. The rainbow connection number rc(G) of G is the minimum integer i for which there exists an i-edge-coloring of G such that every two distinct vertices of G are connected by a rainbow path. The strong rainbow connection number src(G) of G is the minimum integer i for which there exists an i-edge-coloring of G such that every two distinct vertices u and v of G are connected by a rainbow path of length d(u,v). In this paper, we give upper and lower bounds of the (strong) rainbow connection numbers of Cayley graphs on Abelian groups. Moreover, we determine the (strong) rainbow connection numbers of some special cases.     

Edge-fault-tolerant bipancyclicity of Cayley graphs generated by transposition-generating trees

The Cayley graphs on the symmetric group plays an important role in the study of Cayley graphs as interconnection networks. Let Cay(S_n, B) be the Cayley graphs generated by transposition-generating trees. It is known that for any F?E(Cay(S_n, B)), if |F|≤n?3 and n≥4, then there exists a hamiltonian cycle in Cay(Sn, B)?F. In this paper, we show that Cay(S_n, B)?F is bipancyclic if Cay(S_n, B) is not a star graph, for n≥4 and |F|≤n?3.