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

International Conference on Pervasive computing, Signal Processing and Applications

作者： Guo, Yahong Zhang, Desheng 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 Harbin Heilongjiang 150080 China

ISBN: (纸本)9780769541808

In this paper, the concept of multi-radio sensor networks is introduced, and the reliability for multi-radio MAC protocol is researched extensively, via establishing a probability model of reliability. To be specific, the reliability of MAC protocols for multi-radio nodes are studies from single-hop and multi-hop, respectively. Furthermore, the upper and lower bounds of these reliabilities are provided. Lastly, the performance rate between single-radio and multi-radio MAC protocols is proposed. The experiment results show that the reliability of multi-radio MAC protocols is much higher than that of single-radio MAC protocol. In addition, the experiment results roughly coincide with theoretical analysis. © 2010 IEEE.

关键词： Reliability

来源：评论

学校读者我要写书评

暂无评论

Notice of Retraction: Collaborative filtering based on time division

Notice of Retraction: Collaborative filtering based on time ...

引用

International Conference on Computer Science and Information Technology (CSIT)

作者： Yan Yang Long Yun Key Laboratory of Database and Parallel Computing of Heilongjiang Province Department of Computer Science and Technology Heilongjiang University Harbin China

This article has been retracted by the publisher.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Data Dissemination Protocols Based on Opportunistic Sharing for Data Offloading in Mobile Social Networks

Data Dissemination Protocols Based on Opportunistic Sharing ...

引用

International Conference on parallel and Distributed Systems (ICPADS)

作者： Na Jiang Longjiang Guo Jinbao Li Meirui Ren Sisi Cheng Xiaodan Guo School of Computer Science and Technology Heilongjiang University Harbin China Key Laboratory of Database and Parallel Computing Heilongjiang China

ISBN: (纸本)9781509053827

Due to the increasing popularity of smart mobile devices, the amount of mobile data communications has led to explosive growth of data traffic in cellular networks. Cellular networks have to face the challenge of huge communication traffic. Offloading data traffic through opportunistic communication among smart mobile devices is a promising solution to partially solve this problem since there is almost no monetary cost for it. Large amount of smart mobile devices can communicate each other using Bluetooth or WIFI Direct in short communication range and they can form an opportunistic mobile social network. The opportunistic communications among smart mobile devices can effectively reduce the amount of cellular data traffic. However, mobile users take a long time to obtain useful data. In order to reduce data communication latency, this paper proposes three data dissemination protocols named RRDP(Request-Reply Dissemination Protocol), RDP(Random Dissemination Protocol) and LDP(LRU Dissemination Protocol) respectively. The three proposed protocols are based on opportunistic sharing policy. Extensive NS-2 simulation results show that (1) on the campus situation, the user's access delay of RDP is 56.4% less than the RRDP and LDP is 44.8% less than RRDP. (2) in the vehicular environment, the user's access delay of RDP is 32.5% less than the RRDP and LDP is 28.1% less than RRDP. RDP is the best protocol.

关键词： Protocols Mobile nodes Data dissemination Cellular networks Delays

来源：评论

学校读者我要写书评

暂无评论

Optimization and parallelization of MRF community detection algorithm for a specific network

引用

International Journal of Performability Engineering 2019年第8期15卷 2153-2164页

作者： Lu, Jun Zhang, Yuanzhong College of Computer Science and Technology Heilongjiang University Harbin150080 China Key Laboratory of Database and Parallel Computing of Heilongjiang Province Harbin150080 China

Research on the optimization and parallelization of the MRF network community detection algorithm for a specific network is carried out in this paper. Firstly, the principle of the existing algorithm is expounded, the algorithm is analyzed, and some problems are pointed out. Some optimization strategies and rules are proposed, including the extraction of variables and operations from inner loops to outer loops, the merging of related operations in loops, the removal of redundant loops, and the split of loops. In order to achieve better parallelism, OpenMP parallel computing of this method is realized by reversing the order of inner and outer loops. The influence of the density of network edges on the algorithm efficiency is also analyzed in this paper. The optimization and parallel algorithm can be applied to the module partition of Alzheimer's disease gene data, and the efficiency of the algorithm is greatly improved. The optimization strategies and rules proposed in this paper can be further extended to general situations. It is significant in practical applications. © 2019 Totem Publisher, Inc. All rights reserved.

关键词： Efficiency

来源：评论

学校读者我要写书评

暂无评论

Visible-Infrared Image Fusion Based on Double- Density Wavelet and Thermal Exchange Optimization

Visible-Infrared Image Fusion Based on Double- Density Wavel...

引用

IEEE Advanced Information Technology, Electronic and Automation Control Conference (IAEAC)

作者： Hao Guo Jingyu Chen Xuan Yang Qingliang Jiao Ming Liu Beijing Institute of Environmental Features Beijing China Key Laboratory of Database and Parallel Computing of Heilongjiang Province Harbin China

ISBN: (数字)9781728180281

ISBN: (纸本)9781728180298

Infrared and visible image fusion has been a hot issue in image fusion. However, the parameters and result image have many proposed. In this paper, a novel visible infrared image fusion algorithm based on double-density wavelet and thermal exchange optimization is proposed. The pre-processed infrared and visible images are decomposed into detail layers and background layers by double-density wavelet transform. Thermal exchange optimization is used to estimate the number of layers and weight thresholds of decomposition. Experimental shows that both visual effects and quantitative analysis of proposed algorithm can get the best results.

关键词： Wavelet transforms Thermal decomposition Wavelet analysis Visual effects Thermal analysis Image fusion Optimization

来源：评论

学校读者我要写书评

暂无评论

M-cube: A duty cycle based multi-channel MAC protocol with multiple channel reservation for WSNs

M-cube: A duty cycle based multi-channel MAC protocol with m...

引用

16th IEEE International Conference on parallel and Distributed Systems, ICPADS 2010

作者： Li, Jinbao Zhang, Desheng Guo, Longjiang Ji, Shouling 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: (纸本)9780769543079

In this paper, a duty cycle based multi-channel MAC protocol with multiple channel reservation, called M-cube, is proposed to tackle the triple hidden terminal problems. M-cube can make nodes to choose one actually idle channel from all the expected idle channels. Therefore, M-cube can avoid data packet collisions resulted by the triple hidden terminal problems. By minimizing the lower bound of the average number of times of channel switching in M-cube, the optimal duty cycle is obtained through theoretical analysis. To validate the effectiveness of multiple channel reservation and dynamic optimal duty cycling, extensive simulations and real test bed experiments were conducted. Both the simulation and experiment results show that when the number of channels is large or network loads are heavy, M-cube improves energy efficiency and throughput significantly compared with other works in the literature. © 2010 IEEE.

关键词： Energy efficiency

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Influence Equilibrium Problem Research Based on Common Interests in Mobile Social Network

Influence Equilibrium Problem Research Based on Common Inter...

引用

International Conference on Mobile Ad-hoc and Sensor Networks, MSN

作者： Jinbao Li Yue Han Jinghua Zhu School of computer Science and technology Heilongjiang University Key Laboratory of Database and Parallel Computing of Heilongj iang Province Harbin China

ISBN: (纸本)9781509056972

Influence maximization refers to the number of influenced nodes reach to maximum by finding a set of seed nodes in social network. Due to peoples' excessive concentration of attention, sometimes, negative effects will appear during the influence propagation. However, the negative effects on influence propagation are not involved in the existing research work. In this paper, we consider the influence equilibrium problem in mobile social network. The goal of influence equilibrium is to balance the influential range of different kinds of seed sets through the way of node scheduling. Our goal is to reduce the negative effects by transforming the status of influence from excessive concentration to relatively balanced. There are two main challenges: (1) which nodes should be scheduled in mobile social network in order to achieve a balanced effect. (2) how to schedule the nodes. To address the two challenges, we estimate the randomness of nodes and then schedule the nodes which have high randomness. The entropy-based random walk select balance algorithm(RS_B) is proposed in this paper. To achieve the balanced effect, random walk procedure is adopted to choose the sets that can receive the scheduled nodes during the scheduling phase. However, new imbalance may arise during this procedure. Thus, the entropy-based max-min balance algorithm(MM_B) is proposed to deal with the new imbalance caused by RS_B algorithm. Theoretical analysis and experimental results show that the RS_B and MM_B algorithm can balance the influence range and MM_B performs better than RS_B.

关键词： Social network services Mobile communication Mobile computing Minimization Silicon Probability Software

来源：评论

学校读者我要写书评

暂无评论

Local partition subdivision algorithm for approximate nearest neighbor query

Local partition subdivision algorithm for approximate neares...

引用

International Conference on Information Science and Control Engineering (ICISCE)

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

This paper solves the problem of approximate nearest neighbor queries on high-dimensional large data sets. The two most representative methods to solve the approximate nearest neighbor query problem on high-dimensional and large-scale data sets are based on inverted multi-index and based on inverted index. The query algorithm based on the inverted multi-index requires frequent access operations to the memory, which causes more waste of resources than the query operation based on the distance order. Traditional query algorithms based on inverted indexes need to divide the entire feature space into a large number of regions to ensure the accuracy of query results when solving the problem of high-dimensional large data sets, so a large amount of space resources are required. Based on the inverted index, a query algorithm is proposed. Through the subdivision process of Voronoi Cells that are initially divided into part of the original data set, the purpose is to significantly improve the high-dimensional data set without dividing a large number of regions. On the query performance, and avoid frequent access operations to the random access memory. Theoretical analysis and experimental results show that the proposed method not only effectively improves the query processing efficiency, but also ensures the accuracy of the query.

关键词： Information science Control engineering Query processing Memory management Random access memory Approximation algorithms Partitioning algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：