方向估计的神经网络计算

本文给出一种借助于二维神经网络构成的混合系统,用它来完成几种方向估计算法,这些算法包括：最大似然法,交替投影最大似然法,Ｍａｒｃｏｓ等人提出的无需特征分解的“传播算法”。利用神经网络对某些算法的快速性,该系统为实时实现目标的精确定位提供了一条新的,有效的途径。     

Higher order spectral estimation for random fields

This paper is concerned with the nonparametric estimation of the higher order cumulant spectra of vector-valued stationary random fields onZ ^d by smoothing the periodograms, whereZ is the space of integers and the dimensiond1. We derive the asymptotic cumulant properties of the spectral estimates, and consider an application to multidimensional nonlinear systems identification. Numerical examples with simulated data are provided.     

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).     

Alternating Sign Matrices and Some Deformations of Weyl's Denominator Formulas

An alternating sign matrix is a square matrix whose entries are 1, 0, or –1, and which satisfies certain conditions. Permutation matrices are alternating sign matrices. In this paper, we use the (generalized) Littlewood's formulas to expand the products and 2 as sums indexed by sets of alternating sign matrices invariant under a 180° rotation. If we put t = 1, these expansion formulas reduce to the Weyl's denominator formulas for the root systems of type B _n and C _n. A similar deformation of the denominator formula for type D _n is also given.     

New Monte Carlo method for the self-avoiding walk

We introduce a new Monte Carlo algorithm for the self-avoiding walk (SAW), and show that it is particularly efficient in the critical region (long chains). We also introduce new and more efficient statistical techniques. We employ these methods to extract numerical estimates for the critical parameters of the SAW on the square lattice. We find=2.63820 ± 0.00004 ± 0.00030=1.352 ± 0.006 ± 0.025v=0.7590 ± 0.0062 ± 0.0042 where the first error bar represents systematic error due to corrections to scaling (subjective 95% confidence limits) and the second bar represents statistical error (classical 95% confidence limits). These results are based on SAWs of average length 166, using 340 hours CPU time on a CDC Cyber 170–730. We compare our results to previous work and indicate some directions for future research.     

A group additivity approach for the estimation of heat capacities of organic liquids and solids at 298 K

A group additivity method is described which provides heat capacity estimates of the condensed phase. The data base consists of 810 liquids and 446 solids. Group values for carbon in various common substitution and hybridization states and for 47 functional groups are provided. The standard error of estimation using this approach on this data base is 19.5 (liquids) and 26.9 J/ (mole K) (solids). This can be compared to typical experimental uncertainties of 8.12 and 23,4 J/ (mole K) associated with these measurements, respectively. Experimental uncertainties were estimated from the numerical differences obtained for a given substance from multiple independent literature reports.     

Optimal convergence properties of kernel density estimators without differentiability conditions

Let X ₁, X ₂, ..., X _n be independent observations from an (unknown) absolutely continuous univariate distribution with density f and let % MathType!MTEF!2!1!+-% feaafeart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXafv3ySLgzGmvETj2BSbqefm0B1jxALjhiov2D% aebbfv3ySLgzGueE0jxyaibaiiYdd9qrFfea0dXdf9vqai-hEir8Ve% ea0de9qq-hbrpepeea0db9q8as0-LqLs-Jirpepeea0-as0Fb9pgea% 0lrP0xe9Fve9Fve9qapdbaqaaeGacaGaaiaabeqaamaabaabcaGcba% GabmOzayaajaGaaiikaiaadIhacaGGPaGaeyypa0Jaaiikaiaad6ga% caWGObGaaiykamaaCaaaleqabaGaeyOeI0IaaGymaaaakmaaqadaba% Gaam4saiaacUfadaWcgaqaaiaacIcacaWG4bGaeyOeI0Iaamiwamaa% BaaaleaacaWGPbaabeaakiaacMcaaeaacaWGObGaaiyxaaaaaSqaai% aadMgacqGH9aqpcaaIXaaabaGaamOBaaqdcqGHris5aaaa!5356!\[\hat f(x) = (nh)^{ - 1} \sum\nolimits_{i = 1}^n {K[{{(x - X_i )} \mathord{\left/ {\vphantom {{(x - X_i )} {h]}}} \right. \kern-\nulldelimiterspace} {h]}}} \] be a kernel estimator of f(x) at the point x, \s-<x<, with h=h _n (h _n O and nh _n , as n) the bandwidth and K a kernel function of order r. Optimal rates of convergence to zero for the bias and mean square error of such estimators have been studied and established by several authors under varying conditions on K and f. These conditions, however, have invariably included the assumption of existence of the r-th order derivative for f at the point x. It is shown in this paper that these rates of convergence remain valid without any differentiability assumptions on f at x. Instead some simple regularity conditions are imposed on the density f at the point of interest. Our methods are based on certain results in the theory of semi-groups of linear operators and the notions and relations of calculus of finite differences.This research was supported in part by grants from the Natural Sciences and Engineering Research Council of Canada and the University of Alberta Central Research Fund.     

The asymptotic equivalence of Bayes and maximum likelihood estimation

Let (X, $\text{A}$) be a measurable space, Θ ? $\text{R}$ an open interval and P_Ω ∥ $\text{A}$, Ω ? Θ, a family of probability measures fulfilling certain regularity conditions. Let $\text{Ω}{}_{\mathrm{n}}$ be the maximum likelihood estimate for the sample size n. Let λ be a prior distribution on Θ and let $\text{R}{}_{\mathrm{<mtext>n,</mtext><mtext>x</mtext>}}$ be the posterior distribution for the sample size n given $\text{x}\text{? X}{}^{\mathrm{n}}$. $\text{L:}\text{Θ}\text{× Θ →}\text{R}$ denotes a loss function fulfilling certain regularity conditions and T_n denotes the Bayes estimate relative to λ and L for the sample size n. It is proved that for every compact K ? Θ there exists c_K ≥ 0 such that

This theorem improves results of Bickel and Yahav [3], and Ibragimov and Has'minskii [4], as far as the speed of convergence is concerned.     

基于FrFT的欠采样LFM信号分离与参数估计

基于分数阶傅里叶变换，本文提出了一种欠采样条件下的宽带与窄带线性调频信号分离与参数估计方法。该方法先由延迟相乘和牛顿迭代算法估计信号的调频斜率，然后在分数阶傅立叶变换域进行滤波，实现信号分离。最后对欠采样信号解频率模糊，估计信号的初始频率。仿真表明了该方法分离宽带与窄带线性调频信号的可行性与分离后信号参数估计的有效性。     

An asymptotic maximum likelihood for estimating the nominal angle of a spatially distributed source

This paper proposes a large-sample approximation of the maximum-likelihood estimator for direction finding in the presence of a spatially spread source. The key idea is to replace the parametric estimate of the four-dimensional nuisance parameter vector with the approximate one that depends on just one parameter of interest, called the nominal angle, thus permitting the use of one-dimensional optimization techniques. The proposed estimator is shown to be strongly consistent and asymptotically efficient, and the Cramér–Rao bound on its standard deviation is derived. Simulations show the estimator to outperform previously proposed estimators, such as the subspace-based estimator and others based on one-dimensional search.