The advantages of genome selection(GS) in animal and plant breeding are self-evident.Traditional parametric models have disadvantage in better fit the increasingly large sequencing data and capture complex effects acc...The advantages of genome selection(GS) in animal and plant breeding are self-evident.Traditional parametric models have disadvantage in better fit the increasingly large sequencing data and capture complex effects accurately.Machine learning models have demonstrated remarkable potential in addressing these challenges.In this study,we introduced the concept of mixed kernel functions to explore the performance of support vector machine regression(SVR) in GS.Six single kernel functions(SVR_L,SVR_C,SVR_G,SVR_P,SVR_S,SVR_L) and four mixed kernel functions(SVR_GS,SVR_GP,SVR_LS,SVR_LP) were used to predict genome breeding values.The prediction accuracy,mean squared error(MSE) and mean absolute error(MAE) were used as evaluation indicators to compare with two traditional parametric models(GBLUP,BayesB) and two popular machine learning models(RF,KcRR).The results indicate that in most cases,the performance of the mixed kernel function model significantly outperforms that of GBLUP,BayesB and single kernel function.For instance,for T1 in the pig dataset,the predictive accuracy of SVR_GS is improved by 10% compared to GBLUP,and by approximately 4.4 and 18.6% compared to SVR_G and SVR_S respectively.For E1 in the wheat dataset,SVR_GS achieves 13.3% higher prediction accuracy than GBLUP.Among single kernel functions,the Laplacian and Gaussian kernel functions yield similar results,with the Gaussian kernel function performing better.The mixed kernel function notably reduces the MSE and MAE when compared to all single kernel functions.Furthermore,regarding runtime,SVR_GS and SVR_GP mixed kernel functions run approximately three times faster than GBLUP in the pig dataset,with only a slight increase in runtime compared to the single kernel function model.In summary,the mixed kernel function model of SVR demonstrates speed and accuracy competitiveness,and the model such as SVR_GS has important application potential for GS.展开更多
Areca nut kernels are the byproduct of areca nut processing.Some of the major bioactive components of the areca nut are polysaccharides.Polysaccharides are known to exert numerous biological activities.Thus,polysaccha...Areca nut kernels are the byproduct of areca nut processing.Some of the major bioactive components of the areca nut are polysaccharides.Polysaccharides are known to exert numerous biological activities.Thus,polysaccharides isolated from areca nut kernels may be clinically valuable.To determine the medicinal value of areca nut kernel polysaccharides(AKP),ultrasonic-assisted extraction,ethanol precipitation,and dialysis were used for separation and purification.SEM,XRD,FTIR,and NMR were used for structural characterization and RAW264.7 macrophages were used for in vitro immune activity assessment.The AKP were isolated was a neutral polysaccharide,and the molecular weight(Mw)was 6.95×105Da,primarily composed of mannose(58.7%)and galactose(33.6%);the main chain of AKP is→4)-β-D-Manp-(1→,and the branched chain was mainly ofα-D-Galp-(1→attached to the O-6 position of→4,6)-β-D-Manp-(1→.Cell experiments show that AKP(20μg/mL)exerts its immune function via the TLR4/NF-κB signaling pathway regulation,decreasing TLR4,P65,IκB-α,and MyD88,and reducing the release of TNF-α,NO,IL-6,and IL-1β.In addition,AKP immune activity might be ascribed to its high Mw and rich monosaccharide composition.This study offers a solid scientific foundation for the development of AKP for wide clinical application.展开更多
The numerical simulation of the fluid flow and the flexible rod(s)interaction is more complicated and has lower efficiency due to the high computational cost.In this paper,a semi-resolved model coupling the computatio...The numerical simulation of the fluid flow and the flexible rod(s)interaction is more complicated and has lower efficiency due to the high computational cost.In this paper,a semi-resolved model coupling the computational fluid dynamics and the flexible rod dynamics is proposed using a two-way domain expansion method.The gov-erning equations of the flexible rod dynamics are discretized and solved by the finite element method,and the fluid flow is simulated by the finite volume method.The interaction between fluids and solid rods is modeled by introducing body force terms into the momentum equations.Referred to the traditional semi-resolved numerical model,an anisotropic Gaussian kernel function method is proposed to specify the interactive forces between flu-ids and solid bodies for non-circle rod cross-sections.A benchmark of the flow passing around a single flexible plate with a rectangular cross-section is used to validate the algorithm.Focused on the engineering applications,a test case of a finite patch of cylinders is implemented to validate the accuracy and efficiency of the coupled model.展开更多
A support vector machine (SVM) with quadratic polynomial kernel function based nonlinear model one-step-ahead predictive controller is presented. The SVM based predictive model is established with black-box identifica...A support vector machine (SVM) with quadratic polynomial kernel function based nonlinear model one-step-ahead predictive controller is presented. The SVM based predictive model is established with black-box identification method. By solving a cubic equation in the feature space, an explicit predictive control law is obtained through the predictive control mechanism. The effect of controller is demonstrated on a recognized benchmark problem and on the control of continuous-stirred tank reactor (CSTR). Simulation results show that SVM with quadratic polynomial kernel function based predictive controller can be well applied to nonlinear systems, with good performance in following reference trajectory as well as in disturbance-rejection.展开更多
Landslide probability prediction plays an important role in understanding landslide information in advance and taking preventive measures.Many factors can influence the occurrence of landslides,which is easy to have a...Landslide probability prediction plays an important role in understanding landslide information in advance and taking preventive measures.Many factors can influence the occurrence of landslides,which is easy to have a curse of dimensionality and thus lead to reduce prediction accuracy.Then the generalization ability of the model will also decline sharply when there are only small samples.To reduce the dimension of calculation and balance the model’s generalization and learning ability,this study proposed a landslide prediction method based on improved principal component analysis(PCA)and mixed kernel function least squares support vector regression(LSSVR)model.First,the traditional PCA was introduced with the idea of linear discrimination,and the dimensions of initial influencing factors were reduced from 8 to 3.The improved PCA can not only weight variables but also extract the original feature.Furthermore,combined with global and local kernel function,the mixed kernel function LSSVR model was framed to improve the generalization ability.Whale optimization algorithm(WOA)was used to optimize the parameters.Moreover,Root Mean Square Error(RMSE),the sum of squared errors(SSE),Mean Absolute Error(MAE),Mean Absolute Precentage Error(MAPE),and reliability were employed to verify the performance of the model.Compared with radial basis function(RBF)LSSVR model,Elman neural network model,and fuzzy decision model,the proposed method has a smaller deviation.Finally,the landslide warning level obtained from the landslide probability can also provide references for relevant decision-making departments in emergency response.展开更多
This paper is concerned with certain multilinear commutators of BMO functions and multilinear singular integral operators with non-smooth kernels. By the sharp maximal functions estimates, the weighted norm inequaliti...This paper is concerned with certain multilinear commutators of BMO functions and multilinear singular integral operators with non-smooth kernels. By the sharp maximal functions estimates, the weighted norm inequalities for this kind of commutators are established.展开更多
This paper is devoted to studying the commutators of the multilinear singular integral operators with the non-smooth kernels and the weighted Lipschitz functions. Some mapping properties for two types of commutators o...This paper is devoted to studying the commutators of the multilinear singular integral operators with the non-smooth kernels and the weighted Lipschitz functions. Some mapping properties for two types of commutators on the weighted Lebesgue spaces, which extend and generalize some previous results, are obtained.展开更多
A fast algorithm based on the grayscale distribution of infrared target and the weighted kernel function was proposed for the moving target detection(MTD) in dynamic scene of image series. This algorithm is used to de...A fast algorithm based on the grayscale distribution of infrared target and the weighted kernel function was proposed for the moving target detection(MTD) in dynamic scene of image series. This algorithm is used to deal with issues like the large computational complexity, the fluctuation of grayscale, and the noise in infrared images. Four characteristic points were selected by analyzing the grayscale distribution in infrared image, of which the series was quickly matched with an affine transformation model. The image was then divided into 32×32 squares and the gray-weighted kernel(GWK) for each square was calculated. At last, the MTD was carried out according to the variation of the four GWKs. The results indicate that the MTD can be achieved in real time using the algorithm with the fluctuations of grayscale and noise can be effectively suppressed. The detection probability is greater than 90% with the false alarm rate lower than 5% when the calculation time is less than 40 ms.展开更多
In this paper,we propose and analyze a full-Newton step feasible interior-point algorithm for semidefinite optimization based on a kernel function with linear growth term.The kernel function is used both for determini...In this paper,we propose and analyze a full-Newton step feasible interior-point algorithm for semidefinite optimization based on a kernel function with linear growth term.The kernel function is used both for determining the search directions and for measuring the distance between the given iterate and theμ-center for the algorithm.By developing a new norm-based proximity measure and some technical results,we derive the iteration bound that coincides with the currently best known iteration bound for the algorithm with small-update method.In our knowledge,this result is the first instance of full-Newton step feasible interior-point method for SDO which involving the kernel function.展开更多
A kernel-type estimator of the quantile function Q(p) = inf{t:F(t) ≥ p}, 0 ≤ p ≤ 1, is proposed based on the kernel smoother when the data are subjected to random truncation. The Bahadur-type representations o...A kernel-type estimator of the quantile function Q(p) = inf{t:F(t) ≥ p}, 0 ≤ p ≤ 1, is proposed based on the kernel smoother when the data are subjected to random truncation. The Bahadur-type representations of the kernel smooth estimator are established, and from Bahadur representations the authors can show that this estimator is strongly consistent, asymptotically normal, and weakly convergent.展开更多
In this paper,a new full-Newton step primal-dual interior-point algorithm for solving the special weighted linear complementarity problem is designed and analyzed.The algorithm employs a kernel function with a linear ...In this paper,a new full-Newton step primal-dual interior-point algorithm for solving the special weighted linear complementarity problem is designed and analyzed.The algorithm employs a kernel function with a linear growth term to derive the search direction,and by introducing new technical results and selecting suitable parameters,we prove that the iteration bound of the algorithm is as good as best-known polynomial complexity of interior-point methods.Furthermore,numerical results illustrate the efficiency of the proposed method.展开更多
Many mechanical problems can be induced from differential equations with boundary conditions; there exist analytic and numerical methods for solving the differential equations. Usually it is not so easy to obtain anal...Many mechanical problems can be induced from differential equations with boundary conditions; there exist analytic and numerical methods for solving the differential equations. Usually it is not so easy to obtain analytic solutions. So it is necessary to give numerical solutions. The reproducing kernel particle (RKP) method is based on the Carlerkin Meshless method. According to the Sobolev space and Fourier transform, the RKP shape function is mathematically proved in this paper.展开更多
Let {Xn, n≥1} be a strictly stationary sequence of random variables, which are either associated or negatively associated, f(.) be their common density. In this paper, the author shows a central limit theorem for a k...Let {Xn, n≥1} be a strictly stationary sequence of random variables, which are either associated or negatively associated, f(.) be their common density. In this paper, the author shows a central limit theorem for a kernel estimate of f(.) under certain regular conditions.展开更多
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.展开更多
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.展开更多
The state of health SoH of lithium ion batteries plays a predominant role in ensuring the safe and reliable operation of electric vehicles.In this,a novel SoH estimation approach using support vector regression with a...The state of health SoH of lithium ion batteries plays a predominant role in ensuring the safe and reliable operation of electric vehicles.In this,a novel SoH estimation approach using support vector regression with a Gaussian kernel optimized using the Bayesian optimization technique(BO-SVR with a Gaussian kernel)was proposed.Unlike,traditional approaches that use the internal resistance,and battery capacity as input parameters,this study utilized the equivalent discharging voltage difference interval and equivalent charging voltage difference interval,as they capture the dynamic voltage characteristics associated with the battery degradation.The model was simulated using MATLAB 2023a.The mean absolute error,R2,root mean squared error,and mean squared error were considered as performance indicators.The simulation results indicated that the proposed BO-SVR with a Gaussian kernel model had superior performance to other kernel SVR and Gaussian Process Regression models,with a reduced RMSE of 0.0082,thus demonstrating its potential to predict the SoH more accurately.展开更多
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.展开更多
Let (X,Y) be an R^d×R^1 valued random vector (X_1,Y_1),…, (X_n,Y_n) be a random sample drawn from (X,Y), and let E|Y|<∞. The regression function m(x)=E(Y|X=x) for x∈R^d is estimated by where, and h_n is a p...Let (X,Y) be an R^d×R^1 valued random vector (X_1,Y_1),…, (X_n,Y_n) be a random sample drawn from (X,Y), and let E|Y|<∞. The regression function m(x)=E(Y|X=x) for x∈R^d is estimated by where, and h_n is a positive number depending upon n only, nad K is a given nonnegative function on R^d. In the paper, we study the L_p convergence rate of kernel estimate m_n(x) of m(x) in suitable condition, and improve and extend the results of Wei Lansheng.展开更多
Owing to the effect of classified models was different in Protein-Protein Interaction(PPI) extraction, which was made by different single kernel functions, and only using single kernel function hardly trained the opti...Owing to the effect of classified models was different in Protein-Protein Interaction(PPI) extraction, which was made by different single kernel functions, and only using single kernel function hardly trained the optimal classified model to extract PPI, this paper presents a strategy to find the optimal kernel function from a kernel function set. The strategy is that in the kernel function set which consists of different single kernel functions, endlessly finding the last two kernel functions on the performance in PPI extraction, using their optimal kernel function to replace them, until there is only one kernel function and it’s the final optimal kernel function. Finally, extracting PPI using the classified model made by this kernel function. This paper conducted the PPI extraction experiment on AIMed corpus, the experimental result shows that the optimal convex combination kernel function this paper presents can effectively improve the extraction performance than single kernel function, and it gets the best precision which reaches 65.0 among the similar PPI extraction systems.展开更多
Upscaling of primary geological models with huge cells, especially in porous media, is the first step in fluid flow simulation. Numerical methods are often used to solve the models. The upscaling method must preserve ...Upscaling of primary geological models with huge cells, especially in porous media, is the first step in fluid flow simulation. Numerical methods are often used to solve the models. The upscaling method must preserve the important properties of the spatial distribution of the reservoir properties. An grid upscaling method based on adaptive bandwidth in kernel function is proposed according to the spatial distribution of property. This type of upscaling reduces the number of cells, while preserves the main heterogeneity features of the original fine model. The key point of the paper is upscaling two reservoir properties simultaneously. For each reservoir feature, the amount of bandwidth or optimal threshold is calculated and the results of the upscaling are obtained. Then two approaches are used to upscaling two properties simultaneously based on maximum bandwidth and minimum bandwidth. In fact, we now have a finalized upscaled model for both reservoir properties for each approach in which not only the number of their cells, but also the locations of the cells are equal. The upscaling error of the minimum bandwidth approach is less than that of the maximum bandwidth approach.展开更多
基金supported by the China Agriculture Research System of MOF and MARAthe National Natural Science Foundation of China (31872337 and 31501919)the Agricultural Science and Technology Innovation Project,China (ASTIP-IAS02)。
摘要The advantages of genome selection(GS) in animal and plant breeding are self-evident.Traditional parametric models have disadvantage in better fit the increasingly large sequencing data and capture complex effects accurately.Machine learning models have demonstrated remarkable potential in addressing these challenges.In this study,we introduced the concept of mixed kernel functions to explore the performance of support vector machine regression(SVR) in GS.Six single kernel functions(SVR_L,SVR_C,SVR_G,SVR_P,SVR_S,SVR_L) and four mixed kernel functions(SVR_GS,SVR_GP,SVR_LS,SVR_LP) were used to predict genome breeding values.The prediction accuracy,mean squared error(MSE) and mean absolute error(MAE) were used as evaluation indicators to compare with two traditional parametric models(GBLUP,BayesB) and two popular machine learning models(RF,KcRR).The results indicate that in most cases,the performance of the mixed kernel function model significantly outperforms that of GBLUP,BayesB and single kernel function.For instance,for T1 in the pig dataset,the predictive accuracy of SVR_GS is improved by 10% compared to GBLUP,and by approximately 4.4 and 18.6% compared to SVR_G and SVR_S respectively.For E1 in the wheat dataset,SVR_GS achieves 13.3% higher prediction accuracy than GBLUP.Among single kernel functions,the Laplacian and Gaussian kernel functions yield similar results,with the Gaussian kernel function performing better.The mixed kernel function notably reduces the MSE and MAE when compared to all single kernel functions.Furthermore,regarding runtime,SVR_GS and SVR_GP mixed kernel functions run approximately three times faster than GBLUP in the pig dataset,with only a slight increase in runtime compared to the single kernel function model.In summary,the mixed kernel function model of SVR demonstrates speed and accuracy competitiveness,and the model such as SVR_GS has important application potential for GS.
基金supported by the Project of Sanya Yazhou Bay Science and Technology City(Grant No.SC-YRC-2022-103)the Natural Science Foundation of Hainan(Grant No.321QN356)the Talent Start-up Funding of Hainan Academy of Agricultural Sciences(Grant No.HAAS2023RCQD07).
摘要Areca nut kernels are the byproduct of areca nut processing.Some of the major bioactive components of the areca nut are polysaccharides.Polysaccharides are known to exert numerous biological activities.Thus,polysaccharides isolated from areca nut kernels may be clinically valuable.To determine the medicinal value of areca nut kernel polysaccharides(AKP),ultrasonic-assisted extraction,ethanol precipitation,and dialysis were used for separation and purification.SEM,XRD,FTIR,and NMR were used for structural characterization and RAW264.7 macrophages were used for in vitro immune activity assessment.The AKP were isolated was a neutral polysaccharide,and the molecular weight(Mw)was 6.95×105Da,primarily composed of mannose(58.7%)and galactose(33.6%);the main chain of AKP is→4)-β-D-Manp-(1→,and the branched chain was mainly ofα-D-Galp-(1→attached to the O-6 position of→4,6)-β-D-Manp-(1→.Cell experiments show that AKP(20μg/mL)exerts its immune function via the TLR4/NF-κB signaling pathway regulation,decreasing TLR4,P65,IκB-α,and MyD88,and reducing the release of TNF-α,NO,IL-6,and IL-1β.In addition,AKP immune activity might be ascribed to its high Mw and rich monosaccharide composition.This study offers a solid scientific foundation for the development of AKP for wide clinical application.
基金supported by Shanghai 2021“Science and Technology Innovation Action Plan”:Social Development Science and Technology Research Project(Grant No.21DZ1202703).
摘要The numerical simulation of the fluid flow and the flexible rod(s)interaction is more complicated and has lower efficiency due to the high computational cost.In this paper,a semi-resolved model coupling the computational fluid dynamics and the flexible rod dynamics is proposed using a two-way domain expansion method.The gov-erning equations of the flexible rod dynamics are discretized and solved by the finite element method,and the fluid flow is simulated by the finite volume method.The interaction between fluids and solid rods is modeled by introducing body force terms into the momentum equations.Referred to the traditional semi-resolved numerical model,an anisotropic Gaussian kernel function method is proposed to specify the interactive forces between flu-ids and solid bodies for non-circle rod cross-sections.A benchmark of the flow passing around a single flexible plate with a rectangular cross-section is used to validate the algorithm.Focused on the engineering applications,a test case of a finite patch of cylinders is implemented to validate the accuracy and efficiency of the coupled model.
基金Support by China 973 Project (No. 2002CB312200).
摘要A support vector machine (SVM) with quadratic polynomial kernel function based nonlinear model one-step-ahead predictive controller is presented. The SVM based predictive model is established with black-box identification method. By solving a cubic equation in the feature space, an explicit predictive control law is obtained through the predictive control mechanism. The effect of controller is demonstrated on a recognized benchmark problem and on the control of continuous-stirred tank reactor (CSTR). Simulation results show that SVM with quadratic polynomial kernel function based predictive controller can be well applied to nonlinear systems, with good performance in following reference trajectory as well as in disturbance-rejection.
基金supported by the Natural Science Foundation of Shaanxi Province(Grant No.2019JQ206)in part by the Science and Technology Department of Shaanxi Province(Grant No.2020CGXNG-009)in part by the Education Department of Shaanxi Province under Grant 17JK0346.
摘要Landslide probability prediction plays an important role in understanding landslide information in advance and taking preventive measures.Many factors can influence the occurrence of landslides,which is easy to have a curse of dimensionality and thus lead to reduce prediction accuracy.Then the generalization ability of the model will also decline sharply when there are only small samples.To reduce the dimension of calculation and balance the model’s generalization and learning ability,this study proposed a landslide prediction method based on improved principal component analysis(PCA)and mixed kernel function least squares support vector regression(LSSVR)model.First,the traditional PCA was introduced with the idea of linear discrimination,and the dimensions of initial influencing factors were reduced from 8 to 3.The improved PCA can not only weight variables but also extract the original feature.Furthermore,combined with global and local kernel function,the mixed kernel function LSSVR model was framed to improve the generalization ability.Whale optimization algorithm(WOA)was used to optimize the parameters.Moreover,Root Mean Square Error(RMSE),the sum of squared errors(SSE),Mean Absolute Error(MAE),Mean Absolute Precentage Error(MAPE),and reliability were employed to verify the performance of the model.Compared with radial basis function(RBF)LSSVR model,Elman neural network model,and fuzzy decision model,the proposed method has a smaller deviation.Finally,the landslide warning level obtained from the landslide probability can also provide references for relevant decision-making departments in emergency response.
基金Supported by the National Natural Science Foundation of China (10771054, 10771221, 11071200)the Youth Foundation of Wuyi University (No. xq0930)
摘要This paper is concerned with certain multilinear commutators of BMO functions and multilinear singular integral operators with non-smooth kernels. By the sharp maximal functions estimates, the weighted norm inequalities for this kind of commutators are established.
基金Supported by the National Natural Science Foundation of China (10771054,11071200)the NFS of Fujian Province of China (No. 2010J01013)
摘要This paper is devoted to studying the commutators of the multilinear singular integral operators with the non-smooth kernels and the weighted Lipschitz functions. Some mapping properties for two types of commutators on the weighted Lebesgue spaces, which extend and generalize some previous results, are obtained.
基金Project(61101185)supported by the National Natural Science Foundation of China
摘要A fast algorithm based on the grayscale distribution of infrared target and the weighted kernel function was proposed for the moving target detection(MTD) in dynamic scene of image series. This algorithm is used to deal with issues like the large computational complexity, the fluctuation of grayscale, and the noise in infrared images. Four characteristic points were selected by analyzing the grayscale distribution in infrared image, of which the series was quickly matched with an affine transformation model. The image was then divided into 32×32 squares and the gray-weighted kernel(GWK) for each square was calculated. At last, the MTD was carried out according to the variation of the four GWKs. The results indicate that the MTD can be achieved in real time using the algorithm with the fluctuations of grayscale and noise can be effectively suppressed. The detection probability is greater than 90% with the false alarm rate lower than 5% when the calculation time is less than 40 ms.
基金Supported by University Science Research Project of Anhui Province(KJ2019A1297)University Teaching Research Project of Anhui Province(2019jxtd144)。
摘要In this paper,we propose and analyze a full-Newton step feasible interior-point algorithm for semidefinite optimization based on a kernel function with linear growth term.The kernel function is used both for determining the search directions and for measuring the distance between the given iterate and theμ-center for the algorithm.By developing a new norm-based proximity measure and some technical results,we derive the iteration bound that coincides with the currently best known iteration bound for the algorithm with small-update method.In our knowledge,this result is the first instance of full-Newton step feasible interior-point method for SDO which involving the kernel function.
基金Zhou's research was partially supported by the NNSF of China (10471140, 10571169)Wu's research was partially supported by NNSF of China (0571170)
摘要A kernel-type estimator of the quantile function Q(p) = inf{t:F(t) ≥ p}, 0 ≤ p ≤ 1, is proposed based on the kernel smoother when the data are subjected to random truncation. The Bahadur-type representations of the kernel smooth estimator are established, and from Bahadur representations the authors can show that this estimator is strongly consistent, asymptotically normal, and weakly convergent.
基金Supported by University Science Research Project of Anhui Province(2023AH052921)Outstanding Youth Talent Project of Anhui Province(gxyq2021254)。
摘要In this paper,a new full-Newton step primal-dual interior-point algorithm for solving the special weighted linear complementarity problem is designed and analyzed.The algorithm employs a kernel function with a linear growth term to derive the search direction,and by introducing new technical results and selecting suitable parameters,we prove that the iteration bound of the algorithm is as good as best-known polynomial complexity of interior-point methods.Furthermore,numerical results illustrate the efficiency of the proposed method.
摘要Many mechanical problems can be induced from differential equations with boundary conditions; there exist analytic and numerical methods for solving the differential equations. Usually it is not so easy to obtain analytic solutions. So it is necessary to give numerical solutions. The reproducing kernel particle (RKP) method is based on the Carlerkin Meshless method. According to the Sobolev space and Fourier transform, the RKP shape function is mathematically proved in this paper.
摘要Let {Xn, n≥1} be a strictly stationary sequence of random variables, which are either associated or negatively associated, f(.) be their common density. In this paper, the author shows a central limit theorem for a kernel estimate of f(.) under certain regular conditions.
基金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.
基金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.
基金supported by the Royal Academy of Engineering,UK,under the scheme of Distinguished International Associates(DIA-2424-5-134).
摘要The state of health SoH of lithium ion batteries plays a predominant role in ensuring the safe and reliable operation of electric vehicles.In this,a novel SoH estimation approach using support vector regression with a Gaussian kernel optimized using the Bayesian optimization technique(BO-SVR with a Gaussian kernel)was proposed.Unlike,traditional approaches that use the internal resistance,and battery capacity as input parameters,this study utilized the equivalent discharging voltage difference interval and equivalent charging voltage difference interval,as they capture the dynamic voltage characteristics associated with the battery degradation.The model was simulated using MATLAB 2023a.The mean absolute error,R2,root mean squared error,and mean squared error were considered as performance indicators.The simulation results indicated that the proposed BO-SVR with a Gaussian kernel model had superior performance to other kernel SVR and Gaussian Process Regression models,with a reduced RMSE of 0.0082,thus demonstrating its potential to predict the SoH more accurately.
基金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.
摘要Let (X,Y) be an R^d×R^1 valued random vector (X_1,Y_1),…, (X_n,Y_n) be a random sample drawn from (X,Y), and let E|Y|<∞. The regression function m(x)=E(Y|X=x) for x∈R^d is estimated by where, and h_n is a positive number depending upon n only, nad K is a given nonnegative function on R^d. In the paper, we study the L_p convergence rate of kernel estimate m_n(x) of m(x) in suitable condition, and improve and extend the results of Wei Lansheng.
摘要Owing to the effect of classified models was different in Protein-Protein Interaction(PPI) extraction, which was made by different single kernel functions, and only using single kernel function hardly trained the optimal classified model to extract PPI, this paper presents a strategy to find the optimal kernel function from a kernel function set. The strategy is that in the kernel function set which consists of different single kernel functions, endlessly finding the last two kernel functions on the performance in PPI extraction, using their optimal kernel function to replace them, until there is only one kernel function and it’s the final optimal kernel function. Finally, extracting PPI using the classified model made by this kernel function. This paper conducted the PPI extraction experiment on AIMed corpus, the experimental result shows that the optimal convex combination kernel function this paper presents can effectively improve the extraction performance than single kernel function, and it gets the best precision which reaches 65.0 among the similar PPI extraction systems.
摘要Upscaling of primary geological models with huge cells, especially in porous media, is the first step in fluid flow simulation. Numerical methods are often used to solve the models. The upscaling method must preserve the important properties of the spatial distribution of the reservoir properties. An grid upscaling method based on adaptive bandwidth in kernel function is proposed according to the spatial distribution of property. This type of upscaling reduces the number of cells, while preserves the main heterogeneity features of the original fine model. The key point of the paper is upscaling two reservoir properties simultaneously. For each reservoir feature, the amount of bandwidth or optimal threshold is calculated and the results of the upscaling are obtained. Then two approaches are used to upscaling two properties simultaneously based on maximum bandwidth and minimum bandwidth. In fact, we now have a finalized upscaled model for both reservoir properties for each approach in which not only the number of their cells, but also the locations of the cells are equal. The upscaling error of the minimum bandwidth approach is less than that of the maximum bandwidth approach.