In this paper, we solve a problem of Kobayashi posed in (Complex Finsler vector bundles, American Mathematical Society, Providence, 1996) by introducing a Donaldson type functional on the space F + ( E ) of strongly pseudo-convex complex Finsler metrics on <i>E</i>a holomorphic vector bundle over a closed Khler manifold <i>M</i>. This Donaldson type functional is a generalization in the complex Finsler geometry setting of the original Donaldson functional and has FinslerEinstein metrics on <i>E</i> as its only critical points, at which this functional attains the absolute minimum.

Varyingcoefficient linear models arise from multivariate nonparametric regression, nonlinear time series modelling and forecasting, functional data analysis, longitudinal data analysis and others. It has been a common practice to assume that the varying coefficients are functions of a given variable, which is often called an <i>index</i>. To enlarge the modelling capacity substantially, this paper explores a class of varyingcoefficient linear models in which the index is unknown and is estimated as a linear combination of regressors and/or other variables. We search for the index such that the derived varyingcoefficient model provides the least squares approximation to the underlying unknown multidimensional regression function. The search is implemented through a newly proposed hybrid backfitting algorithm. The core of the algorithm is the alternating iteration between estimating the index through a onestep scheme

Suppose that we have n observations from the convolution model Y = X+, where X and are the independent unobservable random variables, and is measurement error with a known distribution. We will discuss the asymptotic normality for deconvolving kernel density estimators of the unknown density f_{X}(.) of X by assuming either the tail of the characteristic function of behaves as f_{X}(.) (which is called supersmooth error), or the tail of the characteristic function is of order f_{X}(.) (called ordinary smooth error). Asymptotic normality of estimating the functional f_{X}(.) is also addressed.

This paper introduces a Projected Principal Component Analysis (Projected-PCA), which employees principal component analysis to the projected (smoothed) data matrix onto a given linear space spanned by covariates. When it applies to high-dimensional factor analysis, the projection removes noise components. We show that the unobserved latent factors can be more accurately estimated than the conventional PCA if the projection is genuine, or more precisely, when the factor loading matrices are related to the projected linear space. When the dimensionality is large, the factors can be estimated accurately even when the sample size is finite. We propose a flexible semi-parametric factor model, which decomposes the factor loading matrix into the component that can be explained by subject-specific covariates and the orthogonal residual component. The covariates effects on the factor loadings are further

<b></b> Estimation of the covariance structure of longitudinal processes is a fundamental prerequisite for the practical deployment of functional mapping designed to study the genetic regulation and network of quantitative variation in dynamic complex traits. We present a nonparametric approach for estimating the covariance structure of a quantitative trait measured repeatedly at a series of time points. Specifically, we adopt Huang et al.'s (2006,<i>Biometrika</i><b>93</b>, 8598) approach of invoking the modified Cholesky decomposition and converting the problem into modeling a sequence of regressions of responses. A regularized covariance estimator is obtained using a normal penalized likelihood with an<i>L</i>₂ penalty. This approach, embedded within a mixture likelihood framework, leads to enhanced accuracy, precision, and flexibility of functional mapping while preserving its biological relevance. Simulation studies are