In this paper, we employ genetic algorithms to solve the migration problem (MP). We propose a new encoding scheme to represent trees, which is composed of two parts: the pre-ordered traversal sequence of tree vertices...In this paper, we employ genetic algorithms to solve the migration problem (MP). We propose a new encoding scheme to represent trees, which is composed of two parts: the pre-ordered traversal sequence of tree vertices and the children number sequence of corresponding tree vertices. The proposed encoding scheme has the advantages of simplicity for encoding and decoding, ease for GA operations, and better equilibrium between exploration and exploitation. It is also adaptive in that, with few restrictions on the length of code, it can be freely lengthened or shortened according to the characteristics of the problem space. Furthermore, the encoding scheme is highly applicable to the degree-constrained minimum spanning tree problem because it also contains the degree information of each node. The simulation results demonstrate the higher performance of our algorithm, with fast convergence to the optima or sub-optima on various problem sizes. Comparing with the binary string encoding of vertices, when the problem size is large, our algorithm runs remarkably faster with comparable search capability. Key words distributed information retrieval - mobile agents - migration problem - genetic algorithms CLC number TP 301. 6 Foundation item: Supported by the National Natural Science Foundation of China (90104005), the Natural Science Foundation of Hubei Province and the Hong Kong Polytechnic University under the grant G-YD63Biography: He Yan-xiang (1952-), male, Professor, research direction: distributed and parallel processing, multi-agent systems, data mining and e-business.展开更多
The control problem of a class of parabolic distributed parameter systems (DPSs) is investigated by using mobile agents with capabilities of sensing and actuating. The guidance strategies of mobile agents based on cov...The control problem of a class of parabolic distributed parameter systems (DPSs) is investigated by using mobile agents with capabilities of sensing and actuating. The guidance strategies of mobile agents based on coverage optimization methods are proposed to improve the control performance of the system and make the state norm of the system converge to zero faster. The coverage optimization problems are constructed based on the measurement of each agent. By solving the coverage optimization problems, the local optimal moving direction of each agent can be obtained. Then the gradient-based agent motion control laws are established. With the indicator function and the surface delta function, this method is generalized to n-dimensional space, and suitable for any sensing region with piecewise smooth boundaries. The stability and control performance of the system are analyzed. Numerical simulations show the effectiveness of the proposed methods.展开更多
The aim of this paper is to present a distributed algorithm for big data classification, and its application for Magnetic Resonance Images (MRI) segmentation. We choose the well-known classification method which is th...The aim of this paper is to present a distributed algorithm for big data classification, and its application for Magnetic Resonance Images (MRI) segmentation. We choose the well-known classification method which is the c-means method. The proposed method is introduced in order to perform a cognitive program which is assigned to be implemented on a parallel and distributed machine based on mobile agents. The main idea of the proposed algorithm is to execute the c-means classification procedure by the Mobile Classification Agents (Team Workers) on different nodes on their data at the same time and provide the results to their Mobile Host Agent (Team Leader) which computes the global results and orchestrates the classification until the convergence condition is achieved and the output segmented images will be provided from the Mobile Classification Agents. The data in our case are the big data MRI image of size (m × n) which is splitted into (m × n) elementary images one per mobile classification agent to perform the classification procedure. The experimental results show that the use of the distributed architecture improves significantly the big data segmentation efficiency.展开更多
Deep Learning presents a critical capability to be geared into environments being constantly changed and ongoing learning dynamic,which is especially relevant in Network Intrusion Detection.In this paper,as enlightene...Deep Learning presents a critical capability to be geared into environments being constantly changed and ongoing learning dynamic,which is especially relevant in Network Intrusion Detection.In this paper,as enlightened by the theory of Deep Learning Neural Networks,Hierarchy Distributed-Agents Model for Network Risk Evaluation,a newly developed model,is proposed.The architecture taken on by the distributed-agents model are given,as well as the approach of analyzing network intrusion detection using Deep Learning,the mechanism of sharing hyper-parameters to improve the efficiency of learning is presented,and the hierarchical evaluative framework for Network Risk Evaluation of the proposed model is built.Furthermore,to examine the proposed model,a series of experiments were conducted in terms of NSLKDD datasets.The proposed model was able to differentiate between normal and abnormal network activities with an accuracy of 97.60%on NSL-KDD datasets.As the results acquired from the experiment indicate,the model developed in this paper is characterized by high-speed and high-accuracy processing which shall offer a preferable solution with regard to the Risk Evaluation in Network.展开更多
Mobile agents is becoming a prosperous research field due to recent prevalence of Internet andJava. Although it brings great challenges to traditional distributed processing technologies, its attractive advantages sti...Mobile agents is becoming a prosperous research field due to recent prevalence of Internet andJava. Although it brings great challenges to traditional distributed processing technologies, its attractive advantages stimulate us to further the work on it with great ardor. This paper presents the basic concepts aboutthe Inchoate technique and describes current research status on it. Major obstacles and their possible solutions are discussed.展开更多
Techniques for mining information from distributed data sources accessible over the Internet are a growing area of research.The mobile Agent paradigm opens a new door for distributed data mining and knowledge discover...Techniques for mining information from distributed data sources accessible over the Internet are a growing area of research.The mobile Agent paradigm opens a new door for distributed data mining and knowledge discovery applications.In this paper we present the design of a mobile agent system which couples service discovery,using a logical language based application programming interface,and database access.Combining mobility with database access provides a means to create more efficient data mining applications.The processing of data is moved to network wide data locations instead of the traditional approach of bringing huge amount of data to the processing location.Our proposal aims at implementing system tools that will enable intelligent mobile Agents to roam the Internet searching for distributed data services.Agents access the data,discover patterns,extract useful information from facts recorded in the databases,then communicate local results back to the user.The user then generates a global data model through the aggregation of results provided by all Agents.This overcomes barriers posed by network congestion,poor security,and unreliability.展开更多
Mobile agents provide a new method for the distributed computation. This paper presents the advantages of using mobile agents in a distributed virtual environment (DVE) system, and describes the architecture of hetero...Mobile agents provide a new method for the distributed computation. This paper presents the advantages of using mobile agents in a distributed virtual environment (DVE) system, and describes the architecture of heterogeneous computer's distributed virtual environment system (HCWES) designed to populate some mobile agents as well as stationary agents. Finally, the paper introduces how heterogeneous computer network communication is to be realized.展开更多
The diversity of GISs and the wide spread availability of WWW have led to an increasing amount of research on integrating a variety of heterogeneous and autonomous GISs in a cooperative environment to construct a new...The diversity of GISs and the wide spread availability of WWW have led to an increasing amount of research on integrating a variety of heterogeneous and autonomous GISs in a cooperative environment to construct a new generation of GIS characterizing in open architecture, distributed computation, interoperability, and extensibility. Our on going research project MADGIS (Mobile Agent based Distributed Geographic Information System) is reported, in which we propose the architecture of MADGIS to meet the requirements of integrating distributed GIS applications under Internet environment. We first describe the architecture of MADGIS, and detailed discussions focusing on the structure of client site, server site and mobile agent in MADGIS. Then we explore key techniques for MADGIS implementation.展开更多
This paper considers the formation control problem of multi-agent systems in a distributed fashion. Two cases of the information propagating topologies among multiple agents, characterized by graphics model, are consi...This paper considers the formation control problem of multi-agent systems in a distributed fashion. Two cases of the information propagating topologies among multiple agents, characterized by graphics model, are considered. One is fixed topology. The other is switching topology which represents the limited and less reliable information exchange. The local formation control strategies established in this paper are based on a simple modification of the existing consensus control strategies. Moreover, some existing convergence conditions are shown to be a special case of our model even in the continuous-time consensus case. Therefore, the results of this paper extend the existing results about the consensus problem.展开更多
When traditional Intrusion Detection System(IDS) is used to detect and analyze the great flow data transfer in high-speed network,it usually causes the computation bottleneck. This paper presents a new Mobile Agent Di...When traditional Intrusion Detection System(IDS) is used to detect and analyze the great flow data transfer in high-speed network,it usually causes the computation bottleneck. This paper presents a new Mobile Agent Distributed IDS(MADIDS) system based on the mobile agents. This system is specifically designed to process the great flow data transfer in high-speed network. In MADIDS,the agents that are set at each node process the data transfer by distributed computation architecture. Meanwhile by using the reconfiguration quality of the mobile agents ,the load balance of distributed computation can be dynamically implemented to gain the high-performance computing ability. This ability makes the detecting and analyzing of high-speed network possible. MADIDS can effectively solve the detection and analysis performance bottleneck caused by the great flow data transfer in high-speed network. It enhances the performance of IDS in high-speed network. In this paper,we construct the infrastructure and theoretical model of MADIDS,and the deficiencies of MADIDS and future research work are also indicated.展开更多
文摘In this paper, we employ genetic algorithms to solve the migration problem (MP). We propose a new encoding scheme to represent trees, which is composed of two parts: the pre-ordered traversal sequence of tree vertices and the children number sequence of corresponding tree vertices. The proposed encoding scheme has the advantages of simplicity for encoding and decoding, ease for GA operations, and better equilibrium between exploration and exploitation. It is also adaptive in that, with few restrictions on the length of code, it can be freely lengthened or shortened according to the characteristics of the problem space. Furthermore, the encoding scheme is highly applicable to the degree-constrained minimum spanning tree problem because it also contains the degree information of each node. The simulation results demonstrate the higher performance of our algorithm, with fast convergence to the optima or sub-optima on various problem sizes. Comparing with the binary string encoding of vertices, when the problem size is large, our algorithm runs remarkably faster with comparable search capability. Key words distributed information retrieval - mobile agents - migration problem - genetic algorithms CLC number TP 301. 6 Foundation item: Supported by the National Natural Science Foundation of China (90104005), the Natural Science Foundation of Hubei Province and the Hong Kong Polytechnic University under the grant G-YD63Biography: He Yan-xiang (1952-), male, Professor, research direction: distributed and parallel processing, multi-agent systems, data mining and e-business.
基金supported by the National Natural Science Foundation of China(61807016 61174021)+3 种基金the Fundamental Research Funds for the Central Universities(JUSRP115A28 JUSRP51733B)the 111 Projeet(B12018)the Postgraduate Innovation Project of Jiangsu Province(KYLX151170)
文摘The control problem of a class of parabolic distributed parameter systems (DPSs) is investigated by using mobile agents with capabilities of sensing and actuating. The guidance strategies of mobile agents based on coverage optimization methods are proposed to improve the control performance of the system and make the state norm of the system converge to zero faster. The coverage optimization problems are constructed based on the measurement of each agent. By solving the coverage optimization problems, the local optimal moving direction of each agent can be obtained. Then the gradient-based agent motion control laws are established. With the indicator function and the surface delta function, this method is generalized to n-dimensional space, and suitable for any sensing region with piecewise smooth boundaries. The stability and control performance of the system are analyzed. Numerical simulations show the effectiveness of the proposed methods.
文摘The aim of this paper is to present a distributed algorithm for big data classification, and its application for Magnetic Resonance Images (MRI) segmentation. We choose the well-known classification method which is the c-means method. The proposed method is introduced in order to perform a cognitive program which is assigned to be implemented on a parallel and distributed machine based on mobile agents. The main idea of the proposed algorithm is to execute the c-means classification procedure by the Mobile Classification Agents (Team Workers) on different nodes on their data at the same time and provide the results to their Mobile Host Agent (Team Leader) which computes the global results and orchestrates the classification until the convergence condition is achieved and the output segmented images will be provided from the Mobile Classification Agents. The data in our case are the big data MRI image of size (m × n) which is splitted into (m × n) elementary images one per mobile classification agent to perform the classification procedure. The experimental results show that the use of the distributed architecture improves significantly the big data segmentation efficiency.
基金This work is supported by the National Key Research and Development Program of China under Grant 2016YFB0800600the Natural Science Foundation of China under Grant(No.61872254 and No.U1736212)+2 种基金the Fundamental Research Funds for the central Universities(No.YJ201727,No.A0920502051815-98)Academic and Technical Leaders’Training Support Fund of Sichuan Province(2016)the research projects of the Humanity and Social Science Youth Foundation of Ministry of Education(13YJCZH021).We want to convey our grateful appreciation to the corresponding author of this paper,Gang Liang,who has offered advice with huge values in all stages when writing this essay to us.
文摘Deep Learning presents a critical capability to be geared into environments being constantly changed and ongoing learning dynamic,which is especially relevant in Network Intrusion Detection.In this paper,as enlightened by the theory of Deep Learning Neural Networks,Hierarchy Distributed-Agents Model for Network Risk Evaluation,a newly developed model,is proposed.The architecture taken on by the distributed-agents model are given,as well as the approach of analyzing network intrusion detection using Deep Learning,the mechanism of sharing hyper-parameters to improve the efficiency of learning is presented,and the hierarchical evaluative framework for Network Risk Evaluation of the proposed model is built.Furthermore,to examine the proposed model,a series of experiments were conducted in terms of NSLKDD datasets.The proposed model was able to differentiate between normal and abnormal network activities with an accuracy of 97.60%on NSL-KDD datasets.As the results acquired from the experiment indicate,the model developed in this paper is characterized by high-speed and high-accuracy processing which shall offer a preferable solution with regard to the Risk Evaluation in Network.
文摘Mobile agents is becoming a prosperous research field due to recent prevalence of Internet andJava. Although it brings great challenges to traditional distributed processing technologies, its attractive advantages stimulate us to further the work on it with great ardor. This paper presents the basic concepts aboutthe Inchoate technique and describes current research status on it. Major obstacles and their possible solutions are discussed.
文摘Techniques for mining information from distributed data sources accessible over the Internet are a growing area of research.The mobile Agent paradigm opens a new door for distributed data mining and knowledge discovery applications.In this paper we present the design of a mobile agent system which couples service discovery,using a logical language based application programming interface,and database access.Combining mobility with database access provides a means to create more efficient data mining applications.The processing of data is moved to network wide data locations instead of the traditional approach of bringing huge amount of data to the processing location.Our proposal aims at implementing system tools that will enable intelligent mobile Agents to roam the Internet searching for distributed data services.Agents access the data,discover patterns,extract useful information from facts recorded in the databases,then communicate local results back to the user.The user then generates a global data model through the aggregation of results provided by all Agents.This overcomes barriers posed by network congestion,poor security,and unreliability.
文摘Mobile agents provide a new method for the distributed computation. This paper presents the advantages of using mobile agents in a distributed virtual environment (DVE) system, and describes the architecture of heterogeneous computer's distributed virtual environment system (HCWES) designed to populate some mobile agents as well as stationary agents. Finally, the paper introduces how heterogeneous computer network communication is to be realized.
基金Supported by the Open Researches Fund Program of L IESMARS(WKL(0 0 ) 0 30 2 )
文摘The diversity of GISs and the wide spread availability of WWW have led to an increasing amount of research on integrating a variety of heterogeneous and autonomous GISs in a cooperative environment to construct a new generation of GIS characterizing in open architecture, distributed computation, interoperability, and extensibility. Our on going research project MADGIS (Mobile Agent based Distributed Geographic Information System) is reported, in which we propose the architecture of MADGIS to meet the requirements of integrating distributed GIS applications under Internet environment. We first describe the architecture of MADGIS, and detailed discussions focusing on the structure of client site, server site and mobile agent in MADGIS. Then we explore key techniques for MADGIS implementation.
基金the National Natural Science Foundation of China (No.60674071).
文摘This paper considers the formation control problem of multi-agent systems in a distributed fashion. Two cases of the information propagating topologies among multiple agents, characterized by graphics model, are considered. One is fixed topology. The other is switching topology which represents the limited and less reliable information exchange. The local formation control strategies established in this paper are based on a simple modification of the existing consensus control strategies. Moreover, some existing convergence conditions are shown to be a special case of our model even in the continuous-time consensus case. Therefore, the results of this paper extend the existing results about the consensus problem.
文摘When traditional Intrusion Detection System(IDS) is used to detect and analyze the great flow data transfer in high-speed network,it usually causes the computation bottleneck. This paper presents a new Mobile Agent Distributed IDS(MADIDS) system based on the mobile agents. This system is specifically designed to process the great flow data transfer in high-speed network. In MADIDS,the agents that are set at each node process the data transfer by distributed computation architecture. Meanwhile by using the reconfiguration quality of the mobile agents ,the load balance of distributed computation can be dynamically implemented to gain the high-performance computing ability. This ability makes the detecting and analyzing of high-speed network possible. MADIDS can effectively solve the detection and analysis performance bottleneck caused by the great flow data transfer in high-speed network. It enhances the performance of IDS in high-speed network. In this paper,we construct the infrastructure and theoretical model of MADIDS,and the deficiencies of MADIDS and future research work are also indicated.
