A complete class for linear estimation in a general linear model

Summary It is shown that in linear estimation both unbiased and biased, all unique (up to equivalence with respect to risk) locally best estimators and their limits constitute a complete class.     

Structure relations for monic orthogonal polynomials in two discrete variables

In this paper, extensions of several relations linking differences of bivariate discrete orthogonal polynomials and polynomials themselves are given, by using an appropriate vector–matrix notation. Three-term recurrence relations are presented for the partial differences of the monic polynomial solutions of admissible second order partial difference equation of hypergeometric type. Structure relations, difference representations as well as lowering and raising operators are obtained. Finally, expressions for all matrix coefficients appearing in these finite-type relations are explicitly presented for a finite set of Hahn and Kravchuk orthogonal polynomials.     

求条件极值的一种新方法

利用线性代数的理论方法，对多元函数求条件极值的拉格朗日乘数法加以改进，建立了求条件极值的一种新方法     

A 64 kbit/s Videophone codec with forward analysis and control

A new combination of coding methods for a 64 kbit/s transmission system for typical videophone situations is investigated. The codec structure is based on a standard hybrid discrete cosine transform (DCT) codec with temporal prediction. The picture is divided blockwise into changed and unchanged areas. One motion vector with subpel accuracy is computed and transmitted for each block of the changed area. For the forward analysis, the prediction error is calculated in the whole picture. Only the blocks with the highest prediction errors are updated by a DCT with a perception adaptive quantization. The number of DCT update blocks depends on the remaining bits after the transmission of the overhead information. The codec is controlled by a forward analysis of the prediction error and is not based on a buffer control. The spatial resolution of the source signal is reduced in two steps to prevent a codec overload caused by too much activity between two frames.     

Possibilistic linear regression analysis for fuzzy data

Fuzzy data given by expert knowledge can be regarded as a possibility distribution by which possibilistic linear systems are defined. Recently, it has become important to deal with fuzzy data in connection with expert knowledge. Three formulations of possibilistic linear regression analysis are proposed here to deal with fuzzy data. Since our formulations can be reduced to linear programming problems, the merit of our formulations is to be able to obtain easily fuzzy parameters in possibilistic linear models and to add other constraint conditions which might be obtained from expert knowledge of fuzzy parameters. This approach can be regarded as a fuzzy interval analysis in a fuzzy environment.     

The signal/noise of an HMBC spectrum can depend dramatically upon the choice of acquisition and processing parameters

The effect of various acquisition and processing parameters on the sensitivity of HMBC spectra for typical organic molecules has been systematically investigated. For molecules in the 200–600 molecular weight range, an acquisition time of 0.2 to 0.4 s, a recycle time of no more than 1.0 s, optimization for ⁿJ_CH = 8 Hz and 512 time increments (with two‐ to fourfold linear prediction) are recommended. Some form of sine bell weighting along f₂ and either Gaussian or sine bell weighting along f₁ is suggested. The use of a 0.1‐s acquisition time and/or Gaussian or exponential weighting along f₂ can result in dramatic sensitivity loss, particularly for correlation peaks involving protons with complex splitting patterns, and should be avoided. Copyright © 2009 John Wiley & Sons, Ltd.     

有线数字电视长距离光纤传输中的色散补偿

有线数字电视信号在长距离光纤传输中存在色散问题,色散使系统的CSO指标劣化,适当地进行色散补偿可以大幅提升CSO指标,降低误码率(BER).     

A note on the MIR closure

In 1988, Nemhauser and Wolsey introduced the concept of MIR inequality for mixed integer linear programs. In 1998, Wolsey gave another definition of MIR inequalities. This note points out that the natural concepts of MIR closures derived from these two definitions are distinct. Dash, Günlük and Lodi made the same observation independently.     

On the numerical solution of the linear complementarity problem

The well-known linear complementarity problem with definite matrices is considered. It is proposed to solve it using a global optimization algorithm in which one of the basic stages is a special local search. The proposed global search algorithm is tested using a variety of randomly generated problems; a detailed analysis of the computational experiment is given.     

Testing Serial Correlation in Semiparametric Varying-Coefficient Partially Linear EV Models

This paper studies estimation and serial correlation test of a semiparametric varying-coefficient partially linear EV model of the form Y = X^Tβ ＋Z^Tα（T） ＋ε,ξ = X ＋ η with the identifying condition E[（ε,η^T）^T] =0, Cov[（ε,η^T）^T] = σ^2Ip＋1. The estimators of interested regression parameters /3 , and the model error variance σ2, as well as the nonparametric components α（T）, are constructed. Under some regular conditions, we show that the estimators of the unknown vector β and the unknown parameter σ2 are strongly consistent and asymptotically normal and that the estimator of α（T） achieves the optimal strong convergence rate of the usual nonparametric regression. Based on these estimators and asymptotic properties, we propose the VN,p test statistic and empirical log-likelihood ratio statistic for testing serial correlation in the model. The proposed statistics are shown to have asymptotic normal or chi-square distributions under the null hypothesis of no serial correlation. Some simulation studies are conducted to illustrate the finite sample performance of the proposed tests.