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

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

来源：评论

学校读者我要写书评

暂无评论

GPU acceleration of finding LPRs in DNA sequence based on SUA index

GPU acceleration of finding LPRs in DNA sequence based on SU...

引用

IEEE International Conference on Performance, computing and Communications (IPCCC)

作者： Shufang Du Longjiang Guo Chunyu Ai Meirui Ren Hao Qu Jinbao Li School of Computer Science and Technology Heilongjiang University Harbin Heilongjiang China Heilongjiang University Harbin Heilongjiang CN Division of Math & Computer Science University of South Carolina Upstate Spartanburg SC USA Key Laboratory of Database and Parallel Computing. Harbin Heilongiian China

ISBN: (纸本)9781479975761

The repetitions in biological sequence analysis are of great biological significance. Finding the repetitions has been a hot topic in gene projects naturally. In recent years, graphics processing unit (GPU) has been far exceeded the CPU in terms of computing capability and memory bandwidth, especially CUDA dramatically increases in computing performance by harnessing the power of the GPUs. This paper proposes efficient parallel algorithms on CUDA to accelerate finding PTRs which is redefined as LPRs based on the SUA Index. The proposed parallel algorithms have been utilized with the parallel primitives offered by Thrust library and the effective parallel bit compression technology based on division to achieve better acceleration. Optimization techniques include CUDA streams technology are also realized to reduce transmission latency. Experimental results show that the proposed parallel algorithms are faster than the benchmark with 1.6~5.4 speedup.

关键词： Graphics processing units parallel algorithms Arrays Acceleration Sorting Algorithm design and analysis DNA

来源：评论

学校读者我要写书评

暂无评论

parallel Algorithm for Approximate String Matching with K Differences

Parallel Algorithm for Approximate String Matching with K Di...

引用

International Conference on Networking, Architecture, and Storage (NAS)

作者： Longjiang Guo Shufang Du Meirui Ren Yu Liu Jinbao Li Jing He Ning Tian Keqin Li Key Laboratory of Database and Parallel Computing Heilongjiang China Heilongjiang University School of Computer Science and Technology Harbin China Department of Computer Science Kennesaw State University Kennesaw Georgia USA Department of Computer Science Srate University of New York New Paltz New York USA

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.

关键词： parallel algorithms Graphics processing units Approximation algorithms Algorithm design and analysis Heuristic algorithms Pattern matching

来源：评论

学校读者我要写书评

暂无评论

Faster BERT with Double Loss Function Based on Batch Data Preprocessing

Faster BERT with Double Loss Function Based on Batch Data Pr...

引用

作者： Pengqi Duan Yudong Zheng Jun Lu College of Computer Science and Technology Heilongiiang University Heilongjiang UniversityHLJU College of Computer Science and Technology Heilongjiang University Heilongjiang UniversityHLJU College of Computer Science and Technology Heilongiiang University Key Laboratory of Database and Parallel Computing of Heilongjiang Province Heilongjiang University Heilongjiang UniversityHLJU

Even though pre-trained language models like BERT and XLNet have produced significant consequences on a variety of tasks of natural language processing,they are difficult to deploy in practical applications due to their large number of parameters,and huge calculation and memory *** order to improve the training speed and inference speed of the pretrained model,the FasterBERT model is proposed in this *** model combines batch data preprocessing method with knowledge *** increases the model to increase the model speed and maintains the original ***,double loss function is incorporated during the knowledge distillation process in this paper,so that the model can better learn the knowledge of the teacher model and the knowledge of the real *** accuracy of the model is *** effectiveness of the FasterBERT model is demonstrated on 12 datasets in this *** speed of the FasterBERT is 1.1-2.2 times higher than FastBERT and 2-43 times higher than *** addition,the accuracy is up to 0.6% higher than that of FastBERT,and the accuracy is better than that of the BERT model on three *** experiments show that the FasterBERT model proposed in this paper performs well on six Chinese datasets and six English *** speed is greatly improved while the accuracy of the task also has a significant effect.

关键词： pre-trained language model FasterBert model double loss function batch data processing knowledge distillation

来源：评论

学校读者我要写书评

暂无评论

GPU acceleration of finding frequent patterns over large biological sequence

GPU acceleration of finding frequent patterns over large bio...

引用

International Conference on parallel and Distributed Systems (ICPADS)

作者： Shufang Du Longjiang Guo Chunyu Ai Jinbao Li Meirui Ren Yahong Guo School of Computer Science and Technology Heilongjiang University Harbin Heilongjiang China Key Laboratory of Database and Parallel Computing Harbin Heilongjiang China Division of Math & Computer Science University of South Carolina Upstate Spartanburg SC USA School of Information Science and Technology Heilongjiang University Harbin Heilongjiang China

Biological frequent patterns usually correspond to the important function (or structure) in biological sequences. Along with the rapid growth of biological sequences, it is significant to find frequent patterns over a large bio-sequence efficiently. However, most of existing algorithms need to produce lots of short patterns or projected databases, which influence the efficiency badly and also increase the cost of space. Graphics processing units (GPUs) embracing many core computing devices, have been extensively applied to accelerate computation performance in many areas. In order to meet the demand of biologists, we redefine the frequent pattern problem with length constraints for finding frequent patterns. We present pruning optimization method for the serial algorithm (POSA), and based on this technique, we propose a parallel algorithm (POPA) which not only reduces the time complexity with a low space cost but also obtains better performance on CUDA. To validate the presented algorithms, we implemented the algorithms on multiple-core CPU and various GPU devices. Also, CUDA optimization techniques are applied to speed up calculation in the paper. Finally, experimental results show that compared with the serial algorithm on CPU with six cores, POSA achieves 1.2~4.5 speedup, and POPA gains 3~20 speedup.

关键词： Arrays Graphics processing units Biology Data mining Indexes parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

An Efficient Graph Isomorphism Algorithm Based on Canonical Labeling and Its parallel Implementation on GPU

An Efficient Graph Isomorphism Algorithm Based on Canonical ...

引用

IEEE International Conference on High Performance computing and Communications (HPCC)

作者： Renda Wang Longjiang Guo Chunyu Ai Jinbao Li Meirui Ren Keqin Li School of Computer Science and Technology Heilongjiang University Harbin Heilongjiang China Key Laboratory of Database and Parallel Computing Harbin Heilongjiang China Department of Computer Science University of South Carolina Upstate Spartanburg SC USA Department of Computer Science State University of New York New Paltz New York USA

The Graph Isomorphism (GI) problem has been extensively studied due to its significant applications. The most effective class of GI algorithms, i.e., canonical labeling algorithms, are suitable for either graphs with high randomness or symmetry, or graphs for which both of them are not strongly held. Also, the core operations of canonical labeling algorithms, i.e., individuation-refinement (IR) and certificate comparison, usually occupy more than 70% of the total running time. How to weaken the limitations of structures and improve the efficiency of these operations are challenges. In this paper, we present an efficient GI algorithm called PEACE, which is particularly suitable for graphs with high randomness or symmetry. We present a parallel implementation of our algorithm on GPUs. We design some new techniques and also use some existing methods to speed up calculations under CUDA. More importantly, these techniques can be applied to all IR-based GI algorithms. We evaluate the proposed algorithm on various graphs to make comprehensive comparison with currently the most efficient canonical labeling algorithms on CPUs. Experimental results show that PEACE is superior to other algorithms on graphs with high symmetry or many automorphisms, and up to 50% performance increase can be achieved in the best case. We also apply our parallel techniques on these algorithms, and compare the performance on CPU and multiple GPU devices. The results show that the techniques make all algorithms gain 15~55 speedup.

关键词： Labeling Graphics processing units Algorithm design and analysis Indexes Arrays Instruction sets Partitioning algorithms

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Improvement on simulating TCP connection establishment in NS2

引用

Tongxin Xuebao/Journal on Communications 2012年第SUPPL.2期33卷 15-19页

作者： Jiang, Yu Ren, Jian Zhou, Li-Ming School of Computer Science and Technology Heilongjiang University Harbin 150080 China Key Laboratory of Database and Parallel Computing of Heilongjiang Province Harbin 150080 China School of Information Science and Technology Heilongjiang University Harbin 150080 China

In the procedure of three-way handshake of transmission control protocol connection establishment, it involves the management of half-connection and connection tables. However, in the famous networks simulator NS2, there is only a formal description instead of a concrete and complete implementation for the procedure of TCP connection establishment. An improvement was beed made on the point. Table structures for half-connections and connections are added, and the way of managing half-connection table in Linux kernel is also imported into NS2. Simulation results show that it is clear to monitor the change in half-connection table in the TCP connection establishment procedure, and thus the requirement of simulating the connection establishment procedure in studies such as protection from TCP SYN flooding attack can be met.

关键词： Transmission control protocol

来源：评论

学校读者我要写书评

暂无评论

Analysis on the impact of router alias resolution

引用

Tongxin Xuebao/Journal on Communications 2012年第SUPPL.2期33卷 160-166页

作者： Ren, Jian Jiang, Yu Gao, Ge 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

Router alias resolution is one of hard problems and important steps for router level Internet topology measurement based on traceroute mechanism, and the topology characteristic of the generated router level topology graph has close relationship with the completeness of alias resolution. The graph with its degrees following power-law distribution was taken as the base-graph, and the shortest paths from one source to others were computed for simulating topology measurement. Experiment results show that it is very probable to see different topology characteristics between the derived graph and the base-graph due to incomplete alias resolution. Most importantly, for large-scale router level topology measurement, the completeness of alias resolution must be improved with the increasing number of probe sources, and in this way the derived topology graph could be approximate to the real topology graph.

关键词： Network topology

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：