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

International Conference on Mechatronic Science, Electric Engineering and Computer

作者： Meirui Meihui Weiping Zhang Tao Wang Ning Tian Jinbao Li Longjiang Guo School of Computer Science and Technology Heilongjiang University Harbin 150080 China Harbin Research Institute of Electrical Instrumentation 150028 China School of Computer Science and Technology Heilongjiang University Harbin China Key Laboratory of Database and Parallel Computing of Heilongjiang Province Harbin China

ISBN: (纸本)9781479925667

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 i5-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.

关键词： Graphics processing units Eigenvalues and eigenfunctions Hardware Kernel Instruction sets

来源：评论

学校读者我要写书评

暂无评论

Power adjustable cross-layer network protocol in dense wireless sensor networks

引用

Ruan Jian Xue Bao/Journal of Software 2016年 27卷 11-20页

作者： Ni, Lin-Yu Li, Jin-Bao School of Computer Science and Technology Heilongjiang University Harbin150080 China Key Laboratory of Database and Parallel Computing of Heilongjiang Province Harbin150080 China

A cross layer network strategy with power regulation is proposed for the wireless sensor networks with dense nodes. Under this strategy, nodes use different transmission power for data transmission and so that each node has a predetermined number of its neighbor nodes, or node degree. It thus guarantees the network connectivity, and can effectively reduce the competition conflict between nodes. The nodes in the network are divided according to the hierarchy. The upper node with the minimum transmission power is selected as the father node to construct the routing tree, and the candidate father node sets for the nodes are calculated. In the case of the failure of the father node, candidate father nodes are selected for transmission to solve the problem. The experimental results show that this strategy can improve the network throughput and the rate of data transmission. © Copyright 2016, Institute of Software, the Chinese Academy of Sciences. All rights reserved.

关键词： Throughput

来源：评论

学校读者我要写书评

暂无评论

Study on distributed channel allocation and routing forwarding strategy in Dual-Radio sensor networks

引用

Tongxin Xuebao/Journal on Communications 2010年第9 A期31卷 81-89页

作者： Fan, Bin Li, Jin-Bao Guo, Long-Jiang Liu, Xu Ren, Qian-Qian School of Computer Science and Technology Heilongjiang University Harbin 150080 China Key Laboratory of Database and Parallel Computing of Heilongjiang Province Harbin 150080 China

Considering the limited orthogonal channels in wireless sensor networks (WSN), a distributed channel allocation algorithm (DCA) for Dual-Radio WSN was presented. Based on DCA, a routing forwarding strategy (RFS) was proposed as well. DCA avoids conflictions within a path and reduces conflictions among different paths with a small number of channels. Furthermore theoretically prove that when K≥Δ+1, the upper bound of the network throughput is |M|+1, where K is the number of orthogonal channels in WSN, Δ is the largest degree of the network topology graph, and |M| is the number of non-leaf nodes in the network routing tree. Nodes switch channels timely in RFS, and then further dropping the conflict between the paths, effectively transmit data in parallel. Simulation results indicate that DCA and RFS can reduce the latency of data forwarding and the average energy consumption of nodes, as well as increase the throughput significantly.

关键词： Energy utilization

来源：评论

学校读者我要写书评

暂无评论

Energy-efficient algorithm for mobile target prediction and tracking in wireless sensor networks

引用

Tongxin Xuebao/Journal on Communications 2010年第9 A期31卷 135-143页

作者： Liu, Xu Li, Jin-Bao Guo, Long-Jiang Fan, Bin Zhu, Jing-Hua School of Computer Science and Technology Heilongjiang University Harbin 150080 China Key Laboratory of Database and Parallel Computing of Heilongjiang Province Harbin 150080 China

Aiming at the problem of target tracking in wireless sensor networks, an energy efficient algorithm for mobile targets prediction and tracking was proposed. Sleep scheduling mechanism was used to reduce the cost, as well as to guarantee the real-time tracking. The algorithm predicts the trajectory of the target with the Markov chain theory, and the sleeping nodes in the predicted area would be waked up to monitor the targets. In order to predict the target accurately, a location algorithm based on distance vector was triggered to estimate its position. The sensors sleep initiatively to save energy when they did not have the sensing task. Simulation and testbed experimental results indicate that the algorithms can accurately describe the target trajectory, and efficiently reduce the energy consumption.

关键词： Target tracking

来源：评论

学校读者我要写书评

暂无评论

Channel allocation and routing strategy in multi-radio multi-channel wireless sensor networks

引用

Ruan Jian Xue Bao/Journal of Software 2014年 25卷 103-112页

To address the problems of transmission delay, transmission conflicts and low throughput in Wireless sensor networks, this paper proposes a channel allocation and routing strategy in Multi-Radio Multi-Channel Networks. The strategy is to dynamically establish a k-ary n-cube topology. It not only uses the optimal static channel allocation algorithm to improve the throughput of nodes but also employs the dimension order routing algorithm to reduce transmission conflicts. This method is suitable for the network of density nodes with many communication conflicts. It can also be used in both single hop and multi hop network environment. The experiment results show that compared with traditional methods, the channel allocation and routing strategy based on the k-ary n-cube topology can effectively reduce end to end delay, network conflicts and energy consumption, prolong the network lifetime and increase the throughput of network. ©2014 ISCAS.

关键词： Throughput

来源：评论

学校读者我要写书评

暂无评论

Cross-layer design for multi-power multi-radio wireless sensor networks

引用

Xitong Gongcheng Lilun yu Shijian/System Engineering Theory and Practice 2011年第SUPPL. 2期31卷 114-118页

作者： Guo, Xiao-Hang Li, Jin-Bao School of Computer Science and Technology Heilongjiang University Harbin 150080 China Key Laboratory of Database and Parallel Computing of Heilongjiang Province Harbin 150080 China

In this paper, we investigate on the optimal routing jointly scheduling, channel and power assignment in multi-power multi-radio WSNs. We first formulate the optimal routing as a linear programming problem, and then design a polynomial time heuristic algorithm. Experiments show that the proposed cross-layer routing significantly reduce the energy consumption and the end-to-end transmission delay.

关键词： Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Anti-theft technology based on wireless sensor network

引用

Ruan Jian Xue Bao/Journal of Software 2011年第SUPPL. 1期22卷 111-121页

作者： Duan, Jin-Sheng Guo, Long-Jiang Liu, Yong Zhu, Jing-Hua Department of Computer Science and Technology Heilongjiang University Harbin 150080 China Key Laboratory of Database and Parallel Computing of Heilongjiang Province Harbin 150001 China

There are shortcomings in traditional anti-theft technology which can not satisfy a user's demand. The common ways of anti-theft are limited in wireless sensor networks. On the topic of the shadowing effect in wireless communication, this paper introduces a anti-theft technology based on wireless sensor networks. System can check intrusion by analyzing received signal strengths. This paper establishes a framework of anti-theft system and studies the key technologies. By defining the graph model in anti-theft system, the agent distribution problem is abstracted into edges partitioned by vertices problem. B-EPV algorithm is proposed for obtaining the optimal solution. Blade algorithm is designed for solving k-mode set problem to get steady status of link. This paper constructs experimental environment with real motes and verifies the performance of the system. The result shows low false positives and false negatives in the system. © Copyright 2011, Editorial Department of Journal of Software. All rights reserved.

关键词： Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Hybrid Recommendation Algorithm Based on Social Trust Clustering

引用

Ruan Jian Xue Bao/Journal of Software 2018年 29卷 21-31页

作者： Zhu, Jing-Hua Wang, Chao Ma, Sheng-Chao School of Computer Science and Technology Heilongjiang University Harbin150080 China Heilongjiang Province Key Laboratory for Database and Parallel Computing Harbin150080 China

Recommender system can solve the information overload problem effectively, and collaborative filtering (CF) is one of the techniques that is widely used in recommendation system. However, the traditional CF technology has problems such as poor scalability, sparse data, and low accuracy of recommendation results. In order to improve the quality of recommendations, this article integrates the trust relationship into the recommendation system in which the trust relationship is clustered by using the clustering (FCM) method. Using the trust cluster to predict implicit trust between users, the trust relationship is finally combined with the user-item relationship to give recommendations. The experimental results on the data set of Douban and Epinions show that compared with traditional CF algorithm, trust based recommendation algorithm and recommendation algorithm for user item clustering, the presented algorithm can greatly improve the recommendation quality and time efficiency. © Copyright 2018, Institute of Software, the Chinese Academy of Sciences. All rights reserved.

关键词： Collaborative filtering

来源：评论

学校读者我要写书评

暂无评论

Tracking Nodes Selection Algorithm Based on Voronoi Structure in Sensor Networks

引用

Ruan Jian Xue Bao/Journal of Software 2017年 28卷 30-38页

作者： Ren, Qian-Qian Li, Jin-Bao Sun, Bei-Bei Key Laboratory of Database and Parallel Computing of Heilongjiang Province Heilongjiang University Harbin150080 China Key Laboratory of Electronic Engineering Colleges of Heilongjiang Province Heilongjiang University Harbin150080 China School of Computer Science and Technology Heilongjiang University Harbin150080 China

Energy saving and the tracking performance are two important issues in moving target tracking. This paper presents a Voronoi structure-based nodes selection algorithm, which constructs a network model based on the property of Voronoi, and selects sensor nodes which are more close to the target to participate in tracking. This paper also presents a nodes scheduling mechanism, which minimizes the number of awaking nodes with tracking quality guarantee. Finally, a set of simulation experiments are made to analyze the effects of various parameters on the network performance. Experimental results show the excellent performance of the proposed algorithm in terms of energy saving and tracking quality. © Copyright 2017, Institute of Software, the Chinese Academy of Sciences. All rights reserved.

关键词： Target tracking

来源：评论

学校读者我要写书评

暂无评论

Research on physical conflict model based power allocation and link scheduling in MRMC wireless networks

引用

Xitong Gongcheng Lilun yu Shijian/System Engineering Theory and Practice 2011年第SUPPL. 2期31卷 101-104页

作者： Guo, Ya-Hong Wang, Xian School of Information Science and Technology Heilongjiang University Harbin 150080 China School of Computer Science and Technology Heilongjiang University Harbin 150080 China Key Laboratory of Database and Parallel Computing of Heilongjiang Province Harbin 150080 China

In order to improve the network spatial reuse and maximize the network throughput, this paper presents a physical conflict model based power allocation and link scheduling algorithm (PPLA). Firstly, PPLA picks available set of parallel links using hexagon coloring method. With physical conflict model, it further obtains the minimum power vector which corresponds to parallel links set. The experimental results indicate that the algorithm can increase network spatial reuse ratio and improve throughput significantly.

关键词： Throughput

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：