A proof is given that any λ _polynome over real quaternionic sfield can be factorized into produce of some linear factors.By the way,some properties and applications of this factorization in matrix theory are given.
Recently clustering techniques have been used to automatically discover typical user profiles. In general, it is a challenging problem to design effective similarity measure between the session vectors which are usual...Recently clustering techniques have been used to automatically discover typical user profiles. In general, it is a challenging problem to design effective similarity measure between the session vectors which are usually high-dimensional and sparse. Two approaches for mining typical user profiles, based on matrix dimensionality reduction, are presented. In these approaches, non-negative matrix factorization is applied to reduce dimensionality of the session-URL matrix, and the projecting vectors of the user-session vectors are clustered into typical user-session profiles using the spherical k -means algorithm. The results show that two algorithms are successful in mining many typical user profiles in the user sessions.展开更多
Finding solutions of matrix equations in given set SR n×n is an active research field. Lots of investigation have done for these cases, where S are the sets of general or symmetric matrices and symmetric posit...Finding solutions of matrix equations in given set SR n×n is an active research field. Lots of investigation have done for these cases, where S are the sets of general or symmetric matrices and symmetric positive definite or sysmmetric semiposite definite matrices respectively . Recently, however, attentions are been paying to the situation for S to be the set of general(semi) positive definite matrices(called as semipositive subdefinite matrices below) . In this paper the necessary and sufficient conditions for the following two kinds of matrix equations having semipositive, subdefinite solutions are obtained. General solutions and symmetric solutions of the equations (Ⅰ) and (Ⅱ) have been considered in in detail.展开更多
Finding the nearest volume-preserving matrix for a given matrix is studied. Amatrix equation is first obtained, which is a necessary condition for the solution to the problem.Then the equation is solved by the singula...Finding the nearest volume-preserving matrix for a given matrix is studied. Amatrix equation is first obtained, which is a necessary condition for the solution to the problem.Then the equation is solved by the singular value decomposition method. Some additional results arealso provided to further characterize the solution. Using these results, a numerical algorithm isintroduced and a numerical test is given to illustrate the effectiveness of the algorithm.展开更多
Abstract： At first one of g-inverses of A （×） In＋Im（×） BT is given out, then the explicit solution to matrix equation AX ＋ XB = C is gained by using the method of matrix decomposition, finally, a nume...Abstract： At first one of g-inverses of A （×） In＋Im（×） BT is given out, then the explicit solution to matrix equation AX ＋ XB = C is gained by using the method of matrix decomposition, finally, a numerical example is obtained.展开更多
We investigate the realization of 2-qutrit logic gate in a bipartite 3-level system with qusi-Ising interaction. On the basis of Caftan decomposition of matrices, the unitary matrices of 2-qutrit are factorized into p...We investigate the realization of 2-qutrit logic gate in a bipartite 3-level system with qusi-Ising interaction. On the basis of Caftan decomposition of matrices, the unitary matrices of 2-qutrit are factorized into products of a series of realizable matrices. It is equivalent to exerting a certain control field on the system, and the control goal is usually gained by a sequence of control pulses. The general discussion on the realization of 2-qutrit logic gate is made first, and then the realization of the ternary SWAP gate and the ternary √SWAP gate are discussed specifically, and the sequences of control pulses and drift processes implementing these gates are given.展开更多
In this paper we derive a practical method of solving simultaneously the problem of Schmidt decomposition of quaternion matrix and the orthonormalization of vectors in a generalized unitary space by using elementary c...In this paper we derive a practical method of solving simultaneously the problem of Schmidt decomposition of quaternion matrix and the orthonormalization of vectors in a generalized unitary space by using elementary column operations on matrices over the quaternion field.展开更多
An image fusion method combining complex contourlet transform(CCT) with nonnegative matrix factorization(NMF) is proposed in this paper.After two images are decomposed by CCT,NMF is applied to their highand low-freque...An image fusion method combining complex contourlet transform(CCT) with nonnegative matrix factorization(NMF) is proposed in this paper.After two images are decomposed by CCT,NMF is applied to their highand low-frequency components,respectively,and finally an image is synthesized.Subjective-visual-quality of the image fusion result is compared with those of the image fusion methods based on NMF and the combination of wavelet /contourlet /nonsubsampled contourlet with NMF.The experimental results are evaluated quantitatively,and the running time is also contrasted.It is shown that the proposed image fusion method can gain larger information entropy,standard deviation and mean gradient,which means that it can better integrate featured information from all source images,avoid background noise and promote space clearness in the fusion image effectively.展开更多
Collaborative f iltering, as one of the most popular techniques, plays an important role in recommendation systems. However,when the user-item rating matrix is sparse,its performance will be degenerate. Recently,domai...Collaborative f iltering, as one of the most popular techniques, plays an important role in recommendation systems. However,when the user-item rating matrix is sparse,its performance will be degenerate. Recently,domain-specific recommendation approaches have been developed to address this problem.The basic idea is to partition the users and items into overlapping domains, and then perform recommendation in each domain independently. Here, a domain means a group of users having similar preference to a group of products. However, these domain-specific methods consisting of two sequential steps ignore the mutual benefi t of domain segmentation and recommendation. Hence, a unified framework is presented to simultaneously realize recommendation and make use of the domain information underlying the rating matrix in this paper. Based on matrix factorization,the proposed model learns both user preferences of multiple domains and preference selection vectors to select relevant features for each group of products. Besides, local context information is utilized from the user-item rating matrix to enhance the new framework.Experimental results on two widely used datasets, e.g., Ciao and Epinions, demonstrate the effectiveness of our proposed model.展开更多
文摘A proof is given that any λ _polynome over real quaternionic sfield can be factorized into produce of some linear factors.By the way,some properties and applications of this factorization in matrix theory are given.
文摘Recently clustering techniques have been used to automatically discover typical user profiles. In general, it is a challenging problem to design effective similarity measure between the session vectors which are usually high-dimensional and sparse. Two approaches for mining typical user profiles, based on matrix dimensionality reduction, are presented. In these approaches, non-negative matrix factorization is applied to reduce dimensionality of the session-URL matrix, and the projecting vectors of the user-session vectors are clustered into typical user-session profiles using the spherical k -means algorithm. The results show that two algorithms are successful in mining many typical user profiles in the user sessions.
文摘Finding solutions of matrix equations in given set SR n×n is an active research field. Lots of investigation have done for these cases, where S are the sets of general or symmetric matrices and symmetric positive definite or sysmmetric semiposite definite matrices respectively . Recently, however, attentions are been paying to the situation for S to be the set of general(semi) positive definite matrices(called as semipositive subdefinite matrices below) . In this paper the necessary and sufficient conditions for the following two kinds of matrix equations having semipositive, subdefinite solutions are obtained. General solutions and symmetric solutions of the equations (Ⅰ) and (Ⅱ) have been considered in in detail.
文摘Finding the nearest volume-preserving matrix for a given matrix is studied. Amatrix equation is first obtained, which is a necessary condition for the solution to the problem.Then the equation is solved by the singular value decomposition method. Some additional results arealso provided to further characterize the solution. Using these results, a numerical algorithm isintroduced and a numerical test is given to illustrate the effectiveness of the algorithm.
文摘Abstract： At first one of g-inverses of A （×） In＋Im（×） BT is given out, then the explicit solution to matrix equation AX ＋ XB = C is gained by using the method of matrix decomposition, finally, a numerical example is obtained.
基金supported by the National Natural Science Foundation of China under Grant No. 60433050the Science Foundation of Xuzhou Normal University under Grant No. 06XLA05
文摘We investigate the realization of 2-qutrit logic gate in a bipartite 3-level system with qusi-Ising interaction. On the basis of Caftan decomposition of matrices, the unitary matrices of 2-qutrit are factorized into products of a series of realizable matrices. It is equivalent to exerting a certain control field on the system, and the control goal is usually gained by a sequence of control pulses. The general discussion on the realization of 2-qutrit logic gate is made first, and then the realization of the ternary SWAP gate and the ternary √SWAP gate are discussed specifically, and the sequences of control pulses and drift processes implementing these gates are given.
文摘In this paper we derive a practical method of solving simultaneously the problem of Schmidt decomposition of quaternion matrix and the orthonormalization of vectors in a generalized unitary space by using elementary column operations on matrices over the quaternion field.
基金Supported by National Natural Science Foundation of China (No. 60872065)
文摘An image fusion method combining complex contourlet transform(CCT) with nonnegative matrix factorization(NMF) is proposed in this paper.After two images are decomposed by CCT,NMF is applied to their highand low-frequency components,respectively,and finally an image is synthesized.Subjective-visual-quality of the image fusion result is compared with those of the image fusion methods based on NMF and the combination of wavelet /contourlet /nonsubsampled contourlet with NMF.The experimental results are evaluated quantitatively,and the running time is also contrasted.It is shown that the proposed image fusion method can gain larger information entropy,standard deviation and mean gradient,which means that it can better integrate featured information from all source images,avoid background noise and promote space clearness in the fusion image effectively.
基金supported in part by the Humanity&Social Science general project of Ministry of Education under Grants No.14YJAZH046National Science Foundation of China under Grants No.61402304the Beijing Educational Committee Science and Technology Development Planned under Grants No.KM201610028015
文摘Collaborative f iltering, as one of the most popular techniques, plays an important role in recommendation systems. However,when the user-item rating matrix is sparse,its performance will be degenerate. Recently,domain-specific recommendation approaches have been developed to address this problem.The basic idea is to partition the users and items into overlapping domains, and then perform recommendation in each domain independently. Here, a domain means a group of users having similar preference to a group of products. However, these domain-specific methods consisting of two sequential steps ignore the mutual benefi t of domain segmentation and recommendation. Hence, a unified framework is presented to simultaneously realize recommendation and make use of the domain information underlying the rating matrix in this paper. Based on matrix factorization,the proposed model learns both user preferences of multiple domains and preference selection vectors to select relevant features for each group of products. Besides, local context information is utilized from the user-item rating matrix to enhance the new framework.Experimental results on two widely used datasets, e.g., Ciao and Epinions, demonstrate the effectiveness of our proposed model.
