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

作者： Qin, Xiongpai Xiaoyun, Zhou Key Laboratory of Data Engineering and Knowledge Engineering School of Information Renmin University of China Beijing 100872 China Department of Computer Science and Technology Xuzhou Normal University Xuzhou Jiangsu 221008 China

ISBN: (纸本)9788988678183

In update intensive main memory database applications, huge volume of log records is generated, to maintain the ACID properties of the database system, the log records should be persistent efficiently. Delegating logging of one main memory database to another main memory database is proposed. The scheme is elaborated in detail in terms of architecture, logging & safeness levels, checkpointing, and recovery. Strict durability and relax durability are provided. When some form of non-volatile memory is used to temporarily holding log records, not only logging efficiency is improved, but also the scheme could guarantee full ACID of the system. We also propose using parallel logging to speedup log persistence by writing logs to multiple disks in parallel. Since interconnection network techniques progress by leaps and bounds, the scheme eliminates the concern about whether the system's overall performance may be slowed down by bandwidth and latency limitations. Experiment results demonstrate the feasibility of the proposal.

关键词： Interconnection networks (circuit switching)

来源：评论

学校读者我要写书评

暂无评论

Towards explanation-aware social software: Applying the mining and analysis continuum of explaining

Towards explanation-aware social software: Applying the mini...

引用

5th International Workshop on Explanation-Aware Computing, ExaCt 2010

作者： Atzmueller, Martin Roth-Berghofer, Thomas University of Kassel Knowledge and Data Engineering Group Wilhelmshöher Allee 73 34121 Kassel Germany GmbH Trippstadter Straße 122 67663 Kaiserslautern Germany Knowledge-Based Systems Group Department of Computer Science University of Kaiserslautern P.O. Box 3049 67653 Kaiserslautern Germany

data mining methods build patterns or models. When presenting these, all or part of the result needs to be explained to the user in order to be understandable and for increasing the user acceptance of the patterns. In doing that, a variety of dimensions in the Mining and Analysis Continuum of Explaining (MACE) needs to be considered, e.g., from concrete to more abstract explanations. This paper discusses the application of the MACE in the context of social software. We consider applications of the proposed approaches in three social software systems, and show how the data mining results can seamlessly be analysed on the presented continuous dimensions and levels.

关键词： Application programs

来源：评论

学校读者我要写书评

暂无评论

Two novel semantics of top-k queries processing in uncertain database

Two novel semantics of top-k queries processing in uncertain...

引用

10th IEEE International Conference on Computer and Information Technology, CIT-2010, 7th IEEE International Conference on Embedded Software and Systems, ICESS-2010, 10th IEEE Int. Conf. Scalable Computing and Communications, ScalCom-2010

作者： Liu, Dexi Wan, Changxuan Xiong, N. Yang, Laurence T. Chen, Lei Jiangxi Key Laboratory of Data and Knowledge Engineering School of Information Technology Jiangxi University of Finance and Economics Nanchang China Department of Computer Science Georgia State University Atlanta GA United States Department of Computer Science St. Francis Xavier University Antigonish NS Canada Department of Computer Science HK University of Science and Technology Hong Kong Hong Kong

ISBN: (纸本)9780769541082

Top-k query is a powerful technique in uncertain databases because of the existence of exponential possible worlds, and it is necessary to combine score and confidence of tuples to derive top k answers. Different semantics, the combination methods of score and confidence, lead to different results. U-kRanks and Global Top-k are two semantics of Topk queries in uncertain database, which consider every alternative in x-tuple as single one and return the tuple which has the highest probability appearing at top k or a given rank. However, no matter which alternative (tuple) of an x-tuple appears in a possible world, it undoubtedly believes that this xtuple appears in the same possible world accordingly. Thus, instead of ranking every individual tuple, we define two novel Top-k queries semantics in uncertain database, Uncertain xkRanks queries (U-x-kRanks) and Global x-Top-k queries (Gx- Top-k), which return k entities according to the score and the confidence of alternatives in x-tuple, respectively. In order to reduce the search space, we present an efficient algorithm to process U-x-kRanks queries and G-x-Top-k queries. Comprehensive experiments on different data sets demonstrate the effectiveness of the proposed solutions. © 2010 IEEE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Trust Service Discovery by Opinions Classification on Virtual Communities

Trust Service Discovery by Opinions Classification on Virtua...

引用

International Conference on Networks Security, Wireless Communications and Trusted Computing, NSWCTC

作者： Qing Zhu Department of Computer Science Information School Key Laboratory of Data Engineering and Knowledge Engineering Renmin University of China Beijing China

ISBN: (纸本)9781424465972;9780769540115

Internet has become an excellent ecommerce platform for bringing together large numbers of buyers and sellers across wide geographic regions. Trust and reputation systems represent a. significant trend in decision support for Internet mediated service provision. However, most existing work assumes that all users have the same trust metrics, but in real life different users often have different preference of product attributes. This paper proposes trusted query navigation model by analyzing online customer reviews of trustworthiness of websites. The first step analyzes counting history feedback in the system offline and generates dynamic trust model by opinion classification. The second step presents trust evaluation ranking to help the user can easily discovery trust service of matching his needs. The experimental evaluation shows that the trusted query evaluation ranking has high trading efficiency, quick learning ability and satisfactory performance.

关键词： Business Feedback Portals History Web services Computer security data security Information security Wireless communication Computer networks

来源：评论

学校读者我要写书评

暂无评论

Capability description and discovery of Internetware entity

引用

science China(Information sciences) 2010年第4期53卷 685-703页

作者： WANG PuWei1*, JIN Zhi2,3* & LIU HongYan4 1Key Laboratory of data engineering and knowledge engineering of the Ministry of Education, Renmin University of China, Beijing 100872, China 2Key Laboratory of High Confidence Software Technologies of the Ministry of Education, Peking University, Beijing 100871, China 3Academy of Mathematics and System sciences, Chinese Academy of sciences, Beijing 100190, China 4department of Management science and engineering, Tsinghua University, Beijing 100084, China 1. Key Laboratory of Data Engineering and Knowledge Engineering of the Ministry of Education Renmin University of China Beijing 100872 China2. Key Laboratory of High Confidence Software Technologies of the Ministry of Education Peking University Beijing 100871 China3. Academy of Mathematics and System Sciences Chinese Academy of Sciences Beijing 100190 China4. Department of Management Science and Engineering Tsinghua University Beijing 100084 China

Internetware can be formed through aggregation of Internetware entities bottom-up to satisfy the user's requirements. In the process, capability description of Internetware entity plays an important role. This paper proposes a capability description of Internetware entity based on environment ontology. The environment ontology includes environment entities and possible interactions with the environment entities in a particular domain. Tree-like hierarchical state machines are also included in the ontology to describe domain life-cycle of the environment entities. On the basis of the ideas, the capability of Internetware entity is embodied by interacting with environment entities and the changes of the environment entities during the interactions. Finally, this paper describes the matchmaking between capability descriptions of Internetware entities to support the discovery of Internetware entity. An example of online education course is given to illustrate the ideas.

关键词： Internetware capability description domain environment ontology tree-like hierarchical state machine

来源：评论

学校读者我要写书评

暂无评论

VANETs-Based Real-time Traffic data Dissemination

VANETs-Based Real-time Traffic Data Dissemination

引用

2010 IEEE International Conference Conferenhce on Wireless Communications,Networking and Information Security(2010 IEEE 无线通信、网络技术与信息安全国际会议 WCNIS)

作者： Wenping Chen Department of Computer Science??Renmin University of China Beijing Key Laboratory of Data Engineering and Knowledge Engineering (Renmin University of China) MOE

ISBN: (纸本)9781424458509

Traffic congestion is a very serious problem in large cities. With the number of vehicles increasing rapidly, especially in cities whose economy is booming, the situation is getting even worse. In this paper, by leveraging the techniques of Vehicular Ad hoc Networks (VANETs) we present a real-time abnormal traffic data dissemination protocol. Specifically, all vehicles running on the same road segment are regarded as a cluster to generate traffic message about this segment. To reduce communication cost, only abnormal traffic data is issued and spread to nearby road segments. By employing event-driven and period combined mechanism, the abnormal traffic messages are disseminated to the vehicles that probably need the messages in time. We propose a distance dependent forwarder selection method to disseminate traffic message. When transmitted inside a cluster, messages are forwarded along the segment from one end to the other based on the least hops principle;while transmitted among clusters, messages are transmitted in epidemic routing mode, which ensure the fast and reliable dissemination. To evaluate the performance of our protocol, we use the real traffic data of Beijing at peak hour. The simulation results demonstrate that our protocol is feasible and efficient for metropolitan-size city.

关键词： vehicular networks traffic real-time

来源：评论

学校读者我要写书评

暂无评论

A trust model for capability delegation in federated policy systems

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

引用

International Conference on Network and Service Management

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

Federated policy systems are required to support the complexity and organizational heterogeneity of the modern marketplace. The Community-based Policy Management System (CBPMS) is such a distributed policy management approach. It utilizes a tree-based capability authority model to partition and delegate federated capabilities. However CBPMS delegation chains have limitations such as: performance overheads due to distributed rule evaluation, threats from malformed or malicious federated principals and a lack of flexibility with respect to delegation chain reduction or capability authority re-partitioning. In this paper we introduce a trust management model for CBPMS that addresses all of these issues.. A brief security analysis is presented and a telecommunications service management use case described.

关键词： Conferences Authorization Organizations Public key Telecommunications

来源：评论

学校读者我要写书评

暂无评论

Local Methods for Estimating SimRank Score

Local Methods for Estimating SimRank Score

引用

International Asia-Pacific Web Conference (APWEB)

作者： Xu Jia Hongyan Liu Li Zou Jun He Xiaoyong Du Yuanzhe Cai Ministry of Education Key Laboratories of Data Engineering and Knowledge Engineering China Department of Computer Science Renmin University of China China Department of Management Science and Engineering Tsinghua University China Department of Computer Science University of Texas Arlington TX USA

SimRank is a well known algorithm which conducts link analysis to measure similarity between each pair of nodes (nodepair). But it suffers from high computational cost, limiting its usage in large-scale datasets. Moreover, Links between nodes are changing over time. It may be desirable to quickly approximate the similarity score between certain nodepair without performing a large-scale computation on the entire graph. In our approach we propose a method to efficiently estimate the similarity score using only a small subgraph of the entire graph. We call this novel algorithm “Local-SimRank”. The experimental results conducted on real datasets and synthetic dataset show that our algorithm efficiently produces good approximations to the global SimRank scores. Meanwhile, we prove that the Local-SimRank score LS(a, b) is always less than original SimRank score S(a, b) mathematically.

关键词： Computer science Application software Web pages data engineering knowledge engineering Algorithm design and analysis Large-scale systems Computer science education Conference management knowledge management

来源：评论

学校读者我要写书评

暂无评论

An analysis of current trends in CBR research using multiview clustering

An analysis of current trends in CBR research using multivie...

引用

作者： Greene, Derek Freyne, Jill Smyth, Barry Cunningham, Pádraig Clique Research Cluster School of Computer Science and Informatics University College Dublin Ireland CSIRO's ICT Centre Based Hobart Australia Computer Science School of Computer Science and Informatics University College Dublin Ireland ChangingWorlds Ltd. Ireland Clarity: The Centre for Sensor Web Technologies Ireland Department of Knowledge and Data Engineering School of Computer Science and Informatics University College Dublin Ireland

The European Conference on Case-Based Reasoning (CBR) in 2008 marked IS years of international and European CBR conferences where almost seven hundred research papers were published. In this report we review the research themes covered in these papers and identify the topics that are active at the moment. The main mechanism for this analysis is a clustering of the research papers based on both cocitation links and text similarity. It i.ç interesting to note that the core set of papers has attracted citations from almost three thousand papers outside the conference collection so it is clear that the CBR conferences are a subpart of a much larger whole. It is remarkable that the research themes revealed by this analysis do not map directly to the subtopics of CBR that might appear in a textbook. Instead they reflect the applications-oriented focus of CBR research, and cover the promising application areas and research challenges that are faced. Copyright © 2010, Association for the Advancement of Artificial Intelligence. All rights reserved.

关键词： Case based reasoning

来源：评论

学校读者我要写书评

暂无评论

Performance study on logging to another main memory database

Performance study on logging to another main memory database

引用

International Conference on New Trends in Information and Service science, NISS

作者： Xiongpai Qin Xiaoyun Zhou Key Laboratory of Data Engineering and Knowledge Engineering School of Information Renmin University of China Beijing 100872 China Department of Computer Science and Technology Xuzhou Normal University Jiangsu 221008 China

关键词： Checkpointing database systems Transaction databases Network servers Availability Nonvolatile memory Writing Communication industry Defense industry Wood industry

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：