ABSTRACT Web services composition based on QoS is the NP-hard problem, so the bionics optimization algorithms can solve it well. On the other hand, QoS of compound service is a key factor for satisfying the users. The users prefer... more
ABSTRACT Web services composition based on QoS is the NP-hard problem, so the bionics optimization algorithms can solve it well. On the other hand, QoS of compound service is a key factor for satisfying the users. The users prefer different QoSs according to their desires. We have Proposed the services composition algorithm based on quality of services and gravitational search algorithm which is one of the recent optimization algorithms and it has many merits, for example rapid convergence speed, less memory use, considering a lot of special parameters such as the distance between solutions, etc. This paper presents a new approach to Service selection for Service Composition based on QoS and under the user's constraints. So in this approach, the QoS measures are considered based on the user's constraints and priorities. The experimental results show the method can achieve the composition effectively and it has a lot of potentiality for being applied.
ABSTRACT Classification of internet packets is a common task for internet routers. More rapid information transformation in communication links requires better processing and classifying algorithms. This paper presents a novel... more
ABSTRACT Classification of internet packets is a common task for internet routers. More rapid information transformation in communication links requires better processing and classifying algorithms. This paper presents a novel classification algorithm for internet packets profits parallel processing of neural networks. It is based on an extended able design of simple neural network blocks which are fast to learn and fast to respond. The classifier could be updated by re-learning simple neural networks, whenever a rule changes.
Research Interests:
Research Interests:
Research Interests:
AbstractThis article proposes a particle swarm optimization (PSO) technique to address open-shop scheduling problems with multiple objectives. Because PSO was originally formulated to treat continuous optimization problems, we modified... more
AbstractThis article proposes a particle swarm optimization (PSO) technique to address open-shop scheduling problems with multiple objectives. Because PSO was originally formulated to treat continuous optimization problems, we modified the particle position ...
Research Interests:
Research Interests:
Several methods and languages have been developed to describe computer system specifications and some of them have been deployed to validate and verify the functionality of the system. No one method is equally appropriate for all... more
Several methods and languages have been developed to describe computer system specifications and some of them have been deployed to validate and verify the functionality of the system. No one method is equally appropriate for all application domains. Service oriented architecture and using Web services is a wide growing domain of applications in software engineering these days, so to achieve more goals and benefits in large business works, we need to compose the existing Web services from different organizations. In this paper we discuss about Web service composition mechanisms and related formal methods and verification issues. One of the solutions in highest level is to use Web Service Choreography Definition Language (WS-CDL) to design the composition of services. With regard to this, we need to get sure about the correctness of choreography behavior, before to employ it for developing and executing services collaboration. In this paper we present a method using first order logic notation based on the partial-order planning problems. This method can be used for interactive systems that all participants have a common understanding of interaction rules. This method will be able to model variable specification of the system. It is consist of three parts included precondition, action and effect, so has a simple structure to understand. In this method we can check the properties of the model for reachability of ideal and safe states. We show the method in a Web service interaction case study and verify it in Prolog tool.
Research Interests:
Due to the outstanding progress in computer technology and an ever-rising demand for high-speed processing able to support the distributed mode there is an increasing trend towards the use of parallel and distributed systems. In addition,... more
Due to the outstanding progress in computer technology and an ever-rising demand for high-speed processing able to support the distributed mode there is an increasing trend towards the use of parallel and distributed systems. In addition, one of the important stages of any system utilizing parallel computing is the load balancing stage in which the balance of workload among all of the system's processors is aimed. In this article, load balancing in parallel systems is studied then; a new load balancing algorithm which has new capabilities will be introduced. Among the new capabilities of this algorithm, its independence of a separate route-finder algorithm between the load receiver and sender nodes can be mentioned. Finally the results of the simulation of this algorithm will be presented.
Research Interests:
Research Interests:
Research Interests:
Web services choreography describes global model of services interactions among a set of participants. The correct description of choreography is very important, so before implementation upon choreography design description, we must be... more
Web services choreography describes global model of services interactions among a set of participants. The correct description of choreography is very important, so before implementation upon choreography design description, we must be sure about correctness. Several techniques are employed to verify WS-CDL. In this paper we use a logical formal model to verify specifications of WS-CDL. In our approach, we model some important aspects of WS-CDL, such as channel passing, Timeout and policies in first order logic and then use Prolog tool to check reachability of all goal states of choreography interactions.
Research Interests:
Page 1. 129 A Fuzzy-Based Approach for Selecting the Optimal Composition of Services According to User Preferences Mahdi Bakhshi Department of Computer Islamic Azad University, Najaf Abad Branch Najaf Abad, Iran e-mail:... more
Page 1. 129 A Fuzzy-Based Approach for Selecting the Optimal Composition of Services According to User Preferences Mahdi Bakhshi Department of Computer Islamic Azad University, Najaf Abad Branch Najaf Abad, Iran e-mail: mah.bakhshi@yahoo.com ...
Research Interests:
... A New Approach for Semantic Web Matching Kamran Zamanifar1, Golsa Heidary2, Naser Nematbakhsh1, and Farhad Mardukhi1 1 Dept. ... Ben Mokhtar, S., Kaul, A., Georgantas, N., Issarny, V.: Towards Efficient Matching of Semantic Web... more
... A New Approach for Semantic Web Matching Kamran Zamanifar1, Golsa Heidary2, Naser Nematbakhsh1, and Farhad Mardukhi1 1 Dept. ... Ben Mokhtar, S., Kaul, A., Georgantas, N., Issarny, V.: Towards Efficient Matching of Semantic Web Service Capabilities. ...
Research Interests:
Among many service choreography description languages, WS-CDL which has been developed by W3C is the most popular one. This language is an intermediate language mostly considered as a design language to describe the choreography, and is... more
Among many service choreography description languages, WS-CDL which has been developed by W3C is the most popular one. This language is an intermediate language mostly considered as a design language to describe the choreography, and is unable to model the choreography in high level. Regard to this issue, this paper proposes a set of notations, used at the analysis phase,
Research Interests:
Research Interests:
The semantics-based Web service matching model is proposed in this paper to improve the performance of Web service discovery. Semantics-based Web service matching is a two-phase method including semantic similarity matching and... more
The semantics-based Web service matching model is proposed in this paper to improve the performance of Web service discovery. Semantics-based Web service matching is a two-phase method including semantic similarity matching and qualitative filtering. Function-based semantic similarity matching used of matching algorithm in order to finding the most proper services. And also, used for selecting the best service among results
Research Interests:
Research Interests:
Research Interests:
Research Interests:
ABSTRACT Recently, a lot of research has been dedicated to optimizing the QoS-aware service composition. This aims at selecting the optimal composed service from all possible service combinations regarding user's end-to-end... more
ABSTRACT Recently, a lot of research has been dedicated to optimizing the QoS-aware service composition. This aims at selecting the optimal composed service from all possible service combinations regarding user's end-to-end quality requirements. Existing solutions often employ the global optimization approach, which does not show promising performance. Also, the complexity of such methods extensively depends on the number of available web-services, which continuously increase along with the growth of the Internet. Besides, the local optimization approaches have been rarely utilized, since they may violate the global constraints. In this paper, we propose a top-down structure, named quality constraints decomposition (QCD) here, to decompose the global constraints into the local constraints, using the genetic algorithm (GA). Then the best web service for each task is selected through a simple linear search. In contrast to existing methods, the QCD approach mainly depends on a limited set of tasks, which is considerably less complex, especially in the case of dynamically distributed service composition. Experimental results, based on a well-known data set of web services (QWSs), show the advantages of the QCD method in terms of computation time, considering the number of web services.
Research Interests:
Research Interests:
Research Interests:
Dynamic service composition aims to create value-added services by selecting and combining existing services properly on demand. Basically, this research intends to select web services taking part in composition attention to both user... more
Dynamic service composition aims to create value-added services by selecting and combining existing services properly on demand. Basically, this research intends to select web services taking part in composition attention to both user query and service provider policy. The policy of service providers is represented and reasoned by SWRL language.
Most of the works done for specifying and analyzing the Access Control Polices (ACPs) consider the security policies per system while it is required to unify the security policies in an integrated system with several subsystems. Moreover,... more
Most of the works done for specifying and analyzing the Access Control Polices (ACPs) consider the security policies per system while it is required to unify the security policies in an integrated system with several subsystems. Moreover, an important problem in web service composition is that the partners contributed in a combination may have inconsistent ACPs. This makes the composed web service invalid. Also the ACP of composed web service may violate the ACP of one partner. So web services ACPs must ...
Page 1. How to Discover a Semantic Web Service by Knowing Its Functionality Parameters Golsa Heidary1, Kamran Zamanifar2 1Young researchers club, 2 Dept. ... [13] S. Ben Mokhtar, A. Kaul,N.Georgantas and V. Issarny , Towards efficient... more
Page 1. How to Discover a Semantic Web Service by Knowing Its Functionality Parameters Golsa Heidary1, Kamran Zamanifar2 1Young researchers club, 2 Dept. ... [13] S. Ben Mokhtar, A. Kaul,N.Georgantas and V. Issarny , Towards efficient matching of semantic web service ...