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

作者： Meng, Shicong Shao, Yifeng Shi, Cong Han, Dingyi Yu, Yong APEX Data and Knowledge Management Lab. Department of Computer Science and Engineering Shanghai Jiao Tong University Shanghai 200030 China

ISBN: (纸本)0769527027

Many previous works of data mining user queries in Peer-to-Peer systems focused their attention on the distribution of query contents. However, few has been done towards a better understanding of the time series distribution of these queries, which is vital for system performance. To remedy this situation, this paper mines query steams by using automatic time series analysis to evaluate different linear models(Box-Jenkins models and some simple windowed-mean models) for predicting the number of duplicated queries from 10 minutes to 2 hours into the future. Both the predictive power and the computational costs of these models are evaluated over 318,942,450 real world Gnutella queries collected over 3 months. We find the number of duplicated queries is consistently predictable. Simple, practical models like AR perform well on prediction. © 2006 IEEE.

关键词： Time series analysis

来源：评论

学校读者我要写书评

暂无评论

Depth-first algorithm of finding all association rules generated by a frequent itemset

引用

Journal of Donghua University (English Edition) 2006年第6期23卷 1-4+9页

作者： Wu, Kun Jiang, Bao-Qing Wei, Qing Institute of Data and Knowledge Engineering Henan University Kaifeng 475001 China Personnel Department Zhengzhou Institute of Aeronautical Industry Management Zhengzhou 450000 China Computer Science Department Henan University of Finance and Economics Zhengzhou 450000 China

The classical algorithm of finding association rules generated by a frequent itemset has to generate all nonempty subsets of the frequent itemset as candidate set of consequents. Xiongfei Li aimed at this and proposed an improved algorithm. The algorithm finds all consequents layer by layer, so it is breadth-first. In this paper, we propose a new algorithm Generate Rules by using Set-Enumeration Tree (GRSET) which uses the structure of Set-Enumeration Tree and depth-first method to find all consequents of the association rules one by one and get all association rules correspond to the consequents. Experiments show GRSET algorithm to be practicable and efficient.

关键词： Association rules

来源：评论

学校读者我要写书评

暂无评论

A framework for specification and performance evaluation of service discovery protocols in mobile ad-hoc networks

引用

Ad Hoc Networks 2006年第1期4卷 1-23页

作者： Shenoi, Avinash Yesha, Yelena Yesha, Yaacov Joshi, Anupam Department of Computer Science and Electrical Engineering University of Maryland Baltimore County 1000 Hilltop Circle Baltimore MD 21250 United States Ebiquity Research Group Department of Computer Science and Electrical Engineering University of Maryland Baltimore County IEEE Transaction on Knowledge and Data Engineering IEEE ACM UMBC IEEE Transactions of Fuzzy Systems IEEE IEEE-CS ACM

Service discovery protocols are extremely important for developing distributed applications in ad-hoc environments. However to perform Service Discovery in mobile ad-hoc networks requires the design and development of extremely complex and dynamic systems. This requires a paradigm shift in the methodologies employed to design and evaluate these systems so as to ensure quality and correctness. Currently there exists no generic method for formally specifying these systems. Due to this it is extremely difficult to formally analyze protocols in this domain to study and observe the behavior. The same issue also hinders comparison of different protocols against a fixed set of metrics. In this work we propose a framework for the formal specification of service discovery protocols in mobile ad-hoc networks. The purpose of this framework is to provide a formal basis for performance evaluation and behavioral study of these protocols. This allows different service discovery architectures to be evaluated against a given set of metrics, a generic way to specify protocols and an automated process for performance evaluation and behavioral study. © 2004 Elsevier B.V. All rights reserved.

关键词： Network protocols

来源：评论

学校读者我要写书评

暂无评论

Dynamic ontology integration in a multi-agent environment

Dynamic ontology integration in a multi-agent environment

引用

International Conference on Advanced Information Networking and Applications (AINA)

作者： S.M. Deen K. Ponnamperuma Data and Knowledge Engineering DAKE Group Department of Computer Science University of Keele UK

We present here an approach for dynamic ontology integration for a multi-agent environment, in which each agent holds the ontologies of its acquaintances (i.e., other agents of its interest) as the integrated partial global ontology, which is essential to interpret the local schemas for inter-agent operations. This integration has to be carried out whenever a new acquaintance is added or when the local ontology of an acquaintance changes. The approach described is general (i.e., independent of any particular thesaurus) and it carries out the integration automatically except for minimal unavoidable human inputs to resolve semantic conflicts if discovered in the process.

关键词： Ontologies Thesauri Humans Semantic Web Peer to peer computing Multiagent systems knowledge engineering Computer science Shape Scalability

来源：评论

学校读者我要写书评

暂无评论

A Framework for the Decentralisation and Management of Collaborative Applications in Ubiquitous Computing Environments

A Framework for the Decentralisation and Management of Colla...

引用

IEEE Symposium on Network Operations and Management

作者： K. Quinn A. Kenny K. Feeney D. Lewis D. O'Sullivan V.P. Wade Knowledge & Data Engineering Group Department of Computer Science Trinity College Dublin Dublin Ireland

When deploying collaborative applications such as instant messaging in ubiquitous computing environments significant enhancements can be afforded by offering additional context information, such as location information. However, such environments exert key challenges such as increased diversity of ownership and ad hoc, intermittent network connectivity that suits more decentralized computing architectures. This paper examines how a migration to a more decentralized collaborative architecture can be achieved together with a decentralization of the management of collaborative activities

关键词： Environmental management Collaboration Ubiquitous computing Access control Application software Computer architecture Routing Humans Content management Peer to peer computing

来源：评论

学校读者我要写书评

暂无评论

Benchmarking knowledge-based Context Delivery Systems

Benchmarking Knowledge-based Context Delivery Systems

引用

International Conference on Autonomic and Autonomous Systems (ICAS)

作者： J. Keeney D. Lewis D. O'Sullivan Knowledge & Data Engineering Group and CTVR Department of Computer Science Trinity College Dublin Dublin Ireland

As context-aware systems become more widespread and mobile there is an increasing need for a common distributed event platform for gathering context information and delivering to context-aware applications. The likely heterogeneity across the body of context information can be addressed using runtime reasoning over ontology-based context models. However, existing knowledge-based reasoning is not typically optimised for real-time operation so its inclusion in any context delivery platform needs to be carefully evaluated from a performance perspective. In this paper we propose a benchmark for knowledge-based context delivery platforms and in particular examine suitable knowledge benchmarks for assessing the ability of platforms to deal with semantic interoperability

关键词： Context-aware services Ontologies Pervasive computing Context modeling Temperature sensors Acoustic sensors knowledge management Publish-subscribe data engineering Computer science

来源：评论

学校读者我要写书评

暂无评论

Reinforcement Learning for Query-Oriented Routing Indices in Unstructured Peer-to-Peer Networks

Reinforcement Learning for Query-Oriented Routing Indices in...

引用

International Conference on Peer-to-Peer Computing

作者： Cong Shi Shicong Meng Yuanjie Liu Dingyi Han Yong Yu Apex Data and Knowledge Management Laboratory Department of Computer Science and Engineering Shanghai Jiaotong University Shanghai China

The idea of building query-oriented routing indices has changed the way of improving routing efficiency from the basis as it can learn the content distribution during the query routing process. It gradually improves routing efficiency with no excessive network overhead of the routing index construction and maintenance. However, the previously proposed mechanism is not practically effective due to the slow improvement of routing efficiency. In this paper, we propose a novel mechanism for query-oriented routing indices which quickly achieves high routing efficiency at low cost. The maintenance method employs reinforcement learning to utilize mass peer behaviors to construct and maintain routing indices. It explicitly uses the expected value of returned content number to depict the content distribution, which helps quickly approximate the real distribution. Meanwhile, the routing method is to retrieve as many contents as possible. It also helps speed up the learning process further. The experimental evaluation shows that the mechanism has high routing efficiency, quick learning ability and satisfactory performance under churn

关键词： Learning Routing Peer to peer computing Query processing Buildings knowledge management Computer science data engineering knowledge engineering Costs

来源：评论

学校读者我要写书评

暂无评论

Mining and Predicting Duplication over Peer-to-Peer Query Streams

Mining and Predicting Duplication over Peer-to-Peer Query St...

引用

IEEE International Conference on data Mining Workshops (ICDM Workshops)

作者： Shicong Meng Yifeng Shao Cong Shi Dingyi Han Yong Yu APEX Data and Knowledge Management Laboratory Department of Computer Science and Engineering Shanghai Jiaotong University Shanghai China

Many previous works of data mining user queries in peer-to-peer systems focused their attention on the distribution of query contents. However, few has been done towards a better understanding of the time series distribution of these queries, which is vital for system performance. To remedy this situation, this paper mines query steams by using automatic time series analysis to evaluate different linear models (Box-Jenkins models and some simple windowed-mean models) for predicting the number of duplicated queries from 10 minutes to 2 hours into the future. Both the predictive power and the computational costs of these models are evaluated over 318,942,450 real world Gnutella queries collected over 3 months. We find the number of duplicated queries is consistently predictable. Simple, practical models like AR perform well on prediction

关键词： Peer to peer computing Predictive models Power system modeling data mining System performance Crawlers Time series analysis Computational efficiency Load management knowledge management

来源：评论

学校读者我要写书评

暂无评论

Cuckoo Ring: BalancingWorkload for Locality Sensitive Hash

Cuckoo Ring: BalancingWorkload for Locality Sensitive Hash

引用

International Conference on Peer-to-Peer Computing

作者： Dingyi Han Ting Shen Shicong Meng Yong Yu Apex Data & Knowledge Management Laboratory Department of Computer Science & Engineering Shanghai Jiaotong University Shanghai China

Locality sensitive hash (LSH) is widely used in peer-to-peer (P2P) systems. Although it can support range or similarity queries, it breaks the load balance mechanism of traditional distributed hash table (DHT) based system by replacing consistent hash with LSH. To solve the imbalance problem, current systems either weaken the locality preserve ability from similarity preserved to order preserved or adopt load aware peer join mechanism. The first method does not support similarity query as it loses the similarity information and the second method is greatly affected by the dynamic nature of P2P networks. In this paper, we propose a novel system, cuckoo ring, which can preserve similarity information while load balanced. It does not guide the newly joining peer to the hot areas but move the items in the hot areas to cold areas so that the short life time peers are distributed uniformly across the network instead of being guided to the hot areas. Compared to traditional DHT systems, cuckoo ring only maintains a little more information about the global light load peers and the moved indexed items

关键词： Indexing Load management knowledge management Computer science data engineering knowledge engineering Nearest neighbor searches Q measurement

来源：评论

学校读者我要写书评

暂无评论

Information retrieval in folksonomies: Search and ranking

引用

3rd European Semantic Web Conference, ESWC 2006

作者： Hotho, Andreas Jäschke, Robert Schmilz, Christoph Stumme, Gerd Knowledge and Data Engineering Group Department of Mathematics and Computer Science University of Kassel Wilhelmshöher Allee 73 D-34121 Kassel Germany Research Center L3S Expo Plaza 1 D-30539 Hannover Germany

ISBN: (纸本)3540345442

Social bookmark tools are rapidly emerging on the Web. In such systems users are setting up lightweight conceptual structures called folksonomies. The reason for their immediate success is the fact that no specific skills are needed for participating. At the moment, however, the information retrieval support is limited. We present a formal model and a new search algorithm for folksonomies, called FolkRank, that exploits the structure of the folksonomy. The proposed algorithm is also applied to find communities within the folksonomy and is used to structure search results. All findings are demonstrated on a large scale dataset. © Springer-Verlag Berlin Heidelberg 2006.

关键词： Information retrieval systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：