Nuclear charge radius predictions by kernel ridge regression with odd-even effects

The extended kernel ridge regression(EKRR)method with odd-even effects was adopted to improve the description of the nuclear charge radius using five commonly used nuclear models.These are:(i)the isospin-dependent A^(1∕3) formula,(ii)relativistic continuum Hartree-Bogoliubov(RCHB)theory,(iii)Hartree-Fock-Bogoliubov(HFB)model HFB25,(iv)the Weizsacker-Skyrme(WS)model WS*,and(v)HFB25*model.In the last two models,the charge radii were calculated using a five-parameter formula with the nuclear shell corrections and deformations obtained from the WS and HFB25 models,respectively.For each model,the resultant root-mean-square deviation for the 1014 nuclei with proton number Z≥8 can be significantly reduced to 0.009-0.013 fm after considering the modification with the EKRR method.The best among them was the RCHB model,with a root-mean-square deviation of 0.0092 fm.The extrapolation abilities of the KRR and EKRR methods for the neutron-rich region were examined,and it was found that after considering the odd-even effects,the extrapolation power was improved compared with that of the original KRR method.The strong odd-even staggering of nuclear charge radii of Ca and Cu isotopes and the abrupt kinks across the neutron N=126 and 82 shell closures were also calculated and could be reproduced quite well by calculations using the EKRR method.

Interpreting uninterpretable predictors:kernel methods,Shtarkov solutions,and random forests

Many of the best predictors for complex problems are typically regarded as hard to interpret physically.These include kernel methods,Shtarkov solutions,and random forests.We show that,despite the inability to interpret these three predictors to infinite precision,they can be asymptotically approximated and admit conceptual interpretations in terms of their mathe-matical/statistical properties.The resulting expressions can be in terms of polynomials,basis elements,or other functions that an analyst may regard as interpretable.

Kernel-Based State-Space Kriging for Predictive Control

In this paper, we extend the state-space kriging(SSK) modeling technique presented in a previous work by the authors in order to consider non-autonomous systems. SSK is a data-driven method that computes predictions as linear combinations of past outputs. To model the nonlinear dynamics of the system, we propose the kernel-based state-space kriging(K-SSK), a new version of the SSK where kernel functions are used instead of resorting to considerations about the locality of the data. Also, a Kalman filter can be used to improve the predictions at each time step in the case of noisy measurements. A constrained tracking nonlinear model predictive control(NMPC) scheme using the black-box input-output model obtained by means of the K-SSK prediction method is proposed. Finally, a simulation example and a real experiment are provided in order to assess the performance of the proposed controller.

Adaptive multi-step piecewise interpolation reproducing kernel method for solving the nonlinear time-fractional partial differential equation arising from financial economics

This paper is aimed at solving the nonlinear time-fractional partial differential equation with two small parameters arising from option pricing model in financial economics.The traditional reproducing kernel(RK)method which deals with this problem is very troublesome.This paper proposes a new method by adaptive multi-step piecewise interpolation reproducing kernel(AMPIRK)method for the first time.This method has three obvious advantages which are as follows.Firstly,the piecewise number is reduced.Secondly,the calculation accuracy is improved.Finally,the waste time caused by too many fragments is avoided.Then four numerical examples show that this new method has a higher precision and it is a more timesaving numerical method than the others.The research in this paper provides a powerful mathematical tool for solving time-fractional option pricing model which will play an important role in financial economics.

Kernel Generalized Noise Clustering Algorithm

To deal with the nonlinear separable problem, the generalized noise clustering （GNC） algorithm is extended to a kernel generalized noise clustering （KGNC） model. Different from the fuzzy c-means （FCM） model and the GNC model which are based on Euclidean distance, the presented model is based on kernel-induced distance by using kernel method. By kernel method the input data are nonlinearly and implicitly mapped into a high-dimensional feature space, where the nonlinear pattern appears linear and the GNC algorithm is performed. It is unnecessary to calculate in high-dimensional feature space because the kernel function can do it just in input space. The effectiveness of the proposed algorithm is verified by experiments on three data sets. It is concluded that the KGNC algorithm has better clustering accuracy than FCM and GNC in clustering data sets containing noisy data.

Kernel matrix learning with a general regularized risk functional criterion

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.

h-ADAPTIVITY ANALYSIS BASED ON MULTIPLE SCALE REPRODUCING KERNEL PARTICLE METHOD

An h-adaptivity analysis scheme based on multiple scale reproducing kernel particle method was proposed, and two node refinement strategies were constructed using searching-neighbor-nodes（SNN） and local-Delaunay-triangulation（LDT） techniques, which were suitable and effective for h-adaptivity analysis on 2-D problems with the regular or irregular distribution of the nodes. The results of multiresolution and h- adaptivity analyses on 2-D linear elastostatics and bending plate problems demonstrate that the improper high-gradient indicator will reduce the convergence property of the h- adaptivity analysis, and that the efficiency of the LDT node refinement strategy is better than SNN, and that the presented h-adaptivity analysis scheme is provided with the validity, stability and good convergence property.

The complex variable reproducing kernel particle method for two-dimensional elastodynamics

On the basis of the reproducing kernel particle method （RKPM）, a new meshless method, which is called the complex variable reproducing kernel particle method （CVRKPM）, for two-dimensional elastodynamics is presented in this paper. The advantages of the CVRKPM are that the correction function of a two-dimensional problem is formed with one-dimensional basis function when the shape function is obtained. The Galerkin weak form is employed to obtain the discretised system equations, and implicit time integration method, which is the Newmark method, is used for time history analysis. And the penalty method is employed to apply the essential boundary conditions. Then the corresponding formulae of the CVRKPM for two-dimensional elastodynamics are obtained. Three numerical examples of two-dimensional elastodynamics are presented, and the CVRKPM results are compared with the ones of the RKPM and analytical solutions. It is evident that the numerical results of the CVRKPM are in excellent agreement with the analytical solution, and that the CVRKPM has greater precision than the RKPM.

Kernel Generalization of Multi-Rate Probabilistic Principal Component Analysis for Fault Detection in Nonlinear Process

In practical process industries,a variety of online and offline sensors and measuring instruments have been used for process control and monitoring purposes,which indicates that the measurements coming from different sources are collected at different sampling rates.To build a complete process monitoring strategy,all these multi-rate measurements should be considered for data-based modeling and monitoring.In this paper,a novel kernel multi-rate probabilistic principal component analysis(K-MPPCA)model is proposed to extract the nonlinear correlations among different sampling rates.In the proposed model,the model parameters are calibrated using the kernel trick and the expectation-maximum(EM)algorithm.Also,the corresponding fault detection methods based on the nonlinear features are developed.Finally,a simulated nonlinear case and an actual pre-decarburization unit in the ammonia synthesis process are tested to demonstrate the efficiency of the proposed method.

ANALYSIS OF THREE-DIMENSIONAL UPSETTING PROCESS BY THE RIGID-PLASTIC REPRODUCING KERNEL PARTICLE METHOD

A meshless approach, called the rigid-plastic reproducing kernel particle method （RKPM）, is presented for three-dimensional （3D） bulk metal forming simulation. The approach is a combination of RKPM with the flow theory of 3D rigid-plastic mechanics. For the treatments of essential boundary conditions and incompressibility constraint, the boundary singular kernel method and the modified penalty method are utilized, respectively. The arc-tangential friction model is employed to treat the contact conditions. The compression of rectangular blocks, a typical 3D upsetting operation, is analyzed for different friction conditions and the numerical results are compared with those obtained using commercial rigid-plastic FEM （finite element method） software Deform^3D. As results show, when handling 3D plastic deformations, the proposed approach eliminates the need of expensive meshing and remeshing procedures which are unavoidable in conventional FEM and can provide results that are in good agreement with finite element predictions.

Kernel method-based fuzzy clustering algorithm

The fuzzy C-means clustering algorithm(FCM) to the fuzzy kernel C-means clustering algorithm(FKCM) to effectively perform cluster analysis on the diversiform structures are extended, such as non-hyperspherical data, data with noise, data with mixture of heterogeneous cluster prototypes, asymmetric data, etc. Based on the Mercer kernel, FKCM clustering algorithm is derived from FCM algorithm united with kernel method. The results of experiments with the synthetic and real data show that the FKCM clustering algorithm is universality and can effectively unsupervised analyze datasets with variform structures in contrast to FCM algorithm. It is can be imagined that kernel-based clustering algorithm is one of important research direction of fuzzy clustering analysis.

An interpolating reproducing kernel particle method for two-dimensional scatter points

An interpolating reproducing kernel particle method for two-dimensional （2D） scatter points is introduced. It elim- inates the dependency of gridding in numerical calculations. The interpolating shape function in the interpolating repro- ducing kernel particle method satisfies the property of the Kronecker delta function. This method offers a mathematics basis for recognition technology and simulation analysis, which can be expressed as simultaneous differential equations in science or project problems. Mathematical examples are given to show the validity of the interpolating reproducing kernel particle method.

Combining the complex variable reproducing kernel particle method and the finite element method for solving transient heat conduction problems

In this paper, the complex variable reproducing kernel particle （CVRKP） method and the finite element （FE） method are combined as the CVRKP-FE method to solve transient heat conduction problems. The CVRKP-FE method not only conveniently imposes the essential boundary conditions, but also exploits the advantages of the individual methods while avoiding their disadvantages, then the computational efficiency is higher. A hybrid approximation function is applied to combine the CVRKP method with the FE method, and the traditional difference method for two-point boundary value problems is selected as the time discretization scheme. The corresponding formulations of the CVRKP-FE method are presented in detail. Several selected numerical examples of the transient heat conduction problems are presented to illustrate the performance of the CVRKP-FE method.

Privacy-Preserving Recommendation Based on Kernel Method in Cloud Computing

The application field of the Internet of Things(IoT)involves all aspects,and its application in the fields of industry,agriculture,environment,transportation,logistics,security and other infrastructure has effectively promoted the intelligent development of these aspects.Although the IoT has gradually grown in recent years,there are still many problems that need to be overcome in terms of technology,management,cost,policy,and security.We need to constantly weigh the benefits of trusting IoT products and the risk of leaking private data.To avoid the leakage and loss of various user data,this paper developed a hybrid algorithm of kernel function and random perturbation method based on the algorithm of non-negative matrix factorization,which realizes personalized recommendation and solves the problem of user privacy data protection in the process of personalized recommendation.Compared to non-negative matrix factorization privacy-preserving algorithm,the new algorithm does not need to know the detailed information of the data,only need to know the connection between each data;and the new algorithm can process the data points with negative characteristics.Experiments show that the new algorithm can produce recommendation results with certain accuracy under the premise of preserving users’personal privacy.

Industrial Food Quality Analysis Using New k-Nearest-Neighbour methods

The problem of predicting continuous scalar outcomes from functional predictors has received high levels of interest in recent years in many fields,especially in the food industry.The k-nearest neighbor(k-NN)method of Near-Infrared Reflectance(NIR)analysis is practical,relatively easy to implement,and becoming one of the most popular methods for conducting food quality based on NIR data.The k-NN is often named k nearest neighbor classifier when it is used for classifying categorical variables,while it is called k-nearest neighbor regression when it is applied for predicting noncategorical variables.The objective of this paper is to use the functional Near-Infrared Reflectance(NIR)spectroscopy approach to predict some chemical components with some modern statistical models based on the kernel and k-Nearest Neighbour procedures.In this paper,three NIR spectroscopy datasets are used as examples,namely Cookie dough,sugar,and tecator data.Specifically,we propose three models for this kind of data which are Functional Nonparametric Regression,Functional Robust Regression,and Functional Relative Error Regression,with both kernel and k-NN approaches to compare between them.The experimental result shows the higher efficiency of k-NN predictor over the kernel predictor.The predictive power of the k-NN method was compared with that of the kernel method,and several real data sets were used to determine the predictive power of both methods.

Alternating minimization for data-driven computational elasticity from experimental data: kernel method for learning constitutive manifold

Data-driven computing in elasticity attempts to directly use experimental data on material,without constructing an empirical model of the constitutive relation,to predict an equilibrium state of a structure subjected to a specified external load.Provided that a data set comprising stress-strain pairs of material is available,a data-driven method using the kernel method and the regularized least-squares was developed to extract a manifold on which the points in the data set approximately lie(Kanno 2021,Jpn.J.Ind.Appl.Math.).From the perspective of physical experiments,stress field cannot be directly measured,while displacement and force fields are measurable.In this study,we extend the previous kernel method to the situation that pairs of displacement and force,instead of pairs of stress and strain,are available as an input data set.A new regularized least-squares problem is formulated in this problem setting,and an alternating minimization algorithm is proposed to solve the problem.

Laguerre reproducing kernel method in Hilbert spaces for unsteady stagnation point ow over a stretching/shrinking sheet

This paper investigates the nonlinear boundary value problem resulting from the exact reduction of the Navier-Stokes equations for unsteady magnetohydrodynamic boundary layer flow over the stretching/shrinking permeable sheet submerged in a moving fluid.To solve this equation,a numerical method is proposed based on a Laguerre functions with reproducing kernel Hilbert space method.Using the operational matrices of derivative,we reduced the problem to a set of algebraic equations.We also compare this work with some other numerical results and present a solution that proves to be highly accurate.

Splitting Rolling Simulated by Reproducing Kernel Particle Method

During splitting rolling simulation, re-meshing is necessary to prevent the effect of severe mesh distortion when the conventional finite element method is used. However, extreme deformation cannot be solved by the finite element method in splitting rolling. The reproducing kernel particle method can solve this problem because the continuum body is discretized by a set of nodes, and a finite element mesh is unnecessary, and there is no explicit limitation of mesh when the metal is split. To ensure stability in the large deformation elastoplastic analysis, the Lagrange material shape function was introduced. The transformation method was utilized to impose the essential boundary conditions. The splitting rolling method was simulated and the simulation results were in accordance with the experimental ones in the literature.

Improved reproducing kernel particle method for piezoelectric materials

In this paper, the normal derivative of the radial basis function （RBF） is introduced into the reproducing kernel particle method （RKPM）, and the improved reproducing kernel particle method （IRKPM） is proposed. The method can decrease the errors on the boundary and improve the accuracy and stability of the algorithm. The proposed method is applied to the numerical simulation of piezoelectric materials and the corresponding governing equations are derived. The numerical results show that the IRKPM is more stable and accurate than the RKPM.

Stability and dispersion analysis of reproducing kernel collocation method for transient dynamics

A reproducing kernel collocation method based on strong formulation is introduced for transient dynamics. To study the stability property of this method, an algorithm based on the von Neumann hypothesis is proposed to predict the critical time step. A numerical test is conducted to validate the algorithm. The numerical critical time step and the predicted critical time step are in good agreement. The results are compared with those obtained based on the radial basis collocation method, and they axe in good agreement. Several important conclusions for choosing a proper support size of the reproducing kernel shape function are given to improve the stability condition.