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

6th International Conference on Risks and Security of Internet and Systems, CRiSIS 2011

作者： Feeney, Kevin Foley, Simon N. Brennan, Rob Intelligent Systems Lab Knowledge and Data Engineering Group Trinity College Dublin Ireland FAME Department of Computer Science University College Cork Ireland

ISBN: (纸本)9781457718915

Federated policy systems are required to support the emergent complexity and organizational heterogeneity of modern Internet service delivery. This paper presents a distributed policy management approach which utilizes a flexible, tree-based capability authority model to partition and delegate federated capabilities or services. A trust management model and a delegation logic is defined which supports secure decentralized policy reasoning and addresses performance overheads due to distributed rule evaluation, threats from malformed or malicious federated principals and allows flexibility with respect to delegation chain reduction or capability authority re-partitioning. The system is evaluated through a security analysis and a prototype implementation of a federated policy engineering framework based on this logic is described. This framework is based on public key certificates and an extension to the Keynote Trust Management language. It provides practical management services such as key discovery and certificate revocation in addition to the core capability delegation function. © 2011 IEEE.

关键词： Computer circuits

来源：评论

学校读者我要写书评

暂无评论

Multi-view random walk framework for search task discovery from click-through log 11

Multi-view random walk framework for search task discovery f...

引用

20th ACM Conference on Information and knowledge Management, CIKM'11

作者： Cui, Jianwei Liu, Hongyan Yan, Jun Ji, Lei Jin, Ruoming He, Jun Gu, Yingqin Chen, Zheng Du, Xiaoyong Key Labs. of Data Engineering and Knowledge Engineering School of Information Renmin University of China China Department of Management Science and Engineering Tsinghua University China Microsoft Research Asia Beijing China Computer Science Department Kent State University United States

ISBN: (纸本)9781450307178

Search engine users often have clear search tasks hidden behind their queries. Inspired by this, the modern search engines are providing an increasing number of services to help users simplify their key tasks. However, the problem of what are the major user search tasks with high traffic for which search engines should design special services is still underexplored. In this paper, we propose a novel Multi-view Random Walk (MRW) algorithm to measure the search task oriented similarity between queries, and then group search queries with similar tasks so that the major search tasks of users can be identified from search engine click-through log. The proposed MRW, which is a general framework to combine knowledge from different views in a random walk process, allows the random surfer to walk across different views to integrate information for search task discovery. Experimental results on click-through log of a commonly used commercial search engine show that our proposed MRW algorithm can effectively discover user search tasks. © 2011 ACM.

关键词： Search engines

来源：评论

学校读者我要写书评

暂无评论

Extract knowledge from semi-structured websites for search task simplification 11

Extract knowledge from semi-structured websites for search t...

引用

20th ACM Conference on Information and knowledge Management, CIKM'11

作者： Gu, Yingqin Yan, Jun Liu, Hongyan He, Jun Ji, Lei Liu, Ning Chen, Zheng Key Labs. of Data Engineering and Knowledge Engineering School of Information Renmin University of China Beijing China Microsoft Research Asia Beijing China Department of Management Science and Engineering Tsinghua University Beijing China

ISBN: (纸本)9781450307178

Simplifying the key tasks of search engine users by directly retrieving to them structured knowledge according to their queries is attracting much attention from both industry and academia. A bottleneck of this challenging problem is how to extract the structured knowledge from the noisy and complex Web scale websites automatically. In this paper, we propose an unsupervised automatic wrapper induction algorithm, named as Scalable knowledge Extractor from webSites (SKES). SKES induces the wrapper in a divide and conquer mode, i.e., it divides the general wrapper into several sub-wrappers to learn from the data independently. Moreover, through employing techniques such as tag path representation of Web pages, SKES is verified to be efficient and noise-tolerant by the experimental results. Furthermore, based on our automatically extracted knowledge, we also built a prototype to serve structured knowledge to end users for simplifying their key search tasks. Very positive feedbacks were received on the prototype. © 2011 ACM.

关键词： Websites

来源：评论

学校读者我要写书评

暂无评论

Large scale report generation in data consolidation environments of banks

引用

Huazhong Keji Daxue Xuebao (Ziran Kexue Ban)/Journal of Huazhong University of science and Technology (Natural science Edition) 2012年第SUPPL.1期40卷 5-8页

作者： Qin, Xiongpai Zhou, Xiaoyun Wu, Zhongxin Yang, Hongzhi Wang, Wei Ministry of Education Key Lab of Data Engineering and Knowledge Engineering Renmin University of China Beijing 100872 China Information School Renmin University of China Beijing 100872 China Computer Science Department Jiangsu Normal University Xuzhou 221116 Jiangsu China Beijing Nantian Software Co. Ltd. Beijing 100085 China

To generate large number of reports in a limited time window, four techniques were proposed, including ROLAP&SQL, Shared Scanning, Hadoop based Solution, and MOLAP&Cube Sharding, an algorithm that performs in memory aggregation was designed for the second solution. The experiment results show that all techniques except ROLAP&SQL can meet the time window constraint, the Hadoop based solution is a promising technique owe to its highly scalability. Considering maturity of the techniques and their performance, we put MOLAP&Cube Sharding into practice while keeping an eye on Hadoop for future adoption.

关键词： Custom report data consolidation Hadoop Large bank MOLAP ROLAP

来源：评论

学校读者我要写书评

暂无评论

A practice probability frequent pattern mining method over transactional uncertain data streams

A practice probability frequent pattern mining method over t...

引用

Lecture Notes in Computer science

作者： Liao, Guoqiong Wu, Linqing Wan, Changxuan Xiong, Naixue School of Information Technology Jiangxi University of Finance and Economics Nanchang 330013 China Jiangxi Key Laboratory of Data and Knowledge Engineering Nanchang 330013 China Department of Computer Science Georgia State University United States

ISBN: (纸本)9783642236402

In recent years, large amounts of uncertain data are emerged with the widespread employment of the new technologies, such as wireless sensor networks, RFID and privacy protection. According to the features of the uncertain data streams such as incomplete, full of noisy, non-uniform and mutable, this paper presents a probability frequent pattern tree called PFP-tree and a method called PFP-growth, to mine probability frequent patterns based on probability damped windows. The main characteristics of the suggested method include: (1) adopting time-based probability damped window model to enhance the accuracy of mined frequent patterns;(2) setting an item index table and a transaction index table to speed up retrieval on the PFP-tree;and (3) pruning the tree to remove the items that cannot become frequent patterns;. The experimental results demonstrate that PFP-growth method has better performance than the main existing schemes in terms of accuracy, processing time and storage space. © 2011 Springer-Verlag.

关键词： Probability

来源：评论

学校读者我要写书评

暂无评论

A comparison of content-based tag recommendations in folksonomy systems

引用

Lecture Notes in Computer science

作者： Illig, Jens Hotho, Andreas Jäschke, Robert Stumme, Gerd Knowledge and Data Engineering Group Department of Mathematics and Computer Science University of Kassel Wilhelmshöher Allee 73 34121 Kassel Germany Research Center L3S Appelstraße 9a 30167 Hannover Germany

ISBN: (纸本)9783642221392

Recommendation algorithms and multi-class classifiers can support users of social bookmarking systems in assigning tags to their bookmarks. Content based recommenders are the usual approach for facing the cold start problem, i.e., when a bookmark is uploaded for the first time and no information from other users can be exploited. In this paper, we evaluate several recommendation algorithms in a cold-start scenario on a large real-world dataset. © 2011 Springer-Verlag.

关键词： Computers

来源：评论

学校读者我要写书评

暂无评论

A study in the expressiveness of semantically different policy modelling schemes

A study in the expressiveness of semantically different poli...

引用

IFIP/IEEE International Symposium on Integrated Network Management

作者： Christos Tsarouchis Declan O'Sullivan David Lewis Knowledge & Data Engineering Group (KDEG) Department of Computer Science & Statistics Trinity College Dublin Dublin Ireland

ISBN: (纸本)9781424492190

Policy engineering is the process of authoring IT management policies, detecting and resolving policy conflicts and revising existing policies to accommodate changing IT resources, business goals and business processes. Policy authoring is often followed by policy enforcement where the actions specified by subjects are performed on targets (resources). In this paper, we study the use of semantically enhanced techniques, such as ontologies, to model resources and their corresponding actions, coupled with a mechanism that can accommodate frequent organizational change, to model policy subjects. For the modeling of policy subjects, the rule-based Community-based Policy management will be used. This integration falls into the category of combining Description Logics (DL) and Logic Programs (LP). We aim to study this integration primarily from the scope of overall system expressivity, but also from the scope of minimizing the cognitive load perceived by policy authors. Such an evaluation can help determine shortfalls in the design of the software system or of the policy model used. To study the balance in modeling with DL and LP techniques, the encoding of part of the Trinity College Dublin statutes will be performed, which is a sufficiently complex real-world example.

关键词： OWL Load modeling Ontologies Welding Analytical models Security Fires

来源：评论

学校读者我要写书评

暂无评论

Constant approximation for virtual backbone construction with Guaranteed Routing Cost in wireless sensor networks

Constant approximation for virtual backbone construction wit...

引用

IEEE Annual Joint Conference: INFOCOM, IEEE Computer and Communications Societies

作者： Hongwei Du Qiang Ye Weili Wu Wonjun Lee Deying Li Dingzhu Du Stephen Howard Department of Computer Science and Information Technology University of Prince Edward Island Canada Department of Computer Science University of Texas Dallas USA Department of Computer Science and Engineering Korea University Seoul South Korea Key Laboratory of Data Engineering and Knowledge Engineering MOE Renmin University of China China

ISBN: (纸本)9781424499199

In wireless sensor networks, virtual backbone construction based on connected dominating set is a competitive issue for routing efficiency and topology control. Assume that a sensor networks is defined as a connected unit disk graph (UDG). The problem is to find a minimum connected dominating set of given UDG with minimum routing cost for each node pair. We present a constant approximation scheme which produces a connected dominating set D, whose size |D| is within a factor α from that of the minimum connected dominating set and each node pair exists a routing path with all intermediate nodes in D and with length at most 5 · d(u,v), where d(u,v) is the length of shortest path of this node pair. A distributed algorithm is also provided with analogical performance. Extensive simulation shows that our distributed algorithm achieves significantly than the latest solution in research direction.

关键词： Routing Approximation methods Distributed algorithms Wireless sensor networks Polynomials Computer science Electronic mail

来源：评论

学校读者我要写书评

暂无评论

A trust model for capability delegation in federated policy systems

A trust model for capability delegation in federated policy ...

引用

International Conference on Risks and Security of Internet and Systems, CRiSIS

作者： Kevin Feeney Simon N. Foley Rob Brennan FAME and Knowledge & Data Engineering Group Intelligent Systems Laboratory Trinity College Dublin Ireland FAME and Department of Computer Science University College Cork Cork Ireland

关键词： Information services Public key Internet Semantics Authorization Web and internet services

来源：评论

学校读者我要写书评

暂无评论

Modeling techniques for multi-level abstraction

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) 2011年 6520卷 68-92页

作者： Neumayr, Bernd Schrefl, Michael Thalheim, Bernhard Department of Business Informatics - Data and Knowledge Engineering Johannes Kepler University Linz Altenberger Straße 69 4040 Linz Austria Department of Computer Science and Applied Mathematics Christian Albrechts University Kiel Olshausenstr. 40 24098 Kiel Germany

ISBN: (纸本)9783642175046

Employing multi-level abstraction in modeling refers to representing objects at multiple levels of one or more abstraction hierarchies, mainly classification, aggregation and generalization. Multiple representation, however, leads to accidental complexity, complicating modeling and extension. Several modeling techniques, like powertypes, deep instantiation, materialization, m-objects, HERM, and the component model may be used to reduce unnecessary complexity with multilevel abstraction. This chapter compares these modeling techniques using four comparison criteria: (1) compactness (modular and redundancyfree models), (2) query flexibility (number and kind of pre-defined entrypoints for querying), (3) heterogeneous level-hierarchies, and (4) multiple relationship-abstractions (such as between relationship occurrence and relationship type). © 2011 Springer-Verlag Berlin Heidelberg.

关键词： Abstracting

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：