Infrared Target Tracking Based on the Generalized Dynamic Constraints

Ming-sheng SHAO

[1] Zeng Z P, Wang J Y, Zhou L Z, et al．Coherent closed quasi-clique discovery from large dense graph databases [C]. Proceedings of the Twelfth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2006: 797-802．

[2] Sun Jigui, Gao Jian, Zhang Yonggang. A mini-conflict repair based algorithm for solving dynamic constraint satisfaction problems [J]. Journal of Computer Research and Development, 2007, 44(12): 2078-2084(in Chinese).

[3] Xing Siming, Chang Tianqing, Xu Wensheng, et al. An optimized method for constraint decomposition based on dynamic constraint network [J]. Computing Technology and Automation, 2004, 23(1): 49-52(in Chinese).

[4] Zhang Shaotong, Xiong Guangleng. Research on constraint networks supporting multidisciplinary design [J]. High Technology Letters, 2004, 14(2): 72-75(in Chinese).

[5] Li Min, Hu Jinzhu, Fei Lijuan, et al. Intelligent component selecting based on rough-fuzzy sets theory [J]. Computer Engineering, 2004, 30(18): 135-137(in Chinese).

[6] Qiao S J, Tang C J, Peng J, et al. VCCM mining: mining virtual community core members based on gene expression programming [J]. Lecture Notes in Computer Science, 2006, 3917: 133-138.

[7] Xu Kaikuo, Zhu Jun, Gong Jie, et al. BDRank: ranking objects in birth effect monitoring systems by graph theory [J]. Journal of Frontiers of Computer Science and Technology, 2008, 2(2): 166-179.

[8] Law Y C, Lee J H M, Smith B M. Automatic generation of redundant models for permutation constraint satisfaction problems [J]. Constraints, 2007, 12(4): 469-505.

[9] Shang Ronghua, Ma Wenping, Jiao Licheng, et al. Immune forgetting dynamic multi-objective optimization [J]. Journal of Harbin Engineering University, 2006, 27(z1): 251-253(in Chinese).