半参数模型约束条件下估计量的统计诊断

利用最小惩罚二乘原理构造加权惩罚平方和，导出了约束条件下，半参数模型中正规化矩阵正定时半参数平差的计算方法，用直接法得到了参数和半参数的估计量，并将此方法引入测绘领域，给出了相应的公式。     

环同态象的结构

本文对一类较为特殊的环给出商环分类的一种方法，为进一步研究商环的性质提供了较为直观的模型。     

Functional Central Limit Theorems for Triangular Arrays of Function-Indexed Processes under Uniformly Integrable Entropy Conditions

Functional central limit theorems for triangular arrays of rowwise independent stochastic processes are established by a method replacing tail probabilities by expectations throughout. The main tool is a maximal inequality based on a preliminary version proved by P. Gaenssler and Th. Schlumprecht. Its essential refinement used here is achieved by an additional inequality due to M. Ledoux and M. Talagrand. The entropy condition emerging in our theorems was introduced by K. S. Alexander, whose functional central limit theorem for so-calledmeasure-like processeswill be also regained. Applications concern, in particular, so-calledrandom measure processeswhich include function-indexed empirical processes and partial-sum processes (with random or fixed locations). In this context, we obtain generalizations of results due to K. S. Alexander, M. A. Arcones, P. Gaenssler, and K. Ziegler. Further examples include nonparametric regression and intensity estimation for spatial Poisson processes.     

求解张量随机互补问题的光滑牛顿算法

近年来, 越来越多的人意识到随机互补问题在经济管理中具有十分重要的作用。有学者已将随机互补问题由矩阵推广到张量, 并提出了张量随机互补问题。本文通过引入一类光滑函数, 提出了求解张量随机互补问题的一种光滑牛顿算法, 并证明了算法的全局和局部收敛性, 最后通过数值实验验证了算法的有效性。     

LOWLAD: a locally weightedL 1 smoothing spline algorithm with cross validated choice of smoothing parameters

The computation ofL ₁ smoothing splines on large data sets is often desirable, but computationally infeasible. A locally weighted, LAD smoothing spline based smoother is suggested, and preliminary results will be discussed. Specifically, one can seek smoothing splines in the spacesW _m (D), with [0, 1] ⁿ D. We assume data of the formy _i =f(t _i )+ _i ,i=1,..., N with {t _i } _i=1 ^N D, the _i are errors withE( _i )=0, andf is assumed to be inW _m . An LAD smoothing spline is the solution,s , of the following optimization problem

无初始状态统计知识时多变量系统的最优平滑与预报

在无初始状态统计知识的情况下,我们分别就固定点平滑、固定滞后平滑与预报３种情况给出了动态系统的最优线性最小偏差估计（ＢＬＩＭＢＥ）,同时还给出了完全（ｉ,ｊ,Ｔｉ）－可重构性的概念及系统完全（ｉ,ｊ,Ｔｉ）－可重构的充要条件     

核医学图像的平滑及自适应增强算法

针对核医学图像的特点,提出核医学图像的邻域加权平滑和自适应增强算法,用于去除图像噪声和增强图像,以改善图像的视觉效果,提高对核医学图像判读的正确性     

A note on smoothed estimating functions

The kernel estimate of regression function in likelihood based models has been studied in Staniswalis (1989,J. Amer. Statist. Assoc.,84, 276–283). The notion of optimal estimation for the nonparametric kernel estimation of semimartingale intensity (t) is proposed. The goal is to arrive at a nonparametric estimate of ₀=(t ₀) for a fixed pointt ₀ [0, 1]. We consider the estimator that is a solution of the smoothed optimal estimating equation is the optimal estimating function as in Thavaneswaran and Thompson (1986,J. Appl. Probab.,23, 409–417).     

AnL 1 smoothing spline algorithm with cross validation

We propose an algorithm for the computation ofL ₁ (LAD) smoothing splines in the spacesW _M (D), with . We assume one is given data of the formy _i =(f(t _i ) + _i , i=1,...,N with {itt_i} _i=1 ^{N D} , the _i are errors withE( _i )=0, andf is assumed to be inW _M . The LAD smoothing spline, for fixed smoothing parameter0, is defined as the solution,s , of the optimization problem (1/N) _i=1 ^N ¦y _i –g(t _i ¦+J _M (g), whereJ _M (g) is the seminorm consisting of the sum of the squaredL ₂ norms of theMth partial derivatives ofg. Such an LAD smoothing spline,s , would be expected to give robust smoothed estimates off in situations where the _i are from a distribution with heavy tails. The solution to such a problem is a thin plate spline of known form. An algorithm for computings is given which is based on considering a sequence of quadratic programming problems whose structure is guided by the optimality conditions for the above convex minimization problem, and which are solved readily, if a good initial point is available. The data driven selection of the smoothing parameter is achieved by minimizing aCV() score of the form .The combined LAD-CV smoothing spline algorithm is a continuation scheme in 0 taken on the above SQPs parametrized in, with the optimal smoothing parameter taken to be that value of at which theCV() score first begins to increase. The feasibility of constructing the LAD-CV smoothing spline is illustrated by an application to a problem in environment data interpretation.     

Nondifferential optimization via adaptive smoothing

The problem of minimizing a nondifferential functionx f(x) (subject, possibly, to nondifferential constraints) is considered. Conventional algorithms are employed for minimizing a differential approximationf off (subject to differentiable approximations ofg). The parameter is adaptively reduced in such a way as to ensure convergence to points satisfying necessary conditions of optimality for the original problem.This research was supported by the UK Science and Engineering Research Council, the National Science Foundation under Grant No. ECS-8121149, and the Joint Services Electronics Program, Contract No. F49620-79-C-0178.