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.展开更多
Within an agent server, the model introduces a trusted third party entity called Secure Service Station(SSS). The SSS is a non\|hardware component and is intended to prevent most attacks performed by malicious hosts, ...Within an agent server, the model introduces a trusted third party entity called Secure Service Station(SSS). The SSS is a non\|hardware component and is intended to prevent most attacks performed by malicious hosts, by providing mechanisms that ensure attack detection and provide integrity to mobile agents. This noble technique involves encapsulating partial results obtained on each intermediate host and binding these results together using a hash function, thus forming a strong bonded chain that cannot be compromised. An analytical model to explore the system performance was also developed.展开更多
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.展开更多
This paper proposes fault tolerant algorithms for routing mobile agents in a single channel wireless sensor network which cover every node in the network. These algorithms use local knowledge (assume no knowledge of g...This paper proposes fault tolerant algorithms for routing mobile agents in a single channel wireless sensor network which cover every node in the network. These algorithms use local knowledge (assume no knowledge of global deployment or topology, etc). We propose the algorithms and show mathematical analysis to support our claims. The paper ends with simulation studies and discussion of results.展开更多
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.展开更多
The security problem of mobile agents is widely being discussed. The problem which protects mobile agents from malicious hosts is difficult to solve, because a host has access to the complete internal state of an agen...The security problem of mobile agents is widely being discussed. The problem which protects mobile agents from malicious hosts is difficult to solve, because a host has access to the complete internal state of an agent. Forward integrity in mobile agents guarantees that offers contained in a mobile agent from previously visited host can not be modified by a malicious host. Itinerary secrecy can prevent mobile agent from being passively attack. This paper proposes a new forward integrity and itinerary secrecy protocol for mobile agent. The protocol can also resist collusion truncation attack.展开更多
Network management scheme must consider security challenges for the Mobile Agent paradigm to be accepted in the Internet computing world. Techniques to provide security solutions have been proposed and some have achie...Network management scheme must consider security challenges for the Mobile Agent paradigm to be accepted in the Internet computing world. Techniques to provide security solutions have been proposed and some have achieved good results. For example, it is possible to launch a code with a guarantee that it cannot attack the hosting sites. The main problem remaining, however, is protecting the mobile code against malicious service providers, the host problem. This paper proposed a Mobile Agent management scheme in a hierarchical level that provides to user a reliable and flexible global access to internet/network information services. We further described a protection mechanism to Mobile Agents against malicious hosts. As an effort to address host problems we first identify the kinds of attack that may be performed by malicious hosts, and propose a mechanism to prevent these attacks. At each agent host we introduce a trusted third party entity on each server called Secure Service Station (SSS) to carry out security actions.展开更多
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.展开更多
Current workflow management systems usually adopt the existing technologies such as TCP/IP-based Web technologies and CORBA as well to fulfill the bottom communications. Very often it has been considered only from a t...Current workflow management systems usually adopt the existing technologies such as TCP/IP-based Web technologies and CORBA as well to fulfill the bottom communications. Very often it has been considered only from a theoretical point of view, mainly for the lack of concrete possibilities to execute with elasticity. MAT (Mobile Agent Technology) represents a very attractive approach to the distributed control of computer networks and a valid alternative to the implementation of strategies for workflow system. This paper mainly focuses on improving the performance of workflow system by using MAT. Firstly, the performances of workflow systems based on both CORBA and mobile agent are summarized and analyzed; Secondly, the performance contrast is presented by introducing the mathematic model of each kind of data interaction process respectively. Last, a mobile agentbased workflow system named MAWMS is presented and described in detail. Key words workflow - Mobile Agent - Contract Net Protocol - CORBA - Web CLC number TP 393 Foundation item: Supported by the National Natural Science Foundation of China (60272024) and National Natural Science Foundation of Henan Province (0411014100)Biography: LI Jie, (1975-), male, lector, Ph. D., research direction: workflow, mobile agent, network management.展开更多
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.展开更多
We analyze the deficiencies of current application systems, and discuss the key requirements of distributed Geographie Information serviee （GIS）, We construct the distributed GIS on grid platform. Considering the fl...We analyze the deficiencies of current application systems, and discuss the key requirements of distributed Geographie Information serviee （GIS）, We construct the distributed GIS on grid platform. Considering the flexibility and efficiency, we integrate the mobile agent technology into the system. We propose a new prototype system, the Geographic Information Grid System （GIGS） based on mobile agent. This system has flexible services and high performance, and improves the sharing of distributed resources. The service strategy of the system and the examples are also presented.展开更多
Mobile agent technology has drawn a tremendous amount of attention from researchers in distributed computing recently as it promises to provide an elegant and efficient way of solving complex distributed problems, as ...Mobile agent technology has drawn a tremendous amount of attention from researchers in distributed computing recently as it promises to provide an elegant and efficient way of solving complex distributed problems, as well as offering a new approach to human-computer-interaction. In mobile agent systems, the mobile agent travels autonomously from one computer to another within the agent enabled networks, executes itself in the agent execution environment, collects useful information and makes its own decision or behalf of its owner. This mobility nature of mobile agent demands its unique name in the whole network otherwise it gets lost or conflicts with other mobile agent having same name. This paper proposes a naming scheme which promises a unique name for a mobile agent within that network. Key words mobile agent - mobile agent platform - naming scheme展开更多
By using Pedersen's verifiable secret sharing scheme and the theory of crossvalidation, we propose an a-nonymous payment protocol which have following features: protecting theconfidentiality of sensitive payment i...By using Pedersen's verifiable secret sharing scheme and the theory of crossvalidation, we propose an a-nonymous payment protocol which have following features: protecting theconfidentiality of sensitive payment information from spying by malicioushosts; using a trustedthird party in a minimal way; verifying the validity of the share by the merchant; allowing agent toverify that the product which it is a-bout to receive is the one it is paying for; keeping thecustomer anonymous.展开更多
文摘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.
文摘Within an agent server, the model introduces a trusted third party entity called Secure Service Station(SSS). The SSS is a non\|hardware component and is intended to prevent most attacks performed by malicious hosts, by providing mechanisms that ensure attack detection and provide integrity to mobile agents. This noble technique involves encapsulating partial results obtained on each intermediate host and binding these results together using a hash function, thus forming a strong bonded chain that cannot be compromised. An analytical model to explore the system performance was also developed.
文摘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 paper proposes fault tolerant algorithms for routing mobile agents in a single channel wireless sensor network which cover every node in the network. These algorithms use local knowledge (assume no knowledge of global deployment or topology, etc). We propose the algorithms and show mathematical analysis to support our claims. The paper ends with simulation studies and discussion of results.
文摘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.
基金Supported by the National Natural Science Foun-dation of China (60373087 ,60473023 ,90104005)
文摘The security problem of mobile agents is widely being discussed. The problem which protects mobile agents from malicious hosts is difficult to solve, because a host has access to the complete internal state of an agent. Forward integrity in mobile agents guarantees that offers contained in a mobile agent from previously visited host can not be modified by a malicious host. Itinerary secrecy can prevent mobile agent from being passively attack. This paper proposes a new forward integrity and itinerary secrecy protocol for mobile agent. The protocol can also resist collusion truncation attack.
文摘Network management scheme must consider security challenges for the Mobile Agent paradigm to be accepted in the Internet computing world. Techniques to provide security solutions have been proposed and some have achieved good results. For example, it is possible to launch a code with a guarantee that it cannot attack the hosting sites. The main problem remaining, however, is protecting the mobile code against malicious service providers, the host problem. This paper proposed a Mobile Agent management scheme in a hierarchical level that provides to user a reliable and flexible global access to internet/network information services. We further described a protection mechanism to Mobile Agents against malicious hosts. As an effort to address host problems we first identify the kinds of attack that may be performed by malicious hosts, and propose a mechanism to prevent these attacks. At each agent host we introduce a trusted third party entity on each server called Secure Service Station (SSS) to carry out security actions.
基金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.
文摘Current workflow management systems usually adopt the existing technologies such as TCP/IP-based Web technologies and CORBA as well to fulfill the bottom communications. Very often it has been considered only from a theoretical point of view, mainly for the lack of concrete possibilities to execute with elasticity. MAT (Mobile Agent Technology) represents a very attractive approach to the distributed control of computer networks and a valid alternative to the implementation of strategies for workflow system. This paper mainly focuses on improving the performance of workflow system by using MAT. Firstly, the performances of workflow systems based on both CORBA and mobile agent are summarized and analyzed; Secondly, the performance contrast is presented by introducing the mathematic model of each kind of data interaction process respectively. Last, a mobile agentbased workflow system named MAWMS is presented and described in detail. Key words workflow - Mobile Agent - Contract Net Protocol - CORBA - Web CLC number TP 393 Foundation item: Supported by the National Natural Science Foundation of China (60272024) and National Natural Science Foundation of Henan Province (0411014100)Biography: LI Jie, (1975-), male, lector, Ph. D., research direction: workflow, mobile agent, network management.
基金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.
基金Supported by the National Technology Research and De-velopment Programof China (863 Program,2002AA135340) and the Na-tional Key Basic Research and Development Program ( 973 Program,2004CB318206)
文摘We analyze the deficiencies of current application systems, and discuss the key requirements of distributed Geographie Information serviee （GIS）, We construct the distributed GIS on grid platform. Considering the flexibility and efficiency, we integrate the mobile agent technology into the system. We propose a new prototype system, the Geographic Information Grid System （GIGS） based on mobile agent. This system has flexible services and high performance, and improves the sharing of distributed resources. The service strategy of the system and the examples are also presented.
文摘Mobile agent technology has drawn a tremendous amount of attention from researchers in distributed computing recently as it promises to provide an elegant and efficient way of solving complex distributed problems, as well as offering a new approach to human-computer-interaction. In mobile agent systems, the mobile agent travels autonomously from one computer to another within the agent enabled networks, executes itself in the agent execution environment, collects useful information and makes its own decision or behalf of its owner. This mobility nature of mobile agent demands its unique name in the whole network otherwise it gets lost or conflicts with other mobile agent having same name. This paper proposes a naming scheme which promises a unique name for a mobile agent within that network. Key words mobile agent - mobile agent platform - naming scheme
文摘By using Pedersen's verifiable secret sharing scheme and the theory of crossvalidation, we propose an a-nonymous payment protocol which have following features: protecting theconfidentiality of sensitive payment information from spying by malicioushosts; using a trustedthird party in a minimal way; verifying the validity of the share by the merchant; allowing agent toverify that the product which it is a-bout to receive is the one it is paying for; keeping thecustomer anonymous.
