检索结果-南通市图书馆

A method of combining SE-tree to compute all minimal hitting sets

Progress in Natural Science:Materials International 2006年第2期16卷 169-174页

作者： ZHAO Xiangfu and OUYANG Dantong (School of Computer Science and Technology, Jilin University, Changchun 130012, China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education, Changchun 130012, China) School of Computer Science and Technology Jilin University Changchun 130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Changchun 130012 China

In model-based diagnosis, the candidate diagnostic results are generally characterized by all minimal hitting sets for the collection of all conflict sets. In this paper, a new method is proposed to judge a hitting set by the number of conflict sets corresponding to components, and the computing procedure is formalized by combining revised SE-tree (set enumeration tree) with closed nodes to generate all minimal hitting sets. Results show that because closed nodes are added into SE-tree, the search efficiency is highly improved. Furthermore, the proposed method is easy to be understood and implemented. Compared with other effective algorithms with completeness in some experimental tests, the diagnosis efficiency of our proposed method is higher, particularly for single- and double-fault diagnosis.

关键词： model-based diagnosis conflict set minimal hitting set set enumeration tree.

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

RDF(S) repository privacy protection via inference control

引用

Journal of Beijing Institute of Technology 2014年第4期23卷 495-501页

作者：薛金蓉郑军安秋生 School of Computer Science and Technology Beijing Institute of Technology Beijing Key Laboratory of Software Security Engineering Technology Beijing Institute of Technology School of Mathematics and Computer Science Shanxi Normal University

The privacy protection of resource description framework （schema）（RDF（S）） repository is an emerging topic in database security area. In this paper, entailment rules are investigated based on RDF（S） repository firstly. Then, an idea that uses reasoning closure to judge whether the privacy disclosure caused by inference is existed is proposed. Furthermore, the definitions of impli- cation conditions and information measure of triple statements which gains data hiding algorithm with combining proposition logic reasoning theory are introduced. Meanwhile, a conversion method from conjunctive normal form to disjunctive normal form based minimal hitting sets of set cluster is aiso proposed. Finally, the experimental results show that our algorithm can prevent privacy disclosure of RDF（S） repository effectively.

关键词： resource description framework (RDF) reasoning closure privacy disclosure infor-mation measure entailment rule minimal hitting set

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

欢迎您,

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：