Efficient Parallel Algorithms for Some Graph Theory Problems

In this paper,a sequential algorithm computing the aww vertex pair distance matrix D and the path matrix Pis given.On a PRAM EREW model with p,1≤p≤n^2,processors,a parallel version of the sequential algorithm is shown.This method can also be used to get a parallel algorithm to compute transitive closure array A^* of an undirected graph.The time complexity of the parallel algorithm is O(n^3/p).If D,P and A^* are known,it is shown that the problems to find all connected components,to compute the diameter of an undirected graph,to determine the center of a directed graph and to search for a directed cycle with the minimum(maximum)length in a directed graph can all be solved in O(n^2/p logp)time.     

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

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

Pruning Redundant Alarm Correlation Patterns

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

最值求解技巧:巧变四数

在用基本不等式求最值时,大家都熟悉一个口诀:"一正二定三相等",但是有许多学生在怎样保证定值和相等时不知道该如何变形.为了解决学生的困难和困惑,我根据自己的经验,概括为两句口诀:"一正二定三相等,巧变四数定乾坤".     

Optimization by random search with jumps

We give a random optimization (RO) algorithm to optimize a real‐valued function of n real variables. During the optimization process, interpolation points are examined to follow valleys, and jumps to new starting points are executed to avoid numerous iterations in local minima. Convergence with probability one to the global minimum of a function is proved. The proposed RO method is a simple, derivative‐free and computationally moderate algorithm, with excellent performance compared to other RO methods. Seven functions, which are commonly used to test the performance of optimization methods, are used to evaluate the performance of the RO algorithm given here. Copyright © 2004 John Wiley & Sons, Ltd.     

Learning to Predict Non-Deterministically Generated Strings

In this article we present an algorithm that learns to predict non-deterministically generated strings. The problem of learning to predict non-deterministically generated strings was raised by Dietterich and Michalski (1986). While their objective was to give heuristic techniques that could be used to rapidly and effectively learn to predict a somewhat limited class of strings, our objective is to give an algorithm which, though impractical, is capable of learning to predict a very general class. Our algorithm is meant to provide a general framework within which heuristic techniques can be effectively employed.     

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

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

《周培德三角剖分不是最小权三角剖分》一文商榷——反例不成立

周培协三角剖分是否能得到最小权三角剖分，周培德在《周培德三角部分不是最小权三角剖分》一文撰写之前已有新的结论，本文还指出《周培德三角剖分不是最小权三角剖分》一文所举反例不成立。     

单模光纤最小群速度色散波长附近的调制不稳定性

利用修正的非线性Ｓｃｈｒｏｄｉｎｇｅｒ方程研究了单模光纤最小群速度色散波长附近的调制不稳定性，发现了一个新的由光纤四色散导致的调制不稳定性区域，该区域的调制范围与初始入射脉冲的功率和四阶色散有关。