Computer Engineering and Applications ›› 2009, Vol. 45 ›› Issue (12): 114-116.DOI: 10.3778/j.issn.1002-8331.2009.12.037

• 网络、通信、安全 • Previous Articles     Next Articles

Optimum selection algorithm of Web information reconstruction model and its improvement

PAN Rong,WEI Hui-qin   

  1. School of Computer and Information Technology,Beijing Jiaotong University,Beijing 100044,China
  • Received:2008-03-06 Revised:2008-06-11 Online:2009-04-21 Published:2009-04-21
  • Contact: PAN Rong

网络信息重构模型的优选算法及其改进

潘 榕,魏慧琴   

  1. 北京交通大学 计算机科学与信息技术学院,北京 100044
  • 通讯作者: 潘 榕

Abstract: From the perspective of information resources,this paper concentrates on the research of information issuance procedure via the information reconstruction model and discusses the optimum selection method according to its simplified model.It takes time complexity into consideration,researches with the dynamic plan theory,improves the optimum algorithm,and achieves an improved approach for the optimum selection algorithm of the Web information reconstruction model.This research enhances the algorithm with a profound development and ensures its wider practicality with respect to the reconstruction and issuance of Web information.

Key words: reconstruction model, Web information, device competence, leaf-node cover set

摘要: 从信息资源角度出发,针对网络信息发布过程的问题进行研究,建立信息重构模型,并根据简化模型进行优选方案讨论。从时间复杂度考虑,使用动态规划原理深入研究,对优选算法进行改进,得到网络信息重构模型优选算法的改进方案,使该算法得到更完善的发展,在网络信息重构发布方面拥有更广泛的实用性。

关键词: 重构模型, 网络信息, 承载能力, 叶结点覆盖集