Accurate estimation of capacities and cross-traffic of all links in a path using ICMP timestamps

The estimation of the link capacity and its available bandwidth in an end-to-end path is crucial for network management, admission control and flow control for adaptive applications. This paper introduces an estimation mechanism able to accurately estimate the available bandwidth of all links in an end-to-end path, through its capacity and cross-traffic estimation. The estimation procedures resort to the dispersions of packet pairs and trains using the concepts of ICMP Timestamp and Traceroute that, efficiently used together, enable the measurement of the dispersions in all links in the path. These mechanisms were evaluated through simulation experiments, where we analyzed the influence of the several network parameters on each estimation mechanism. The results show that these estimation methods are able to accurately estimate both the capacity and the cross-traffic of all links in a path with moderate length and with low overhead.     

基于矢量平均的信道估计算法

提出一种适用于DS-CDMA无线通信系统的低计算量而性能良好的信道估计算法。在DS-CDMA系统中，当接收信号经过解扩或多用户检测等时域预处理后，可以认为干扰大大减弱、期望信号在处理后的信号中占主要地位。这样，用预处理后信号相关阵的最大特征值对应的特征矢量可以很好地近似期望信号的信道矢量。但是，直接特征分解需要很大的计算量，特征跟踪计算量较低，但瞬态性能较差。本文提出一种基于相关矩阵列矢量平均的信道估计算法，该算法不需要特征分解或跟踪。仿真结果表明：新算法在降低计算量的情况下可以获得同直接特征分解方法几乎相同的性能。     

一种新的基于快速功控的多普勒估计

针对采用快速功控的移动通信系统提出了一种简便的多普勒估计方法。该方法利用功控后的接收信号电平的平稳性与最大多普勒频移有密切关系这一特点，通过测量接收信号电平的平稳性估计多普勒频移。文中在单径瑞利衰落信道条件下对这一方法进行了仿真验证，并同文献中提出的COV方法进行了比较，仿真结果表明在信道变化不是太快时本方案有较好的估计精度。     

基于支持向量机的缓存预估模型的设计与实现

采用支持向量机(SVM)对网络业务流数据进行预测估计，通过训练样本，从而获得样本以外数据的分布规律。在此基础上，设计了一种网络排队队列缓存的预估模型。实验表明，该模型具有较高的训练效率和很高的估计精确度。     

异步DS-CDMA系统中基于矩阵点除算法的DOA估计

针对异步DS-CDMA系统中的多用户环境,本文提出了一种低复杂度的DOA估计算法——矩阵点除算法。该算法通过对感兴趣信息的逐次分离,实现了DOA的逐路径估计。算法具有两方面显著优势:(1)克服了传统的DOA估计算法在路径总数大于天线阵元数时不能工作这一缺陷:(2)避免了计算复杂的特征值分解运算,大大降低了算法复杂度。仿真实验验证了算法的有效性。     

基于EDGE系统信道估计实现方案的研究

研究了基于ＥＤＧＥ系统接收机中信道估计的实现方案，并对算法的各项性能做出评估。首先论述了算法的采用及其理论依据。接着，说明了信道预估计的原理及方法。最后，针对ＭＡＴ－ＬＡＢ及 ＤＳＰ上的仿真结果，比较了各项系数对于系统性能改善所具有的影响和作用，对系统特性作了较为详细的分析总结。     

Efficient Collocation Schemes for Singular Boundary Value Problems

We discuss an error estimation procedure for the global error of collocation schemes applied to solve singular boundary value problems with a singularity of the first kind. This a posteriori estimate of the global error was proposed by Stetter in 1978 and is based on the idea of Defect Correction, originally due to Zadunaisky. Here, we present a new, carefully designed modification of this error estimate which not only results in less computational work but also appears to perform satisfactorily for singular problems. We give a full analytical justification for the asymptotical correctness of the error estimate when it is applied to a general nonlinear regular problem. For the singular case, we are presently only able to provide computational evidence for the full convergence order, the related analysis is still work in progress. This global estimate is the basis for a grid selection routine in which the grid is modified with the aim to equidistribute the global error. This procedure yields meshes suitable for an efficient numerical solution. Most importantly, we observe that the grid is refined in a way reflecting only the behavior of the solution and remains unaffected by the unsmooth direction field close to the singular point.     

相干源二维波达方向估计

本文分析了平面阵接收信号的协方差矩阵，发现它可分解为一个广义对称矩阵与一个非广义对称矩阵之和，利用信号协方差矩阵的这一结构特征，重点研究了相干源二维波达方向（DOA）估计．该方法通过构造一个差矩阵，求出其本特征值对应的任一特征向量，利用谱函数估计相干源二维DOA．简要分析了二维DOA估计的分维处理。     

Parametric estimation of discretely sampled Gamma-OU processes

The stationary Gamma-OU processes are recommended to be the volatility of the financial assets. A parametric estimation for the Gamma-OU processes based on the discrete observations is considered in this paper. The estimator of an intensity parameter A and its convergence result are given, and the simulations show that the estimation is quite accurate. Assuming that the parameter A is estimated, the maximum likelihood estimation of shape parameter c and scale parameter a, whose likelihood function is not explicitly computable, is considered. By means of the Gaver-Stehfest algorithm, we construct an explicit sequence of approximations to the likelihood function and show that it converges the true (but unkown) one. Maximizing the sequence results in an estimator that converges to the true maximum likelihood estimator and the approximation shares the asymptotic properties of the true maximum likelihood estimator. Some simulation experiments reveal that this method is still quite accurate in most of rational situations for the background of volatility.     

可变抽样区间的非参数控制图

最近几年一些学者研究了可变抽样区间的质量控制图。Amin等提出了可变抽样区间(VSI)的非参数控制图———符号 (Sign)统计量图〔1〕。本文在此基础上研究位置VSI符号控制图的制定方法 ,并设计离散VSI符号控制图。符号控制图的优点是对非正态总体亦可应用 ,并且不需要过程方差的信息。本文将所设计的VSI符号控制图同固定抽样区间 (FSI)的常规图作比较 ,并举实例说明符号控制图的应用