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

International Conference on Web-Age Information Management Workshops (WAIM)

作者： Xiang Li Zhou Da Xiaofeng Meng Renmin University of China Beijing CN Key Laboratory of Data Engineering and Knowledge Engineering MOE School of Information Renmin University of China China

Compared with traditional magnetic disks, flash memory has many advantages and has been used as external storage media for a wide spectrum of electronic devices (such as PDA, MP3, digital camera and mobile phone). As the capacity increases and price drops, it looks like a perfect alternative for magnetic disks. However, due to hardware limitations of flash memory, techniques including storage subsystem and indexing originally designed for magnetic disks can not run smoothly in a flash memory without any modification. In this paper we explore problems of indexing flash-resided data and present a new dynamical hash index for flash memory in two schemas. The analysis and experimental results validate the efficiency of our design.

关键词： Indexes Flash memory Algorithm design and analysis Writing Tuning Indexing Arrays

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Extracting Feature and Opinion Words Effectively from Chinese Product Reviews

Extracting Feature and Opinion Words Effectively from Chines...

引用

International Conference on Fuzzy Systems and knowledge Discovery (FSKD)

作者： Wei Wei Hongyan Liu Jun He Hui Yang Xiaoyong Du Information School Renmin University of China China School of Economics and Management Tsinghua University China Key Laboratory of Data Engineering and Knowledge Engineering MOE China

Nowadays more and more people like to publish their comments on a product on the Web. Mining such unstructured data (product reviews) is exciting hot and challenging research and application topic. In this paper, we focus on mining product reviews written in Chinese. We aim at extract the structural information from Chinese product reviews. By structural information, we mean product features and corresponding opinion words expressed in each review text. There are already some works done for reviews written in English, but less in Chinese. In this paper, we propose an effective method to extract candidate features and some effective pruning rules to prune the features. Also, we introduce a pattern extraction and matching step to improve our results. The experiment results show our approach is very effective, and has a good recall and precision.

关键词： Feature extraction data mining Negative feedback Information retrieval Fuzzy systems Conference management knowledge management engineering management Helium laboratories

来源：评论

学校读者我要写书评

暂无评论

The Design of an Open Hybrid Recommendation System for Mobile Commerce

The Design of an Open Hybrid Recommendation System for Mobil...

引用

International Conference on Computational Intelligence for Modelling, Control and Automation, and International Conference on Intelligent Agents, Web Technologies and Internet Commerce

作者： Chengzhi Liu Caihong Sun Jia Yu Information School and Key Laboratory of Data Engineering and Knowledge Engineering Renmin University of China Beijing China School of Electrical Engineering and Telecommunications University of New South Wales Sydney Australia

To meet more and more complex recommendation needs, it is quite important to implement hybrid recommendations for mobile commerce. In this paper, we propose a design for open hybrid recommendation systems in mobile commerce, which could integrate multiple recommendation algorithms together to improve recommendation performance. First, three solutions for an open hybrid recommendation approach are discussed in detail, which are generic customer profile, weighted hybrid recommendation algorithm, and mobile device profile creation. After that, we give out a multi-agent architecture design to make the three solutions work together. Finally a prototype system based on our proposed architecture is implemented to demonstrate the feasibility of our design and evaluate the performance of the proposed open hybrid recommendation system.

关键词： Business Customer profiles Context awareness laboratories data engineering knowledge engineering Prototypes XML Sun Australia

来源：评论

学校读者我要写书评

暂无评论

Energy Efficient Multicast Routing for Discrete Power Levels in Ad Hoc Sensor Networks

Energy Efficient Multicast Routing for Discrete Power Levels...

引用

The 4th International Conference on Wireless Communications, Networking and Mobile Computing(第四届IEEE无线通信、网络技术及移动计算国际会议)

作者： Deying Li Qinghua Zhu Zheng Li Key Laboratory of Data Engineering and Knowledge Engineering (Renmin University of China) MOE Scho School of Information Renmin University of China Beijing 100872 P.R.China

In this paper, we discuss the energy efficient multicast problem for discrete power levels in ad hoc sensor wireless networks. The problem of our concern is: given n nodes and each node v has l(v) transmission power levels and a multicast request (s, D), how to find a multicast tree rooted at s and spanning all destinations in D such that the total energy cost of the multicast tree is minimized. This problem is NP-hard. We propose a NWM_DST algorithm which has a theoretical guaranteed approximation performance ratio, and two efficient heuristics MNJT and g-D-MIP for multicast tree problem. Simulation results have shown efficiency of our proposed algorithms.

关键词： wireless sensor network energy efficiency approzimation algorithm multicast routing

来源：评论

学校读者我要写书评

暂无评论

An Edit Distance Algorithm with Block Swap

An Edit Distance Algorithm with Block Swap

引用

The 9th International Conference for Young Computer Scientists(第九届国际青年计算机大会)

作者： Tian Xia Key Laboratory of Data Engineering and Knowledge Engineering Renmin University of China MOE Beijing 100872 China School of Information Resource Management Renmin University of China. Beijing 100872 China

The edit distance between two given strings X and Y is the minimum number of edit operations that transform X into Y. In ordinary course, string editing is based on character insert, delete, and substitute operations. It has been suggested that extending this model with block edits would be useful in applications such as DNA sequence comparison and sentence similarity computation. However, the existing algorithms have generally focused on the normalized edit distance, and seldom of them consider the block swap operations at a higher level. In this paper, we introduce an extended edit distance algorithm which permits insertions, deletions, and substitutions at character level, and also permits block swap operations. Experimental results on randomly generated strings verify the algorithm's rationality and efficiency. The main contribution of this paper is that we present an algorithm to compute the lowest edit cost for string transformation with block swap in polynomial time, and propose a breaking points selection algorithm to improve the computation speed.

关键词： Edit distance edit operation block swap string matching.

来源：评论

学校读者我要写书评

暂无评论

Automatic detection of integer sign vulnerabilities

Automatic detection of integer sign vulnerabilities

引用

International Conference on Information and Automation (ICIA)

作者： Bin Liang Hui Liu Wenchang Shi Zhiyong Shan Renmin University of China Beijing CN College of Computer Science and Technology Huazhong University of Science and Technology Wuhan China Key Laboratory of Data Engineering and Knowledge Engineering (Renmin University of China) MOE Beijing 100872 China

The integer sign vulnerability is a comparatively new and subtle type of vulnerabilities, they can compromise system security. Especially, if a sign vulnerability occurs in operating system kernel, it may result in very serious invalid read/write operations to kernel memory area. Unfortunately, little attention has been paid to static detecting them automatically. This paper presents a novel approach to detecting sign vulnerabilities in Linux kernel using type qualifier technique. We introduce three pairs of type qualifier and corresponding lattices to identify some key kernel data and relationships between them. Based on an extended type inference tool, we are able to effectively detect known and unknown sign vulnerabilities from elaborately preprocessed Linux kernel files. Our experiences demonstrate that type qualifier technique can be applied to detect sign vulnerabilities effectively.

关键词： Kernel Linux Lattices Indexes Arrays Security Buffer overflow

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

An approximate sequential pattern mining approach over data stream based on Levenshtein-Automata

引用

Journal of Computational Information Systems 2007年第5期3卷 2025-2030页

作者： Li, Haifeng Chen, Hong School of Information Renmin University of China Beijing 100872 China Key Laboratory of Data Engineering and Knowledge Engineering China

Sequential pattern mining is an important method in data mining. Traditional mining algorithms are not adapted to the fast, unlimited, continuous and dynamic data stream because they are multiple pass in scanning database. Some approximate sequential pattern mining algorithms are proposed recently which cost too many system resources in sequence compare process. A sequential compare method based on Levenshtein-Automata is proposed in this paper. This method build state conversion model with pretreatment which can finish computing the sequences' similarity in linear time. A combination of Levenshtein-Automata computation and common computation of edit distance is presented in allusion to the Levenshtein-Automata's problem of using too much memory, so a tradeoff between time cost and space cost is implemented. The experiment result shows this method is effective and efficient.

关键词： data mining

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：