Reducing the complexity of distance measurement methods for circular turbo codes that use structured interleavers

The knowledge of turbo code's minimum Hamming distance (d_min) and its corresponding codeword multiplicity (A_min) is of a great importance because the error correction capability of a code is strongly tied to the values of d_min and A_min. Unfortunately, the computational complexity associated with the search for d_min and A_min can be very high, especially for a turbo code that has high d_min value. This paper introduces some useful properties of turbo codes that use structured interleavers together with circular encoding. These properties allow for a significant reduction of search space and thus reduce significantly the computational complexity associated with the determination of d_min and A_min values. © 2014 The Authors. International Journal of Communication Systems published by John Wiley & Sons, Ltd.     

Existence of the uniformly minimum risk equivariant estimators of parameters in a class of normal linear models

In this paper, we study the existence of the uniformly minimum risk equivariant (UMRE) estimators of parameters in a class of normal linear models, which include the normal variance components model, the growth curve model, the extended growth curve model, and the seemingly unrelated regression equations model, and so on. The necessary and sufficient conditions are given for the existence of UMRE estimators of the estimable linear functions of regression coefficients, the covariance matrixV and (trV)^α, where α > 0 is known, in the models under an affine group of transformations for quadratic losses and matrix losses, respectively. Under the (extended) growth curve model and the seemingly unrelated regression equations model, the conclusions given in literature for estimating regression coefficients can be derived by applying the general results in this paper, and the sufficient conditions for non-existence of UMRE estimators ofV and tr(V) are expanded to be necessary and sufficient conditions. In addition, the necessary and sufficient conditions that there exist UMRE estimators of parameters in the variance components model are obtained for the first time.     

关于AOR迭代法的研究

本文论证了严格对角占优矩阵之AOR法的误差估计式中的误差估计常数hγ,ω（0≤γ≤ω0）的最小值是h1,1.     

K_(1,n)-free图具有给定性质的[a,b]-因子的一个充分条件

图G称为K1,n-free图,如果它不含K1,n作为其导出子图.对K1,n-free图具有给定性质的[a,b]-因子涉及到最小度条件进行了研究,得到一个充分条件.     

一种在Kalman滤波中引入径向速度测量的新方法

研究在距离和径向速度测量噪声统计相关的情形下把径向速度测量引入Kalman滤波的新方法。分析了径向速度测量噪声与位置测量更新后状态滤波误差的统计相关性,根据Gauss-Markov定理导出了对应于径向速度测量的滤波方程由此而得到一种序贯滤波算法。两个不同的蒙特卡罗仿真表明,通过采用这一新算法引人径向速度测量,不仅可以大大提高状态估计的精度,而且其估计性能和计算效率优于传统的EKF。     

Pruning Redundant Alarm Correlation Patterns

1　ＩｎｔｒｏｄｕｃｔｉｏｎＴｈｅｓｔｉｃｋｉｎｇｐｏｉｎｔｏｆａｓｓｏｃｉａｔｉｏｎｒｕｌｅａｌｇｏｒｉｔｈｍｓｄｅｐｅｎｄｓｏｎｅｆｆｅｃｔｉｖｅｌｙｆｉｎｄｉｎｇａｌｌｃｏｒｒｅｌａｔｉｏｎｐａｔｔｅｒｎｓｔｈａｔｓａｔｉｓｆｙｖａｌｕｅｒｅｑｕｉｒｅｍｅｎｔｉｎｔｈｅｍａｇｎａｎｉｍｉｔｙｏｆｄａｔａ.Ｂｕｔｔｈｅａｌｇｏｒｉｔｈｍｓａｌｓｏｂｒｉｎｇａｎｅｇａｔｉｖｅｅｆ ｆｅｃｔ:ｔｈｅｎｕｍｂｅｒｏｆａｓｓｏｃｉａｔｉｏｎｒｕｌｅｓｉｓｖｅｒｙｌａｒｇｅ.Ａｌｓｏｉｎｆｏｒｍａｔｉｏｎ…     

Estimation of integrated volatility in stochastic volatility models

In the framework of stochastic volatility models we examine estimators for the integrated volatility based on the pth power variation (i.e. the sum of pth absolute powers of the log‐returns). We derive consistency and distributional results for the estimators given high‐frequency data, especially taking into account what kind of process we may add to our model without affecting the estimate of the integrated volatility. This may on the one hand be interpreted as a possible flexibility in modelling, for example adding jumps or even leaving the framework of semimartingales by adding a fractional Brownian motion, or on the other hand as robustness against model misspecification. We will discuss possible choices of p under different model assumptions and irregularly spaced data. Copyright © 2005 John Wiley & Sons, Ltd.     

内容寻址网络中内容的有效定位

P2P(Peer—to—Peer)的最基本的问题是如何高效地查找到存放文件的节点。本文提出在保持内容寻址网络(Content Addressable Network：CAN)现有特性的基础上建立一种更快捷有效的内容定位结构：基于快捷链接和最小距离的内容定位。本文首先介绍了内容寻址网络的基本工作原理，然后详细描述了基于快捷链接和最小距离进行内容定位的方法，并通过仿真证实了该方法很大程度上改善了CAN的性能。     

中国邮路问题的一个解法

本给出中国邮路问题的一个解法。虽然它仍只是初始方案，但因考虑了问题的足够信息，因而这种方案至少拉近了与最优解的距离。     

Minimum Distance Between the Faces of Two Convex Polyhedra: A Sufficient Condition

The problem of finding the Euclidean distance between two convex polyhedra can be reduced to the combinatorial optimization problem of finding the minimum distance between their faces. This paper presents a global optimality criterion for this problem. An algorithm (QLDPA) for the fast computation of the distance between convex and bounded polyhedra is proposed as an application of it. Computer experiments show its fast performance, especially when the total number of vertices is large.