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

Capability enhanced trust evaluation model for Web services

Jisuanji Xuebao/Chinese Journal of computers 2008年第8期31卷 1471-1477页

作者： Li, Hai-Hua Du, Xiao-Yong Tian, Xuan Key Laboratory of Data Engineering and Knowledge Engineering Renmin University of China Beijing 100872 China School of Information Renmin University of China Beijing 100872 China School of Information Science and Technology Beijing Forestry University Beijing 100083 China

In open environment, an effective trust mechanism should be built to ensure transaction safety. But current trust evaluation approaches solely based on the certificate or feedback are inaccurate and ineffective. Thus, referring to the social trust models, this paper presents a capability enhanced method to improve the accuracy of evaluating trustworthiness. Based on it, this paper also designs a trust evaluation model ServTrust that naturally provides a solution to the trust problem. Compared with current feedback based approaches, simulation experimental results show the effectiveness of the proposed model in trust evaluating.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

MRST-- An Efficient Monitoring Technology of Summarization on Stream data

引用

Journal of computer Science & Technology 2007年第2期22卷 190-196页

作者：樊小泊解婷婷李翠平陈红 School of Information Renmin University of China Beijing 100872 China Key Laboratory of Data Engineering and Knowledge Engineering MOE Beijing 100872 China

Monitoring on data streams is an efficient method of acquiring the characters of data stream. However the available resources for each data stream are limited, so the problem of how to use the limited resources to process infinite data stream is an open challenging problem. In this paper, we adopt the wavelet and sliding window methods to design a multi-resolution summarization data structure, the Multi-Resolution Summarization Tree （MRST） which can be updated incrementally with the incoming data and can support point queries, range queries, multi-point queries and keep the precision of queries. We use both synthetic data and real-world data to evaluate our algorithm. The results of experiment indicate that the efficiency of query and the adaptability of MRST have exceeded the current algorithm, at the same time the realization of it is simpler than others.

关键词： Haar wavelet sliding window stream data

来源：评论

学校读者我要写书评

暂无评论

Indexing Future Trajectories of Moving Objects in a Constrained Network

引用

Journal of computer Science & Technology 2007年第2期22卷 245-251页

作者：陈继东孟小峰 School of Information Renmin University of China Beijing 100872 China Key Laboratory of Data Engineering and Knowledge Engineering Ministry of Education Beijing 100872 China

Advances in wireless sensor networks and positioning technologies enable new applications monitoring moving objects. Some of these applications, such as traffic management, require the possibility to query the future trajectories of the objects. In this paper, we propose an original data access method, the ANR-tree, which supports predictive queries. We focus on real life environments, where the objects move within constrained networks, such as vehicles on roads. We introduce a simulation-based prediction model based on graphs of cellular automata, which makes full use of the network constraints and the stochastic traffic behavior. Our technique differs strongly from the linear prediction model, which has low prediction accuracy and requires frequent updates when applied to real traffic with velocity changing frequently. The data structure extends the R-tree with adaptive units which group neighbor objects moving in the similar moving patterns. The predicted movement of the adaptive unit is not given by a single trajectory, but instead by two trajectory bounds based on different assumptions on the traffic conditions and obtained from the simulation. Our experiments, carried on two different datasets, show that the ANR-tree is essentially one order of magnitude more efficient than the TPR-tree, and is much more scalable.

关键词： database spatial database access methods moving objects

来源：评论

学校读者我要写书评

暂无评论

Structural Join and Staircase Join Algorithms of Sibling Relationship

引用

Journal of computer Science & Technology 2007年第2期22卷 171-181页

作者：万常选刘喜平 School of Information Technology Jiangxi University of Finance and Economics Nanchang 330013 China Jiangxi Key Laboratory of Data and Knowledge Engineering Nanchang 330013 China

The processing of XML queries can result in evaluation of various structural relationships. Efficient algorithms for evaluating ancestor-descendant and parent-child relationships have been proposed. Whereas the problems of evaluating preceding-sibling-following-sibling and preceding-following relationships are still open. In this paper, we studied the structural join and staircase join for sibling relationship. First, the idea of how to filter out and minimize unnecessary reads of elements using parent＇s structural information is introduced, which can be used to accelerate structural joins of parent-child and preceding-sibling-following-sibling relationships. Second, two efficient structural join algorithms of sibling relationship are proposed. These algorithms lead to optimal join performance： nodes that do not participate in the join can be judged beforehand and then skipped using B^＋-tree index. Besides, each element list joined is scanned sequentially once at most. Furthermore, output of join results is sorted in document order. We also discussed the staircase join algorithm for sibling axes. Studies show that, staircase join for sibling axes is close to the structural join for sibling axes and shares the same characteristic of high efficiency. Our experimental results not only demonstrate the effectiveness of our optimizing techniques for sibling axes, but also validate the efficiency of our algorithms. As far as we know, this is the first work addressing this problem specially.

关键词： XML query processing sibling relationship structural join staircase join

来源：评论

学校读者我要写书评

暂无评论

CLASCN： Candidate Network Selection for Efficient Top-κ keyword Queries over databases

引用

Journal of computer Science & Technology 2007年第2期22卷 197-207页

作者：张俊彭朝晖王珊聂惠静 School of Information Renmin University of China Beijing 100872 China Key Laboratory of Data Engineering and Knowledge Engineering Ministry of Education Beijing 100872 China Computer Science and Technology College Dalian Maritime University Dalian 116026 China

keyword Search Over Relational databases （KSORD） enables casual or Web users easily access databases through free-form keyword queries. Improving the performance of KSORD systems is a critical issue in this area. In this paper, a new approach CLASCN （Classification, Learning And Selection of Candidate Network） is developed to efficiently perform top-κ keyword queries in schema-graph-based online KSORD systems. In this approach, the Candidate Networks （CNs） from trained keyword queries or executed user queries are classified and stored in the databases, and top-κ results from the CNs are learned for constructing CN Language Models （CNLMs）. The CNLMs are used to compute the similarity scores between a new user query and the CNs from the query. The CNs with relatively large similarity score, which are the most promising ones to produce top-κ results, will be selected and performed. Currently, CLASCN is only applicable for past queries and New All-keyword-Used （NAU） queries which are frequently submitted queries. Extensive experiments also show the efficiency and effectiveness of our CLASCN approach.

关键词： relational database keyword search top-κ query candidate network

来源：评论

学校读者我要写书评

暂无评论

Clustering moving objects in spatial networks

引用

12th International Conference on database Systems for Advanced Applications

作者： Chen, Jidong Lai, Caifeng Meng, Xiaofeng Xu, Jianliang Hu, Haibo School of Information Renmin University of China Key Laboratory of Data Engineering and Knowledge Engineering MOE Department of Computer Science Hong Kong Baptist University

ISBN: (纸本)9783540717027

Advances in wireless networks and positioning technologies (e.g., CPS) have enabled new data management applications that monitor moving objects. In such new applications, realtime data analysis such as clustering analysis is becoming one of the most important requirements. In this paper, we present the problem of clustering moving objects in spatial networks and propose a unified framework to address this problem. Due to the innate feature of continuously changing positions of moving objects, the clustering results dynamically change. By exploiting the unique features of road networks, our framework first introduces a notion of cluster block (CB) as the underlying clustering unit. We then divide the clustering process into the continuous maintenance of CBs and periodical construction of clusters with different criteria based on CBs. The algorithms for efficiently maintaining and organizing the CBs to construct clusters are proposed. Extensive experimental results show that our clustering framework achieves high efficiency for clustering moving objects in real road networks.

关键词： spatial-temporal databases moving objects clustering spatial networks

来源：评论

学校读者我要写书评

暂无评论

Optimization framework for distributed clustering scheme in wireless sensor networks

Optimization framework for distributed clustering scheme in ...

引用

SNPD 2007: 8th ACIS International Conference on Software engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing

作者： Yongxuan, Lai Xiaobo, Fan Hong, Chen Tingting, Xie School of Information Renmin University of China Beijing Key Laboratory of Data Engineering and Knowledge Engineering MOE

ISBN: (纸本)0769529097

Recently there have been growing interests in the applications of wireless sensor networks. Innovative techniques that improve energy efficiency to prolong the network lifetime are highly required. Clustering is an effective topology control approach and data gathering protocol in wireless sensor networks. In this paper, we propose a novel optimization framework called MICA (MICa Adjustments) for clustering scheme in wireless sensor networks. MICA takes the cluster as a whole, and dynamically adjusts the clusters according to the real-lime workload of the local clusters to balance energy consumption among clusters. The adjustments can also deal with link failures. Simulation results show that MICA can be easily embedded into existing clustering schemes to balance the energy consumptions among the clusters, and to prolong the lifetime of wireless sensor networks. © 2007 IEEE.

关键词： Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

A WSMO-based semantic web services discovery framework in heterogeneous ontologies environment

引用

2nd International Conference on knowledge Science, engineering and Management, KSEM 2007

作者： Haihua, Li Xiaoyong, Du Xuan, Tian School of Information Renmin University of China China Key Laboratory of Data Engineering and Knowledge Engineering MOE

ISBN: (纸本)9783540767183

Nowadays, WSMO (Web Service Modeling Ontology)1 has received great attention of academic and business communities, since its potential to achieve dynamic and scalable infrastructure for web services is extracted. Therefore, we design an ontology-based Semantic Web Services (SWSs) discovery framework based on WSMO so as to searching dynamically web services located at different nodes. Also, we provide several SWSs matching techniques based on this framework. © Springer-Verlag Berlin Heidelberg 2007.

关键词： Semantic Web

来源：评论

学校读者我要写书评

暂无评论

Quality aware privacy protection for location-based services

引用

12th International Conference on database Systems for Advanced Applications, DASFAA 2007

作者： Zhen, Xiao Xiaofeng, Meng Jianliang, Xu School of Information Renmin University of China Key Laboratory of Data Engineering and Knowledge Engineering MOE Department of Computer Science Hong Kong Baptist University

ISBN: (纸本)9783540717027

Protection of users' privacy has been a central issue for location-based services (LBSs). In this paper, we classify two kinds of privacy protection requirements in LBS: location anonymity and identifier anonymity. While the location cloaking technique under the k-anonymity model can provide a good protection of users' privacy, it reduces the resolution of location information and, hence, may degrade the quality of service (QoS). To strike a balance between the location privacy and QoS, we present a quality-aware anonymity model for protecting location privacy while meeting user specified QoS requirements. In the model, a mobile user can specify the minimum anonymity level requirement upon location privacy as well as the maximum cloaking latency and the maximum cloaking region size requirements upon QoS. In accordance with the model, we develop an efficient directed-graph based cloaking algorithm to achieve both high-quality location anonymity and identifier anonymity. The performance objective is to maximize the cloaking success rate under the privacy and QoS constraints. Furthermore, we introduce an option of using dummy locations to achieve a 100% cloaking success rate at the cost of communication overhead. Experimental results show the effectiveness of our cloaking algorithm under various privacy and QoS requirements. © Springer-Verlag Berlin Heidelberg 2007.

关键词： Tracking (position)

来源：评论

学校读者我要写书评

暂无评论

Effective density queries for moving objects in road networks

Effective density queries for moving objects in road network...

引用

9th Asia-Pacific Web Conference/8th International Conference on Web-Age information Management (APWeb/WAIM 2007)

作者： Lai, Caifeng Wang, Ling Chen, Jidong Meng, Xiaofeng Zeitouni, Karine School of Information Renmin University of China Key Laboratory of Data Engineering and Knowledge Engineering MOE PRISM Versailles Saint-Quentin University France

ISBN: (纸本)9783540724834

Recent research has focused on density queries for moving objects in highly dynamic scenarios. An area is dense if the number of moving objects it contains is above some threshold. Monitoring dense areas has applications in traffic control systems, bandwidth management, collision probability evaluation, etc. All existing methods, however, assume the objects moving in the Euclidean space. In this paper, we study the density queries in road networks, where density computation is determined by the length of the road segment and the number of objects on it. We define an effective road-network density query guaranteeing to obtain useful answers. We then propose the cluster-based algorithm for the efficient computation of density queries for objects moving in road networks. Extensive experimental results show that our methods achieve high efficiency and accuracy for finding the dense areas in road networks. © Springer-Verlag Berlin Heidelberg 2007.

关键词： Object recognition

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：