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

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

来源：评论

学校读者我要写书评

暂无评论

Idea-map: A Spatiotemporal View of Research Ideas

Idea-map: A Spatiotemporal View of Research Ideas

引用

2011 Eighth International Conference on Fuzzy System and knowledge Discovery(第八届模糊系统与知识发现国际会议 FSKD 2011)

作者： HeHu Xiaoyong Du Key Laboratory of Data Engineering and Knowledge Engineering(Renmin University of China) MOE Beijing 100872 P. R. China School of Information Renmin University of China Beijing 100872 P. R. China

in this paper, we describe idea-map, a mash-up application building on top of Linked data Cloud. It reads in user's keywords (about research ideas) and executes a SPARQL query against DBLP endpoint. Spatial and temporal information is extracted and parsed from the query results and is further transformed to SIMILE/EXHIBIT to show a spatiotemporal map for the research ideas. Idea-map shows the feasibility of combing various techniques such as YQL, SIMILE/Exhibit and SPARQL query answering to provide an insightful interface to better understand the interested research ideas.

关键词： Link data Cloud DBLP Spatiotemoral View YQL

来源：评论

学校读者我要写书评

暂无评论

Strong Security Enabled Certificateless Aggregate Signatures Applicable to Mobile Computation

Strong Security Enabled Certificateless Aggregate Signatures...

引用

International Conference on Intelligent Networking and Collaborative Systems (INCOS)

作者： Hu Xiong Qianhong Wu Zhong Chen Key Laboratory of Network and Software Security Assurance of the Ministry of Education Institute of Software School of Electronics Engineering and Computer Science Peking University Beijing China Department of Computer Engineering and Mathematics UNESCO Chair in Data Pr Universitat Rovira i Virgili Tarragona Spain Key Laboratory of AeroSpace Information Security and Trusted Computing Ministry of Education School of Computer Wuhan University of China China

An aggregate signature scheme allows a public algorithm to aggregate n signatures of n distinct messages from n signers into a single signature. By validating the single resulting signature, one can be convinced that the messages have been endorsed by all the signers. Certificateless aggregate signatures allow the signers to authenticate messages without suffering from the complex certificate management in the traditional public key cryptography or the key escrow problem in identity-based cryptography. In this paper, we present a new efficient certificate less aggregate signature scheme. Compared with up-to-date certificate less aggregate signatures, our scheme is equipped with a number of attracting features: (1) it is shown to be secure under the standard computational Diffie-Hellman assumption in the random oracle model, (2) the security is proven in the strongest security model so far, (3) the signers do not need to be synchronized, and (4) its performance is comparable to the most efficient up-to-date schemes. These features are desirable in a mobile networking and computing environment where the storage/computation capacity of the end devices are limited, and due to the wireless connection and distributed feature, the computing devices are easy to be attacked and hard to be synchronized.

关键词： Aggregates Games Generators Synchronization Public key cryptography

来源：评论

学校读者我要写书评

暂无评论

基于划分的集合相似连接

基于划分的集合相似连接

引用

第29届中国数据库学术会议

作者： Rong Chuitian 荣垂田 Xu Tianren 徐天任 Du Xiaoyong 杜小勇 Key Laboratory of Data Engineering and Knowledge Engineering(Renmin University of China) Ministry o 教育部数据工程与知识工程重点实验室(中国人民大学) 北京 100872 中国人民大学信息学院北京 100872 School of Information Renmin University of China Beijing 100872 Key Laboratory of Education Inform 中国人民大学信息学院北京 100872 民族教育信息化教育部重点实验室(云南师范大学) 昆明 650500

集合相似连接(set similarity join)是指在给定的数据集中，按照基于集合间覆盖关系的相似度计算方法来衡量数据之间的相似度、并找出所有相似度不小于给定阈值的数据对的操作。集合相似连接作为一种新的基本操作在很多领域中有重要应... 详细信息

集合相似连接(set similarity join)是指在给定的数据集中，按照基于集合间覆盖关系的相似度计算方法来衡量数据之间的相似度、并找出所有相似度不小于给定阈值的数据对的操作。集合相似连接作为一种新的基本操作在很多领域中有重要应用。随着社会网络、移动应用以及在线服务的发展，使得数据收集的效率和规模得到了很大的提高，同时给相似连接操作带来新的挑战。根据集合相似的必要条件，提出了相似集合之间的差异度。利用差异度和鸽巢原理，提出了一种新颖的基于数据划分的集合相似连接计算方法，该方法对集合进行自适应的均衡划分，并利用基于划分块的过滤方法来提高过滤的效率。为了进一步提高过滤的效果和相似连接的效率，利用划分块的位置信息提出了增强的过滤方法。针对提出的方法，在不同的环境下进行了实验，实验结果表明，该方法与已有的方法相比可以有效地提高相似连接的效率。

关键词：数据库集合相似连接均衡划分法阈值

来源：评论

学校读者我要写书评

暂无评论

应用数据填充缓解稀疏问题实现个性化推荐

应用数据填充缓解稀疏问题实现个性化推荐

引用

第18届全国信息存储技术学术会议

作者： Xia Jian-xun 夏建勋 Wu Fei 吴非 Xie Chang-sheng 谢长生湖北工程学院计算机与信息科学学院湖北孝感 432000 School of Computer Science and Technology Huazhong University of Science and Technology Hubei Wuhan 430074 武汉国家光电实验室湖北武汉 430074 Key Laboratory of Data Storage Systems Ministry of Education of China Hubei Wuhan 430074 School of Computer Science and Technology Huazhong University of Science and Technology Hubei Wuhan 430074 信息存储系统教育部重点实验室湖北武汉 430074 华中科技大学计算机科学与技术学院湖北武汉 430074 Wuhan National Laboratory for Optoelectronics Hubei Wuhan 430074 School of Computer and Information Science Hubei Engineering University Hubei Xiaogan 432000

协同过滤是到目前为止最成功和应用最广泛的推荐技术，然而，由于用户-项目矩阵极端稀疏导致推荐不精确.针对该问题，本文提出了三种数据填充方法和两种推荐策略.对评分矩阵中未评分数据的三种数据填充方法是：(1)采用行和列数据的加权... 详细信息

协同过滤是到目前为止最成功和应用最广泛的推荐技术，然而，由于用户-项目矩阵极端稀疏导致推荐不精确.针对该问题，本文提出了三种数据填充方法和两种推荐策略.对评分矩阵中未评分数据的三种数据填充方法是：(1)采用行和列数据的加权平均值填充；(2)采用行和列数据的众数的平均值填充；(3)采用行和列数据的中位数的平均值填充.一种推荐策略是直接用填充数据作为预测评分进行推荐；另一种推荐策略是将填充数据后的评分矩阵作为伪评分矩阵应用Pearson相关相似性进行协同过滤推荐.采用GroupLens数据集进行的实验结果表明：上述几种推荐策略均可有效地缓解评分数据稀疏性问题，提高推荐精确度.从平均的预测精确度来看，直接采用三种填充数据作为预测评分进行推荐比传统的基于Pearson相关相似性的协同过滤推荐算法分别提高了3.76％、6.46％和7.63％.；而将填充数据后的评分矩阵作为伪评分矩阵应用Pearson相关相似性进行协同过滤推荐则比传统的基于Pearson相关相似性的协同过滤推荐算法分别提高了6.57％、6.52％和7.60％.

关键词：个性化推荐系统协同过滤数据填充推荐策略

来源：评论

学校读者我要写书评

暂无评论

Approximation for a scheduling problem with application in wireless networks

引用

Science China Mathematics 2010年第6期53卷 1643-1655页

作者： ZHU QingHua & LI DeYing key laboratory of data engineering and knowledge engineering,MOE,school of information,Renmin University of China,Beijing 100872,China 1. Key Laboratory of Data Engineering and Knowledge Engineering MOE School of Information Renmin University of China Beijing 100872 China

A network of many sensors and a base station that are deployed over a region is *** sensor has a transmission range,an interference range and a carrier sensing range,which are r,αr and βr,*** this paper,we study the minimum latency conflict-aware many-to-one data aggregation scheduling problem:Given locations of sensors along with a base station,a subset of all sensors,and parameters r,α and β,to find a schedule in which the data of each sensor in the subset can be transmitted to the base station with no conflicts,such that the latency is *** designe an algorithm based on maximal independent sets,which has a latency bound of(a+19b)R + Δb-a + 5 time slots,where a and b are two constant integers relying on α and β,Δ is the maximum degree of network topology,and R is the trivial lower bound of *** Δ contributes to an additive factor instead of a multiplicative one,thus our algorithm is nearly a constant(a+19b)-ratio.

关键词： approximation algorithm conflict-aware many-to-one data aggregation latency wireless sensor network

来源：评论

学校读者我要写书评

暂无评论

Towards video management over relational database

Towards video management over relational database

引用

12th International Asia Pacific Web Conference, APWeb 2010

作者： Li, Hui Zhang, Xiao Wang, Shan Du, Xiaoyong School of Information Renmin University of China Key Laboratory of Data Engineering and Knowledge Engineering China

ISBN: (纸本)9780769540122

Video has become popular in our daily life for both professional and consumer applications. Both low level video processing and high level semantic video analysis are critically computational tasks in application domains. Most of current video computing tools are developed for specific analytic tasks, they are lack higher level interoperability with database and treat database merely as a relational data storage engine rather than an analytic platform, which causes inefficient data access and massive amount of data movement. In this paper, we study how to support video data management over relational database, and present our initial solutions of video data storage mechanism, video data access method and efficient video analytics. We also illustrate our ongoing prototype system HybVideo that developed in a novel architecture. It integrates above solutions to tackle the major challenges of providing a platform for both storage and analysis of video data. © 2010 IEEE.

关键词： information management

来源：评论

学校读者我要写书评

暂无评论

A sampling-based algorithm for approximating maximum average value region in wireless sensor network

A sampling-based algorithm for approximating maximum average...

引用

International Workshop on Scheduling and Resource Management for Parallel and Distributed Systems

作者： Zhang, Hao Wu, Zhongbo Li, Deying Chen, Hong School of Information Renmin University of China Key Laboratory of Data Engineering and Knowledge Engineering MOE Beijing China

ISBN: (纸本)9780769541570

in wireless sensor network, sensory readings are often noisy due to the imprecision of measuring hardware and the disturbance of deployment environment, so it is often inaccurate if we use individual sensor readings to answer queries. In this paper, we consider a useful application of sensor network: maximum average value region query. This query returns the region with the maximum average value among all possible regions in the network, where the region is a fix-sized circle pre-defined by users. Using the average value of a region to answer the query, noises between sensors will be neutralized with each other, which will make the results more reliable. However, because of the huge amount of possible regions in the network, it is costly to process the query exactly. Therefore, w e propose a sampling-based algorithm AMAVR to deal with the problem approximately. AMAVR uses a background value to prun e the useless regions which cannot be the result. A further optimization strategy is also given to handle the situation that, background value based filter does not work when some individual sensor nodes have higher values than their neighbors. By using both of the two techniques, the scale of the sampling population can be effectively reduced, that is, we cost less energy to get a satisfying result. At last, the conducted simulations demonstrate the energy efficiency of the proposed methods in our paper. © 2010 IEEE.

关键词： Sensor nodes

来源：评论

学校读者我要写书评

暂无评论

Efficient Distributed Skyline Queries for Mobile Applications

引用

计算机科学技术学报（英文版） 2010年第3期25卷 523-536页

作者： Ying-Yuan Xiao Yue-Guo Chen Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology Tianjin University of Technology Tianjin 300191China Key Laboratory of Computer Vision and System Tianjin University of TechnologyTianjin 300191China School of Computing National University of Singapore117417Singapore Key Laboratory of Data Engineering and Knowledge Engineering Renmin University of ChinaBeijing 100872China

In this paper,we consider skyline queries in a mobile and distributed environment,where data objects are distributed in some sites(database servers)which are interconnected through a high-speed wired network,and queries are issued by mobile units(laptop,cell phone,etc.)which access the data objects of database servers by wireless *** inherent properties of mobile computing environment such as mobility,limited wireless bandwidth,frequent disconnection,make skyline queries more *** show how to efficiently perform distributed skyline queries in a mobile environment and propose a skyline query processing approach,called efficient distributed skyline based on mobile computing(EDS-MC).In EDS-MC,a distributed skyline query is decomposed into five processing phases and each phase is elaborately designed in order to reduce the network communication,network delay and query response *** conduct extensive experiments in a simulated mobile database system,and the experimental results demonstrate the superiority of EDS-MC over other skyline query processing techniques on mobile computing.

关键词： skyline distributed query processing mobile database system

来源：评论

学校读者我要写书评

暂无评论

Query-aware complex object buffer management in XML information retrieval

Query-aware complex object buffer management in XML informat...

引用

12th International Asia Pacific Web Conference, APWeb 2010

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

ISBN: (纸本)9780769540122

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

关键词： Search engines

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：