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

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Data collection using wavelet-segment constant compression in wireless sensor networks

引用

Yi Qi Yi Biao Xue Bao/Chinese Journal of Scientific Instrument 2013年第1期34卷 119-127页

作者： Li, Yang Guo, Longjiang Li, Jinbao Ren, Meirui School of Computer Science and Technology Heilongjiang University Harbin 150080 China Key Laboratory of Database and Parallel Computing Heilongjiang Province Harbin 150080 China

In structural health monitoring system, it usually needs to arrange lots of sensor nodes. In order to get the monitoring data in real time, frequent data collection is essential will consume so much energy, especially when the data is multi-dimensional. To reduce communication messages in the frequent data collection applications and as far as possible to extend the network lifetime. This paper proposes a data collection algorithm based on wavelet-segment constant compression(W-SDC), applies compressive sampling theory, and compress the messages with W-SDC before data transmitted, thereby this algorithm reduces the amount of data transmission. When the network is large-scale, it could save communication costs greatly, and extend the network lifetime. The total messages of traditional data collection method is O(N2), compressive data gathering method is O(MN), while the total communication costs of this algorithm is O(mN), where m

关键词： Sensor nodes

来源：评论

学校读者我要写书评

暂无评论

An implementation of the QR iterations for finding eigenvalues of matrices with CUDA on GPU

An implementation of the QR iterations for finding eigenvalu...

引用

2013 International Conference on Mechatronic Sciences, Electric Engineering and Computer, MEC 2013

作者： Ren, Meirui Ren, Meihui Zhang, Wei Ping Wang, Tao Tian, Ning Li, Jinbao Guo, Longjiang School of Computer Science and Technology Heilongjiang University Harbin150080 China Harbin Research Institute of Electrical Instrumentation Harbin150028 China Key Laboratory of Database and Parallel Computing of Heilongjiang Province Harbin150080 China

ISBN: (纸本)9781479925650

Based on the principle of QR loop iterations, this paper implements a parallel algorithm based on the hardware of GPU (Graphic Process Unit) by using routines from CUDA (Computer Unified Device Architecture) to find the eigenvalues of general matrices. CPU and GPU computing card form a client-server computing framework. Here, CPU can be regarded as a client and GPU card is considered as a computing server. For the experiment environment, this paper chooses a GPU card with the model of NVIDIA GeForce GTX460 as a server side and a CPU with the model of Intel Core is-760 quad-core as a client side. Win7 64-bit is selected as the operating system. The parallel implementation consists of two parts: PA-H and PA-QR. PA-H is a procedure that transforms a matrix A into the Hessenberg matrix B. PA-QR is the actual parallel algorithm of the QR iterations that is imposed on the Hessenberg matrix B for finding eigenvalues of the general matrix A. The speedup ratio of the proposed algorithm is jarless when the number of iterations becomes greater. The experimental results show that the parallel implementation with CUDA on GPU only makes use of less running time than traditional sequential algorithms. The speedup ratio of PA-H is between 1.79 and 7.81. The speedup ratio of PA-QR is between 3.24 and 118.9. Especially, when the order of general matrix equals 8192, the amount of iterations becomes 10000. The speedup ratio of the PA-H and the PA-QR can run up to 7.81 and 118.9 respectively. © 2013 IEEE.

关键词： Matrix algebra

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Quick-merge sort algorithm based on Multi-core linux

Quick-merge sort algorithm based on Multi-core linux

引用

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

来源：评论

学校读者我要写书评

暂无评论

Estimation of the number of distinct values over data stream based on compound sliding window

Journal of Software

引用

Journal of Software 2013年第1期8卷 19-24页

作者： Zhong, Yingli Zhu, Jinghua Ren, Meirui Yang, Yan School of Computer Science and Technology Heilongjiang University Harbin 150080 China Key Laboratory of Database and Parallel Computing Heilongjiang Province Harbin 150080 China

Estimating the number of distinct values in a data stream is a vital problem with many applications such as complex join query over multiple data streams. In this paper, we focus on the continuous and periodic distinct values estimation over sliding windows. We propose a compound sliding window model to compute the distinct values over basic sliding windows in an incremental way. LDV, HDV and AHDV are the three algorithms that are based on compound sliding windows. The basic idea behind the compound sliding windows is to organize the basic windows into a Hash table according to distinct values. Whenever a new data arrives at the data stream, it is inserted into a basic window. Once the basic window is full, a scan using distinct values is executed and the distinct values number is updated incrementally. Theoretical analysis and experiment results show that the distinct values estimation algorithms based on compound sliding windows have a great performance benefits. © 2013 ACADEMY PUBLISHER.

关键词： Decoding

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：