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

International Conference on Mechatronic Science, Electric Engineering and Computer

作者： Yong Liu Yan Yang School of Computer Science and Technology Key Laboratory of Database and Parallel Computing of Heilongjiang Province Harbin China

ISBN: (纸本)9781479925667

Sorting a list of input numbers is one of the most fundamental problems in the field of computer science. This paper presents an efficient implementation and detailed analysis of quick sort algorithm called QM-sort on Multi-core CPU architectures. Our QM-sort has two stages. The first stage is making blocks sorted, and the second stage is merging the sorted blocks. At the first stage, we propose a parallel quick sort algorithm named BPQsort. The run time of BPQsort achieves 40%-50% better than Qsort (STL), so we make blocks sorted more efficient. On the other hand, our algorithm can read file in parallel, thus reduce the time of reading file from disk. At the second stage, our parallel merge algorithm can operate the data on consecutive memory. Thus we avoid the expensive unaligned load/store operations, thus make our merge algorithm faster. At last, the run time of QM-sort is 10%-15% better than quick sort based on OpenMP.

关键词： Linux Instruction sets Hardware Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

Neighbor discovery algorithm based on the regulation of duty-cycle in mobile sensor network

Neighbor discovery algorithm based on the regulation of duty...

引用

8th International Conference on Wireless Algorithms, Systems, and Applications, WASA 2013

作者： Li, Jinbao Yang, Jian Zhang, Yanqing Guo, Longjiang Li, Yingshu School of Computer Science and Technology Heilongjiang University Harbin Heilongjiang 150080 China Key Laboratory of Database and Parallel Computing of Heilongjiang Province Harbin Heilongjiang 150080 China Department of Computer Science Georgia State University Atlanta GA 30303 United States

ISBN: (纸本)9783642397004

In this paper, aiming at the problem that the node discovers its neighbor nodes, when it is moving in mobile sensor network, we propose an algorithm for dynamical regulating the duty cycle of the node which needs to discover it neighbor node. This algorithm uses the boundary nodes in the communication range of the node to predict potential neighbor nodes, applies passion point process to predict the number of nodes in communication range of the node, regulates the duty-cycle of the node based on the model of balls and boxes, and then schedules the waking time of the node periodically by using the duty-cycle which is regulated to finish the detection. Finally, theoretical analysis and simulation experiments show that the proposed algorithm can discover more neighbor nodes in the short period of time with less energy. © 2013 Springer-Verlag Berlin Heidelberg.

关键词： Sensor nodes

来源：评论

学校读者我要写书评

暂无评论

Opportunistic routing in multi-power wireless sensor networks

Opportunistic routing in multi-power wireless sensor network...

引用

6th China Conference of Wireless Sensor Networks, CWSN 2012

作者： Guo, Yahong Guo, Xiaohang Zhang, Yanqing Zhu, Jinghua Li, Jinbao School of Information Science and Technology Heilongjiang University Harbin Heilongjiang 150080 China School of Computer Science and Technology Heilongjiang University Harbin Heilongjiang 150080 China Key Laboratory of Database and Parallel Computing of Heilongjiang Province Heilongjiang University Harbin Heilongjiang 150080 China

ISBN: (纸本)9783642362514

In this paper, we investigate on the opportunistic routing in Multi-Power Wireless Sensor Networks (MP WSNs). We first propose a routing metric called METT of opportunistic routing in MP WSNs, and model the power selecting process as a Markov decision process for computing the METT metric. We describe the METT-based opportunistic routing problem, and design a polynomial time optimal algorithm for getting the optimal routing and power selection scheme. Theory analysis and experiments show that the proposed multi-power opportunistic routing can improve the data transmission efficiency, significantly reduce the energy consumption and the end-to-end transmission delay. © 2013 Springer-Verlag.

关键词： Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Multi-pattern matching methods based on numerical computation

引用

Telkomnika - Indonesian Journal of Electrical Engineering 2013年第3期11卷 1497-1505页

作者： Jun, Lu Zhuo, Zhang Juan, Mo Xingfeng, Lv College of Computer Science and Technology Heilongjiang University Harbin China Key Laboratory of Database and Parallel Computing of Heilongjiang Province Harbin China

Multi-pattern matching methods based on numerical computation are advanced in this paper. Firstly it advanced the multiple patterns matching algorithm based on added information. In the process of accumulating of information, the select method of byte-accumulate operation will affect the collision odds , which means that the methods or bytes involved in the different matching steps should have greater differences as much as possible. In addition, it can use balanced binary tree to manage index to reduce the average searching times, and use the characteristics of a given pattern set by setting the collision field to eliminate collision further. In order to reduce the collision odds in the initial step, the information splicing method is advanced, which has greater value space than added information method, thus greatly reducing the initial collision odds. Multiple patterns matching methods based on numerical computation fits for large multi-pattern matching. © 2013 Universitas Ahmad Dahlan.

关键词： Numerical methods

来源：评论

学校读者我要写书评

暂无评论

Time constraint-based team formation in social networks

Time constraint-based team formation in social networks

引用

International Conference on Mechatronic Science, Electric Engineering and Computer

作者： Xue Han Yong Liu Xingkai Guo Xianyi Wu Xiaolong Song School of Computer Science and Technology Heilongjiang University Harbin China Key Laboratory of Database and Parallel Computing of Heilongjiang Province Heilongjiang University

ISBN: (纸本)9781479925667

We investigate the problem of discovering a team of experts from a social network. Given a task with the skill set and the time span length, our goal is to obtain a team that covers all the skills, and have a low communication cost. Furthermore, each member of the team must have common free time whose length is no less than the span length required by the task. Previous works only attempt to cover the required skills and minimize the communication cost without taking the common free time of the individuals into account. We are the first to consider time factor in team formation and thus propose a novel team formation formulation with time constraint. We show that the problem is NP-hard. We first extend the RarestFirst algorithm to deal with our new problem, then propose two novel pruning strategies, called time pruning and skill pruning respectively, and an efficient algorithm called TSP-TF, to efficiently obtain an effective team for a given task. Experimental results show that TSP-TF outperforms the generalized RarestFirst algorithm by more than an order of magnitude.

关键词： Algorithm design and analysis Social network services Time factors Collaboration Data mining Time complexity databases

来源：评论

学校读者我要写书评

暂无评论

An urban area-oriented traffic information query strategy in VANETs

An urban area-oriented traffic information query strategy in...

引用

8th International Conference on Wireless Algorithms, Systems, and Applications, WASA 2013

作者： Wang, Xinjing Guo, Longjiang Ai, Chunyu Li, Jinbao Cai, Zhipeng School of Computer Science and Technology Heilongjiang University Heilongjiang China Key Laboratory of Database and Parallel Computing Heilongjiang University Heilongjiang China Division of Math and Computer Science University of South Carolina Upstate United States Department of Computer Science Georgia State University Atlanta 30303 United States

ISBN: (纸本)9783642397004

Traffic information query in Vehicular Ad Hoc Network has various significant applications. Real-time traffic information can provide support for users to choose an optimal route according to current traffic situation. In this paper, we propose an urban area-oriented traffic information query processing mechanism, which can acquire the realtime traffic information of multiple paths from source to destination in relatively fast and accurate manner, and help users to determine an optimal route. The proposed mechanism includes two key algorithms - query dissemination and processing, and routing results backward to query requester. The query processing algorithm determines the scope of each query, so that a vehicle can query and collect data within a certain efficient scope to avoid returning overwhelmed large amount results. For queried vehicles, returning results to the moving query requester is a dynamic routing problem. We proposed a position predicting method to estimate the current location of the requester according to the information stored in the query packet. Simulation results show that the proposed strategy can improve the efficiency of data transmission, and the returned query results is effective for choosing an optimal route. © 2013 Springer-Verlag Berlin Heidelberg.

关键词： Query processing

来源：评论

学校读者我要写书评

暂无评论

parallel algorithm for approximate string matching with K differences

Parallel algorithm for approximate string matching with K di...

引用

2013 IEEE 8th International Conference on Networking, Architecture and Storage, NAS 2013

作者： Guo, Longjiang Du, Shufang Ren, Meirui Liu, Yu Li, Jinbao He, Jing Tian, Ning Li, Keqin Heilongjiang University School of Computer Science and Technology Harbin 150080 China Key Laboratory of Database and Parallel Computing Heilongjiang China Kennesaw State University Department of Computer Science Kennesaw GA 30144 United States State University of New York Department of Computer Science New Paltz NY 12561 United States

ISBN: (纸本)9780769550343

Approximate string matching using the k-difference technique has been widely applied to many fields such as pattern recognition and computational biology. Data dependency exists in the traditional sequential algorithm. Therefore, it is hard to design a parallel algorithm for approximate string matching with k differences. This paper presents a technique to eliminate data dependency. Based on this technique, this paper also presents a parallel algorithm which can calculate the elements in the same row of the edit distance matrix in parallel by eliminating data dependency. The algorithm has high parallelism, but requires synchronization. To validate the proposed algorithm, it is implemented on GPU and multiple-core CPUs. Moreover, the CUDA optimization techniques are also presented in the paper. Finally, experimental results show that, compared with the traditional sequential algorithm on CPU with twenty-four cores, the proposed parallel algorithm achieves speedup of 7-42 on GPU. © 2013 IEEE.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

Research on max ordinal in universal combinatorics coding based on GPU parallel computing

Research on max ordinal in universal combinatorics coding ba...

引用

International Conference on Measurement, Information and Control (MIC)

作者： Zhuo Zhang Jun Lu Ting Ting Gao Juan Mo Yu Liu Key Laboratory of Database and Parallel Computing Heilongjiang Province KLDPC HLJU College of CS HLJU Harbin China College of Computer Science and Technology Heilongiiang University

The parallel computing method of max ordinal number in universal combinatorics coding based on GPU is advanced in this paper. The core of universal combinatorics coding computing is ordinal number computing while the calculation of ordinal number depends on the value of max ordinal number. The calculation of max ordinal number is divided into two parts, multiplication and division of large numbers. This paper focus on the GPU parallel computing of the multiplication in max ordinal number calculation, the calculation speed of the multiplication part is increased substantially, and thus improves the efficiency of max ordinal number calculation.

关键词： Graphics processing units parallel processing Artificial intelligence Computational efficiency

来源：评论

学校读者我要写书评

暂无评论

Bipartite graph-based keyword query results recommendation

Bipartite graph-based keyword query results recommendation

引用

International Conference on Mechatronic Science, Electric Engineering and Computer

作者： Limin Feng Yan Yang School of Computer Science and Technology in Heilongjiang University Harbin China School of Computer Science and Technology in Heilongjiang University Key Laboratory of Database and Parallel Computing of Heilongjiang Province Harbin China

ISBN: (纸本)9781479925667

Relational database is widely used in people's daily life and productions. keyword search in relational database makes people search structured information from database as using search engine. So it has become a research hotspot. In recent years, there are a lot of research works about how to use historical query information to improve query efficiency. The existing works can be divided into two main aspects: query expansion and query recommendation. These two aspects have common feature, that is, they both use the historical words to improve query efficiency. If the results of historical query can be directly recommended to the current query, the query efficiency will be improved. But there are not any works using recommended model of recommended system to help keyword search. We have found that recommended model can be used to improve efficiency. We are the first one to use bipartite graph model, and propose query result recommendation algorithm, namely, Query_base algorithm and Distance_base algorithm. Finally this paper analyzes the factors which affect the efficiency of the algorithms, and verified the performance and higher accuracy of the recommendation algorithms by experiments.

关键词： Filtering

来源：评论

学校读者我要写书评

暂无评论

Distributed Aggregation Algorithms for Mobile Sensor Networks with Group Mobility Model

引用

Tsinghua Science and Technology 2012年第5期17卷 512-520页

作者： Qianqian Ren Longjiang Guo Jinghua Zhu Meirui Ren Junqing Zhu School of Computer Science and Technology Heilongjiang UniversityHarbin 150080China Key Laboratory of Database and Parallel Computing of Heilongjiang Province Harbin 150080China

In many applications of mobile sensor networks, such as water flow monitoring and disaster rescue, the nodes in the network can move together or separate temporarily. The dynamic network topology makes traditional spanning-tree-based aggregation algorithms invalid in mobile sensor networks. In this paper, we first present a distributed clustering algorithm which divides mobile sensor nodes into several groups, and then propose two distributed aggregation algorithms, Distance-AGG （Aggregation based on Distance）, and Probability-AGG （Aggregation based on Probability）. Both of these two algorithms conduct an aggregation query in three phases： query dissemination, intra-group aggregation, and inter-group aggregation. These two algorithms are efficient especially in mobile networks. We evaluate the performance of the proposed algorithms in terms of aggregation accuracy, energy efficiency, and query delay through ns-2 simulations. The results show that Distance-AGG and Probability-AGG can obtain higher accuracy with lower transmission and query delay than the existing aggregation algorithms.

关键词： mobile sensor networks data aggregation group mobility model distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：