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

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

来源：评论

学校读者我要写书评

暂无评论

Studies and implementation of the trusted process mechanism in a secure operating system

引用

Qinghua Daxue Xuebao/Journal of Tsinghua University 2010年第SUPPL. 1期50卷 1547-1553页

作者： Zhang, Chongbin Li, Fengjuan Liang, Bin China Information Technology Security Evaluation Center Beijing 100085 China Key Laboratory of Data Engineering and Knowledge Engineering of Ministry of Education School of Information Renming University of China Beijing 100872 China

The trusted process mechanism is an important part of the operating system security mechanism, but there is no uniform definition of the trusted process and there are some limitations in understanding its fundamental properties. In this paper, the trustworthiness of a trusted process is discussed in terms of privilege, data-operated integrity, functional and logic correctness, self-integrity, availability and trusted interactions. A trusted process definition is then given which summarizes the fundamental properties of a trusted process as a theoretical foundation for researching and enforcing the trusted process mechanism. A prototype of a trusted process mechanism is implemented in a secure operating system based on Linux, with the trustworthiness of the trusted process assured in many ways to improve and extende the original trust mechanisms in Linux.

关键词： Linux

来源：评论

学校读者我要写书评

暂无评论

Median query research in wireless sensor networks

引用

Tien Tzu Hsueh Pao/Acta Electronica Sinica 2010年第2A期38卷 133-137页

作者： Wu, Zhong-Bo Zhang, Hui Chen, Hong Information School Renmin University of China Beijing 100872 China Key Laboratory of Data Engineering and Knowledge Engineering Ministry of Education Beijing 100872 China School of Mathematics and Computer Science Xiangfan University Xiangfan Hubei 441053 China

Poor quality and harsh condition can result in faulty and outlier data in sampling data of sensor nodes. So we need median query to reflect average level of monitoring region. First, we put forward HMA algorithm. Second, we extend HMA algorithm and put forward HFMA algorithm. In HFMA, We only need collect data inside filter and aggregate influence coefficient during sampling period. Base station can compute median result according to the sample data inside filter and influence coefficient aggregation value. Experimental results have shown that HFMA outperforms Naive algorithm and HMA algorithm and can prolong the lifetime of sensor network.

关键词： Sensor nodes

来源：评论

学校读者我要写书评

暂无评论

Approximation algorithm for constructing data aggregation trees for wireless sensor networks

引用

中国高等学校学术文摘·计算机科学 2009年第4期3卷 524-534页

作者： Deying LI Jiannong CAO Qinghua ZHU Key Laboratory of Data Engineering and Knowledge Engineering School of InformationRenmin University of ChinaBeijing 100872China Internet and Mobile Computing Lab Department of ComputingHong Kong Polytechnic UniversityHong KongChina

This paper considers the problem of constructing data aggregation trees in wireless sensor networks (WSNs)for a group of sensor nodes to send collected information to a single sink *** data aggregation tree contains the sink node,all the source nodes,and some other non-source *** goal of constructing such a data aggregation tree is to minimize the number of non-source nodes to be included in the tree so as to save *** prove that the data aggregation tree problem is NP-hard and then propose an approximation algorithm with a performance ratio of four and a greedy *** also give a distributed version of the approximation *** simulations are performed to study the performance of the proposed *** results show that the proposed algorithms can find a tree of a good approximation to the optimal tree and has a high degree of scalability.

关键词： WSNs data aggregation tree approximation algorithm distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

A Review-Based Reputation Evaluation Approach for Web Services

引用

Journal of Computer Science & Technology 2009年第5期24卷 893-900页

作者：李海华杜小勇 Member 田萱 Key Laboratory of Data Engineering and Knowledge Engineering (Renmin University of China) MOE Beijing 100872 China School of Information Renmin University of China Beijing 100872 China School of Information Science & Technology Beijing Forestry University Beijing 100083 China

Web services are commonly perceived as an environment of both offering opportunities and threats. In this environment, one way to minimize threats is to use reputation evaluation, which can be computed, for example, through transaction feedback. However, the current feedback-based approach is inaccurate and ineffective because of its inner limitations （e.g., feedback quality problem）. As the main source of feedback, the qualities of existing on-line reviews are often varied greatly from low to high, the main reasons include：（1） they have no standard expression formats, （2） dishonest comments may exist among these reviews due to malicious attacking. Up to present, the quality problem of review has not been well solved, which greatly degrades their importance on service reputation evaluation. Therefore, we firstly present a novel evaluation approach for review quality in terms of multiple metrics. Then, we make a further improvement in service reputation evaluation based on those filtered reviews. Experimental results show the effectiveness and efficiency of our proposed approach compared with the naive feedback-based approaches.

关键词： Web services reputation evaluation review quality measurement

来源：评论

学校读者我要写书评

暂无评论

Two Novel Semantics of Top-k Queries Processing in Uncertain database

Two Novel Semantics of Top-k Queries Processing in Uncertain...

引用

International Conference on Computer and Information Technology (CIT)

作者： Dexi Liu Changxuan Wan N. Xiong Laurence T. Yang Lei Chen 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 Saint Francis Xavier University Antigonish NS Canada Department of Computer Science HK University of Science and Technology Hong Kong China

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 Top-k 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 x-tuple 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 x-kRanks queries (U-x-kRanks) and Global x-Top-k queries (G-x-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.

关键词： Semantics Upper bound Heuristic algorithms Query processing Equations Artificial neural networks

来源：评论

学校读者我要写书评

暂无评论

Lightweight data mining based database system self-optimization: A case study

Lightweight data mining based database system self-optimizat...

引用

Joint International Conference on Advances in data and Web Management, APWeb/WAIM 2009

作者： Qin, Xiongpai Cao, Wei Wang, Shan Key Laboratory of Data Engineering and Knowledge Engineering School of Information Renmin University of China MOE Beijing 100872 China

ISBN: (纸本)9783642006715

With the system becoming more complex and workloads becoming more fluctuating, it is very hard for DBA to quickly analyze performance data and optimize the system, self optimization is a promising technique. A data mining based optimization scheme for the lock table in database systems is presented. After trained with performance data, a neural network become intelligent enough to predict system performance with newly provided configuration parameters and performance data. During system running, performance data is collected continuously for a rule engine, which chooses the proper parameter of the lock table for adjusting, the rule engine relies on the trained neural network to precisely provide the amount of adjustment. The selected parameter is adjusted accordingly. The scheme is implemented and tested with TPC-C workload, system throughput increases by about 16 percent. © Springer-Verlag Berlin Heidelberg 2009.

关键词： Locks (fasteners)

来源：评论

学校读者我要写书评

暂无评论

Simulation of main memory database parallel recovery 09

Simulation of main memory database parallel recovery

引用

2009 Spring Simulation Multiconference, SpringSim 2009

作者： Qin, Xiongpai Cao, Wei Wang, Shan Key Laboratory of Data Engineering and Knowledge Engineering School of Information Renmin University of China MOE Beijing100872 China

The paper describes the details of using J-SIM in main memory database parallel recovery simulation. In update intensive main memory database systems, I/O is still the dominant performance bottleneck. A proposal of parallel recovery scheme for large-scale update intensive main memory database systems is presented. Simulation provides a faster way of evaluating the new idea compared to actual system implementation. J-SIM is an open source discrete time simulation software package. The simulation implementation using J-SIM is elaborated in terms of resource modeling, transaction processing system modeling and workload modeling. Finally, with simulation results analyzed, the effectiveness of the parallel recovery scheme is verified and the feasibility of J-SIM's application in main memory database system simulation is demonstrated.

关键词： Recovery

来源：评论

学校读者我要写书评

暂无评论

COP: Privacy-preserving multidimensional partition in DAS paradigm 09

COP: Privacy-preserving multidimensional partition in DAS pa...

引用

2009 International Conference on Extending database Technology/International Conference on database Theory Workshops, EDBT/ICDT '09

作者： Wang, Jieping Du, Xiaoyong Wang, Haocong Yang, Pingping Key Laboratory of Data Engineering and Knowledge Engineering MOE China School of Information Renmin University of China Beijing 100872 China

ISBN: (纸本)9781605586502

database-as-a-Service (DAS) is an emerging database management paradigm wherein partition based index is an effective way to querying encrypted data. However, previous research either focuses on one-dimensional partition or ignores multidimensional data distribution characteristic, especially sparsity and locality. In this paper, we propose Cluster based Onion Partition (COP), which is designed to decrease both false positive and dead space at the same time. Basically, COP is composed of two steps. First, it partition covered space level by level, which is like peeling of onion;second, at each level, a clustering algorithm based on local density is proposed to achieve local optimal secure partition. Extensive experiments on real dataset and synthetic dataset show that COP is a secure multidimensional partition with much less efficiency loss than previous top down or bottom up counterparts. Copyright 2009 ACM.

关键词： database systems

来源：评论

学校读者我要写书评

暂无评论

Fault-tolerant routing: κ-inconnected many-to-one routing in wireless networks

Fault-tolerant routing: κ-inconnected many-to-one routing i...

引用

3rd International Conference on Combinatorial Optimization and Applications, COCOA 2009

作者： Li, Deying Zhu, Qinghua Yang, Huiqiang School of Information Renmin University of China Beijing China Key Laboratory of Data Engineering and Knowledge Engineering Renmin University of China MOE China

ISBN: (纸本)3642020259

This paper addresses the problem of fault-tolerant many-to-one routing in static wireless networks with asymmetric links, which is important in both theoretical and practical aspects. The problem is to find a minimum energy subgraph for a given subset and a destination node such that there are κ node-disjoint paths from each node in the subset to the destination node in the subgraph. We prove that the problem is NP-hard, and propose two efficient heuristic approaches, namely, the minimum weight κ node-disjoint paths based (MWkNDPB) approach and the minimum energy κ node-disjoint paths based (MEkNDPB) approach. Extensive simulations have been conducted to show that proposed algorithms are efficient. © 2009 Springer Berlin Heidelberg.

关键词： Wireless networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：