Multi-output Gaussian Process Regression Model with Combined Kernel Function for Polyester Esterification Processes

In polyester fiber industrial processes,the prediction of key performance indicators is vital for product quality.The esterification process is an indispensable step in the polyester polymerization process.It has the characteristics of strong coupling,nonlinearity and complex mechanism.To solve these problems,we put forward a multi-output Gaussian process regression(MGPR)model based on the combined kernel function for the polyester esterification process.Since the seasonal and trend decomposition using loess(STL)can extract the periodic and trend characteristics of time series,a combined kernel function based on the STL and the kernel function analysis is constructed for the MGPR.The effectiveness of the proposed model is verified by the actual polyester esterification process data collected from fiber production.

Identification of reservoir types in deep carbonates based on mixedkernel machine learning using geophysical logging data

Identification of reservoir types in deep carbonates has always been a great challenge due to complex logging responses caused by the heterogeneous scale and distribution of storage spaces.Traditional cross-plot analysis and empirical formula methods for identifying reservoir types using geophysical logging data have high uncertainty and low efficiency,which cannot accurately reflect the nonlinear relationship between reservoir types and logging data.Recently,the kernel Fisher discriminant analysis(KFD),a kernel-based machine learning technique,attracts attention in many fields because of its strong nonlinear processing ability.However,the overall performance of KFD model may be limited as a single kernel function cannot simultaneously extrapolate and interpolate well,especially for highly complex data cases.To address this issue,in this study,a mixed kernel Fisher discriminant analysis(MKFD)model was established and applied to identify reservoir types of the deep Sinian carbonates in central Sichuan Basin,China.The MKFD model was trained and tested with 453 datasets from 7 coring wells,utilizing GR,CAL,DEN,AC,CNL and RT logs as input variables.The particle swarm optimization(PSO)was adopted for hyper-parameter optimization of MKFD model.To evaluate the model performance,prediction results of MKFD were compared with those of basic-kernel based KFD,RF and SVM models.Subsequently,the built MKFD model was applied in a blind well test,and a variable importance analysis was conducted.The comparison and blind test results demonstrated that MKFD outperformed traditional KFD,RF and SVM in the identification of reservoir types,which provided higher accuracy and stronger generalization.The MKFD can therefore be a reliable method for identifying reservoir types of deep carbonates.

Classification of Service Functions in the Life Circle of Beijing Subway Line 7

As a key node for the surrounding area,metro stations are closely connected with the surrounding urban space and develop cooperatively.Different types of metro stations have differences in land use and functional positioning.This paper mainly used the methods of Tyson polygon,kernel density analysis and correlation analysis,based on POI data,to classify the stations of Beijing Metro Line 7.This paper made a detailed analysis of commercial subway stations,and analyzed the distribution characteristics of commercial metro stations on Line 7.

Multilinear commutators of BMO functions and multilinear singular integrals with non-smooth kernels

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.

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.

SVM with Quadratic Polynomial Kernel Function Based Nonlinear Model One-step-ahead Predictive Control

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.

Commutators of Weighted Lipschitz Functions and Multilinear Singular Integrals with Non-Smooth Kernels

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.

Landslide prediction based on improved principal component analysis and mixed kernel function least squares support vector regression model

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.

A KERNEL-TYPE ESTIMATOR OF A QUANTILE FUNCTION UNDER RANDOMLY TRUNCATED DATA

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.

An algorithm for moving target detection in IR image based on grayscale distribution and kernel function

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.

Hazard Rate Function Estimation Using Weibull Kernel

In this paper, we define the Weibull kernel and use it to nonparametric estimation of the probability density function (pdf) and the hazard rate function for independent and identically distributed (iid) data. The bias, variance and the optimal bandwidth of the proposed estimator are investigated. Moreover, the asymptotic normality of the proposed estimator is investigated. The performance of the proposed estimator is tested using simulation study and real data.

Protein-Protein Interaction Extraction Based on Convex Combination Kernel Function

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.

The choosing of reproducing kernel particle shape function with mathematic proof

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.

A Modified Full-NT-Step Infeasible Interior-Point Algorithm for SDP Based on a Specific Kernel Function

This paper proposes a new full Nesterov-Todd(NT) step infeasible interior-point algorithm for semidefinite programming. Our algorithm uses a specific kernel function, which is adopted by Liu and Sun, to deduce the feasibility step. By using the step, it is remarkable that in each iteration of the algorithm it needs only one full-NT step, and can obtain an iterate approximate to the central path. Moreover, it is proved that the iterative bound corresponds with the known optimal one for semidefinite optimization problems.

Interior-point algorithm based on general kernel function for monotone linear complementarity problem

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.

Functional Nonparametric Predictions in Food Industry Using Near-Infrared Spectroscopy Measurement

Functional statistics is a new technique for dealing with data thatcan be viewed as curves or images. Parallel to this approach, the Near-InfraredReflectance (NIR) spectroscopymethodology has been used in modern chemistryas a rapid, low-cost, and exact means of assessing an object’s chemicalproperties. In this research, we investigate the quality of corn and cookiedough by analyzing the spectroscopic technique using certain cutting-edgestatistical models. By analyzing spectral data and applying functional modelsto it, we could predict the chemical components of corn and cookie dough.Kernel Functional Classical Estimation (KFCE), Kernel Functional QuantileEstimation (KFQE), Kernel Functional Expectile Estimation (KFEE),Semi-Partial Linear Functional Classical Estimation (SPLFCE), Semi-PartialLinear Functional Quantile Estimation (SPLFQE), and Semi-Partial LinearFunctional Expectile Estimation (SPLFEE) are models used to accuratelyestimate the different quantities present in Corn and Cookie dough. Theselection of these functional models is based on their ability to constructa forecast region with a high level of confidence. We demonstrate that theconsidered models outperform traditional models such as the partial leastsquaresregression and the principal component regression in terms of predictionaccuracy. Furthermore, we show that the proposed models are morerobust than competing models such as SPLFQE and SPLFEE in the sensethat data heterogeneity has no effect on their efficiency.

ASYMPTOTIC NORMALITY OF KERNEL ESTIMATES OF A DENSITY FUNCTION UNDER ASSOCIATION DEPENDENCE

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.

Some Properties of a Kind of Singular Integral Operator with Weierstrass Function Kernel

We considered a kind of singular integral operator with Weierstrass function kernel on a simple closed smooth curve in a fundamental period parallelogram. Using the method of complex functions, we established the Bertrand Poincaré formula for changing order of the corresponding integration, and some important properties for this kind of singular integral operator.

A New Full-NT-Step Infeasible Interior-Point Algorithm for SDP Based on a Specific Kernel Function

In this paper, we propose a new infeasible interior-point algorithm with full NesterovTodd (NT) steps for semidefinite programming (SDP). The main iteration consists of a feasibility step and several centrality steps. We used a specific kernel function to induce the feasibility step. The analysis is more simplified. The iteration bound coincides with the currently best known bound for infeasible interior-point methods.

Simultaneous upscaling of two properties of reservoirs in one dimension using adaptive bandwidth in kernel function method

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.