Applications of clustering algorithms in biomedical research are ubiquitous, with typical examples including gene expression data analysis, genomic sequence analysis, biomedical document mining, and MRI image analysis...
详细信息
The Graphics Processing Units (GPUs), or Graphics Cards, were originally designed to perform dedicated tasks to the computer graphics operations. Recently, however, NVIDIA has developed an extension of the C language ...
详细信息
ISBN:
(纸本)9781617820663
The Graphics Processing Units (GPUs), or Graphics Cards, were originally designed to perform dedicated tasks to the computer graphics operations. Recently, however, NVIDIA has developed an extension of the C language for programming GPUs, called CUDA (Compute Unified Device Architecture). Density Functional Theory (DFT) is one of the most used iterative methods to find an approximate solution to the Schrödinger equation. However, the calculations in DFT are computationally intensive because of the exchange and correlation electronic integrals, integrals to calculate the Hartree and kinetic energies, which require more computational effort as the number of electrons in the simulation increases. The development of the GPU and tools focused on the concept of General-Purpose computation on Graphics Processing Units (GPGPU) is an alternative to accelerate the energy calculation in the DFT method. This research aimed to study the DFT calculations and identify parts of the algorithm that, if changed, could represent performance benefits to be executed on GPU. The SIESTA (Spanish Initiative for Electronic Simulations with Thousands of Atoms) is a DFT method that uses pseudopotencial for ionic core representation, numerical atomic orbitals and localized basis set. In this research, some functions of this method ware parallelized and used to calculate the physical properties of nanotubes in order to prove the efficiency of GPUs. It was found that the implementation of SIESTA GPU parallel version is able to achieve gains in performance, in individual functions, of one or even two orders of magnitude, making it promising employment of GPUs to speed up the processing of the Density Functional Theory.
The applications of recently developed meta-heuristics in cluster analysis, such as particle swarm optimization (PSO) and differential evolution (DE), have increasingly attracted attention and popularity in a wide var...
详细信息
This paper discusses a class of Discrete-Time Recurrent Neural Networks with LT neurons based on Competitive Layer Model(CLM-DT-LT-RNNs). It first addresses the boundedness and complete stability of the networks, then...
详细信息
H-DIBCO 2010 is the International Document Image Binarization Contest which is dedicated to handwritten document images organized in conjunction with ICFHR 2010 conference. The general objective of the contest is to i...
详细信息
Since they were proposed as an optimization method, the evolutionary algorithms have been successfully used for solving complex problems in several areas such as, for example, the automatic design of electronic circui...
详细信息
Since they were proposed as an optimization method, the evolutionary algorithms have been successfully used for solving complex problems in several areas such as, for example, the automatic design of electronic circuits and equipments, task planning and scheduling, software engineering and data mining, among many others. However, some problems are computationally intensive when it concerns the evaluation of solutions during the search process, making the optimization by evolutionary algorithms a slow process for situations where a quick response from the algorithm is desired (for instance, in online optimization problems). Several ways to overcome this problem, by speeding up convergence time, were proposed, including Cultural Algorithms and Coevolutionary Algorithms. However, these algorithms still have the need to evaluate many solutions on each step of the optimization process. In problems where this evaluation is computationally expensive, the optimization can take a prohibitive time to reach optimal solutions. This work presents an evolutionary algorithm for numerical optimization problems (Quantum-Inspired Evolutionary Algorithm for Problems based on Numerical Representation - QIEA-R), inspired in the concept of quantum superposition, which allows the optimization process to be carried on with a smaller number of evaluations. It extends previous works by presenting a broader range of tests and improvements on the algorithm. The results show the good performance of this algorithm in solving numerical problems.
In this paper, a modified version of the multi-band multiple ring monopole antenna is proposed. The height of the new design which consists of multiple half rings is half of the original one. The modified design is mo...
详细信息
In this paper, a modified version of the multi-band multiple ring monopole antenna is proposed. The height of the new design which consists of multiple half rings is half of the original one. The modified design is more attractive for low profile applications due to its lower height. The antenna is simulated and measured. It is shown that the simulation and measurement results are in good agreement. The performance of the modified version of the antenna is compared with the original design in terms of input characteristic and far field radiation patterns. It is shown that the multiband behaviour of the modified design is similar to the original one. However, there is a frequency shift between the operating bands of the new and the original antennas. The radiation patterns of the both antennas are similar to the conventional monopole antenna in lower operating frequency bands. However, degradation in radiation patterns of the both antennas is observed as frequency increases.
The applications of recently developed meta-heuristics in cluster analysis, such as particle swarm optimization (PSO) and differential evolution (DE), have increasingly attracted attention and popularity in a wide var...
详细信息
The applications of recently developed meta-heuristics in cluster analysis, such as particle swarm optimization (PSO) and differential evolution (DE), have increasingly attracted attention and popularity in a wide variety of communities owing to their effectiveness in solving complicated combinatorial optimization problems. Here, we propose to use a hybrid of PSO and DE, known as differential evolution particle swarm optimization (DEPSO), in order to further improve search capability and achieve higher flexibility in exploring the natural while hidden data structures of data of interest. Empirical results show that the DEPSO-based clustering algorithm achieves better performance in terms of the number of epochs required to reach a pre-specified cutoff value of the fitness function than either of the other approaches used. Further experimental studies on both synthetic and real data sets demonstrate the effectiveness of the proposed method in finding meaningful clustering solutions.
This paper discusses a class of Discrete-Time Recurrent Neural Networks with LT neurons based on Competitive Layer Model (CLM-DT-LT-RNNs). It first addresses the boundedness and complete stability of the networks, the...
详细信息
This paper discusses a class of Discrete-Time Recurrent Neural Networks with LT neurons based on Competitive Layer Model (CLM-DT-LT-RNNs). It first addresses the boundedness and complete stability of the networks, then a theorem is given to let the networks have CLM phenomena. Such networks are applied to medical image segmentation by using the global gray-level information and the contextual information of pixels. In order to alleviate time and storage consuming, a technique of divide-and-merge (DAM) is used. Simulation results are used to illustrate the application in image segmentation.
H-DIBCO 2010 is the International Document Image Binarization Contest which is dedicated to handwritten document images organized in conjunction with ICFHR 2010 conference. The general objective of the contest is to i...
详细信息
H-DIBCO 2010 is the International Document Image Binarization Contest which is dedicated to handwritten document images organized in conjunction with ICFHR 2010 conference. The general objective of the contest is to identify current advances in handwritten document image binarization using meaningful evaluation performance measures. This paper reports on the contest details including the evaluation measures used as well as the performance of the 17 submitted methods along with a short description of each method.
暂无评论