曲率流的参数化有限元逼近

许多物理现象可以在数学上描述为受曲率驱动的自由界面运动,例如薄膜和泡沫的演变、晶体生长,等等.这些薄膜和界面的运动常依赖于其表面曲率,从而可以用相应的曲率流来描述,其相关自由界面问题的数值计算和误差分析一直是计算数学领域中的难点.参数化有限元法是曲率流的一类有效计算方法,已经能够成功模拟一些曲面在几类基本的曲率流下的演化过程.本文重点讨论曲率流的参数化有限元逼近,它的产生、发展和当前的一些挑战.     

高维稳健主成分聚类方法及其应用研究

随着信息技术的高速发展,每条数据所包含的信息越来越丰富,使得数据不可避免地含有异常值,且随着维数的增加,异常值出现的可能性更大。传统的主成分聚类分析对异常值特別敏感,基于MCD估计的主成分聚类方法虽然对异常值具有防御作用,但是在高维数据下MCD估计的偏差过大,其稳健性显著降低,而且当维数大于观测值个数时MCD估计失效。为此本文提出了基于MRCD估计的稳健主成分聚类方法,数值模拟和实证分析表明,基于MRCD估计的主成分聚类分析的效果优于传统的主成分聚类分析和基于MCD估计的主成分聚类分析,尤其是在维数大于样本观测值的情况下,MRCD估计更为有效。     

Weighted local polynomial estimations of a non-parametric function with censoring indicators missing at random and their applications

In this paper, we consider the weighted local polynomial calibration estimation and imputation estimation of a non-parametric function when the data are right censored and the censoring indicators are missing at random, and establish the asymptotic normality of these estimators. As their applications, we derive the weighted local linear calibration estimators and imputation estimations of the conditional distribution function, the conditional density function and the conditional quantile function, and investigate the asymptotic normality of these estimators. Finally, the simulation studies are conducted to illustrate the finite sample performance of the estimators.     

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

Perturbation analysis of theGI/GI/1 queue

We examine a family ofGI/GI/1 queueing processes generated by a parametric family of service time distributions,F(x,), and we show that under suitable conditions the corresponding customer stationary expectation of the system time is twice continuously differentiable with respect to. Expressions for the derivatives are given which are suitable for single run derivative estimation. These results are extended to parameters of the interarrival time distribution and expressions for the corresponding second derivatives (as well as partial second derivatives involving both interarrivai and service time parameters) are also obtained. Finally, we present perturbation analysis algorithms based on these expressions along with simulation results demonstrating their performance.     

Estimation of Multinomial Probabilities under a Model Constraint

In this paper estimation of the probabilities of a multinomial distribution has been studied. The five estimators considered are: unrestricted estimator (UE), restricted estimator (RE) (under model ), preliminary test estimator (PTE) based on a test of the model , shrinkage estimator (SE) and the positive-rule shrinkage estimator (PRSE). Asymptotic distributions of these estimators are given under Pitman alternatives and the asymptotic risk under a quadratic loss has been evaluated. The relative performance of the five estimators is then studied with respect to their asymptotic distributional risks (ADR). It is seen that neither of the preliminary test and shrinkage estimators dominates the other, though each fares well relative to the other estimators. However, the positive rule estimator is recommended for use for dimension 3 or more while the PTE is recommended for dimension less than 3.     

Measurement scheduling for recursive team estimation

We consider a decentralized LQG measurement scheduling problem in which every measurement is costly, no communication between observers is permitted, and the observers' estimation errors are coupled quadratically. This setup, motivated by considerations from organization theory, models measurement scheduling problems in which cost, bandwidth, or security constraints necessitate that estimates be decentralized, although their errors are coupled. We show that, unlike the centralized case, in the decentralized case the problem of optimizing the time integral of the measurement cost and the quadratic estimation error is fundamentally stochastic, and we characterize the -optimal open-loop schedules as chattering solutions of a deterministic Lagrange optimal control problem. Using a numerical example, we describe also how this deterministic optimal control problem can be solved by nonlinear programming.This research was supported in part by ARPA Grant N00174-91-C-0116 and NSF Grant NCR-92-04419.     

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.     

New Monte Carlo method for the self-avoiding walk

We introduce a new Monte Carlo algorithm for the self-avoiding walk (SAW), and show that it is particularly efficient in the critical region (long chains). We also introduce new and more efficient statistical techniques. We employ these methods to extract numerical estimates for the critical parameters of the SAW on the square lattice. We find=2.63820 ± 0.00004 ± 0.00030=1.352 ± 0.006 ± 0.025v=0.7590 ± 0.0062 ± 0.0042 where the first error bar represents systematic error due to corrections to scaling (subjective 95% confidence limits) and the second bar represents statistical error (classical 95% confidence limits). These results are based on SAWs of average length 166, using 340 hours CPU time on a CDC Cyber 170–730. We compare our results to previous work and indicate some directions for future research.