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

International Conference on Cyber-Enabled Distributed computing.and Knowledge Discovery, CyberC

作者： Jinbao Li Desheng Zhang School of Computer Science and Technology Heilongjiang University Harbin Heilongjiang China Key Laboratory of Database Parallel Computing of Heilongjiang Province Harbin Heilongjiang China

In this paper, a multi-channel MAC protocol, called M&M, with multiple channel reservation is proposed to tackle the channel conflict problem. M&M is fully distributed with no requirements of time synchronization or multi-radio, so it is very practical to implement M&M in resource-constrained sensor nodes. M&M can make nodes to choose one actually idle channel for communications from all assumed idle channels. Therefore, M&M can greatly alleviate, if not completely eliminate, packet collisions resulted by the channel conflict, and thus conserve more energy to prolong the lifetime of WSNs. To investigate the values of multiple channel reservation, extensive simulation and real test bed experiments are conducted. The results show that when the number of channels becomes larger or loads are heavy, M&M improves energy efficiency and throughput significantly.

关键词： Wireless sensor networks Throughput Receivers Synchronization Media Access Protocol Media

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

DCM: A DUTY CYCLE BASED MULTI-CHANNEL MAC PROTOCOL FOR WIRELESS SENSOR NETWORKS

DCM: A DUTY CYCLE BASED MULTI-CHANNEL MAC PROTOCOL FOR WIREL...

引用

Iet International Conference on Wireless Sensor Network 2010(2010年物联网应用技术国际会议 IET-WSN 2010)

作者： Longjiang Guo Jinbao Li Desheng Zhang School of Computer Science and Technology Heilongjiang University Harbin Heilongjiang China 150 Key Laboratory of Database and Parallel Computing of Heilongjiang Province Harbin Heilongjiang Ch

ISBN: (纸本)9781617825057

Limitations of current multi-channel MAC protocols include requiring of strict time synchronization, existing large number of multi-channel hidden terminals, and lacking single-hop broadcast support and sleep mechanism, *** *** paper proposes an asynchronous duty cycle based multichannel MAC protocol, called DCM, for wireless sensor *** of requiring time synchronization among nodes, DCM takes advantage of receiver-initiated cross channel handshake mechanism to make a channel reservation for data transmission, and employs receiver adjustment mechanism to tackle the problem of the loss of broadcasting data and to improve broadcast *** to theoretical analysis using Queueing theory, this paper obtains the average number of available *** simulation and testbed experimental results show that DCM reduces the number of multichannel hidden terminals effectively, and achieves significant improvement in network throughput with increasing benefit as traffic loads increase while maintaining higher energy efficiency.

关键词： WSN MAC protocol Hidden Terminals

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Node classification problem based on potential information and representation learning between nodes

Node classification problem based on potential information a...

引用

International Conference on Information Science and Control Engineering (ICISCE)

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

Representation learning of social network nodes refers to the feature expression of nodes in low-dimensional vector space. Most of the current methods are based on the network topology to achieve node feature learning, but the potential information of the network topology is not fully utilized. To solve this problem, we propose a graph embedding algorithm based on the similarity between nodes. This method obtains a new network topology through the second-order similarity between nodes. This network topology can enhance the correlation between nodes, thereby improving the effect of node classification in the network. We use Macro-F1 and Micro-F1 evaluation indicators to evaluate the benchmark algorithm and the SNE algorithm proposed in this paper on four real data sets. The experimental results show that the SNE algorithm can improve the effect of node classification.

关键词： Information science Electronic publishing Correlation Control engineering Network topology Social networking (online) Information services

来源：评论

学校读者我要写书评

暂无评论

Motif Recognition parallel Algorithm Based on GPU

Motif Recognition Parallel Algorithm Based on GPU

引用

International Conference on Cyber-Enabled Distributed computing.and Knowledge Discovery, CyberC

作者： Jinliang Zheng Jun Lu Xinyi Shi Yan Shi Ruiqing Jing College of Computer Science and Technology Heilongjiang University Key Laboratory of Database and Parallel Computing of Heilongjiang Province Harbin China University of Chinese Academy of Sciences

In this paper, a GPU-based parallel algorithm is proposed to improve the processing efficiency of motif recognition algorithm. The work includes a serial motif recognition algorithm and a parallel algorithm based on GPU. Our GPU parallel algorithm is compared with the serial algorithm by using of 1 KB promoter data of five kinds of plant genes upstream regions. The experimental results show that a factor of 20 speeds can be achieved. It means that there are a lot of advantages by GPU parallel technology on gene motif recognition algorithm. It is significant to the great amount of data analysis work of genetic sequence.

关键词： Graphics processing units Instruction sets Algorithm design and analysis parallel algorithms Bioinformatics Synchronization Biology

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

H-cluster: A novel efficient algorithm for data clustering in sensor networks

引用

Journal of Communications 2011年第2期6卷 168-178页

作者： Guo, Longjiang Ren, Meirui Li, Jinbao Liu, Yong Ai, Chunyu School of Computer Science and Technology Heilongjiang University Harbin 150080 China Key Laboratory of Database and Parallel Computing Heilongjiang Province Harbin 150080 China Computer Science Troy University Troy AL 36082 United States

This paper focuses on the problem of data clustering in wireless sensor networks (WSNs). The data time window is a landmark window, from the time WSN starts working up to the current time. The objective is to group sensory data generated by sensor nodes deployed in a two-dimensional physical space by the similarity of sensory data in the multi-dimensional sensory data space. To perform in-network data clustering efficiently, we propose HilbertMap, a novel dimensionality reduction technique based on the Hilbert Curves, to map a multi-dimensional data space to a two-dimensional physical space. Through this mapping, the communications for clustering mostly occur between geographically nearby sensor nodes. We have conducted simulation experiments on both real-world and synthetic datasets. Our results show that HilbertMap improves the communication efficiency while maintaining a good clustering quality. © 2011 ACADEMY PUBLISHER.

关键词： Sensor nodes

来源：评论

学校读者我要写书评

暂无评论

Cross-Modality Encoder Representations Based On External Attention Mechanism

Cross-Modality Encoder Representations Based On External Att...

引用

Neural Networks, Information and Communication Engineering (NNICE), International Conference on

作者： Yudong Zheng Jun Lu College of Computer Science and Technology Heilongjiang University Harbin China College of Computer Science and Technology Heilongjiang University Key Laboratory of Database and Parallel Computing of Heilongjiang Province Harbin China

With the prevalence of deep learning, people use multi-modality information for interpretation and reasoning. In this paper, a cross-modality encoder CMEEA (cross-modality encoder representation based on external attention mechanism) is adopted to improve the accuracy of the model. The two external storage units of CMEEA can be regarded as a dictionary of the whole dataset to improve the performance of the network, while learning more representative features of the input and reducing the computational cost. This paper uses five pretraining tasks that help the model learn internal modal and cross-modal relationships. It also verifies the generalizability of the model by applying the pretraining cross-modal model to the visual inference task NLVR 2 , and improves the previous results by 0.1%. By fine-tuning the pretrain parameters, the model improves by 1.3% on visual question answering (VQA).

关键词： Training Deep learning Analytical models Visualization Dictionaries Computational modeling Question answering (information retrieval)

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：