60 research outputs found
Semantic Web: An Integrated Approach for Web Service Discovery, Selection and Composition
Web services are remote methods can be invoked through open standards such as Simple Object Access Protocols. The increasing web services in the repositories makes the selection process very complex. The same can be extended in forming the composition of web services. This research focuses on the semantic web service selection and composition through design and implementation of a framework. The proposed framework is an ontology based service selection approach and the selected services are participating in the composition process. This approach deals with semantic search, which uses Quality of services for service selection and composition. The entire framework is implemented with semantic web technology and the performance of the system is observed with domain specific ontologies
Towards runtime discovery, selection and composition of semantic services
Service-orientation is gaining momentum in distributed software applications, mainly because it facilitates interoperability and allows application designers to abstract from underlying implementation technologies. Service composition has been acknowledged as a promising approach to create composite services that are capable of supporting service user needs, possibly by personalising the service delivery through the use of context information or user preferences. In this paper we discuss the challenges of automatic service composition, and present DynamiCoS, which is a novel framework that aims at supporting service composition on demand and at runtime for the benefit of service end-users. We define the DynamiCoS framework based on a service composition life-cycle. Framework mechanisms are introduced to tackle each of the phases and requirements of this life-cycle. Semantic services are used in our framework to enable reasoning on the service requests issued by end users, making it possible to automate service discovery, selection and composition. We validate our framework with a prototype that we have built in order to experiment with the mechanisms we have designed. The prototype was evaluated in a testing environment using some use case scenarios. The results of our evaluation give evidences of the feasibility of our approach to support runtime service composition. We also show the benefits of semantic-based frameworks for service composition, particularly for end-users who will be able to have more control on the service composition process
A Service-Oriented Approach to Freight Routing in Intermodal Transport Systems
Determining optimal routes for given freight is a core decision inlogistics. In intermodal logistics, freight routing has to considerthe interfaces between different modes of transportation, such ashand-over offsets, load changes, and organizational procedures.We study this problem from the perspective of Service-OrientedComputing (SOC). We (1) propose representing intermodaltransport systems as a set of service offerings and customerdemand as service requests, (2) define freight routing as a servicecomposition problem, and (3) develop a composition algorithmfor transportation services
Usages of Semantic Web Services Technologies in IoT Ecosystems and its Impact in Services Delivery: A survey
Internet of things (IoT) has begun to emerge in our daily life through the huge number of smart services provided by the devices that deploy around us. Vague and uncertainty in attributes that using in describing services, different levels of quality of each service and the limitation in capabilities of IoT devices are affect and hinder the process of discovering or selecting services. The services in IoT need to be well described to enable users to receive their services that relevant to their query. This survey will investigate the most popular semantic services models and explore the use of these models in enhancing services discovery and services selection in IoT domain. Furthermore, the survey will investigate the evaluation metrics used by each study and compare the results that they obtained. 
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
Semantic-based policy engineering for autonomic systems
This paper presents some important directions in the use of ontology-based semantics in achieving the vision of Autonomic Communications. We examine the requirements of Autonomic Communication with a focus on the demanding needs of ubiquitous computing environments, with an emphasis on the requirements shared with Autonomic Computing. We observe that ontologies provide a strong mechanism for addressing the heterogeneity in user task requirements, managed resources, services and context. We then present two complimentary approaches that exploit ontology-based knowledge in support of autonomic communications: service-oriented models for policy engineering and dynamic semantic queries using content-based networks. The paper concludes with a discussion of the major research challenges such approaches raise
A machine-machine collaboration formalism based on web services for groupware tailorability
International audienceIn this paper, we propose a machine-machine collaboration formalism to support groupware tailorability. Our work is based on the 3C functional model by Ellis that decomposes collaboration between users into communication, coordination and cooperation phases. Through our research, we realized that Web services are powerful distributed components offering the desired tools in order to adapt a groupware system to the real needs of users. Therefore, we use this technology to define a collaboration protocol between machines over the network for implementing tailorability in CSCW systems. A groupware architecture is presented based on the proposed formalism. We argue that a protocol between machines over the internet should be defined in order to exchange common services in real time collaboration
Recommended from our members
ACTAS: Adaptive Composition and Trading with Agents for Services
Mainly in business domains, the vision of gaining flexible, adaptive service environments is based on the standardization and practical proliferation of (Semantic) Web Services, ontologies, and agents. The standards of Web Services and their Service-oriented Architectures (SOA) became the standard paradigm for software component integration. Dynamic changes and the permanently increasing amount of available e-services of different domains are a challenge of Service Discovery and Composition. Mediation between different approaches and expert knowledge is often necessary for the composition of services of different domains. Semantic enhancements, Autonomic Service Discovery, and the research for more holistic concepts for the classification of e-services are current attempts of overcoming this challenge, in order to reach the ultimate goal of Autonomic SOC
Semantic search and composition in unstructured peer-to-peer networks
This dissertation focuses on several research questions in the area of semantic search and composition in unstructured peer-to-peer (P2P) networks. Going beyond the state of the art, the proposed semantic-based search strategy S2P2P offers a novel path-suggestion based query routing mechanism, providing a reasonable tradeoff between search performance and network traffic overhead. In addition, the first semantic-based data replication scheme DSDR is proposed. It enables peers to use semantic information to select replica numbers and target peers to address predicted future demands. With DSDR, k-random search can achieve better precision and recall than it can with a near-optimal non-semantic replication strategy. Further, this thesis introduces a functional automatic semantic service composition method, SPSC. Distinctively, it enables peers to jointly compose complex workflows with high cumulative recall but low network traffic overhead, using heuristic-based bidirectional haining and service memorization mechanisms. Its query branching method helps to handle dead-ends in a pruned search space. SPSC is proved to be sound and a lower bound of is completeness is given. Finally, this thesis presents iRep3D for semantic-index based 3D scene selection in P2P search. Its efficient retrieval scales to answer hybrid queries involving conceptual, functional and geometric aspects. iRep3D outperforms previous representative efforts in terms of search precision and efficiency.Diese Dissertation bearbeitet Forschungsfragen zur semantischen Suche und Komposition in unstrukturierten Peer-to-Peer Netzen(P2P). Die semantische Suchstrategie S2P2P verwendet eine neuartige Methode zur Anfrageweiterleitung basierend auf PfadvorschlĂ€gen, welche den Stand der Wissenschaft ĂŒbertrifft. Sie bietet angemessene Balance zwischen Suchleistung und Kommunikationsbelastung im Netzwerk. AuĂerdem wird das erste semantische System zur Datenreplikation genannt DSDR vorgestellt, welche semantische Informationen berĂŒcksichtigt vorhergesagten zukĂŒnftigen Bedarf optimal im P2P zu decken. Hierdurch erzielt k-random-Suche bessere PrĂ€zision und Ausbeute als mit nahezu optimaler nicht-semantischer Replikation. SPSC, ein automatisches Verfahren zur funktional korrekten Komposition semantischer Dienste, ermöglicht es Peers, gemeinsam komplexe AblaufplĂ€ne zu komponieren. Mechanismen zur heuristischen bidirektionalen Verkettung und RĂŒckstellung von Diensten ermöglichen hohe Ausbeute bei geringer Belastung des Netzes. Eine Methode zur Anfrageverzweigung vermeidet das Feststecken in Sackgassen im beschnittenen Suchraum. Beweise zur Korrektheit und unteren Schranke der VollstĂ€ndigkeit von SPSC sind gegeben. iRep3D ist ein neuer semantischer Selektionsmechanismus fĂŒr 3D-Modelle in P2P. iRep3D beantwortet effizient hybride Anfragen unter BerĂŒcksichtigung konzeptioneller, funktionaler und geometrischer Aspekte. Der Ansatz ĂŒbertrifft vorherige Arbeiten bezĂŒglich PrĂ€zision und Effizienz
- âŠ