苹果糖度的光谱图像无损检测技术研究

应用光谱图像技术进行了苹果内部品质无损检测技术的研究。通过采集不同波长(分别为632 nm,650 nm,670 nm,780 nm,850 nm和900 nm)的光谱图像,对所采集的光谱图像灰度分布进行洛伦兹分布(LD)、高斯分布(GD)、指数分布(ED)函数的拟合,通过比较发现洛伦兹分布为最优灰度分布拟合函数。将苹果的糖度与洛伦兹分布函数拟合所得参量分别进行多元线性回归,建立最佳单波长、最佳双波长组合、最佳三波长组合和最佳四波长组合的校正方程,相关系数R分别为0.622、0.776、0.831、0.813。实验表明,利用光谱图像技术无损检测苹果糖度是可行性的,为计算机图像对水果进行内部品质的无损检测提供技术依据。     

Approximating Unknown Mappings: An Experimental Evaluation

Different methodologies have been introduced in recent years with the aim of approximating unknown functions. Basically, these methodologies are general frameworks for representing non-linear mappings from several input variables to several output variables. Research into this problem occurs in applied mathematics (multivariate function approximation), statistics (nonparametric multiple regression) and computer science (neural networks). However, since these methodologies have been proposed in different fields, most of the previous papers treat them in isolation, ignoring contributions in the other areas. In this paper we consider five well known approaches for function approximation. Specifically we target polynomial approximation, general additive models (Gam), local regression (Loess), multivariate additive regression splines (Mars) and artificial neural networks (Ann).Neural networks can be viewed as models of real systems, built by tuning parameters known as weights. In training the net, the problem is to find the weights that optimize its performance (i.e. to minimize the error over the training set). Although the most popular method for Ann training is back propagation, other optimization methods based on metaheuristics have recently been adapted to this problem, outperforming classical approaches. In this paper we propose a short term memory tabu search method, coupled with path relinking and BFGS (a gradient-based local NLP solver) to provide high quality solutions to this problem. The experimentation with 15 functions previously reported shows that a feed-forward neural network with one hidden layer, trained with our procedure, can compete with the best-known approximating methods. The experimental results also show the effectiveness of a new mechanism to avoid overfitting in neural network training.     

Variography for Model Selection in Local Polynomial Regression with Spatial Data

In this work, we apply variographic techniques from spatial statistics to the problem of model selection in local polynomial regression with multivariate data. These techniques permit selection of the kernel and smoothing matrix with less computational load and interpretation of the regularity of the regression function in different directions. Moreover, they may represent the only feasible alternative for problems of a certain dimensionality.     

Modelling match outcomes and decision support for setting a final innings target in test cricket

^** E-mail: p.a.scarf{at}salford.ac.uk This paper considers the problem of timing the declaration ofthe third innings in test cricket. Data on the outcomes of recenttest matches are analysed in order to develop simple decisionsupport tools. The first of these tools presents match outcomeprobabilities given the position of the match at a potentialdeclaration point. These probabilities are determined usinga multinomial logistic regression model that is fitted to thetest match data. This idea is then extended to consider progresstowards a declaration—match outcome probabilities areconsidered as a function of target aimed for and run-rate. Thedecision tools have been implemented on a spreadsheet and examplecalculations are presented. The modelling described has thepotential for practical use in test matches.     

Asymptotically optimal selection of a piecewise polynomial estimator of a regression function

Let (X, Y) be a pair of random variables such that X = (X₁,…, X_d) ranges over a nondegenerate compact d-dimensional interval C and Y is real-valued. Let the conditional distribution of Y given X have mean θ(X) and satisfy an appropriate moment condition. It is assumed that the distribution of X is absolutely continuous and its density is bounded away from zero and infinity on C. Without loss of generality let C be the unit cube. Consider an estimator of θ having the form of a piecewise polynomial of degree k_n based on m_n^d cubes of length 1/m_n, where the m_n^d(_d^k_n+d) coefficients are chosen by the method of least squares based on a random sample of size n from the distribution of (X, Y). Let (k_n, m_n) be chosen by the FPE procedure. It is shown that the indicated estimator has an asymptotically minimal squared error of prediction if θ is not of the form of piecewise polynomial.     

殷墟考古的统计与模糊方法

以殷墟墓葬分期为实例 ,阐述模糊方法用于考古优势的思考 ,提出确定隶属度的方法 :概率法 ,以及确定权值的方法 :模糊方程法 .将数理统计与模糊数学结合起来 ,给出了墓葬分期的模糊模型 ,应用的效果令人满意     

Parametric multiple regression risk models: Theory and statistical analysis

Parametric multiple regression models for the claim number and the claim amount of an individual risk are introduced allowing explanatory variables to influence the mean claim number (amount). A model for an entire portfolio of risks is established on this basis. Then an extensive and in many cases efficient statistical analysis of this model is presented.     

Logistic曲线拟合方法研究

Logistic模型具有广泛的实用性。本文推导了用三点法估计该模型中参数K值的公式 ,并提出了估计K值的新方法一四点法和拐点法。用 3种方法求出K值后 ,再用线性化回归获得另外两个参数a、r,应用实例研究表明 :3种方法都可得到较高拟合精度 ,其中以四点法最优。而且 ,以这些方法得到的参数估计值作为初始值进行非线性回归 ,易获得 3个参数的最优估计。     

Some extensions of the Kantorovich inequality and statistical applications

Kantorovich gave an upper bound to the product of two quadratic forms, (X′AX) (X′A⁻¹X), where X is an n-vector of unit length and A is a positive definite matrix. Bloomfield, Watson and Knott found the bound for the product of determinants |X′AX| |X′A⁻¹X| where X is n × k matrix such that X′X = I_k. In this paper we determine the bounds for the traces and determinants of matrices of the type X′AYY′A⁻¹X, X′B²X(X′BCX)⁻¹ X′C²X(X′BCX)⁻¹ where X and Y are n × k matrices such that X′X = Y′Y = I_k and A, B, C are given matrices satisfying some conditions. The results are applied to the least squares theory of estimation.     

Extensions of CGS algorithms: Generalized least-square solutions

The CGS (conjugate Gram-Schmidt) algorithms of Hestenes and Stiefel are formulated so as to obtain least-square solutions of a system of equationsg(x)=0 inn independent variables. Both the linear caseg(x)=Ax–h and the nonlinear case are discussed. In the linear case, a least-square solution is obtained in no more thann steps, and a method of obtaining the least-square solution of minimum length is given. In the nonlinear case, the CGS algorithm is combined with the Gauss-Newton process to minimize sums of squares of nonlinear functions. Results of numerical experiments with several versions of CGS on test functions indicate that the algorithms are effective.The author wishes to express appreciation and to acknowledge the ideas and help of Professor M. R. Hestenes which made this paper possible.