Characteristics of origin-destination pair traffic in Funet

In this paper we analyze measurements gathered from a 2.5~Gbps link in the Finnish university network (Funet) in 2004. The traffic is broken down into origin-destination (OD) pair components based on source and destination IP address. We study the traffic characteristics of these components, and identify four typical representative OD pairs. For these pairs we investigate the validity of a moving IID Gaussian model. We find that the statistical properties of these OD pairs differ significantly from each other, with only some of them close to Gaussian. The OD pairs are also found to have some cross-correlation between each other, contradicting an often made assumption about OD pair independence. Furthermore, the existence of a mean-variance relation between the OD pairs is studied. We find that there is a relation between mean and variance, but for some periods of time it is rather weak.     

A parallel method for time discretization of parabolic equations based on Laplace transformation and quadrature

We consider the discretization in time of an inhomogeneous parabolicequation in a Banach space setting, using a representation ofthe solution as an integral along a smooth curve in the complexleft half-plane which, after transformation to a finite interval,is then evaluated to high accuracy by a quadrature rule. Thisreduces the problem to a finite set of elliptic equations withcomplex coefficients, which may be solved in parallel. The paperis a further development of earlier work by the authors, wherewe treated the homogeneous equation in a Hilbert space framework.Special attention is given here to the treatment of the forcingterm. The method is combined with finite-element discretizationin spatial variables.     

On computation of the greatest common divisor of several polynomials over a finite field

We propose a probabilistic algorithm to reduce computing the greatest common divisor of m polynomials over a finite field (which requires computing m−1 pairwise greatest common divisors) to computing the greatest common divisor of two polynomials over the same field.     

基于遗传算法的优化排样

介绍了遗传算法以及二维不规则图形的计算机优化排样，研究了二维不规则图形排样中如何建立遗传算法的目标函数，如何实现交叉、变异运算等优化过程，找到了运用遗传算法实现二维不规则图形优化排样的方法。通过计算机编制了运用遗传算法进行二维不规则图形优化排样的运算程序，并对部分样形进行了优化排样，结果比较满意。     

基于DTW算法的语音识别系统实现

动态时间归整(DTW)算法的实现简单有效,在孤立词语音识别系统中得到了广泛的应用.介绍了将DTW算法移植到TMS320VC5402上实现孤立词语音识别的原理、系统硬件组成和软件设计.研究结果表明,系统能满足实时性能要求,识别效果良好.     

一种外置式视频同步信号发生器的设计

对随机视频信号的特点进行了研究，提出了采用谱分析提取随机视频信号的同步频率的方法，根据数据传输的要求设计了基于USB接口的外置式视频同步信号发生器并给出了系统的硬件框图和软件流程。系统具有自动分析随机视频信息隐含的同步信号频率，精确产生同步脉冲信号的特点，满足随机视频信号采集和稳定显示的同步要求。同步精度达到300帧内图像漂移小于1个像素。利用该视频同步信号发生器控制非标准图像采集卡实现了计算机辐射的随机视频信号的采集和稳定显示。     

基于滑窗结构的软输出维特比算法的实现

文章在对软输出维特比算法(SOVA)进行推导的基础上，分析了软信息的提取过程。同时从硬件实现的角度考虑，提出了一种基于滑动窗1：3结构的SOVA算法实现方案，该算法大大降低了算法实现复杂度和译码延迟，同时通过调整滑窗参数，可以取得与非滑窗SOVA算法几乎相同的性能。     

基于聚类算法实现信号盲分类

本文解决了信号处理、工业控制等领域存在的非平稳信号盲分类问题。在聚类中广泛应用的K-Means算法及其它基于中心的聚类算法有两个共同的缺陷-需要预先确定类数目且随机初始化中心引起性能不稳定。本文提出的算法较好地解决了这两个问题，提高了算法稳定性，实现了非平稳信号盲分类。提取非平稳信号的小波系数作为聚类的样本空间，分析聚类结果的统计偏差以估计类的数目，采用调和均值准则进行分类。最后给出的仿真结果表明本文提出的方法较传统的K-Means算法明显降低分类错误率。     

线性规划联合算法的理论与应用

本在[1]的基础上．较系统的叙述了线性规划联合算法的步骤、相关理论及其应用，指出该算法具有避免人工变量、减少迭代次数、使用灵活、应用方便等特点。     

求解一类非单调线性互补问题的宽邻域内点方法及其计算复杂性

对于一类非单调线性互补问题给出了一种新的算法——宽邻域内点算法，并讨论了其计算复杂性。