8 research outputs found
An Extensible and Personalized Approach to QoS-enabled Semantic Web Service Discovery
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
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
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 β
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
ΠΠ²Π° Π΄ΠΈΡΠ΅ΡΡΠ°ΡΠΈΡΠ° ΡΠ΅ ΡΠΎΠΊΡΡΠΈΡΠ°Π½Π° Π½Π° ΠΏΡΠΈΠΌΠ΅Π½Ρ ΡΠ΅ΠΌΠ°Π½ΡΠΈΡΠΊΠΈΡ
ΡΠ΅Ρ
Π½ΠΎΠ»ΠΎΠ³ΠΈΡΠ° Π·Π°
ΡΠ΅ΡΠ°Π²Π°ΡΠ΅ ΠΏΡΠΎΠ±Π»Π΅ΠΌΠ° ΠΎΠΏΡΠΈΠΌΠ°Π»Π½Π΅ ΠΊΠΎΠ½ΡΠΈΠ³ΡΡΠ°ΡΠΈΡΠ΅ ΡΠ΅ΡΠ²ΠΈΡΠ½ΠΎ-ΠΎΡΠΈΡΠ΅Π½ΡΠΈΡΠ°Π½ΠΈΡ
Π°ΡΡ
ΠΈΡΠ΅ΠΊΡΡΡΠ° (Π΅Π½Π³Π». 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
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