<?xml version="1.0" encoding="utf-8"?>
<rss version="2.0">
<Channel>
<language>en-us</language>
<title>ECOWS 2006</title>
<link>http://www.servicescomputing.tv/rss/view/rssFeed.php?category=15</link>
<description>ECOWS 2006 all articles</description>
<item><title><![CDATA[Acknowledgments]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=927</link>
<description><![CDATA[<a href="http://csdl.computer.org/comp/proceedings/ecows/2006/2737/00/2737xiii.pdf">Full Article Text</a>

<strong>DOI Bookmark: </strong>http://doi.ieeecomputersociety.org/10.1109/ECOWS.2006.6<div></div><div></div>]]></description>
<pubDate>12/21/2006 11:34</pubDate>
<author><![CDATA[]]></author></item>
<item><title><![CDATA[Preface]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=924</link>
<description><![CDATA[<a href="http://csdl.computer.org/comp/proceedings/ecows/2006/2737/00/2737ix.pdf">Full Article Text</a>

<strong>DOI Bookmark: </strong>http://doi.ieeecomputersociety.org/10.1109/ECOWS.2006.31<div></div><div></div>]]></description>
<pubDate>12/21/2006 11:27</pubDate>
<author><![CDATA[]]></author></item>
<item><title><![CDATA[Conference Organization]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=925</link>
<description><![CDATA[<a href="http://csdl.computer.org/comp/proceedings/ecows/2006/2737/00/2737x.pdf">Full Article Text</a>

<strong>DOI Bookmark: </strong>http://doi.ieeecomputersociety.org/10.1109/ECOWS.2006.13<div></div><div></div>]]></description>
<pubDate>12/21/2006 11:31</pubDate>
<author><![CDATA[]]></author></item>
<item><title><![CDATA[Additional Reviewers]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=926</link>
<description><![CDATA[<a href="http://csdl.computer.org/comp/proceedings/ecows/2006/2737/00/2737xii.pdf">Full Article Text</a>

<strong>DOI Bookmark: </strong>http://doi.ieeecomputersociety.org/10.1109/ECOWS.2006.7<div></div><div></div>]]></description>
<pubDate>12/21/2006 11:32</pubDate>
<author><![CDATA[]]></author></item>
<item><title><![CDATA[Parallel Web Service Composition in MoSCoE: A Choreography-Based Approach]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=928</link>
<description><![CDATA[We present a goal-driven approach to model a choreographer for realizing composite Web services. In this framework, the users start with an abstract, and possibly incomplete functional specification of a desired goal service. This specification is used to compose a choreographer that allows communication between the client and the set of available component services, and is functionally equivalent to the goal service. However, if such a composition cannot be realized, the proposed approach identifies the cause(s) for the failure of composition. This information can be used by the user to minimally reformulate the goal to reduce the ‘gap’ between the desired functionality. The process can be iterated until a feasible composition is realized or the user decides to abort. The approach ensures that (i) a choreographer, if one is produced by our composition algorithm, in fact realizes the user-specified goal functionality; and (ii) the algorithm is guaranteed to find a composition that meets the user needs as captured in the goal specifications (whenever such a composition exists).  <a href="http://csdl2.computer.org/persagen/DLAbsToc.jsp?resourcePath=/dl/proceedings/ecows/&amp;toc=comp/proceedings/ecows/2006/2737/00/2737toc.xml&amp;DOI=10.1109/ECOWS.2006.30">buy now!</a><div></div><div></div>]]></description>
<pubDate>1/11/2007 22:00</pubDate>
<author><![CDATA[Jyotishman Pathak,Samik Basu,Robyn Lutz,Vasant Honavar]]></author></item>
<item><title><![CDATA[Guiding Service Composition in a Visual Service Creation Environment]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=929</link>
<description><![CDATA[Current web service composition languages like WSBPEL require in-depth knowledge of these languages by the service composition designers. In this paper we present a high-level, visual Service Creation Environment (SCE). This SCE provides service composition templates, verification of compatibility and guidelines, and advanced separation of concerns through Aspect-Oriented Software Development. Composition templates are abstract descriptions of reusable compositions containing several placeholders for services. Services are verified to be compatible with the composition template when a service is mapped onto a composition template’s placeholder. Composition guidelines such as QoS constraints can be added to the SCE and verified. The modularization of crosscutting concerns is supported by the SCE through the general-purpose Padus Aspect-Oriented Programming language and the possibility to add concern-specific languages on top of Padus. The SCE generates the appropriate WS-BPEL processes given a complete and verified service composition.  <a href="http://csdl2.computer.org/persagen/DLAbsToc.jsp?resourcePath=/dl/proceedings/ecows/&amp;toc=comp/proceedings/ecows/2006/2737/00/2737toc.xml&amp;DOI=10.1109/ECOWS.2006.23">buy now!</a><div></div><div></div>]]></description>
<pubDate>1/11/2007 22:03</pubDate>
<author><![CDATA[Mathieu Braem,Niels Joncheere,Wim Vanderperren,Ragnhild Van Der Straeten,Viviane Jonckers]]></author></item>
<item><title><![CDATA[Reliable, Secure, and Transacted Web Service Compositions with AO4BPEL]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=930</link>
<description><![CDATA[Web Service Compositions in BPEL have several nonfunctional requirements such as security, reliable messaging, and transactions. Although many WS-* specifications address such non-functional concerns in the Web Service context, they focus only on the messaging-level requirements without addressing the process-level requirements. In this paper, we discuss different non-functional requirements in BPEL workflows and observe that current orchestration engines lack support for the specification and enforcement of such requirements, especially for process-level requirements. To solve this problem, we present a container framework, which introduces an XML-based deployment descriptor to specify the non-functional requirements in a declarative way. To enforce these requirements, a process container intercepts the process execution and calls dedicated middlewareWeb Services. We implemented the process container as a lightweight container using a set of AO4BPEL aspects that are automatically generated from the deployment descriptor. In addition, we have implemented BPEL middleware Web Services for reliable messaging, security, and transaction. <a href="http://csdl2.computer.org/persagen/DLAbsToc.jsp?resourcePath=/dl/proceedings/ecows/&amp;toc=comp/proceedings/ecows/2006/2737/00/2737toc.xml&amp;DOI=10.1109/ECOWS.2006.32">buy now!</a><div></div><div></div>]]></description>
<pubDate>12/21/2006 11:39</pubDate>
<author><![CDATA[Anis Charfi,Benjamin Schmeling,Andreas Heizenreder,Mira Mezini]]></author></item>
<item><title><![CDATA[Secure Web Service Discovery: Overcoming Challenges of Ubiquitous Computing]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=931</link>
<description><![CDATA[Dynamic and self-organizing systems like those found in ubiquitous computing or semantic web based scenarios raise numerous challenges regarding trust and privacy. Service discovery is a basic feature of SOA deployment in such systems, given that entities need to locate services they can describe but that they do not necessarily know. PKI based solutions to securing this mechanism, which require a preliminary key distribution, are therefore rendered awkward and contrived. In contrast, the new concept of Attribute Based Encryption, derived from Identity Based Encryption schemes, makes it possible to create secret communication channels with unknown services based solely on some attributes that are part of their description and in a decentralized fashion, that is, without the introduction of any additional trusted third party like a registry. This paper discusses how such a scalable solution to enabling secure and decentralized discovery protocols can be implemented and put to use. After reviewing the security properties that are expected, the paper then goes on to detail how to extend the WS-Discovery Web Service protocol with such mechanisms. Preliminary experimental results based on an implementation of this extended protocol are finally presented. <a href="http://csdl2.computer.org/persagen/DLAbsToc.jsp?resourcePath=/dl/proceedings/ecows/&amp;toc=comp/proceedings/ecows/2006/2737/00/2737toc.xml&amp;DOI=10.1109/ECOWS.2006.33">buy now!</a><div></div><div></div>]]></description>
<pubDate>12/21/2006 11:41</pubDate>
<author><![CDATA[Slim Trabelsi,Jean-Christphe Pazzaglia,Yves Roudier]]></author></item>
<item><title><![CDATA[A Multimedia-Specific Approach to WS-Agreement]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=932</link>
<description><![CDATA[WS-Agreement offers a general language and protocol to establish agreements between two parties. In principle, this generality enables a wide variety of domains to be covered. Yet, agreement terms need to be developed for each domain, to allow specific requirements to be expressed. When addressing a domain, one can either invent new agreement terms, or leverage on existing approaches.This paper proposes to extend the WS-Agreement framework to address multimedia content negotiation. This work relies on an existing protocol for multimedia negotiation, widely used in networking and telecommunications, named Session Description Protocol. This protocol is used as a framework to cover a variety of media (audio, video, images...). Besides building on a well-proven technology, our approach naturally allows the interfacing between the Web Services realm and the networkingtelecommunications realm, creating a host of new usage opportunities. Our work is illustrated by two case studies: image/audio downloading and audio/video streaming.

<a href="http://csdl2.computer.org/persagen/DLAbsToc.jsp?resourcePath=/dl/proceedings/ecows/&amp;toc=comp/proceedings/ecows/2006/2737/00/2737toc.xml&amp;DOI=10.1109/ECOWS.2006.3">buy now!</a><div></div><div></div>]]></description>
<pubDate>12/21/2006 11:43</pubDate>
<author><![CDATA[Wilfried Jouve,Julien Lancia,Charles Consel,Calton Pu]]></author></item>
<item><title><![CDATA[AMPol: Adaptive Messaging Policy]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=933</link>
<description><![CDATA[Interoperability in a large-scale distributed system is challenged by by the diversity of node policies. We introduce AMPol (Adaptive Messaging Policy), a serviceoriented architecture that facilitates policy-aware, end-toend adaptive messaging between multiple parties. AMPol provides services for expressing non-functional QoS policies, finding them, and carrying out system extensions to adapt to them. We implement this approach with a web service middleware that allows parties to use policies for features like attachments, payment, encryption, and signatures. Our implementation demonstrates how AMPol can enhance the function of email messaging by enabling automatic deployment and use of features like cycle exhaustion puzzles, reverse Turing tests and identity based encryption without the need for global deployment or changes to the baseline messaging system. <a href="http://csdl2.computer.org/persagen/DLAbsToc.jsp?resourcePath=/dl/proceedings/ecows/&amp;toc=comp/proceedings/ecows/2006/2737/00/2737toc.xml&amp;DOI=10.1109/ECOWS.2006.9">buy now!</a><div></div><div></div>]]></description>
<pubDate>12/21/2006 11:44</pubDate>
<author><![CDATA[Raja Afandi,Jianqing Zhang,Munawar Hafiz,Carl A. Gunter]]></author></item>
<item><title><![CDATA[Composing Web Services with PEWS: A Trace-Theoretical Approach]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=934</link>
<description><![CDATA[PEWS^1 is an interface description language for both individual and composed web services. Individual web services are expressions over WSDL-defined operations while composed web services are expressions over PEWS-defined services. This paper distinguishes two dimensions of PEWS. The control dimension describes the control workflow of the service, i.e. the order in which the operations of the web service will be executed. No data constraints are imposed. The data dimension adds information flow to the control dimension. In order to analyse the composability and the substitutability of composed services, we introduce a trace-theoretical presentation of the language constructs. Our long-term goal is to integrate PEWS into a web service design system that checks useful properties of the service specification. <a href="http://csdl2.computer.org/persagen/DLAbsToc.jsp?resourcePath=/dl/proceedings/ecows/&amp;toc=comp/proceedings/ecows/2006/2737/00/2737toc.xml&amp;DOI=10.1109/ECOWS.2006.12">buy now!</a><div></div><div></div>]]></description>
<pubDate>12/21/2006 11:46</pubDate>
<author><![CDATA[Cheikh Ba,Mirian Halfeld Ferrari,Martin A. Musicante]]></author></item>
<item><title><![CDATA[A Value-Based Foundation for Service Modelling]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=949</link>
<description><![CDATA[A broader use of e-services for cross enterprise collaboration requires the services to be analysed and designed with a clear business focus. From a business perspective, the e-services must support the primary values that an organization strives for. From an operational perspective, the e-services must be devised such that they support the day-to-day activities in the business. In this paper, we report on an effort to use value models and "service process models" as the foundation for analysis and design of e-services. Value models facilitate the exploration of new e-services, whereas service process models relate e-services to specific activities in an organization’s business processes. We elicited a set of principles and models for analysis and design of e-services, and we discussed the experiences of practicing the principles in a project from the health sector. Having a well-defined alignment of software and business values provides benefits for service requirement gathering, service identification and service validation.  <a href="http://csdl2.computer.org/persagen/DLAbsToc.jsp?resourcePath=/dl/proceedings/ecows/&amp;toc=comp/proceedings/ecows/2006/2737/00/2737toc.xml&amp;DOI=10.1109/ECOWS.2006.4">buy now!</a><div></div><div></div>]]></description>
<pubDate>1/11/2007 22:07</pubDate>
<author><![CDATA[Martin Henkel,Erik Perjons,Jelena Zdravkovic,Christer Domeij,Gunnar Appehl]]></author></item>
<item><title><![CDATA[Optimizing Web Services Performance by Using Similarity-Based Multicast Protocol]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=948</link>
<description><![CDATA[Web services have emerged as a key technology that enables interoperability between distributed applications. It is desirable that SOAP, being the Web service transport protocol for inter-connecting applications across organizations, performs efficiently in environments where there are a large number of transactions. This paper presents a novel approach to address this issue and hence improve Web services performance. We propose a similaritybased SOAP multicast protocol (SMP) that reduces the network load by optimizing the generated traffic size. In particular, SMP reuses the common template among the SOAP messages and only sends one copy of the common part to multiple clients. The results obtained from our experiments indicate that SMP achieved a 75 percent reduction in network traffic compared to traditional SOAP unicast. <a href="http://csdl2.computer.org/persagen/DLAbsToc.jsp?resourcePath=/dl/proceedings/ecows/&amp;toc=comp/proceedings/ecows/2006/2737/00/2737toc.xml&amp;DOI=10.1109/ECOWS.2006.29">buy now!</a><div></div><div></div>]]></description>
<pubDate>12/21/2006 13:59</pubDate>
<author><![CDATA[Khoi Anh Phan,Zahir Tari,Peter Bertok]]></author></item>
<item><title><![CDATA[Transactions Concurrency Control in Web Service Environment]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=947</link>
<description><![CDATA[Business transactions in web service environments run with relaxed isolation and atomicity property. In such environments, transactions can commit and roll back independently on each other. Transaction management has to reflect this issue and address the problems which result for example from concurrent access to web service resources and data. In this paper we propose an extension to the WS-Transaction Protocol which ensures the consistency of the data when independent business transactions access the data concurrently under the relaxed transaction properties. Our extension is based on transaction dependency graphs maintained at the service provider side. We have implemented such a protocol on top of WS-Transaction. The extension on the web service provider side is simple to achieve as it can be an integral part of the service invocation mechanism. It has also an advantage from an engineering point of view as it does not change the way consumers or clients of web services have to be programmed. Furthermore, it avoids direct communication between transaction coordinators which preserves security by keeping the information about business transactions restricted to the coordinators which are responsible for them. <a href="http://csdl2.computer.org/persagen/DLAbsToc.jsp?resourcePath=/dl/proceedings/ecows/&amp;toc=comp/proceedings/ecows/2006/2737/00/2737toc.xml&amp;DOI=10.1109/ECOWS.2006.37">buy now!</a><div></div><div></div>]]></description>
<pubDate>12/21/2006 13:57</pubDate>
<author><![CDATA[Mohammad Alrifai,Peter Dolog,Wolfgang Nejdl]]></author></item>
<item><title><![CDATA[A Web Services Shopping Mall for Mobile Users]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=946</link>
<description><![CDATA[In this paper we present a platform for the direct consumption of web services by a Mobile Station. We give an architectural solution where Mobile Operators play the role of Trusted Third Parties supplying service credentials that allow a co-located 3GPP Network Application Function and Liberty-enabled Identity Provider entity to implement a controlled Shopping Mall service to Mobile Stations from multiple trust domains. We consider both the protocol and the structure and syntax of the various tokens required to minimise service latency over the bandwidth and performance constrained mobile system, whilst providing adequate security services to protect against the perceived threat model. To validate our proposal we have developed code to create a Web Service test scenario utilising readily available J2ME, Java Card, J2SE and J2EE platforms, Web Services tools from Apache, the KTool- Bar emulator from Sun, and the JCOPS suite of tools for Java Card applet development. <a href="http://csdl2.computer.org/persagen/DLAbsToc.jsp?resourcePath=/dl/proceedings/ecows/&amp;toc=comp/proceedings/ecows/2006/2737/00/2737toc.xml&amp;DOI=10.1109/ECOWS.2006.5">buy now!</a><div></div><div></div>]]></description>
<pubDate>12/21/2006 11:49</pubDate>
<author><![CDATA[John A. MacDonald,Kalid Elmufti,Dasun Weerasinghe,M Rajarajan,Veselin Rakocevic,Sanowar Khan]]></author></item>
<item><title><![CDATA[Building Business Processes or Assembling Service Components: Reuse Services with BPEL4WS and SCA]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=955</link>
<description><![CDATA[The Service-Oriented Architecture (SOA) has attracted lots of attentions these days. However, SOA is essentially a design methodology that has existed for decades, and doesn’t provide enough details about the development, reuse and integration of the services. The Business Process Execution Language for Web Services (BPEL4WS) has offered a formal specification for integrating loosely coupled services and building flexible business processes. And the newly emerging Service Component Architecture (SCA) provides a set of specifications which describe a model for implementing SCA service components and assembling existing services. Despite the differences in their mechanisms for reusing and integrating services in SOA, they complement each other in nature. In this paper, we present indepth discussions about their features, and combine them to achieve useful service reuse patterns for building nontrivial applications in SOA. <a href="http://csdl2.computer.org/persagen/DLAbsToc.jsp?resourcePath=/dl/proceedings/ecows/&amp;toc=comp/proceedings/ecows/2006/2737/00/2737toc.xml&amp;DOI=10.1109/ECOWS.2006.11">buy now!</a><div></div><div></div>]]></description>
<pubDate>1/11/2007 23:00</pubDate>
<author><![CDATA[Zhile Zou,Zhenhua Duan]]></author></item>
<item><title><![CDATA[Design Patterns for Wrapping Similar Legacy Systems with Common Service Interfaces]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=961</link>
<description><![CDATA[Web Services are increasingly being used to create a wide range of distributed systems, many of which involve legacy software. Developing service interfaces for these legacy systems can be difficult, as for interoperability reasons it is advantageous to use a common service interface that is independent of the particular legacy system behind it. This enables other services to interoperate with like legacy systems regardless of their implementation. Unfortunately, similar legacy systems can offer subtly different functionality from each other, making agreeing on a common interface difficult. This paper introduces three design patterns for managing this problem: Lowest Common Denominator, Most Popular and Negotiated Interfaces. It formally presents these patterns and reflects on how they have been used within the domain of e-learning to wrap legacy systems that function as databases of objective questions. <a href="http://csdl2.computer.org/persagen/DLAbsToc.jsp?resourcePath=/dl/proceedings/ecows/&amp;toc=comp/proceedings/ecows/2006/2737/00/2737toc.xml&amp;DOI=10.1109/ECOWS.2006.14">buy now!</a><div></div><div></div>]]></description>
<pubDate>12/21/2006 16:20</pubDate>
<author><![CDATA[David E. Millard,Yvonne Howard,Swapna Chennupati,Hugh C. Davis,Ehtesham-Rasheed Jam,Lester Gilbert,Gary B. Wills]]></author></item>
<item><title><![CDATA[IEIP: An Inter-Enterprise Integration Platform for e-Commerce Based on Web Service Mediation]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=962</link>
<description><![CDATA[Cross-platform interoperability of web services makes it possible to wrap and combine information assets from heterogeneous systems to create a consolidated application. Here we propose a new pragmatic architectural model using web services as building blocks, to form an interenterprise integration platform for e-commerce. The key idea is to separate the view of a web service defined by its provider from the views of this web service employed by consumers. Based on this principle, we explain the use of web service mediators which act on behalf of both service providers and consumers. We advance the notion of requester-based views of a web service, which are published by a mediator and used by service providers to construct services that suit the consumer. To complement those, we use customer-oriented global views which express the information need of a customer. IEIP architecture improves on traditional data and enterprise service integration systems. It achieves the following two goals: a customer can use its own (private) view to access a number of different web services, as it is using a global view; and a provider can provide one view for a service implementation that can be accessed by different requesters using different global views. Leveraging this model, we report on a prototype supporting a European-wide parking services platform that integrates data and services from a large number of parking providers. <a href="http://csdl2.computer.org/persagen/DLAbsToc.jsp?resourcePath=/dl/proceedings/ecows/&amp;toc=comp/proceedings/ecows/2006/2737/00/2737toc.xml&amp;DOI=10.1109/ECOWS.2006.24">buy now!</a><div></div><div></div>]]></description>
<pubDate>12/21/2006 16:22</pubDate>
<author><![CDATA[Suo Cong,Ela Hunt,Klaus R. Dittrich]]></author></item>
<item><title><![CDATA[A Comprehensive Framework for Dynamic Web Services Integration]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=963</link>
<description><![CDATA[The Business Process Execution Language for Web Services (BPEL4WS) offers a formal specification for integrating loose-coupled web services and building flexible business processes. However, due to the increasing number of the available services, it is becoming a new challenge to dynamically select and integrate the appropriate partner services for internet-scale business processes. In this paper, we provide a comprehensive framework to implement such dynamic selections and integrations. In this framework, the abstract process template (APT) is utilized as the starting point for the dynamic integrations; the domain services and partner requirements are semantically described with SSD and PPC models, respectively. In this way, the qualified services can be selected through the matchmaking between SSD and PPC instances, and the technical information of the selected operations can be merged into APT through APT binding. To this end, the selected partner services can dynamically be integrated. <a href="http://csdl2.computer.org/persagen/DLAbsToc.jsp?resourcePath=/dl/proceedings/ecows/&amp;toc=comp/proceedings/ecows/2006/2737/00/2737toc.xml&amp;DOI=10.1109/ECOWS.2006.1">buy now!</a><div></div><div></div>]]></description>
<pubDate>12/21/2006 16:23</pubDate>
<author><![CDATA[Zhile Zou,Zhenhua Duan,Jianli Wang]]></author></item>
<item><title><![CDATA[Enhanced Specifications for Web Service Composition]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=964</link>
<description><![CDATA[The service-oriented computing research community has devoted a great deal of attention to Web service specification, discovery and composition. The ability to efficiently select and compose services in order to accomplish a complex user goal is of utmost importance. However, the problem of on-demand composition still lacks satisfactory solutions for the case of complex services intending to serve non-elementary goals and adhering to constraints. Current service specification proposals include definitions of preand post-conditions, i.e., conditions that must be satisfied in the state prior to and after the enactment of the service. However, due to the need for complex compositions, conditions and constraints that do not exist in the individual service specifications arise. For the definition of these conditions, we augment service specifications with invariants and demonstrate how such assertions can be exploited for determining service effects and compositionality. <a href="http://csdl2.computer.org/persagen/DLAbsToc.jsp?resourcePath=/dl/proceedings/ecows/&amp;toc=comp/proceedings/ecows/2006/2737/00/2737toc.xml&amp;DOI=10.1109/ECOWS.2006.15">buy now!</a><div></div><div></div>]]></description>
<pubDate>12/21/2006 16:26</pubDate>
<author><![CDATA[Vassiliki Alevizou,Dimitris Plexousakis]]></author></item>
<item><title><![CDATA[Semantic Web Service Composition Based on a Closed World Assumption]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=965</link>
<description><![CDATA[Automation of Web service composition i.e., the process of forming new value added Web services is one of the most promising challenges in Web service research area. Such an automation does not involve only a richer semantic for Web service description but also reasoning processes about those descriptions. Semantics is supposed to be one of the key elements for the automation of Web service composition. Indeed semantic Web services enable a rich machineunderstandable descriptions of their capabilities and processes in order to ease automation of processes such as discovery, selection and composition. In this paper one studies the functional level description of Web services and its impact on Web service composition hence the presentation of a formal model CLM (Causal link matrix). The model supports a semantic context in order to find a correct, complete and consistent plan as a AI planning-based composition. The innovative and formal model follows a forward chaining-oriented composition. Moreover two methods of optimization (i.e., local-oriented and a global-oriented) of Web service composition are introduced to discover the best plan according to a semantic criterion i.e., the causal link between Web services. <a href="http://csdl2.computer.org/persagen/DLAbsToc.jsp?resourcePath=/dl/proceedings/ecows/&amp;toc=comp/proceedings/ecows/2006/2737/00/2737toc.xml&amp;DOI=10.1109/ECOWS.2006.35">buy now!</a><div></div><div></div>]]></description>
<pubDate>12/21/2006 16:27</pubDate>
<author><![CDATA[Freddy Lecue,Etienne,Alain Leger]]></author></item>
<item><title><![CDATA[On the Evaluation of Semantic Web Service Matchmaking Systems]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=967</link>
<description><![CDATA[Semantic Web Services are generally considered as the evolution of conventional Web Services. Semantic information included in the service descriptions enables the development of advanced matchmaking schemes, capable of assigning degrees of match to the discovered services. In this paper, we address issues related to the evaluation of the retrieval effectiveness of semantic matchmaking systems. Our main position is that conventional evaluation schemes do not fully capture the added value of service semantics nor do they take into account the assigned degrees of match, supported by the majority of discovery engines. Through some preliminary experiments, we show that a generalization of the evaluation process based on fuzzy set theory techniques can lead to more accurate and meaningful evaluation results. <a href="http://csdl2.computer.org/persagen/DLAbsToc.jsp?resourcePath=/dl/proceedings/ecows/&amp;toc=comp/proceedings/ecows/2006/2737/00/2737toc.xml&amp;DOI=10.1109/ECOWS.2006.28">buy now!</a><div></div><div></div>]]></description>
<pubDate>12/21/2006 16:29</pubDate>
<author><![CDATA[Vassileios Tsetsos,Christos Anagnostopoulos,Stathes Hadjiefthymiades]]></author></item>
<item><title><![CDATA[Semantic QoS Metric Matching]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=968</link>
<description><![CDATA[As the Web Service paradigm gains popularity for its promise to transform the way business is conducted, the number of deployed Web Services grows with a fast rate. While sophisticated semantic discovery mechanisms have been invented to overcome the UDDI's syntactic discovery solution in order to provide more recallable and precise results, the amount of functionally equivalent Web Services returned is still large. The solution to this problem is the description of the QoS non-functional aspect of Web Services. QoS encompasses the performance of Web Services and can be used as a discriminator factor for refining Web Service advertisement result lists. However, most scientific efforts presented so far are purely syntactic and are not capturing all aspects of QoS-based Web Service description leading to imprecise syntactic discovery mechanisms. This paper presents a novel, rich and extensible ontology-based approach for describing QoS of Web Services that complements OWL-S. It is shown that, by using this approach and by introducing the concept of semantic QoS metric matching, QoS-based syntactic matchmaking and selection algorithms are transformed to semantic ones leading to better results. <a href="http://csdl2.computer.org/persagen/DLAbsToc.jsp?resourcePath=/dl/proceedings/ecows/&amp;toc=comp/proceedings/ecows/2006/2737/00/2737toc.xml&amp;DOI=10.1109/ECOWS.2006.34">buy now!</a><div></div><div></div>]]></description>
<pubDate>12/21/2006 16:30</pubDate>
<author><![CDATA[Kyriakos Kritikos,Dimitris Plexousakis]]></author></item>
<item><title><![CDATA[Multilingual Semantics in the Request-Service Matchmaking]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=969</link>
<description><![CDATA[The paper motivates the multilingualism and gives the main results of an analysis of the multilingualism problems in a system aiming at the ontology-based integration of transnational web services. The focus in this paper is on the possible premises (preconditions) in such a system and on a solution for the multilingual request-service matchmaking (service discovery based on the requestor’s preferences), for two alternative cases, depending on the language the service providers use for the definition of their services. <a href="http://csdl2.computer.org/persagen/DLAbsToc.jsp?resourcePath=/dl/proceedings/ecows/&amp;toc=comp/proceedings/ecows/2006/2737/00/2737toc.xml&amp;DOI=10.1109/ECOWS.2006.27">buy now!</a><div></div><div></div>]]></description>
<pubDate>1/12/2007 00:02</pubDate>
<author><![CDATA[Alexandra Galatescu]]></author></item>
<item><title><![CDATA[Formal Modelling and Verification of an Asynchronous Extension of SOAP]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=970</link>
<description><![CDATA[Current web services are largely based on a synchronous request-response model that uses the Simple Object Access Protocol SOAP. Next-generation telecommunication networks, on the contrary, are characterised by the need to handle asynchronous interactions among distributed service components, e.g., to deal with long-running computations and with events produced by the network resources. As these worlds are more and more converging into a single application context, several solutions have been proposed to deal with asynchronous events in the context of web services. In this paper we formalise and verify one such approach, viz., an original asynchronous extension of SOAP, and draw some conclusions. The formal model is specified as a set of communicating state machines. The semantics of the model is seen as a doubly-labelled transition system, and its behavioural properties are expressed in the actionand state-based temporal logic mu-UCTL and verified with the on-the-fly model checker UMC. <a href="http://csdl2.computer.org/persagen/DLAbsToc.jsp?resourcePath=/dl/proceedings/ecows/&amp;toc=comp/proceedings/ecows/2006/2737/00/2737toc.xml&amp;DOI=10.1109/ECOWS.2006.22">buy now!</a><div></div><div></div>]]></description>
<pubDate>12/21/2006 16:32</pubDate>
<author><![CDATA[Maurice H. ter Beek,Stefania Gnesi,Franco Mazzanti,Corrado Moiso]]></author></item>
<item><title><![CDATA[Mapping WS-CDL and BPEL into CSP for Behavioural Specification and Verification of Web Services]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=971</link>
<description><![CDATA[The Web Service Business Process Execution Language (WS-BPEL) and theWeb Service Choreography Description Language (WS-CDL) are two important standards for modelling and implementing workflows and business processes based on Web services. From the WS-CDL description of a Web services based business process, we may extract a behavioural specification against which the combined behaviour of the participating Web services should be verified. We show how to express this behavioural specification as well as the behaviour of individualWS-BPEL-based Web services in the formalism of Communicating Sequential Processes (CSP), which supports a formal approach to verifying the behaviour of collaborating Web services. <a href="http://csdl2.computer.org/persagen/DLAbsToc.jsp?resourcePath=/dl/proceedings/ecows/&amp;toc=comp/proceedings/ecows/2006/2737/00/2737toc.xml&amp;DOI=10.1109/ECOWS.2006.26">buy now!</a><div></div><div></div>]]></description>
<pubDate>12/21/2006 16:33</pubDate>
<author><![CDATA[W.L. Yeung]]></author></item>
<item><title><![CDATA[Verifying Correctness of Web Services Choreography]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=972</link>
<description><![CDATA[This paper is about Web services used in distributed, inter-organizational business cooperation (choreography). In this application scenario, we have a multipart functional convention between all the involved Web services (called partners) in order to reach the purpose of the choreography. In such a scenario, two main problems can occur: i) Can we determine whether the resulted composition of partner is conforming or not to the expected behavior, with respect to the initial cooperation schema? ii) Can we determine whether the cooperation is possible by considering the individual partners’ behaviors? i.e. are the different partners’ behaviors compatible between them? In this paper, we address the second problem. We propose a method to model partners’ behaviors and to check the correctness of the choreography (deadlock-free) based on the properties of one partner’s behavior.  <a href="http://csdl2.computer.org/persagen/DLAbsToc.jsp?resourcePath=/dl/proceedings/ecows/&amp;toc=comp/proceedings/ecows/2006/2737/00/2737toc.xml&amp;DOI=10.1109/ECOWS.2006.38">buy now!</a><div></div><div></div>]]></description>
<pubDate>1/12/2007 00:32</pubDate>
<author><![CDATA[Melliti Tarek,Celine Boutrous-Saab,Sylvain Rampacek]]></author></item>
<item><title><![CDATA[Author Index]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=973</link>
<description><![CDATA[<a href="http://csdl.computer.org/comp/proceedings/ecows/2006/2737/00/27370319.pdf">Full Article Text</a>

<strong>DOI Bookmark: </strong>http://doi.ieeecomputersociety.org/10.1109/ECOWS.2006.10<div></div><div></div>]]></description>
<pubDate>12/21/2006 16:35</pubDate>
<author><![CDATA[]]></author></item>
<item><title><![CDATA[Fast Composition Planning of OWL-S Services and Application]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=960</link>
<description><![CDATA[In this paper, we present the implementation, evaluation, and application of our OWL-S service composition planner OWLS-XPlan. Medical services described in OWL-S 1.1 and ontologies are converted to initial state and goal descriptions in PDDL 2.1, which are then used by the fast heuristic FF planner XPlan for generating an execution complete composition plan. Results of experimental evaluation of XPlan shows its top performance compared with other selected AI planners. OWLS-XPlan is used in an agent based mobile e-Health system for emergency medical assistance planning tasks. <a href="http://csdl2.computer.org/persagen/DLAbsToc.jsp?resourcePath=/dl/proceedings/ecows/&amp;toc=comp/proceedings/ecows/2006/2737/00/2737toc.xml&amp;DOI=10.1109/ECOWS.2006.20">buy now!</a><div></div><div></div>]]></description>
<pubDate>12/21/2006 16:19</pubDate>
<author><![CDATA[Matthias Klusch,Andreas Gerber]]></author></item>
<item><title><![CDATA[Maintaining Consistency between Loosely Coupled Services in the Presence of Timing Constraints and Validation Errors]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=956</link>
<description><![CDATA[Loose coupling is often cited as a defining characteristic of service-oriented architectures. Interactions between services take place via messages in an asynchronous environment where communication and processing delays can be unpredictable; further, interacting parties are not required to be on-line at the same time. Despite loose coupling, many service interactions have timing and validation constraints. For example, business interactions that take place using RosettaNet partner interface processes (PIPs) such as request price and availability, request purchase order, notify of invoice, etc. have to meet several timing and message validation constraints. A failure to deliver a valid message within its time constraint could cause mutually conflicting views of an interaction. For example, one party can regard it as timely whilst the other party regards it as untimely, leading to application level inconsistencies. The paper describes how business interactions, such as PIPs can be wrapped by simple handshake synchronisation protocols to provide bilateral consistency, thereby simplifying the task of coordinating peer-to-peer business processes. <a href="http://csdl2.computer.org/persagen/DLAbsToc.jsp?resourcePath=/dl/proceedings/ecows/&amp;toc=comp/proceedings/ecows/2006/2737/00/2737toc.xml&amp;DOI=10.1109/ECOWS.2006.25">buy now!</a><div></div><div></div>]]></description>
<pubDate>12/21/2006 14:34</pubDate>
<author><![CDATA[Carlos Molina-Jimenez,Santosh Shrivastava]]></author></item>
<item><title><![CDATA[Semantic Web Service Composition through a Matchmaking of Domain]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=958</link>
<description><![CDATA[The automated composition of Web services is one of the most promising ideas and at the same time one of the most challenging research area for the taking off of serviceoriented applications. It is widely recognised that one of the key elements for the automated composition of Web services is semantics i.e., unambiguous descriptions of Web services capabilities and processes. However Web services described at capability level need a formal context to perform the automated composition ofWeb services. In this paper a TLB Architecture (Three Levels based Architecture) is presented to perform Web service composition. Moreover we introduce the composition process as a matchmaking of domains and solve the latter problem according to a formal model i.e., the xCLM (eXtended Causal link matrix) and a knowledge base of the domain. <a href="http://csdl2.computer.org/persagen/DLAbsToc.jsp?resourcePath=/dl/proceedings/ecows/&amp;toc=comp/proceedings/ecows/2006/2737/00/2737toc.xml&amp;DOI=10.1109/ECOWS.2006.36">buy now!</a><div></div><div></div>]]></description>
<pubDate>12/21/2006 16:14</pubDate>
<author><![CDATA[Freddy Lecue,Alain Leger]]></author></item>
<item><title><![CDATA[A Graph-Based Framework for Composition of Stateless Web Services]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=693</link>
<description><![CDATA[During the past few years, web services composition has been one of the ongoing research activities in the software engineering area. It is simply defined as finding a composition of available web services that provides a requested behavior. In this paper, we study this problem for stateless web services; i.e. web services with a two-step workflow: receiving some inputs and returning some outputs as the result. Using a graph model we represent the behavior of available web services in terms of their input-output information, as well as semantic information about the web data. We also introduce a process algebra to specify the behavior of composite web services based on the behavior of simpler ones. Using the graph and the process algebra, we explain how to find useful web services for a request and how to compose them to obtain the expected behavior. We discuss the complexity of this approach and show that although it is a naturally complex process, by applying some simplifications, a reasonable overall complexity can be achieved. <a href="http://csdl2.computer.org/persagen/DLAbsToc.jsp?resourcePath=/dl/proceedings/ecows/&amp;toc=comp/proceedings/ecows/2006/2737/00/2737toc.xml&amp;DOI=10.1109/ECOWS.2006.2">buy now!</a><div></div><div></div>]]></description>
<pubDate>12/21/2006 13:48</pubDate>
<author><![CDATA[Seyyed Vahid Hashemian,Farhad Mavaddat]]></author></item>
<item><title><![CDATA[Fast Quality Driven Selection of Composite Web Services]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=694</link>
<description><![CDATA[The composite Web service selection is the process of building an executable composite Web service. Generally, the selection process involves decision making in terms of non-functional properties of Web services such as QoS requirements. Since the number of Web services is rapidly increasing and the QoS of the Web services environment changes dynamically, the fast selection is important. This paper presents a fast method for quality driven composite Web services selection based on a workflow partition strategy. The proposed method partitions an abstract workflow into two sub-workflows to decrease the number of candidate services that should be considered. A mixed integer linear programming is utilized for solving the service selection problem. Experimental results show that the partition strategy performed faster than the optimal strategy. Also, the qualities of the selected composite Web services are not significantly different from the optimal one. <a href="http://csdl2.computer.org/persagen/DLAbsToc.jsp?resourcePath=/dl/proceedings/ecows/&amp;toc=comp/proceedings/ecows/2006/2737/00/2737toc.xml&amp;DOI=10.1109/ECOWS.2006.21">buy now!</a><div></div><div></div>]]></description>
<pubDate>12/21/2006 13:49</pubDate>
<author><![CDATA[Jae-Ho Jang,Dong-Hoon Shin,Kyong-Ho Lee]]></author></item>
<item><title><![CDATA[WSMO-MX: A Logic Programming Based Hybrid Service Matchmaker]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=957</link>
<description><![CDATA[In this paper, we present an approach to hybrid semantic web service matching based on both logic programming, and syntactic similarity measurement. The implemented matchmaker, called WSMO-MX, applies different matching filters to retrieve WSMO-oriented service descriptions that are semantically relevant to a given query with respect to seven degrees of hybrid matching. These degrees are recursively computed by aggregated valuations of ontology based type matching, logical constraint and relation matching, and syntactic similarity as well. <a href="http://csdl2.computer.org/persagen/DLAbsToc.jsp?resourcePath=/dl/proceedings/ecows/&amp;toc=comp/proceedings/ecows/2006/2737/00/2737toc.xml&amp;DOI=10.1109/ECOWS.2006.39">buy now!</a><div></div><div></div>]]></description>
<pubDate>12/21/2006 14:38</pubDate>
<author><![CDATA[Frank Kaufer,Matthias Klusch]]></author></item>
<item><title><![CDATA[Adopting Default Reasoning in Service Composition Context]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=966</link>
<description><![CDATA[Web Service composition is the ability of one business to provide value-added services to its customers through the composition of basic Web services, possibly offered by different companies [12]. Because of distributed responsibilities, ownership and control, it is often not feasible to acquire all information needed for service composition. These characteristics are fundamental to service oriented computing but make it inherently difficult to avoid service conflicts. To reason about and adapt to a changing environment, in this work, we will extend current OWL-S by introducing the concept of service assumptions which allow reasoning with incomplete information. Furthermore, together with the proposed service assumptions, a sequence of rules is proposed to describe all permitted behaviors in service composition context. <a href="http://csdl2.computer.org/persagen/DLAbsToc.jsp?resourcePath=/dl/proceedings/ecows/&amp;toc=comp/proceedings/ecows/2006/2737/00/2737toc.xml&amp;DOI=10.1109/ECOWS.2006.8">buy now!</a><div></div><div></div>]]></description>
<pubDate>12/21/2006 16:28</pubDate>
<author><![CDATA[Zheng Lu,Aditya Ghose,Peter Hyland]]></author></item>
</Channel>
</rss>