News Column

Findings in Information Technology Reported from Beijing University of Posts and Telecommunications (Classification of coverings in the finite...

July 22, 2014



Findings in Information Technology Reported from Beijing University of Posts and Telecommunications (Classification of coverings in the finite approximation spaces)

By a News Reporter-Staff News Editor at Information Technology Newsweekly -- Current study results on Information Technology have been published. According to news reporting out of Beijing, People's Republic of China, by VerticalNews editors, the research stated, "Based on the notions of neighborhood and complementary neighborhood, we consider the classification of coverings in the covering rough set theory. We present a classification rule under which the coverings on a universe U are classified such that for any given pair of neighborhood (or complementary neighborhood)-based lower and upper approximation operators on U, all the different coverings in the same class generate the same pair of lower and upper approximations of each X subset of U. We show that there is a one to one correspondence between the equivalence classes of coverings and the topologies of the universe."

Our news journalists obtained a quote from the research from the Beijing University of Posts and Telecommunications, "Thus the number of the equivalence classes of coverings is equal to the number of topologies of the universe, and therefore, this number is much smaller than that of the coverings. We also give an illustrative example to show how we can classify some given coverings by calculating the topologies. Moreover, based on the relationship between the neighborhood and the complementary neighborhood, we find that each class of coverings has a dual class, and each pair of approximation operators has a dual pair of approximation operators. For a finite universe, considering one pair of approximation operators under one equivalence class of coverings is equivalent to considering its dual approximation operator pair under the dual class of coverings."

According to the news editors, the research concluded: "Finally, we also present a sufficient condition under which, for any given pair of neighborhood-based lower and upper approximation operators, two coverings of the universe U generate the same pair of approximations of each X subset of U if and only if they belong to the same equivalence class."

For more information on this research see: Classification of coverings in the finite approximation spaces. Information Sciences, 2014;276():31-41. Information Sciences can be contacted at: Elsevier Science Inc, 360 Park Ave South, New York, NY 10010-1710, USA. (Elsevier - www.elsevier.com; Information Sciences - www.elsevier.com/wps/product/cws_home/505730)

Our news journalists report that additional information may be obtained by contacting L.W. Ma, Beijing Univ Posts & Telecommun, Sch Sci, Beijing 100876, People's Republic of China.

Keywords for this news article include: Asia, Beijing, Information Technology, People's Republic of China

Our reports deliver fact-based news of research and discoveries from around the world. Copyright 2014, NewsRx LLC


For more stories covering the world of technology, please see HispanicBusiness' Tech Channel



Source: Information Technology Newsweekly


Story Tools






HispanicBusiness.com Facebook Linkedin Twitter RSS Feed Email Alerts & Newsletters