2Keams M, Valiant L G. Learning Boolean formulate or factoring [R]. TR-1488. Cambridge, MA: Havard University Aiken Computation Laboratory, 1988.
3Kearns M, Valiant L G. Crytographic limitation on learning Boolean formulae and finite automata[C]//Proc, of the 21^st Annual ACM Syrup on Theory of Computing. New York: ACM, 1989:433-444.
4Schapire R E. The strength of weak learnability[J]. Machine Learning, 1990,5 (2) : 197-227.
5Dietterich T G. Ensemble learning. The Handbook of Brain Theory and Neural Networks(Second Edition)[M]. Ensemble Meth- ods in Machine Learning. In Multiple classier Systems,Cagliari, Italy, 2000.
7Freund Y, Schapire R E. A Decision theoretic generalization of on-line learning and an application to boosting[J]. Journal of Computer and System Scienses, 1997,55(1) : 119-139.
8Moore A W,Zuev D,Crogan M. Discriminators for use in flowbased classification[R]. RR-05-13. London.. Queen Mary University of London, 2005.
9Cache logic. Peer-to-Peer in 2005 [OL]. http://www, cachdogic. com/home/pages/research/p2p2005, php,2005.
10Sen S, Wang J. Analyzing peer-to-peer traffic across large networks[J]. IEEE/ACM Trans on Networking, 2004,12 (2):219- 232.
