Online weighted flow time and deadline scheduling

In this paper we study some aspects of weighted flow time. We first show that the online algorithm Highest Density First is an O(1)-speed O(1)-approximation algorithm for P|r_i,pmtn|∑w_iF_i. We then consider a related Deadline Scheduling Problem that involves minimizing the weight of the jobs unfinished by some unknown deadline D on a uniprocessor. We show that any c-competitive online algorithm for weighted flow time must also be c-competitive for deadline scheduling. We then give an O(1)-competitive algorithm for deadline scheduling.     

条件泛函及其导数非参数估计的强一致收敛速度

研究了条件泛函及其导数的非参数估计,对随机与固定设计的条件泛函,分别利用核估计和非参数加权估计,在核函数及权函数满足一定条件下,证明了估计一致强收敛于待估函数的速度可达到最优。从而进一步推广和发展了Hrdle,etal.(1988)、Severini,etal.(1992)的许多结果。     

一种检验定性指标的有效方法

介绍了一种检验定性指标的有效方法,可用于确定产品的合格率和评价检验人员的检验水平。用该方法分析了某厂产品的一项实际指标,合格率为91 4%,还对该厂10名检验员的检验水平作了客观的评价。     

位置参数估计量的损失函数之估计

本文考虑损失函数的估计问题,分别对于球对称分布和均匀分布情形给出了其参数的J-S型估计量的损失之估计,它们满足[1]中提出的条件(Ⅰ)和(Ⅱ).     

加权Bergman空间上小Hankel算子的Schatten类

讨论了 C\+n 中有界对称域的加权Bergman空间上符号属于 L\+2\-a(Ω, dV\-λ) 的小Hankel算子, 利用符号 Φ 的某种积分变换,给出了小Hankel算子 h\-Φ 属于Schatten理想 S\-p 的特征.     

最大似然方法和Bayes方法在结构方程模型分析中的讨论(英文)

本文通过模拟研究,讨论了最大似然方法和Bayes方法在分析结构方程模型中的相似点和不同之处。     

A new algorithm for fixed design regression and denoising

In this paper, we present a new algorithm to estimate a regression function in a fixed design regression model, by piecewise (standard and trigonometric) polynomials computed with an automatic choice of the knots of the subdivision and of the degrees of the polynomials on each sub-interval. First we give the theoretical background underlying the method: the theoretical performances of our penalized least-squares estimator are based on non-asymptotic evaluations of a mean-square type risk. Then we explain how the algorithm is built and possibly accelerated (to face the case when the number of observations is great), how the penalty term is chosen and why it contains some constants requiring an empirical calibration. Lastly, a comparison with some well-known or recent wavelet methods is made: this brings out that our algorithm behaves in a very competitive way in term of denoising and of compression.     

Covariance estimation under spatial dependence

Correlated multivariate processes have a dependence structure which must be taken into account when estimating the covariance matrix. The natural estimator of the covariance matrix is introduced and is shown that to be biased under the dependence structure. This bias is studied under two different asymptotic models, namely increasing the domain by increasing the number of observations, and increasing the number of observations in the fixed domain. Using the first asymptotic model, we quantify the convergence rate of the bias and of the covariance between the components of the estimated covariance matrix. The second asymptotic model serves to derive a fast and accurate bias correction. As shown, under mild hypotheses, the asymptotic normality of the estimated covariance matrix holds and can be used to test whether the bias is significant, for example, in the sense that the eigenvectors of the estimated and true covariance matrices are significantly different.     

A note on the complexity and tractability of the heat equation

We wish to solve the heat equation u_t=Δu-qu in I^d×(0,T), where I is the unit interval and T is a maximum time value, subject to homogeneous Dirichlet boundary conditions and to initial conditions u(·,0)=f over I^d. We show that this problem is intractable if f belongs to standard Sobolev spaces, even if we have complete information about q. However, if f and q belong to a reproducing kernel Hilbert space with finite-order weights, we can show that the problem is tractable, and can actually be strongly tractable.     

Convergence rate of the best-r-point-average estimator for the maximizer of a nonparametric regression function

The best-r-point-average (BRPA) estimator of the maximizer of a regression function, proposed in Changchien (in: M.T. Chao, P.E. Cheng (Eds.), Proceedings of the 1990 Taipei Symposium in Statistics, June 28–30, 1990, pp. 63–78) has certain merits over the estimators derived through the estimation of the regression function. Some of the properties of the BRPA estimator have been studied in Chen et al. (J. Multivariate Anal. 57 (1996) 191) and Bai and Huang (Sankhya: Indian J. Statist. Ser. A. 61 (Pt. 2) (1999) 208–217). In this article, we further study the properties of the BRPA estimator and give its convergence rate under some quite general conditions. Simulation results are presented for the illustration of the convergence rate. Some comparisons with existing estimators such as the Müller estimator are provided.