Search

The high density, large capacity, and long-term stability of DNA molecules make them an emerging storage medium that is especially suitable for the long-term storage of large datasets. The DNA sequences used in storage need to consider relevant constraints to avoid nonspecific hybridization reactions, such as the No-runlength constraint, GC-content, and the Hamming distance. In this work, a new nonlinear control parameter strategy and a random opposition-based learning strategy were used to improve the Harris hawks optimization algorithm (for the improved algorithm NOL-HHO) in order to prevent it from falling into local optima. Experimental testing was performed on 23 widely used benchmark functions, and the proposed algorithm was used to obtain better coding lower bounds for DNA storage. The results show that our algorithm can better maintain a smooth transition between exploration and exploitation and has stronger global exploration capabilities as compared with other algorithms. At the same time, the improvement of the lower bound directly affects the storage capacity and code rate, which promotes the further development of DNA storage technology.

Global exponential stability is considered for a class of discrete-time cellular neural networks with variable delays. By employing a discrete Halanay inequality, a new result is presented ensuring global exponential stability of the unique equilibrium point of the networks. The result extends and improves the earlier publications due to the fact that it removes some restrictions on the delay. An example is given to illustrate the effectiveness of the global exponential stability condition provided here. [ABSTRACT FROM AUTHOR]

Abstract: This paper provides a new sufficient condition for the complete stability of the delayed cellular neural networks. This condition imposes constraints on the parameters of the networks and the size of time delay. The linear matrix inequality approach plays an important role in the proof. Our result recovers the known results in the earlier literature as special cases. Finally, we give an example to illustrate the applicability of our main result. [Copyright &y& Elsevier]

Abstract: Face recognition has become a research hotspot in the field of pattern recognition and artificial intelligence. Principal Component Analysis (PCA) and Linear Discriminant Analysis (LDA) are two traditional methods in pattern recognition. In this paper, we propose a novel method based on PCA image reconstruction and LDA for face recognition. First, the inner-classes covariance matrix for feature extraction is used as generating matrix and then eigenvectors from each person is obtained, then we obtain the reconstructed images. Moreover, the residual images are computed by subtracting reconstructed images from original face images. Furthermore, the residual images are applied by LDA to obtain the coefficient matrices. Finally, the features are utilized to train and test SVMs for face recognition. The simulation experiments illustrate the effectivity of this method on the ORL face database. [Copyright &y& Elsevier]