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

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

GO-MOCE: Greedy Order Method of Conditional Expectations for Max Sat

In this paper we present and study a new algorithm for the Maximum Satisfiability (Max Sat) problem. The algorithm is based on the Method of Conditional Expectations (MOCE, also known as Johnson’s Algorithm) and applies a greedy variable ordering to MOCE. Thus, we name it Greedy Order MOCE (GO-MOCE). We also suggest a combination of GO-MOCE with CCLS, a state-of-the-art solver. We refer to this combined solver as GO-MOCE-CCLS.We conduct a comprehensive comparative evaluation of GO-MOCE versus MOCE on random instances and on public competition benchmark instances. We show that GO-MOCE reduces the number of unsatisfied clauses by tens of percents, while keeping the runtime almost the same. The worst case time complexity of GO-MOCE is linear. We also show that GO-MOCE-CCLS improves on CCLS consistently by up to about 80%.We study the asymptotic performance of GO-MOCE. To this end, we introduce three measures for evaluating the asymptotic performance of algorithms for Max Sat. We point out to further possible improvements of GO-MOCE, based on an empirical study of the main quantities managed by GO-MOCE during its execution.     

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.     

Structural optimization with parameter-transfer finite element

A mathematical method to solve structural problems, using parameter-transfer finite elements (P-TFE) was recently proposed by the authors [1] [2] [3]. The proposed transfer finite element approach is able to create a mathematical model of a structure, taking into account directly the whole behaviour of the structure under dynamic, aerodynamic, and thermal actions, and not by assembling, in a separate fashion, the stiffness and the mass matrix on one side and the external load vector as performed by the classical finite element procedure.The purpose of this paper is to apply the above methodology to optimization problems, in particular to obtain the minimum structural weight for a beam, under primary constraints on buckling load or natural frequencies.The use of P-TFE in the field of structural optimization overcomes most difficulties of the usual techniques of solution and the element is particularly useful in the evaluation of the sensitivity matrix.The formulation of the optimization problem based on P-TFE is presented and some applications are studied. The numerical results obtained are compared with other existing methodologies and briefly discussed.

---

Sommario Gli autori hanno già proposto un metodo per studiare problemi strutturali [1] [2] [3], introducendo una nuova metodologia di discretizzazione, basata sull'impiego di elementi finiti di trasferimento, funzioni esplicite di un parametro, indicati come P-TFE. Tali elementi sono in grado di rappresentare, in similitudine alla funzione di trasferimento, il comportamento completo dell'elemento strutturale in esame, soggetto ad azioni dinamiche, aerodinamiche e termiche; sono parimenti in grado di produrre, in similitudine al metodo degli elementi finiti, un modello matematico discreto di un continuo.Scopo del presente lavoro è di applicare detta metodologia a problemi di ottimizzazione, in particolare alla ricerca del minimo peso per una trave che mantenga inalterate le sue caratteristiche di carico critico o le frequenze naturali di vibrazione.Vengono quindi presentati alcuni risultati numerici dei casi esaminati e confrontati con quelli ottenuti da altri autori con l'impiego di altre metodologie.

---

List of Symbols {B} _m vector of the generalized state variables - {C} _m vector of integration constants - [I] unit matrix - EI bending stiffness - A cross-sectional area - u adimensional thickness - l beam length - M,M bending moment - [N] _m shape function ofm-th order - [N*] shape function atx ₀ - P axial load - [R] _i transfer matrix of thei-th element - T,T shear force - w transverse displacement - x adimensional independent variable - x ₀ value ofx at the left of the element - {Y} vector of state variables - {Y*} imposed condition atx ₀ - _0m Kronecker delta with the first pedix always set equal to zero - normalized eigenfrequency - normalized buckling load - mass density     

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 new algorithm for minimizing convex functions over convex sets

Let be a convex set for which there is an oracle with the following property. Given any pointz∈ℝ ⁿ the oracle returns a “Yes” ifz∈S; whereas ifz∉S then the oracle returns a “No” together with a hyperplane that separatesz fromS. The feasibility problem is the problem of finding a point inS; the convex optimization problem is the problem of minimizing a convex function overS. We present a new algorithm for the feasibility problem. The notion of a volumetric center of a polytope and a related ellipsoid of maximum volume inscribable in the polytope are central to the algorithm. Our algorithm has a significantly better global convergence rate and time complexity than the ellipsoid algorithm. The algorithm for the feasibility problem easily adapts to the convex 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).