This document proposes a new heuristic approach for web service discovery and selection using an algorithm inspired by honey bee behavior called the Bees Algorithm. The approach structures service registries by domain to simplify discovery. It uses the Bees Algorithm as an intelligent search method to efficiently find the optimal service matching a client's request and quality of service requirements from the relevant registry in least time.
WEB SERVICE SELECTION BASED ON RANKING OF QOS USING ASSOCIATIVE CLASSIFICATIONijwscjournal
With the explosive growth of the number of services published over the Internet, it is difficult to select satisfactory web services among the candidate web services which provide similar functionalities. Quality of Service (QoS) is considered as the most important non-functional criterion for service selection. But this criterion is no longer considered as the only criterion to rank web services, satisfying user’s preferences. The similarity measure (outputs–inputs similarity) between concepts based on ontology in an interconnected network of semantic Web services involved in a composition can be used as a distinguishing criterion to estimate the semantic quality of selected services for the composite service. Coupling the
semantic similarity as the functional aspect and quality of services allows us to further constrain and select services for the valid composite services. In this paper, we present an overall service selection and ranking framework which firstly classify candidate web services to different QoS levels respect to user’s QoS requirements and preferences with an Associative Classification algorithm and then rank the most qualified candidate services based on their functional quality through semantic matching. The experimental results show that proposed framework can satisfy service requesters’ non-functional requirements.
Immune-Inspired Method for Selecting the Optimal Solution in Semantic Web Ser...IJwest
The increasing interest in developing efficient and effective optimization techniques has conducted researchers to turn their attention towards biology. It has been noticed that biology offers many clues for designing novel optimization techniques, these approaches exhibit self-organizing capabilities and permit the reachability of promising solutions without the existence of a central coordinator. In this paper we handle the problem of dynamic web service composition, by using the clonal selection algorithm. In order to assess the optimality rate of a given composition, we use the QOS attributes of the services involved in the workflow as well as, the semantic similarity between these components. The experimental evaluation shows that the proposed approach has a better performance in comparison with other approaches such as the genetic algorithm.
AN ADAPTIVE APPROACH FOR DYNAMIC RECOVERY DECISIONS IN WEB SERVICE COMPOSITIO...ijwscjournal
Service Oriented Architecture facilitates automatic execution and composition of web services in
distributed environment. This service composition in the heterogeneous environment may suffer from
various kinds of service failures. These failures interrupt the execution of composite web services and
lead towards complete system failure. The dynamic recovery decisions of the failed services are
dependent on non-functional attributes of the services. In the recent years, various methodologies
have been presented to provide recovery decisions based on time related QoS (Quality of Service)
factors. These QoS attributes can be categorized further. Our paper categorized these attributes as
space and time. In this paper, we have proposed an affinity model to quantify the location affinity for
composition of web services. Furthermore, we have also suggested a replication mechanism and
algorithm for taking recovery decisions based on time and space based QoS parameters and usage
pattern of the services by the user.
A NEW APPROACH IN PACKET SCHEDULING IN THE VANET ijasuc
Vehicular Ad hoc Networks (VANET) are expected to have great potential to improve both traffic safety
and comfort in the future. When many vehicles want to access data through roadside unit, data scheduling
become an important issue. In this paper, we identify some challenges in roadside based data access. To
address these challenges we first review some existing scheduling schemes. We then propose a priority
scheduling and finally show that using this idea can increase QOS compare to previous algorithms.
An analytic network process and trapezoidal interval-valued fuzzy technique f...University of Piraeus
Next generation wireless networks consist of many heterogeneous access technologies that should support various service types with different quality of service (QoS) constraints, as well as user, requirements and provider policies. Therefore, the need for network selection mechanisms that consider multiple factors must be addressed. In this paper, a network selection method is proposed by applying the analytic network process to estimate the weights of the selection criteria, as well as a fuzzy version of technique for order preference by similarity to ideal solution to perform the ranking of network alternatives. The method is applied to a heterogeneous network environment providing different QoS classes and policy characteristics. Each user applies the method to select the most appropriate network, which satisfies his or her requirements in respect of his or her service-level agreement (SLA). Performance evaluation shows that when the user requests only one service, the proposed method performs better compared to the original technique for order preference by similarity to ideal solution, as well as the Fuzzy AHP-ELECTRE method. Moreover, the proposed method can be applied in cases where a user requires multiple services simultaneously on a device. The sensitivity analysis of the proposed method shows that it can be properly adjusted to conform to network environment changes.
A MARKOVIAN MODEL FOR INTERNET OF THINGS APPLICATIONIJCNCJournal
Internet of Things (IoT) allows communication among human-to-things, things-to-human, and things-tothings that are incorporated into an information networks allowing automatic information interchange and
the processing of data at real time. In this paper, we conduct a performance analysis of a real application
defined through four traffic classes with the priorities present in smart cities using Continuous Time
Markov Chains(CTMC). Based on a finite capacity queuing system, we propose a new cost-effective
analytical model with a push-out management scheme in favor of the highest priority (emergency) traffic.
Based on the analytical model, several performance measures for different traffic classes have been
studiedextensively including blocking probability; push out probability, delay, channel utilization as well as
overall system performance.
Application Of Extreme Value Theory To Bursts PredictionCSCJournals
Bursts and extreme events in quantities such as connection durations, file sizes, throughput, etc. may produce undesirable consequences in computer networks. Deterioration in the quality of service is a major consequence. Predicting these extreme events and burst is important. It helps in reserving the right resources for a better quality of service. We applied Extreme value theory (EVT) to predict bursts in network traffic. We took a deeper look into the application of EVT by using EVT based Exploratory Data Analysis. We found that traffic is naturally divided into two categories, Internal and external traffic. The internal traffic follows generalized extreme value (GEV) model with a negative shape parameter, which is also the same as Weibull distribution. The external traffic follows a GEV with positive shape parameter, which is Frechet distribution. These findings are of great value to the quality of service in data networks, especially when included in service level agreement as traffic descriptor parameters.
WEB SERVICE SELECTION BASED ON RANKING OF QOS USING ASSOCIATIVE CLASSIFICATIONijwscjournal
With the explosive growth of the number of services published over the Internet, it is difficult to select satisfactory web services among the candidate web services which provide similar functionalities. Quality of Service (QoS) is considered as the most important non-functional criterion for service selection. But this criterion is no longer considered as the only criterion to rank web services, satisfying user’s preferences. The similarity measure (outputs–inputs similarity) between concepts based on ontology in an interconnected network of semantic Web services involved in a composition can be used as a distinguishing criterion to estimate the semantic quality of selected services for the composite service. Coupling the
semantic similarity as the functional aspect and quality of services allows us to further constrain and select services for the valid composite services. In this paper, we present an overall service selection and ranking framework which firstly classify candidate web services to different QoS levels respect to user’s QoS requirements and preferences with an Associative Classification algorithm and then rank the most qualified candidate services based on their functional quality through semantic matching. The experimental results show that proposed framework can satisfy service requesters’ non-functional requirements.
Immune-Inspired Method for Selecting the Optimal Solution in Semantic Web Ser...IJwest
The increasing interest in developing efficient and effective optimization techniques has conducted researchers to turn their attention towards biology. It has been noticed that biology offers many clues for designing novel optimization techniques, these approaches exhibit self-organizing capabilities and permit the reachability of promising solutions without the existence of a central coordinator. In this paper we handle the problem of dynamic web service composition, by using the clonal selection algorithm. In order to assess the optimality rate of a given composition, we use the QOS attributes of the services involved in the workflow as well as, the semantic similarity between these components. The experimental evaluation shows that the proposed approach has a better performance in comparison with other approaches such as the genetic algorithm.
AN ADAPTIVE APPROACH FOR DYNAMIC RECOVERY DECISIONS IN WEB SERVICE COMPOSITIO...ijwscjournal
Service Oriented Architecture facilitates automatic execution and composition of web services in
distributed environment. This service composition in the heterogeneous environment may suffer from
various kinds of service failures. These failures interrupt the execution of composite web services and
lead towards complete system failure. The dynamic recovery decisions of the failed services are
dependent on non-functional attributes of the services. In the recent years, various methodologies
have been presented to provide recovery decisions based on time related QoS (Quality of Service)
factors. These QoS attributes can be categorized further. Our paper categorized these attributes as
space and time. In this paper, we have proposed an affinity model to quantify the location affinity for
composition of web services. Furthermore, we have also suggested a replication mechanism and
algorithm for taking recovery decisions based on time and space based QoS parameters and usage
pattern of the services by the user.
A NEW APPROACH IN PACKET SCHEDULING IN THE VANET ijasuc
Vehicular Ad hoc Networks (VANET) are expected to have great potential to improve both traffic safety
and comfort in the future. When many vehicles want to access data through roadside unit, data scheduling
become an important issue. In this paper, we identify some challenges in roadside based data access. To
address these challenges we first review some existing scheduling schemes. We then propose a priority
scheduling and finally show that using this idea can increase QOS compare to previous algorithms.
An analytic network process and trapezoidal interval-valued fuzzy technique f...University of Piraeus
Next generation wireless networks consist of many heterogeneous access technologies that should support various service types with different quality of service (QoS) constraints, as well as user, requirements and provider policies. Therefore, the need for network selection mechanisms that consider multiple factors must be addressed. In this paper, a network selection method is proposed by applying the analytic network process to estimate the weights of the selection criteria, as well as a fuzzy version of technique for order preference by similarity to ideal solution to perform the ranking of network alternatives. The method is applied to a heterogeneous network environment providing different QoS classes and policy characteristics. Each user applies the method to select the most appropriate network, which satisfies his or her requirements in respect of his or her service-level agreement (SLA). Performance evaluation shows that when the user requests only one service, the proposed method performs better compared to the original technique for order preference by similarity to ideal solution, as well as the Fuzzy AHP-ELECTRE method. Moreover, the proposed method can be applied in cases where a user requires multiple services simultaneously on a device. The sensitivity analysis of the proposed method shows that it can be properly adjusted to conform to network environment changes.
A MARKOVIAN MODEL FOR INTERNET OF THINGS APPLICATIONIJCNCJournal
Internet of Things (IoT) allows communication among human-to-things, things-to-human, and things-tothings that are incorporated into an information networks allowing automatic information interchange and
the processing of data at real time. In this paper, we conduct a performance analysis of a real application
defined through four traffic classes with the priorities present in smart cities using Continuous Time
Markov Chains(CTMC). Based on a finite capacity queuing system, we propose a new cost-effective
analytical model with a push-out management scheme in favor of the highest priority (emergency) traffic.
Based on the analytical model, several performance measures for different traffic classes have been
studiedextensively including blocking probability; push out probability, delay, channel utilization as well as
overall system performance.
Application Of Extreme Value Theory To Bursts PredictionCSCJournals
Bursts and extreme events in quantities such as connection durations, file sizes, throughput, etc. may produce undesirable consequences in computer networks. Deterioration in the quality of service is a major consequence. Predicting these extreme events and burst is important. It helps in reserving the right resources for a better quality of service. We applied Extreme value theory (EVT) to predict bursts in network traffic. We took a deeper look into the application of EVT by using EVT based Exploratory Data Analysis. We found that traffic is naturally divided into two categories, Internal and external traffic. The internal traffic follows generalized extreme value (GEV) model with a negative shape parameter, which is also the same as Weibull distribution. The external traffic follows a GEV with positive shape parameter, which is Frechet distribution. These findings are of great value to the quality of service in data networks, especially when included in service level agreement as traffic descriptor parameters.
An analytic network process and trapezoidal interval-valued fuzzy technique f...University of Piraeus
Next generation wireless networks consist of many heterogeneous access technologies that should support various service types with different quality of service (QoS) constraints, as well as user, requirements and provider policies. Therefore, the need for network selection mechanisms that consider multiple factors must be addressed. In this paper, a network selection method is proposed by applying the analytic network process to estimate the weights of the selection criteria, as well as a fuzzy version of technique for order preference by similarity to ideal solution to perform the ranking of network alternatives. The method is applied to a heterogeneous network environment providing different QoS classes and policy characteristics. Each user applies the method to select the most appropriate network, which satisfies his or her requirements in respect of his or her service-level agreement (SLA). Performance evaluation shows that when the user requests only one service, the proposed method performs better compared to the original technique for order preference by similarity to ideal solution, as well as the Fuzzy AHP-ELECTRE method. Moreover, the proposed method can be applied in cases where a user requires multiple services simultaneously on a device. The sensitivity analysis of the proposed method shows that it can be properly adjusted to conform to network environment changes.
An enhanced kernel weighted collaborative recommended system to alleviate spa...IJECEIAES
User Reviews in the form of ratings giving an opportunity to judge the user interest on the available products and providing a chance to recommend new similar items to the customers. Personalized recommender techniques placing vital role in this grown ecommerce century to predict the users‟ interest. Collaborative Filtering (CF) system is one of the widely used democratic recommender system where it completely rely on user ratings to provide recommendations for the users. In this paper, an enhanced Collaborative Filtering system is proposed using Kernel Weighted K-means Clustering (KWKC) approach using Radial basis Functions (RBF) for eliminate the Sparsity problem where lack of rating is the challenge of providing the accurate recommendation to the user. The proposed system having two phases of state transitions: Connected and Disconnected. During Connected state the form of transition will be „Recommended mode‟ where the active user be given with the Predicted-recommended items. In Disconnected State the form of transition will be „Learning mode‟ where the hybrid learning approach and user clusters will be used to define the similar user models. Disconnected State activities will be performed in hidden layer of RBF and Connected Sate activities will be performed in output Layer. Input Layer of RBF using original user Ratings. The proposed KWKC used to smoothen the sparse original rating matrix and define the similar user clusters. A benchmark comparative study also made with classical learning and prediction techniques in terms of accuracy and computational time. Experiential setup is made using MovieLens dataset.
USER-CENTRIC OPTIMIZATION FOR CONSTRAINT WEB SERVICE COMPOSITION USING A FUZZ...ijwscjournal
Service-Oriented Applications (SOA) are being regarded as the main pragmatic solution for distributed environments. In such systems, however each service responds the user request independently, it is essential to compose them for delivering a compound value-added service. Since, there may be a number of compositions to create the requested service, it is important to find one which its properties are close to user’s desires and meet some non-functional constraints and optimize criteria such as overall cost or response time. In this paper, a user-centric approach is presented for evaluating the service compositions
which attempts to obtain the user desires. This approach uses fuzzy logic in order to inference based on quality criteria ranked by user and Genetic Algorithms to optimize the QoS-aware composition problem. Results show that the Fuzzy-based Genetic algorithm system enables user to participate in the process of web service composition easier and more efficient.
Since service-oriented architectures make the commercial systems more reliable and reusable, they have
gained more popularity in industry and scientific community in recent decades. Service-oriented
architectures bring flexibility and reusability to software design. Due to the increasing number of services
on the Web, finding a service which is suited to user requirements is crucial. The process of finding suitable
services to user request is one of the main purposes of service-oriented architectures. Many methods have
been proposed for service discovery in service-oriented architectures that try to fulfil user requirements
and offer suitable services to user request; however the proposed methods do not have enough precision for
discovering suitable services. In this paper, we propose a method for service discovery which offers more
accurate services according to user request. The proposed method is a hybrid semantic matchmaker for
service discovery in service oriented architecture. By providing accurate services suitable to user requests,
we have greatly increased the reusability rate and reduced the time and cost of software development
Threshold benchmarking for feature ranking techniquesjournalBEEI
In prediction modeling, the choice of features chosen from the original feature set is crucial for accuracy and model interpretability. Feature ranking techniques rank the features by its importance but there is no consensus on the number of features to be cut-off. Thus, it becomes important to identify a threshold value or range, so as to remove the redundant features. In this work, an empirical study is conducted for identification of the threshold benchmark for feature ranking algorithms. Experiments are conducted on Apache Click dataset with six popularly used ranker techniques and six machine learning techniques, to deduce a relationship between the total number of input features (N) to the threshold range. The area under the curve analysis shows that ≃ 33-50% of the features are necessary and sufficient to yield a reasonable performance measure, with a variance of 2%, in defect prediction models. Further, we also find that the log2(N) as the ranker threshold value represents the lower limit of the range.
Semantic Annotation Framework For Intelligent Information Retrieval Using KIM...dannyijwest
Due to the explosion of information/knowledge on the web and wide use of search engines for desired
information,the role of knowledge management(KM) is becoming more significant in an organization.
Knowledge Management in an Organization is used to create ,capture, store, share, retrieve and manage
information efficiently. The semantic web, an intelligent and meaningful web, tend to provide a promising
platform for knowledge management systems and vice versa, since they have the potential to give each
other the real substance for machine-understandable web resources which in turn will lead to an
intelligent, meaningful and efficient information retrieval on web. Today,the challenge for web community
is to integrate the distributed heterogeneous resources on web with an objective of an intelligent web
environment focusing on data semantics and user requirements. Semantic Annotation(SA) is being widely
used which is about assigning to the entities in the text and links to their semantic descriptions. Various
tools like KIM, Amaya etc may be used for semantic Annotation.
Testing of web services Based on Ontology Management ServiceIJMER
International Journal of Modern Engineering Research (IJMER) is Peer reviewed, online Journal. It serves as an international archival forum of scholarly research related to engineering and science education.
International Journal of Modern Engineering Research (IJMER) covers all the fields of engineering and science: Electrical Engineering, Mechanical Engineering, Civil Engineering, Chemical Engineering, Computer Engineering, Agricultural Engineering, Aerospace Engineering, Thermodynamics, Structural Engineering, Control Engineering, Robotics, Mechatronics, Fluid Mechanics, Nanotechnology, Simulators, Web-based Learning, Remote Laboratories, Engineering Design Methods, Education Research, Students' Satisfaction and Motivation, Global Projects, and Assessment…. And many more.
AN OPTIMIZED MECHANISM FOR ADAPTIVE AND DYNAMIC POLICY BASED HANDOVER IN CLUS...pijans
On-going revolution in ever-improving wireless communication enforces the necessity of a self configuring,
rapidly deployable and infrastructure less network. MANET is such an autonomous wireless network that
meets the requirements. At the same time MANET’s random behavior and absence of any central
intelligence to gather unambiguous knowledge about user contexts complexes QoS maintenance and
hampers proper utilization of network resources resulting into unnecessary handovers. In past, few policy
driven handover approaches have been proposed for MANET but none of them explores a comprehensive
policy design. Therefore in this paper we propose an adaptive and optimized policy based handover
mechanism which is based on explicitly designed policies like load balancing, service discovery and next
hop selection .Efficient procedures for these policies are also explored .This work predicts the high time of
handover need on the basis of application specific needs of individual freely roaming mobile nodes,
avoiding unnecessary handovers and provides efficient handover procedure with optimized resource
consumption, reduced latency and interruption time.
http://inarocket.com
Learn BEM fundamentals as fast as possible. What is BEM (Block, element, modifier), BEM syntax, how it works with a real example, etc.
Content personalisation is becoming more prevalent. A site, it's content and/or it's products, change dynamically according to the specific needs of the user. SEO needs to ensure we do not fall behind of this trend.
10 Insightful Quotes On Designing A Better Customer ExperienceYuan Wang
In an ever-changing landscape of one digital disruption after another, companies and organisations are looking for new ways to understand their target markets and engage them better. Increasingly they invest in user experience (UX) and customer experience design (CX) capabilities by working with a specialist UX agency or developing their own UX lab. Some UX practitioners are touting leaner and faster ways of developing customer-centric products and services, via methodologies such as guerilla research, rapid prototyping and Agile UX. Others seek innovation and fulfilment by spending more time in research, being more inclusive, and designing for social goods.
Experience is more than just an interface. It is a relationship, as well as a series of touch points between your brand and your customer. Here are our top 10 highlights and takeaways from the recent UX Australia conference to help you transform your customer experience design.
For full article, continue reading at https://yump.com.au/10-ways-supercharge-customer-experience-design/
How to Build a Dynamic Social Media PlanPost Planner
Stop guessing and wasting your time on networks and strategies that don’t work!
Join Rebekah Radice and Katie Lance to learn how to optimize your social networks, the best kept secrets for hot content, top time management tools, and much more!
Watch the replay here: bit.ly/socialmedia-plan
Lightning Talk #9: How UX and Data Storytelling Can Shape Policy by Mika Aldabaux singapore
How can we take UX and Data Storytelling out of the tech context and use them to change the way government behaves?
Showcasing the truth is the highest goal of data storytelling. Because the design of a chart can affect the interpretation of data in a major way, one must wield visual tools with care and deliberation. Using quantitative facts to evoke an emotional response is best achieved with the combination of UX and data storytelling.
An analytic network process and trapezoidal interval-valued fuzzy technique f...University of Piraeus
Next generation wireless networks consist of many heterogeneous access technologies that should support various service types with different quality of service (QoS) constraints, as well as user, requirements and provider policies. Therefore, the need for network selection mechanisms that consider multiple factors must be addressed. In this paper, a network selection method is proposed by applying the analytic network process to estimate the weights of the selection criteria, as well as a fuzzy version of technique for order preference by similarity to ideal solution to perform the ranking of network alternatives. The method is applied to a heterogeneous network environment providing different QoS classes and policy characteristics. Each user applies the method to select the most appropriate network, which satisfies his or her requirements in respect of his or her service-level agreement (SLA). Performance evaluation shows that when the user requests only one service, the proposed method performs better compared to the original technique for order preference by similarity to ideal solution, as well as the Fuzzy AHP-ELECTRE method. Moreover, the proposed method can be applied in cases where a user requires multiple services simultaneously on a device. The sensitivity analysis of the proposed method shows that it can be properly adjusted to conform to network environment changes.
An enhanced kernel weighted collaborative recommended system to alleviate spa...IJECEIAES
User Reviews in the form of ratings giving an opportunity to judge the user interest on the available products and providing a chance to recommend new similar items to the customers. Personalized recommender techniques placing vital role in this grown ecommerce century to predict the users‟ interest. Collaborative Filtering (CF) system is one of the widely used democratic recommender system where it completely rely on user ratings to provide recommendations for the users. In this paper, an enhanced Collaborative Filtering system is proposed using Kernel Weighted K-means Clustering (KWKC) approach using Radial basis Functions (RBF) for eliminate the Sparsity problem where lack of rating is the challenge of providing the accurate recommendation to the user. The proposed system having two phases of state transitions: Connected and Disconnected. During Connected state the form of transition will be „Recommended mode‟ where the active user be given with the Predicted-recommended items. In Disconnected State the form of transition will be „Learning mode‟ where the hybrid learning approach and user clusters will be used to define the similar user models. Disconnected State activities will be performed in hidden layer of RBF and Connected Sate activities will be performed in output Layer. Input Layer of RBF using original user Ratings. The proposed KWKC used to smoothen the sparse original rating matrix and define the similar user clusters. A benchmark comparative study also made with classical learning and prediction techniques in terms of accuracy and computational time. Experiential setup is made using MovieLens dataset.
USER-CENTRIC OPTIMIZATION FOR CONSTRAINT WEB SERVICE COMPOSITION USING A FUZZ...ijwscjournal
Service-Oriented Applications (SOA) are being regarded as the main pragmatic solution for distributed environments. In such systems, however each service responds the user request independently, it is essential to compose them for delivering a compound value-added service. Since, there may be a number of compositions to create the requested service, it is important to find one which its properties are close to user’s desires and meet some non-functional constraints and optimize criteria such as overall cost or response time. In this paper, a user-centric approach is presented for evaluating the service compositions
which attempts to obtain the user desires. This approach uses fuzzy logic in order to inference based on quality criteria ranked by user and Genetic Algorithms to optimize the QoS-aware composition problem. Results show that the Fuzzy-based Genetic algorithm system enables user to participate in the process of web service composition easier and more efficient.
Since service-oriented architectures make the commercial systems more reliable and reusable, they have
gained more popularity in industry and scientific community in recent decades. Service-oriented
architectures bring flexibility and reusability to software design. Due to the increasing number of services
on the Web, finding a service which is suited to user requirements is crucial. The process of finding suitable
services to user request is one of the main purposes of service-oriented architectures. Many methods have
been proposed for service discovery in service-oriented architectures that try to fulfil user requirements
and offer suitable services to user request; however the proposed methods do not have enough precision for
discovering suitable services. In this paper, we propose a method for service discovery which offers more
accurate services according to user request. The proposed method is a hybrid semantic matchmaker for
service discovery in service oriented architecture. By providing accurate services suitable to user requests,
we have greatly increased the reusability rate and reduced the time and cost of software development
Threshold benchmarking for feature ranking techniquesjournalBEEI
In prediction modeling, the choice of features chosen from the original feature set is crucial for accuracy and model interpretability. Feature ranking techniques rank the features by its importance but there is no consensus on the number of features to be cut-off. Thus, it becomes important to identify a threshold value or range, so as to remove the redundant features. In this work, an empirical study is conducted for identification of the threshold benchmark for feature ranking algorithms. Experiments are conducted on Apache Click dataset with six popularly used ranker techniques and six machine learning techniques, to deduce a relationship between the total number of input features (N) to the threshold range. The area under the curve analysis shows that ≃ 33-50% of the features are necessary and sufficient to yield a reasonable performance measure, with a variance of 2%, in defect prediction models. Further, we also find that the log2(N) as the ranker threshold value represents the lower limit of the range.
Semantic Annotation Framework For Intelligent Information Retrieval Using KIM...dannyijwest
Due to the explosion of information/knowledge on the web and wide use of search engines for desired
information,the role of knowledge management(KM) is becoming more significant in an organization.
Knowledge Management in an Organization is used to create ,capture, store, share, retrieve and manage
information efficiently. The semantic web, an intelligent and meaningful web, tend to provide a promising
platform for knowledge management systems and vice versa, since they have the potential to give each
other the real substance for machine-understandable web resources which in turn will lead to an
intelligent, meaningful and efficient information retrieval on web. Today,the challenge for web community
is to integrate the distributed heterogeneous resources on web with an objective of an intelligent web
environment focusing on data semantics and user requirements. Semantic Annotation(SA) is being widely
used which is about assigning to the entities in the text and links to their semantic descriptions. Various
tools like KIM, Amaya etc may be used for semantic Annotation.
Testing of web services Based on Ontology Management ServiceIJMER
International Journal of Modern Engineering Research (IJMER) is Peer reviewed, online Journal. It serves as an international archival forum of scholarly research related to engineering and science education.
International Journal of Modern Engineering Research (IJMER) covers all the fields of engineering and science: Electrical Engineering, Mechanical Engineering, Civil Engineering, Chemical Engineering, Computer Engineering, Agricultural Engineering, Aerospace Engineering, Thermodynamics, Structural Engineering, Control Engineering, Robotics, Mechatronics, Fluid Mechanics, Nanotechnology, Simulators, Web-based Learning, Remote Laboratories, Engineering Design Methods, Education Research, Students' Satisfaction and Motivation, Global Projects, and Assessment…. And many more.
AN OPTIMIZED MECHANISM FOR ADAPTIVE AND DYNAMIC POLICY BASED HANDOVER IN CLUS...pijans
On-going revolution in ever-improving wireless communication enforces the necessity of a self configuring,
rapidly deployable and infrastructure less network. MANET is such an autonomous wireless network that
meets the requirements. At the same time MANET’s random behavior and absence of any central
intelligence to gather unambiguous knowledge about user contexts complexes QoS maintenance and
hampers proper utilization of network resources resulting into unnecessary handovers. In past, few policy
driven handover approaches have been proposed for MANET but none of them explores a comprehensive
policy design. Therefore in this paper we propose an adaptive and optimized policy based handover
mechanism which is based on explicitly designed policies like load balancing, service discovery and next
hop selection .Efficient procedures for these policies are also explored .This work predicts the high time of
handover need on the basis of application specific needs of individual freely roaming mobile nodes,
avoiding unnecessary handovers and provides efficient handover procedure with optimized resource
consumption, reduced latency and interruption time.
http://inarocket.com
Learn BEM fundamentals as fast as possible. What is BEM (Block, element, modifier), BEM syntax, how it works with a real example, etc.
Content personalisation is becoming more prevalent. A site, it's content and/or it's products, change dynamically according to the specific needs of the user. SEO needs to ensure we do not fall behind of this trend.
10 Insightful Quotes On Designing A Better Customer ExperienceYuan Wang
In an ever-changing landscape of one digital disruption after another, companies and organisations are looking for new ways to understand their target markets and engage them better. Increasingly they invest in user experience (UX) and customer experience design (CX) capabilities by working with a specialist UX agency or developing their own UX lab. Some UX practitioners are touting leaner and faster ways of developing customer-centric products and services, via methodologies such as guerilla research, rapid prototyping and Agile UX. Others seek innovation and fulfilment by spending more time in research, being more inclusive, and designing for social goods.
Experience is more than just an interface. It is a relationship, as well as a series of touch points between your brand and your customer. Here are our top 10 highlights and takeaways from the recent UX Australia conference to help you transform your customer experience design.
For full article, continue reading at https://yump.com.au/10-ways-supercharge-customer-experience-design/
How to Build a Dynamic Social Media PlanPost Planner
Stop guessing and wasting your time on networks and strategies that don’t work!
Join Rebekah Radice and Katie Lance to learn how to optimize your social networks, the best kept secrets for hot content, top time management tools, and much more!
Watch the replay here: bit.ly/socialmedia-plan
Lightning Talk #9: How UX and Data Storytelling Can Shape Policy by Mika Aldabaux singapore
How can we take UX and Data Storytelling out of the tech context and use them to change the way government behaves?
Showcasing the truth is the highest goal of data storytelling. Because the design of a chart can affect the interpretation of data in a major way, one must wield visual tools with care and deliberation. Using quantitative facts to evoke an emotional response is best achieved with the combination of UX and data storytelling.
A distributed system can be viewed as an environment in which, number of computers/nodes are connected and resources are shared among these computers/nodes. But unfortunately, distributed systems often face the problem of traffic, which can degrade the performance of the system. Traffic management is used to improve scalability and overall system throughput in distributed systems using Software Defined Network (SDN) based systems. Traffic management improves system performance by dividing the work traffic effectively among the participating computers/nodes. Many algorithms were proposed for traffic management and their performance is measured based on certain parameters such as response time, resource utilization, and fault tolerance. Traffic management algorithms are broadly classified into two categories- scheduling and machine learning traffic management. This work presents the study of performance analysis of traffic management algorithms. This analysis can further help in the design of new algorithms. However, when multiple servers are assigned to compile the mysterious code, different kinds of techniques are used. One common example is traffic management. The processes are managed based on power efficiency, networking bandwidth, Processor speed. The desired output will again send back to the developer. If multiple programs have to be compiled then appropriate technique such as scheduling algorithm is used. So the compilation process becomes faster and also the other process can get a chance to compile. SDN based clustering algorithm based on Simulated Annealing whose main goal is to increase network lifetime while maintaining adequate sensing coverage in scenarios where sensor nodes produce uniform or non-uniform data traffic.
WEB SERVICE SELECTION BASED ON RANKING OF QOS USING ASSOCIATIVE CLASSIFICATIONijwscjournal
With the explosive growth of the number of services published over the Internet, it is difficult to select satisfactory web services among the candidate web services which provide similar functionalities. Quality of Service (QoS) is considered as the most important non-functional criterion for service selection. But this criterion is no longer considered as the only criterion to rank web services, satisfying user’s preferences. The similarity measure (outputs–inputs similarity) between concepts based on ontology in an interconnected network of semantic Web services involved in a composition can be used as a distinguishing criterion to estimate the semantic quality of selected services for the composite service. Coupling the
semantic similarity as the functional aspect and quality of services allows us to further constrain and select services for the valid composite services.
In this paper, we present an overall service selection and ranking framework which firstly classify candidate web services to different QoS levels respect to user’s QoS requirements and preferences with an Associative Classification algorithm and then rank the most qualified candidate services based on their
functional quality through semantic matching. The experimental results show that proposed framework can satisfy service requesters’ non-functional requirements.
WEB SERVICE SELECTION BASED ON RANKING OF QOS USING ASSOCIATIVE CLASSIFICATIONijwscjournal
With the explosive growth of the number of services published over the Internet, it is difficult to select satisfactory web services among the candidate web services which provide similar functionalities. Quality of Service (QoS) is considered as the most important non-functional criterion for service selection. But this criterion is no longer considered as the only criterion to rank web services, satisfying user’s preferences. The similarity measure (outputs–inputs similarity) between concepts based on ontology in an interconnected network of semantic Web services involved in a composition can be used as a distinguishing criterion to estimate the semantic quality of selected services for the composite service. Coupling the semantic similarity as the functional aspect and quality of services allows us to further constrain and select services for the valid composite services.
In this paper, we present an overall service selection and ranking framework which firstly classify candidate web services to different QoS levels respect to user’s QoS requirements and preferences with an Associative Classification algorithm and then rank the most qualified candidate services based on their functional quality through semantic matching. The experimental results show that proposed framework can satisfy service requesters’ non-functional requirements.
WEB SERVICE SELECTION BASED ON RANKING OF QOS USING ASSOCIATIVE CLASSIFICATIONijwscjournal
With the explosive growth of the number of services published over the Internet, it is difficult to select satisfactory web services among the candidate web services which provide similar functionalities. Quality of Service (QoS) is considered as the most important non-functional criterion for service selection. But this criterion is no longer considered as the only criterion to rank web services, satisfying user’s preferences. The similarity measure (outputs–inputs similarity) between concepts based on ontology in an interconnected network of semantic Web services involved in a composition can be used as a distinguishing criterion to estimate the semantic quality of selected services for the composite service. Coupling the semantic similarity as the functional aspect and quality of services allows us to further constrain and select services for the valid composite services.
In this paper, we present an overall service selection and ranking framework which firstly classify candidate web services to different QoS levels respect to user’s QoS requirements and preferences with an Associative Classification algorithm and then rank the most qualified candidate services based on their functional quality through semantic matching. The experimental results show that proposed framework can satisfy service requesters’ non-functional requirements.
MMUNE-INSPIRED METHOD FOR SELECTING THE OPTIMAL SOLUTION IN SEMANTIC WEB SE...dannyijwest
The increasing interest in developing efficient and effective optimization techniques has conducted
researchers to turn their attention towards biology. It has been noticed that biology offers many clues for
designing novel optimization techniques, these approaches exhibit self-organizing capabilities and permit
the reachability of promising solutions without the existence of a central coordinator. In this paper we
handle the problem of dynamic web service composition, by using the clonal selection algorithm. In order
to assess the optimality rate of a given composition, we use the QOS attributes of the services involved in
the workflow as well as, the semantic similarity between these components. The experimental evaluation
shows that the proposed approach has a better performance in comparison with other approaches such as
the genetic algorithm
SERVICE DISCOVERY – A SURVEY AND COMPARISONijujournal
With the increasing number of services in the internet, companies’ intranets, and home networks: service
discovery becomes an integral part of modern networked system. This paper provides a comprehensive
survey of major solutions for service discovery. We cover techniques and features used in existing systems.
Although a few survey articles have been published on this object, our contribution focuses on comparing
and analyzing surveyed solutions according eight prime criteria, which we have defined before. This
comparison will be helpful to determine limits of existing discovery protocols and identify future research
opportunities in service discovery.
FUZZY-BASED ARCHITECTURE TO IMPLEMENT SERVICE SELECTION ADAPTATION STRATEGYijwscjournal
One of the main requirements in service based applications is runtime adaptation to changes that occur in
business, user, environment, and computational contexts. Changes in contexts lead to QOS degrade.
Continues adaptation mechanism and strategies are required to stay service based applications(SBA) in
safe state. In this paper a framework for runtime adaptation in service based application isintroduced. It
checks user requirements change continuously and dynamically adopts architecture model. Also it checks
providers QOS attributes continuously and if adaptation requirement is triggered, runs service selection
adaptation strategy to satisfy user preferences. Thusit is a context aware and automatically adaptable
framework for SBA applications. Wehave implemented a fuzzy based system for web service selection unit.
Due to ambiguity of context’s data and cross-cutting effects of quality of services, using fuzzy would result
an optimised decision. Finally we illustrated that using of it has a good performance for web service based
applications.
WMNs: The Design and Analysis of Fair Schedulingiosrjce
IOSR Journal of Computer Engineering (IOSR-JCE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of computer engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in computer technology. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
FUZZY-BASED ARCHITECTURE TO IMPLEMENT SERVICE SELECTION ADAPTATION STRATEGYijwscjournal
One of the main requirements in service based applications is runtime adaptation to changes that occur in business, user, environment, and computational contexts. Changes in contexts lead to QOS degrade. Continues adaptation mechanism and strategies are required to stay service based applications(SBA) in safe state. In this paper a framework for runtime adaptation in service based application isintroduced. It checks user requirements change continuously and dynamically adopts architecture model. Also it checks providers QOS attributes continuously and if adaptation requirement is triggered, runs service selection adaptation strategy to satisfy user preferences. Thusit is a context aware and automatically adaptable
framework for SBA applications. Wehave implemented a fuzzy based system for web service selection unit. Due to ambiguity of context’s data and cross-cutting effects of quality of services, using fuzzy would result an optimised decision. Finally we illustrated that using of it has a good performance for web service based applications.
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology
World Wide Web is a huge repository of information and there is a tremendous increase in the volume of
information daily. The number of users are also increasing day by day. To reduce users browsing time lot
of research is taken place. Web Usage Mining is a type of web mining in which mining techniques are
applied in log data to extract the behaviour of users. Clustering plays an important role in a broad range
of applications like Web analysis, CRM, marketing, medical diagnostics, computational biology, and many
others. Clustering is the grouping of similar instances or objects. The key factor for clustering is some sort
of measure that can determine whether two objects are similar or dissimilar. In this paper a novel
clustering method to partition user sessions into accurate clusters is discussed. The accuracy and various
performance measures of the proposed algorithm shows that the proposed method is a better method for
web log mining.
THE DEVELOPMENT AND STUDY OF THE METHODS AND ALGORITHMS FOR THE CLASSIFICATIO...IJCNCJournal
This paper represents the results of the research, which have allowed us to develop a hybrid
approach to the processing, classification, and control of traffic routes. The approach enables to
identify traffic flows in the virtual data center in real-time systems. Our solution is based on the
methods of data mining and machine learning, which enable to classify traffic more accurately
according to more criteria and parameters. As a practical result, the paper represents the
algorithmic solution of the classification of the traffic flows of cloud applications and services
embodied in a module for the controller of the software-defined network. This solution enables to
increase the efficiency of handling user requests to cloud applications and reduce the response
time, which has a positive effect on the quality of service in the network of the virtual data center
Service-oriented computing is meant to support loose relationships between organizations; Serviceoriented
architectures often have the goal to integrate various distributed services of one or more
organizations in a flexible way to be able to quickly react on business changes.
Distributed services provided a new way of distributed computing that achieve the interoperability between
heterogonous application through platform and language independent interfaces. The creation of value
added services by composition of existing ones is gaining a significant momentum. Distributed service
composition is meant to support loose relationships between implemented services in order to provide new
functions. A composite service is the one resulting from the integration, coordination and synchronization
of different service components. In this paper, we generated A Services Composition Model (SCM) that
provides a general solution for the services composition problem by realizing the requirements of a new
service using the requirements of the already existing service. We explained in details all the steps of the
composition process; services registration, services discovery, services selection, services invoking, and
services integration. Although the SCM is not bounded to one particular algorithm to compose services, we
generated an application as an example to test our Service Composition Model.
We also generated the Services Composition Language (SCL) as a simple text-based language which
allows the user to express the requirements of his request, the inserted request will then be analyzed using
our Parsing Algorithm to determine the name of the requested services, after that our Service Composition
Algorithm will execute all the steps of the composition process and return the result of the composition to
the user.
Cloud service ranking with an integration of k-means algorithm and decision-m...IJECEIAES
The present research focuses on ranking cloud services by using the k-means algorithm with multi-criteria decision-making (MCDM) approaches that are the prime factor in the decision-making process and have been used to choose cloud services. The tools offered by MCDM can solve almost any decision-making problem. When faced with a selection challenge in the cloud environment, the trusted party would need to weigh the client’s choice against a predetermined list of criteria. There is a wide range of approaches to evaluating the quality of cloud services. The deep learning model has been considered a branch of artificial intelligence that assesses datasets to perform training and testing and makes decisions accordingly. This paper presents a concise overview of MCDM approaches and discusses some of the most commonly used MCDM methods. Also, a model based on deep learning with the k-means algorithm based decision-making trial and evaluation laboratory (kDE-MATEL) and analytic network process (ANP) is proposed as k-means algorithm based decision-making trial and evaluation laboratory with analytic network process (kD-ANP) for selecting cloud services. The proposed model uses the k-means algorithm and gives different levels of priority and weight to a set of criteria. A traditional model is also compared with a proposed model to reflect the efficiency of the proposed approach.
Implementing sharing platform based on ontology using a sequential recommende...IJECEIAES
While recommender systems have shown success in many fields, accurate recommendations in industrial settings remain challenging. In maintenance, existing techniques often struggle with the “cold start” problem and fail to consider differences in the target population's characteristics. To address this, additional user information can be incorporated into the recommendation process. This paper proposes a recommender system for recommending repair actions to technicians based on an ontology (knowledge base) and a sequential model. The approach utilizes two ontologies, one representing failure knowledge and the other representing asset attributes. The proposed method involves two steps: i) calculating score similarity based on ontology domain knowledge to make predictions for targeted failures and ii) generating Top-N repair actions through collaborative filtering recommendations for targeted failures. An additional module was implemented to evaluate the recommender system, and results showed improved performance.
Generating a custom Ruby SDK for your web service or Rails API using Smithyg2nightmarescribd
Have you ever wanted a Ruby client API to communicate with your web service? Smithy is a protocol-agnostic language for defining services and SDKs. Smithy Ruby is an implementation of Smithy that generates a Ruby SDK using a Smithy model. In this talk, we will explore Smithy and Smithy Ruby to learn how to generate custom feature-rich SDKs that can communicate with any web service, such as a Rails JSON API.
Essentials of Automations: Optimizing FME Workflows with ParametersSafe Software
Are you looking to streamline your workflows and boost your projects’ efficiency? Do you find yourself searching for ways to add flexibility and control over your FME workflows? If so, you’re in the right place.
Join us for an insightful dive into the world of FME parameters, a critical element in optimizing workflow efficiency. This webinar marks the beginning of our three-part “Essentials of Automation” series. This first webinar is designed to equip you with the knowledge and skills to utilize parameters effectively: enhancing the flexibility, maintainability, and user control of your FME projects.
Here’s what you’ll gain:
- Essentials of FME Parameters: Understand the pivotal role of parameters, including Reader/Writer, Transformer, User, and FME Flow categories. Discover how they are the key to unlocking automation and optimization within your workflows.
- Practical Applications in FME Form: Delve into key user parameter types including choice, connections, and file URLs. Allow users to control how a workflow runs, making your workflows more reusable. Learn to import values and deliver the best user experience for your workflows while enhancing accuracy.
- Optimization Strategies in FME Flow: Explore the creation and strategic deployment of parameters in FME Flow, including the use of deployment and geometry parameters, to maximize workflow efficiency.
- Pro Tips for Success: Gain insights on parameterizing connections and leveraging new features like Conditional Visibility for clarity and simplicity.
We’ll wrap up with a glimpse into future webinars, followed by a Q&A session to address your specific questions surrounding this topic.
Don’t miss this opportunity to elevate your FME expertise and drive your projects to new heights of efficiency.
Transcript: Selling digital books in 2024: Insights from industry leaders - T...BookNet Canada
The publishing industry has been selling digital audiobooks and ebooks for over a decade and has found its groove. What’s changed? What has stayed the same? Where do we go from here? Join a group of leading sales peers from across the industry for a conversation about the lessons learned since the popularization of digital books, best practices, digital book supply chain management, and more.
Link to video recording: https://bnctechforum.ca/sessions/selling-digital-books-in-2024-insights-from-industry-leaders/
Presented by BookNet Canada on May 28, 2024, with support from the Department of Canadian Heritage.
GDG Cloud Southlake #33: Boule & Rebala: Effective AppSec in SDLC using Deplo...James Anderson
Effective Application Security in Software Delivery lifecycle using Deployment Firewall and DBOM
The modern software delivery process (or the CI/CD process) includes many tools, distributed teams, open-source code, and cloud platforms. Constant focus on speed to release software to market, along with the traditional slow and manual security checks has caused gaps in continuous security as an important piece in the software supply chain. Today organizations feel more susceptible to external and internal cyber threats due to the vast attack surface in their applications supply chain and the lack of end-to-end governance and risk management.
The software team must secure its software delivery process to avoid vulnerability and security breaches. This needs to be achieved with existing tool chains and without extensive rework of the delivery processes. This talk will present strategies and techniques for providing visibility into the true risk of the existing vulnerabilities, preventing the introduction of security issues in the software, resolving vulnerabilities in production environments quickly, and capturing the deployment bill of materials (DBOM).
Speakers:
Bob Boule
Robert Boule is a technology enthusiast with PASSION for technology and making things work along with a knack for helping others understand how things work. He comes with around 20 years of solution engineering experience in application security, software continuous delivery, and SaaS platforms. He is known for his dynamic presentations in CI/CD and application security integrated in software delivery lifecycle.
Gopinath Rebala
Gopinath Rebala is the CTO of OpsMx, where he has overall responsibility for the machine learning and data processing architectures for Secure Software Delivery. Gopi also has a strong connection with our customers, leading design and architecture for strategic implementations. Gopi is a frequent speaker and well-known leader in continuous delivery and integrating security into software delivery.
Connector Corner: Automate dynamic content and events by pushing a buttonDianaGray10
Here is something new! In our next Connector Corner webinar, we will demonstrate how you can use a single workflow to:
Create a campaign using Mailchimp with merge tags/fields
Send an interactive Slack channel message (using buttons)
Have the message received by managers and peers along with a test email for review
But there’s more:
In a second workflow supporting the same use case, you’ll see:
Your campaign sent to target colleagues for approval
If the “Approve” button is clicked, a Jira/Zendesk ticket is created for the marketing design team
But—if the “Reject” button is pushed, colleagues will be alerted via Slack message
Join us to learn more about this new, human-in-the-loop capability, brought to you by Integration Service connectors.
And...
Speakers:
Akshay Agnihotri, Product Manager
Charlie Greenberg, Host
Encryption in Microsoft 365 - ExpertsLive Netherlands 2024Albert Hoitingh
In this session I delve into the encryption technology used in Microsoft 365 and Microsoft Purview. Including the concepts of Customer Key and Double Key Encryption.
The Art of the Pitch: WordPress Relationships and SalesLaura Byrne
Clients don’t know what they don’t know. What web solutions are right for them? How does WordPress come into the picture? How do you make sure you understand scope and timeline? What do you do if sometime changes?
All these questions and more will be explored as we talk about matching clients’ needs with what your agency offers without pulling teeth or pulling your hair out. Practical tips, and strategies for successful relationship building that leads to closing the deal.
Builder.ai Founder Sachin Dev Duggal's Strategic Approach to Create an Innova...Ramesh Iyer
In today's fast-changing business world, Companies that adapt and embrace new ideas often need help to keep up with the competition. However, fostering a culture of innovation takes much work. It takes vision, leadership and willingness to take risks in the right proportion. Sachin Dev Duggal, co-founder of Builder.ai, has perfected the art of this balance, creating a company culture where creativity and growth are nurtured at each stage.
Key Trends Shaping the Future of Infrastructure.pdfCheryl Hung
Keynote at DIGIT West Expo, Glasgow on 29 May 2024.
Cheryl Hung, ochery.com
Sr Director, Infrastructure Ecosystem, Arm.
The key trends across hardware, cloud and open-source; exploring how these areas are likely to mature and develop over the short and long-term, and then considering how organisations can position themselves to adapt and thrive.
Assuring Contact Center Experiences for Your Customers With ThousandEyes
A HEURISTIC APPROACH FOR WEB-SERVICE DISCOVERY AND SELECTION
1. International Journal of Computer Science & Information Technology (IJCSIT) Vol 5, No 2, April 2013
DOI : 10.5121/ijcsit.2013.5210 107
A HEURISTIC APPROACH FOR WEB-SERVICE
DISCOVERY AND SELECTION
Achraf Karray1
, Rym Teyeb2
and Maher Ben Jemaa3
1
College of Computer Sciences and Information Systems, Najran University, KSA
achraf.karray@gmail.com
2
Higher Institute of the Technological Studies of Tataouine, Tunisia
rim_teyeb@yahoo.fr
3
National School of Engineers of Sfax, Tunisia
maher.benjemaa@enis.rnu.tn
ABSTRACT
In today’s businesses, service-oriented architectures represent the main paradigm for IT infrastructures.
Indeed, the emergence of Internet made it possible to set up an exploitable environment to distribute appli-
cations on a large scale, and this, by adapting the notion of “service”. With the integration of this para-
digm in Business to Business Domain (B2B), the number of web services becomes very significant. Due to
this increase, the discovery and selection of web services meeting customer requirement become a very
difficult operation. Further, QoS properties must be taking into account in the web service selection. More-
over, with the significant number of web service, necessary time for the discovery of a service will be rather
long. In this paper, we propose an approach based on a new heuristic method called “Bees Algorithm”
inspired from honey bees behavior. We use this technique of optimization in order to discover appropriate
web services, meeting customer requirements, in least time and taking into account the QoS properties.
KEYWORDS
Web service discovery and selection; Bees algorithm; peer-to-peer environment; distributed architecture;
quality of service (QoS)
1. INTRODUCTION
Web service can be defined as a software entity, independent of platforms, able to be described,
published, discovered and composed using the standardized protocols [1, 14, 15, 16]. It is used in
various domains such as business to business domain and web-based systems that’s why the
number of web service’s consumer is increasing.
The discovery of web services represents the process allowing the localization of documents de-
scribing a Web service (WSDL file [14]). However, with the permanent increase in the number of
web services and registries, the operations of discovery and selection become difficult.
The web service discovery and selection are a primordial steps in the service-oriented architec-
tures. In fact, a customer might find several services that provide the same functionality, but can
be different in QoS properties. Thus, it is essential to adopt an optimization strategy in order to
select the best services.
2. International Journal of Computer Science & Information Technology (IJCSIT) Vol 5, No 2, April 2013
108
The classical mechanisms of web service discovery are based on the sweeping of all available
registries to respond to a client request. With the increase number of services web, these methods
are no longer relevant because the discovery time becomes considerable. To get around this prob-
lem, innovative techniques of discovery are required. We present in this paper a novel method for
discovery and selection of web services based on a genetic algorithm, the bees’ algorithm.
This paper is organized as follow. The second section presents related works. In section three, we
give an overview of genetic algorithms. Then, we describe the Bees Algorithm in section four.
Section five shows the details of the utilization of the Bees Algorithm in the context of web-
service discovery and selection. In section six, we present a validation for our approach by im-
plementing it in a P2P (Peer-to-Peer) environment. And, we conclude our paper in section seven.
2. RELATED WORKS
Discovery is one of the major challenges of the web service technology [22]. Service discovery is
the process of finding an appropriate service for a service requestor. The basic steps of this proc-
ess, shown by figure 1, are:
• Service description: Providers describe their services.
• Service publishing: Services are classified; and their descriptions are published through registries.
• Service discovery: Requestors ask some registries if there are providers offering services with desired
capabilities (Description of Requestor’s Needs). The subset of the stored descriptions, which match with
the customer’ request, is returned to the customer (requestor).
Figure 1. The Web Service Interaction model
The description of web service capabilities is essential for classifying, discovering and using a
service. Indeed, service requestors invoke services based upon the discovered service descrip-
tions. Based on the information contained in description files, we distinguish two categories of
discovery:
• Syntactic Discovery: The discovery process focus on the implementation aspects of a service
and thus tailored towards the programmers’ requirements. Syntactic discovery can be classified
according to the adopted architecture :
- Centralized architecture: In centralized architecture, description files are kept in the same di-
rectory.
- Distributed (or decentralized) architecture: In this type of architecture, description files are
distributed in different servers. Approaches as distributed UDDI [24] and AASDU [25]
(Agent Approach for Service Discovery and Utilization), adopt this architecture.
3. International Journal of Computer Science & Information Technology (IJCSIT) Vol 5, No 2, April 2013
109
• Semantic discovery: The discovery process focus on the conceptual aspects of a service aim-
ing to facilitate end-users by shielding off the lower level technical details. Semantic discovery
can be classified according to the adopted architecture :
- Centralized architecture: In centralized architecture, description files are kept in the same di-
rectory. Approaches as Ontology Web Language-Service [26] and WSDA [27] (Web Servic-
es Discovery Architecture) implement this architecture.
- Distributed (or decentralized) architecture: In this type of architecture, description files are
distributed in different servers. Approaches as Speed-R [28] (Semantic P2P Environment for
Diverse web service Registries), PSWSD [29] (P2P-based Semantic Web Service Discovery)
and LARKS [23] (Language for Advertisement and Request for Knowledge Sharing) adopt a
distributed architecture.
The different approaches cited in this section implement a sequential algorithm for set up discov-
ery process. We propose in this paper a method based on a genetic method, the bees algorithm, to
find and select appropriate services that matches with the service’ requestor. The Application of
“Bees Algorithm” in different problems gave excellent results (see section 4.2), so we have had
the idea to use this technique of optimization in order to discover and select appropriate web ser-
vices by taking into account the QoS properties.
3. GENETIC ALGORITHMS
3.1 Overview
Genetic Algorithms (GA) are part of the Evolutionary Algorithms which are adaptive heuristic
methods that exploit ideas of natural selection and biological evolution (such as reproduction,
mutation and recombination). In general, evolutionary algorithms implement a same main loop
including the following steps (listing 1).
1. Initialize and evaluate the initial population.
2. Perform competitive selection.
3. Apply genetic operators to generate new solutions.
4. Evaluate solutions in the population.
5. Start again from point 2 and repeat until some convergence criteria is satisfied.
Listing 1. Structure of an evolutionary algorithm
Genetic algorithms find application in bio-informatics, phylogenetic, computational science, en-
gineering, economics, chemistry, manufacturing, mathematics, physics and other fields. There are
various flavours of GAs in circulation, varying in implementation of these three parameters, but
in essence the algorithms all follow a standard procedure. They all share a common conceptual
base of simulating the 'evolution' of individual structures via processes of selection, mutation and
reproduction. Once the genetic representation and the fitness function are defined, a GA proceeds
to initialize a population of solutions (usually randomly) and then to improve it through repetitive
application of the mutation, crossover, inversion and selection operators.
3.2 Different steps of a genetic algorithm
Genetic algorithms are essentially useful to resolve search or optimisation problems. In such algo-
rithm, the computer-problem is described using computational models of evolutionary processes.
The evolution usually starts from a population of randomly generated individuals and happens in
generations. In each generation, the fitness of every individual in the population is evaluated,
4. International Journal of Computer Science & Information Technology (IJCSIT) Vol 5, No 2, April 2013
110
multiple individuals are stochastically selected from the current population (based on their fit-
ness), and modified (recombined and possibly randomly mutated) to form a new population. The
new population is then used in the next iteration of the algorithm. The algorithm terminates when
either a maximum number of generations has been produced, or a satisfactory fitness level has
been reached for the population. If the algorithm has terminated due to a maximum number of
generations, a satisfactory solution may or may not have been reached. Figure 2 shows the simpli-
fied flowchart of a Genetic Algorithm.
Figure 2. Simplified flow chart of a Genetic Algorithm
A typical genetic algorithm requires a fitness function to evaluate the solution domain. The fitness
function is defined over the genetic representation and measures the quality of the represented
solution and always depends of the computer-problem.
• Initialization: Many individual solutions are (usually) randomly generated to form an initial
population. The population size depends on the nature of the problem, but typically contains
several hundreds or thousands of possible solutions. Traditionally, the population is generated
randomly, allowing the entire range of possible solutions (the search space).
• Selection: During each successive generation, a proportion of the existing population is se-
lected to breed a new generation. Individual solutions are selected through a fitness-based
process, where fitter solutions (as measured by a fitness function) are typically more likely to
be selected.
• Reproduction: The next step is to generate a second generation population of solutions from
those selected through genetic operators: crossover (also called recombination), and/or muta-
tion. These processes ultimately result in the next generation population of solutions that is dif-
5. International Journal of Computer Science & Information Technology (IJCSIT) Vol 5, No 2, April 2013
111
ferent from the initial generation. Generally the average fitness will have increased by this pro-
cedure for the population.
• Termination: This generational process is repeated until a termination condition has been
reached. Common terminating conditions are :
- A solution is found that satisfies minimum criteria
- Fixed number of generations reached
- Allocated budget (computation time/money) reached
- The highest ranking solution's fitness is reaching or has reached a plateau such that
successive iterations no longer produce better results
- Manual inspection
- Combinations of the above
The simple generational genetic algorithm procedure is shown in Listing 2.
1- Choose the initial population of individuals
2- Evaluate the fitness of each individual in that population
3- Repeat on this generation until termination (time limit, sufficient fitness achieved, etc.):
3.1 Select the best-fit individuals for reproduction
3.2 Breed new individuals through crossover and mutation operations to give birth to offspring
3.3 Evaluate the individual fitness of new individuals
3.4 Replace least-fit population with new individuals
Listing 2: Pseudo code for genetic Algorithm
4. BEES ALGORITHM
When looking for a web service which can be an answer for customer’s request, the algorithm of
discovery and selection should choose from a wide range of services already developed. To re-
duce the time needed for Web services’ discovery, we will use a new optimization technique
called “Bees Algorithm”.
The Bees Algorithm represents a new optimization algorithm proposed by Pham and al [2]. It is
based on natural foraging behavior of honey bees. The algorithm is considered as one of the most
important optimization algorithms due to its successful results in various domains such as cluster-
ing problems [3], a resolution of preliminary design problem [4], and artificial neural network
training [6].
The foraging behavior of honey bees starts by sending scout bees to search for flower patches.
They move randomly from one flower to another. When they return to the hive, those scout bees
evaluate the various plots visited and sort them above certain quality threshold which can be
measured as a combination of some constituents such as sugar. They choose the (m) best flowers
and (e) top-rated patches.
Scout bees associated to select sites perform a dance called “waggle dance”. This dance repre-
sents a mean of communication in the colony. It provides three types of information: direction of
a flower patch, distance from the hive and a quality of nectar. This information helps the colony
to send its bees to collect nectar without the use of guide or maps.
More follower bees are sent to more promising patches in order to gather nectar efficiently and
quickly.
6. International Journal of Computer Science & Information Technology (IJCSIT) Vol 5, No 2, April 2013
112
4.1 The basic bees algorithm
The pseudo-code of this algorithm is shown in listing 3.
1. Initialise population with random solutions.
2. Evaluate fitness of the population.
3. While (stopping criterion not met)
//Forming a new population.
4. Select sites for neighborhood search.
5. Determine the patch size.
6. Recruit bees for selected sites and evaluate fitnesses.
7. Select the representative bee from each patch.
8. Amend the Pareto optimal set.
9. Abandon sites without new information.
10. Assign remaining bees to search randomly and evaluate their fitnesses.
11. End While.
Listing 3: Pseudo code for Bees Algorithm
The execution of this algorithm requires a number of parameters (figure 3) to be set namely:
number of scoot bees (n), number of patches selected for neighborhood research (m), number of
“elite” sites selected out of (m) patches (e), number of bees recruited for (m-e) selected sites (nsp)
and stopping criterion.
The algorithm begins with placement of (n) scoot bees, randomly, in the search space.
Figure 3. Required parameters for Bees Algorithm
4.2 Applications of “Bees Algorithm”
Different approaches use the Bees Algorithm for various problems. In their paper [6], authors
propose to apply Bees Algorithm to train RBF networks to control chart pattern recognition. In
this work, each bee represented 2345 parameters to be determinate.
In [3], authors use this algorithm to solve clustering problem. In order to partition a data set into
homogeneous groups, authors choose to apply the Bees Algorithm which is capable of finding
near optimal solution efficiently. A potential clustering solution as set of cluster centers is consi-
dered as a bee.
Another application of the bees’ algorithm, given in [7], consists to using the Bees Algorithm to
optimize parameters of a fuzzy logic controller. It turns parameters of input output membership
7. International Journal of Computer Science & Information Technology (IJCSIT) Vol 5, No 2, April 2013
113
functions. Therefore each bee was considered as a real number vector representing various para-
meters to optimize.
Authors of [8] adapted the Bees Algorithm to resolve cell formation problem. Cell formation
represents the key problem in designing manufacturing system. Its purpose is to group part with
similar processing requirements into part families and associate machines into machine cells. This
problem is considered as NP-hard problem because the increase in the problem size causes an
exponential increase in the time. In this work, authors use the Bees Algorithm to find the appro-
priate groups of part families and machine cells which maximize the bond energy metric.
In [9], authors use this algorithm for the Environmental/Economic (Power) Dispatch (EED) prob-
lem. In this problem, authors try to minimize, simultaneously, fuel cost and nitrogen oxides emis-
sion.
In [2], authors show that the Bees Algorithm is applicable to combinatorial and functional optimi-
zation problems. To test the efficacy of this algorithm, they used the inverted Schwefel’s function
with six dimensions.
5. OUR APPROACH
In this paper, we propose a new method which solves the problem of web service discovery. So
that, we use an architecture based on registries of web service, called also communities.
Web services’ registry represent a group of web services having the same area of interest and are
differentiated for each other according to their non functional properties (such security, time of
response…) in order to limit the space of research. Several approaches used the registry’s notion
such as in works presented on [5, 10, 11, 12].
The discovery process will be simplified and made more efficient by structuring service registries.
To find the optimal service which can be the response of client request, we use the “Bees Algo-
rithm” as an intelligent way of research. Our approach consists of three principals steps:
• Configuration of distributed environment with exploitation of peer-to- peer architecture; every
group of peer represents a registry of web services.
• Discovery of the suitable registry having the same business domain with the searched web ser-
vice. In this step, we use a method based on new population-based optimization algorithm
called “Bees algorithm”.
• Selection of the optimal web services present in discovered registry. The web service selected
has the level of QoS nearest to the value requested by the by the customer.
5.1 Architecture
Our architecture consists of:
• A layer for semantic clustering web services in registry. Each registry has its business domain
indicated in a description file.
The update and management of different registries are insured by a control module providing
functionality such as adding a new service in the appropriate community.
• A discovery and selection module: this module ensures discovery of a web service offering the
same functionalities searched by customer’s request and having the level of quality of service
required by the client.
8. International Journal of Computer Science & Information Technology (IJCSIT) Vol 5, No 2, April 2013
114
So it is used, in the first place, to find the registry which has the same category with the searched
web service, and to choose between different services web present in the registry. The selection is
based on level of quality of service.
5.2 Adaptation of bees algorithm for web service discovery
The proposed method exploits the capability of the Bees Algorithm to optimize the research pro-
cedure. To reduce research area and in order to find a desired web service in the shortest period,
we use this technique. As analogies with the basic Bees Algorithm, we consider distributed regi-
stries as a patch and discovery query as a bees.
Figure 4 below summarizes the flow of proposed method. Our proposed algorithm based on
“Bees Algorithm” consists of six steps.
• Step1: random exploration
In this step, the algorithm sends discovery queries in parallel way to different registries con-
taining groups of web services. The choice of registries at this stage is randomly.
• Step2: measure of similarity
Step 2 of the algorithm consists to measure the degree of similarity between business domain
of wanted web service (searched by a customer) and visited registries. For each registry, a
value of fitness function is attributed which indicates the degree of semantic similarity. In a
technical way, we use measures of WordNet::Similarity [13] which represents free software
that measures the similarity between two terms.
• Step3 and step4: Sorting and selection of suitable registry
- In step 3, the algorithm sorts visited registries according to similarity’s degree collected
from the second step.
- In step 4, a registry having the highest value is selected as “elite” registry.
• Step5: exploration of “elite” registry’s neighbourhood
In order to explore the neighbourhood of “elite” registry, the algorithm sends research queries
to registries resulted from step 4.
Stopping criterion is to obtain maximal similarity between two areas of interests: area of
searched web service and the selected registry.
• Step 6: selection of the service providing the required QoS
The computation of QoS is done according the formula proposed in [17]. This method deter-
mines QoS value based on weights assigned by the service requester. We select the service
whose its level QoS corresponds to the value required by the client.
9. International Journal of Computer Science & Information Technology (IJCSIT) Vol 5, No 2, April 2013
115
Figure 4. Flowchart for proposed method
6. VALIDATION
To validate our approach, we used the JXTA [18] platform, a P2P environment; JDOM [19], an
API for XML documents, and WordNet::Similiraty [13] for the similarly between web services.
JXTA: it is an open source peer-to-peer protocol specification begun by Sun Microsystems in
2001. This platform allows creating a virtual overlay network. In this virtual network, a given
peer could interact with other peers even when some of the peers (or resources) are behind fire-
walls (or NATs: Network addresses translation), or use different network transports. In JXTA
platform, each resource is identified by a unique ID, so that a peer can change its localization
address while keeping a constant identification number.
JXTA platform provides moreover basics services, such as:
- Dynamic search of peers;
- Resources sharing (documents, files, ...) ;
- Creation of groups;
- Secure communication;
- Process Collaboration;
- Private addressing;
- etc …
10. International Journal of Computer Science & Information Technology (IJCSIT) Vol 5, No 2, April 2013
116
The JXTA protocols are defined as a set of XML messages which allow any device connected to
a network to exchange messages and collaborate independently of the underlying network topol-
ogy. In fact, JXTA is based upon a set of protocols and standard (such TCP/IP, HTTP, etc.) which
are developed in XML language, so that it can be implemented in any programming language and
remain independent vis-à-vis any operating system and transport layer protocols. An overview of
the JXTA architecture is given in figure 5.
Figure 5. The JXTA architecture
JXTA is an extensible platform which facilitates its adaptation to achieve APIs. This aspect ad-
dresses the needs and expectations of developers. JXTA provides some services and notions
which are very useful for the implementation of our approach. Among these notions, we find the
“announcements” notion that allows us to describe each directory. Moreover, the notion of “peer
group”, provided by JXTA, is appropriate for our approach to gather directories according their
business areas. Also, JXTA incorporates a set of services, as the discovery service, which is based
on XML, so that it is easy to adapt these services for our needs.
For all these reasons we opted to use the JXTA platform for implement our approach.
The second tool that we used is JDOM. It is an API provided by W3C allowing modeling and
manipulation of XML documents. We use this API essentially to extract, easily, information and
data contained in the description files of directory and web-service writing in the XML language.
The last tool which we used is WordNET. We use this tool to find the service that matches the
user request. For calculate the degree of similarity between the web-service1
and the different
available directories we use the WU and Palmer method [21]. The choice of this method is done
after a series of comparison between the different techniques of similarity measure used by
WordNet. The advantage of WU and Palmer technique it is simpler and more efficient to
calculate the similarity degree compared to the other methods.
To validate our approach, we applied the algorithm of discovery and selection (described in
section 3) in the case of web service failure. We assume that a given service is failed, and we try
to find an equivalent service, in the least delay, while taking in account the properties of QoS
(non-functional attributes) such as performance, security, etc. By hypothesis, web services are
1
This service can be published by a provider, or requested by a client.
11. International Journal of Computer Science & Information Technology (IJCSIT) Vol 5, No 2, April 2013
117
grouped in different communities. Each community contains equivalent web services (in terms of
functional), but that can be differ in their QoS properties.
The implemented architecture consists of three main components:
• Communities layer: web services are grouped in different communities according to their
functionality. Each community is defined by a description file (in XML format), which
specifies the business area of the community and the list of web services belonging of this
community. A web service is described by its name, its unique identifier, its URL and its
QoS attributes.
• Substitution module: this module is triggered after a Web service failure. Its function is to
find a service providing the same functionalities of the failed service, and having good QoS
proprieties. First, the substitution module identifies the community of failed service, and
then selects, from the services present in the community, the service providing the QoS
required by the client. Finally, the substitution module must add the couple, failed service-
equivalent service, in the equivalence cache.
• Equivalence cache: it represents a database containing equivalent services. After a service
failure, the module of substitution queries the cache to find an entry for the failed service. If
this is the case, it extracts and uses the corresponding equivalent service. Thus, the search
process can be faster if the couple (failed web service – equivalent web service) exists in
the cache. Each entry in the cache is valid for a determined period. After expiration of this
period, this entry is removed to avoid overloading the database.
Figure 6 describes interactions between different components of our architecture. Once a web ser-
vice is failed, the substitution module queries the database (cache equivalence) to search an entry
for the failed service (step1). Any entry is present in the cache for the queried service (step2). We
note here that if there is an entry for the failed service in the database, the next step is not
necessary. The substitution module uses the service equivalent to the failed service found in the
cache. As the required service is not found, the substitution module selects an equivalent service
from the communities (step 3), and finally adds the couple (failed service-equivalent service) in
the cache (step 4).
Figure 6. Interactions between components of our architecture
12. International Journal of Computer Science & Information Technology (IJCSIT) Vol 5, No 2, April 2013
118
7. CONCLUSION
In this paper, we present an innovative method for web service discovery and selection based on
heuristic technique called “Bees Algorithm”. We validated our approach by implementing it in a
P2P environment.
Our approach is based on two important stages. The first consists to find a registry having the
same/equivalent business domain of the searched service whilst minimizing the cost of the dis-
covery phase. The second stage consists to calculate the level of QoS of all services present in
found registry and select the service having the QoS level nearest to the value requested by the
client.
REFERENCES
[1] W3C, Web Services Architecture. http://www.w3.org/TR/ws-arch/.
[2] D. Pham, A. Ghanbarzadeh, E. Koc, S. Otri and M. Zaidi. “The Bees Algorithm – A Novel Tool for
Complex Optimisation Problems”. In the second Virtual International Conference on Intelligent Pro-
duction Machines and Systems IPROMS, 2006.
[3] D. Pham, S. Otri, A. Afify, M. Mahmuddin and H. Al-Jabbouli. “Data Clustering Using the Bees
Algorithm”. In the proceedings of the 40th CIRP International Manufacturing Systems Seminar,
2007.
[4] D. Pham, M. Castellani and A. Ghanbarzadeh. “Preliminary design using the Bees Algorithm”. In the
proceedings of the 8th International Conference on Laser Metrology, CMM and Machine Tool Per-
formance, LAMDAMAP, 2007.
[5] Shuping Ran. “A framework for discovering Web services with desired quality of services attributes”.
CSREA Press In Proc. Conf. on Web Services, 2008.
[6] D. Pham, A. Ghanbarzadeh, E. Koc and S. Otri. “Application of the Bees Algorithm to the training of
Radial Basis Function Networks for control chart pattern recognition”. In the proceedings of the 5th
CIRP International Seminar on Intelligent Computation in Manufacturing En-gineering, 2006.
[7] D. Pham, A. Haj-Darwish, E. Eldukhri and S. Otri. “Using the Bees Algorithm to tune a fuzzy logic
controller for a robot gymnast”. In the proceedings of the 1stInternational Conference on In-novative
Production machines and Systems, 2007.
[8] D. Pham, A. Afify and E. Koc. “Manufacturing cell formation using the Bees Algorithm”. In the pro-
ceedings of the 1st International Conference on Innovative Production machines and Systems, 2007.
[9] D. Pham, J.Y Lee, A. Haj-Darwish and A.J. Soroka. “Multi-objective Environmental/Economic Pow-
er Dispatch using the Bees Algorithm with Pareto optimality”. In the proceedings of the 3th Interna-
tional Conference on Innovative Production machines and Systems, 2009.
[10] M. Sellami, S, Tata and B. Defude. “Service discovery inubiquitous environments: Approaches and
requirements for context-awareness”. In the proceedings of the 6th International Conference on the
Business Process Management, BPM ’08, 2008.
[11] K. Sivashanmugam, K. Verma and A. Sheth. “Discovery of web services in a federated registry envi-
ronment”. In the proceedings of the 2004 IEEE International Conference on Web Services (ICWS
2004), 2004.
[12] B, Xu and D. Chen. “Semantic web services discovery in P2P environment”. In the proceedings of
2007 International Conference on Parallel Processing Workshops (ICPPW 2007), 2007.
[13] Ted Pedersen. “WordNet::Similarity”. http://wn-similarity.sourceforge.net/.
[14] W3C. “Web Services Description Language (WSDL) 1.1”. http://www.w3.org/TR/wsdl.
[15] H. Hugo and B. Allen. “UDDI Spec Technical Committee Draft”. http://www.oasis-
open.org/committees/uddi- spec/doc/tcspecs.htm#uddiv3.
[16] W3C. “Simple Object Access Protocol (SOAP) 1.1”. http://www.w3.org/TR/2000/NOTE-SOAP-
20000508/.
[17] Ricardo Rosero. “Discovery and Selection of Web Services for application Melusine”. Master's The-
sis, Joseph Fourrier University, Suisse, September 2004.
13. International Journal of Computer Science & Information Technology (IJCSIT) Vol 5, No 2, April 2013
119
[18] G. Lo Presti. “Peer-to-Peer architectures in Distributed Data Management Systems for large hadron
collider experiments”. PhD thesis, Palermo University, December 2004.
[19] JDOM. http://www.jdom.org/
[20] About WordNet website. wordnet.princeton.edu/
[21] Zhibiao Wu and Martha Palmer. “Verb semantics and lexical selection”. In the Proceedings of the
32nd Annual Meeting of the Association for Computational Linguistics, 1994.
[22] A. Tsalgatidou and T. Pilioura. “An Overview of Standards and Related Technology in Web Servic-
es”. In the International Journal of Distributed and Parallel Databases, Special Issue on E-Services,
12(2), Kluwer, Sep 2002, 135-162.
[23] K. Sycara, S. Widoff, M. Klusch and J. Lu. “Larks: Dynamic matchmaking among heterogene-ous
software agent in cyberspace”. In the Publications of Autonomous Agents and Multi-Agent Systems,
2002.
[24] Pornpong Rompothong and Twittie Senivongse. “A query federation of UDDI registries”. In the Pro-
ceedings of the 1st International Symposium on Information and communication technologies ISICT
’03: pages 561–566. Trinity College Dublin, 2003.
[25] Paul Palathingal and Sandeep Chandra. “Agent Approach for Service Discovery and Utiliza-tion”. In
Hawaii International Conference on System Sciences (HICSS), 2004.
[26] Naveen Srinivasan, Massimo Paolucci, and Katia Sycara. “An efficient algorithm for OWL-S based
semantic search in UDDI”. In the Proceedings of the Semantic Web Services and Web Process Com-
position SWSWPC, 2004.
[27] Hoschek Wolfgang. “The Web Service Discovery Architecture”. In the Proceedings of the Int'l.
IEEE/ACM Supercomputing Conference (SC 2002), Baltimore, USA, November 2002. IEEE Com-
puter Society Press.
[28] Kaarthik Sivashanmugam, Kunal Verma, Ranjit Mulye and Zhenyu Zhong. “Speed-R: Semantic P2P
Environment for diverse Web Services Registries”.
http://webster.cs.uga.edu/~mulye/SemEnt/final.html
[29] Le-Hung Vu, Manfred Hauswirth, and Karl Aberer. “Towards P2P-based semantic web service dis-
covery with QoS support”. In the proceedings of 3th International Conference of Business Process
Management, 2005.