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

作者： Zhang, Jing Ye, Liuqi Business School Hohai University Nanjing Jiangsu 210098 China Key Laboratory of Data Engineering and Knowledge Engineering Ministry of Education Renmin University of China Beijing 100872 China

ISBN: (纸本)9781424453269

knowledge resource is becoming the most important in an organization, Its exploring degree has direct influence on the core competitive power of the organization. System is also an integral part, the basis and protection for keeping an organization working well, thus the organization realizes its knowledge sharing and exchange and knowledge resource exploring by establishing the group learning system, regular meeting system, the knowledge report system and the knowledge publicity system. Then knowledge can be transmitted widely in the organization and generate knowledge contributions, innovations and promote the core competitive power. © 2010 IEEE.

关键词： knowledge management

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

A fast two-stage algorithm for computing SimRank and its extensions

A fast two-stage algorithm for computing SimRank and its ext...

引用

1st International Workshop on Graph database, IWGD 2010, 1st International Workshop on Advanced Techniques on XML data Management, XMLDM 2010, 2nd International Workshop on WCMT 2010, Held in Conj. with WAIM 2010

作者： Jia, Xu Liu, Hongyan Zou, Li He, Jun Du, Xiaoyong Key Labs. of Data Engineering and Knowledge Engineering Ministry of Education China Department of Computer Science Renmin University of China 100872 China Department of Management Science and Engineering Tsinghua University 100084 China

ISBN: (纸本)3642167195

Similarity estimation can be used in many applications such as recommender system, cluster analysis, information retrieval and link prediction. SimRank is a famous algorithm to measure objects' similarities based on link structure. We observe that if one node has no in-link, similarity score between this node and any of the others is always zero. Based on this observation, we propose a new algorithm, fast two-stage SimRank (F2S-SimRank), which can avoid storing unnecessary zeros and can accelerate the computation without accuracy loss. Under the circumstance of no accuracy loss, this algorithm uses less computation time and occupies less main memory. Experiments conducted on real and synthetic datasets demonstrate the effectiveness and efficiency of our F2S-SimRank. © 2010 Springer-Verlag.

关键词： Cluster analysis

来源：评论

学校读者我要写书评

暂无评论

An integration management system for managing business continuity, records and knowledge

An integration management system for managing business conti...

引用

International Forum on Information Technology and Applications

作者： An, Xiaomi Chao, Lemen Ye, Liuqi Key Laboratory of Data Engineering and Knowledge Engineering Ministry of Education Renmin University of China Beijing 100872 China Economic Management School Beijing Institute of Petrol-chemical Technology Beijing 102617 China

ISBN: (纸本)9780769541150

Developing an integration management system for business continuity, records and knowledge (IMS of BRK) is beneficial to the collaboration, optimization and innovation of business continuity management system (BCMS), records management system (RMS) and knowledge management system (KMS) for organization. Comprehensive research and development requirements along with a cogent framework, however, have not been proposed for integrating three of them, which were proposed independently. Based on situational analysis of cross boundaries integration feasibilities in terms of common understandings, general principles and best practice frameworks from relevant national and international standards, this paper proposes integration thinking to combine the advantages of the three paradigms to sustainable competitive advantages;supported by international best practices, the authors propose an integration route covering five levels of integration framework, two integration approaches and three integration controls for dynamic accumulation, sharing and exchange of evidence, memory and knowledge in digital world and global competition. © 2010 IEEE.

关键词： knowledge management

来源：评论

学校读者我要写书评

暂无评论

Efficient common items extraction from multiple sorted lists

Efficient common items extraction from multiple sorted lists

引用

12th International Asia Pacific Web Conference, APWeb 2010

作者： Lu, Wei Rong, Chuitian Chen, Jinchuan Du, Xiaoyong Cheong Fung, Gabriel Pui Zhou, Xiaofang School of Information Renmin University of China China Key Labs of Data Engineering and Knowledge Engineering Ministry of Education China School of Computing Informatics Arizona State University United States School of ITEE University of Queensland Australia

ISBN: (纸本)9780769540122

Given a set of lists, where items of each list are sorted by the ascending order of their values, the objective of this paper is to figure out the common items that appear in all of the lists efficiently. This problem is sometimes known as common items extraction from sorted lists. To solve this problem, one common approach is to scan all items of all lists sequentially in parallel until one of the lists is exhausted. However, we observe that if the overlap of items across all lists is not high, such sequential access approach can be significantly improved. In this paper, we propose two algorithms, MergeSkip and MergeESkip, to solve this problem by taking the idea of skipping as many items of lists as possible. As a result, a large number of comparisons among items can be saved, and hence the efficiency can be improved. We conduct extensive analysis of our proposed algorithms on one real dataset and two synthetic datasets with different data distributions. We report all our findings in this paper. © 2010 IEEE.

关键词： Problem solving

来源：评论

学校读者我要写书评

暂无评论

ParaCube: A scalable OLAP model based on distributed aggregate computing with sibling cubes

ParaCube: A scalable OLAP model based on distributed aggrega...

引用

12th International Asia Pacific Web Conference, APWeb 2010

作者： Zhang, Yansong Wang, Shan Huang, Wei Key Laboratory of the Ministry of Education for Data Engineering and Knowledge Engineering Beijing 100872 China School of Information Renmin University of China Beijing 100872 China Department of Computer Harbin Financial College Harbin Helongjiang 150030 China

ISBN: (纸本)9780769540122

The requirements of OLAP applications increase rapidly by dramatically increased data volume, users, query volume and query complexity. The requirement for shortening update period in data warehouse is another crucial factor for a scalable OLAP application. In this paper, we propose a scalable OLAP prototype to support the query processing with increasing data volume by distributing the whole fact tuples to multiple servers to construct a set of sibling cubes which can be merged together to obtain the whole cube. We employ a light weight distribution policy with fully duplicated dimension tables in each sibling server on the observation of very low proportion of space cost for dimension tables. OLAP query with distributed aggregate functions can be transformed into queries to be performed parallel in sibling servers. For non-distributed computing aggregate functions, such as median, the optimized median aggregate computing algorithm is proposed to reduce transmission volume between servers while computing the global median values. We also present a three-level framework in data warehouse to meet the requirement of shorter update period in "operational business intelligence". An asynchronous tunnel model is proposed to reduce update latency by pre-fetching updated tuples to OLAP processing server. Finally, we set up prototype system ParaCube to evaluate performance in SN (shared-nothing) system and multi-core platforms. © 2010 IEEE.

关键词： data warehouses

来源：评论

学校读者我要写书评

暂无评论

Towards comprehensive integration management of business continuity, records and knowledge

Towards comprehensive integration management of business con...

引用

作者： An, Xiaomi Wang, Wang Key Laboratory of Data Engineering and Knowledge Engineering Ministry of Education Renmin University of China Beijing 100872 China School of Information Resource Management Renmin University of China Beijing 100872 China

ISBN: (纸本)9788988678251

Many of management systems for business continuity, records and knowledge (BRK) are standalone. Connections and networks of business continuity management systems (BCMS), records management systems (RMS) and knowledge management systems (KMS) are expected to study for facing challenges from evidence-based collaborations in a networked working environment, in terms of control of documented information for business efficiency;guarantee of evidentiality and quality of documented information for organizational effectiveness;and sharing, protecting and increasing values of records as business and knowledge assets for knowledge economy. Based on review of ideas of integration management thinking, best practice frameworks of business continuity management, records management and knowledge management, management models of BCMS, RMS and KMS, an architecture framework towards comprehensive integration management of BRK is proposed by vertical integration design and crosswise integration operations. Case studies demonstrate that such architecture framework has implications to enhance controls of efficiency, effectiveness, and economy of organizational resources and assets adaptable to complex global competition;to improve quality assurance of documented information for supporting evidence-based governance adaptable to dynamic changing of information and communication technologies;to consistent accumulation, sharing and exchanging evidence, memory and knowledge along e-business processes to promote collaboration, optimization and innovation of BCMS, RMS and KMS.

关键词： knowledge management

来源：评论

学校读者我要写书评

暂无评论

Local methods for estimating SimRank score

Local methods for estimating SimRank score

引用

12th International Asia Pacific Web Conference, APWeb 2010

作者： Jia, Xu Liu, Hongyan Zou, Li He, Jun Du, Xiaoyong Cai, Yuanzhe Key Labs of Data Engineering and Knowledge Engineering Ministry of Education China Department of Computer Science Renmin University of China 100872 China Department of Management Science and Engineering Tsinghua University 100084 China Department of Computer Science University of Texas Arlington TX 76019 United States

ISBN: (纸本)9780769540122

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. © 2010 IEEE.

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Law Text Clustering Based on Referential Relations

Law Text Clustering Based on Referential Relations

引用

ChinaGrid Annual Conference (ChinaGrid)

作者： Biao Fan Tao Liu He Hu Xiaoyong Du Ministry of Education Key Laboratory of Data Engineering and Knowledge Engineering China School of Information Renmin University of China Beijing China

This paper proposes a new method to cluster law texts based on referential relation of laws. We extract law entities (an entity represents a law) and their referential relation from law texts. Then SimRank algorithm is applied to calculate law entity's similarity through referential relation and law clustering is carried out based on the SimRank similarity. This is the first time to apply SimRank algorithm in the domain of Law and use it to carry out text clustering. Prototype and experiments show that our solution is feasible. We also publish the extracted data as Linked Law data with RDF data model, which forms the first open semantic web database in Law domain. Linked Law data enables user to access law data with rich data links and query web data by application interface of Semantic Web.

关键词： Clustering algorithms Heuristic algorithms databases Algorithm design and analysis Resource description framework data mining Semantics

来源：评论

学校读者我要写书评

暂无评论

Query-Aware Complex Object Buffer Management in XML Information Retrieval

Query-Aware Complex Object Buffer Management in XML Informat...

引用

International Asia-Pacific Web Conference (APWEB)

作者： Qiushi Li Qiuyue Wang Shan Wang Key Laboratory of Ministry of Education of Data Engineering and Knowledge Engineering Beijing China School of Information Renmin University of China Beijing China

In this paper, we analyse the data access characteristics of a typical XML information retrieval system and propose a new query aware buffer replacement algorithm based on prediction of Minimum Reuse Distance (MRD for short). The algorithm predicts an object's next reference distance according to the retrieval system's running status and replaces the objects that have maximum reuse distances. The factors considered in the replacement algorithm include the access frequency, creation cost, and size of objects, as well as the queries being executed. By taking into account the queries currently running or queuing in the system, MRD algorithm can predict more accurately the reuse distances of index data objects.

关键词： Information management XML Information retrieval Tree data structures Indexing Prediction algorithms Algorithm design and analysis Frequency data analysis Information analysis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：