检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]合肥工业大学计算机与信息学院,合肥230009
出 处:《南京大学学报(自然科学版)》2011年第5期594-604,共11页Journal of Nanjing University(Natural Science)
摘 要:形式化概念分析已被证明是一种支持模块重组的有效工具.然而,在使用概念分析进行模块重组时,仍存在一些问题有待进一步解决.本文提出一种自动化的遗留软件重组方法,用于从识别的模块化方案中获取一种最佳解决方案.通过在概念分析过程中引入概念抽象、哑概念和概念相似性度量等新的特性,有助于解决现有方法的不足.概念抽象用于表示候选模块,它消除了对概念外延的约束;概念相似性度量用于解决概念间的重叠问题;哑概念有助于减少人工干预,提高模块重组的自动化程度.本文给出算法的具体实现,并使用实验对方法的有效性进行了验证.Although formal concept analysis(FCA) has been proved to be an effective tool supporting module restructuring,some problems have yet to be resolved.This paper presents an approach focused on automated support for restructuring modules existing in legacy software.Three new features,concept abstraction,dummy concepts and similarity measure are explored to identify candidates of modules and select a best one among these candidates during concept analysis.Concept abstraction is introduced to represent a potential module,removing the over-restrictive constraints on concept extents.A new similarity measure is defined to classify concepts if concepts overlap in a lattice.It is studied specifically from information entropy perspective.The dummy concept is proposed to minimize human intervention and increase the degree of automation of module restructuring.A concrete algorithm implementation is proposed and several experiments are conducted to validate the effectiveness of the approach.
分 类 号:TP311[自动化与计算机技术—计算机软件与理论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.33