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

作者： Li, Zheng Li, Deying Liu, Ming School of Information Renmin University of China Beijing 100872 China Key Laboratory of Data Engineering and Knowledge Engineering Renmin University of China MOE Beijing 100872 China School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu 610054 China

In this paper, we address the interference and power constrained broadcast/multicast routing problem (D-IPCB/M) in wireless ad hoc networks using directional antenna as a starting point, which jointly considers low-interference and energy-efficiency issues. Then we study the delay-bounded interference and power constrained broadcast/multicast routing problem (DB-D-IPCB/M). An approximation algorithm and a heuristic algorithm with low time complexity are proposed for the D-IPCB/M and DB-D-IPCB/M problem, respectively. Finally, we explore and investigate the multi-constrained subgraph optimization (MCSO) problem. We prove its NP-hard and propose an approximation scheme with theoretical performance guarantee for this class of optimization problems. This is a general result originated from the study of D-IPCB/M and DB-D-IPCB/M problems, which can be applicable to solve different optimization problems such as the multi-constrained broadcast/multicast routing problems. Broadcast/multicast message by using the routing trees found by our algorithms tends to not only have less channel collisions but also save energy to extend network lifetime. The theoretical results are evaluated by simulation studies. © 2010 Elsevier B.V. All rights reserved.

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Managing a Large Shared Bank of Unstructured data by Using Free-Table

Managing a Large Shared Bank of Unstructured Data by Using F...

引用

International Asia-Pacific Web Conference (APWEB)

作者： Xiao Zhang Xiaoyong Du Jinchuan Chen Shan Wang Key Laboratory of Data Engineering and Knowledge Engineering MOE Renmin University of China Beijing China

This paper presents a reference framework, called BUD, to manage a large shared bank of unstructured data. This paper lists several important issues on managing or maintaining the unstructured data in BUD. BUD stores and manages the ever-growing unstructured data by introducing a novel technique called free-table, which is a conceptual view for end-users and a physical entity maintained by transactional storage manager of BUD. Free-table is cell-oriented but not column-oriented as relational table. It can store various types of unstructured data in cell with different versions. Additionally, we study two cases, VMP and PXRDB, to show that our proposal is feasible and tractable.

关键词： data models Conference management knowledge management engineering management data engineering Proposals Maintenance engineering knowledge engineering data mining Relational databases

来源：评论

学校读者我要写书评

暂无评论

Parallel SimRank computation on large graphs with iterative aggregation

Parallel SimRank computation on large graphs with iterative ...

引用

16th ACM SIGKDD International Conference on knowledge Discovery and data Mining, KDD-2010

作者： He, Guoming Feng, Haijun Li, Cuiping Chen, Hong Key Lab. of Data Engineering and Knowledge Engineering of Ministry of Education China Department of Computer Science Renmin University of China China No. 59 Zhongguancun Street Haidian District Beijing China

ISBN: (纸本)9781450300551

Recently there has been a lot of interest in graph-based analysis. One of the most important aspects of graph-based analysis is to measure similarity between nodes in a graph. SimRank is a simple and influential measure of this kind, based on a solid graph theoretical model. However, existing methods on SimRank computation suffer from two limitations: 1) the computing cost can be very high in practice;and 2) they can only be applied on static graphs. In this paper, we exploit the inherent parallelism and high memory bandwidth of graphics processing units (GPU) to accelerate the computation of SimRank on large graphs. Furthermore, based on the observation that SimRank is essentially a first-order Markov Chain, we propose to utilize the iterative aggregation techniques for uncoupling Markov chains to compute SimRank scores in parallel for large graphs. The iterative aggregation method can be applied on dynamic graphs. Moreover, it can handle not only the link-updating problem but also the node-updating problem. Extensive experiments on synthetic and real data sets verify that the proposed methods are efficient and effective. © 2010 ACM.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

Geometric Routing Precluding Loops and Dead Ends in 3-D Wireless Sensor Networks

Geometric Routing Precluding Loops and Dead Ends in 3-D Wire...

引用

2010 IEEE Global Telecommunications Conference GLOBECOM 2010

作者： Jun Duan Deying Li Wenping Chen Key Laboratory of Data Engineering and Knowledge Engineering MOE School of Information Renmin University of China Beijing China

Numerous algorithms on geometric networks has been studied, and most of them were based on 2-dimensional networks. But 2-dimensional geometric routing algorithms cannot be directly adapted to the 3-dimensional networks. In this paper, we propose routing algorithms based on the iteration of specific angles on the networks of Delaunay Triangulation in 3D space, and prove the certainty of data transmission of our routing algorithms. In the algorithms, the messages only need to carry information of O(1) nodes and each node just keeps 1-hop neighbors' information.

关键词： Routing Peer to peer computing Three dimensional displays Algorithm design and analysis Compass Wireless sensor networks Relays

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Towards Video Management over Relational database

Towards Video Management over Relational Database

引用

International Asia-Pacific Web Conference (APWEB)

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

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.

关键词： Relational databases Memory Videoconference laboratories Engines data analysis Performance analysis Video surveillance Conference management knowledge management

来源：评论

学校读者我要写书评

暂无评论

Detecting Spam Comments with Malicious Users’ Behavioral Characteristics

Detecting Spam Comments with Malicious Users’ Behavioral Ch...

引用

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

作者： Wenchang Shi Bin Liang Zhaohui Liang Qianqian Wang Wei Sun Key Laboratory of Data Engineering and Knowledge Engineering (Renmin University of China) MOE Schoo Beijing Venustech Cybervision Co. Ltd Beijing 100094 China

In recent years, the spread of spam comments has become a main obstacle which limits the development of commercialized social networks. This paper analyzes the differences of behavioral characteristics between normal users and malicious users. Based on these characteristics, we propose several heuristic methods to detect spam comments. These methods evaluate comments from three perspectives, including time-frequency characteristic of comments, text similarity of comments and the number of target domains each user's comments refer to. In our collected dataset, our experimental results indicate the accuracy of our detection strategy I (strategy for high accuracy) and strategy II (strategy for wide coverage) are 100% and 92.6%, respectively. The preliminary evaluation of the proposed detection methods shows promising result.

关键词： Books Conferences Unsolicited electronic mail Accuracy Commercialization Time series analysis Filtering

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：