We will give the definition of the linear kernel of boolean functions and prove that, by a reversible linear transformation, any linear structure boolean function can be transformed into a boolean function which is li...We will give the definition of the linear kernel of boolean functions and prove that, by a reversible linear transformation, any linear structure boolean function can be transformed into a boolean function which is linear to some variables, is non-relative to some variables and is of non-linear structure to other variables; any Partially-Bent Function can be transformed into a boolean function which is linear to some variables, is nonrelativeto some variables ans is bent to other variables. We will also discuss the Walsh Spectral Characterization of Partially-Bent Functions.展开更多
Linear discriminant analysis and kernel vector quantization are integrated into vector quantization based speech recognition system for improving the recognition accuracy of Mandarin digits. These techniques increase ...Linear discriminant analysis and kernel vector quantization are integrated into vector quantization based speech recognition system for improving the recognition accuracy of Mandarin digits. These techniques increase the class separability and optimize the clustering procedure. Speaker-dependent (SD) and speaker-independent (SI) experiments are performed to evaluate the performance of the proposed method. The experiment results show that the proposed method is capable of reaching the word error rate of 3.76% in SD case and 6.60 % in SI case. Such a system can be suitable for being embedded in personal digital assistant(PDA), mobile phone and so on to perform voice controlling such as digit dialing, calculating, etc.展开更多
In this paper, we design a primal-dual interior-point algorithm for linear optimization. Search directions and proximity function are proposed based on a new kernel function which includes neither growth term nor barr...In this paper, we design a primal-dual interior-point algorithm for linear optimization. Search directions and proximity function are proposed based on a new kernel function which includes neither growth term nor barrier term. Iteration bounds both for large-and small-update methods are derived, namely, O（nlog（n/c）） and O（√nlog（n/ε））. This new kernel function has simple algebraic expression and the proximity function has not been used before. Analogous to the classical logarithmic kernel function, our complexity analysis is easier than the other pri- mal-dual interior-point methods based on logarithmic barrier functions and recent kernel functions.展开更多
A polynomial interior-point algorithm is presented for monotone linear complementarity problem （MLCP） based on a class of kernel functions with the general barrier term, which are called general kernel functions. Un...A polynomial interior-point algorithm is presented for monotone linear complementarity problem （MLCP） based on a class of kernel functions with the general barrier term, which are called general kernel functions. Under the mild conditions for the barrier term, the complexity bound of algorithm in terms of such kernel function and its derivatives is obtained. The approach is actually an extension of the existing work which only used the specific kernel functions for the MLCP.展开更多
In this article, we present approximate solution of the two-dimensional singular nonlinear mixed Volterra-Fredholm integral equations (V-FIE), which is deduced by using new strategy (combined Laplace homotopy perturba...In this article, we present approximate solution of the two-dimensional singular nonlinear mixed Volterra-Fredholm integral equations (V-FIE), which is deduced by using new strategy (combined Laplace homotopy perturbation method (LHPM)). Here we consider the V-FIE with Cauchy kernel. Solved examples illustrate that the proposed strategy is powerful, effective and very simple.展开更多
This paper proposes the combined Laplace-Adomian decomposition method (LADM) for solution two dimensional linear mixed integral equations of type Volterra-Fredholm with Hilbert kernel. Comparison of the obtained resul...This paper proposes the combined Laplace-Adomian decomposition method (LADM) for solution two dimensional linear mixed integral equations of type Volterra-Fredholm with Hilbert kernel. Comparison of the obtained results with those obtained by the Toeplitz matrix method (TMM) demonstrates that the proposed technique is powerful and simple.展开更多
In the paper, the approximate solution for the two-dimensional linear and nonlinear Volterra-Fredholm integral equation (V-FIE) with singular kernel by utilizing the combined Laplace-Adomian decomposition method (LADM...In the paper, the approximate solution for the two-dimensional linear and nonlinear Volterra-Fredholm integral equation (V-FIE) with singular kernel by utilizing the combined Laplace-Adomian decomposition method (LADM) was studied. This technique is a convergent series from easily computable components. Four examples are exhibited, when the kernel takes Carleman and logarithmic forms. Numerical results uncover that the method is efficient and high accurate.展开更多
A novel LS-SVM control method is proposed for general unknown nonlinear systems. A linear kernel LS-SVM model is firstly developed for input/output(I/O) approximation. The LS-SVM control law is then derived directly f...A novel LS-SVM control method is proposed for general unknown nonlinear systems. A linear kernel LS-SVM model is firstly developed for input/output(I/O) approximation. The LS-SVM control law is then derived directly from this developed model without any approximation and assumption. It further proves that the control error is fully equal to the LS-SVM modeling error. This means that a desirable control performance can be achieved because the LS-SVM has been proven to have an outstanding modeling ability in the previous studies. Case studies finally demonstrate the effectiveness of the proposed LS-SVM control approach.展开更多
For domains composed by balls in C^n, this paper studies the boundary behaviour of Cauchy type integrals with discrete holomorphic kernels and the corresponding linear singular integral equation on each piece of smoot...For domains composed by balls in C^n, this paper studies the boundary behaviour of Cauchy type integrals with discrete holomorphic kernels and the corresponding linear singular integral equation on each piece of smooth lower dimensional edges on the boundary of the domain.展开更多
This paper considers the local linear regression estimators for partially linear model with censored data. Which have some nice large-sample behaviors and are easy to implement. By many simulation runs, the author als...This paper considers the local linear regression estimators for partially linear model with censored data. Which have some nice large-sample behaviors and are easy to implement. By many simulation runs, the author also found that the estimators show remarkable in the small sample case yet.展开更多
Consider tile partial linear model Y=Xβ+ g(T) + e. Wilers Y is at risk of being censored from the right, g is an unknown smoothing function on [0,1], β is a 1-dimensional parameter to be estimated and e is an unobse...Consider tile partial linear model Y=Xβ+ g(T) + e. Wilers Y is at risk of being censored from the right, g is an unknown smoothing function on [0,1], β is a 1-dimensional parameter to be estimated and e is an unobserved error. In Ref[1,2], it wes proved that the estimator for the asymptotic variance of βn(βn) is consistent. In this paper, we establish the limit distribution and the law of the iterated logarithm for,En, and obtain the convergest rates for En and the strong uniform convergent rates for gn(gn).展开更多
An efficient algorithm for the representation and approximation of linear time-varying systems is presented via the fast real-valued discrete Gabor transform. Compared with the existing algorithm based on the traditio...An efficient algorithm for the representation and approximation of linear time-varying systems is presented via the fast real-valued discrete Gabor transform. Compared with the existing algorithm based on the traditional complex-valued discrete Gabor transform, the proposed algorithm runs faster, can more easily be implemented in software or hardware, and leads to a more compact representation. Simulation results are given for demonstration.展开更多
稀疏线性方程组求解等高性能计算应用常常涉及稀疏矩阵向量乘(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倍.展开更多
文摘We will give the definition of the linear kernel of boolean functions and prove that, by a reversible linear transformation, any linear structure boolean function can be transformed into a boolean function which is linear to some variables, is non-relative to some variables and is of non-linear structure to other variables; any Partially-Bent Function can be transformed into a boolean function which is linear to some variables, is nonrelativeto some variables ans is bent to other variables. We will also discuss the Walsh Spectral Characterization of Partially-Bent Functions.
文摘Linear discriminant analysis and kernel vector quantization are integrated into vector quantization based speech recognition system for improving the recognition accuracy of Mandarin digits. These techniques increase the class separability and optimize the clustering procedure. Speaker-dependent (SD) and speaker-independent (SI) experiments are performed to evaluate the performance of the proposed method. The experiment results show that the proposed method is capable of reaching the word error rate of 3.76% in SD case and 6.60 % in SI case. Such a system can be suitable for being embedded in personal digital assistant(PDA), mobile phone and so on to perform voice controlling such as digit dialing, calculating, etc.
基金Supported by the Natural Science Foundation of Hubei Province (2008CDZD47)
文摘In this paper, we design a primal-dual interior-point algorithm for linear optimization. Search directions and proximity function are proposed based on a new kernel function which includes neither growth term nor barrier term. Iteration bounds both for large-and small-update methods are derived, namely, O（nlog（n/c）） and O（√nlog（n/ε））. This new kernel function has simple algebraic expression and the proximity function has not been used before. Analogous to the classical logarithmic kernel function, our complexity analysis is easier than the other pri- mal-dual interior-point methods based on logarithmic barrier functions and recent kernel functions.
基金supported by the National Natural Science Foundation of China (Grant No.10771133)the Shanghai Pujiang Program (Grant No.06PJ14039)
文摘A polynomial interior-point algorithm is presented for monotone linear complementarity problem （MLCP） based on a class of kernel functions with the general barrier term, which are called general kernel functions. Under the mild conditions for the barrier term, the complexity bound of algorithm in terms of such kernel function and its derivatives is obtained. The approach is actually an extension of the existing work which only used the specific kernel functions for the MLCP.
文摘In this article, we present approximate solution of the two-dimensional singular nonlinear mixed Volterra-Fredholm integral equations (V-FIE), which is deduced by using new strategy (combined Laplace homotopy perturbation method (LHPM)). Here we consider the V-FIE with Cauchy kernel. Solved examples illustrate that the proposed strategy is powerful, effective and very simple.
文摘This paper proposes the combined Laplace-Adomian decomposition method (LADM) for solution two dimensional linear mixed integral equations of type Volterra-Fredholm with Hilbert kernel. Comparison of the obtained results with those obtained by the Toeplitz matrix method (TMM) demonstrates that the proposed technique is powerful and simple.
文摘In the paper, the approximate solution for the two-dimensional linear and nonlinear Volterra-Fredholm integral equation (V-FIE) with singular kernel by utilizing the combined Laplace-Adomian decomposition method (LADM) was studied. This technique is a convergent series from easily computable components. Four examples are exhibited, when the kernel takes Carleman and logarithmic forms. Numerical results uncover that the method is efficient and high accurate.
基金Project(51205420)supported by the National Natural Science Foundation of ChinaProject(NCET-13-0593)supported by the Program for New Century Excellent Talents in University,ChinaProject(14C0208)supported by the Research Foundation of Education Bureau of Hunan Province,China
文摘A novel LS-SVM control method is proposed for general unknown nonlinear systems. A linear kernel LS-SVM model is firstly developed for input/output(I/O) approximation. The LS-SVM control law is then derived directly from this developed model without any approximation and assumption. It further proves that the control error is fully equal to the LS-SVM modeling error. This means that a desirable control performance can be achieved because the LS-SVM has been proven to have an outstanding modeling ability in the previous studies. Case studies finally demonstrate the effectiveness of the proposed LS-SVM control approach.
基金Project supported by the National Science Foundation of China (10271097)
文摘For domains composed by balls in C^n, this paper studies the boundary behaviour of Cauchy type integrals with discrete holomorphic kernels and the corresponding linear singular integral equation on each piece of smooth lower dimensional edges on the boundary of the domain.
文摘This paper considers the local linear regression estimators for partially linear model with censored data. Which have some nice large-sample behaviors and are easy to implement. By many simulation runs, the author also found that the estimators show remarkable in the small sample case yet.
文摘Consider tile partial linear model Y=Xβ+ g(T) + e. Wilers Y is at risk of being censored from the right, g is an unknown smoothing function on [0,1], β is a 1-dimensional parameter to be estimated and e is an unobserved error. In Ref[1,2], it wes proved that the estimator for the asymptotic variance of βn(βn) is consistent. In this paper, we establish the limit distribution and the law of the iterated logarithm for,En, and obtain the convergest rates for En and the strong uniform convergent rates for gn(gn).
基金Supported by the Excellent Young Teachers Program of the Ministry of Education, P. R. China (No. 2001-1739 and No. 2003-145)
文摘An efficient algorithm for the representation and approximation of linear time-varying systems is presented via the fast real-valued discrete Gabor transform. Compared with the existing algorithm based on the traditional complex-valued discrete Gabor transform, the proposed algorithm runs faster, can more easily be implemented in software or hardware, and leads to a more compact representation. Simulation results are given for demonstration.
文摘稀疏线性方程组求解等高性能计算应用常常涉及稀疏矩阵向量乘(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倍.
