Impacted craters are commonly found on the surface of planets, satellites, asteroids and other solar system bodies. In order to speed up the rate of constructing the database of craters, it is important to develop cra...Impacted craters are commonly found on the surface of planets, satellites, asteroids and other solar system bodies. In order to speed up the rate of constructing the database of craters, it is important to develop crater detection algorithms. This paper presents a novel approach to automatically detect craters on planetary surfaces. The approach contains two parts： crater candidate region selection and crater detection. In the first part, crater candidate region selection is achieved by Kanade-Lucas-Tomasi （KLT） detector. Matrix-pattern-oriented least squares support vector machine （MatLSSVM）, as the matrixization version of least square support vector machine （SVM）, inherits the advantages of least squares support vector machine （LSSVM）, reduces storage space greatly and reserves spatial redundancies within each image matrix compared with general LSSVM. The second part of the approach employs MatLSSVM to design classifier for crater detection. Experimental results on the dataset which comprises 160 preprocessed image patches from Google Mars demonstrate that the accuracy rate of crater detection can be up to 88%. In addition, the outstanding feature of the approach introduced in this paper is that it takes resized crater candidate region as input pattern directly to finish crater detection. The results of the last experiment demonstrate that MatLSSVM-based classifier can detect crater regions effectively on the basis of KLT-based crater candidate region selection.展开更多
As one of the most essential and important operations in linear algebra, the performance prediction of sparse matrix-vector multiplication (SpMV) on GPUs has got more and more attention in recent years. In 2012, Guo a...As one of the most essential and important operations in linear algebra, the performance prediction of sparse matrix-vector multiplication (SpMV) on GPUs has got more and more attention in recent years. In 2012, Guo and Wang put forward a new idea to predict the performance of SpMV on GPUs. However, they didn’t consider the matrix structure completely, so the execution time predicted by their model tends to be inaccurate for general sparse matrix. To address this problem, we proposed two new similar models, which take into account the structure of the matrices and make the performance prediction model more accurate. In addition, we predict the execution time of SpMV for CSR-V, CSR-S, ELL and JAD sparse matrix storage formats by the new models on the CUDA platform. Our experimental results show that the accuracy of prediction by our models is 1.69 times better than Guo and Wang’s model on average for most general matrices.展开更多
To reduce the computational complexity of matrix inversion, which is the majority of processing in many practical applications, two numerically efficient recursive algorithms （called algorithms I and II, respectively...To reduce the computational complexity of matrix inversion, which is the majority of processing in many practical applications, two numerically efficient recursive algorithms （called algorithms I and II, respectively） are presented. Algorithm I is used to calculate the inverse of such a matrix, whose leading principal minors are all nonzero. Algorithm II, whereby, the inverse of an arbitrary nonsingular matrix can be evaluated is derived via improving the algorithm I. The implementation, for algorithm II or I, involves matrix-vector multiplications and vector outer products. These operations are computationally fast and highly parallelizable. MATLAB simulations show that both recursive algorithms are valid.展开更多
Kernel-based methods work by embedding the data into a feature space and then searching linear hypothesis among the embedding data points. The performance is mostly affected by which kernel is used. A promising way is...Kernel-based methods work by embedding the data into a feature space and then searching linear hypothesis among the embedding data points. The performance is mostly affected by which kernel is used. A promising way is to learn the kernel from the data automatically. A general regularized risk functional （RRF） criterion for kernel matrix learning is proposed. Compared with the RRF criterion, general RRF criterion takes into account the geometric distributions of the embedding data points. It is proven that the distance between different geometric distdbutions can be estimated by their centroid distance in the reproducing kernel Hilbert space. Using this criterion for kernel matrix learning leads to a convex quadratically constrained quadratic programming （QCQP） problem. For several commonly used loss functions, their mathematical formulations are given. Experiment results on a collection of benchmark data sets demonstrate the effectiveness of the proposed method.展开更多
To make the modulation classification system more suitable for signals in a wide range of signal to noise rate （SNR）, a feature extraction method based on signal wavelet packet transform modulus maxima matrix （WPT...To make the modulation classification system more suitable for signals in a wide range of signal to noise rate （SNR）, a feature extraction method based on signal wavelet packet transform modulus maxima matrix （WPTMMM） and a novel support vector machine fuzzy network （SVMFN） classifier is presented. The WPTMMM feature extraction method has less computational complexity, more stability, and has the preferable advantage of robust with the time parallel moving and white noise. Further, the SVMFN uses a new definition of fuzzy density that incorporates accuracy and uncertainty of the classifiers to improve recognition reliability to classify nine digital modulation types （i.e. 2ASK, 2FSK, 2PSK, 4ASK, 4FSK, 4PSK, 16QAM, MSK, and OQPSK）. Computer simulation shows that the proposed scheme has the advantages of high accuracy and reliability （success rates are over 98% when SNR is not lower than 0dB）, and it adapts to engineering applications.展开更多
The morbidity problem of the GM（1,1） power model in parameter identification is discussed by using multiple and rotation transformation of vectors. Firstly we consider the morbidity problem of the special matrix and...The morbidity problem of the GM（1,1） power model in parameter identification is discussed by using multiple and rotation transformation of vectors. Firstly we consider the morbidity problem of the special matrix and prove that the condition number of the coefficient matrix is determined by the ratio of lengths and the included angle of the column vector, which could be adjusted by multiple and rotation transformation to turn the matrix to a well-conditioned one. Then partition the corresponding matrix of the GM（1,1） power model in accordance with the column vector and regulate the matrix to a well-conditioned one by multiple and rotation transformation of vectors, which completely solve the instability problem of the GM（1,1） power model. Numerical results show that vector transformation is a new method in studying the stability problem of the GM（1,1） power model.展开更多
In this paper, we consider the eigenvalue problem of a class of fourth-order operator matrices appearing in mechan- ics, including the geometric multiplicity, algebraic index, and algebraic multiplicity of the eigenva...In this paper, we consider the eigenvalue problem of a class of fourth-order operator matrices appearing in mechan- ics, including the geometric multiplicity, algebraic index, and algebraic multiplicity of the eigenvalue, the symplectic orthogonality, and completeness of eigen and root vector systems. The obtained results are applied to the plate bending problem.展开更多
The knowledge of subnuclear localization in eukaryotic cells is indispensable for under-standing the biological function of nucleus, genome regulation and drug discovery. In this study, a new feature representation wa...The knowledge of subnuclear localization in eukaryotic cells is indispensable for under-standing the biological function of nucleus, genome regulation and drug discovery. In this study, a new feature representation was pro-posed by combining position specific scoring matrix (PSSM) and auto covariance (AC). The AC variables describe the neighboring effect between two amino acids, so that they incorpo-rate the sequence-order information;PSSM de-scribes the information of biological evolution of proteins. Based on this new descriptor, a support vector machine (SVM) classifier was built to predict subnuclear localization. To evaluate the power of our predictor, the benchmark dataset that contains 714 proteins localized in nine subnuclear compartments was utilized. The total jackknife cross validation ac-curacy of our method is 76.5%, that is higher than those of the Nuc-PLoc (67.4%), the OET- KNN (55.6%), AAC based SVM (48.9%) and ProtLoc (36.6%). The prediction software used in this article and the details of the SVM parameters are freely available at http://chemlab.scu.edu.cn/ predict_SubNL/index.htm and the dataset used in our study is from Shen and Chou’s work by downloading at http://chou.med.harvard.edu/ bioinf/Nuc-PLoc/Data.htm.展开更多
Matrix converter fed motor drive is superior to pulse width modulation inverter drives since it not only provides bi-directional power flow,sinusoidal input/output currents,unity input power factor,but also allows a c...Matrix converter fed motor drive is superior to pulse width modulation inverter drives since it not only provides bi-directional power flow,sinusoidal input/output currents,unity input power factor,but also allows a compact design due to the lack of DC-link capacitors for energy storage.In this paper,model and control of matrix converter fed induction motor drive system are analyzed.A combined control strategy is simplified and improved,which realizes space vector pulse width modulation of matrix converter and rotor flux oriented vector control technique for induction motor drive simultaneously.This control strategy combines the advantages of matrix converter with the good drive performance of vector control technique.Experimental results demonstrate the feasibility and effectiveness of the proposed control strategy.展开更多
The concept of group construction vector and independent construction vector for visual cryptography is proposed, and the method based on construction vector is presented for con-structing basis matrices. The general ...The concept of group construction vector and independent construction vector for visual cryptography is proposed, and the method based on construction vector is presented for con-structing basis matrices. The general solutions to construction vectors and the general solutions to k out of n visual cryptographic schemes are obtained. Using the construction vectors, everyone can construct visual cryptographic schemes simply and efficaciously according to the formulas. The concept and the general solutions to construction vector present a good idea for researches on visual cryptographic schemes, including structural properties, the bound of pixel expansion and contrast, and optimal construction.展开更多
In a modern electrical driver, rotor field oriented control an appropriate transient response. In this method, the space （RFOC） method has been used to achieve a good performance and vector of the rotor flux comes h...In a modern electrical driver, rotor field oriented control an appropriate transient response. In this method, the space （RFOC） method has been used to achieve a good performance and vector of the rotor flux comes handy by the rotor resistance value. The rotor resistance is one of the important parameters which varies according to motor speed and room temperature alteration. In this paper, a new on-line estimation method is utilized to obtain the rotor resistance by using Walsh functions domain. The Walsh functions are one of the most applicable functions in piecewise constant basis functions （PCBF） to solve dynamic equations. On the other hand, an integral operational matrix is used to simplify the process and speed of the computation algorithm. The simulations results show that the proposed method is capable of solving the dynamic equations in an electrical machine on a time interval which robustly estimates the rotor resistance in contrast with injection noises.展开更多
A two-dimensional direction-of-arrival （DOA） and polarization estimation algorithm for coherent sources using a linear vector-sensor array is presented. Two matrices are first constructed by the receiving data. The ...A two-dimensional direction-of-arrival （DOA） and polarization estimation algorithm for coherent sources using a linear vector-sensor array is presented. Two matrices are first constructed by the receiving data. The ranks of the two matrices are only related to the DOAs of the sources and independent of their coherency. Then the source’s elevation is resolved via the matrix pencil （MP） method, and the singular value decomposition （SVD） is used to reduce the noise effect. Finally, the source’s steering vector is estimated, and the analytics solutions of the source’s azimuth and polarization parameter can be directly computed by using a vector cross-product estimator. Moreover, the proposed algorithm can achieve the unambiguous direction estimates, even if the space between adjacent sensors is larger than a half-wavelength. Theoretical and numerical simulations show the effectiveness of the proposed algorithm.展开更多
稀疏线性方程组求解等高性能计算应用常常涉及稀疏矩阵向量乘(SpMV)序列Ax,A2x,…,Asx的计算.上述SpMV序列操作又称为稀疏矩阵幂函数(matrix power kernel,MPK).由于MPK执行多次SpMV且稀疏矩阵保持不变,在缓存(cache)中重用稀疏矩阵,可...稀疏线性方程组求解等高性能计算应用常常涉及稀疏矩阵向量乘(SpMV)序列Ax,A2x,…,Asx的计算.上述SpMV序列操作又称为稀疏矩阵幂函数(matrix power kernel,MPK).由于MPK执行多次SpMV且稀疏矩阵保持不变,在缓存(cache)中重用稀疏矩阵,可避免每次执行SpMV均从主存加载A,从而缓解SpMV访存受限问题,提升MPK性能.但缓存数据重用会导致相邻SpMV操作之间的数据依赖,现有MPK优化多针对单次SpMV调用,或在实现数据重用时引入过多额外开销.提出了缓存感知的MPK(cache-awareMPK,Ca-MPK),基于稀疏矩阵的依赖图,设计了体系结构感知的递归划分方法,将依赖图划分为适合缓存大小的子图/子矩阵,通过构建分割子图解耦数据依赖,根据特定顺序在子矩阵上调度执行SpMV,实现缓存数据重用.测试结果表明,Ca-MPK相对于Intel OneMKL库和最新MPK实现,平均性能提升分别多达约1.57倍和1.40倍.展开更多
The radiative transfer model (RT3), a vector radiative transfer (VRT) scheme in a plane-parallel atmosphere, was bounded by a rough ocean surface in this study. The boundary problem was solved using a Fourier series d...The radiative transfer model (RT3), a vector radiative transfer (VRT) scheme in a plane-parallel atmosphere, was bounded by a rough ocean surface in this study. The boundary problem was solved using a Fourier series decomposition of the radiation field as a function of the azimuth. For the case of a rough ocean surface, the decomposition was obtained by developing both the Fresnel reflection matrix and the probability distribution of the water facet orientation as Fourier series. The effect of shadowing by ocean surface waves was also considered in the boundary condition. The VRT model can compute the intensity and degree of polarization of the light at the top of the atmosphere (TOA), the ocean surface, and any level of the atmosphere in the ocean-atmosphere system. The results obtained by our model are in good agreement with those computed by Ahmad’s model. The simulated results showed that the shadow effects of wave facets on the intensity and the degree of polarization are negligible except at the ocean surface near the grazing angle, possibly because we did not consider the effect of white caps.展开更多
The generalized product bi-conjugate gradient(GPBiCG(m,l))method has been recently proposed as a hybrid variant of the GPBi CG and the Bi CGSTAB methods to solve the linear system Ax=b with non-symmetric coefficient m...The generalized product bi-conjugate gradient(GPBiCG(m,l))method has been recently proposed as a hybrid variant of the GPBi CG and the Bi CGSTAB methods to solve the linear system Ax=b with non-symmetric coefficient matrix,and its attractive convergence behavior has been authenticated in many numerical experiments.By means of the Kronecker product and the vectorization operator,this paper aims to develop the GPBi CG(m,l)method to solve the general matrix equation■ and the general discrete-time periodic matrix equations■ which include the well-known Lyapunov,Stein,and Sylvester matrix equations that arise in a wide variety of applications in engineering,communications and scientific computations.The accuracy and efficiency of the extended GPBi CG(m,l)method assessed against some existing iterative methods are illustrated by several numerical experiments.展开更多
Identification of the drug-binding residues on the surface of proteins is a vital step in drug discovery and it is important for understanding protein function. Most previous researches are based on the structural inf...Identification of the drug-binding residues on the surface of proteins is a vital step in drug discovery and it is important for understanding protein function. Most previous researches are based on the structural information of proteins, but the structures of most proteins are not available. So in this article, a sequence-based method was proposed by combining the support vector machine (SVM)-based ensemble learning and the improved position specific scoring matrix (PSSM). In order to take the local environment information of a drug-binding site into account, an improved PSSM profile scaled by the sliding window and smoothing window was used to improve the prediction result. In addition, a new SVM-based ensemble learning method was developed to deal with the imbalanced data classification problem that commonly exists in the binding site predictions. When performed on the dataset of 985 drug-binding residues, the method achieved a very promising prediction result with the area under the curve (AUC) of 0.9264. Furthermore, an independent dataset of 349 drug- binding residues was used to evaluate the pre- diction model and the prediction accuracy is 84.68%. These results suggest that our method is effective for predicting the drug-binding sites in proteins. The code and all datasets used in this article are freely available at http://cic.scu.edu.cn/bioinformatics/Ensem_DBS.zip.展开更多
基金co-supported by the National Natural Science Foundation of China (No. 61203170)the Fundamental Research Funds for the Central Universities (No. NS2012026)Startup Foundation for Introduced Talents of Nanjing University of Aeronautics and Astronautics (No. 1007-YAH10047)
文摘Impacted craters are commonly found on the surface of planets, satellites, asteroids and other solar system bodies. In order to speed up the rate of constructing the database of craters, it is important to develop crater detection algorithms. This paper presents a novel approach to automatically detect craters on planetary surfaces. The approach contains two parts： crater candidate region selection and crater detection. In the first part, crater candidate region selection is achieved by Kanade-Lucas-Tomasi （KLT） detector. Matrix-pattern-oriented least squares support vector machine （MatLSSVM）, as the matrixization version of least square support vector machine （SVM）, inherits the advantages of least squares support vector machine （LSSVM）, reduces storage space greatly and reserves spatial redundancies within each image matrix compared with general LSSVM. The second part of the approach employs MatLSSVM to design classifier for crater detection. Experimental results on the dataset which comprises 160 preprocessed image patches from Google Mars demonstrate that the accuracy rate of crater detection can be up to 88%. In addition, the outstanding feature of the approach introduced in this paper is that it takes resized crater candidate region as input pattern directly to finish crater detection. The results of the last experiment demonstrate that MatLSSVM-based classifier can detect crater regions effectively on the basis of KLT-based crater candidate region selection.
文摘As one of the most essential and important operations in linear algebra, the performance prediction of sparse matrix-vector multiplication (SpMV) on GPUs has got more and more attention in recent years. In 2012, Guo and Wang put forward a new idea to predict the performance of SpMV on GPUs. However, they didn’t consider the matrix structure completely, so the execution time predicted by their model tends to be inaccurate for general sparse matrix. To address this problem, we proposed two new similar models, which take into account the structure of the matrices and make the performance prediction model more accurate. In addition, we predict the execution time of SpMV for CSR-V, CSR-S, ELL and JAD sparse matrix storage formats by the new models on the CUDA platform. Our experimental results show that the accuracy of prediction by our models is 1.69 times better than Guo and Wang’s model on average for most general matrices.
文摘To reduce the computational complexity of matrix inversion, which is the majority of processing in many practical applications, two numerically efficient recursive algorithms （called algorithms I and II, respectively） are presented. Algorithm I is used to calculate the inverse of such a matrix, whose leading principal minors are all nonzero. Algorithm II, whereby, the inverse of an arbitrary nonsingular matrix can be evaluated is derived via improving the algorithm I. The implementation, for algorithm II or I, involves matrix-vector multiplications and vector outer products. These operations are computationally fast and highly parallelizable. MATLAB simulations show that both recursive algorithms are valid.
基金supported by the National Natural Science Fundation of China (60736021)the Joint Funds of NSFC-Guangdong Province(U0735003)
文摘Kernel-based methods work by embedding the data into a feature space and then searching linear hypothesis among the embedding data points. The performance is mostly affected by which kernel is used. A promising way is to learn the kernel from the data automatically. A general regularized risk functional （RRF） criterion for kernel matrix learning is proposed. Compared with the RRF criterion, general RRF criterion takes into account the geometric distributions of the embedding data points. It is proven that the distance between different geometric distdbutions can be estimated by their centroid distance in the reproducing kernel Hilbert space. Using this criterion for kernel matrix learning leads to a convex quadratically constrained quadratic programming （QCQP） problem. For several commonly used loss functions, their mathematical formulations are given. Experiment results on a collection of benchmark data sets demonstrate the effectiveness of the proposed method.
文摘To make the modulation classification system more suitable for signals in a wide range of signal to noise rate （SNR）, a feature extraction method based on signal wavelet packet transform modulus maxima matrix （WPTMMM） and a novel support vector machine fuzzy network （SVMFN） classifier is presented. The WPTMMM feature extraction method has less computational complexity, more stability, and has the preferable advantage of robust with the time parallel moving and white noise. Further, the SVMFN uses a new definition of fuzzy density that incorporates accuracy and uncertainty of the classifiers to improve recognition reliability to classify nine digital modulation types （i.e. 2ASK, 2FSK, 2PSK, 4ASK, 4FSK, 4PSK, 16QAM, MSK, and OQPSK）. Computer simulation shows that the proposed scheme has the advantages of high accuracy and reliability （success rates are over 98% when SNR is not lower than 0dB）, and it adapts to engineering applications.
基金supported by the Specialized Research Fund for the Doctoral Program of Higher Education of China(20120143110001)the General Education Program Requirements in the Humanities and Social Sciences of China(11YJC630155)the Youth Foundation of Hubei Province of China(Q20121203)
文摘The morbidity problem of the GM（1,1） power model in parameter identification is discussed by using multiple and rotation transformation of vectors. Firstly we consider the morbidity problem of the special matrix and prove that the condition number of the coefficient matrix is determined by the ratio of lengths and the included angle of the column vector, which could be adjusted by multiple and rotation transformation to turn the matrix to a well-conditioned one. Then partition the corresponding matrix of the GM（1,1） power model in accordance with the column vector and regulate the matrix to a well-conditioned one by multiple and rotation transformation of vectors, which completely solve the instability problem of the GM（1,1） power model. Numerical results show that vector transformation is a new method in studying the stability problem of the GM（1,1） power model.
基金supported by the National Natural Science Foundation of China (Grant Nos. 11061019 and 10962004)the Chunhui Program of Ministry of Education of China (Grant No. Z2009-1-01010)+1 种基金the Natural Science Foundation of Inner Mongolia, China(Grant Nos. 2010MS0110 and 2009BS0101)the Cultivation of Innovative Talent of ‘211 Project’ of Inner Mongolia University
文摘In this paper, we consider the eigenvalue problem of a class of fourth-order operator matrices appearing in mechan- ics, including the geometric multiplicity, algebraic index, and algebraic multiplicity of the eigenvalue, the symplectic orthogonality, and completeness of eigen and root vector systems. The obtained results are applied to the plate bending problem.
文摘The knowledge of subnuclear localization in eukaryotic cells is indispensable for under-standing the biological function of nucleus, genome regulation and drug discovery. In this study, a new feature representation was pro-posed by combining position specific scoring matrix (PSSM) and auto covariance (AC). The AC variables describe the neighboring effect between two amino acids, so that they incorpo-rate the sequence-order information;PSSM de-scribes the information of biological evolution of proteins. Based on this new descriptor, a support vector machine (SVM) classifier was built to predict subnuclear localization. To evaluate the power of our predictor, the benchmark dataset that contains 714 proteins localized in nine subnuclear compartments was utilized. The total jackknife cross validation ac-curacy of our method is 76.5%, that is higher than those of the Nuc-PLoc (67.4%), the OET- KNN (55.6%), AAC based SVM (48.9%) and ProtLoc (36.6%). The prediction software used in this article and the details of the SVM parameters are freely available at http://chemlab.scu.edu.cn/ predict_SubNL/index.htm and the dataset used in our study is from Shen and Chou’s work by downloading at http://chou.med.harvard.edu/ bioinf/Nuc-PLoc/Data.htm.
文摘Matrix converter fed motor drive is superior to pulse width modulation inverter drives since it not only provides bi-directional power flow,sinusoidal input/output currents,unity input power factor,but also allows a compact design due to the lack of DC-link capacitors for energy storage.In this paper,model and control of matrix converter fed induction motor drive system are analyzed.A combined control strategy is simplified and improved,which realizes space vector pulse width modulation of matrix converter and rotor flux oriented vector control technique for induction motor drive simultaneously.This control strategy combines the advantages of matrix converter with the good drive performance of vector control technique.Experimental results demonstrate the feasibility and effectiveness of the proposed control strategy.
文摘The concept of group construction vector and independent construction vector for visual cryptography is proposed, and the method based on construction vector is presented for con-structing basis matrices. The general solutions to construction vectors and the general solutions to k out of n visual cryptographic schemes are obtained. Using the construction vectors, everyone can construct visual cryptographic schemes simply and efficaciously according to the formulas. The concept and the general solutions to construction vector present a good idea for researches on visual cryptographic schemes, including structural properties, the bound of pixel expansion and contrast, and optimal construction.
文摘In a modern electrical driver, rotor field oriented control an appropriate transient response. In this method, the space （RFOC） method has been used to achieve a good performance and vector of the rotor flux comes handy by the rotor resistance value. The rotor resistance is one of the important parameters which varies according to motor speed and room temperature alteration. In this paper, a new on-line estimation method is utilized to obtain the rotor resistance by using Walsh functions domain. The Walsh functions are one of the most applicable functions in piecewise constant basis functions （PCBF） to solve dynamic equations. On the other hand, an integral operational matrix is used to simplify the process and speed of the computation algorithm. The simulations results show that the proposed method is capable of solving the dynamic equations in an electrical machine on a time interval which robustly estimates the rotor resistance in contrast with injection noises.
基金supported by the Program for Changjiang Scholars and Innovative Research Team in University (IRT0645)
文摘A two-dimensional direction-of-arrival （DOA） and polarization estimation algorithm for coherent sources using a linear vector-sensor array is presented. Two matrices are first constructed by the receiving data. The ranks of the two matrices are only related to the DOAs of the sources and independent of their coherency. Then the source’s elevation is resolved via the matrix pencil （MP） method, and the singular value decomposition （SVD） is used to reduce the noise effect. Finally, the source’s steering vector is estimated, and the analytics solutions of the source’s azimuth and polarization parameter can be directly computed by using a vector cross-product estimator. Moreover, the proposed algorithm can achieve the unambiguous direction estimates, even if the space between adjacent sensors is larger than a half-wavelength. Theoretical and numerical simulations show the effectiveness of the proposed algorithm.
文摘稀疏线性方程组求解等高性能计算应用常常涉及稀疏矩阵向量乘(SpMV)序列Ax,A2x,…,Asx的计算.上述SpMV序列操作又称为稀疏矩阵幂函数(matrix power kernel,MPK).由于MPK执行多次SpMV且稀疏矩阵保持不变,在缓存(cache)中重用稀疏矩阵,可避免每次执行SpMV均从主存加载A,从而缓解SpMV访存受限问题,提升MPK性能.但缓存数据重用会导致相邻SpMV操作之间的数据依赖,现有MPK优化多针对单次SpMV调用,或在实现数据重用时引入过多额外开销.提出了缓存感知的MPK(cache-awareMPK,Ca-MPK),基于稀疏矩阵的依赖图,设计了体系结构感知的递归划分方法,将依赖图划分为适合缓存大小的子图/子矩阵,通过构建分割子图解耦数据依赖,根据特定顺序在子矩阵上调度执行SpMV,实现缓存数据重用.测试结果表明,Ca-MPK相对于Intel OneMKL库和最新MPK实现,平均性能提升分别多达约1.57倍和1.40倍.
基金supported by the Knowledge Innovation Program of the Chinese Academy of Sciences (Grant No. KZCX2-YW-QN201)the National Natural Science Foundation of China (Grant No. 40805010)+2 种基金the National Basic Research Program of China (973 Program, Grant No. 2010CB 950804)Key Projects in the National Science & Technology Pillar Program in the Eleventh Five-year Plan Period (Grant No. 2008BAC40B01)supported by a Post-doctoral Fellowship for Space Science and Application
文摘The radiative transfer model (RT3), a vector radiative transfer (VRT) scheme in a plane-parallel atmosphere, was bounded by a rough ocean surface in this study. The boundary problem was solved using a Fourier series decomposition of the radiation field as a function of the azimuth. For the case of a rough ocean surface, the decomposition was obtained by developing both the Fresnel reflection matrix and the probability distribution of the water facet orientation as Fourier series. The effect of shadowing by ocean surface waves was also considered in the boundary condition. The VRT model can compute the intensity and degree of polarization of the light at the top of the atmosphere (TOA), the ocean surface, and any level of the atmosphere in the ocean-atmosphere system. The results obtained by our model are in good agreement with those computed by Ahmad’s model. The simulated results showed that the shadow effects of wave facets on the intensity and the degree of polarization are negligible except at the ocean surface near the grazing angle, possibly because we did not consider the effect of white caps.
基金Supported by the National Natural Sciences Foundation of China(Grant Nos.11501079 11571061)Part by the Higher Education Commission of Egypt
文摘The generalized product bi-conjugate gradient(GPBiCG(m,l))method has been recently proposed as a hybrid variant of the GPBi CG and the Bi CGSTAB methods to solve the linear system Ax=b with non-symmetric coefficient matrix,and its attractive convergence behavior has been authenticated in many numerical experiments.By means of the Kronecker product and the vectorization operator,this paper aims to develop the GPBi CG(m,l)method to solve the general matrix equation■ and the general discrete-time periodic matrix equations■ which include the well-known Lyapunov,Stein,and Sylvester matrix equations that arise in a wide variety of applications in engineering,communications and scientific computations.The accuracy and efficiency of the extended GPBi CG(m,l)method assessed against some existing iterative methods are illustrated by several numerical experiments.
文摘Identification of the drug-binding residues on the surface of proteins is a vital step in drug discovery and it is important for understanding protein function. Most previous researches are based on the structural information of proteins, but the structures of most proteins are not available. So in this article, a sequence-based method was proposed by combining the support vector machine (SVM)-based ensemble learning and the improved position specific scoring matrix (PSSM). In order to take the local environment information of a drug-binding site into account, an improved PSSM profile scaled by the sliding window and smoothing window was used to improve the prediction result. In addition, a new SVM-based ensemble learning method was developed to deal with the imbalanced data classification problem that commonly exists in the binding site predictions. When performed on the dataset of 985 drug-binding residues, the method achieved a very promising prediction result with the area under the curve (AUC) of 0.9264. Furthermore, an independent dataset of 349 drug- binding residues was used to evaluate the pre- diction model and the prediction accuracy is 84.68%. These results suggest that our method is effective for predicting the drug-binding sites in proteins. The code and all datasets used in this article are freely available at http://cic.scu.edu.cn/bioinformatics/Ensem_DBS.zip.
