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

International Forum on Information Technology and Applications, IFITA

作者： Xiaomi An Lemen Chao Liuqi Ye Key Laboratory of Data Engineering and Knowledge Engineering Ministry of Education Renmin University of China Beijing China Economic Management School Beijing Institute of Petrochemical and Technology Beijing China

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.

关键词： Process control Organizations Best practices ISO standards Standards organizations Business continuity

来源：评论

学校读者我要写书评

暂无评论

The Integrated Use of Business Continuity Management Systems, Records Management Systems and knowledge Management Systems

The Integrated Use of Business Continuity Management Systems...

引用

International Conference on Management and Service Science, MASS

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

Much research has been done on integrated use of ISO management system standards. Integrated use of management systems is identified to have shared values of varied integration impacts on resources efficiency building and sustainable development of business processes. However, little research has been done on integrated use of business continuity management systems (BCMS), records management systems (RMS) and knowledge management systems (KMS). This paper proposes a holistic integration management approach for collaboration, optimization and innovation of the three management systems through mapping/building/operationalizing cycle for supply of efficiency building strategy to the dynamic accumulation, sharing, and exchanges of memory, evidence and knowledge of organization.

关键词： ISO standards Collaboration knowledge management Standards organizations Organizations

来源：评论

学校读者我要写书评

暂无评论

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

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.

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

来源：评论

学校读者我要写书评

暂无评论

Pseudo-relevance feedback driven for XML query expansion

引用

Journal of Convergence Information Technology 2010年第9期5卷 146-156页

作者： Minjuan, Zhong Changxuan, Wan School of Information Technology Jiangxi University of Finance and Economics Nanchang 330013 China Jiangxi Key Laboratory of Data and Knowledge Engineering Jiangxi University of Finance and Economics Nanchang 330013 China

Pseudo-relevance feedback has been perceived as an effective solution for automatic query expansion. However, a recent study has shown that traditional pseudo-relevance feedback may bring into topic drift and hence be harmful to the retrieval performance. It is often crucial to identify those good feedback documents from which useful expansion terms can be added to the query. Compared with traditional query expansion, XML query expansion needs not only content expansion but also considering structural expansion. This paper presents a solution for both identifying related documents and selecting good expansion information with new content and path constrains. Combined with XML semantic feature, a naïve document similarity measurement is proposed in this paper. Based on this, k-median clustering algorithm is firstly implemented and some related documents are found. Secondly, query expansion is only performed by two steps in the set of related documents, which key phrase extraction algorithm is carried out to expand original query in the first step and the second step is structural expansion based on the expanded key phrases. Finally a full-edged content-structure query expression which can represent user's intention is formalized. Experimental results on IEEE CS collection show that the proposed method can reduce the topic drift effectively and obtain the better retrieval quality.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Efficient Common Items Extraction from Multiple Sorted Lists

Efficient Common Items Extraction from Multiple Sorted Lists

引用

International Asia-Pacific Web Conference (APWEB)

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

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.

关键词： data mining data engineering knowledge engineering Informatics Algorithm design and analysis Computer science Application software Information retrieval

来源：评论

学校读者我要写书评

暂无评论

Vulnerabilities Static Detection for Web Applications with False Positive Suppression

Vulnerabilities Static Detection for Web Applications with F...

引用

2010 IEEE International Conference on Information Theory and Information Security(2010 IEEE 国际信息论与信息安全会议)

作者： Bin Liang Qianqian Wang Jianjun Huang Jiagui Zhong Jingjing Cai Key Laboratory of Data Engineering and Knowledge Engineering (Renmin University of China) MOE Schoo School of Information Renmin University of China Beijing 100872 China Beijing Venustech Cybervision Co. Ltd Beijing 100094 China

Web applications become more and more important, and the corresponding security problems have been concerned about. This paper presents TASA, an ASP static analyzer, which employs a path-sensitive, inter-procedural and contextsensitive data flow analysis, mainly concerning the taint propagation and sanitization. This paper also discusses some techniques used in TASA, such as sanitization routines modeling, ASP specific features, alias analysis and path-related routines modeling, to prune false positives. Experiments on four open source applications show that TASA has a rate of false positive of 4.98% and it can avoid certain false warnings owing to the proposed approaches.

关键词： Security Detectors Computer bugs Portals Analytical models Browsers Merging

来源：评论

学校读者我要写书评

暂无评论

Study in retrieval visibility and optical thickness of fog with MODTRAN

Study in retrieval visibility and optical thickness of fog w...

引用

International Conference on Multimedia Technology

作者： Zhang, Wengang Wei, Ming Yu, Tao Wang, Gengke Lai, Jibao Wang, Yuqing Key Laboratory of Meteorological Disaster of Ministry of Education Earth System Remote Sensing Institute Nanjing University of Information Science and Technology Nanjing 210044 China Center for National Space-borne Demonstration Beijing 100101 China Institute of Data and Knowledge Engineering Henan University Kaifeng Henan 475001 China Binjiang College Nanjing University of Information Science and Technology Nanjing 210044 China

ISBN: (纸本)9781424478743

In recent years, many scientists have done some work in monitoring the fog, and achieved fruitful results. Now we want to conduct more in-depth study. In this paper, we utilize MODTRAN to simulate the relationship between transmittance and visibility, height of fog. By fitting the relationship between them, we get the formula that calculates visibility of fog using transmittance and height of fog. The correlation coefficient of this formula is very high, so it can be regarded as an accuracy one. The height of fog can be calculated by top temperature of fog, surface temperature and vertical lapse rate. The transmittance of the fog can be measured by using special instrument. Therefore, the visibility and optical thickness can be retrieved by this method. ©2010 IEEE.

关键词： Visibility

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Global Top-k Aggregate Queries Based on X-tuple in Uncertain database

Global Top-k Aggregate Queries Based on X-tuple in Uncertain...

引用

International Conference on Advanced Information Networking and Applications Workshops (AINAW)

作者： Dexi Liu Changxuan Wan Naixue Xiong Jong Hyuk Park Sang-Soo Yeoe School of Information Technology Jiangxi Key Laboratory of Data and Knowledge Engineering Jiangxi University of Finance and Economics Nanchang China Department of Computer Science Georgia State University Atlanta GA USA Department of Computer Science and Engineering Seoul National University of Technology Seoul South Korea Division of Computer Engineering Mokwon University Daejeon South Korea

ISBN: (纸本)9781424467013;9780769540191

A Top-k aggregate query, which is a powerful technique when dealing with large quantity of data, ranks groups of tuples by their aggregate values and returns k groups with the highest aggregate values. However, compared to Top-k in traditional databases, queries over uncertain database are more complicated because of the existence of exponential possible worlds. As a powerful semantic of Top-k in uncertain database, Global Top-k return k highest-ranked tuples according to their probabilities of being in the Top-k answers in possible worlds. We propose a x-tuple based method to process Global Top-k aggregate queries in uncertain database. Our method has two levels, group state generation and G-x-Top-k query processing. In the former level, group states, which satisfy the properties of x-tuple, are generated one after the other according to their aggregate values, while in the latter level, dynamic programming based Global x-tuple Top-k query processing are employed to return the answers. Comprehensive experiments on different data sets demonstrate the effectiveness of the proposed solutions.

关键词： Aggregates databases knowledge engineering Query processing Computer networks Power engineering computing data engineering Power engineering and energy Dynamic programming Radar imaging

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：