Spiking neural P systems (SN P systems, for short) are a class of distributed parallel computing devices inspired from the way neurons communicate by means of spikes. In this work, a discrete structure representation ...
详细信息
Randić et al. proposed a famous spectral graphical representation of DNA sequences, and claimed that it avoids loss of information. In this paper we build two mathematical models for this graphical representation and ...
详细信息
Randić et al. proposed a famous spectral graphical representation of DNA sequences, and claimed that it avoids loss of information. In this paper we build two mathematical models for this graphical representation and prove that the claim is correct, and that it also avoids degeneracy. Moreover, we propose a new method to do similarity analysis of DNA sequences based on the spectral representation. The method adopts M value to characterize a graphical representation and uses 24-component vector as descriptor. The approach is illustrated on the complete coding sequence of beta-globin genes from 7 different species.
In order to solve the problem of image degradation caused by dust environments, an image degradation model considering multiple scattering factors caused by dust was first established using the first-order multiple sc...
详细信息
In order to solve the problem of image degradation caused by dust environments, an image degradation model considering multiple scattering factors caused by dust was first established using the first-order multiple scattering method. Then, a dark channel prior principle was applied to present an image restoration algorithm based on the image degradation model. Finally, a particle swarm optimization algorithm was applied to optimize the atmospheric light and the exposure parameters. This optimization algorithm was established according to the criterion of the image evaluation based on kirsch operator with dual threshold. By using the method an optimistic result of image restoration was obtained. The experimental results have shown that the method not only enhanced luminance and contrast, but also discovered more detail edges information. The method provided a foundation for target recognition in the dust environments.
In order to solve the problem of image degradation caused by dust environments, an image degradation model considering multiple scattering factors caused by dust was first established using the first-order multiple sc...
详细信息
In order to solve the problem of image degradation caused by dust environments, an image degradation model considering multiple scattering factors caused by dust was first established using the first-order multiple scattering method. Then, a dark channel prior principle was applied to present an image restoration algorithm based on the image degradation model. Finally, GA optimization algorithm was applied to optimize the atmospheric light and the exposure parameters. This optimization algorithm was established according to the criterion of the image evaluation based on kirsch operator with automatic threshold. By using the method an optimistic result of image restoration was obtained. The experimental results have shown that the method not only enhanced luminance and contrast, but also discovered more detail edges information. The method provided a foundation for target recognition in the dust environments.
This paper investigates how to maintain an efficient dynamic ordered set of bit strings, which is an important problem in the field of information search and information processing. Generally, a dynamic ordered set is...
详细信息
This paper investigates how to maintain an efficient dynamic ordered set of bit strings, which is an important problem in the field of information search and information processing. Generally, a dynamic ordered set is required to support 5 essential operations including search, insertion, deletion, max-value retrieval and next-larger-value retrieval. Based on previous research fruits, we present an advanced data structure named rich binary tree （RBT）, which follows both the binary-search-tree property and the digital-search-tree property. Also, every key K keeps the most significant difference bit （MSDB） between itself and the next larger value among K＇s ancestors, as well as that between itself and the next smaller one among its ancestors. With the new data structure, we can maintain a dynamic ordered set in O（L） time. Since computers represent objects in binary mode, our method has a big potential in application. In fact, RBT can be viewed as a general-purpose data structure for problems concerning order, such as search, sorting and maintaining a priority queue. For example, when RBT is applied in sorting, we get a linear-time algorithm with regard to the key number and its performance is far better than quick-sort. What is more powerful than quick-sort is that RBT supports constant-time dynamic insertion/deletion.
This paper presents a parallel artificial immune model termed as tower master-slave model (TMSM) for solving optimising problems. Based on TMSM, the parallel immune memory clonal selection algorithm (PIMCSA) is also p...
详细信息
Because of noise and clutter, the infrared target detection even becomes more difficult. In this paper, we present an automatic seed selection method based on an improved mountain cluster algorithm to be employed in i...
详细信息
This paper presents a strong noise image enhancement method based on intrascale dependencies of the second generation curvelet transform. Observing that the immediate four neighbor coefficients bear the most important...
详细信息
By inspiration of the granular evolutionary algorithm, a Granular Agent Evolutionary algorithm for Classification (GAEC) is proposed. The method uses the granular agent to denote the set of examples that have similar ...
详细信息
By inspiration of the granular evolutionary algorithm, a Granular Agent Evolutionary algorithm for Classification (GAEC) is proposed. The method uses the granular agent to denote the set of examples that have similar attributions and the knowledge base guides the evolutionary of granular agent. Also some granular evolutionary operators are designed for classification problem. Assimilation operator, exchange operator, and differentiation operator reflect the competitive, cooperative and self-learning ability of agent respectively. Finally, some classification rules are extracted from granular agents by some strategies to forecast the sort of new data. Empirical studies show that the algorithm has a good classification prediction, and only need a small price for the training time. In most UCI datasets, the performance of GAEC is better than G-NET, OCEC and C4.5, which have good performance.
How to make full use of the limited energy available and prolonging the survival time of node is a major concern in research on Wireless Sensor Networks (WSNs). This paper presented an improved approach based on Direc...
详细信息
ISBN:
(纸本)9780769538235
How to make full use of the limited energy available and prolonging the survival time of node is a major concern in research on Wireless Sensor Networks (WSNs). This paper presented an improved approach based on Directed Diffusion Protocol (DDP) which could meet the features of WSN, such as data-oriented, many-to-one transmissions and low energy costs, together with data aggregation mechanisms which emphasized on cascading timeouts, to eliminate the redundancy caused by the transmission of large amounts of data. This modified protocol prohibited the direct forwarding of central nodes, balancing data traffic of different sensors between the source and the sink, and proved to be able of reducing total network flows, energy consumptions and prolonging the lifetime of the network through simulations.
暂无评论