1,721,378 research outputs found

    Semantic Techniques for Multi-cloud Applications Portability and Interoperability

    Full text link
    AbstractThe composition of Cloud Services to satisfy customer requirements is a complex task, owing to the huge number of services that are currently available. The advent of Big Data and Internet of Things (IoT), which rely on Cloud resources for better performances and scalability, is pushing researchers to find new solutions to the Cloud Services composition problem. In this paper a semantic- based representation of Application Patterns and Cloud Services is presented, with an example of its use in a typical distributed application, which shows how the proposed approach can be successfully employed for the discovery and composition of Cloud Services.

    Semantic Web Services Discovery based on Structural Ontology Matching

    No full text
    In this paper, we present an approach to semantic-based web service discovery and a prototypical tool based on syntactic and structural schema matching. It is based on matching an input ontology, describing a service request, to web services descriptions at the ‘syntactic level’ through Web Services Description Language (WSDL) or, at the semantic level, through service ontologies described with languages such as Ontology Web Language for Services (OWL-S), Web Services Modelling Ontology (WSMO), Semantic Web Services Framework (SWSF) and Web Services Description Language Semantics (WSDL-S). The different input schemas, WSDL descriptions, Ontology Web Language (OWL) ontologies, OWL-S, WSMO, SWSF and WSDL-S components are represented in a uniform way by means of directed rooted graphs, where nodes represent schema elements, connected by directed links of different types, e.g., for containment and referential relationships. On this uniform internal representation, a number of matching algorithms operate, including structural-based algorithms (Children Matcher, Leaves Matcher, Graph and SubGraph Isomorphism) and syntactical ones (Edit Distance (Levenshtein Distance or LD) and Synonym Matcher (through the WordNet synonyms thesaurus))

    Algorithmic Concept Recognition to support High Performance Code Reengineering

    No full text
    Techniques for automatic program recognition, at the algorithmic level, could be of high interest for the area of Software Maintenance, in particular for knowledge based reengineering, because the selection of suitable restructuring strategies is mainly driven by algorithmic features of the code. In this paper an automated {\em hierarchical concept parsing} recognition technique, and a formalism for the specification of algorithmic concepts, is presented. Based on this technique, the design and development of ALCOR, a production rule based system for automatic recognition of algorithmic concepts within programs, aimed at support of knowledge based reengineering for high performance, is presented
    corecore