检索结果-内蒙古大学图书馆

作者： Li, Yuefeng Zhong, Ning School of Software Engineering and Data Communications Queensland University of Technology Brisbane QLD 4001 Australia Department of Systems and Information Engineering Maebashi Institute of Technology Maebashi 371-0816 Japan

ISBN: (纸本)0769519784

This paper presents interpretations for association rules. It first introduces Pawlak's method, and the corresponding algorithm of finding decision rules (a kind of association rules). It then uses extended random sets to present a new algorithm of finding interesting rules. It proves that the new algorithm is faster than Pawlak's algorithm. The extended random sets are easily to include more than one criterion for determining interesting rules. They also provide two measures for dealing with uncertainties in association rules. © 2003 IEEE.

关键词： Association rules

来源：评论

学校读者我要写书评

暂无评论

Web based collection selection using singular value decomposition 03

Web based collection selection using singular value decompos...

引用

IEEE WIC ACM International Conference on Web Intelligence (WI)

作者： J. King Yuefeng Li School of Software Engineering and Data Communications Queensland University of Technology QLD Australia

ISBN: (纸本)9780769519326

As the number of electronic data collections available on the Internet increases, so does the difficulty of finding the right collection for a given query. Often the first time user is overwhelmed by the array of options available, and wastes time hunting through pages of collection names, followed by time reading results pages after doing an ad-hoc search. Automatic collection selection methods try to solve this problem by suggesting the best subset of collections to search based on a query. This is of importance to fields containing large number of electronic collections, which undergo frequent change, and collections that cannot be fully indexed using traditional methods such as spiders. We present a solution to this problem of selecting the best collections and reducing the number of collections needing to be searched. Preliminary tests of the system, conducted on Web search engines, suggest that this solves much of the Web based Collection selection problem.

关键词： Singular value decomposition Internet Search engines Indexing Bandwidth Frequency estimation Feedback software engineering data communication Australia

来源：评论

学校读者我要写书评

暂无评论

Agent-based privilege negotiation for E-commerce on World Wide Web

Lecture Notes in Computer Science (including subseries Lectu...

引用

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2003年 2722卷 68-71页

作者： Au, Richard Yao, Ming Looi, Mark Information Security Research Centre School of Software Engineering and Data Communications Queensland University of Technology Brisbane QLD 4001 Australia

来源：评论

学校读者我要写书评

暂无评论

Privilege negotiation agents for distributed authorisation on World Wide Web

Privilege negotiation agents for distributed authorisation o...

引用

IEEE/WIC/ACM International Conference on Intelligent Agent Technology (IAT)

作者： R. Au Ming Yao M. Looi Information Security Research Centre School of Software Engineering and Data Communications Queensland University of Technology QLD Australia

Privilege negotiation agents migrate from the security servers of different administrative domains on the Internet to the user's secure client agent environment. They work cooperatively for trust establishment and authorisation in an automated way. Agent communication protocols are expressed through the Knowledge Query and Manipulation Language (KQML). Security issues for interaction between agents are discussed. The user-centred approach enables a user to enforce his own privacy policies during the privilege negotiation process.

关键词： Authorization Web sites Access protocols Access control Environmental management Information security Privacy Web and internet services Credit cards Conference management

来源：评论

学校读者我要写书评

暂无评论

Ontology-based Web mining model: representations of user profiles 03

Ontology-based Web mining model: representations of user pro...

引用

IEEE WIC ACM International Conference on Web Intelligence (WI)

作者： Y. Li N. Zhong School of Software Engineering and Data Communications Queensland University of Technology QLD Australia Department of Systems and Information Engineering Meabashi Institute of Technology Japan

ISBN: (纸本)9780769519326

Web mining is used to search the right information from the Web to meet user information needs. Acquiring correct user profiles is difficult, since users may be unsure of their interests and may not wish to invest a great deal of effort in creating such a profile. Our aim is to present a foundation for representations of user profiles on ontology for designing efficient Web mining models. We assume the user concept can be constructed from some primary ones; hence, we use "part-of" relation to describe the relationships between classes. We also present set-valued relevance functions on such ontology to unravel the relationships between facts and the existing classes. A numerical interpretation is also presented for the set-valued relation functions.

关键词： Ontologies Web mining Artificial intelligence data mining Information retrieval XML software engineering data communication data engineering Systems engineering and theory

来源：评论

学校读者我要写书评

暂无评论

Interpretations of association rules by granular computing

Interpretations of association rules by granular computing

引用

IEEE International Conference on data Mining (ICDM)

作者： Y. Li N. Zhong School of Software Engineering & Data Communications Queensland University of Technology Brisbane QLD Australia Department of Systems and Information Engineering Maebashi Institute of Technology Maebashi Japan

We present interpretations for association rules. We first introduce Pawlak's method, and the corresponding algorithm of finding decision rules (a kind of association rules). We then use extended random sets to present a new algorithm of finding interesting rules. We prove that the new algorithm is faster than Pawlak's algorithm. The extended random sets are easily to include more than one criterion for determining interesting rules. We also provide two measures for dealing with uncertainties in association rules.

关键词： Association rules Road accidents data mining Frequency databases Road vehicles Vehicle driving software engineering data communication Australia

来源：评论

学校读者我要写书评

暂无评论

A design pattern for Web-based parallel genetic algorithms

A design pattern for Web-based parallel genetic algorithms

引用

IEEE Region 10 International Conference TENCON

作者： Maolin Tang School of Software Engineering and Data Communications Queensland University of Technology Brisbane QLD Australia

ISBN: (纸本)0780374908

Aiming at developing more efficient and robust genetic algorithms (GA) over the Internet, a new asynchronous, coarse-grain parallel genetic algorithm model is proposed in this paper. On the basis of the model, we present a design pattern for Web-based parallel GA, which captures design solutions to core problems in implementing Web-based parallel GA. This design pattern can achieve high degree of parallelism, can handle the high communication latency and low communication bandwidth problems of the Internet, and can contribute to building more robust Web-based parallel GA.

关键词： Algorithm design and analysis Genetic algorithms Internet Robustness Local area networks IP networks Computer networks Concurrent computing Delay Topology

来源：评论

学校读者我要写书评

暂无评论

User profile model: A view from artificial intelligence 3rd

User profile model: A view from artificial intelligence

引用

3rd International Conference on Rough Sets and Current Trends in Computing, RSCTC 2002

作者： Li, Yuefeng Yao, Y.Y. School of Software Engineering and Data Communications Queensland University of Technology BrisbaneQLD4001 Australia Department of Computer Science University of Regina Regina SKS4S 0A2 Canada

ISBN: (纸本)9783540442745

The goal of this paper is to develop a user profile model for agent-based information filtering. We try to formalize the whole process of information filtering from an Artificial Intelligence point view. This research is related to develop novel techniques for interactive information gathering with the application of Artificial Intelligence, and Information Retrieval technologies. In this paper, we present a dynamical model to represent user profiles. We describe the user profiles as random sets on a concept space (taxonomy). We also present a rough set based qualitative decision model for the task of information filtering. © Springer-Verlag Berlin Heidelberg 2002.

关键词： Information filtering

来源：评论

学校读者我要写书评

暂无评论

Advanced mean field methods: theory and practice

引用

Neurocomputing 2002年第1-4期48卷 1057-1060页

作者： James M Hogan School of Software Engineering and Data Communications Queensland University of Technology GPO Box 2434 Brisbane Qld 4001 Australia

来源：评论

学校读者我要写书评

暂无评论

ON A METHOD OF CRYPTANALYSIS FOR CRYPTOSYSTEM WITH INVOLUTION

引用

ELECTRONICS AND communications IN JAPAN PART III-FUNDAMENTAL ELECTRONIC SCIENCE 1995年第5期78卷 1-11页

作者： TSUNOO, Y OKAMOTO, E UEMATSU, T Member NEC Software Hokuriku Ltd. Ishikawa Japan 920-21 School of Information Science Japan Advanced Institute of Science and Technology Ishikawa Japan 923-12 Members Tomohiko Uyematsu graduated in Electrical Engineering from Tokyo Institute of Technology in 1982 and received a Master's degree from the same university in 1984 after whichhe became an assistant in the Electrical and Electronics Engineering Department there. In1990 he became a Lecturer and in 1991 an Assistant Professor. In 1992 he became Assistant Professor at the School of Information Science Japan Advanced Institute of Science and Technology. He holds a doctorate in engineering. Among his research interests are signal theory optical communications theory coding theory and data compression algorithms. In 1988 he received a Shinohara Commemorative Science Encouragement Prize and in 1992 a Best Paper Award. He is the author of the bookIntroduction to Record Data Compression Algorithms. He is a member of the Measurement Control Society and the Society for Information Theory and Its Applications.

Cryptology provides the technological basis for guaranteed network security. In the field of business, to guarantee the security of information, everyone needs easy-to-use cryptology. Starting with the announcement by the U.S. National Bureau of Standards of the DES cryptosystem and the proposal by NTT of the FEAL cryptosystem, secret-key cryptographic algorithms have been published, involution-type block cryptosystems which use secret key to encipher 64 bits of plain text as 64 bits of cipher text [2, 3, 9, 10, 12]. NTT has proposed the one-way function MAP, which is also an involution-type transform. In this paper, we study a new cryptanalytic method for involution-type cryptosystems and show by example that it can be applied practically in a ciphertext-only attack on the one-way function MAP. For an involution-type cryptosystem, by increasing the amount of construction in the data-randomization phase and by increasing the size of the secret key, we can guarantee the computational security by preventing the estimation of the secret key. However, if we study the properties of the function used in the design of the data-randomization phase, by specifying input/output values of the function which are independent of the secret key, it may be possible to use the inverse function [11] to calculate the secret key. This method is called the intermediate cipher method. The intermediate cipher method differs from previous methods in the small quantity of data required for breaking.

关键词： INVOLUTION BLOCK CIPHER INTERMEDIATE CIPHER CIPHERTEXT-ONLY ATTACKS

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：