On L. N. Shevrin's Problem

In this short paper,our purpose is to give an affirmative answer to a problem raised by L.N.Shevrin in [1] for some special cases.

The Semimodularity of Cardinal Power of Posets

Let X,Y be any posets,the semimodularity of cardinal power Yx with base Y and exponent X is studied. Some necessary or sufficient conditions for Yx to be semimodular are gaven,

一种用于移动计算的约束频繁邻近类别集挖掘算法

在移动计算中挖掘满足用户需求的长频繁邻近类别集时,为了避免产生冗余候选项和减少重复计算量,提出一种基于幂集数递减的约束频繁邻近类别集挖掘算法,其能够提取包含约束条件的长频繁邻近类别集;该算法用幂集数递减序列来产生候选频繁邻近类别集,有效地删除了不满足用户需求的冗余候选项和减少了重复扫描空间实例的计算量.实验表明在挖掘满足用户需求的长频繁邻近类别集时,该算法比现有算法更快速.