Search

Protein cysteine S-sulfenylation is an essential and reversible post-translational modification that plays a crucial role in transcriptional regulation, stress response, cell signaling and protein function. Studies have shown that S-sulfenylation is involved in many human diseases such as cancer, diabetes and arteriosclerosis. However, experimental identification of protein S-sulfenylation sites is generally expensive and time-consuming. In this study, we proposed a new protein S-sulfenylation sites prediction method SulSite-GTB. First, fusion of amino acid composition, dipeptide composition, encoding based on grouped weight, K nearest neighbors, position-specific amino acid propensity, position-weighted amino acid composition and pseudo-position specific score matrix feature extraction to obtain the initial feature space. Secondly, we use the synthetic minority oversampling technique (SMOTE) algorithm to process the class imbalance data, and the least absolute shrinkage and selection operator (LASSO) are employed to remove the redundant and irrelevant features. Finally, the optimal feature subset is input into the gradient tree boosting classifier to predict the S-sulfenylation sites, and the five-fold cross-validation and independent test set method are used to evaluate the prediction performance of the model. Experimental results showed the overall prediction accuracy is 92.86% and 88.53%, respectively, and the AUC values are 0.9706 and 0.9425, respectively, on the training set and the independent test set. Compared with other prediction methods, the results show that the proposed method SulSite-GTB is significantly superior to other state-of-the-art methods and provides a new idea for the prediction of post-translational modification sites of other proteins. The source code and all datasets are available at https://github.com/QUST-AIBBDRC/SulSite-GTB/. [ABSTRACT FROM AUTHOR]

Aiming at the problem that traditional similarity calculation method is not enough to capture the similarity relationship between users, a distributed collaborative filtering recommendation algorithm based on DHT is proposed for active users in distributed recommendation system to locate nearest neighbors. The algorithm searches the user's similar neighbor information according to the "fuzzy critical value" generated by the user's extreme score, so as to improve the search efficiency of the user similar neighbors. According to the distribution of user information, the calculation method of user neighbor similarity is improved. The similarity calculation is weighted, and the setting of the weights takes into account the two factors: the similarity degree between users and the inverse user information frequency. [ABSTRACT FROM AUTHOR]

Abstract: Image fusion can produce a single image that describes the scene better than the individual source image. One of the keys to image fusion algorithm is how to effectively and completely represent the source images. Morphological component analysis (MCA) believes that an image contains structures with different spatial morphologies and can be accordingly modeled as a superposition of cartoon and texture components, and that the sparse representations of these components can be obtained by some specific decomposition algorithms which exploit the structured dictionary. Compared with the traditional multiscale decomposition, which has been successfully applied to pixel-level image fusion, MCA employs the morphological diversity of an image and provides more complete representation for an image. Taking advantage of this property, we propose a multi-component fusion method for multi-source images in this paper. In our method, source images are separated into cartoon and texture components, and essential fusion takes place on the representation coefficients of these two components. Our fusion scheme is verified on three kinds of images and compared with six single-component fusion methods. According to the visual perceptions and objective evaluations on the fused results, our method can produce better fused images in our experiments, compared with other single-component fusion methods. [Copyright &y& Elsevier]

Abstract: In this paper, we discuss the Cholesky decomposition of the Hermitian positive definite quaternion matrix. For the first time, the structure-preserving Gauss transformation is defined, and then a novel structure-preserving algorithm, which is applied to its real representation matrix, is proposed. Our algorithm needs only real number operations, does not depend on the quaternion toolbox for matlab (QTFM) and has more portability. Although the flops of our algorithm are theoretically about the same as those based on quaternion arithmetic operations or QTFM, numerical experiments show that our algorithm runs faster. [Copyright &y& Elsevier]

In this paper, a new image fusion algorithm based on non-subsampled contourlet transform (NSCT) is proposed for the fusion of multi-focus images. The selection of different subband coefficients obtained by the NSCT decomposition is critical to image fusion. So, in this paper, firstly, original images are decomposed into different frequency subband coefficients by NSCT. Secondly, the selection of the low-frequency subband coefficients and the bandpass directional subband coefficients is discussed in detail. For the selection of the low-frequency subband coefficients, the non-negative matrix factorization (NMF) method is adopted. For the selection of bandpass directional subband coefficients, a regional cross-gradient method that selects the coefficients according to the minimum of the regional cross-gradient is proposed. Finally, the fused image is obtained by performing the inverse NSCT on the combined coefficients. The experimental results show that the proposed fusion algorithm can achieve significant results in getting a new image where all parts are sharp. [ABSTRACT FROM PUBLISHER]

In this article, we propose an iterative algorithm to compute the minimum norm least-squares solution of AXB+CYD=E, based on a matrix form of the algorithm LSQR for solving the least squares problem. We then apply this algorithm to compute the minimum norm least-squares centrosymmetric solution of min X|AXB-E|F. Numerical results are provided to verify the efficiency of the proposed method. [ABSTRACT FROM AUTHOR]

Abstract: In this paper, we propose two iterative algorithms to solve the matrix equation AXB + CX T D = E. The first algorithm is applied when the matrix equation is consistent. In this case, for any (special) initial matrix X 1, a solution (the minimal Frobenius norm solution) can be obtained within finite iteration steps in the absence of roundoff errors. The second algorithm is applied when the matrix equation is inconsistent. In this case, for any (special) initial matrix X 1, a least squares solution (the minimal Frobenius norm least squares solution) can be obtained within finite iteration steps in the absence of roundoff errors. Some examples verify the efficiency of these algorithms. [Copyright &y& Elsevier]

In this paper we present an algorithm for the application of simultaneous localization and mapping in complex environments. Instead of building a grid map or building a feature map with a small number of the obstacles' geometric parameters, the proposed algorithm builds a sampled environment map (SEM) to represent a complex environment with a set of environment samples. To overcome the lack of one-toone correspondence between environment samples and raw observations, the signed orthogonal distance function is proposed to be used as the observation model. A method considering geometric constraints is presented to remove redundant environment samples from the SEM. We also present a method to improve the SEM's topological consistency by using corner constraints. The proposed algorithm has been verified in a simulation and an indoor experiment. The results show that the algorithm can localize the robot and build a complex map effectively. [ABSTRACT FROM AUTHOR]