8 research outputs found

    An Extensible and Personalized Approach to QoS-enabled Semantic Web Service Discovery

    Get PDF
    We present a framework for the autonomous discovery and selection of Semantic Web services based on their QoS properties. The novelty of our approach is the wide use of semantic technologies for a customizable discovery, which enables both the service users and providers to flexibly specify their matching models for QoS and the corresponding environmental conditions. In the presented approach, the discovery and ranking of services can be personalized via the use of domain ontologies detailing the user's preferences and the provider's specification. The discovery component is modeled as an adaptive query processing system in which the basic steps of filtering, matchmaking, reputation-based QoS assessment, and ranking of services correspond to logical algebraic operators, which facilitates the introduction of different discovery algorithms and the automatic generation of appropriate parallelized matchmaking evaluations, enabling the scalability of our solution up to unpredictable arrival rate of user queries against high numbers of published service descriptions in the system

    An Extensible and Personalized Approach to QoS-enabled Service Discovery

    No full text
    We present an extensible and customizable framework for the autonomous discovery of Semantic Web services based on their QoS properties. Using semantic technologies, users can specify the QoS matching model and customize the ranking of services flexibly according to their preferences. The formal modeling of the discovery process as an adaptive query execution plan facilitates the introduction of different discovery algorithms and the automatic generation of parallelized matchmaking evaluations. This enables adapting our approach to unpredictable arrival rates of user queries and scales up to high numbers of published service descriptions

    IDEAS-1997-2021-Final-Programs

    Get PDF
    This document records the final program for each of the 26 meetings of the International Database and Engineering Application Symposium from 1997 through 2021. These meetings were organized in various locations on three continents. Most of the papers published during these years are in the digital libraries of IEEE(1997-2007) or ACM(2008-2021)

    An Extensible and Personalized Approach to QoS-enabled Service Discovery βˆ—

    No full text
    We present a framework for the autonomous discovery and selection of Semantic Web services based on their QoS properties. The novelty of our approach is the wide use of semantic technologies for a customizable discovery, which enables both the service users and providers to flexibly specify their matching models for QoS and the corresponding environmental conditions. In the presented approach, the discovery and ranking of services can be personalized via the use of domain ontologies detailing the user’s preferences and the provider’s specification. The discovery component is modeled as an adaptive query processing system in which the basic steps of filtering, matchmaking, reputation-based QoS assessment, and ranking of services correspond to logical algebraic operators, which facilitates the introduction of different discovery algorithms and the automatic generation of appropriate parallelized matchmaking evaluations, enabling the scalability of our solution up to unpredictable arrival rate of user queries against high numbers of published service descriptions in the system.

    Configuration of service oriented architectures with semantic technologies based on non-functional requirements

    Get PDF
    Ова Π΄ΠΈΡΠ΅Ρ€Ρ‚Π°Ρ†ΠΈΡ˜Π° јС фокусирана Π½Π° ΠΏΡ€ΠΈΠΌΠ΅Π½Ρƒ сСмантичких Ρ‚Π΅Ρ…Π½ΠΎΠ»ΠΎΠ³ΠΈΡ˜Π° Π·Π° Ρ€Π΅ΡˆΠ°Π²Π°ΡšΠ΅ ΠΏΡ€ΠΎΠ±Π»Π΅ΠΌΠ° ΠΎΠΏΡ‚ΠΈΠΌΠ°Π»Π½Π΅ ΠΊΠΎΠ½Ρ„ΠΈΠ³ΡƒΡ€Π°Ρ†ΠΈΡ˜Π΅ сСрвисно-ΠΎΡ€ΠΈΡ˜Π΅Π½Ρ‚ΠΈΡΠ°Π½ΠΈΡ… Π°Ρ€Ρ…ΠΈΡ‚Π΅ΠΊΡ‚ΡƒΡ€Π° (Π΅Π½Π³Π». Service Oriented Architecture – SOA) Π½Π° основу Π½Π΅Ρ„ΡƒΠ½ΠΊΡ†ΠΈΠΎΠ½Π°Π»Π½ΠΈΡ… Π·Π°Ρ…Ρ‚Π΅Π²Π° корисника. РСшСњС јС Π±Π°Π·ΠΈΡ€Π°Π½ΠΎ Π½Π° ΠΏΡ€ΠΎΡˆΠΈΡ€Π΅ΡšΡƒ АHP Π°Π»Π³ΠΎΡ€ΠΈΡ‚ΠΌΠ° Π·Π° Ρ€Π°Π΄ са Ρ€Π°Π·Π»ΠΈΡ‡ΠΈΡ‚ΠΈΠΌ врстама Π·Π°Ρ…Ρ‚Π΅Π²Π° ΠΈ Ρ€Π°Π·Π²ΠΎΡ˜Ρƒ хСуристичког приступа заснованог Π½Π° Π³Π΅Π½Π΅Ρ‚ΠΈΡ‡ΠΊΠΈΠΌ Π°Π»Π³ΠΎΡ€ΠΈΡ‚ΠΌΠΈΠΌΠ° Π·Π° Ρ€Π΅ΡˆΠ°Π²Π°ΡšΠ΅ ΠΏΡ€ΠΎΠ±Π»Π΅ΠΌΠ° ΠΎΠΏΡ‚ΠΈΠΌΠ°Π»Π½Π΅ ΠΊΠΎΠ½Ρ„ΠΈΠ³ΡƒΡ€Π°Ρ†ΠΈΡ˜Π΅. ΠŸΠΎΡΡ‚ΠΎΡ˜Π΅Ρ›Π° Ρ€Π΅ΡˆΠ΅ΡšΠ° Ρƒ овој области су ΠΏΠΎΠΊΠ°Π·Π°Π»Π° ΠΈΠ·ΡƒΠ·Π΅Ρ‚Π½ΠΎ ΠΌΠ°Π»ΠΈ Π½ΠΈΠ²ΠΎ ΠΏΠ΅Ρ€ΡΠΎΠ½Π°Π»ΠΈΠ·Π°Ρ†ΠΈΡ˜Π΅, Ρ‚Ρ˜ корисницима нијС Π΄ΠΎΠ·Π²ΠΎΡ™Π΅Π½ΠΎ Π΄Π΅Ρ„ΠΈΠ½ΠΈΡΠ°ΡšΠ΅ Ρ€Π°Π·Π½ΠΈΡ… ΡΠΎΡ„ΠΈΡΡ‚ΠΈΡ†ΠΈΡ€Π°Π½ΠΈΡ˜ΠΈΡ… врста Π·Π°Ρ…Ρ‚Π΅Π²Π° који ΠΎΡΠ»ΠΈΠΊΠ°Π²Π°Ρ˜Ρƒ ΡšΠΈΡ…ΠΎΠ²Π΅ ΠΆΠ΅Ρ™Π΅, ΠΎΡ‡Π΅ΠΊΠΈΠ²Π°ΡšΠ° ΠΈ строгС Π·Π°Ρ…Ρ‚Π΅Π²Π΅ Π·Π° којС Π·Π°Ρ…Ρ‚Π΅Π²Π°Ρ˜Ρƒ ΠΏΠΎΡ‚ΠΏΡƒΠ½ΠΎ ΠΈΡΠΏΡƒΡšΠ΅ΡšΠ΅. Π’Π°ΠΊΠΎΡ’Π΅, ΠΏΠΎΡΡ‚ΠΎΡ˜Π΅Ρ›Π° Ρ€Π΅ΡˆΠ΅ΡšΠ° су Π±ΠΈΠ»Π° ΠΏΠ΅Ρ€ΠΌΠ°Π½Π΅Π½Ρ‚Π½ΠΎ фокусирана Π½Π° ΠΈΡΠΏΡƒΡšΠ΅ΡšΠ΅ Π·Π°Ρ…Ρ‚Π΅Π²Π° функционалности, Π½Π°ΠΊΠΎΠ½ Ρ‡Π΅Π³Π° сС Π²Ρ€ΡˆΠΈ ΠΎΠ΄Π°Π±ΠΈΡ€ ΠΊΠΎΠ½Ρ„ΠΈΠ³ΡƒΡ€Π°Ρ†ΠΈΡ˜Π΅ сходно Π·Π°Ρ…Ρ‚Π΅Π²ΠΈΠΌΠ° ΠΎ ΡΠΌΠ°ΡšΠ΅ΡšΡƒ врСдности карактСристика којС ΠΈΠΌΠ°Ρ˜Ρƒ Ρ‚Π΅Π½Π΄Π΅Π½Ρ†ΠΈΡ˜Ρƒ раста (Π½ΠΏΡ€., Ρ†Π΅Π½Π° ΠΈ Π²Ρ€Π΅ΠΌΠ΅ ΠΈΠ·Π²Ρ€ΡˆΠ°Π²Π°ΡšΠ°), односно ΠΏΠΎΠ²Π΅Ρ›Π°ΡšΡƒ врСдности карактСристика којС ΠΈΠΌΠ°Ρ˜Ρƒ Ρ‚Π΅Π½Π΄Π΅Π½Ρ†ΠΈΡ˜Ρƒ опадања (Π½ΠΏΡ€., поузданост ΠΈ доступност). ΠœΠ΅Ρ’ΡƒΡ‚ΠΈΠΌ, ΠΊΠ°Π΄Π° сС ΠΏΠΎΡΠΌΠ°Ρ‚Ρ€Π°Ρ˜Ρƒ Ρ†Π΅Π»Π΅ Ρ„Π°ΠΌΠΈΠ»ΠΈΡ˜Π΅ SOA, ΠΎΠ΄ посСбног Π·Π½Π°Ρ‡Π°Ρ˜Π° ΠΏΠΎΡΡ‚Π°Ρ˜Π΅ ΠΏΡ€ΠΎΠ±Π»Π΅ΠΌ ΠΊΠΎΠ½ΡΡ‚Ρ€ΡƒΠΊΡ†ΠΈΡ˜Π΅ ΠΊΠΎΠ½Ρ„ΠΈΠ³ΡƒΡ€Π°Ρ†ΠΈΡ˜Π΅ ΠΏΡ€ΠΈ истоврСмСном Π·Π°Π΄ΠΎΠ²ΠΎΡ™Π΅ΡšΡƒ Ρ„ΡƒΠ½ΠΊΡ†ΠΈΠΎΠ½Π°Π»Π½ΠΈΡ… ΠΈ Π½Π΅Ρ„ΡƒΠ½ΠΊΡ†ΠΈΠΎΠ½Π°Π»Π½ΠΈΡ… Π·Π°Ρ…Ρ‚Π΅Π²Π°. ΠŸΡ€Π΅Π΄Π»ΠΎΠΆΠ΅Π½ΠΎ ΠΈΠ½Ρ‚Π΅Π³Ρ€Π°Π»Π½ΠΎ Ρ€Π΅ΡˆΠ΅ΡšΠ΅ ΠΏΠΎΠ΄ Π½Π°Π·ΠΈΠ²ΠΎΠΌ OptConfSOAFΠΎΠ±Π΅Π·Π±Π΅Ρ’ΡƒΡ˜Π΅ ΠΏΡ€Π΅Π΄ΡΡ‚Π°Π²Ρ™Π°ΡšΠ΅ Ρ€Π°Π·Π»ΠΈΡ‡ΠΈΡ‚ΠΈΡ… врста Π·Π°Ρ…Ρ‚Π΅Π²Π° (бСзусловни, условни, Π·Π°Ρ…Ρ‚Π΅Π²ΠΈ ΠΎ лСксикографском ΠΏΠΎΡ€Π΅Ρ‚ΠΊΡƒ) ΠΎ Π½Π΅Ρ„ΡƒΠ½ΠΊΡ†ΠΈΠΎΠ½Π°Π»Π½ΠΈΠΌ карактСристикама ΠΈ ΠΎΠΏΡ‚ΠΈΠΌΠ°Π»Π½Ρƒ ΠΊΠΎΠ½Ρ„ΠΈΠ³ΡƒΡ€Π°Ρ†ΠΈΡ˜Ρƒ Ρ„Π°ΠΌΠΈΠ»ΠΈΡ˜Π° SOA Π½Π° основу дСфинисаних Π·Π°Ρ…Ρ‚Π΅Π²Π°. ΠŸΡ€ΠΈΡΡ‚ΡƒΠΏ који сС ΠΏΡ€Π΅Π΄Π»Π°ΠΆΠ΅ ΠΎΠ±Π΅Π·Π±Π΅Ρ’ΡƒΡ˜Π΅ истоврСмСно Π·Π°Π΄ΠΎΠ²ΠΎΡ™Π΅ΡšΠ΅ Π·Π°Ρ…Ρ‚Π΅Π²Π° који сС Ρ‚ΠΈΡ‡Ρƒ функционалности систСма ΠΊΠ°ΠΎ ΠΈ Π½Π΅Ρ„ΡƒΠ½ΠΊΡ†ΠΈΠΎΠ½Π°Π»Π½ΠΈΡ… Π·Π°Ρ…Ρ‚Π΅Π²Π° који ΠΌΠΎΠ³Ρƒ Π±ΠΈΡ‚ΠΈ Ρ€Π°Π·Π»ΠΈΡ‡ΠΈΡ‚ΠΎΠ³ Π½ΠΈΠ²ΠΎΠ° ΠΏΡ€ΠΈΠΎΡ€ΠΈΡ‚Π΅Ρ‚Π°, односити сС Π½Π° појСдинС Π΄Π΅Π»ΠΎΠ²Π΅ ΠΈΠ»ΠΈ сСрвисно- ΠΎΡ€ΠΈΡ˜Π΅Π½Ρ‚ΠΈΡΠ°Π½Ρƒ Π°Ρ€Ρ…ΠΈΡ‚Π΅ΠΊΡ‚ΡƒΡ€Ρƒ Ρƒ цСлости. ΠŸΡ€Π΅Π΄Π»ΠΎΠΆΠ΅Π½ΠΎ Ρ€Π΅ΡˆΠ΅ΡšΠ΅ јС ΠΎΠΏΡˆΡ‚Π΅ ΠΈ нијС ΠΎΠ³Ρ€Π°Π½ΠΈΡ‡Π΅Π½ΠΎ само Π½Π° Π²Π΅Π± сСрвисС, ΠΈΠ°ΠΊΠΎ сС појам сСмантичких Ρ‚Π΅Ρ…Π½ΠΎΠ»ΠΎΠ³ΠΈΡ˜Π° ΠΎΠ±ΠΈΡ‡Π½ΠΎ Π²Π΅Π·ΡƒΡ˜Π΅ Π·Π° Π΄Π°Ρ‚ΠΈ Π΄ΠΎΠΌΠ΅Π½ ΠΏΡ€ΠΈΠΌΠ΅Π½Π΅. РСшСњС сС ΠΌΠΎΠΆΠ΅ ΠΏΡ€ΠΈΠΌΠ΅Π½ΠΈΡ‚ΠΈ Ρƒ Π±ΠΈΠ»ΠΎ ΠΊΠΎΠΌ Π΄ΠΎΠΌΠ΅Π½Ρƒ Ρƒ којСм сС SOA ΠΏΠ°Ρ€Π°Π΄ΠΈΠ³ΠΌΠ° ΠΌΠΎΠΆΠ΅ ΠΏΡ€ΠΈΠΌΠ΅Π½ΠΈΡ‚ΠΈ ΠΏΠΎΡΠΌΠ°Ρ‚Ρ€Π°ΡšΠ΅ΠΌ сСрвиса ΠΊΠ°ΠΎ Π±ΠΈΠ»ΠΎ којС ΠΊΠΎΠΌΠΏΠΎΠ½Π΅Π½Ρ‚Π΅ (Π½Π΅ΠΎΠ±Π°Π²Π΅Π·Π½ΠΎ софтвСрскС) Π΄Π°Ρ‚Π΅ функционалности...This dissertation is focused on the application of semantic technologies for solving the problem of optimal configuration of service-oriented architectures (SOA) based on stakeholders’ non-functional requirements. The proposed solution is developed as an extension of the AHP algorithm to allow for processing of different kinds of requirements. To address the problem of optimal configuration of SOA, a heuristic approach based on genetic algorithms has also been proposed and validated. Existing approaches in this field have shown low level of personalization, i.e. stakeholders are neither enabled to define sophisticated requirements that reflect their own expectations and attitudes, nor they are able to indicate hard requirements that have to be fully satisfied. Furthermore, existing approaches were primarily addressing the problem of fulfilling functional requirements, while the selection of an appropriate configuration is driven by the goal of decreasing the values of monotonically decreasing features (e.g., price and execution time) and simultaneous increasing the values of monotonically increasing features (e.g., availability and reliability). By considering the whole SOA families, the problem of configuration based on both functional and nonfunctional requirements gets special importance for research and further applications. The proposed solution, titled OptConfSOAF provides a framework for specification and processing of different kinds of requirements (unconditional, conditional, and requirements about lexicographical order) over non-functional features, and further optimal configuration of SOA families. The proposed approach provides simultaneous fulfillment of functional requirements (i.e., requirements related to the system’s functionalities) and non-functional requirements, where the latter could be defined with different level of importance, for specific parts of a SOA-based system or the system in its entirety. The proposed solution is general and is not bound to web services, even though semantic technologies are often associated with that domain. Since the solution considers a service as a component (no mandatory to be software component) with the specified functionality, it is applicable and easily adaptable to any specific application domain where SOA paradigm may be applied..

    High Quality P2P Service Provisioning via Decentralized Trust Management

    Get PDF
    Trust management is essential to fostering cooperation and high quality service provisioning in several peer-to-peer (P2P) applications. Among those applications are customer-to-customer (C2C) trading sites and markets of services implemented on top of centralized infrastructures, P2P systems, or online social networks. Under these application contexts, existing work does not adequately address the heterogeneity of the problem settings in practice. This heterogeneity includes the different approaches employed by the participants to evaluate trustworthiness of their partners, the diversity in contextual factors that influence service provisioning quality, as well as the variety of possible behavioral patterns of the participants. This thesis presents the design and usage of appropriate computational trust models to enforce cooperation and ensure high quality P2P service provisioning, considering the above heterogeneity issues. In this thesis, first I will propose a graphical probabilistic framework for peers to model and evaluate trustworthiness of the others in a highly heterogeneous setting. The framework targets many important issues in trust research literature: the multi-dimensionality of trust, the reliability of different rating sources, and the personalized modeling and computation of trust in a participant based on the quality of services it provides. Next, an analysis on the effective usage of computational trust models in environments where participants exhibit various behaviors, e.g., honest, rational, and malicious, will be presented. I provide theoretical results showing the conditions under which cooperation emerges when using trust learning models with a given detecting accuracy and how cooperation can still be sustained while reducing the cost and accuracy of those models. As another contribution, I also design and implement a general prototyping and simulation framework for reputation-based trust systems. The developed simulator can be used for many purposes, such as to discover new trust-related phenomena or to evaluate performance of a trust learning algorithm in complex settings. Two potential applications of computational trust models are then discussed: (1) the selection and ranking of (Web) services based on quality ratings from reputable users, and (2) the use of a trust model to choose reliable delegates in a key recovery scenario in a distributed online social network. Finally, I will identify a number of various issues in building next-generation, open reputation-based trust management systems as well as propose several future research directions starting from the work in this thesis
    corecore