698 research outputs found
An Integrated Semantic Web Service Discovery and Composition Framework
In this paper we present a theoretical analysis of graph-based service
composition in terms of its dependency with service discovery. Driven by this
analysis we define a composition framework by means of integration with
fine-grained I/O service discovery that enables the generation of a graph-based
composition which contains the set of services that are semantically relevant
for an input-output request. The proposed framework also includes an optimal
composition search algorithm to extract the best composition from the graph
minimising the length and the number of services, and different graph
optimisations to improve the scalability of the system. A practical
implementation used for the empirical analysis is also provided. This analysis
proves the scalability and flexibility of our proposal and provides insights on
how integrated composition systems can be designed in order to achieve good
performance in real scenarios for the Web.Comment: Accepted to appear in IEEE Transactions on Services Computing 201
Handling Data-Based Concurrency in Context-Aware Service Protocols
Dependency analysis is a technique to identify and determine data
dependencies between service protocols. Protocols evolving concurrently in the
service composition need to impose an order in their execution if there exist
data dependencies. In this work, we describe a model to formalise context-aware
service protocols. We also present a composition language to handle dynamically
the concurrent execution of protocols. This language addresses data dependency
issues among several protocols concurrently executed on the same user device,
using mechanisms based on data semantic matching. Our approach aims at
assisting the user in establishing priorities between these dependencies,
avoiding the occurrence of deadlock situations. Nevertheless, this process is
error-prone, since it requires human intervention. Therefore, we also propose
verification techniques to automatically detect possible inconsistencies
specified by the user while building the data dependency set. Our approach is
supported by a prototype tool we have implemented.Comment: In Proceedings FOCLASA 2010, arXiv:1007.499
Recommended from our members
An intelligent framework for dynamic web services composition in the semantic web
As Web services are being increasingly adopted as the distributed computing technology of choice to securely publish application services beyond the firewall, the importance of composing them to create new, value-added service, is increasing. Thus far, the most successful practical approach to Web services composition, largely endorsed by the industry falls under the static composition category where the service selection and flow management are done a priori and manually. The second approach to web-services composition aspires to achieve more dynamic composition by semantically describing the process model of Web services and thus making it comprehensible to reasoning engines or software agents. The practical implementation of the dynamic composition approach is still in its infancy and many complex problems need to be resolved before it can be adopted outside the research communities.
The investigation of automatic discovery and composition of Web services in this thesis resulted in the development of the eXtended Semantic Case Based Reasoner (XSCBR), which utilizes semantic web and AI methodology of Case Based Reasoning (CBR). Our framework uses OWL semantic descriptions extensively for implementing both the matchmaking profiles of the Web services and the components of the CBR engine.
In this research, we have introduced the concept of runtime behaviour of services and consideration of that in Web services selection. The runtime behaviour of a service is a result of service execution and how the service will behave under different circumstances, which is difficult to presume prior to service execution. Moreover, we demonstrate that the accuracy of automatic matchmaking of Web services can be further improved by taking into account the adequacy of past matchmaking experiences for the requested task. Our XSCBR framework allows annotating such runtime experiences in terms of storing execution values of non-functional Web services parameters such as availability and response time into a case library. The XSCBR algorithm for matchmaking and discovery considers such stored Web services execution experiences to determine the adequacy of services for a particular task.
We further extended our fundamental discovery and matchmaking algorithm to cater for web services composition. An intensive knowledge-based substitution approach was proposed to adapt the candidate service experiences to the requested solution before suggesting more complex and computationally taxing AI-based planning-based transformations. The inconsistency problem that occurs while adapting existing service composition solutions is addressed with a novel methodology based on Constraint Satisfaction Problem (CSP).
From the outset, we adopted a pragmatic approach that focused on delivering an automated Web services discovery and composition solution with the minimum possible involvement of all composition participants: the service provider, the requestor and the service composer. The qualitative evaluation of the framework and the composition tools, together with the performance study of the XSCBR framework has verified that we were successful in achieving our goal
A graph-based framework for optimal semantic web service composition
Web services are self-described, loosely coupled software components that are network-accessible
through standardized web protocols, whose characteristics are described in XML. One of the key
promises of Web services is to provide better interoperability and to enable a faster integration
between systems. In order to generate robust service oriented architectures, automatic composition
algorithms are required in order to combine the functionality of many single services into composite
services that are able to respond to demanding user requests, even when there is no single service
capable of performing such task. Service composition consists of a combination of single services
into composite services that are executed in sequence or in a different order, imposed by a set of
control constructions that can be specified using standard languages such as OWL-s or BPEL4WS.
In the last years several papers have dealt with composition of web services. Some approaches treat
the service composition as a planning problem, where a sequence of actions lead from a initial state
to a goal state. However, most of these proposals have some drawbacks: high complexity, high
computational cost and inability to maximize the parallel execution of web services. Other
approaches consider the problem as a graph search problem, where search algorithms are applied
over a web service dependency graph in order to find a solution for a particular request. These
proposals are simpler than their counterparts and also many can exploit the parallel execution of
web services. However, most of these approaches rely on very complex dependency graphs that
have not been optimized to remove data redundancy, which may negatively affect the overall
performance and scalability of these techniques in large service registries. Therefore, it is necessary
to identify, characterize and optimize the different tasks involved in the automatic service
composition process in order to develop better strategies to efficiently obtain optimal solutions. The
main goal of this dissertation is to develop a graph-based framework for automatic service
composition that generate optimal input-output based compositions not only in terms of complexity
of the solutions, but also in terms of overall quality of service solutions. More specifically, the
objectives of this thesis are: (1) Analysis of the characteristics of services and compositions. The
aim of this objective is to characterize and identify the main steps that are part for the service
composition process. (2) Framework for automatic graph-based composition. This objective will
focus on developing a framework that enables the efficient input-output based service composition,
exploring the integration with other tasks that are part of the composition process, such as service
discovery. (3) Development of optimal algorithms for automatic service composition. This objective
focuses on the development of a set of algorithms and optimization techniques for the generation of
optimal compositions, optimizing the complexity of the solutions and the overall Quality-of-
Service. (4) Validation of the algorithms with standard datasets so they can be compared with other
proposals
The Prom Problem: Fair and Privacy-Enhanced Matchmaking with Identity Linked Wishes
In the Prom Problem (TPP), Alice wishes to attend a school dance with Bob and needs a risk-free, privacy preserving way to find out whether Bob shares that same wish. If not, no one should know that she inquired about it, not even Bob. TPP represents a special class of matchmaking challenges, augmenting the properties of privacy-enhanced matchmaking, further requiring fairness and support for identity linked wishes (ILW) – wishes involving specific identities that are only valid if all involved parties have those same wishes.
The Horne-Nair (HN) protocol was proposed as a solution to TPP along with a sample pseudo-code embodiment leveraging an untrusted matchmaker. Neither identities nor pseudo-identities are included in any messages or stored in the matchmaker’s database. Privacy relevant data stay within user control. A security analysis and proof-of-concept implementation validated the approach, fairness was quantified, and a feasibility analysis demonstrated practicality in real-world networks and systems, thereby bounding risk prior to incurring the full costs of development.
The SecretMatchâ„¢ Prom app leverages one embodiment of the patented HN protocol to achieve privacy-enhanced and fair matchmaking with ILW. The endeavor led to practical lessons learned and recommendations for privacy engineering in an era of rapidly evolving privacy legislation. Next steps include design of SecretMatchâ„¢ apps for contexts like voting negotiations in legislative bodies and executive recruiting. The roadmap toward a quantum resistant SecretMatchâ„¢ began with design of a Hybrid Post-Quantum Horne-Nair (HPQHN) protocol. Future directions include enhancements to HPQHN, a fully Post Quantum HN protocol, and more
Survey of Service Description Languages and Their Issues in Cloud Computing
Along with the growing popularity of cloud computing technology, the amount of available cloud services and their usage frequency are increasing. In order to provide a mechanism for the efficient enforcement of service-relevant operations in cloud environment, such as service discovery, service provision, and service management, a completed and precise service specification model is highly required. In this paper, we conducted a survey on existing service description languages applied in three different domains - general services, Web/SOA services, and cloud services. We discussed and compared the past literature from seven major aspects, which are: (1) domain, (2) coverage, (3) purpose, (4) representation, (5) semantic expressivity, (6) intended users, and (7) features. Additionally, two core dimensions semantic expressivity and coverage are employed to categorize and analyse the key service description languages by using Magic Quadrant methodology. These two dimensions are regarded as the most essential factors for the evaluation of a service description model. Based on this analysis, we concluded that Unified Service Description Language (USDL) is the language with the widest coverage from business, technical and operational aspects, while OWL-S is the one that has the highest semantic expressivity. At last, critical research issues on cloud service description languages are identified and analysed. The solution of these issues requires more research efforts on the standardization of cloud service specification, which will eventually enhance the development of cloud industry
Impact of artificial intelligence on education for employment: (learning and employability Framework)
Sustainable development has been a global goal and one of the key enablers to achieve the sustainable development goals is by securing decent jobs. However, decent jobs rely on the quality of education an individual has got, which value the importance of studying new education for employment frameworks that work. With the evolution of artificial intelligence that is influencing every industry and field in the world, there is a need to understand the impact of such technology on the education for employment process. The purpose of this study is to evaluate and assess how AI can foster the education for employment process? And what is the harm that such technology can brings on the social, economical and environmental levels? The study follows a mapping methodology using secondary data to identify and analyze AI powered startups and companies that addressed the learning and employability gaps. The study revealed twelve different AI applications that contribute to 3 main pillars of education for employment; career exploration and choice, skills building, and job hunting. 94% of those applications were innovated by startups. The review of literature and study results showed that AI can bring new level of guidance for individuals to choose their university or career, personalized learning capabilities that adapt to the learner\u27s circumstance, and new whole level of job search and matchmaking
- …