Quadratic matrix equations arise in many elds of scienti c computing and engineering applications.In this paper,we consider a class of quadratic matrix equations.Under a certain condition,we rst prove the existence of...Quadratic matrix equations arise in many elds of scienti c computing and engineering applications.In this paper,we consider a class of quadratic matrix equations.Under a certain condition,we rst prove the existence of minimal nonnegative solution for this quadratic matrix equation,and then propose some numerical methods for solving it.Convergence analysis and numerical examples are given to verify the theories and the numerical methods of this paper.展开更多
This paper an cited instances in illustration of the incorrectness of the criteria of asymptotic stability of a class of nonlinear large seale system that L_j·T·Grujie gave in paper [1] by the comparison the...This paper an cited instances in illustration of the incorrectness of the criteria of asymptotic stability of a class of nonlinear large seale system that L_j·T·Grujie gave in paper [1] by the comparison theory and then corrected it,and has given the sufficient conditions of the asymptotic stability.展开更多
Problems existin similarity measurement and index tree construction which affect the performance of nearest neighbor search of high-dimensional data. The equidistance problem is solved using NPsim function to calculat...Problems existin similarity measurement and index tree construction which affect the performance of nearest neighbor search of high-dimensional data. The equidistance problem is solved using NPsim function to calculate similarity. And a sequential NPsim matrix is built to improve indexing performance. To sum up the above innovations,a nearest neighbor search algorithm of high-dimensional data based on sequential NPsim matrix is proposed in comparison with the nearest neighbor search algorithms based on KD-tree or SR-tree on Munsell spectral data set. Experimental results show that the proposed algorithm similarity is better than that of other algorithms and searching speed is more than thousands times of others. In addition,the slow construction speed of sequential NPsim matrix can be increased by using parallel computing.展开更多
The existing collaborative recommendation algorithms have lower robustness against shilling attacks.With this problem in mind,in this paper we propose a robust collaborative recommendation algorithm based on k-distanc...The existing collaborative recommendation algorithms have lower robustness against shilling attacks.With this problem in mind,in this paper we propose a robust collaborative recommendation algorithm based on k-distance and Tukey M-estimator.Firstly,we propose a k-distancebased method to compute user suspicion degree(USD).The reliable neighbor model can be constructed through incorporating the user suspicion degree into user neighbor model.The influence of attack profiles on the recommendation results is reduced through adjusting similarities among users.Then,Tukey M-estimator is introduced to construct robust matrix factorization model,which can realize the robust estimation of user feature matrix and item feature matrix and reduce the influence of attack profiles on item feature matrix.Finally,a robust collaborative recommendation algorithm is devised by combining the reliable neighbor model and robust matrix factorization model.Experimental results show that the proposed algorithm outperforms the existing methods in terms of both recommendation accuracy and robustness.展开更多
As a generalization to the heat semigroup on the Heisenberg group, the diffusion semigroup generated by the subelliptic operator L :=1/2 sum from i=1 to m X_i^2 on R^(m+d):= R^m× R^d is investigated, where X_i(x...As a generalization to the heat semigroup on the Heisenberg group, the diffusion semigroup generated by the subelliptic operator L :=1/2 sum from i=1 to m X_i^2 on R^(m+d):= R^m× R^d is investigated, where X_i(x, y) = sum (σki?xk) from k=1 to m+sum (((A_lx)_i?_(yl)) from t=1 to d,(x, y) ∈ R^(m+d), 1 ≤ i ≤ m for σ an invertible m × m-matrix and {A_l}_1 ≤ l ≤d some m × m-matrices such that the Hrmander condition holds.We first establish Bismut-type and Driver-type derivative formulas with applications on gradient estimates and the coupling/Liouville properties, which are new even for the heat semigroup on the Heisenberg group; then extend some recent results derived for the heat semigroup on the Heisenberg group.展开更多
The authors present a new queueing model with （e, d） setup time. Using the quasi-birth-and-death process and matrix-geometric method, the authors obtain the stationary distribution of queue length and the LST of wai...The authors present a new queueing model with （e, d） setup time. Using the quasi-birth-and-death process and matrix-geometric method, the authors obtain the stationary distribution of queue length and the LST of waiting time of a customer in the system. Furthermore, the conditional stochastic decomposition results of queue length and waiting time are given.展开更多
In this paper we will analyse the Aharony-Bergman-Jafferis-Maldacena(ABJM) theory in N = 1 superspace formalism.We then study the quantum gauge transformations for this ABJM theory in gaugeon formalism.We will also an...In this paper we will analyse the Aharony-Bergman-Jafferis-Maldacena(ABJM) theory in N = 1 superspace formalism.We then study the quantum gauge transformations for this ABJM theory in gaugeon formalism.We will also analyse the extended BRST symmetry for this ABJM theory in gaugeon formalism and show that these BRST transformations for this theory are nilpotent and this in turn leads to the unitary evolution of the S-matrix.展开更多
基金Supported by the National Natural Science Foundation of China(12001395)the special fund for Science and Technology Innovation Teams of Shanxi Province(202204051002018)+1 种基金Research Project Supported by Shanxi Scholarship Council of China(2022-169)Graduate Education Innovation Project of Taiyuan Normal University(SYYJSYC-2314)。
文摘Quadratic matrix equations arise in many elds of scienti c computing and engineering applications.In this paper,we consider a class of quadratic matrix equations.Under a certain condition,we rst prove the existence of minimal nonnegative solution for this quadratic matrix equation,and then propose some numerical methods for solving it.Convergence analysis and numerical examples are given to verify the theories and the numerical methods of this paper.
文摘This paper an cited instances in illustration of the incorrectness of the criteria of asymptotic stability of a class of nonlinear large seale system that L_j·T·Grujie gave in paper [1] by the comparison theory and then corrected it,and has given the sufficient conditions of the asymptotic stability.
文摘In this paper, we present a spectral property of a comparison matrix, which improves and generalize the comparison theorem of nonsingular M-matrices.
基金Supported by the National Natural Science Foundation of China(No.61300078)the Importation and Development of High-Caliber Talents Project of Beijing Municipal Institutions(No.CIT&TCD201504039)+1 种基金Funding Project for Academic Human Resources Development in Beijing Union University(No.BPHR2014A03,Rk100201510)"New Start"Academic Research Projects of Beijing Union University(No.Hzk10201501)
文摘Problems existin similarity measurement and index tree construction which affect the performance of nearest neighbor search of high-dimensional data. The equidistance problem is solved using NPsim function to calculate similarity. And a sequential NPsim matrix is built to improve indexing performance. To sum up the above innovations,a nearest neighbor search algorithm of high-dimensional data based on sequential NPsim matrix is proposed in comparison with the nearest neighbor search algorithms based on KD-tree or SR-tree on Munsell spectral data set. Experimental results show that the proposed algorithm similarity is better than that of other algorithms and searching speed is more than thousands times of others. In addition,the slow construction speed of sequential NPsim matrix can be increased by using parallel computing.
基金National Natural Science Foundation of China under Grant No.61379116，Natural Science Foundation of Hebei Province under Grant No.F2015203046 and No.F2013203124，Key Program of Research on Science and Technology of Higher Education Institutions of Hebei Province under Grant No.ZH2012028
文摘The existing collaborative recommendation algorithms have lower robustness against shilling attacks.With this problem in mind,in this paper we propose a robust collaborative recommendation algorithm based on k-distance and Tukey M-estimator.Firstly,we propose a k-distancebased method to compute user suspicion degree(USD).The reliable neighbor model can be constructed through incorporating the user suspicion degree into user neighbor model.The influence of attack profiles on the recommendation results is reduced through adjusting similarities among users.Then,Tukey M-estimator is introduced to construct robust matrix factorization model,which can realize the robust estimation of user feature matrix and item feature matrix and reduce the influence of attack profiles on item feature matrix.Finally,a robust collaborative recommendation algorithm is devised by combining the reliable neighbor model and robust matrix factorization model.Experimental results show that the proposed algorithm outperforms the existing methods in terms of both recommendation accuracy and robustness.
基金supported by National Natural Science Foundation of China(Grant Nos.11131003 and 11431014)the 985 Project and the Laboratory of Mathematical and Complex Systems
文摘As a generalization to the heat semigroup on the Heisenberg group, the diffusion semigroup generated by the subelliptic operator L :=1/2 sum from i=1 to m X_i^2 on R^(m+d):= R^m× R^d is investigated, where X_i(x, y) = sum (σki?xk) from k=1 to m+sum (((A_lx)_i?_(yl)) from t=1 to d,(x, y) ∈ R^(m+d), 1 ≤ i ≤ m for σ an invertible m × m-matrix and {A_l}_1 ≤ l ≤d some m × m-matrices such that the Hrmander condition holds.We first establish Bismut-type and Driver-type derivative formulas with applications on gradient estimates and the coupling/Liouville properties, which are new even for the heat semigroup on the Heisenberg group; then extend some recent results derived for the heat semigroup on the Heisenberg group.
基金the National Natural Science Foundation of China under Grant No.10671170the Doctorial Foundation of Yanshan University under Grant No.B228.
文摘The authors present a new queueing model with （e, d） setup time. Using the quasi-birth-and-death process and matrix-geometric method, the authors obtain the stationary distribution of queue length and the LST of waiting time of a customer in the system. Furthermore, the conditional stochastic decomposition results of queue length and waiting time are given.
文摘In this paper we will analyse the Aharony-Bergman-Jafferis-Maldacena(ABJM) theory in N = 1 superspace formalism.We then study the quantum gauge transformations for this ABJM theory in gaugeon formalism.We will also analyse the extended BRST symmetry for this ABJM theory in gaugeon formalism and show that these BRST transformations for this theory are nilpotent and this in turn leads to the unitary evolution of the S-matrix.
