http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
ON THE PURE IMAGINARY QUATERNIONIC LEAST SQUARES SOLUTIONS OF MATRIX EQUATION
WANG, MINGHUI,ZHANG, JUNTAO The Korean Society for Computational and Applied M 2016 Journal of applied mathematics & informatics Vol.34 No.1
In this paper, according to the classical LSQR algorithm forsolving least squares (LS) problem, an iterative method is proposed for finding the minimum-norm pure imaginary solution of the quaternionic least squares (QLS) problem. By means of real representation of quaternion matrix, the QLS's correspongding vector algorithm is rewrited back to the matrix-form algorthm without Kronecker product and long vectors. Finally, numerical examples are reported that show the favorable numerical properties of the method.
The Role of Switching Costs in O2O Platforms: Antecedents and Consequences
Minghui Kang,Yiwen Gao,Tao Wang,Meng Wang 보안공학연구지원센터 2015 International Journal of Smart Home Vol.9 No.3
Online to offline is a new business mode combining the online shopping and the front line transactions. No previous studies have simultaneously examined these variables as antecedents of e-loyalty intention or the possible relationships among them within O2O platform. Our paper has examined the effects of inertia; perceived ease of use, customization and quality of offering on the consumer’s switching costs. These findings provide a theoretical foundation for academics and also practical guidelines for service providers in dealing with the promotion of loyalty at O2O platforms.
ITERATIVE ALGORITHMS FOR THE LEAST-SQUARES SYMMETRIC SOLUTION OF AXB = C WITH A SUBMATRIX CONSTRAINT
Wang, Minghui,Feng, Yan The Korean Society for Computational and Applied M 2009 Journal of applied mathematics & informatics Vol.27 No.1
Iterative algorithms are proposed for the least-squares symmetric solution of AXB = E with a submatrix constraint. We characterize the linear mappings from their independent element space to the constrained solution sets, study their properties and use these properties to propose two matrix iterative algorithms that can find the minimum and quasi-minimum norm solution based on the classical LSQR algorithm for solving the unconstrained LS problem. Numerical results are provided that show the efficiency of the proposed methods.
On the pure imaginary quaternionic least squares solutions of matrix equation
Minghui Wang,Juntao Zhang 한국전산응용수학회 2016 Journal of applied mathematics & informatics Vol.34 No.1
In this paper, according to the classical LSQR algorithm for solving least squares (LS) problem, an iterative method is proposed for finding the minimum-norm pure imaginary solution of the quaternionic least squares (QLS) problem. By means of real representation of quaternion matrix, the QLS's correspongding vector algorithm is rewrited back to the matrix-form algorthm without Kronecker product and long vectors. Finally, numerical examples are reported that show the favorable numerical properties of the method.
Iterative algorithms for the least-squares symmetric solution of AXB=C with a submatrix constraint
Minghui Wang,Yan Feng 한국전산응용수학회 2009 Journal of applied mathematics & informatics Vol.27 No.1
Iterative algorithms are proposed for the least-squares sym- metric solution of AXB = E with a submatrix constraint. We charac- terize the linear mappings from their independent element space to the constrained solution sets, study their properities and use these properties to propose two matrix iterative algorithms that can find the minimum and quasi-minimum norm solution based on the classical LSQR algorithm for solving the unconstrained LS problem. Numerical results are provided that show the efficiency of the proposed methods. Iterative algorithms are proposed for the least-squares sym- metric solution of AXB = E with a submatrix constraint. We charac- terize the linear mappings from their independent element space to the constrained solution sets, study their properities and use these properties to propose two matrix iterative algorithms that can find the minimum and quasi-minimum norm solution based on the classical LSQR algorithm for solving the unconstrained LS problem. Numerical results are provided that show the efficiency of the proposed methods.
Minghui Wang,Jae Young Choi,Dong Hwan Park,Siyi Liu,Yeon Ho Je 한국응용곤충학회 2024 한국응용곤충학회 학술대회논문집 Vol.2024 No.04
Spodoptera exigua is one of the worldwide distributed agricultural pest insects and has been known to show high resistance to conventional chemical insecticides. Autographa california multiple nucleopolyhedrovirus (AcMNPV) has been used as eco-friendly biological control agent for S. exigua, as it exhibits high level of host specificity, stability and safety. In this study, for formulation of AcMNPV, the optimal conditions for mass-production of AcMNPV polyhedra was established using S. exigua larvae. Mass-produced AcMNPV polyhedra was formulated as wettable powder using microencapsulation method and its control efficacy against S. exigua was evaluated both in laboratory and semi-field experiment. Chinese cabbage treated with the AcMNPV formulation showed significantly reduced damage rates, suggesting that the AcMNPV formulation in this study could be useful for control of S. exigua