| 一种基于类测试的基类MaDUM算法的改进 |
| |
| 引用本文： | 冯学勇,缪淮扣. 一种基于类测试的基类MaDUM算法的改进[J]. 上海大学学报(自然科学版), 2004, 10(1): 52-55,74 |
| |
| 作者姓名： | 冯学勇 缪淮扣 |
| |
| 作者单位： | 上海大学,计算机工程与科学学院,上海,200072;上海大学,计算机工程与科学学院,上海,200072 |
| |
| 基金项目： | 国家自然科学基金 (6 0 1 73 0 3 0 ),上海市教委科学与技术发展基金 (0 2AK0 8)资助项目 |
| |
| 摘 要： | Imran Bashir和AmritL．Goel曾提出过一种对单元类进行测试的方法,为此,他们提出了基类MaDUM算法．本文针对基类MaDUM算法,提出了改进的基类MaDUM算法．在改进的算法中避免了对集合U进行逐步的迭代,而是用一个递归的算法求出MaDUM矩阵,提高了算法的可理解性．同时对冗余元素作了单独的处理,给出了查找冗余元素的算法．在文章的结尾,我们通过实例用提出的算法得出了同样的结果．
|
| 关 键 词： | MaDUM算法 MaDUM矩阵 冗余元素 |
| 文章编号： | 1007-2861(2004)01-0052-04 |
| 修稿时间： | 2003-05-26 |
An Improved Base MaDUM Algorithm Based on Class Test |
| |
| FENG Xue-yong,MIAO Huai-kou. An Improved Base MaDUM Algorithm Based on Class Test[J]. Journal of Shanghai University(Natural Science), 2004, 10(1): 52-55,74 |
| |
| Authors: | FENG Xue-yong MIAO Huai-kou |
| |
| Abstract: | Based on the base MaDUM algorithm developed by Bashir and Goel, this paper presents an improved base MaDUM algorithm. Bashir and Goel give a pseudo algorithm to generate the final (MaDUM) matrix by dealing with the set U in a step-by-step iterative and circular manor. Another algorithm is used to search the redundant elements in the MaDUM matrix and remove them from the matrix. In this paper a recursive algorithm is used to obtain the MaDUM matrix. The redundant elements are dealt with separately. Finally the proposed algorithm is compared with that of Bashir et al. and comments on the algorithm are made. |
| |
| Keywords: | MaDUM algorithm MaDUM matrix redundant element |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
