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

Communications in Computer and information Science 2014年 472卷 585-590页

作者： Zhang, Kai Yang, Siman Li, Li Qiu, Ming School of Computer Science Wuhan University of Science and Technology WuhanHubei430081 China Hubei Province Key Laboratory of Intelligent Information Processing and Real-time Industrial System China

ISBN: (纸本)9783662450482

In the past few years, CUDA and OpenCL are developed in full use of the GPU, which is a significant topic in high performance computing. In this paper, we have proposed an implementation of the genetic algorithm for the traveling salesman problem on the parallel OpenCL architecture. Population initialization, fitness evaluation, selection, crossover and mutation operators are implemented on the GPU by using individual to thread mapping. Moreover we have evaluated our algorithm using a set of benchmark instances from the TSPLIB library. The comparison results shows that GPU computations provide better performance than traditional CPU implementation. © Springer-Verlag Berlin Heidelberg 2014.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Efficient deep learning algorithm with accelerating inference strategy

Lecture Notes in Computer Science (including subseries Lectu...

引用

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2014年 8933卷 394-405页

作者： Wang, Junjie Zhang, Xiaolong School of Computer Science and Technology Wuhan University of Science and Technology Wuhan430065 China Intelligent Information Processing and Real-time Industrial Systems Hubei Province Key Laboratory Wuhan430065 China

In this paper, we present an efficient learning algorithm for Deep Boltzmann Machine (DBM) to get the data-dependent expectation quickly. The algorithm adopts a layer-wise accelerating inference strategy to compute the mean values of all hidden layers, instead of the mean values by repeatedly running the equations of mean-field fixed-point until convergence. By taking advantage of layer-wise inference strategy, we can rapidly get the approximate mean values in a few iterations. This strategy also could learn efficiently a high performance model for high-dimensional high-structured sensory inputs. The proposed algorithm with layer-wise accelerating inference performs well compared to original DBM with given learning tasks. © Springer International Publishing Switzerland 2014.

关键词： Learning algorithms

来源：评论

学校读者我要写书评

暂无评论

Accelerating genetic algorithm for solving graph coloring problem based on CUDA architecture

Communications in Computer and Information Science

引用

Communications in Computer and information Science 2014年 472卷 578-584页

作者： Zhang, Kai Qiu, Ming Li, Lin Liu, Xiaoming School of Computer Science Wuhan University of Science and Technology Wuhan Hubei430081 China Hubei Province Key Laboratory of Intelligent Information Processing and Real-time Industrial System China

ISBN: (纸本)9783662450482

Graph coloring problem (GCP) is a well-known NP-hard combinatorial optimization problem in graph theory. Solution for GCP often finds its applications to various engineering fields. So it is very important to find a feasible solution quickly. Recent years, Compute Unified Device Architecture (CUDA) show tremendous computational power by allowing parallel high performance computing. In this paper, we present a novel parallel genetic algorithm to solve the GCP based on CUDA. The initialization, crossover, mutation and selection operators are designed parallel in threads. Moreover, the performance of our algorithm is compared with the other graph coloring methods using standard DIMACS benchmarking graphs, and the comparison result shows that our algorithm is more competitive with computation time and graph instances size. © Springer-Verlag Berlin Heidelberg 2014.

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

Data cleansing base on subgraph comparison

引用

Computer Modelling and New Technologies 2014年第1期18卷 52-60页

作者： Li, Huang College of Computer Science and Technology Wuhan University of Science and Technology China Hubei Province Key Laboratory of Intelligent Information Processing Real-time Industrial System China

With the quick development of the semantic web technology, RDF data explosion has become a challenging problem. Since RDF data are always from different resources, which may have overlap with each other, they could have duplicates. These duplicates may cause ambiguity and even error in reasoning. However, attentions are seldom paid to this problem. In this paper, we study the problem and give a solution, named K-radius sub graph comparison (KSC). The proposed method is based on RDF-Hierarchical Graph Model. KSC combines similar and comparison of 'context' to detect duplicate in RDF data. Experiments on publication datasets show that the proposed method is efficient in duplicate detection of RDF data. And KSC is simpler and less time-costs than other methods of graph comparison.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Bipartite graph model for RDF data cleansing

引用

Computer Modelling and New Technologies 2014年第2期18卷 99-106页

Many systems use RDF to describe information resources and semantic associations between resources. RDF data plays a very important role in advanced information retrieval. Due to diversity and imprecise of resources, duplicates exist in RDF data. The query and retrieval of RDF data are studied by many researchers. However, researchers seldom study RDF data cleansing. In this paper, we focus on RDF data cleansing. According to the features of RDF data, we propose a new approach. This approach combines similarity and connections among resources. First, we introduce an intermediate model, named RDF-Bipartite Graph model, to represent the RDF data. This model improves from Bipartite Statement-Value Graphs model. Then on the proposed model, we design a Subgraph-Extend method, to find the path connecting two nodes. This method detects the minimum subgraph containing two nodes for connect-path finding. It avoids the connect-weight setting in traditional method. Experiments on publication datasets show that the proposed method is efficient in duplicate detection of RDF data, and has high performance and accuracy.

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

Mobile user stability prediction with Random Forest model

Mobile user stability prediction with Random Forest model

引用

International Conference on Data Science and Advanced Analytics (DSAA)

作者： Danqin Wang Xiaolong Zhang Intelligent Information Processing and Real-time Industrial Systems Hubei Province Key Laboratory Wuhan China School of Computer Science and Technology Wuhan University of Science and Technology

Accompanying increasing competition among the communication industry, maintaining and improving the stability and loyalty of customers has become the key determinant of profitability. In order to prevent the loss of customers, we need to identify the stable users by data mining model. Through the evaluation of three models, Random Forest model performs with better robustness. This model can describe and predict most of the stable users in a shorter period of time. Consequently, the result will provide operators with the advantage of adopting reasonable marketing tactics timely.

关键词： Stability analysis Profitability Analytical models Prediction algorithms Logistics Accuracy

来源：评论

学校读者我要写书评

暂无评论

Solving the multiobjective multiple traveling salesmen problem using membrane algorithm

Communications in Computer and Information Science

引用

Communications in Computer and information Science 2014年 472卷 171-175页

作者： He, Juanjuan He, Juanjuan School of Computer Science Wuhan University of Science and Technology Wuhan420081 China Hubei Province Key Laboratory of Intelligent Information Processing and Real-time Industrial System Wuhan430081 China

ISBN: (纸本)9783662450482

The multiple traveling salesmen problem (mTSP) is a generalization of the classical traveling salesman problem (TSP). The mTSP is more appropriate for real-life applications than the TSP, however, the mTSP has not received the same amount of attention. Due to the high complexity of the mTSP, a more efficient algorithm proposed for mTSP must be based on a global search procedure. Membrane algorithms are a class of hybrid intelligence algorithms, which has been introduced recently as a global optimization technique. In this work, a new membrane algorithm for solving mTSP with different numbers of salesmen and problem sizes is described. The experiment results are compared with several multiobjective evolutionary strategies. © Springer-Verlag Berlin Heidelberg 2014.

关键词： Traveling salesman problem

来源：评论

学校读者我要写书评

暂无评论

A Coupling-Based Approach for Class Integration and Test Order

A Coupling-Based Approach for Class Integration and Test Ord...

引用

IEEE Asia-Pacific Conference on Services Computing (APSCC)

作者： Hao Liu Jianxun Chen Processing and Real-time Industrial System Hubei Province Key Laboratory of Intelligent Information Wuhan China School of Computer Science and Technology Wuhan University of Science and Technology Wuhan China

Software testing is one of the most important techniques used to assure the quality of software service. An intricate issue in software testing is the determination of test orders for the integration test of classes, known as the class integration and test order (CITO) problem. The determination of such order has an influence on the cost of created stubs for classes, which is an error-prone and costly process. To minimize the cost of stubbing, this paper describes a coupling measure technique to estimate the complexity of each test stub, and presents a graph-based heuristic algorithm of removing node with the highest weights to break cycles for minimizing overall complexity of stubbing. Also, an adjacency matrix and depth-first search for finding all the paths is presented. Simulation experimental results show that the overall test stub complexity decreased which greatly improves test efficiency and reduces the test cost to some extent compared with others.

关键词： Couplings Complexity theory Testing Software Weight measurement Genetic algorithms Object oriented modeling

来源：评论

学校读者我要写书评

暂无评论

Development of multi-target tracking technique based on background modeling and particle filtering

引用

Sensors and Transducers 2014年第6期173卷 6-15页

作者： Xue-Chao, Liao Zhen-Xing, Liu School of Computer Science Wuhan University of Science and Technology Wuhan China Hubei Province Key Laboratory of Intelligent Information Processing and Real-time Industrial System Wuhan China School of Information Science and Engineering Wuhan University of Science and Technology Wuhan China

Based on implementing target tracking by means of particle filtering, a technique framework of tracking target by integrating particle filtering and background modeling is presented. The multi-target tracking (MTT) is classified into 5 modules as background modeling, multi-target tracking, initializing, re-initializing and particle filtering. Firstly, the author models each pixel of the image with Gaussian Mixture Model (GMM) to calculate the probability of background pixel in the current image so as to abstract foreground moving objects. Based on the background modeling, the algorithm flow and technique framework of generating the particle set of each object and particle filtering are presented. In the process of evaluating particle weight, in order to distinguish the different color features of the objects, the original algorithm (evaluating through Bhattacharyya distance) is improved. Only the color distribution of the foreground pixel in particle area after the background modeling is counted, therefore the accuracy and efficiency of target tracking are increased. The experiments prove that this algorithm can realize the effective tracking several moving persons. © 2014 IFSA Publishing, S. L.

关键词： Target tracking

来源：评论

学校读者我要写书评

暂无评论

Protein folding structure optimization based on GAPSO algorithm in the off-lattice model

Protein folding structure optimization based on GAPSO algori...

引用

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Xiaoli Lin Xiaolong Zhang Department of City College Wuhan University of Science and Technology Wuhan China Hubei Key Laboratory of Intelligent Information Processing and Real-time Industrial System Wuhan University of Science and Technology Wuhan China

ISBN: (纸本)9781479956708

Predicting the spacial folding structure of a protein, given its sequence of amino acids, is one of the central problems in computational biology field. This paper studies the AB off-lattice model with two species of monomers, called hydrophobic (A) and hydrophilic (B). Based on this simplified model, the low energy configurations are searched by using the GAPSO. A kind of optimization about the mutation mechanism and the Euclidean interference mechanism are presented, where a novel local adjustment strategy is also used to enhance the searching ability of the global minimum within the AB off-lattice model. Starting from random conformations, the GAPSO method can find the low-energy conformation of the Fibonacci sequences and the real protein sequences. Compared with other optimization methods, the proposed novel method could converge to the lower energy folds. It appears that the proposed method can used for solving protein folding problem, which is based on the thermodynamic hypothesis.

关键词： Proteins Amino acids Interference Particle swarm optimization Optimization Sociology Statistics

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：