基于多Agent分布式约束优化问题求解方法研究
|
摘要
分布式约束优化问题是在大规模、开放、动态分布式网络环境中的优化问题,除了具有传统优化问题的非线性、约束性、建模困难等特点外,还具有随机、动态演化、信息局部化、控制分散化和网络状态异步更新等特点。针对分布式约束优化问题的特征,本文研究基于多Agent系统求解分布式约束优化问题的方法。本文的主要研究内容包括:(1)系统分析了基于多Agent系统求解分布式约束优化问题所涉及到的相关概念、理论和方法;(2)分析和总结了分布式约束优化问题的研究现状和存在问题,提出了基于多Agent系统求解分布式约束优化问题的一般方法,并给出了相应的算法SODC;(3)分析了现有复杂网络聚类算法存在的问题,进而在SODC基础之上,提出了一个基于自组织多Agent系统的分散式网络聚类算法D-P*;(4)分析了强化学习和Q-学习算法的特点和本质,提出了一种基于多Agent系统的分布式Q-学习算法MQ-L;(5)研究了移动Agent在电子商务领域的应用,分析和讨论了建立自主拍卖系统所涉及的主要问题,基于博奕论,提出了一种面向移动Agent的自主拍卖模型;(6)分析和指出现有中间件技术存在的不足,采用Agent技术和本文提出的分布式约束优化问题求解策略,提出一种支持Web智能应用系统快速开发和高效运行的Agent中间件解决方案,并开发了基于Agent中间件的Web智能系统集成开发平台和一批面向不同生产领域的专家系统。本文在基于多Agent系统的分布式约束优化问题求解、复杂网络聚类、增强学习、电子商务拍卖模型等方面的研究具有重要的理论意义和应用价值,丰富了多Agent系统和分布式约束优化问题求解的研究。
With the development of the communications infrastructure, computer technology and the applications of computer network, a passel of difficult requirements of new applications have occurred in the fields of scientific computing, business activities and so on. The distributed constraint optimization problem (DCOP) is one typical problem among them. The DCOP is a kind of optimization problem oriented to large-scale, open and dynamic network environments, which has been widely applied in many fields such as computational grid, multimedia networks, E-business, enterprise resource planning (ERP) and so on. Besides the features such as non-linear and constraint-satisfaction which traditional optimization problems have, the DCOP has its distinct features including dynamic evolution, regional information, localized control and asynchronous updating of network states. It has become a challenge for computer researchers to find out a large-scale, parallel as well as intelligent solution for the DCOP.
Decentralized control in terms of multi-solver rather than central and global control is adopted by a desired DCOP solving mechanism. During the DCOP solving process, multi solvers autonomously run . Each solver possesses regional knowledge of the problem in question, but not the global information of the whole problem space. The compute environment where the multi solvers situate is not static but dynamically evolving. Because the agent technology matches most features of the DCOP solving mechanism, it has been considered as a promising solution to it. However, the problem solving system of the DCOP is required to be self-adaptive for dealing with the stochastic and dynamically evolving features of the DCOP. Furthermore, it is also required to be self-organized due to the features of regional information, localized controlling and asynchronous updating of network states However, the solving mechanism for the DCOP provided by current agent technologies can not meet above requirements. So, To present a general approach for solving the DCOP by considering the features of the DCOP and integrating the self-adaptive and self-organized mechanisms into agent technology is able to not only shed new light to solving large-scale and complex DCOP but also push the academic and industrial research of agent technology.
Based on the analysis of related research and existing methods, we put forward a self-organized multi-agent based general approach to solving the DCOP. Using this approach, facing the all kinds of DCOPs in different fields such as complex network analysis, multi-agent learning, e-business and middleware based Web intelligent application system, the thesis has presented several specific multi-agent based algorithms for different DCOPs. The main results obtained by this thesis are listed as follows:
(1) The thesis has analyzed the related concepts, theories and methods about solving DCOP based on self-organized multi-agent, including the concepts and features of agent, distributed artificial intelligence and multi-agent system, self-organization theory, swarm intelligence, constraint optimization problem, distributed constraint optimization problem, distributed complex network clustering, multi-agent learning, auctions in E-commerce based on agent, and so on.
(2) The thesis has presented a general approach to solving the DCOP based on self-organized multi-agent. After analyzing and summarizing the existing research methods for solving DCOP, this thesis has pointed out the shortcomings of the existing algorithms for solving DCOP. So far, there have been a lot of methods for solving DCOP. However, most of them are not completely decentralized and require prior knowledge such as the global structures of networks as their inputs. Unfortunately, for many applications, the assumption that we can obtain the global views of networks beforehand is not true due to their huge sizes, geographical distributions or decentralized controls. To solve this problem, this thesis has presented a general approach to solving DCOP based on self-organized multi-agent. The method is named as SODC. Compared with the existing algorithms, the SODC has two main advantages. Firstly, it is a completely decentralized algorithm. Without global information of the whole network, it demonstrates the self-organizing behaviors based on divide and conquer strategy, in which multiple autonomous agents distributed in networks work together to solve the DCOP through a proposed self-organization mechanism. Secondly, it demonstrates better performance in both efficiency and effectiveness.
(3) The thesis has presented an agent based decentralized algorithm for clustering complex networks. After thoroughly analyzing the complex networks’structures and the features of existing algorithms of complex network clustering, this thesis has shown that though many related methods have been proposed and applied to different areas including complex network analysis, gene network analysis and web clustering engine, most of them are centralized. They need centralized disposal strategy and are not suitable for dealing with distributed networks, whose global structures are hard to be obtained due to their huge sizes, geographical distributions, decentralized controls or updating randomly. In this thesis, based on the SODC, we present a multi-agent based decentralized algorithm called as D-P*, in which a group of autonomous agents work together to cluster a network through a proposed self-aggregation and self-organization mechanism. Compared with the existing algorithms, the D-P* runs concurrently and asynchronously without any synchronized mechanism. It is able to rapidly find an approximately optimal network cluster structure hidden in the given network.
(4) The thesis has presented a distributed multi-agent Q-learning algorithm. After analyzing the features and the essence of reinforcement learning and Q-learning, this thesis has shown that the typical Q-learning algorithm is not suitable for multi-agent learning because the size of state-action space is huge and will exponentially grow as the number of agents increasing and that multi-agent learning is more widely than single agent learning. Based on the SODC, the thesis has presented an online multi-agent learning algorithm called as MQ-L. It integrates many good features such as sharing Q function, dynamic updating search strategy and action-state space pruning and so on. Essentially, the MQ-L is an approach to solving distributed constraint optimization problem, in which multiple agents collaborate to maximize their sharing Q function defined beforehand based on their respective local information. Experiments have shown that the MQ-L algorithm greatly improves the performance of multi-agent learning compared with the typical Q-learning algorithm.
(5) The thesis has investigated the application of mobile agent in e-commerce. After analyzing and discussing the main issues in establishing autonomous auction system, the thesis has shown that multi-agent based auction system is a distributed constraint optimization problem in essence. An agent plays with others based on its local information and constraint conditions to maximize its own cost function. However, distinct from all DCOPs discussed above, agents in the auctions compete rather than work together with others to maximize their own profits. According to some predefined auction protocols, agents in an auction system compete as well as compromise each other in order to get into a fix point state corresponding to a globally optimal solution in which every agent's profit is maximized. Based on the SODC and the game theory, the thesis has presented a mobile agent based autonomous auction model. The model supports to model auction hall, search auction hall, locate trade partners, synchronize different roles involved in an auction transaction and provides two typical auction protocols, which are the first price sealed-bid auction and double auction. After receiving tasks, agents in the model can autonomously search auction halls distributed in networks, take part in auctions and return the final auction results to their respective owners.
(6) The thesis has developed a web intelligent system integrated development platform based on agent middleware technology. It has shown that the existing middleware can preferably solve traditional problems frequently occurred in the process of developing distributed systems in most application fields. However, there exist some disadvantages listed as follows: first, it is difficult to support the abstraction, encapsulation and expendability of special issues (especially distributed constraint optimization problems) effectively. Second, it is difficult to meet the requirements of rapid building and effective running web based intelligent application system. Based on the adequate analysis of current middleware and intelligent application system, by adopting the agent technology and the strategies for solving the DCOP presented in above chapters, the thesis has presents an intelligent agent middleware based solution for rapidly building and effectively running the web intelligent applications. It has implemented the collaboration of distributed and heterogeneous intelligent components and permitted accessing, reusing and sharing the distributed and heterogeneous knowledge. The web intelligent application system integrated development platform based on agent middleware and several expert systems for different producing fields have been developed by utilizing the solution. They have demonstrated good results in practice.
The research results of the thesis including the general approach to solving the DCOP, the decentralized approach for clustering complex networks, multi-agent reinforcement learning, autonomous auction model for e-business and agent middleware based web intelligent application system, will greatly enrich and push the studies of the DCOP as well as the agent in both theoretical and technological aspects.
With the development of the communications infrastructure, computer technology and the applications of computer network, a passel of difficult requirements of new applications have occurred in the fields of scientific computing, business activities and so on. The distributed constraint optimization problem (DCOP) is one typical problem among them. The DCOP is a kind of optimization problem oriented to large-scale, open and dynamic network environments, which has been widely applied in many fields such as computational grid, multimedia networks, E-business, enterprise resource planning (ERP) and so on. Besides the features such as non-linear and constraint-satisfaction which traditional optimization problems have, the DCOP has its distinct features including dynamic evolution, regional information, localized control and asynchronous updating of network states. It has become a challenge for computer researchers to find out a large-scale, parallel as well as intelligent solution for the DCOP.
Decentralized control in terms of multi-solver rather than central and global control is adopted by a desired DCOP solving mechanism. During the DCOP solving process, multi solvers autonomously run . Each solver possesses regional knowledge of the problem in question, but not the global information of the whole problem space. The compute environment where the multi solvers situate is not static but dynamically evolving. Because the agent technology matches most features of the DCOP solving mechanism, it has been considered as a promising solution to it. However, the problem solving system of the DCOP is required to be self-adaptive for dealing with the stochastic and dynamically evolving features of the DCOP. Furthermore, it is also required to be self-organized due to the features of regional information, localized controlling and asynchronous updating of network states However, the solving mechanism for the DCOP provided by current agent technologies can not meet above requirements. So, To present a general approach for solving the DCOP by considering the features of the DCOP and integrating the self-adaptive and self-organized mechanisms into agent technology is able to not only shed new light to solving large-scale and complex DCOP but also push the academic and industrial research of agent technology.
Based on the analysis of related research and existing methods, we put forward a self-organized multi-agent based general approach to solving the DCOP. Using this approach, facing the all kinds of DCOPs in different fields such as complex network analysis, multi-agent learning, e-business and middleware based Web intelligent application system, the thesis has presented several specific multi-agent based algorithms for different DCOPs. The main results obtained by this thesis are listed as follows:
(1) The thesis has analyzed the related concepts, theories and methods about solving DCOP based on self-organized multi-agent, including the concepts and features of agent, distributed artificial intelligence and multi-agent system, self-organization theory, swarm intelligence, constraint optimization problem, distributed constraint optimization problem, distributed complex network clustering, multi-agent learning, auctions in E-commerce based on agent, and so on.
(2) The thesis has presented a general approach to solving the DCOP based on self-organized multi-agent. After analyzing and summarizing the existing research methods for solving DCOP, this thesis has pointed out the shortcomings of the existing algorithms for solving DCOP. So far, there have been a lot of methods for solving DCOP. However, most of them are not completely decentralized and require prior knowledge such as the global structures of networks as their inputs. Unfortunately, for many applications, the assumption that we can obtain the global views of networks beforehand is not true due to their huge sizes, geographical distributions or decentralized controls. To solve this problem, this thesis has presented a general approach to solving DCOP based on self-organized multi-agent. The method is named as SODC. Compared with the existing algorithms, the SODC has two main advantages. Firstly, it is a completely decentralized algorithm. Without global information of the whole network, it demonstrates the self-organizing behaviors based on divide and conquer strategy, in which multiple autonomous agents distributed in networks work together to solve the DCOP through a proposed self-organization mechanism. Secondly, it demonstrates better performance in both efficiency and effectiveness.
(3) The thesis has presented an agent based decentralized algorithm for clustering complex networks. After thoroughly analyzing the complex networks’structures and the features of existing algorithms of complex network clustering, this thesis has shown that though many related methods have been proposed and applied to different areas including complex network analysis, gene network analysis and web clustering engine, most of them are centralized. They need centralized disposal strategy and are not suitable for dealing with distributed networks, whose global structures are hard to be obtained due to their huge sizes, geographical distributions, decentralized controls or updating randomly. In this thesis, based on the SODC, we present a multi-agent based decentralized algorithm called as D-P*, in which a group of autonomous agents work together to cluster a network through a proposed self-aggregation and self-organization mechanism. Compared with the existing algorithms, the D-P* runs concurrently and asynchronously without any synchronized mechanism. It is able to rapidly find an approximately optimal network cluster structure hidden in the given network.
(4) The thesis has presented a distributed multi-agent Q-learning algorithm. After analyzing the features and the essence of reinforcement learning and Q-learning, this thesis has shown that the typical Q-learning algorithm is not suitable for multi-agent learning because the size of state-action space is huge and will exponentially grow as the number of agents increasing and that multi-agent learning is more widely than single agent learning. Based on the SODC, the thesis has presented an online multi-agent learning algorithm called as MQ-L. It integrates many good features such as sharing Q function, dynamic updating search strategy and action-state space pruning and so on. Essentially, the MQ-L is an approach to solving distributed constraint optimization problem, in which multiple agents collaborate to maximize their sharing Q function defined beforehand based on their respective local information. Experiments have shown that the MQ-L algorithm greatly improves the performance of multi-agent learning compared with the typical Q-learning algorithm.
(5) The thesis has investigated the application of mobile agent in e-commerce. After analyzing and discussing the main issues in establishing autonomous auction system, the thesis has shown that multi-agent based auction system is a distributed constraint optimization problem in essence. An agent plays with others based on its local information and constraint conditions to maximize its own cost function. However, distinct from all DCOPs discussed above, agents in the auctions compete rather than work together with others to maximize their own profits. According to some predefined auction protocols, agents in an auction system compete as well as compromise each other in order to get into a fix point state corresponding to a globally optimal solution in which every agent's profit is maximized. Based on the SODC and the game theory, the thesis has presented a mobile agent based autonomous auction model. The model supports to model auction hall, search auction hall, locate trade partners, synchronize different roles involved in an auction transaction and provides two typical auction protocols, which are the first price sealed-bid auction and double auction. After receiving tasks, agents in the model can autonomously search auction halls distributed in networks, take part in auctions and return the final auction results to their respective owners.
(6) The thesis has developed a web intelligent system integrated development platform based on agent middleware technology. It has shown that the existing middleware can preferably solve traditional problems frequently occurred in the process of developing distributed systems in most application fields. However, there exist some disadvantages listed as follows: first, it is difficult to support the abstraction, encapsulation and expendability of special issues (especially distributed constraint optimization problems) effectively. Second, it is difficult to meet the requirements of rapid building and effective running web based intelligent application system. Based on the adequate analysis of current middleware and intelligent application system, by adopting the agent technology and the strategies for solving the DCOP presented in above chapters, the thesis has presents an intelligent agent middleware based solution for rapidly building and effectively running the web intelligent applications. It has implemented the collaboration of distributed and heterogeneous intelligent components and permitted accessing, reusing and sharing the distributed and heterogeneous knowledge. The web intelligent application system integrated development platform based on agent middleware and several expert systems for different producing fields have been developed by utilizing the solution. They have demonstrated good results in practice.
The research results of the thesis including the general approach to solving the DCOP, the decentralized approach for clustering complex networks, multi-agent reinforcement learning, autonomous auction model for e-business and agent middleware based web intelligent application system, will greatly enrich and push the studies of the DCOP as well as the agent in both theoretical and technological aspects.
引文
[1]. J. Contreras, A. Losi, M. Russo, F. F. Wu. DistOpt: A distributed optimization software modeling and evaluation framework. Journal of Parallel and Distributed Computing, 2000, 60(6): 741–763.
[2]. R. Horst , P. M. Pardalos. Handbook of Global Optimization. Kluwer Academic Publishers, 1995.
[3]. K.C.Tsui, J.Liu. Multi-agent diffusion and distributed optimization. In: Proceedings of the second international joint conference on Autonomous agents and multiagent systems. Melbourne, Australia. 2003. 169 - 176
[4]. M. Dorigo, V. Maniezzo, A. Colorni. The ant system: Optimization by a colony of cooperative agents. IEEE Transactions on Systems, Man, and Cybernetics, Part B, 1996, 26(1): 1-13.
[5]. J. Liu, J. Han, Y. Y. Tang. Multi-agent oriented constraint satisfaction. Artificial Intelligence, 2002, 136(1): 101-144.
[6]. K. C. Tsui , J. Liu. An evolutionary multi-agent diffusion approach to optimization. International Journal of Artificial Intelligence and Pattern Recognition, 2002, 16 (6): 715-733.
[7]. I. Foster, C. Kesselman. The Grid: blueprint for a new computing infrastructure. Morgan Kaufmann Publishers, 1999.
[8]. F. Berman, G. Fox, T. Hey. Grid computing: making the global infrastructure a reality. New York, NY, USA :John Wiley & Sons, Inc. 2003.
[9]. H. Casanova, J. Hayes, Y. Yang. Algorithm and software to schedule and deploy independent tasks in grid environments. In: proceedings of the Workshop on Distributed Computing, Meta-computing, and Resource Globalization. (Invited paper). Aussois, France: GRAIL ,2002.
[10]. Y. Yang, H. Casanova. Umr: A multi-round algorithm for scheduling divisible workloads. In: proceeding of the International Parallel and Distributed Processing Symposium. 2003, 246.
[11]. H. Casanova, A. Legrand, D. Zagorodnov, F. Berman. Heuristics for scheduling parameter sweep application in grid environments. In: Proceedings of the Heterogeneous Computing Workshop, HCW. IEEE, USA , 2000, 349-363.
[12]. E.Crawley, R.Nair , B.Rajagopalan, H. Sandick. A framework for QoS-based routing in the Internet. IETF RFC 2386 , Internet Draft, QoS Routing Working Group, Internet Engineering Task Force, expires October 1998.
[13]. Z.Wang, J.Crowcroft. Quality-of-Service Routing for Supporting Multimedia Applications. IEEE Journal on selected areas in Communications, 1996, 14(7): 1228-1234.
[14]. K.S.Teng, M.Maheswaran. Limited Scope Probing: A Distributed Approach for QoS-Based Routing. In: IEEE International Symposium on Network Computing and Applications (NCA'01) Cambridge: Massachusette, 2001, 350-354.
[15]. 王征应,石冰心. 基于启发式遗传算法的 QoS 组播路由问题求解. 计算机学报. 2001, 24(1):56-61.
[16]. M. Moses. Agents in e-commerce. Communications of the ACM, 1999, 42(3): 79-91.
[17]. C.Guilfoyle, J. Jeffcoate, H. Stark. Agents on the Web: Catalyst for E-Commerce. Technical Report, London: Ovum Ltd, 1997.
[18]. M. Girvan and M.E.J. Newman. Community Structure in Social and Biological Networks.Proceedings of the National Academy of Sciences of the United States of America, 2002, 9(12): 7821–7826.
[19]. M.E.J. Newman and M. Girvan. Finding and Evaluating Community Structure in Networks. Physical Review E., 2004, 69(02): 026113-1~026113-15.
[20]. D.M.Wilkinson and B.A. Huberman. A method for finding communities of related genes. In: D. Wilkinson (eds.) Proceedings of the National Academy of Sciences of the United States of America (PNAS). 2004, 101(suppl_1):5241-5248.
[21]. R. Guimera and L.A.N. Amaral. Functional cartography of complex metabolic networks. Nature, 2005, 433(02): 895-900.
[22]. G. Palla, I.Derenyi, I.Farkas and T.Vicsek. Uncovering the overlapping community structures of complex networks in nature and society. Nature, 2005, 435(7043): 814-818.
[23]. Z.Wang and J.Zhang. In search of the biological significance of modular structures in protein networks. PLOS Computational Biology, 2007, 3(6):e107.
[24]. G.W. Flake, S. Lawrence and F.M. Coetzee. Self-Organization and Identification of Web Communities. IEEE Computer, 2002, 35(3): 66–71.
[25]. J.M. Kleinberg. Authoritative Sources in a Hyperlinked Environment. Journal of the ACM, 1999, 46(5):604-632.
[26]. J.Shi and J.Malik. Normalized Cuts and Image Segmentation. IEEE Transaction on Pattern Analysis and Machine Intelligence, 2000, 22(8): 888-905.
[27]. A.Meka and A.K.Singh. Distributed spatial clustering in sensor networks. LNCS, 2006, (3896):980-1000.
[28]. M.Yokoo, K.Hirayama. Algorithms for distributed constraint satisfaction:A review. Autonomous Agents and Multi-Agent Systems, 2000, 3(2):185-207.
[29]. H.D.Meer, A.L.Corte, A.Puliafito. Programmable agents for flexible QoS management in IP networks. IEEE Journal on Selected Areasin Communication. 2000 , 18 (2) : 256-267
[30]. C.S.Leung, J.P.Sum, H.Shen, J.Wu, G..Young. Analysis and design of an agent searching algorithm for e-marketplaces. Cluster Computing. 2004, 7 (1): 85-90.
[31]. M.Yokoo, E.H.Durfee. The distributed constraint satisfaction problem: Formalization and algorithms. IEEE Transactions on Knowledge and Data Engineering, 1998, 10(5).
[32]. M.Yokoo, K.Hirayama. Algorithms for distributed constraint satisfaction:A review. Autonomous Agents and Multi-Agent Systems. 2000, 3(2):185-207.
[33]. Q.Wu, N.S.V. Rao, B.Jacob, I.S.Sitharama, V.K.Vaishnavi. On Computing Mobile Agent Routes for Data Fusion in Distributed Sensor Networks. IEEE Transactions on Knowledge and Data Engineering, 2004, 16(6): 740-753.
[34]. S.D.M¨uller, J.Marchetto, S. Airaghi, P. Koumoustsakos. Optimization based on bacterial chemotaxis. IEEE Transactions on Evolutionary Computation, 2002, 6 (1): 16–29.
[35]. J.Sum, H.Shen, C.S.Leung, G.Young. Analysis on a Mobile Agent-Based Algorithm for Network Routing and Management. IEEE Transaction. Parallel and Distributed Systems, 2003, 14(3): 193-202.
[36]. H. Kuang, L. Bic, M. Dillencourt. Iterative Grid-Based Computing Using Mobile Agents. In:Proceedings of the 2002 International Conference on Parallel Processing, T. Abdelrahman (Ed.). 2002. 109-117.
[37]. J.H. Holland. Adaptation in Nature and Artificial Systems. University of Michigan Press. Reprinted by MIT Press, 1992.
[38]. P. Bak. Autumn book: How Nature Works: The Science of Self-Organized Criticality. Nature, 1996, 383(10): 772
[39]. K.Lerman. A Model of Adaptation in Collaborative Multi-Agent Systems. Adaptive Behavior. 2004, 12(4): 187-197.
[40]. S. Michael, F. Bettina, F. Michael, H. Frank, H. Daniela. Self-Organization in Multi-agent Systems. In: Proceedings of the Third International Workshop on Modeling Artificial Societies and Hybrid Organizations at the 24th German Conference on Artificial Intelligence. Germany. 2002.
[41]. A. Martinoli, E.Bonabeau, M.Dorigo, G.Theraulaz. Swarm intelligence: emergence and self-organization in natural and artificial systems. America:Oxford University Press, 2005.
[42]. J.Kennedy, R.Eberhart. Particle Swarm Optimization. IEEE International Conference on Neural Networks.1995,Vol 4: 1942-1948.
[43]. P. Dmel, A. Lingnau, O. Drobnik. Mobile Agent Interaction in Heterogeneous Environments. In: Proceedings of First International Workshop Mobile Agents '97, Berlin, Germany, 1997, vol. 1219, 136.
[44]. Lipo Wang. On Competitive Learning. IEEE Transactions on Neural Networks.1997, 8(5):1213-1216.
[45]. N.R.Jennings, K.Sycara, M. Wooldridge. A Roadmap of Agent Research and Development. In Autonomous Agents and Multi-Agent Systems, 1998(1): 275-306.
[46]. S. Russell, P.Norvig. Artificial Intelligence: A Modern Approach. Designing Autonomous Agents. Cambridge: MIT Press.1995.
[47]. M.Coen. See http://www.ai.mit.edu/people/sodabot/slideshow/total/p001.html .
[48]. Hayes-Roth. An Architecture for Adaptive Intelligent Systems. AI: Special Issue on Agents and Interactivity, 1995.329-365.
[49]. Wooldridge, M.,N.R. Jennings. Agent Theories, Architectures and languages:a Survey. In Wooldridg and Jennings Eds. Intelligent Agents.Berlin:Springer-Verlag,1995.
[50]. Shoham,Y. Agent-Oriented Programming:An overview and summary of recent research. In Proceedings of Artificial Intelligence, 1992.
[51]. A.S.Rao, M.P.Georgeff. BDI Agents: From Theory to Practice. In Proceedings of the First International Conference on Multi-Agent Systems (ICMAS-95), San Francisco, USA, 1995.
[52]. P.Maes. The Agent Network Architecture(ANA). SIGART Bulletin, 1991,2(4): 115-120.
[53]. D.Gilbert, M.Aparicio et al. IBM Intelligent Agent Strategy. IBM Corporation Tech Rep, 1995.
[54]. 杨博.移动 Agent 技术研究:[博士论文]. 长春:吉林大学. 2003.
[55]. 史忠植等.智能主体及其应用.北京:科学出版社,2000.
[56]. Jiming Liu, 靳小龙,张世武,吴建兵.多智能体模型与实验. 北京:清华大学出版社,2003.
[57]. Y.U.Cao, A.S.Fukunaga and A.B.Kahng. Cooperative mobile robotics: Antecedents and directions. Autonomous Robots. 1997,4(1):7-27.
[58]. E.H.Durfee, V.R.Lesser and D.D.Corkill. Trends in cooperative distributed problem solving. IEEETransactions on Knowledge and Data Engineering. 1989, KOE-11(1):63-83.
[59]. 石纯一等.多 Agent 系统引论.北京: 电子工业出版社.2003.
[60]. P.Pirjanian and M.J.Mataric. Multi-robot target acquisition using multiple objective behavior coordination. In Proceedings of the IEEE International Conference on Robotic Systems. Tsukuba.1989, 486-493.
[61]. T.Fukuda, H.Mizoguchi,K.Sekiyama and F.Arai. Group behavior control for MARS(Micro Autonomous Robotic System). In Proceedings of the IEEE International Conference on Robotics and Automation. Detroit. 1999, 1550-1555.
[62]. Ashby, W. Ross. Principles of the self-organizing dynamic system. Journal of General Psychology. 1947, 37:125-128.
[63]. Ashby, W. R. Design for a Brain. Chapman & Hall, 1966, 2nd edition edition.
[64]. Bak, P.. How Natrue works: The Science of Self-Organized Criticality. Copernicus Books.1996.
[65]. Liu, J.. Autonomous Agents and Multi-Agent Systems:Explorations in Learning, Self-Organization and Adaptive Computation. 2001. World Scientific Publishing.
[66]. Kauffman, S.. Origins of Order:Self-Organization and Selection in Evolution. 1993. Oxford University Press.
[67]. Nicolis,G. and Prigogine,I.. Self-Organization in Non-Equilibrium Systems: From Dissipative Structures to Order through Fluctuations . John Wiley. 1977.
[68]. Prigogine,I.. From Being to Becoming:Time and Complexity in the Physical Sciences. W.H.Freeman and Company. 1980.
[69]. Haken,H.. Advanced Synergetics:Instability Hierarchies of Self-Organizing Systems and Devices. Springer. 1983.
[70]. Haken,H.. Synergetics: An Introduction. Nonequilibrium Phase Transition and Self-Organization in Physics, Chemistry, and Biology. Springer, third revised and enlarged edition. 1983.
[71]. Haken,H.. Information and Self-Organization: A Macroscopic Approach to Complex Systems. Springer. 1988.
[72]. H.J.Jensen. Self-Organized Criticality-Emergent Complex Behavior in Physical and Biological Systems. Cambridge University Press, NY, 1998.
[73]. Hopcroft, J. E. and Ullman, J. D. Introduction to Automata Theory, Languages, and Computation. Reading, MA: Addison Wesley, 1979.
[74]. Wuensche, A. and Lesser, M. The Global Dynamics of Cellular Automata: An Atlas of Basin of Attraction Fields of One-Dimensional Cellular Automata. Reading, MA: Addison-Wesley, 1992.
[75]. Gacs, P. Reliable Cellular Automata with Self-Organization. Journal of Statistical Physics. 2001,vol. 103, 45-267.
[76]. Toffoli, T. and Margolus, N. Cellular Automata Machines: A New Environment for Modeling. Cambridge, MA: MIT Press, 1987.
[77]. Unsal,C.. Self-organization in large populations of mobile robots. [Msater’s thesis]. Department of Electrical Engineering, Virginia Polytechnic Institute and State University.
[78]. E.W.Bonabeau, M.Dorigo and G.Theraulaz. Swarm Intelligence: From Natural to Artificial Systems. New York: Oxford University Press. 1999.
[79]. L. E. Parker. Current state of the art in distributed robot systems. In L.E.Parker, G.Bekey and J.Barhen, editors, Distributed Autonomous Robotics Systems 4. Springer-Verlag, Berlin, 2000, 3-12.
[80]. M.Colombetti and M.Dorigo. Evolutionary computation in behavior engineering. In X.Yao,editor, Evolutionary Computation: Theory and Applications. World Scientific, Singapore, 1998, 37-80.
[81]. M.J.Mataric. Designing emergent behaviors: From local interactions to collective intelligence. In J.A.Meyer, H.L.Roitblat and S.Wilson, editors, From Aninals to Animats 2: Proceedings of the Second International Conference on Simulation of Adaptive Behavior. The MIT Press, Cambridge, MA. 1992, 432-441.
[82]. M.A.Bedau. Philosophical aspects of Artificial Life. In F.J.Varela and P.Bourgine, editors, Towards a Practice of Autonomous Systems: Proceedings of the First European Conference on Artificial Life. The MIT Press/Bradford Books, Cambridge,MA. 1992, 494-503.
[83]. D.Wolpert and K. Tumer. An Introduction to Collective Intelligence. Technical Report NASA-ARC-IC-99-63, NASA Ames Research Center, USA, 1999.
[84]. G.Beni. The concept of cellular robotic systems. In Proceedings of the IEEE International Symposium on Intelligent Control. Arlington, VA. 1998, 57-62.
[85]. G.Beni and J.Wang. Swarm Intelligence. In proceedings of the IEEE of the Seventh Annual Meeting of the Robotics Society of Japan. Tokyo. 1989, 425-428.
[86]. Montanari U. Networks of constraints: Fundamental properties and applications to picture processing. Information Sciences, 1974, 7(2):95?132.
[87]. Kumar V. Algorithms for constraint satisfaction problems: A survey. AI Magazine, 1992,13(1):32?44.
[88]. Sun JG, Jing SY. Solving non-binary constraint satisfaction problem. Chinese Journal of Computers, 2003,26(12):1746?1752.
[89]. Sun JG, Zhang YG. Model generation and constraint programming. In: Lu RQ, ed. The Knowledge Science and Computation Science. Beijing: Tsinghua University Press, 2003.197?232.
[90]. Zhang XZ, Liu CN. Synchronization of the inference engine with the constraint solver in a CLP system. Journal of Software, 1996,7(7):415?421.
[91]. Liu CN. Constraint logic programming-current status and future. In: Lu RQ, ed. The Knowledge Engineering and Knowledge Science Faced to the 21st Century. Beijing: Tsinghua University Press, 2001. 251?279.
[92]. Liu JM, Han J, Tang YY. Multi-Agent oriented constraint satisfaction. Artificial Intelligence, 2002,136(1):101?144.
[93]. Han J, Chen EH, Cai QS. Multi-Level strategy for maintaining arc consistency in problem solving and its implementation. Journal of Software, 1998,9(8):622?627,
[94]. Chen EH, Zhang ZY, Wang XF. A fast recognition algorithm of CRC constraint networks. Journal of Software, 2002,13(5):972?979.
[95]. Yokoo M, Durfee EH, Ishida T, Kuwabara K. The distributed constraint satisfaction problem: Formalization and algorithms. IEEE Transaction on Knowledge Data Engineering, 1998,10(5):673?685.
[96]. Jiming Liu, Han Jing and Y.Y. Tang. Multi-agent oriented constraint satisfaction. ArtificialIntelligence. 2002, 136(1): 101-144.
[97]. Faltings B, Yokoo M. Introduction: Special issue on distributed constraint satisfaction. Artificial Intelligence, 2005,161(1-2):1?5.
[98]. 王秦辉,陈恩红,王熙法. 分布式约束满足问题研究及其进展. 软件学报. 2006, 17(10): 2029-2039.
[99]. Yokoo M, Durfee EH, Ishida T, Kuwabara K. Distributed constraint satisfaction for formalizing distributed problem solving. In: 12th Int’l Conf. on Distributed Computing Systems (ICDCS’92). Los Alamitos: IEEE Computer Society Press, 1992. 614?621.
[100]. Calisti M, Neagu N. Constraint satisfaction techniques and software agents. In: Proc. of the AIIA 2004 Workshop on Agents and Constraints. Perugia, 2004.
[101]. Faltings B, Macho-Gonzalez S. Open constraint programming. Artificial Intelligence, 2005,161(1-2):181?208.
[102]. Pragnesh Jay Modi, Wei-Min Shen, Milind Tambe, and Makoto Yokoo. ADOPT: Asynchronous distributed constraint optimization with quality guarantees. Artificial Intelligence, 2005, 16(1-2):149-180.
[103]. MD Waltz, KS Fu. A heuristic approach to reinforcement learning control systems. IEEE Transactions on Automatic Control. 1965, 10(4): 390- 398.
[104]. R.S. Sutton. Reinforcement Learning Architecture for Animats. In: J.-A. Meyer and S.W. Wilson, editors, From Animals to Animats1: Proceedings of First International Conference on The Simulation of Adaptive Behavior. Cambridge, MA: The MIT Press/ Bradford Books. 1991,105-124.
[105]. L.P.Kaelbling. An adaptable mobile robot. In: F.J. Varela and P.Bourgine, editors, Toward a Practice of Autonomous Systems: Proceedings of the 1994 IEEE/RSJ International Conference on Intelligent Robots and Systems. Munchen. 1994, 15-22.
[106]. Maja Mataric and Dave Cliff. Challenges in evolving controllers for physical robots. Robotics and Autonomous Systems. 1996, 19(1).
[107]. S.Russell and P.Norvig. A Modern Approach. Artificial Intelligence. Prentice Hall, Englewood, NJ. 1995.
[108]. A.G.Barto and R.S.Sutton. Learning and sequential decision making. In: M.Gabril and J.Moore, editors, Learning and Computational Neurosciene: Foundations of Adaptive Networks. Cambridge,MA: The MIT Press. 1991, 89-95.
[109]. R.S.Sutton. Integrated architecture for learning, planning and reacting based on approximating dynamic programming. In: Proceedings of the International Conference in Machine Learning. Cambridge,MA: The MIT Press/Bradford Books. 1990, 105-124.
[110]. Crites R. H. and A. G. Barto. Improving Elevator Performance Using Reinforcement Learning. In: D. S. Touretzky, M. C. Mozer and M. E. Hasselmo , editors, Advances in Neural Information Processing Systems. 1996, 1017-1023.
[111]. Donald A. Berry, Bert Fristedt. Bandit Problems: Sequential Allocation of Experiments. Monographs on Statistics and Applied Probability.1985.
[112]. C. Gittins. Multi-armed Bandit Allocation Indices. Wiley-Interscience New York. Mathematical Reviews: MR90e:62113, 1989.
[113]. R.S.Sutton. Learning to predict by the method of temporal differences. Machine Learning. 1988, 3(8): 9-44.
[114]. Watkins. Learn from delayed rewards:[ PhD thesis]. Cambridge: cambridge university. 1989.
[115]. P.R.Kumar and Pravin Varaiya. Stochastic system:estimation,identification and adaptive control. NJ,USA: Prentice-Hall, Inc.. 1986.
[116]. A.W. Moore, C.G. Atkeson. Prioritized Sweeping: Reinforcement Learning with less data and less time. Machine Learning. 1993, 13(10): 103-130.
[117]. Anton Chechetka, Katia Sycara. A decentralized variable ordering method for distributed constraint optimization. In: Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems, 2005. 1307-1322.
[118]. S Ali, S Koenig, M Tambe. Preprocessing techniques for accelerating the DCOP algorithm ADOPT . In: Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems (AAMAS’05). Utrecht, Netherlands, 2005. 1041-1048.
[119]. E.Bowring, M.Tambe, M.Yokoo. Multiply-Constrained Distributed Constraint Optimization . In: Fifth InternationalJoint Conference on Autonomous Agents and Multi-Agent Systems (AAMAS-06), 2006, 1413-1420.
[120]. W. Yeoh, S. Koenig, A. Felner. IDB-ADOPT: A Depth-First Search DCOP Algorithm. In: Proceedings of the International Workshop on Distributed Constraint Reasoning (DCR) 2007. 60-70.
[121]. Bo Yang, Jiming Liu. An Autonomy Oriented Computing (AOC) Approach to Distributed Network Community Mining. In: the Proceeding of the First International Conference on Self-Adaptive and Self-Organizing Systems (SASO 2007). MIT, Boston, Mass., USA, July 9-11, 2007. 151-160.
[122]. D.J. Watts and S.H. Strogatz. Collective Dynamics of Small-World Networks. Nature, 1998, 393(6648): 440-442.
[123]. S.H. Strogatz. Exploring Complex Networks. Nature, 2001, 410(08): 268-276.
[124]. W.W. Zachary. An Information Flow Model for Conflict and Fission in Small Groups. Journal of Anthropological Research, 1977, 33(4): 452–473.
[125]. H.Ebel, L.I.Mielsch and S.Bornholdt. Scale-free topology of e-mail networks. Physical Review E, 2002, 66(09): 035103-1～035103-4.
[126]. J. Scott. Social Network Analysis: A Handbook. London: Sage Publications Inc. , 2000.
[127]. R.J. Williams and N.D. Martinez. Simple Rules Yield Complex Food Webs. Nature, 2000, 404(6774): 180-183.
[128]. H. Jeong, B.Tombor, R. Albert, Z.N.Oltvai, and A.L.Barabasi. The Large-Scale Organization of Metabolic Networks. Nature, 2000, 40 7(6804): 651–654.
[129]. D. Lusseau. The Emergent Properties of a Dolphin Social Network. In: Proc. Biol. Sci., 2003, 270(Suppl 2):S186- S188.
[130]. S.Milgram. The small world problem. Psychology Today, 1967, 1(1): 60-67.
[131]. A.L. Barabasi and R. Albert. Emergence of Scaling in Random Networks. Science, 1999, 286(5439):509-512.
[132]. R.Albert, A.L.Barabasi and H.Jeong. The Internet's Achilles heel: Error and attack tolerance ofcomplex networks. Nature, 2000, 406(2115): 378-382.
[133]. A.-L. Barabási, R. Albert, H. Jeong and G. Bianconi. Power-law distribution of the World Wide Web. Science, 2000, 287(5461): 2115a.
[134]. M.E.J. Newman, S.H. Strogatz and D.J. Watts. Random Graphs with Arbitrary Degree Distributions and Their Applications. Physical Review E. 2001, 64(02): 026118-1～026118-17.
[135]. M. Girvan and M.E.J. Newman. Community Structure in Social and Biological Networks. Proceedings of the National Academy of Sciences of the United States of America, 2002, 9(12): 7821–7826.
[136]. M.E.J. Newman and M. Girvan. Finding and Evaluating Community Structure in Networks. Physical Review E., 2004, 69(02): 026113 -1~026113-15.
[137]. R.Milo, S.Shen-Orr, S.Itzkovitz, N.Kashtan, D.Chklovskii and U.Alon. Network Motifs: simple building blocks of complex networks. Science, 2002, 298(5594):824-827.
[138]. E. Ravasz, A. L. Somera, D. A. Mongru, Z. N. Oltvai and A.L. Barabási. Hierarchical organization of modularity in metabolic networks. Science, 2002, 297(5586):1551-1555.
[139]. D.M.Wilkinson and B.A. Huberman. A method for finding communities of related genes. In: D. Wilkinson (eds.) Proceedings of the National Academy of Sciences of the United States of America (PNAS). 2004, 101(suppl_1):5241-5248.
[140]. R. Guimera and L.A.N. Amaral. Functional cartography of complex metabolic networks. Nature, 2005, 433(02): 895-900.
[141]. G. Palla, I.Derenyi, I.Farkas and T.Vicsek. Uncovering the overlapping community structures of complex networks in nature and society. Nat ure, 2005, 435(7043): 814-818.
[142]. Z.Wang and J.Zhang. In search of the biological significance of modular structures in protein networks. PLOS Computational Biology, 2007, 3(6):e107.
[143]. G.W. Flake, S. Lawrence and F.M. Coetzee. Self-Organization and Identification of Web Communities. IEEE Computer, 2002, 35(3): 66–71.
[144]. J.M. Kleinberg. Authoritative Sources in a Hyperlinked Environment. Journal of the ACM, 1999, 46(5):604-632.
[145]. J.Shi and J.Malik. Normalized Cuts and Image Segmentation. IEEE Transaction on Pattern Analysis and Machine Intelligence, 2000, 22(8): 888-905.
[146]. A.Meka and A.K.Singh. Distributed spatial clustering in sensor networks. LNCS, 2006, (3896):980-1000.
[147]. M.R. Garey and D.S.Johnson. Computers and intractability: a guide to the theory of NP-completeness. San Francisco: W. H. Freeman & Co. New York, NY, USA, 1979.
[148]. A. Pothen, H. Simon and K.P. Liou. Partitioning Sparse Matrices with Eigenvectors of Graphs. SIAM J. of Matrix Analysis and Application, 1990, 11: 430-452.
[149]. M. Fiedler. A Property of Eigenvectors of Nonnegative Symmetric Matrices and Its Application to Graph Theory. Czechoslovak Mathematical Journal. 1975, 25(100): 619-633.
[150]. J.R. Tyler, D.M. Wilkinson and B.A. Huberman. Email as Spectroscopy: Automated Discovery of Community Structure within Organizations. In: Huysman M, Wenger E,Wulf V. (eds.), Proceedings of the First International Conference on Communities and Technologies. Kluwer,Dordrecht, 2003, 81-96.
[151]. F.Radicchi, C.Castellano, F.Cecconi, V.Loreto and D.Parisi. Defining and Identifying Communities in Networks. In: Proceedings of the National Academy of Sciences of the United States of America (PNAS). 2004,101(9): 2658-2663.
[152]. B.W. Kernighan and S. Lin. An Efficient Heuristic Procedure for Partitioning Graphs. Bell System Technical Journal, 1970, 49(2): 291-307.
[153]. M.E.J. Newman. Fast Algorithm for Detecting Community Structure in Networks. Physical Rev. E. 2004, 69(06): 066133.
[154]. B.Yang, W.K. Cheung and J.Liu. Community Mining from signed Social Networks. IEEE Transactions on Knowledge and Data Engineering (TKDE). 2007, 19(10):1333-1348.
[155]. B.Yang and J.Liu. An Efficient Probabilistic Approach to Network Community Mining. In: the Proceeding of 2007 Joint Rough Set ymposium (JRS’07). Toronto, Canada: LNAI, 2007. 4481: 267-275.
[156]. P. Pons and M. Latapy. Computing communities in large networks using random walks. arxiv:physics/0512106, 2005.
[157]. J. Liu, X.L. Jin and K.C. Tsui. Autonomy Oriented Computing. Springer/Kluwer Academic Publishers, 2004.
[158]. J. Liu, X.L.Jin and K.C. Tsui. Autonomy Oriented Computing (AOC): Formulating computational systems with autonomous components. IEEE Transaction on Systems, Man, and Cybernetics, Part A: Systems and Humans. 2005,35(6):879- 902.
[159]. B.Yang and J. Liu. An Autonomy Oriented Computing (AOC) Approach to Distributed Network Community Mining. In: the First International Conference on Self-Adaptive and Self-Organizing Systems (SASO 2007). MIT, Boston, Mass., USA, 2007. 151-160.
[160]. 杨博, 刘大有, 杨鲲, 张朝辉. 移动 Agent 系统的主动通信机制. 软件学报, 2003, 14(7):1338-1344.
[161]. Yang Gao, Chen S F, Research on Reinforcement Learning Technology: A Review. ACTA AUTOMATICE SINICA. 2004, 30(1): 89-100.
[162]. Guo Maozu, Wang Yadong, Sun Huamei and Liu Yang. Research on Q-learning Algorithm Based on Metropolis Criterion. Journal of Computer Research and Development. 2002, 39(6): 684-688.
[163]. Sutton R S, Precup D, Singh S. Between MDPs and semi-MDPs: a framework for temporal abstraction in reinforcement learning. Artificial Intelligence, 1999, 112(1/2): 181-211.
[164]. Guo Maozu, Chen Bin, Wang Xiaolong et al. A summary on reinforcement learning. Computer Science, 1998,25(3): 13-15.
[165]. Kaelbling L P, Littman M L, Moore A W. Reinforcement learning: A survey. Journal of Artificial Intelligence Research, 1996,4(2): 237-285.
[166]. Li Ning, Gao Yang, Lu Xin, Chen Shi-Fu. A learning agent based on reinforcement learning. Computer Research and Development. 2001, 38(9):1051-1056.
[167]. Watkins P.Dayan. Q-learning. Machine Learning. 1992,8(3): 279-292.
[168]. Tsitsiklis, John N. Asynchronous stochastic approximation and Q-learning. Machine Learning.1994,16(3): 185-202.
[169]. Cai Qingsheng, Zhang Bo. An Agent Team Based Reinforcement Learning Model AND Its Application. Journal of Computer Research and Development. 2000, 37(9): 1087-1093.
[170]. Park Kui-Hong, Kim Yong-Jae, Kim Jong-Hwan. Modular Q-learning based multi-agent cooperation for robot soccer. Robotics and Autonomous Systems.2001, 35(2): 109-122.
[171]. D Martin, A Cheyer, D Moran. The open agent architecture: a framework for building distributed software systems. Applied Artificial Intelligence, 1999,13(1):91～128.
[172]. P Dasgupta, N Narasimhan, L Moser, P M Smith. MAGNET: Mobile Agents for Networked Electronic Trading. IEEE Transactions on Knowledge and Data Engineering, 1999, 24(6): 509-525.
[173]. D. B. Lange, M. Oshima. Seven good reasons for mobile agents. Communications of the ACM, 1999,42(3): 88-89.
[174]. S Y Su, C Huang, J Hammer. A replicable web-based negotiation server for e-commerce. In: Proceedings of the 33rd Hawaii International Conference on System Sciences(HICSS-33). Maui: IEEE Computer Society, 2000. 219～228.
[175]. K Y Lee, J S Yun, G S Jo. MoCAAS: Auction agent system using a collaborative mobile agent in electronic commerce. Expert Systems with Applications, 2003, 24 (2): 183-187.
[176]. P P Y Lam, L Ye, H C B Chan. Business-to-consumer and business-to-business Mobile Agent-based Internet Commerce System (MAGICS). In: Conference Proceedings -2004 IEEE International Conference on Systems, Man and Cybernetics, SMC. Hague,Netherlands: IEEE Press, 2004.4106-4111.
[177]. D L Zhang, C Lin. Security model of mobile agent in e-commerce. Tongji Daxue Xuebao/Journal of Tongji University, 2005, 33 (12): 1680-1684.
[178]. D H Shih, S Y Huang, D C Yen. A new reverse auction agent system for m-commerce using mobile agents. Computer Standards and Interfaces, 2005, 27 (4): 383-395.
[179]. P P Y Lam, H C B Chan. A Markov-decision-based price comparison problem for mobile agent-based internet commerce system (MAGICS). In: Proceedings of IEEE International Conference on E-Commerce Technology for Dynamic E-Business (CEC-East'04). Shanghai, China: China Science and Technology Press, 2004. 34-41.
[180]. 胡军,曹元大,管春.基于博弈分析的电子商务自动协商系统.计算机工程.2004,30 (3):56-58.
[181]. 吴国荣,沈庆浩.基于移动 Agent 的安全电子拍卖系统的构建.计算机工程.2003, 29 (11):113～115.
[182]. 邬轶昕,吴国荣,沈庆浩.基于移动 Agent 的电子拍卖系统的实现.计算机工程.2003, 29 (10):147～149.
[183]. 张云勇, 张智江, 刘锦德, 刘韵洁. 中间件技术原理与应用. 北京: 清华大学出版社, 2004.
[184]. 范国闯, 钟华, 黄涛, 冯玉琳. Web 应用服务器研究综述. 软件学报. 2003,14(10): 1728-1739.
[185]. P.Ciancarini and R.Tolksdorf and F.Zambonelli. Coordination Middleware for XML-centric Applications. In:Proceedings of the 16th ACM Symposium on Applied Computing (SAC-2001). Gary Lamont, Janice Carroll, Hisham Haddad, Don Morton, George Papadopoulos, Richard Sincovec, and Angelo Yfantis, Eds. Las Vegas, NV: ACM Press.2001.
[186]. 杨德仁,栾静,顾君忠. 中间件技术比较研究. 计算机系统应用. 2005.3: 27-30.
[187]. 郑娅峰,鱼滨. 基于 Web 的异构信息源集成中间件. 计算机应用. 2005,25(1): 81-84.
[188]. 杨思忠,刘锦德,骆志刚. 反射中间件的研究. 小型微型计算机系统. 2002, 23(5): 618-621.
[189]. Paolo Ciancarini, Robert Tolksdorf, Franco Zambonelli. A survey of coordination middleware for XML-centric applications. The Knowledge Engineering Review.2002,17(4):389-405.
[190]. Welf L¨owe ,Markus L. Noga. A Lightweight XML-based Middleware Architecture.In: M. H. Hamza, ed. Applied Informatics, Anaheim. ACTAPress. 2002. 125-130.
[191]. Marek Procházka. Advanced Transactions in Component-Based Software Architectures[Ph.D. dissertation]. Prague: Charles University, 2002.
[192]. 谭文学,赵春江,陆玲.基于启发式规则推理的多媒体农业专家系统开发平台的开发与研究.计算机与现代化,2003,7: 1-7.
[193]. 杨宝祝,赵春江,李爱平. 网络化、构件化农业专家系统开发平台(PAID)的研究与应用. 高技术通讯.2003.3. 5-9.
[194]. 吴华瑞,赵春江,王纪华. 基于规范化软构件技术的农业专家系统开发平台研究. 计算机与农业.2003,1: 15-19.
[195]. Matthew A. Cronin, A model of knowledge activation and insight in problem solving. Complexity.2004,9(5):17-24.
[196]. Haijun Tao,Yanqun Guo,Yadong Wang,Maozu Guo .MIDDLEWARE_BASED EXPERT SYSTEM PLATFORM FOR AGRICULTRUE PRODUCTION DECISIONS .In:Chunjiang Zhao, Xuzhang Xue eds. Proceedings of the 3rd International Symposium On Intelligent Information Technology in Agriculture(ISIITA).Beijing: China Agricultural Science & Technology Press. 2005, 54-58.
[197]. Peng Jia,Wengang Zheng,Jie Yun ,Chunjiang Zhao,Changjun Shen. RESEARCH ON A REMOTE INFORMATION ACQUISITION AND PUBLICATION SYSTEM OF FARM PRODUCE. In:Chunjiang Zhao, Xuzhang Xue eds. Proceedings of the 3rd International Symposium On Intelligent Information Technology in Agriculture(ISIITA).Beijing: China Agricultural Science & Technology Press. 2005, 442-444.
[198]. Zhihong Ma,Wenjiang Huang,Beihong Wang,Anxiang Lu,Jihua Wang,Chunjiang Zhao. THE EFFECTS OF NITROGEN FERTILIZATION AND IRRIGATING QUANTITY ON THE BIOCHEMICAL COMPOSITION AND YIELD IN WINTER WHEAT. In:Chunjiang Zhao, Xuzhang Xue eds. Proceedings of the 3rd International Symposium On Intelligent Information Technology in Agriculture(ISIITA).Beijing: China Agricultural Science & Technology Press. 2005, 562-566.
[199]. Yuansheng Wang,Xiangyang Qin,Chunjiang Zhao,Changqing Gan,Xiaohong Zhou. RESEARCH ON DEVELOPING TRCHNOLOGY OF GEOGRAPHIC INFORMATION SYSTEM FOR OLD TREES. In:Chunjiang Zhao, Xuzhang Xue eds. Proceedings of the 3rd International Symposium On Intelligent Information Technology in Agriculture(ISIITA).Beijing: China Agricultural Science & Technology Press. 2005, 570-576.
[2]. R. Horst , P. M. Pardalos. Handbook of Global Optimization. Kluwer Academic Publishers, 1995.
[3]. K.C.Tsui, J.Liu. Multi-agent diffusion and distributed optimization. In: Proceedings of the second international joint conference on Autonomous agents and multiagent systems. Melbourne, Australia. 2003. 169 - 176
[4]. M. Dorigo, V. Maniezzo, A. Colorni. The ant system: Optimization by a colony of cooperative agents. IEEE Transactions on Systems, Man, and Cybernetics, Part B, 1996, 26(1): 1-13.
[5]. J. Liu, J. Han, Y. Y. Tang. Multi-agent oriented constraint satisfaction. Artificial Intelligence, 2002, 136(1): 101-144.
[6]. K. C. Tsui , J. Liu. An evolutionary multi-agent diffusion approach to optimization. International Journal of Artificial Intelligence and Pattern Recognition, 2002, 16 (6): 715-733.
[7]. I. Foster, C. Kesselman. The Grid: blueprint for a new computing infrastructure. Morgan Kaufmann Publishers, 1999.
[8]. F. Berman, G. Fox, T. Hey. Grid computing: making the global infrastructure a reality. New York, NY, USA :John Wiley & Sons, Inc. 2003.
[9]. H. Casanova, J. Hayes, Y. Yang. Algorithm and software to schedule and deploy independent tasks in grid environments. In: proceedings of the Workshop on Distributed Computing, Meta-computing, and Resource Globalization. (Invited paper). Aussois, France: GRAIL ,2002.
[10]. Y. Yang, H. Casanova. Umr: A multi-round algorithm for scheduling divisible workloads. In: proceeding of the International Parallel and Distributed Processing Symposium. 2003, 246.
[11]. H. Casanova, A. Legrand, D. Zagorodnov, F. Berman. Heuristics for scheduling parameter sweep application in grid environments. In: Proceedings of the Heterogeneous Computing Workshop, HCW. IEEE, USA , 2000, 349-363.
[12]. E.Crawley, R.Nair , B.Rajagopalan, H. Sandick. A framework for QoS-based routing in the Internet. IETF RFC 2386 , Internet Draft, QoS Routing Working Group, Internet Engineering Task Force, expires October 1998.
[13]. Z.Wang, J.Crowcroft. Quality-of-Service Routing for Supporting Multimedia Applications. IEEE Journal on selected areas in Communications, 1996, 14(7): 1228-1234.
[14]. K.S.Teng, M.Maheswaran. Limited Scope Probing: A Distributed Approach for QoS-Based Routing. In: IEEE International Symposium on Network Computing and Applications (NCA'01) Cambridge: Massachusette, 2001, 350-354.
[15]. 王征应,石冰心. 基于启发式遗传算法的 QoS 组播路由问题求解. 计算机学报. 2001, 24(1):56-61.
[16]. M. Moses. Agents in e-commerce. Communications of the ACM, 1999, 42(3): 79-91.
[17]. C.Guilfoyle, J. Jeffcoate, H. Stark. Agents on the Web: Catalyst for E-Commerce. Technical Report, London: Ovum Ltd, 1997.
[18]. M. Girvan and M.E.J. Newman. Community Structure in Social and Biological Networks.Proceedings of the National Academy of Sciences of the United States of America, 2002, 9(12): 7821–7826.
[19]. M.E.J. Newman and M. Girvan. Finding and Evaluating Community Structure in Networks. Physical Review E., 2004, 69(02): 026113-1~026113-15.
[20]. D.M.Wilkinson and B.A. Huberman. A method for finding communities of related genes. In: D. Wilkinson (eds.) Proceedings of the National Academy of Sciences of the United States of America (PNAS). 2004, 101(suppl_1):5241-5248.
[21]. R. Guimera and L.A.N. Amaral. Functional cartography of complex metabolic networks. Nature, 2005, 433(02): 895-900.
[22]. G. Palla, I.Derenyi, I.Farkas and T.Vicsek. Uncovering the overlapping community structures of complex networks in nature and society. Nature, 2005, 435(7043): 814-818.
[23]. Z.Wang and J.Zhang. In search of the biological significance of modular structures in protein networks. PLOS Computational Biology, 2007, 3(6):e107.
[24]. G.W. Flake, S. Lawrence and F.M. Coetzee. Self-Organization and Identification of Web Communities. IEEE Computer, 2002, 35(3): 66–71.
[25]. J.M. Kleinberg. Authoritative Sources in a Hyperlinked Environment. Journal of the ACM, 1999, 46(5):604-632.
[26]. J.Shi and J.Malik. Normalized Cuts and Image Segmentation. IEEE Transaction on Pattern Analysis and Machine Intelligence, 2000, 22(8): 888-905.
[27]. A.Meka and A.K.Singh. Distributed spatial clustering in sensor networks. LNCS, 2006, (3896):980-1000.
[28]. M.Yokoo, K.Hirayama. Algorithms for distributed constraint satisfaction:A review. Autonomous Agents and Multi-Agent Systems, 2000, 3(2):185-207.
[29]. H.D.Meer, A.L.Corte, A.Puliafito. Programmable agents for flexible QoS management in IP networks. IEEE Journal on Selected Areasin Communication. 2000 , 18 (2) : 256-267
[30]. C.S.Leung, J.P.Sum, H.Shen, J.Wu, G..Young. Analysis and design of an agent searching algorithm for e-marketplaces. Cluster Computing. 2004, 7 (1): 85-90.
[31]. M.Yokoo, E.H.Durfee. The distributed constraint satisfaction problem: Formalization and algorithms. IEEE Transactions on Knowledge and Data Engineering, 1998, 10(5).
[32]. M.Yokoo, K.Hirayama. Algorithms for distributed constraint satisfaction:A review. Autonomous Agents and Multi-Agent Systems. 2000, 3(2):185-207.
[33]. Q.Wu, N.S.V. Rao, B.Jacob, I.S.Sitharama, V.K.Vaishnavi. On Computing Mobile Agent Routes for Data Fusion in Distributed Sensor Networks. IEEE Transactions on Knowledge and Data Engineering, 2004, 16(6): 740-753.
[34]. S.D.M¨uller, J.Marchetto, S. Airaghi, P. Koumoustsakos. Optimization based on bacterial chemotaxis. IEEE Transactions on Evolutionary Computation, 2002, 6 (1): 16–29.
[35]. J.Sum, H.Shen, C.S.Leung, G.Young. Analysis on a Mobile Agent-Based Algorithm for Network Routing and Management. IEEE Transaction. Parallel and Distributed Systems, 2003, 14(3): 193-202.
[36]. H. Kuang, L. Bic, M. Dillencourt. Iterative Grid-Based Computing Using Mobile Agents. In:Proceedings of the 2002 International Conference on Parallel Processing, T. Abdelrahman (Ed.). 2002. 109-117.
[37]. J.H. Holland. Adaptation in Nature and Artificial Systems. University of Michigan Press. Reprinted by MIT Press, 1992.
[38]. P. Bak. Autumn book: How Nature Works: The Science of Self-Organized Criticality. Nature, 1996, 383(10): 772
[39]. K.Lerman. A Model of Adaptation in Collaborative Multi-Agent Systems. Adaptive Behavior. 2004, 12(4): 187-197.
[40]. S. Michael, F. Bettina, F. Michael, H. Frank, H. Daniela. Self-Organization in Multi-agent Systems. In: Proceedings of the Third International Workshop on Modeling Artificial Societies and Hybrid Organizations at the 24th German Conference on Artificial Intelligence. Germany. 2002.
[41]. A. Martinoli, E.Bonabeau, M.Dorigo, G.Theraulaz. Swarm intelligence: emergence and self-organization in natural and artificial systems. America:Oxford University Press, 2005.
[42]. J.Kennedy, R.Eberhart. Particle Swarm Optimization. IEEE International Conference on Neural Networks.1995,Vol 4: 1942-1948.
[43]. P. Dmel, A. Lingnau, O. Drobnik. Mobile Agent Interaction in Heterogeneous Environments. In: Proceedings of First International Workshop Mobile Agents '97, Berlin, Germany, 1997, vol. 1219, 136.
[44]. Lipo Wang. On Competitive Learning. IEEE Transactions on Neural Networks.1997, 8(5):1213-1216.
[45]. N.R.Jennings, K.Sycara, M. Wooldridge. A Roadmap of Agent Research and Development. In Autonomous Agents and Multi-Agent Systems, 1998(1): 275-306.
[46]. S. Russell, P.Norvig. Artificial Intelligence: A Modern Approach. Designing Autonomous Agents. Cambridge: MIT Press.1995.
[47]. M.Coen. See http://www.ai.mit.edu/people/sodabot/slideshow/total/p001.html .
[48]. Hayes-Roth. An Architecture for Adaptive Intelligent Systems. AI: Special Issue on Agents and Interactivity, 1995.329-365.
[49]. Wooldridge, M.,N.R. Jennings. Agent Theories, Architectures and languages:a Survey. In Wooldridg and Jennings Eds. Intelligent Agents.Berlin:Springer-Verlag,1995.
[50]. Shoham,Y. Agent-Oriented Programming:An overview and summary of recent research. In Proceedings of Artificial Intelligence, 1992.
[51]. A.S.Rao, M.P.Georgeff. BDI Agents: From Theory to Practice. In Proceedings of the First International Conference on Multi-Agent Systems (ICMAS-95), San Francisco, USA, 1995.
[52]. P.Maes. The Agent Network Architecture(ANA). SIGART Bulletin, 1991,2(4): 115-120.
[53]. D.Gilbert, M.Aparicio et al. IBM Intelligent Agent Strategy. IBM Corporation Tech Rep, 1995.
[54]. 杨博.移动 Agent 技术研究:[博士论文]. 长春:吉林大学. 2003.
[55]. 史忠植等.智能主体及其应用.北京:科学出版社,2000.
[56]. Jiming Liu, 靳小龙,张世武,吴建兵.多智能体模型与实验. 北京:清华大学出版社,2003.
[57]. Y.U.Cao, A.S.Fukunaga and A.B.Kahng. Cooperative mobile robotics: Antecedents and directions. Autonomous Robots. 1997,4(1):7-27.
[58]. E.H.Durfee, V.R.Lesser and D.D.Corkill. Trends in cooperative distributed problem solving. IEEETransactions on Knowledge and Data Engineering. 1989, KOE-11(1):63-83.
[59]. 石纯一等.多 Agent 系统引论.北京: 电子工业出版社.2003.
[60]. P.Pirjanian and M.J.Mataric. Multi-robot target acquisition using multiple objective behavior coordination. In Proceedings of the IEEE International Conference on Robotic Systems. Tsukuba.1989, 486-493.
[61]. T.Fukuda, H.Mizoguchi,K.Sekiyama and F.Arai. Group behavior control for MARS(Micro Autonomous Robotic System). In Proceedings of the IEEE International Conference on Robotics and Automation. Detroit. 1999, 1550-1555.
[62]. Ashby, W. Ross. Principles of the self-organizing dynamic system. Journal of General Psychology. 1947, 37:125-128.
[63]. Ashby, W. R. Design for a Brain. Chapman & Hall, 1966, 2nd edition edition.
[64]. Bak, P.. How Natrue works: The Science of Self-Organized Criticality. Copernicus Books.1996.
[65]. Liu, J.. Autonomous Agents and Multi-Agent Systems:Explorations in Learning, Self-Organization and Adaptive Computation. 2001. World Scientific Publishing.
[66]. Kauffman, S.. Origins of Order:Self-Organization and Selection in Evolution. 1993. Oxford University Press.
[67]. Nicolis,G. and Prigogine,I.. Self-Organization in Non-Equilibrium Systems: From Dissipative Structures to Order through Fluctuations . John Wiley. 1977.
[68]. Prigogine,I.. From Being to Becoming:Time and Complexity in the Physical Sciences. W.H.Freeman and Company. 1980.
[69]. Haken,H.. Advanced Synergetics:Instability Hierarchies of Self-Organizing Systems and Devices. Springer. 1983.
[70]. Haken,H.. Synergetics: An Introduction. Nonequilibrium Phase Transition and Self-Organization in Physics, Chemistry, and Biology. Springer, third revised and enlarged edition. 1983.
[71]. Haken,H.. Information and Self-Organization: A Macroscopic Approach to Complex Systems. Springer. 1988.
[72]. H.J.Jensen. Self-Organized Criticality-Emergent Complex Behavior in Physical and Biological Systems. Cambridge University Press, NY, 1998.
[73]. Hopcroft, J. E. and Ullman, J. D. Introduction to Automata Theory, Languages, and Computation. Reading, MA: Addison Wesley, 1979.
[74]. Wuensche, A. and Lesser, M. The Global Dynamics of Cellular Automata: An Atlas of Basin of Attraction Fields of One-Dimensional Cellular Automata. Reading, MA: Addison-Wesley, 1992.
[75]. Gacs, P. Reliable Cellular Automata with Self-Organization. Journal of Statistical Physics. 2001,vol. 103, 45-267.
[76]. Toffoli, T. and Margolus, N. Cellular Automata Machines: A New Environment for Modeling. Cambridge, MA: MIT Press, 1987.
[77]. Unsal,C.. Self-organization in large populations of mobile robots. [Msater’s thesis]. Department of Electrical Engineering, Virginia Polytechnic Institute and State University.
[78]. E.W.Bonabeau, M.Dorigo and G.Theraulaz. Swarm Intelligence: From Natural to Artificial Systems. New York: Oxford University Press. 1999.
[79]. L. E. Parker. Current state of the art in distributed robot systems. In L.E.Parker, G.Bekey and J.Barhen, editors, Distributed Autonomous Robotics Systems 4. Springer-Verlag, Berlin, 2000, 3-12.
[80]. M.Colombetti and M.Dorigo. Evolutionary computation in behavior engineering. In X.Yao,editor, Evolutionary Computation: Theory and Applications. World Scientific, Singapore, 1998, 37-80.
[81]. M.J.Mataric. Designing emergent behaviors: From local interactions to collective intelligence. In J.A.Meyer, H.L.Roitblat and S.Wilson, editors, From Aninals to Animats 2: Proceedings of the Second International Conference on Simulation of Adaptive Behavior. The MIT Press, Cambridge, MA. 1992, 432-441.
[82]. M.A.Bedau. Philosophical aspects of Artificial Life. In F.J.Varela and P.Bourgine, editors, Towards a Practice of Autonomous Systems: Proceedings of the First European Conference on Artificial Life. The MIT Press/Bradford Books, Cambridge,MA. 1992, 494-503.
[83]. D.Wolpert and K. Tumer. An Introduction to Collective Intelligence. Technical Report NASA-ARC-IC-99-63, NASA Ames Research Center, USA, 1999.
[84]. G.Beni. The concept of cellular robotic systems. In Proceedings of the IEEE International Symposium on Intelligent Control. Arlington, VA. 1998, 57-62.
[85]. G.Beni and J.Wang. Swarm Intelligence. In proceedings of the IEEE of the Seventh Annual Meeting of the Robotics Society of Japan. Tokyo. 1989, 425-428.
[86]. Montanari U. Networks of constraints: Fundamental properties and applications to picture processing. Information Sciences, 1974, 7(2):95?132.
[87]. Kumar V. Algorithms for constraint satisfaction problems: A survey. AI Magazine, 1992,13(1):32?44.
[88]. Sun JG, Jing SY. Solving non-binary constraint satisfaction problem. Chinese Journal of Computers, 2003,26(12):1746?1752.
[89]. Sun JG, Zhang YG. Model generation and constraint programming. In: Lu RQ, ed. The Knowledge Science and Computation Science. Beijing: Tsinghua University Press, 2003.197?232.
[90]. Zhang XZ, Liu CN. Synchronization of the inference engine with the constraint solver in a CLP system. Journal of Software, 1996,7(7):415?421.
[91]. Liu CN. Constraint logic programming-current status and future. In: Lu RQ, ed. The Knowledge Engineering and Knowledge Science Faced to the 21st Century. Beijing: Tsinghua University Press, 2001. 251?279.
[92]. Liu JM, Han J, Tang YY. Multi-Agent oriented constraint satisfaction. Artificial Intelligence, 2002,136(1):101?144.
[93]. Han J, Chen EH, Cai QS. Multi-Level strategy for maintaining arc consistency in problem solving and its implementation. Journal of Software, 1998,9(8):622?627,
[94]. Chen EH, Zhang ZY, Wang XF. A fast recognition algorithm of CRC constraint networks. Journal of Software, 2002,13(5):972?979.
[95]. Yokoo M, Durfee EH, Ishida T, Kuwabara K. The distributed constraint satisfaction problem: Formalization and algorithms. IEEE Transaction on Knowledge Data Engineering, 1998,10(5):673?685.
[96]. Jiming Liu, Han Jing and Y.Y. Tang. Multi-agent oriented constraint satisfaction. ArtificialIntelligence. 2002, 136(1): 101-144.
[97]. Faltings B, Yokoo M. Introduction: Special issue on distributed constraint satisfaction. Artificial Intelligence, 2005,161(1-2):1?5.
[98]. 王秦辉,陈恩红,王熙法. 分布式约束满足问题研究及其进展. 软件学报. 2006, 17(10): 2029-2039.
[99]. Yokoo M, Durfee EH, Ishida T, Kuwabara K. Distributed constraint satisfaction for formalizing distributed problem solving. In: 12th Int’l Conf. on Distributed Computing Systems (ICDCS’92). Los Alamitos: IEEE Computer Society Press, 1992. 614?621.
[100]. Calisti M, Neagu N. Constraint satisfaction techniques and software agents. In: Proc. of the AIIA 2004 Workshop on Agents and Constraints. Perugia, 2004.
[101]. Faltings B, Macho-Gonzalez S. Open constraint programming. Artificial Intelligence, 2005,161(1-2):181?208.
[102]. Pragnesh Jay Modi, Wei-Min Shen, Milind Tambe, and Makoto Yokoo. ADOPT: Asynchronous distributed constraint optimization with quality guarantees. Artificial Intelligence, 2005, 16(1-2):149-180.
[103]. MD Waltz, KS Fu. A heuristic approach to reinforcement learning control systems. IEEE Transactions on Automatic Control. 1965, 10(4): 390- 398.
[104]. R.S. Sutton. Reinforcement Learning Architecture for Animats. In: J.-A. Meyer and S.W. Wilson, editors, From Animals to Animats1: Proceedings of First International Conference on The Simulation of Adaptive Behavior. Cambridge, MA: The MIT Press/ Bradford Books. 1991,105-124.
[105]. L.P.Kaelbling. An adaptable mobile robot. In: F.J. Varela and P.Bourgine, editors, Toward a Practice of Autonomous Systems: Proceedings of the 1994 IEEE/RSJ International Conference on Intelligent Robots and Systems. Munchen. 1994, 15-22.
[106]. Maja Mataric and Dave Cliff. Challenges in evolving controllers for physical robots. Robotics and Autonomous Systems. 1996, 19(1).
[107]. S.Russell and P.Norvig. A Modern Approach. Artificial Intelligence. Prentice Hall, Englewood, NJ. 1995.
[108]. A.G.Barto and R.S.Sutton. Learning and sequential decision making. In: M.Gabril and J.Moore, editors, Learning and Computational Neurosciene: Foundations of Adaptive Networks. Cambridge,MA: The MIT Press. 1991, 89-95.
[109]. R.S.Sutton. Integrated architecture for learning, planning and reacting based on approximating dynamic programming. In: Proceedings of the International Conference in Machine Learning. Cambridge,MA: The MIT Press/Bradford Books. 1990, 105-124.
[110]. Crites R. H. and A. G. Barto. Improving Elevator Performance Using Reinforcement Learning. In: D. S. Touretzky, M. C. Mozer and M. E. Hasselmo , editors, Advances in Neural Information Processing Systems. 1996, 1017-1023.
[111]. Donald A. Berry, Bert Fristedt. Bandit Problems: Sequential Allocation of Experiments. Monographs on Statistics and Applied Probability.1985.
[112]. C. Gittins. Multi-armed Bandit Allocation Indices. Wiley-Interscience New York. Mathematical Reviews: MR90e:62113, 1989.
[113]. R.S.Sutton. Learning to predict by the method of temporal differences. Machine Learning. 1988, 3(8): 9-44.
[114]. Watkins. Learn from delayed rewards:[ PhD thesis]. Cambridge: cambridge university. 1989.
[115]. P.R.Kumar and Pravin Varaiya. Stochastic system:estimation,identification and adaptive control. NJ,USA: Prentice-Hall, Inc.. 1986.
[116]. A.W. Moore, C.G. Atkeson. Prioritized Sweeping: Reinforcement Learning with less data and less time. Machine Learning. 1993, 13(10): 103-130.
[117]. Anton Chechetka, Katia Sycara. A decentralized variable ordering method for distributed constraint optimization. In: Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems, 2005. 1307-1322.
[118]. S Ali, S Koenig, M Tambe. Preprocessing techniques for accelerating the DCOP algorithm ADOPT . In: Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems (AAMAS’05). Utrecht, Netherlands, 2005. 1041-1048.
[119]. E.Bowring, M.Tambe, M.Yokoo. Multiply-Constrained Distributed Constraint Optimization . In: Fifth InternationalJoint Conference on Autonomous Agents and Multi-Agent Systems (AAMAS-06), 2006, 1413-1420.
[120]. W. Yeoh, S. Koenig, A. Felner. IDB-ADOPT: A Depth-First Search DCOP Algorithm. In: Proceedings of the International Workshop on Distributed Constraint Reasoning (DCR) 2007. 60-70.
[121]. Bo Yang, Jiming Liu. An Autonomy Oriented Computing (AOC) Approach to Distributed Network Community Mining. In: the Proceeding of the First International Conference on Self-Adaptive and Self-Organizing Systems (SASO 2007). MIT, Boston, Mass., USA, July 9-11, 2007. 151-160.
[122]. D.J. Watts and S.H. Strogatz. Collective Dynamics of Small-World Networks. Nature, 1998, 393(6648): 440-442.
[123]. S.H. Strogatz. Exploring Complex Networks. Nature, 2001, 410(08): 268-276.
[124]. W.W. Zachary. An Information Flow Model for Conflict and Fission in Small Groups. Journal of Anthropological Research, 1977, 33(4): 452–473.
[125]. H.Ebel, L.I.Mielsch and S.Bornholdt. Scale-free topology of e-mail networks. Physical Review E, 2002, 66(09): 035103-1～035103-4.
[126]. J. Scott. Social Network Analysis: A Handbook. London: Sage Publications Inc. , 2000.
[127]. R.J. Williams and N.D. Martinez. Simple Rules Yield Complex Food Webs. Nature, 2000, 404(6774): 180-183.
[128]. H. Jeong, B.Tombor, R. Albert, Z.N.Oltvai, and A.L.Barabasi. The Large-Scale Organization of Metabolic Networks. Nature, 2000, 40 7(6804): 651–654.
[129]. D. Lusseau. The Emergent Properties of a Dolphin Social Network. In: Proc. Biol. Sci., 2003, 270(Suppl 2):S186- S188.
[130]. S.Milgram. The small world problem. Psychology Today, 1967, 1(1): 60-67.
[131]. A.L. Barabasi and R. Albert. Emergence of Scaling in Random Networks. Science, 1999, 286(5439):509-512.
[132]. R.Albert, A.L.Barabasi and H.Jeong. The Internet's Achilles heel: Error and attack tolerance ofcomplex networks. Nature, 2000, 406(2115): 378-382.
[133]. A.-L. Barabási, R. Albert, H. Jeong and G. Bianconi. Power-law distribution of the World Wide Web. Science, 2000, 287(5461): 2115a.
[134]. M.E.J. Newman, S.H. Strogatz and D.J. Watts. Random Graphs with Arbitrary Degree Distributions and Their Applications. Physical Review E. 2001, 64(02): 026118-1～026118-17.
[135]. M. Girvan and M.E.J. Newman. Community Structure in Social and Biological Networks. Proceedings of the National Academy of Sciences of the United States of America, 2002, 9(12): 7821–7826.
[136]. M.E.J. Newman and M. Girvan. Finding and Evaluating Community Structure in Networks. Physical Review E., 2004, 69(02): 026113 -1~026113-15.
[137]. R.Milo, S.Shen-Orr, S.Itzkovitz, N.Kashtan, D.Chklovskii and U.Alon. Network Motifs: simple building blocks of complex networks. Science, 2002, 298(5594):824-827.
[138]. E. Ravasz, A. L. Somera, D. A. Mongru, Z. N. Oltvai and A.L. Barabási. Hierarchical organization of modularity in metabolic networks. Science, 2002, 297(5586):1551-1555.
[139]. D.M.Wilkinson and B.A. Huberman. A method for finding communities of related genes. In: D. Wilkinson (eds.) Proceedings of the National Academy of Sciences of the United States of America (PNAS). 2004, 101(suppl_1):5241-5248.
[140]. R. Guimera and L.A.N. Amaral. Functional cartography of complex metabolic networks. Nature, 2005, 433(02): 895-900.
[141]. G. Palla, I.Derenyi, I.Farkas and T.Vicsek. Uncovering the overlapping community structures of complex networks in nature and society. Nat ure, 2005, 435(7043): 814-818.
[142]. Z.Wang and J.Zhang. In search of the biological significance of modular structures in protein networks. PLOS Computational Biology, 2007, 3(6):e107.
[143]. G.W. Flake, S. Lawrence and F.M. Coetzee. Self-Organization and Identification of Web Communities. IEEE Computer, 2002, 35(3): 66–71.
[144]. J.M. Kleinberg. Authoritative Sources in a Hyperlinked Environment. Journal of the ACM, 1999, 46(5):604-632.
[145]. J.Shi and J.Malik. Normalized Cuts and Image Segmentation. IEEE Transaction on Pattern Analysis and Machine Intelligence, 2000, 22(8): 888-905.
[146]. A.Meka and A.K.Singh. Distributed spatial clustering in sensor networks. LNCS, 2006, (3896):980-1000.
[147]. M.R. Garey and D.S.Johnson. Computers and intractability: a guide to the theory of NP-completeness. San Francisco: W. H. Freeman & Co. New York, NY, USA, 1979.
[148]. A. Pothen, H. Simon and K.P. Liou. Partitioning Sparse Matrices with Eigenvectors of Graphs. SIAM J. of Matrix Analysis and Application, 1990, 11: 430-452.
[149]. M. Fiedler. A Property of Eigenvectors of Nonnegative Symmetric Matrices and Its Application to Graph Theory. Czechoslovak Mathematical Journal. 1975, 25(100): 619-633.
[150]. J.R. Tyler, D.M. Wilkinson and B.A. Huberman. Email as Spectroscopy: Automated Discovery of Community Structure within Organizations. In: Huysman M, Wenger E,Wulf V. (eds.), Proceedings of the First International Conference on Communities and Technologies. Kluwer,Dordrecht, 2003, 81-96.
[151]. F.Radicchi, C.Castellano, F.Cecconi, V.Loreto and D.Parisi. Defining and Identifying Communities in Networks. In: Proceedings of the National Academy of Sciences of the United States of America (PNAS). 2004,101(9): 2658-2663.
[152]. B.W. Kernighan and S. Lin. An Efficient Heuristic Procedure for Partitioning Graphs. Bell System Technical Journal, 1970, 49(2): 291-307.
[153]. M.E.J. Newman. Fast Algorithm for Detecting Community Structure in Networks. Physical Rev. E. 2004, 69(06): 066133.
[154]. B.Yang, W.K. Cheung and J.Liu. Community Mining from signed Social Networks. IEEE Transactions on Knowledge and Data Engineering (TKDE). 2007, 19(10):1333-1348.
[155]. B.Yang and J.Liu. An Efficient Probabilistic Approach to Network Community Mining. In: the Proceeding of 2007 Joint Rough Set ymposium (JRS’07). Toronto, Canada: LNAI, 2007. 4481: 267-275.
[156]. P. Pons and M. Latapy. Computing communities in large networks using random walks. arxiv:physics/0512106, 2005.
[157]. J. Liu, X.L. Jin and K.C. Tsui. Autonomy Oriented Computing. Springer/Kluwer Academic Publishers, 2004.
[158]. J. Liu, X.L.Jin and K.C. Tsui. Autonomy Oriented Computing (AOC): Formulating computational systems with autonomous components. IEEE Transaction on Systems, Man, and Cybernetics, Part A: Systems and Humans. 2005,35(6):879- 902.
[159]. B.Yang and J. Liu. An Autonomy Oriented Computing (AOC) Approach to Distributed Network Community Mining. In: the First International Conference on Self-Adaptive and Self-Organizing Systems (SASO 2007). MIT, Boston, Mass., USA, 2007. 151-160.
[160]. 杨博, 刘大有, 杨鲲, 张朝辉. 移动 Agent 系统的主动通信机制. 软件学报, 2003, 14(7):1338-1344.
[161]. Yang Gao, Chen S F, Research on Reinforcement Learning Technology: A Review. ACTA AUTOMATICE SINICA. 2004, 30(1): 89-100.
[162]. Guo Maozu, Wang Yadong, Sun Huamei and Liu Yang. Research on Q-learning Algorithm Based on Metropolis Criterion. Journal of Computer Research and Development. 2002, 39(6): 684-688.
[163]. Sutton R S, Precup D, Singh S. Between MDPs and semi-MDPs: a framework for temporal abstraction in reinforcement learning. Artificial Intelligence, 1999, 112(1/2): 181-211.
[164]. Guo Maozu, Chen Bin, Wang Xiaolong et al. A summary on reinforcement learning. Computer Science, 1998,25(3): 13-15.
[165]. Kaelbling L P, Littman M L, Moore A W. Reinforcement learning: A survey. Journal of Artificial Intelligence Research, 1996,4(2): 237-285.
[166]. Li Ning, Gao Yang, Lu Xin, Chen Shi-Fu. A learning agent based on reinforcement learning. Computer Research and Development. 2001, 38(9):1051-1056.
[167]. Watkins P.Dayan. Q-learning. Machine Learning. 1992,8(3): 279-292.
[168]. Tsitsiklis, John N. Asynchronous stochastic approximation and Q-learning. Machine Learning.1994,16(3): 185-202.
[169]. Cai Qingsheng, Zhang Bo. An Agent Team Based Reinforcement Learning Model AND Its Application. Journal of Computer Research and Development. 2000, 37(9): 1087-1093.
[170]. Park Kui-Hong, Kim Yong-Jae, Kim Jong-Hwan. Modular Q-learning based multi-agent cooperation for robot soccer. Robotics and Autonomous Systems.2001, 35(2): 109-122.
[171]. D Martin, A Cheyer, D Moran. The open agent architecture: a framework for building distributed software systems. Applied Artificial Intelligence, 1999,13(1):91～128.
[172]. P Dasgupta, N Narasimhan, L Moser, P M Smith. MAGNET: Mobile Agents for Networked Electronic Trading. IEEE Transactions on Knowledge and Data Engineering, 1999, 24(6): 509-525.
[173]. D. B. Lange, M. Oshima. Seven good reasons for mobile agents. Communications of the ACM, 1999,42(3): 88-89.
[174]. S Y Su, C Huang, J Hammer. A replicable web-based negotiation server for e-commerce. In: Proceedings of the 33rd Hawaii International Conference on System Sciences(HICSS-33). Maui: IEEE Computer Society, 2000. 219～228.
[175]. K Y Lee, J S Yun, G S Jo. MoCAAS: Auction agent system using a collaborative mobile agent in electronic commerce. Expert Systems with Applications, 2003, 24 (2): 183-187.
[176]. P P Y Lam, L Ye, H C B Chan. Business-to-consumer and business-to-business Mobile Agent-based Internet Commerce System (MAGICS). In: Conference Proceedings -2004 IEEE International Conference on Systems, Man and Cybernetics, SMC. Hague,Netherlands: IEEE Press, 2004.4106-4111.
[177]. D L Zhang, C Lin. Security model of mobile agent in e-commerce. Tongji Daxue Xuebao/Journal of Tongji University, 2005, 33 (12): 1680-1684.
[178]. D H Shih, S Y Huang, D C Yen. A new reverse auction agent system for m-commerce using mobile agents. Computer Standards and Interfaces, 2005, 27 (4): 383-395.
[179]. P P Y Lam, H C B Chan. A Markov-decision-based price comparison problem for mobile agent-based internet commerce system (MAGICS). In: Proceedings of IEEE International Conference on E-Commerce Technology for Dynamic E-Business (CEC-East'04). Shanghai, China: China Science and Technology Press, 2004. 34-41.
[180]. 胡军,曹元大,管春.基于博弈分析的电子商务自动协商系统.计算机工程.2004,30 (3):56-58.
[181]. 吴国荣,沈庆浩.基于移动 Agent 的安全电子拍卖系统的构建.计算机工程.2003, 29 (11):113～115.
[182]. 邬轶昕,吴国荣,沈庆浩.基于移动 Agent 的电子拍卖系统的实现.计算机工程.2003, 29 (10):147～149.
[183]. 张云勇, 张智江, 刘锦德, 刘韵洁. 中间件技术原理与应用. 北京: 清华大学出版社, 2004.
[184]. 范国闯, 钟华, 黄涛, 冯玉琳. Web 应用服务器研究综述. 软件学报. 2003,14(10): 1728-1739.
[185]. P.Ciancarini and R.Tolksdorf and F.Zambonelli. Coordination Middleware for XML-centric Applications. In:Proceedings of the 16th ACM Symposium on Applied Computing (SAC-2001). Gary Lamont, Janice Carroll, Hisham Haddad, Don Morton, George Papadopoulos, Richard Sincovec, and Angelo Yfantis, Eds. Las Vegas, NV: ACM Press.2001.
[186]. 杨德仁,栾静,顾君忠. 中间件技术比较研究. 计算机系统应用. 2005.3: 27-30.
[187]. 郑娅峰,鱼滨. 基于 Web 的异构信息源集成中间件. 计算机应用. 2005,25(1): 81-84.
[188]. 杨思忠,刘锦德,骆志刚. 反射中间件的研究. 小型微型计算机系统. 2002, 23(5): 618-621.
[189]. Paolo Ciancarini, Robert Tolksdorf, Franco Zambonelli. A survey of coordination middleware for XML-centric applications. The Knowledge Engineering Review.2002,17(4):389-405.
[190]. Welf L¨owe ,Markus L. Noga. A Lightweight XML-based Middleware Architecture.In: M. H. Hamza, ed. Applied Informatics, Anaheim. ACTAPress. 2002. 125-130.
[191]. Marek Procházka. Advanced Transactions in Component-Based Software Architectures[Ph.D. dissertation]. Prague: Charles University, 2002.
[192]. 谭文学,赵春江,陆玲.基于启发式规则推理的多媒体农业专家系统开发平台的开发与研究.计算机与现代化,2003,7: 1-7.
[193]. 杨宝祝,赵春江,李爱平. 网络化、构件化农业专家系统开发平台(PAID)的研究与应用. 高技术通讯.2003.3. 5-9.
[194]. 吴华瑞,赵春江,王纪华. 基于规范化软构件技术的农业专家系统开发平台研究. 计算机与农业.2003,1: 15-19.
[195]. Matthew A. Cronin, A model of knowledge activation and insight in problem solving. Complexity.2004,9(5):17-24.
[196]. Haijun Tao,Yanqun Guo,Yadong Wang,Maozu Guo .MIDDLEWARE_BASED EXPERT SYSTEM PLATFORM FOR AGRICULTRUE PRODUCTION DECISIONS .In:Chunjiang Zhao, Xuzhang Xue eds. Proceedings of the 3rd International Symposium On Intelligent Information Technology in Agriculture(ISIITA).Beijing: China Agricultural Science & Technology Press. 2005, 54-58.
[197]. Peng Jia,Wengang Zheng,Jie Yun ,Chunjiang Zhao,Changjun Shen. RESEARCH ON A REMOTE INFORMATION ACQUISITION AND PUBLICATION SYSTEM OF FARM PRODUCE. In:Chunjiang Zhao, Xuzhang Xue eds. Proceedings of the 3rd International Symposium On Intelligent Information Technology in Agriculture(ISIITA).Beijing: China Agricultural Science & Technology Press. 2005, 442-444.
[198]. Zhihong Ma,Wenjiang Huang,Beihong Wang,Anxiang Lu,Jihua Wang,Chunjiang Zhao. THE EFFECTS OF NITROGEN FERTILIZATION AND IRRIGATING QUANTITY ON THE BIOCHEMICAL COMPOSITION AND YIELD IN WINTER WHEAT. In:Chunjiang Zhao, Xuzhang Xue eds. Proceedings of the 3rd International Symposium On Intelligent Information Technology in Agriculture(ISIITA).Beijing: China Agricultural Science & Technology Press. 2005, 562-566.
[199]. Yuansheng Wang,Xiangyang Qin,Chunjiang Zhao,Changqing Gan,Xiaohong Zhou. RESEARCH ON DEVELOPING TRCHNOLOGY OF GEOGRAPHIC INFORMATION SYSTEM FOR OLD TREES. In:Chunjiang Zhao, Xuzhang Xue eds. Proceedings of the 3rd International Symposium On Intelligent Information Technology in Agriculture(ISIITA).Beijing: China Agricultural Science & Technology Press. 2005, 570-576.