分析了动态网络最短程求解的研究现状,研究了动态网络的结构与求解最短程之间的关系。定义了以速度建模的动态网络,证明其满足弱FIFO(First In First Out)条件;证明了满足弱FIFO的充分必要条件是网络的任一条边的通过函数均是非降函数,通过函数均是非降函数的网络等价于用速度定义的动态网络;证明了动态网络可直接利用Dijkstra算法求解最短程的充分条件;研究了怎样建立满足弱FIFO条件或等价条件的动态网络,给出了基于弱FIFO动态网络求解最短程的算法,并通过一个典型的例子说明上述方法的有效性.
The data used in the process of knowledge discovery often includes noise and incomplete information. The boundaries of different classes of these data are blur and unobvious. When these data are clustered or classified, we often get the coverings instead of the partitions, and it usually makes our information system insecure. In this paper, optimal partitioning of incomplete data is researched. Firstly, the relationship of set cover and set partition is discussed, and the distance between set cover and set partition is defined. Secondly, the optimal partitioning of given cover is researched by the combing and parting method, acquiring the optimal partition from three different partitions set family is discussed. Finally, the corresponding optimal algorithm is given. The real wireless signals offten contain a lot of noise, and there are many errors in boundaries when these data is clustered based on the tradional method. In our experimant, the proposed method improves correct rate greatly, and the experimental results demonstrate the method's validity.
