超宽带探地雷达中TRM-SAR成像技术研究

将时间反转镜成像技术和SAR成像技术相结合,通过理论分析和仿真实验将它应用到超宽带探地雷达成像中。实验采用了粗糙地面和电参数随机的泥土真实反映复杂探地环境。将相应的时间反转镜成像技术-SAR成像结果与时域后向投影成像算法进行了对比,结果显示,时间反转镜成像技术凭借其统计自平均特性和空时匹配滤波特性,能够为超宽带探地雷达系统提供更高分辨率的成像结果。     

Sequential Estimation of Structural Models With a Fixed Point Constraint

This paper considers the estimation problem of structural models for which empirical restrictions are characterized by a fixed point constraint, such as structural dynamic discrete choice models or models of dynamic games. We analyze a local condition under which the nested pseudo likelihood (NPL) algorithm converges to a consistent estimator, and derive its convergence rate. We find that the NPL algorithm may not necessarily converge to a consistent estimator when the fixed point mapping does not have a local contraction property. To address the issue of divergence, we propose alternative sequential estimation procedures that can converge to a consistent estimator even when the NPL algorithm does not.     

Reducing data dimension for cluster detection

Clustering high-dimensional data is often a challenging task both because of the computational burden required to run any technique, and because the difficulty in interpreting clusters generally increases with the data dimension. In this work, a method for finding low-dimensional representations of high-dimensional data is discussed, specifically conceived to preserve possible clusters in data. It is based on the critical bandwidth, a nonparametric statistic to test unimodality, related to kernel density estimation. Some useful properties of the aforementioned statistic are enlightened and an adjustment to use it as a basis for reducing dimensionality is suggested. The method is illustrated by simulated and real data examples.     

CATANOVA for two-way cross classified categorical data

In this article we develop an extension of categorical analysis of variance for one response and two factors, based on a partitioning of a measure of predictability for three-way contingency tables, known as Gray and Williams's index. At the first instance moment the decomposition of this multiple measure of association in partial association measures is shown. Finally, for ordinal-scale variables, we propose an extension of this decomposition using a particular set of orthogonal polynomials.     

High-dimensional posterior consistency of the Bayesian lasso

ABSTRACT

This paper considers posterior consistency in the context of high-dimensional variable selection using the Bayesian lasso algorithm. In a frequentist setting, consistency is perhaps the most basic property that we expect any reasonable estimator to achieve. However, in a Bayesian setting, consistency is often ignored or taken for granted, especially in more complex hierarchical Bayesian models. In this paper, we have derived sufficient conditions for posterior consistency in the Bayesian lasso model with the orthogonal design, where the number of parameters grows with the sample size.     

Bayes least squares linear estimation of densities

Linear, least squares statistical methods in which the "parameters" are interpreted as random variables were introduced by Whittle, and further developed by Hartigan and others. They are applied here to the problem of estimating the coefficients in an orthogonal expansion of a multivariate density, given a simple random sample.     

Geometric programming for optimal allocation of integrated samples in quality control

We apply geometric programming, developed by Duffin, Peterson Zener (1967), to the optimal allocation of stratified samples. As an introduction, we show how geometric programming is used to allocate samples according to Neyman (1934), using the data of Cornell (1947) and following the exposition of Cochran (1953).

Then we use geometric programming to allocate an integrated sample introduced by Schwartz (1978) for more efficient sampling of three U. S. Federal welfare quality control systems, Aid to Families with Dependent Children, Food Stamps and Medicaid.

We develop methods for setting up the allocation problem, interpreting it as a geometric programming primal problem, transforming it to the corresponding dual problem, solving that, and finding the sample sizes required in the allocation problem. We show that the integrated sample saves sampling costs.     

Posterior moments of scalar functions of a covariance matrix

Given multivariate normal data and a certain spherically invariant prior distribution on the covariance matrix, it is desired to estimate the moments of the posterior marginal distributions of some scalar functions of the covariance matrix by importance sampling. To this end a family of distributions is defined on the group of orthogonal matrices and a procedure is proposed for selecting one of these distributions for use as a weighting distribution in the importance sampling process. In an example estimates are calculated for the posterior mean and variance of each element in the covariance matrix expressed in the original coordinates, for the posterior mean of each element in the correlation matrix expressed in the original coordinates, and for the posterior mean of each element in the covariance matrix expressed in the coordinates of the principal variables.     

宽带无线通信中的MIMO系统

介绍了多入多出系统中的空时、空频编码技术,并在此基础上将OFDM技术与MIMO系统相结合,研究了STBC-OFDM、SFBC-OFDM及VBLAST-OFDM系统。对该系统性能进行了分析和仿真,结果表明VBLAST系统传输速率最高,其速率至少是分组码MIMO-OFDM系统的2倍,但是其误码性能相对较差,误码率为0.001时,VBLAST-OFDM系统所需的信噪比比分组码系统要高9.3dB。