<?xml version="1.0" encoding="utf-8"?>
<rss version="2.0">
<Channel>
<language>en-us</language>
<title>ICWS 2008</title>
<link>http://www.servicescomputing.tv/rss/view/rssFeed.php?category=26</link>
<description>ICWS 2008 all articles</description>
<item><title><![CDATA[Orchestrating caGrid Services in Taverna]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1558</link>
<description><![CDATA[<p>caBIGTM (the cancer Biomedical Informatics GridTM) is an open-source, open-access information network enabling cancer researchers to share tools, data, applications, and technologies. caGrid is the underlying service-based grid software infrastructure for caBIG, integrating distributed data and analytic resources into a virtual collaborative platform for cancer research. Within caGrid, many cancer-related data analysis and aggregation tasks can make use of &amp;quot;canned&amp;quot; sets of service invocations, or workflows. As a result, there is a need to orchestrate the invocation of caGrid services through the use of both a workflow language and tooling. In this paper, we first explain why we select Taverna as a candidate for workflow authoring and invocation. We then review the development of Taverna plug-ins in general, and describe how we extend Taverna to use caGrid services. We then detail a real-world example and the lessons learned from our research. Finally we conclude with a summary and a description of potentialnext steps.</p><div align="center"><a href="uploadfiles/2008/VIDEO/ICWS2008-1001/ICWS2008-1001.html" target="_blank"><strong>&amp;gt;&amp;gt;&amp;gt; View Video(Flash Player 9 please. Version 10 may not work as expected)</strong></a> </div><div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\ICWS2008-1001.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>3/27/2009 22:33</pubDate>
<author><![CDATA[Wei Tan, Ravi Madduri, Kiran Keshav, Baris E. Suzek,Scott Oster,Ian Foster]]></author></item>
<item><title><![CDATA[A Dependable Infrastructure for Cooperative Web Services Coordination]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1559</link>
<description><![CDATA[A current trend in the web services community is to define coordination mechanisms to execute collaborative tasks involving multiple organizations. Following this tendency, this work presents a dependable (i.e., intrusion-tolerant) infrastructure for cooperative web services coordination that is based on the tuple space coordination model. This infrastructure provides decoupled communication and implements several security mechanisms that allow reliable coordination even in presence of malicious components. This work also investigates the costs related to the use of this infrastructure and possible web service applications that can benefit from it.<div></div><div></div>]]></description>
<pubDate>11/18/2008 22:24</pubDate>
<author><![CDATA[Eduardo A. P. Alchieri,Alysson Neves Bessani,Joni da Silva Fraga]]></author></item>
<item><title><![CDATA[Towards Scalable Web Service Composition with Partial Matches]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1560</link>
<description><![CDATA[&amp;nbsp; <span style="font-size: 10pt">We investigate scalable algorithms for automated composition (WSC) of Semantic Web Services. Our notion of WSC is very general: the composition semantics includes background knowledge and we use the most general notion of matching, partial matches, where several web services can cooperate, each covering only a part of a requirement. Unsurprisingly, automatic composition in this setting is very hard. We identify a special case with simpler semantics, which covers many relevant scenarios. We develop a composition tool for this special case. Our goal is to achieve scalability: we overcome large search spaces by guiding the search using heuristic techniques. The computed solutions are optimal up to a constant factor. We test our approach on a simple, yet powerful real world use-case; the initial results attest the potential of the approach.</span><div></div><div></div>]]></description>
<pubDate>11/19/2008 02:16</pubDate>
<author><![CDATA[Adina Sirbu,J¨org Hoffmann]]></author></item>
<item><title><![CDATA[Modeling and Discovery of Data Providing Services]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1570</link>
<description><![CDATA[&amp;nbsp; <span style="font-size: 10pt">Web Services providing access to data sources with structured data have an important place in the SOA. In this paper we focus on modeling and discovery of generic data providing services (DPS), with the goal of making data providing services available for interactions with service requesters in contexts such as service composition and mediation. In our model RDF Views are used to represent the content provided by the DPS. A characterization of match between description of DPS as RDF Views and the OWL-S service request is specified, based on which we developed a flexible matchmaking algorithm for discovery of data providing services. Finally, we propose a realization of the DPS using a SOAP version of the SPARQL protocol and a dynamic configuration interface allowing easy interactions of service requesters with data providing services.</span><div></div><div></div>]]></description>
<pubDate>11/19/2008 01:24</pubDate>
<author><![CDATA[Roman Vaculin, Huajun Chen, Roman Neruda, Katia Sycara]]></author></item>
<item><title><![CDATA[A Hybrid Approach to QoS-aware Service Composition]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1571</link>
<description><![CDATA[&amp;nbsp; <span style="font-size: 10pt">QoS-aware service composition intends to maximize the QoS of a composite service when selecting service providers. This paper proposes a service composition scheme that uses a combination of Integer Programming, case-based reasoning, and, genetic algorithms techniques. The scheme reduces the service composition costs by reusing existing compositions. Experiments show that, compared with solutions purely based on Integer Programming, the proposed scheme is effective in reducing the time for carrying out service composition. <div align="center"><a href="uploadfiles/2008/VIDEO/ICWS2008-1007/ICWS2008-1007.html" target="_blank"><strong>&amp;gt;&amp;gt;&amp;gt; View Video(Flash Player 9 please. Version 10 may not work as expected)</strong></a> </div></span><div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\ICWS2008-1007.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>3/31/2009 01:13</pubDate>
<author><![CDATA[Xinfeng Ye, Rami Mounla]]></author></item>
<item><title><![CDATA[An Adaptive Service Selection Approach to Service Composition]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1572</link>
<description><![CDATA[&amp;nbsp; <span style="font-size: 10pt">In service computing, the behavior of a service may evolve. When an organization develops a service-oriented application in which certain services are provided by external partners, the organization should address the problem of uninformed behavior evolution of external services. This paper proposes an adaptive framework that bars problematic external services to be used in the service-oriented application of an organization. We use dynamic WSDL information in public service registries to approximate a snapshot of a network of services, and apply link analysis on the snapshot to identify services that are popularly used by different service consumers at the moment. As such, service composition can be strategically formed using the highly referenced services. We evaluate our proposal through a simulation study. The results show that, in terms of the number of failures experienced by service consumers, our proposal significantly outperforms the random approach in selecting reliable services to form service compositions.</span><div></div><div></div>]]></description>
<pubDate>11/19/2008 01:27</pubDate>
<author><![CDATA[Lijun Mei,W.K. Chan, T.H. Tse]]></author></item>
<item><title><![CDATA[Discovering Reference Process Models by Mining Process Variants]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1569</link>
<description><![CDATA[&amp;nbsp; <span style="font-size: 10pt">Recently, a new generation of adaptive Process-Aware Information Systems (PAIS) has emerged, which allows for dynamic process and service changes (e.g., to insert, delete, and move activities and service executions in a running process). This, in turn, has led to a large number of process variants derived from the same model, but differing in structure due to the applied changes. Generally, such process variants are expensive to configure and difficult to maintain. This paper provides a sophisticated approach which fosters learning from past process changes and allows for mining process variants. As a result we obtain a generic process model for which the average distance between this model and the respective process variants becomes minimal. By adopting this generic model in the PAIS, need for future process configuration and adaptation decreases, we have validated the proposed mining method and implemented it in a powerful proof-of concept prototype.</span> <div align="center"><a href="uploadfiles/2008/VIDEO/ICWS2008-1005/ICWS2008-1005.html" target="_blank"><strong>&amp;gt;&amp;gt;&amp;gt; View Video(Flash Player 9 please. Version 10 may not work as expected)</strong></a> </div><div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\ICWS2008-1005.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>4/16/2009 04:47</pubDate>
<author><![CDATA[Chen Li, Manfred Reichert, Andreas Wombacher]]></author></item>
<item><title><![CDATA[A Temporal Data-Mining Approach for Discovering End-to-End Transaction Flows]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1568</link>
<description><![CDATA[&amp;nbsp; <span style="font-size: 10pt">Effective management of Web Services systems relies on accurate understanding of end-to-end transaction flows, which may change over time as the service composition evolves. This work takes a data mining approach to automatically recovering end-to-end transaction flows from (potentially obscure) monitoring events produced by monitoring tools. We classify the caller-callee relationships among monitoring events into three categories (identity, direct-invoke, and cascaded-invoke), and propose unsupervised learning algorithms to generate rules for each type of relationship. The key idea is to leverage the temporal information available in the monitoring data and extract patterns that have statistical significance. By piecing together the caller-callee relationships at each step along the invocation path, we can recover the end-to-end flow for every executed transaction. Experiments demonstrate that our algorithms outperform human experts in terms of solution quality, scale well with the data size, and are robust against noises in monitoring data.</span> <div align="center"><a href="uploadfiles/2008/VIDEO/ICWS2008-1004/ICWS2008-1004.html" target="_blank"><strong>&amp;gt;&amp;gt;&amp;gt; View Video(Flash Player 9 please. Version 10 may not work as expected)</strong></a> </div><div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\ICWS2008-1004.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>4/16/2009 03:55</pubDate>
<author><![CDATA[Ting Wang, Chang-shing Perng, Tao Tao, Chunqiang Tang,Edward So, Chun Zhang,Rong Chang,Ling Liu]]></author></item>
<item><title><![CDATA[Using User Interface Design to Enhance Service Identification]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1573</link>
<description><![CDATA[&amp;nbsp; <span style="font-size: 10pt">User Interface (UI) design is an integral part of the software design process. The UI design not only outlines the look and feel of the system, but also helps in flushing out the requirements-by identifying what data is visible to and processed by different users. However, in any SOA methodology, UI design is typically considered out of scope. In this paper, we highlight the importance of UI design specification in the SOA landscape, from a service-identification perspective. Service identification, which is a key activity in any SOA-based development, involves specification of business requirements as a set of granular service definitions. We propose an approach for harvesting the UI design specification to define service requirements for the intended system; more specifically in terms of information and business service requirements. Our approach consists of the following steps: (1) capture user interface design in a format amenable to automated analysis, with appropriate references to data and process models, (2) identify requirements for information services from data that is displayed in the user interface, and (3) identify business service requirements from the UI navigation flow and the links between the UI and the business process model. To illustrate our approach, we present a case study using the Amazon Associate Web Services. The study demonstrates how the use of UI designs can lead to better service identification. The proposed approach can complement any existing SOA methodology that follows a top-down approach to identify services.</span><div></div><div></div>]]></description>
<pubDate>11/19/2008 01:29</pubDate>
<author><![CDATA[Senthil Mani, Vibha S Sinha, Noi Sukaviriya, Thejaswini Ramachandra]]></author></item>
<item><title><![CDATA[A Context-driven Content Adaptation Planner for Improving Mobile Internet Accessibility]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1574</link>
<description><![CDATA[&amp;nbsp; <span style="font-size: 10pt">This paper presents our design and development of a context-driven content adaptation planner, which dynamically transforms requested Web content into a proper format conforming to receiving contexts (e.g., access condition, network connection, and receiving device). Aiming to establish a semantic foundation for content adaptation, we apply description logics (DLs) to formally define context profiles and requirements and automate content adaptation decision. In addition, the computational overhead caused by content adaptation can be moderately decreased through the reduction of the size of adapted content.</span><div></div><div></div>]]></description>
<pubDate>11/19/2008 01:30</pubDate>
<author><![CDATA[Stephen J.H. Yang, Jia Zhang, Angus F.M. Huang, Jeffrey J.P. Tsai, Philip S. Yu]]></author></item>
<item><title><![CDATA[Realizing an Open Ubiquitous Environment in a RESTful Way]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1575</link>
<description><![CDATA[&amp;nbsp; <span style="font-size: 10pt">Web services have been widely used to support context-aware applications for context information retrieval in a ubiquitous environment. However, most of the existing research efforts in this field only focus on using SOAP web service as an enabling technology. In this paper, we compare REST and SOAP web services for supporting ubiquitous environments. We describe our approaches to deploy an open ubiquitous computing environment using REST style services along with semantic web and mobile technologies. We also discuss an example context-aware application developed for the environment and show how REST style services can contribute in moving ubiquitous computing technologies into the real world.</span><div></div><div></div>]]></description>
<pubDate>11/19/2008 01:33</pubDate>
<author><![CDATA[Yong Liu, Kay Connelly]]></author></item>
<item><title><![CDATA[A QoS-Oriented Reconfigurable Middleware for Self-Healing Web Services]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1576</link>
<description><![CDATA[&amp;nbsp; <span style="font-size: 10pt">Maintaining the Quality of Service (QoS) is important</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">for self-healing web service-based distributed interactive</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">applications. It requires the ability to deal with permanently</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">changing constraints both at the communication and</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">the execution levels. Preventing or repairing QoS degradation</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">also requires the capacity of identifying its possible or</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">actual sources and the capacity of reconfiguration decision</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">challenging for web services since the self-healing solution has to preserve the dynamic composition property and to be</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">seamless for the service requesters, while being always usable</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">under the different deployment constraints. In this paper,</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">we present a self-healing middleware framework able</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">to provide the self-healing properties for QoS management</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">in web service-based distributed interactive applications.</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">The framework implementation has been achieved in the</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">context of the WS-DIAMOND project. It covers the whole</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">cycle of adaptation management including monitoring and</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">analysis of QoS values, and substitution-based reconfiguration.</span><div></div><div></div>]]></description>
<pubDate>11/19/2008 01:34</pubDate>
<author><![CDATA[Riadh Ben Halima,Khalil Drira, Mohamed Jmaiel]]></author></item>
<item><title><![CDATA[Exploiting Semantics for Analyzing and Verifying Business Rules in Web Services Composition and Contracting]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1577</link>
<description><![CDATA[&amp;nbsp; <span style="font-size: 10pt">Web services composition process needs business rules</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">to regulate the behavior of the partner</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">services. However,</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">designing these rules is time-consuming and error-prone,</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">especially under the condition that current standards barely</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">provide any abstract and high-level guidance.</span><span style="font-size: 10pt"> In</span><span style="font-size: 10pt"> this spirit,</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">rule analysis and verification for services composition is</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">urgently required to augment its reliability and usability.</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">In this paper, we choose a variant of Description Logics,</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">called ALCO (Q</span><span style="font-size: 10pt">), as the underlying logic, and provide</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">a formal mapping to transform ECA rules, so that the semantics</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">in the original ECA rules can be captured and are</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">computationally traceable. To this end, we further investigate</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">some important properties for business rules, namely,</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">redundancy, termination and conflict, and propose several</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">sound and complete algorithms to resolve them.</span> <div align="center"><a href="uploadfiles/2008/VIDEO/ICWS2008-1013/ICWS2008-1013.html" target="_blank"><strong>&amp;gt;&amp;gt;&amp;gt; View Video(Flash Player 9 please. Version 10 may not work as expected)</strong></a> </div><div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\ICWS2008-1013.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>3/30/2009 04:21</pubDate>
<author><![CDATA[Hai Liu,Qing Li,Naijie Gu,An Liu]]></author></item>
<item><title><![CDATA[On Extending Semantic Matchmaking to Include Preconditions and Effects]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1578</link>
<description><![CDATA[&amp;nbsp;<span style="font-size: 10pt">Central to the notion of dynamic binding and loose</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">coupling that underlie service-oriented architectures is</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">dynamic service discovery. At the heart of most service</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">discovery mechanisms is a matchmaking algorithm that</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">matches a semantic query to a set of compatible web</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">service advertisements. These advertisements also</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">describe service semantics as a set of OWL-S terms. Most</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">current matchmaking algorithms are based on semantic</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">matching of input and output terms</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">alone. However, a</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">complete description of the service profile also includes</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">preconditions and</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">effects and in order to find a true</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">match the matchmaker needs to match on these aspects of</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">the</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">advertisement as well.</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">In this paper, we make the case for augmenting</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">existing matchmaking</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">algorithms with preconditions and</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">effects in the context of Web Services. Further, we</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">propose an</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">algorithm for condition matching that is</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">layered on the top of input-output term matching that</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">overcomes the limitations of existing work. Although the</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">problem of condition matching is NP</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">Complete, we can</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">overcome this limitation by using a set of heuristics that</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">gives us results in polynomial time. We also analyze</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">complexity of the algorithm by comparing it with brute</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">force approach of matching. We show that our algorithm</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">yields results more efficiently than brute force matching</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">but with the same accuracy.</span><div></div><div></div>]]></description>
<pubDate>11/19/2008 01:59</pubDate>
<author><![CDATA[Umesh Bellur,Harin Vadodari]]></author></item>
<item><title><![CDATA[A Semantic QoS-Aware Discovery Framework for Web Services]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1579</link>
<description><![CDATA[&amp;nbsp; <span style="font-size: 10pt">Augmenting web services with explicit semantics forms</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">the foundation of Service Oriented Architectures (SOAs)</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">automation. As more and more Semantic Web Services</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">(SWSs) are</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">deployed, similar SWSs could have quite</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">different quality-of-service (QoS) levels. The QoS-aware</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">discovery becomes an important challenge. While some</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">efforts try to solve it via</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">Constraint Programming (CP),</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">they suffer from the purely syntactic matchmaking method.</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">Furthermore, the construction of constraints and the</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">selection of services are completely dependent on the</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">literal translation from QoS descriptions, which increase</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">obstacles to actually</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">apply CP. In this paper, we propose</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">a semantic QoS-aware framework for SWSs discovery by</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">combining the semantic matchmaking and CP. Initially, a</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">QoS ontology is presented to define QoS data into service</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">descriptions. Then the ontology reasoning is adopted to</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">change previous syntactic matchmaking into a semantic</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">way. Through confirming the compatibility of concepts,</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">complex QoS conditions are solved as constraints and a</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">selection algorithm is proposed to obtain</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">the optimal offer.</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">Finally, the prototype implementation of our framework is</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">discussed and a</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">SWSs discovery case is used to illustrate</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">the comprehensive discovery process.</span><div></div><div></div>]]></description>
<pubDate>11/19/2008 02:00</pubDate>
<author><![CDATA[Qian MA,Hao WANG,Ying LI,Guotong XIE,Feng LIU]]></author></item>
<item><title><![CDATA[An Overview and Evaluation of Web Services Security Performance Optimizations]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1580</link>
<description><![CDATA[&amp;nbsp; <span style="font-size: 10pt">WS-Security is an essential component of the Web services protocol stack. WS-Security provides end-to-end security properties (integrity, confidentiality, and authentication) through open XML standards. End-to-end message security assures the participation of non-secure transport intermediaries in message exchanges, which is a key advantage for Web-based systems and service-oriented architectures. However, point-to-point message security based on TLS (Transport Layer Security) is known to significantly outperform WS-Security. In this paper we analyze the overhead of the WS-Security protocol processing stages and evaluate the existing and new techniques for WS Security signature performance optimizations to speed up end-to-end message integrity assurance and authentication.</span><div></div><div></div>]]></description>
<pubDate>11/19/2008 02:02</pubDate>
<author><![CDATA[Robert A van Engelen,Wei Zhang]]></author></item>
<item><title><![CDATA[A Distributed Replication Strategy Evaluation and Selection Framework for Fault Tolerant Web Services]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1581</link>
<description><![CDATA[&amp;nbsp; <span style="font-size: 10pt">Redundancy-based fault tolerance strategies are proposed for building reliable Service-Oriented Architectures/ Applications (SOA), which are usually developed on the unpredictable remote Web services. This paper proposes and implements a distributed replication strategy evaluation and selection framework for fault tolerant Web services. Based on this framework, we provide a systematic comparison of various replication strategies by theoretical formula and real-world experiments. Moreover, a user participated strategy selection algorithm is designed and verified. Experiments are conducted to illustrate the advantage of this framework. In these experiments, users from six different locations all over the world perform evaluation of Web services distributed in six countries. Over 1,000,000 test cases are executed in a collaborative manner and detailed results are also provided.</span><div></div><div></div>]]></description>
<pubDate>11/19/2008 02:04</pubDate>
<author><![CDATA[Zibin Zheng,Michael R. Lyu]]></author></item>
<item><title><![CDATA[A Rule-based Approach for Availability of Web Service]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1582</link>
<description><![CDATA[&amp;nbsp; <span style="font-size: 10pt">Sustainable success of service oriented applications</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">relies on capabilities to manage possible service</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">failures. To substitute a failed service with some</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">other equivalent service is unavoidable in recovering</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">a suspended application due to failure of a</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">constituent service. In this paper, we report a rule</span><span style="font-size: 10pt">-</span><span style="font-size: 10pt">based</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">approach to Web service substitution in order</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">to secure availability of services. Availability</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">provides delivery assurance for each Web service so</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">that Simple Object Access Protocol (SOAP) messages</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">cannot be lost undetectably, especially in a Web</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">service composition. The rules are written in</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">Semantic Web Rule Language. The rules are a formal</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">representation of a categorization-based scheme to</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">identify exchangeable Web services. This scheme not</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">only tackles the issue of heterogeneity of domain</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">ontology in describing the Web services,</span><span style="font-size: 10pt"> it</span><span style="font-size: 10pt"> also</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">adapts itself by learning newly discovered ontology</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">instances. A technical framework of Web service</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">substitution using rule based deduction is</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">demonstrated. Experiments on service substitution</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">based on the proposed framework achieve a best</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">precision of 85%.</span><div></div><div></div>]]></description>
<pubDate>11/19/2008 02:05</pubDate>
<author><![CDATA[Qianhui Althea Liang,Herman Lam,Lalita Narupiyakul,Patrick C. K. Hung]]></author></item>
<item><title><![CDATA[Automatically Determining Compatibility of Evolving Services]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1583</link>
<description><![CDATA[&amp;nbsp; <span style="font-size: 10pt">A major advantage of Service-Oriented Architectures</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">(SOA) is composition and coordination of loosely coupled</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">services. Because the development lifecycles of services</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">and clients are de</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">coupled, multiple service versions have</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">to be maintained to continue supporting older clients.</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">Typically versions are managed within the SOA by</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">updating service descriptions using</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">conventions on</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">version numbers and namespaces. In all cases, the</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">compatibility among services description must be</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">evaluated, which can be hard, error-prone and costly if</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">performed manually,</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">particularly for complex</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">descriptions. In this paper, we describe a method to</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">automatically</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">determine when two service descriptions are</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">backward compatible. We then describe a case study to</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">illustrate how we leveraged version compatibility</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">information in a SOA environment and present initial</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">performance overheads of doing so. By automatically</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">exploring compatibility information, a) service developers</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">can assess the impact of proposed changes; b) proper</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">versioning requirements can be put in client</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">implementations guaranteeing that incompatibilities will</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">not occur during run-time; and c) messages exchanged in</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">the SOA can be validated to ensure that only expected</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">messages or compatible ones are exchanged.</span> <div align="center"><a href="uploadfiles/2008/VIDEO/ICWS2008-1019/ICWS2008-1019.html" target="_blank"><strong>&amp;gt;&amp;gt;&amp;gt; View Video(Flash Player 9 please. Version 10 may not work as expected)</strong></a> </div><div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\ICWS2008-1019.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>4/01/2009 21:00</pubDate>
<author><![CDATA[Karin Becker,Andre Lopes,Dejan Milojicic,Jim Pruyne,Sharad Singhal]]></author></item>
<item><title><![CDATA[Adaptive Quality Recommendation Mechanism for Software Service Provisioning]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1584</link>
<description><![CDATA[&amp;nbsp; <span style="font-size: 10pt">In this paper, we propose an adaptive quality recommendation mechanism to help software service providers understand the dynamism of quality demand from the majority of requesters accurately. The unique feature of our approach is that based on the intra-cluster proximity index (called the icp-index) that we propose, the granularity of service clusterig can be adjusted dynamically to meet the wide variation of service providers who want to target their services to different groups of clients. Experiments show that our approach is more accurate and flexible to identify the need of service quality of requesters than existing solutions such as simple averaging, minimum maximum-mean, or traditional interval-range data clustering.</span><div></div><div></div>]]></description>
<pubDate>11/19/2008 02:11</pubDate>
<author><![CDATA[SiMing Li,Chen Ding,Chi-Hung Chi,Jianming Deng]]></author></item>
<item><title><![CDATA[A Faceted Classification Based Approach to Search and Rank Web APIs]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1585</link>
<description><![CDATA[&amp;nbsp; <span style="font-size: 10pt">Web application hybrids, popularly known as mashups, are created by integrating services on the Web using their APIs. Support for finding an API is currently provided by generic search engines or domain specific solutions such as ... Shortcomings of both these solutions in terms of and reliance on user tags make the task of identifying an API challenging. Since these APIs are described in HTML documents, it is essential to look beyond the boundaries of current approaches to Web service discovery that rely on formal descriptions. In this work, we present a faceted approach to searching and ranking Web APIs that takes into consideration attributes or facets of the APIs as found in their HTML descriptions. Our method adopts current research in document classification and faceted search and introduces the serviut score to rank APIs based on their utilization and popularity. We evaluate classification, search accuracy and ranking effectiveness using available APIs while contrasting our solution with existing ones.</span><div></div><div></div>]]></description>
<pubDate>11/19/2008 02:13</pubDate>
<author><![CDATA[Karthik Gomadam,Ajith Ranabahu,Meenakshi Nagarajan,Amit. P. Sheth,Kunal Verma]]></author></item>
<item><title><![CDATA[Communications Semantics for WSBPEL Processes]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1586</link>
<description><![CDATA[&amp;nbsp; <span style="font-size: 10pt">WSBPEL opens up the possibility of applying a range of formal techniques to the verification of Web service behaviors from two points of view: constraints between activities within the same process and dependencies between activities of different processes. In a previous work, we have described an approach for the verification of Web service compositions defined by a set of BPEL processes. The key aspect of such a verification task is the model adopted for representing the communications among the services participating to the composition. In this paper, we propose to extend this approach to handle dependencies between activities of different process orchestrations through message exchanges. Our aim is to enable supporting models of service choreography with multiple interacting Web services compositions, from the perspective of a collaborative distributed composition development environment. The process of behavior analysis moves from a single local process to that of modeling and analyzing the behavior of multiple processes across composition domains.</span><div></div><div></div>]]></description>
<pubDate>11/19/2008 02:18</pubDate>
<author><![CDATA[Walid Fdhila,Mohsen Rouached,Claude Godart]]></author></item>
<item><title><![CDATA[A Formal Model of Human Workflow]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1587</link>
<description><![CDATA[&amp;nbsp; <span style="font-size: 10pt">BPEL (Business Process Execution Language) has become the standard for specifying and executing workflow specifications for Web service composition invocation. A major weakness of BPEL is the lack of so-called &amp;quot;human workflow&amp;quot; support. The BPEL4People specification tries to amend this by adding human task support to BPEL. In this paper, we propose a formal model of BPEL4People using the CSP process algebra, and discuss some issues we found through analyzing the model. Although based on BPEL4People, this is a general work, and can also be viewed as a formal model of human workflow.</span> <div align="center"><a href="uploadfiles/2008/VIDEO/ICWS2008-1023/ICWS2008-1023.html" target="_blank"><strong>&amp;gt;&amp;gt;&amp;gt; View Video(Flash Player 9 please. Version 10 may not work as expected)</strong></a> </div><div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\ICWS2008-1023.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>6/05/2009 03:34</pubDate>
<author><![CDATA[Xiangpeng Zhao,Zongyan Qiu Chao Cai,Hongli Yang]]></author></item>
<item><title><![CDATA[Service Level Agreement Based Grid Scheduling]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1588</link>
<description><![CDATA[&amp;nbsp; <span style="font-size: 10pt">n order to co-ordinate multiple resource providers in grid environment to meet a common objective, support for negotiation is needed to establish a contract between the user and the resource providers that clearly states the QoS required restrictions on resource utilization and penalties during violation of the objective. Strength of the negotiation process mainly depends on the selection of resources for negotiation. Currently, no grid meta scheduler supports SLA negotiation. We propose a deviation based resource ordering algorithm (DRS) that orders and selects the resources for negotiation based on their deviation value computed from the parameters in the job request against their current availability in the resources. Also, we propose mutual agreement protocol (MAP) to negotiate with resources in order to get their commitment gains the job request. We simulate this negotiation process and compare it with grid way meta scheduler that shows improved performance in terms of average SLA creation time, success rate and throughput.</span><div></div><div></div>]]></description>
<pubDate>11/19/2008 02:22</pubDate>
<author><![CDATA[P.Balakrishnan,S.Thamarai Selvi,G.Rajesh Britto]]></author></item>
<item><title><![CDATA[Semantic and Syntactic Data Flow in Web Service Composition]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1589</link>
<description><![CDATA[&amp;nbsp; <span style="font-size: 10pt">Automation of Web service composition is one of the</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">most interesting challenges facing the Service Oriented</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">Computing today. From this challenge, many issues such as</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">control flow, data flow, verification, execution monitoring,</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">or recovery actions (e.g., compensation) follows. In this paper</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">we focus on automated data flow in Web service composition.</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">The semantic Web, as an</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">evolving extension of the</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">current Web, seems a key initiative to overcome the latter</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">issue. However, even if some approaches focus on discovering</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">potential semantic connections between Web services,</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">few or none of these tackle implementations issues</span><span style="font-size: 10pt"> is</span><span style="font-size: 10pt"> related</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">to XML messages management at syntactic level. In this direction</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">we present an approach for performing automated</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">data flow in Web service composition by i) exploiting semantic</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">matchmaking between Web service parameters (i.e.,</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">outputs and inputs) to enable their connection and interaction,</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">and ii) adapting XML database solutions, specifically</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">XML Schema mapping, to perform syntactic data transformation</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">and integration of exchanged messages. Our system</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">is implement</span><span style="font-size: 10pt">ed</span><span style="font-size: 10pt"> and interacting with Web services dedicated</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">on a Telecom scenario. The preliminary evaluation results</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">showed not only high efficiency and effectiveness of the proposed</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">approach but also complementarities of the semantic</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">matchmaking and syntactic mapping to achieving data flow</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">in Web service composition.</span> <div align="center"><a href="uploadfiles/2008/VIDEO/ICWS2008-1025/ICWS2008-1025.html" target="_blank"><strong>&amp;gt;&amp;gt;&amp;gt; View Video(Flash Player 9 please. Version 10 may not work as expected)</strong></a> </div><div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\ICWS2008-1025.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>4/01/2009 05:44</pubDate>
<author><![CDATA[Freddy L´ecu´e,Samir Salibi,Philippe Bron,Aur´elien Moreau]]></author></item>
<item><title><![CDATA[Generalized Semantics-based Service Composition]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1590</link>
<description><![CDATA[&amp;nbsp; <span style="font-size: 10pt">Service-oriented computing (SOC) has emerged as</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">the eminent market environment for sharing and reusing</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">service-centric capabilities. The underpinning for an organization&amp;#39;s</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">use of SOC techniques is the ability to discover</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">and compose Web services. Although industry approaches</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">to composition have a strong notion of business processes,</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">these approaches largely use syntactic descriptions. As</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">such composition is limited since the true functionality of</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">ambiguous service operations cannot be inferred. Alternatively,</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">academia uses semantic approaches to disambiguate</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">services, but, at the same time, most of these approaches neglect</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">the process rigor needed for complex compositions. In</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">this paper we present a generalized semantics-based technique</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">for automatic service composition that combines the</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">rigor of process-oriented composition with the descriptiveness</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">of semantics. Our generalized approach extends the</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">common practice of linearly linked services by introducing</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">the use of a conditional directed acyclic graph (DAG)</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">where complex interactions, containing control flow, information</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">flow and pre/post conditions, are effectively represented.</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">Furthermore, the composition can be represented</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">semantically as OWL-S documents. Our contributions are</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">applied for automatic workflow generation in context of the</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">currently important bioinformatics domain.</span><div></div><div></div>]]></description>
<pubDate>11/19/2008 02:25</pubDate>
<author><![CDATA[Srividya Kona,Ajay Bansal,M. Brian Blake,Gopal Gupta]]></author></item>
<item><title><![CDATA[A Framework for the Semantic Composition of Web Services Handling User Constraints]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1591</link>
<description><![CDATA[&amp;nbsp; <span style="font-size: 10pt">In this work, we present a framework for the semantic composition of web services based on Statecharts and uniform community service descriptions. Our model is a two step process. In the first step, we derive the execution model of the user&amp;#39;s query. The execution model is specified in Statecharts formalism; whereas the user&amp;#39;s query is described in OWL-S. Therefore, a mapping from Statecharts formalism to OWL-S is developed. In the second step, we instantiate the developed execution model through invocation of available e-services instances. Hence, as a result, we obtain an execution plan (said also strategy) satisfying user constraints. The key features of the proposed framework could be summarized as follows. First, unlike other existing languages, using OWL-S enables the semantic description of e-services. These semantics are taken into consideration in our composition strategy. Second, the user constraints (or preferences) are taken into account during composition and are expressed as a finite set of logical formulas with the Knowledge Interchange Format (KIF) language.</span><div></div><div></div>]]></description>
<pubDate>11/19/2008 02:27</pubDate>
<author><![CDATA[Y. Gamha,N. Bennacer,G. V. Naquet,B. Ayeb,L. B. Romdhane]]></author></item>
<item><title><![CDATA[Towards Heuristic Web Services Composition Using Immune Algorithm]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1592</link>
<description><![CDATA[One of the main benefits of web services is the dynamic compensability; however how to achieve this is one of the current research challenges. Web service composition has been studied and, amongst other methods, the use of natural computing methods has been proposed previously. In this paper, we address the need for a fast response when computing the most suitable sequence of services. In particular, we propose a novel heuristic immune algorithm with an efficient encoding and mutation method. The algorithm involves two steps: an immune selection operation, which is maintaining antibody population diversity and a colonial selection. The use of a vaccine during the evolution provides heuristic information that accelerates the convergence. Our experimental results illustrate that the proposed heuristic immune algorithm is very effective in improving the convergence speed <div align="center"><a href="uploadfiles/2008/VIDEO/ICWS2008-1028/ICWS2008-1028.html" target="_blank"><strong>&amp;gt;&amp;gt;&amp;gt; View Video(Flash Player 9 please. Version 10 may not work as expected)</strong></a> </div><div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\ICWS2008-1028.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>6/04/2009 04:42</pubDate>
<author><![CDATA[Jiuyun Xu,Stephan Reiff-Marganiec]]></author></item>
<item><title><![CDATA[Automatic Service Composition Based on Enhanced Service Dependency Graph]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1593</link>
<description><![CDATA[Service dependency graph (SDG) is an AND/OR graph showing input output dependencies among service operations. As dependencies in an SDG are indirectly expressed by reasoning on data models used by service interface definitions, their re-usability and expressiveness are limited. In this paper, we propose an enhanced version of service dependency graph, namely SDG+. SDG+ enhances SDG with explicit dependency declaration, which expresses dependencies directly with static explicit declarations. Based on SDG+, we developed our automatic service composition algorithm for WS-Challenge 2007, which wins the championship of composition efficiency in the competition. <div align="center"><a href="uploadfiles/2008/VIDEO/ICWS2008-1029/ICWS2008-1029.html" target="_blank"><strong>&amp;gt;&amp;gt;&amp;gt; View Video(Flash Player 9 please. Version 10 may not work as expected)</strong></a> </div><div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\ICWS2008-1029.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>6/04/2009 04:46</pubDate>
<author><![CDATA[Zhifeng Gu,Juanzi Li,Bin Xu]]></author></item>
<item><title><![CDATA[Towards Verifying Contract Regulated Service Composition]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1594</link>
<description><![CDATA[&amp;nbsp; <span style="font-size: 10pt">We report on a novel approach to (semi-)automatically compile and verify contract-regulated service compositions. We specify web services and the contracts governing them as WSBPEL behaviors. We compile WSBPEL behaviors into the specialized system description language ISPL, to be used with the model checker MCMAS to verify behaviors automatically. We use the formalism of temporal-epistemic logic suitably extended to deal with compliance/violations of contracts. We illustrate these concepts using a motivating example whose state space is approximately 106 and discuss experimental results.</span><div></div><div></div>]]></description>
<pubDate>11/19/2008 02:32</pubDate>
<author><![CDATA[Alessio Lomuscio,Hongyang Qu,Monika Solanki]]></author></item>
<item><title><![CDATA[Multimedia Content Provisioning Using Service Oriented Architectures]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1595</link>
<description><![CDATA[&amp;nbsp; <span style="font-size: 10pt">Today, multimedia system is still widely realized as monolithic systems. But building such applications using Service-Oriented Architectures - especially for the Processing and Delivery of continuous Multimedia data streams - has been a controversial topic since years. As a result, applications in the multimedia domain cannot yet benefit from Web service architectures. Thus, building and maintaining large-scale multimedia applications remains a difficult, costly, time-consuming and challenging problem. In this paper we present our approach for building large scale multimedia systems and compare it with the current state of the art, concentrating on the selection and validation of multimedia service composition.</span> <div align="center"><a href="uploadfiles/2008/VIDEO/ICWS2008-1031/ICWS2008-1031.html" target="_blank"><strong>&amp;gt;&amp;gt;&amp;gt; View Video(Flash Player 9 please. Version 10 may not work as expected)</strong></a> </div><div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\ICWS2008-1031.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>3/30/2009 22:38</pubDate>
<author><![CDATA[Ingo Brunkhorst,Sascha Toennies Wolf-Tilo Balke]]></author></item>
<item><title><![CDATA[A Trust Vector Approach to Service-Oriented Applications]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1596</link>
<description><![CDATA[&amp;nbsp; <span style="font-size: 10pt">Trust is a critical issue in e-commerce and e-service environments. In some applications (such as eBay), the trust management mechanisms have been introduced to provide valuable information to buyers prior to placing orders and making payments. Meanwhile, the trust issue is also actively studied in the research community. However, most studies and applications focus on approaches that result in a single trust value to represent the trust level of sellers or service providers. Such a simple trust evaluation method may not be able to depict the trust history exactly and may leave misleading information to service customers. In this paper, we present a novel approach of trust vector consisting of three values to reflect the trust level with more indications.</span><div></div><div></div>]]></description>
<pubDate>11/19/2008 02:35</pubDate>
<author><![CDATA[Lei Li,Yan Wang]]></author></item>
<item><title><![CDATA[Measurement, Modeling, and Analysis of Internet Video Sharing Site Workload: A Case Study]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1597</link>
<description><![CDATA[&amp;nbsp; <span style="font-size: 10pt">In this paper we measured and analyzed the workload on Yahoo! Video, the 2nd largest U.S. video sharing site, to understand its nature and the impact on online video data center design. We discovered interesting statistical properties on both static and temporal dimensions of the workload; they include file duration and popularity distributions, arrival rate dynamics and predictability, and workload stationarity and burstiness. Complemented with queueing theoretic techniques, we extended our understanding on the measurement data with a virtual data center design assuming the same workload as measured, which reveals results regarding the impact of workload arrival distribution, Service Level Agreements (SLAs) and workload scheduling schemes on the design and operations of such large-scale video distribution systems.</span><div></div><div></div>]]></description>
<pubDate>11/19/2008 02:36</pubDate>
<author><![CDATA[Xiaozhu Kang,Hui Zhang,Guofei Jiang,Haifeng Chen,Xiaoqiao Meng,Kenji Yoshihira]]></author></item>
<item><title><![CDATA[High-Performance XML Parsing and Validation with Permutation Phrase Grammar Parsers]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1598</link>
<description><![CDATA[The extensibility, flexibility, expressiveness, and platform-neutrality of XML delivers key advantages for often comes at the price of reduced efficiency of message composition, transfer, and parsing compared to simple binary protocols. This paper presents a high-performance XML parsing and validation technique that is time and space optimal. A schema-specific parsing method is developed that uses a two-stack push-down automaton (PDA) for single-pass parsing and validation without backtracking. The schema validity constraints are packed in a compact parsing table derived from a permutation phrase grammar. This approach reduces both the space and time requirements of XML parsing and validation. By contrast, other XML schema-specific parsing methods trade efficiency for space (larger code and/or data size) or trade space for efficiency (backtracking). Performance results show that the method is significantly faster than traditional validating and non-validating XML parsers. <div align="center"><a href="uploadfiles/2008/VIDEO/ICWS2008-1034/ICWS2008-1034.html" target="_blank"><strong>&amp;gt;&amp;gt;&amp;gt; View Video(Flash Player 9 please. Version 10 may not work as expected)</strong></a> </div><div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\ICWS2008-1034.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>6/04/2009 04:50</pubDate>
<author><![CDATA[Wei Zhang,Robert A. van Engelen]]></author></item>
<item><title><![CDATA[Lazy XML Parsing/Serialization based on Literal and DOM Hybrid Representation]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1599</link>
<description><![CDATA[&amp;nbsp; <span style="font-size: 10pt">Distributed SOA computing environments usually use SOAP intermediaries that sit between senders and receivers to mediate SOAP messages. The intermediaries may add support services to the SOAP message exchange, such as routing, logging, and security. The typical processing by a SOAP intermediary is parsing the incoming SOAP messages, checking the data in each message, and then serializing the messages to put them back into the network. DOM is one of the popular interfaces to navigate an XML tree. Existing DOM implementations are not efficient for SOAP intermediary processing. Existing DOM implementations parse XML data to create tree data and traverse the tree data for serialization. Typically, a SOAP intermediary rarely modifies the tree data. In such situations, creating the tree data and serializing it back into XML data is computationally expensive. We propose a DOM implementation based on a hybrid data representation, literal XML and DOM object. In our implementation, a SOAP intermediary stores the original literal XML representation and reuses it to avoid traversing all of the tree data during serialization. We prototyped the DOM implementation and evaluated its performance.</span><div></div><div></div>]]></description>
<pubDate>11/19/2008 02:42</pubDate>
<author><![CDATA[Toshiro Takase,Keishi Tajima]]></author></item>
<item><title><![CDATA[Emergency Response Framework for Aviation XML Services on MANET]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1600</link>
<description><![CDATA[&amp;nbsp;&amp;nbsp;&amp;nbsp; <span style="font-size: 10pt">A XML service is a software component that supports interoperable application-to-application interaction over a network. Each service makes its functionality available through well-defined or standardized XML interfaces. Aviation XML services refer to the services that make operating an airplane in air and on ground possible. In this paper, we present an emergency response framework to organize the aviation XML services to work cooperatively on mobile ad-hoc networks (MANETs). A MANET is defined as a self-organized and rapidly deployed network of XML services in order to exchange information without using any pre-existing fixed network infrastructure. Note that the framework does not have to be limited to the aviation sector. The methodology can also be adopted into other MANET computing scenarios including: natural disaster communications (e.g., tsunami, earthquakes), emergency relief scenarios, car based networks, and the provision of wireless connectivity in remote areas.</span><div></div><div></div>]]></description>
<pubDate>11/19/2008 02:44</pubDate>
<author><![CDATA[YU Xiaofeng,Teodor Sommestad,Casey Fung,Patrick C.K. Hung]]></author></item>
<item><title><![CDATA[Extending WS-Notification with an Expressive Event Notification Broker]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1601</link>
<description><![CDATA[&amp;nbsp; <span style="font-size: 10pt">Web service applications integrate explicit client-service interactions with notification-style programming. Such event-driven interactions are often called implicit invocations because the notification message is not in itself a business interaction. Rather, it is used to implicitly trigger such interactions as a means for reacting to events. Web Services specifications such as WS-Notification have been developed in order to standardize the way notifications are sent, but they only support the most basic form of event notification. In this paper, we discuss the architecture and the implementation of an expressive notification broker based on extension mechanisms presented by the WS-Notification specification. This broker improves the standard WSN broker in three ways. First, it supports event correlation and hence allows for composite event detection Second, it integrates events and reactions into Event-Condition-Action (ECA) rules that can be registered directly at the broker. Third, it introduces event-driven lifecycle management for ECA rules, thus allowing to dynamically adapting these ECA rules to changing situations.</span><div></div><div></div>]]></description>
<pubDate>11/19/2008 02:46</pubDate>
<author><![CDATA[Sven De Labey,Eric Steegmans]]></author></item>
<item><title><![CDATA[A Theory of Role Composition]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1602</link>
<description><![CDATA[&amp;nbsp; <span style="font-size: 10pt">We study the access control integration problem for web services. Organizations frequently use many services, each with its own access control policies, which must interoperate while maintaining secure access to information. The integration problem is to take the set of such services and to find a globally consistent access control policy that ensures that the system composed from the services does not have any authorization failures or information disclosures. We give a sound and complete algorithm for access control integration by reducing the problem to Boolean constraint solving. We have implemented ROLEMATCHER, a tool to infer global role-based access control schemas for a set of services, and show examples that it can quickly infer global roles for composed systems, or determine the absence of a globally consistent role schema. </span><div></div><div></div>]]></description>
<pubDate>11/19/2008 02:47</pubDate>
<author><![CDATA[Jeffrey Fischer,Rupak Majumdar]]></author></item>
<item><title><![CDATA[On Synchronizing with Web Service Evolution]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1603</link>
<description><![CDATA[&amp;nbsp; <span style="font-size: 10pt">To catch up with today&amp;#39;s fast changing business markets, web services has never slowed down its paces for evolution. As a consequence, service consumers have to employ in-time upgrades to guarantee continuous business integrity and avoid unnecessary runtime errors in their IT systems. However, a new web service release can involve hundreds of changes, and thus it is non-trivial for the service consumer to rapidly track and adopt relevant changes. This paper proposes a framework for facilitating the service consumer to keep synchronized with the web service evolution. On the service side, a Service Invocation Monitor is installed to monitor the interaction history of the client, a Service Delta Analyzer exports the service delta into well-formatted document, and a Release Note Customizer is configured to customize the full release note produced using the monitored interaction history and exported service delta. On the client side, the Consumer Code Customizer is used by the consumer developer to highlight the code fragments to be changed and provide facilitation linkages between the code fragments and the customized release note. An example is shown to demonstrate the usefulness of our proposal.</span><div></div><div></div>]]></description>
<pubDate>11/19/2008 02:48</pubDate>
<author><![CDATA[Zhi Le Zou,Ru Fang,Liang Liu,Qing Bo Wang,Hao Wang]]></author></item>
<item><title><![CDATA[MashupAdvisor: A Recommendation Tool for Mashup Development]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1604</link>
<description><![CDATA[&amp;nbsp; <span style="font-size: 10pt">Mashup editors, like Yahoo Pipes </span><span style="font-size: 10pt">and</span><span style="font-size: 10pt"> IBM Lotus</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">Mashup Maker, allow non-programmer end-users to</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">&amp;quot;mash-up&amp;quot; information sources and services to meet their</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">information needs. However, with the increasing number of</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">services, information sources and complex operations like</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">filtering</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">and joining, even</span><span style="font-size: 10pt"> an</span><span style="font-size: 10pt"> easy to use editor is not sufficient.</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">MashupAdvisor aims to assist mashup creators to</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">build higher quality mashups </span><span style="font-size: 10pt">in</span><span style="font-size: 10pt"> less time. Based on the</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">current state of a mashup, the MashupAdvisor quietly suggests</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">outputs (goals) that the user might want to include in</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">the final mashup. MashupAdvisor exploits a repository of</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">mashups to estimate the popularity of specific outputs, and</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">makes suggestions using the conditional probability that</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">an output will be included, given the current state of the</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">mashup. When a suggestion is accepted, MashupAdvisor</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">uses a semantic matching algorithm and a metric planner</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">to modify the mashup to produce the suggested output. Our</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">prototype was implemented on top of IBM Lotus Mashup</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">Maker and our initial results show that it is effective.</span><div></div><div></div>]]></description>
<pubDate>11/19/2008 02:50</pubDate>
<author><![CDATA[Hazem Elmeleegy,Anca Ivan,Rama Akkiraju,Richard Goodwin]]></author></item>
<item><title><![CDATA[A Hybrid Integrated Architecture for Language Service Composition]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1605</link>
<description><![CDATA[&amp;nbsp; <span style="font-size: 10pt">This paper reports on our experiences with combining Heart of Gold and Language Grid technology to provide more language resources available on Web. Heart of Gold is known as middleware architecture for integrating deep and shallow Natural Language Processing components. The Language Grid is an infrastructure built on top of the Internet to provide distributed language services. Having Heart of Gold available as Web services in the Language Grid environment would contribute to interoperability among language services.</span><div></div><div></div>]]></description>
<pubDate>11/19/2008 02:51</pubDate>
<author><![CDATA[Arif Bramantoro,Masahiro Tanaka,Yohei Murakami,Ulrich Schäfer,Toru Ishida]]></author></item>
<item><title><![CDATA[Approaches to Improving Reliability in e-Engineering Framework]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1606</link>
<description><![CDATA[&amp;nbsp; <span style="font-size: 10pt">In order to improve productivity and quality of the products, there are many efforts to integrate and automate design/analysis processes based on various distributed engineering resources. KIMM (Korea Institute of Machinery and Materials) constructed SOA (Service Oriented Architecture)-based e- Engineering framework for flexible integration and automation of the engineering processes on the Web services environment. However, guaranteeing reliability in the engineering process is one of the new problems that must be solved in the e-Engineering framework. This paper presents two approaches to handle various exceptions that happen in the middle of the execution of the process. One is to introduce recovery activities into the engineering process modeling to handle exceptions caused by failures of the engineering resources; the other is to use log-based recovery techniques to recover from the system exceptions such as network failures or system crashes.</span><div></div><div></div>]]></description>
<pubDate>11/19/2008 02:52</pubDate>
<author><![CDATA[Seung Hak Kuk,Hyeon Soo Kim,Jai-Kyung Lee,Seong-Whan Park]]></author></item>
<item><title><![CDATA[Redundant-Free Web Services Composition based on a Two-Phase Algorithm]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1607</link>
<description><![CDATA[&amp;nbsp; <span style="font-size: 10pt">Web services composition search systems have received a great deal of attention recently. However, current solutions have limitations of inefficiency and including redundant web services in the results. In this paper, we proposed a redundant-free web services composition search based on a two phase algorithm. In the forward phase, the candidate composition will be found efficiently by searching the Link Index. In the backward phase, redundant-free web services compositions are generated from the candidate composition by using the concepts of tokens. Experimental results demonstrate the performance benefits of our proposed techniques compared to state-of-the-art composition approaches.</span> <div align="center"><a href="uploadfiles/2008/VIDEO/ICWS2008-1043_1044_1045/ICWS2008-1043_1044_1045.html" target="_blank"><strong>&amp;gt;&amp;gt;&amp;gt; View Video(Flash Player 9 please. Version 10 may not work as expected)</strong></a> </div><div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\ICWS2008-1043_1044_1045.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>5/22/2009 03:56</pubDate>
<author><![CDATA[Joonho Kwon,Hyeonji Kim,Daewook Lee,Sukho Lee,]]></author></item>
<item><title><![CDATA[A Faceted Requirements-Driven Approach to Service Design and Composition]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1608</link>
<description><![CDATA[&amp;nbsp; <span style="font-size: 10pt">The Web Services research community has proposed a number of approaches for service composition, ranging from manual to semi-automatic to completely automatic. However, it is often difficult to take independently developed services and compose them, since they may not work together correctly. For service composition to occur, the services in question must be designed and developed in a manner that facilitates their composition. In this paper, we propose a novel approach for service design and composition that combines top-down and bottom-up elements. Our approach is driven by faceted, tag-based functional requirements provided by end-users. These requirements describe, at a high-level, the families of compositions that end-users desire. The requirements kick off a top-down service development lifecycle, where enterprise architects and service developers design, develop and test workflows and services, possibly reusing existing flows and services in the process. At runtime, end-users can specify goals, which are satisfied through a bottom-up composition of flows from the available services. The composed flows include those explicitly designed by the architects as well as new ones that are assembled in a serendipitous manner from the available services. With examples from a case study in the Financial Services domain, we demonstrate our approach for designing and developing services that can be composed into myriad workflows based on end-user goals.</span> <div align="center"><a href="uploadfiles/2008/VIDEO/ICWS2008-1043_1044_1045/ICWS2008-1043_1044_1045.html" target="_blank"><strong>&amp;gt;&amp;gt;&amp;gt; View Video(Flash Player 9 please. Version 10 may not work as expected)</strong></a> </div><div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\ICWS2008-1043_1044_1045.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>5/21/2009 01:53</pubDate>
<author><![CDATA[Eric Bouillet,Mark Feblowitz,Zhen Liu,Anand Ranganathan,Anton Riabov]]></author></item>
<item><title><![CDATA[Composing Adaptive Web Services on COTS Middleware]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1609</link>
<description><![CDATA[&amp;nbsp;&amp;nbsp;&amp;nbsp; <span style="font-size: 10pt">Composing adaptive and self-managing Web services</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">needs plug-and-play architecture so that the deployment of</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">control components does not require changes made </span><span style="font-size: 10pt">to</span><span style="font-size: 10pt"> the</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">Web services and the host middleware platforms. This is</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">especially challenging for Web services running on COTS</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">middleware platforms, such as Microsoft .Net. In this paper,</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">we propose an architectural solution</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">that introduces a management</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">proxy between adaptive control components and</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">Web services. The management proxy can be customized</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">and seamlessly integrated with a COTS middleware platform</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">by leveraging the existing middleware mechanisms.</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">This solution enables dynamically composing adaptive Web</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">services on COTS middleware without stopping its services.</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">We demonstrate this architecture by a realistic Web service</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">application built on .Net Windows Communication Foundation</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">(WCF). The performance overhead incurred by this</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">architecture is measured, and the results validate that our</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">solution is efficient in terms of performance and flexibility.</span> <div align="center"><a href="uploadfiles/2008/VIDEO/ICWS2008-1043_1044_1045/ICWS2008-1043_1044_1045.html" target="_blank"><strong>&amp;gt;&amp;gt;&amp;gt; View Video(Flash Player 9 please. Version 10 may not work as expected)</strong></a> </div><div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\ICWS2008-1043_1044_1045.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>5/21/2009 02:46</pubDate>
<author><![CDATA[Yan Liu,Simon Truong,Shiping Chen,Liming Zhu]]></author></item>
<item><title><![CDATA[Performance Comparison of Web Service Engines In PHP, Java, and C]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1610</link>
<description><![CDATA[&amp;nbsp; <span style="font-size: 10pt">PHP is well known as a programming language in the Web 2.0 era enabling agile server-side software development. It has officially supported SOAP messaging since version 5 through a C-based built-in library. In this paper we perform a thorough study of the capability of PHP as a web service engine in both qualitative and quantitative aspects while comparing it with other web service engines implemented in Java and C. We used Axis2 for this purpose as it is an open source web service engine whose implementation is available both in Java and C. We report that PHP as a web service engine performs competitively with Axis2 Java for web services involving small payloads, and greatly outperforms it for larger payloads by 5-17 times. As the authors expect, Axis2 C performs best, but the experimental results demonstrate that PHP performance is closer to Axis2 C with larger payloads. This performance difference comes from the fact that the SOAP engine within the PHP runtime is implemented in C with a monolithic architecture, whereas Axis2 uses a more modular architecture for the flexible insertation of handlers for an assorted set of WS-* standards, and also that Axis2 uses a different data binding mechanism known as ADB (Axis2 Data binding). This paper is the first attempt to compare web services engines implemented in PHP, Java and C, and the authors believe that this boosts the development of SOAP-based Web services in PHP by letting people know its decent performance score and high productivity characteristics.</span><div></div><div></div>]]></description>
<pubDate>11/19/2008 02:59</pubDate>
<author><![CDATA[Toyotaro Suzumura,Scott Trent,Michiaki Tatsubori,Akihiko Tozawa,Tamiya Onodera]]></author></item>
<item><title><![CDATA[A Meta-Model For Non-Functional Property Descriptions of Web Services]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1611</link>
<description><![CDATA[&amp;nbsp; <span style="font-size: 10pt">In this paper we propose a meta-model for nonfunctional</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">property descriptions targeted to support the selection</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">of Web Services. The approach is based on the explicit</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">distinction between NFP offered by providers and</span><span style="font-size: 10pt"> that</span><span style="font-size: 10pt"> requested</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">by users, on the concept of policy that aggregates</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">NFP descriptions into single entities </span><span style="font-size: 10pt">under</span><span style="font-size: 10pt"> an applicability</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">condition, and finally on a set of constraint operators, which</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">is particularly relevant for NFP requests. The semantic</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">meta-model embracing the above perspective</span><span style="font-size: 10pt">s</span><span style="font-size: 10pt"> is defined by a</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">BNF syntax whose semantics is formalized by ontology.</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">The ontology has been formalized in OWL-DL and WSML</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">to provide for logical syntaxes. The logic upon which the</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">meta-model supports NFP-based selection is discussed in</span><span style="font-size: 10pt"> </span><span style="font-size: 10pt">the paper.</span> <div align="center"><a href="uploadfiles/2008/VIDEO/ICWS2008-1047/ICWS2008-1047.html" target="_blank"><strong>&amp;gt;&amp;gt;&amp;gt; View Video(Flash Player 9 please. Version 10 may not work as expected)</strong></a> </div><div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\ICWS2008-1047.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>4/09/2009 02:31</pubDate>
<author><![CDATA[Flavio De Paoli,Matteo Palmonari,Marco Comerio,Andrea Maurino]]></author></item>
<item><title><![CDATA[Evaluation of WSML Service Retrieval with WSMO-MX]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1612</link>
<description><![CDATA[&amp;nbsp; <span style="font-size: 10pt">The hybrid semantic Web service matchmaker WSMOMX applies different matching filters to retrieve WSML service descriptions which 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. In this paper, we provide results of our experimental evaluation of the performance of WSMO-MX. In summary, it turns out that hybrid semantic matching of WSML-MX services can outperform logic-based only semantic service matching. </span><div></div><div></div>]]></description>
<pubDate>11/19/2008 03:07</pubDate>
<author><![CDATA[Matthias Klusch,Patrick Kapahnkem,Frank Kaufer]]></author></item>
<item><title><![CDATA[Communication over IP Based on Web Services]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1613</link>
<description><![CDATA[In this paper, we study the communication over IP based on web services. We describe the service-oriented communication framework of WIP, Web Services Initiation Protocol, and focus on its web centric networking infrastructure. In our approach, WIP endpoints are exposed as resources on the Web, publishable by their UDDI service registries. They can be searched and discovered by regular web search engines, e.g. Google, upon which they can be networked and linked for scalable and distributed communication over IP. In our approach, the WIP endpoint is a web services based communication endpoint for communication over IP. It is also a service endpoint for software-as-a-service (SaaS) that can integrate, marshup, and enable advanced SaaS applications in communication. Moreover, we introduce the presence aware communication framework in WIP utilizing its extensible and service-oriented infrastructure. An advanced WIP communication system prototype has been implemented. It supports the advanced features described in this paper, including distributed communication, networking, security, presence, etc. Experimental results are presented, and the proposed approach and methods are validated. <div align="center"><a href="uploadfiles/2008/VIDEO/ICWS2008-1049_1050_1051/ICWS2008-1049_1050_1051.html" target="_blank"><strong>&amp;gt;&amp;gt;&amp;gt; View Video(Flash Player 9 please. Version 10 may not work as expected)</strong></a> </div><div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\ICWS2008-1049_1050_1051.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>5/21/2009 03:10</pubDate>
<author><![CDATA[Wu Chou,Li Li]]></author></item>
<item><title><![CDATA[Design and Development of A University-Oriented Personalizable Web 2.0 Mashup Portal]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1614</link>
<description><![CDATA[&amp;nbsp; <span style="font-size: 10pt">This paper reports several key challenges and solutions when we apply Web 2.0 mashup technology to build a university-oriented services portal. A two-layer mashup service model is proposed as the underlying basis to support multiple granularities of services mashup. We explore a caching technique to facilitate personalizable services requests. We also report our preliminary practice of exploiting Facebook as a social relationship data source.</span> <div align="center"><a href="uploadfiles/2008/VIDEO/ICWS2008-1049_1050_1051/ICWS2008-1049_1050_1051.html" target="_blank"><strong>&amp;gt;&amp;gt;&amp;gt; View Video(Flash Player 9 please. Version 10 may not work as expected)</strong></a> </div><div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\ICWS2008-1049_1050_1051.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>5/21/2009 03:14</pubDate>
<author><![CDATA[Jia Zhang,Momtazul Karim,Karthik Akula,Raghu Kumar Reddy Ariga]]></author></item>
<item><title><![CDATA[CAFISE-S: An Approach to Deploying SOA in Scientific Information Integration]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1615</link>
<description><![CDATA[&amp;nbsp; <span style="font-size: 10pt">The growing need for an integrated view of scientific information from different sources has led to the need for scientific information integration, and on the other hand; SOA is one most prevailing technology for its advantages in solving integration problems. In this paper, we argue that the deployment of SOA in an organization should be business domain-specific, and propose an approach called CAFISE-S, which introduces SOA into scientific information integration from a business view-aspect. Business service is put forward as basic elements in CAFISE-S to model business context and IT services coherently in a semantic way. Based on business service, CAFISE-S provides a business domain-specific modeling method for specification of information services, and then supports business-oriented publication, management and usage of information services. The implementation of CAFISE-S platform and an application of CAFISE-S in a real-world project of scientific information integration are also presented in this paper.</span> <div align="center"><a href="uploadfiles/2008/VIDEO/ICWS2008-1049_1050_1051/ICWS2008-1049_1050_1051.html" target="_blank"><strong>&amp;gt;&amp;gt;&amp;gt; View Video(Flash Player 9 please. Version 10 may not work as expected)</strong></a> </div><div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\ICWS2008-1049_1050_1051.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>5/21/2009 03:18</pubDate>
<author><![CDATA[Zhuofeng Zhao,Jun Fang,Jing Cheng]]></author></item>
<item><title><![CDATA[Classification of SOA Contract Specification Languages]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1616</link>
<description><![CDATA[&amp;nbsp; <span style="font-size: 10pt">There are numerous existing notations and standards in the Web service community. These may be grouped broadly into three competing families, namely; Web Services, Semantic Web, and Electronic Business. Although the families are competing, we expect that applications will cut across them and there is a need to map from one to another and to analyze compatibility and other properties. Therefore we survey how they deal with different aspects. We then illustrate with examples, the aspects of contracts captured by one language from each of the three competing families in addition to WSDL, the core standard for Web services description. The result is a classification based on the aspects of computations: functionality, protocol, and for instance performance covered by the languages. The classification is used to identify similarities among semantic models and thus find potential mappings between the families. Furthermore, this gives a handle on analysis techniques that may apply to the aspects in a particular family.</span> <div align="center"><a href="uploadfiles/2008/VIDEO/ICWS2008-1052/ICWS2008-1052.html" target="_blank"><strong>&amp;gt;&amp;gt;&amp;gt; View Video(Flash Player 9 please. Version 10 may not work as expected)</strong></a> </div><div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\ICWS2008-1052.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>4/10/2009 23:29</pubDate>
<author><![CDATA[Joseph C. Okika,Anders P. Ravn]]></author></item>
<item><title><![CDATA[SOFTALLOC: A Work Allocation Language with Soft Constraints]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1617</link>
<description><![CDATA[&amp;nbsp; <span style="font-size: 10pt">Today&amp;#39;s business process orchestration languages such as WS-BPEL and BPML have high-level constructs for specifying flow of control and data, but the facilities for allocating tasks to humans are largely missing. This paper presents SOFTALLOC, a work allocation language with soft constraints, and explains the requirements and trade-offs that led to its design, in particular, what soft constraints are, and how they enable business process definitions to capture allocation rules, best practices, and organizational goals without rendering the business processes too strict. SOFTALLOC combines with virtually any business process language and any conceivable legacy system, while guaranteeing polynomial performance. We present the design, the formal definition, and an evaluation of SOFTALLOC.</span> <div align="center"><a href="uploadfiles/2008/VIDEO/ICWS2008-1053/ICWS2008-1053.html" target="_blank"><strong>&amp;gt;&amp;gt;&amp;gt; View Video(Flash Player 9 please. Version 10 may not work as expected)</strong></a> </div><div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\ICWS2008-1053.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>4/13/2009 01:23</pubDate>
<author><![CDATA[Christian Stefansen,Sriram Rajamani,Parameswaran Seshan]]></author></item>
<item><title><![CDATA[Publishing Dynamic State Changes of Resources through State Aware WSDL]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1618</link>
<description><![CDATA[&amp;nbsp; <span style="font-size: 10pt">A common architecture in today&amp;#39;s development of distributed systems is the Service-Oriented Architecture (SOA) implemented using web services. Until recently, it was difficult to build a SOA based grid/distributed system using web services due to the inability to learn the state of services. The state of a web service could only be accessed through specialized clients and/or services. Should the specialized client or service fail, the state can&amp;#39;t be accessed. This paper shows the innovative Resources Via Web Instances (RVWI) framework. RVWI grants to web services the ability to show the state of dynamic resources in theirWSDL. This was achieved via software components called Connectors which watch for any changes in a resource and updates the web service. The significance of this report is the support for resources which can change state between requests and the innovation is the improvement of state updates between the service and discovery services.</span><div></div><div></div>]]></description>
<pubDate>11/19/2008 03:14</pubDate>
<author><![CDATA[Michael Brock,Andrzej Goscinski]]></author></item>
<item><title><![CDATA[A Framework for Verifying SLA Compliance in Composed Services]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1619</link>
<description><![CDATA[&amp;nbsp; <span style="font-size: 10pt">Service level agreements (SLAs) impose many nonfunctional requirements on services. Business analysts specify and check these requirements in business process models using tools such as IBM WebSphere Business Modeler. System integrators on the other hand use service composition tools such as IBM WebSphere Integration Developer to create service composition models, which specify the integration of services. However, system integrators rarely verify SLA compliance in their proposed composition designs. Instead, SLA compliance is verified after the composed services are deployed in the field. To improve the quality of the composed services, we propose a framework to verify SLA compliance in composed services at design time. The framework re-uses information in business process models to simulate services and verify the non-functional requirements before the service deployment. To demonstrate our framework, we built a prototype using an industria process simulation engine from IBM WebSphere BusinessModeler and integrate it into an industrial service composition tool. Through a case study, we demonstrate that our framework and the prototype assist system integrators in composing services while considering the non-functional requirements.</span> <div align="center"><a href="uploadfiles/2008/VIDEO/ICWS2008-1055_1056_1057/ICWS2008-1055_1056_1057.html" target="_blank"><strong>&amp;gt;&amp;gt;&amp;gt; View Video(Flash Player 9 please. Version 10 may not work as expected)</strong></a> </div><div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\ICWS2008-1055_1056_1057.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>5/21/2009 03:21</pubDate>
<author><![CDATA[Hua Xiao,Brian Chan,Ying Zou,Jay W Benayon,Bill O’Farrell,Elena Litani,Jen Hawkins]]></author></item>
<item><title><![CDATA[Ontology-Based Test Modeling and Partition Testing of Web Services]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1620</link>
<description><![CDATA[&amp;nbsp; <span style="font-size: 10pt">Testing is useful to establish trust between service providers and clients. To test the service-oriented applications, automated and specification-based test generation and test collaboration are necessary. The paper proposes an ontology-based approach for Web Services (WS) testing. A Test Ontology Model (TOM) is defined to specify the test concepts, relationships, and semantics from two aspects: test design (such as test data, test behavior, and test cases) and test execution (such as test plan, schedule and configuration). The TOM specification using OWL (Web Ontology Language) can serve as test contracts among test components. Based on the WS semantic specification in OWL-S, the paper discusses the techniques to generate the sub-domains for input partition testing. Data pools are established for each parameter of the specified service. Data partitions are derived by class property and relationship analysis. Completeness and consistency (C&amp;amp;C) checking can be performed on the data partitions and data values, both within the TOM and against the OWL-S, by ontology class computation and reasoning. A prototype tool is implemented to support OWL-S analysis, test ontology generation and C&amp;amp;C checking.</span> <div align="center"><a href="uploadfiles/2008/VIDEO/ICWS2008-1055_1056_1057/ICWS2008-1055_1056_1057.html" target="_blank"><strong>&amp;gt;&amp;gt;&amp;gt; View Video(Flash Player 9 please. Version 10 may not work as expected)</strong></a> </div><div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\ICWS2008-1055_1056_1057.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>5/21/2009 03:27</pubDate>
<author><![CDATA[Xiaoying Bai,Shufang Lee,Wei-Tek Tsai,Yinong Chen]]></author></item>
<item><title><![CDATA[Control Flow Analysis and Coverage Driven Testing for Web Services]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1621</link>
<description><![CDATA[&amp;nbsp; <span style="font-size: 10pt">In this paper, we describe an approach to discover the control flow graph of web services for web services analysis, verification, and testing. For this purpose, three novel methods are proposed. First, we introduce a domain independent RDF Schemas for concise resource oriented functional specification of web services operations. Secondly, we describe the use of RDF entailment to accurately derive the control flow from the functional specifications. We developed a transformation from RDF graph to SPARQL query to facilitate the RDF entailment which offers flexibility and extensibility over the direct graph matching approach. The third is a linkage based web services modeling and analysis framework, within which we apply an improved Google PageRank algorithm to efficiently calculate test coverage potential using the derived control flow. We justify that the proposed linkage based web services modeling and analysis framework is particularly suitable for testing web services. A prototype of the proposed methods has been implemented and tested on some standard based web services. Experimental results show that the control flow analysis is quite efficient and accurate, and the coverage based test results of the proposed approach are very promising.</span> <div align="center"><a href="uploadfiles/2008/VIDEO/ICWS2008-1055_1056_1057/ICWS2008-1055_1056_1057.html" target="_blank"><strong>&amp;gt;&amp;gt;&amp;gt; View Video(Flash Player 9 please. Version 10 may not work as expected)</strong></a> </div><div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\ICWS2008-1055_1056_1057.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>5/21/2009 03:31</pubDate>
<author><![CDATA[Li Li,Wu Chou,Weiping Guo]]></author></item>
<item><title><![CDATA[Algorithm for Extrapolating Blogger's Interests through Library Classification Systems]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1622</link>
<description><![CDATA[<p>&amp;nbsp; <span style="font-size: 10pt">All words are used in books, in which each are organized into a category through a library classification system. Therefore, words used by bloggers are also written in books, which in turn are categorized into specific categories. If a blogger uses a particular word often, we can anticipate that the blogger will have interest areas coinciding with the related book categories. This paper suggests that bloggers&amp;#39; interests can be known through extracting keywords from blog entry titles and using book classification schemes. Because there were instances in which the keywords alone did not provide adequate information, the Naver (Korean search engine) Related Keywords Search function was used because of its collective intelligence properties. During the experiment, test subjects picked the blogs and entry titles, which were analyzed using the &amp;lsquo;Naver OpenAPI&amp;#39;. The results show that it is possible to know a blogger&amp;#39;s interests using blog entry titles and book classifications.</span></p><p>&amp;nbsp;</p><div align="center"><a href="uploadfiles/2008/VIDEO/ICWS2008-1058_1059_1060/ICWS2008-1058_1059_1060.html" target="_blank"><strong>&amp;gt;&amp;gt;&amp;gt; View Video(Flash Player 9 please. Version 10 may not work as expected)</strong></a> </div><div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\ICWS2008-1058_1059_1060.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>5/26/2009 03:57</pubDate>
<author><![CDATA[Young Sik Kim,Kibeom Lee,Jung-hee Ryu]]></author></item>
<item><title><![CDATA[Building Profit-Aware Service-Oriented Business Applications]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1623</link>
<description><![CDATA[Service composition is becoming a prevalent way to building service-oriented business applications (SOBAs). In an open service environment, the profit of composition (PoC) is a primary concern of building such applications. How to improve the PoC is a significant issue in developing SOBAs but was largely overlooked by current research. Particularly, the modeling and prediction of PoC should play a key role to drive the composition process. In this paper, we focus on how to model and predict PoC in SOBAs. We regard the PoC of a composite service as a function of the quality of service (QoS) attributes, defined in the service level agreement (SLA) between the service and its external partners. Based on the PoC prediction approach, we further propose a profitdriven composition methodology to assist enterprises to make more profit in their SOBAs. <div align="center"><a href="uploadfiles/2008/VIDEO/ICWS2008-1058_1059_1060/ICWS2008-1058_1059_1060.html" target="_blank"><strong>&amp;gt;&amp;gt;&amp;gt; View Video(Flash Player 9 please. Version 10 may not work as expected)</strong></a> </div><div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\ICWS2008-1058_1059_1060.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>5/22/2009 01:43</pubDate>
<author><![CDATA[An Liu,Qing Li,Liusheng Huang,Hai Liu]]></author></item>
<item><title><![CDATA[A Model-Driven Framework for Enabling Self-Service Configuration of Business Services]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1624</link>
<description><![CDATA[In seeking more profits, many business service providers have turned their attention to the technologies that can enable the delivery and operations of the network-delivered business services more efficiently and highly automated. To that end, many service providers have adopted the shared service model where the service offerings are shared across multiple customers to reduce the costs associated with the services&amp;rsquo; delivery. One key challenge for service providers is how to configure various parameters and options of the services with highly automated and self-service modes to meet the customers&amp;rsquo; diverse requirements with minimized costs. Therefore, effective service configuration lifecycle management technologies and approaches have become the differentiations of successful service configuration framework as one of the infrastructure features of the service operation platform based on the shared service model to ease and unify the configuration lifecycle across service offerings. In this framework, we adopt the model-driven technology to automate the service configuration lifecycle. This novel approach combines the wizard technology and rule based validation technology to enable the service customers to perform self-service configuration. Furthermore, the effectiveness of the framework is discussed at the end of this paper. <div align="center"><a href="uploadfiles/2008/VIDEO/ICWS2008-1058_1059_1060/ICWS2008-1058_1059_1060.html" target="_blank"><strong>&amp;gt;&amp;gt;&amp;gt; View Video(Flash Player 9 please. Version 10 may not work as expected)</strong></a> </div><div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\ICWS2008-1058_1059_1060.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>5/22/2009 01:47</pubDate>
<author><![CDATA[Xin Zhang,Pei Sun,Ying Huang,Wei Sun]]></author></item>
<item><title><![CDATA[Hybrid Parallelism for XML SAX Parsing]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1625</link>
<description><![CDATA[&amp;nbsp; <span style="font-size: 10pt">XML has been widely adopted across a wide spectrum of applications. Its parsing efficiency, however, remains a concern, and can be a bottleneck. At the same time, with the trend towards multicore CPUs, parallelization to improve performance has become increasingly relevant. In previous work, we have investigated parallelizing DOM-style parsing and gained significant speedup. For streaming XML applications, however, SAX-style parsing is often required. In this paper, we present a technique and implementation of a parallel XML SAX parser. To handle inherent data dependencies in XML while still allowing reasonable scalability, we use a 4-stage software pipeline with a combination of strictly sequential stages and stages that can be further data-parallelized within the stage. We thus utilize a hybrid between pipelined parallelism and data parallelism. To demonstrate effectiveness, we test this approach on a Linux machine with two Intel Xeon L5320 CPUs for a total of 8 physical cores, and obtain good speedup up to about 8 CPUs.</span> <div align="center"><a href="uploadfiles/2008/VIDEO/ICWS2008-1061/ICWS2008-1061.html" target="_blank"><strong>&amp;gt;&amp;gt;&amp;gt; View Video(Flash Player 9 please. Version 10 may not work as expected)</strong></a> </div><div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\ICWS2008-1061.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>6/04/2009 03:35</pubDate>
<author><![CDATA[Yinfei Pan,Ying Zhang,Kenneth Chiu]]></author></item>
<item><title><![CDATA[InfoParser: Infoset Driven XML Processing for Web Services]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1626</link>
<description><![CDATA[&amp;nbsp; <span style="font-size: 10pt">This paper presents InfoParser, an Infoset driven XML processing mechanism aimed to amend current SOAP engines by substituting Infoset XML binding for Object XML (O/X) mapping, which is responsible for several acute issues in web services, including O/X impedance mismatch, portability, XML alienation, complexity and memory overhead. The proposed InfoParser approach not only avoids issues in object based framework, but also significantly reduces the complexity in XML centric approach. InfoParser can be described formally by just a few set-theoretic equations, yet it offers a promising alternative to current options in moving web services towards more semantics driven, light weight and loosely coupled programming paradigm that can work on any devices. We have implemented a prototype InfoParser in Java and the preliminary experiments indicate that the approach is feasible.</span> <div align="center"><a href="uploadfiles/2008/VIDEO/ICWS2008-1062/ICWS2008-1062.html" target="_blank"><strong>&amp;gt;&amp;gt;&amp;gt; View Video(Flash Player 9 please. Version 10 may not work as expected)</strong></a> </div><div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\ICWS2008-1062.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>6/04/2009 03:46</pubDate>
<author><![CDATA[Li Li,Wu Chou]]></author></item>
<item><title><![CDATA[Facilitating Dynamic Collaborations with eContract Services]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1627</link>
<description><![CDATA[&amp;nbsp; <span style="font-size: 10pt">Electronic Contract (eContract) has been recognized as a good combination of technical specification and legal documentation for establishing and regulating virtual organizations built for dynamic collaborations. This paper presents a design and implementation of an eContract service with an aim of providing a trusted collaboration platform for collaborators. The implemented service uses web services technologies to facilitate its collaborators not only to contribute resources in an eContract, but also to negotiate and instantiate them through eContract. This paper describes the interface and protocols for the eContract service. The architecture, interface and protocols designed for the service are demonstrated using an example of providing a universal connectivity service for a telepresence application in the context of eResearch domain.</span> <div align="center"><a href="uploadfiles/2008/VIDEO/ICWS2008-1063/ICWS2008-1063.html" target="_blank"><strong>&amp;gt;&amp;gt;&amp;gt; View Video(Flash Player 9 please. Version 10 may not work as expected)</strong></a> </div><div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\ICWS2008-1063.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>6/04/2009 03:48</pubDate>
<author><![CDATA[Shiping Chen,Surya Nepal,Chen Wang,John Zic]]></author></item>
<item><title><![CDATA[A Distributed-SOA model for Unified Communication Services]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1628</link>
<description><![CDATA[This paper describes an architectural framework adopting the principles of Service Oriented Architecture for deploying unified communications over the Internet. Also discuss the possible ecosystem based on this approach, and the business model that could probably emerge using such a model. In this architecture, we explore the benefits of the Open Services Gateway Initiative (OSGi) framework for providing us with an ideal service execution platform on the servers, with subscriber client devices on the Internet deploying their services dynamically on them. With a cluster of such networks, we form a distributed communication network for different regions of deployment, with an interaction model between them. <div align="center"><a href="uploadfiles/2008/VIDEO/ICWS2008-1064_1065/ICWS2008-1064_1065.html" target="_blank"><strong>&amp;gt;&amp;gt;&amp;gt; View Video(Flash Player 9 please. Version 10 may not work as expected)</strong></a> </div><div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\ICWS2008-1064_1065.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>5/22/2009 01:54</pubDate>
<author><![CDATA[Shrikant Kanaparti]]></author></item>
<item><title><![CDATA[A Unified Design Method of Asynchronous Service-Oriented Architecture Based on the Models and Patterns of Asynchronous Message Exchanges]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1629</link>
<description><![CDATA[This article proposes a unified methodology for designing asynchronous SOA (Service-Oriented Architecture) based on the asynchronous messaging models and patterns. Conventional SOA focuses on synchronous messaging. Although asynchronous messaging provides much efficient and productive way to coordinate services, design of aSOA (asynchronous SOA) is far more complicated due to the variety of messaging and architecture while assuring behavioral consistency of architecture. This paper proposes a model-driven design methodology for aSOA. The methodology is based on aMEPs (Asynchronous Message Exchange Patterns) identified by classifying the messaging in terms of behavioral concerns. Based on the meta-model of aSOA, a set of aSOA patterns is generated by composing aMEPs. Then, an aSOA pattern is selected and transformed to a platform specific aSOA on top of Web services standards. We successfully implemented an aSOA on Apache Axis, which enables to asynchronous messaging of SOAP over SMTP. We demonstrated that conventional methods are subsets of the proposed methodology, which is the major contribution of this work. <div align="center"><a href="uploadfiles/2008/VIDEO/ICWS2008-1064_1065/ICWS2008-1064_1065.html" target="_blank"><strong>&amp;gt;&amp;gt;&amp;gt; View Video(Flash Player 9 please. Version 10 may not work as expected)</strong></a> </div><div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\ICWS2008-1064_1065.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>5/22/2009 02:06</pubDate>
<author><![CDATA[Mikio Aoyama,Akira Mori]]></author></item>
<item><title><![CDATA[Enhancing Security Modeling for Web Services Using Delegation and Pass-on]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1630</link>
<description><![CDATA[&amp;nbsp; <span style=\"font-size: 10pt\">In recent years, the issues in web service security have been widely investigated and various security standards have been proposed. But most of these studies and standards focus on the access control policies for individual web services and do not consider the access issues in composed services. Consider a simple service chain where service s1 accesses s2, and s2, in turn, accesses service s3. The information returned from s3 to s2 may be used to compute some results that are further returned to s1. The current web service security framework does not provide any mechanisms to control such an information flow, and hence, sensitive information may be leaked to s1 without the consensus of s3. In this paper, we propose an enhanced security model to facilitate the control of information flow through service chains. It extends the basic security models by introducing the concepts of delegation and pass-on. Based on these concepts, new certificates, certificate chain, delegation and pass-on policies, and how they are used to control the information flow are discussed.</span><div></div><div></div>]]></description>
<pubDate>11/19/2008 03:55</pubDate>
<author><![CDATA[Wei She,I-Ling Yen,Bhavani Thuraisingham]]></author></item>
<item><title><![CDATA[Coding-Free Model-Driven Enablement Framework and Engineering Practices of A Context-Aware SOA Modeling Environment]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1631</link>
<description><![CDATA[The rapid adoption of Model-Driven Design (MDD) methodology in SOA-based solution design requires an adaptive tooling environment that can systematically improve designers&amp;rsquo; productivity. Ideally, the environment should be flexible enough to both handle frequently changing requirements and support new features without intensive coding efforts. In this paper, we provide a coding-free enablement framework to realize such extensible tooling environments based on a mathematical abstraction of key models in SOA solution design using graph theory definition. This abstraction formalizes the SOA modeling logic and semantics, and also guides the implementation of an extensible and customizable tooling environment. As a case study, we illustrate how our framework is able to transform the development style from Java programming to text editing through our implementation of a UML 2.0 based SOA modeling environment using IBM&amp;rsquo;s Rational Software Architect (RSA) development platform. <div align="center"><a href="uploadfiles/2008/VIDEO/ICWS2008-1067_1068_1069/ICWS2008-1067_1068_1069.html" target="_blank"><strong>&amp;gt;&amp;gt;&amp;gt; View Video(Flash Player 9 please. Version 10 may not work as expected)</strong></a> </div><div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\ICWS2008-1067_1068_1069.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>5/22/2009 02:09</pubDate>
<author><![CDATA[Nianjun Zhou,Yi-Min Chee,Liang-Jie Zhang]]></author></item>
<item><title><![CDATA[Toward A Model-based Approach to Dynamic Adaptation of Composite Services]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1632</link>
<description><![CDATA[Facing changing environments and evolving business rules, composite services ought to be adaptable, even at run-time. Existing mainstream service composition languages and execution engines exhibit insufficient support for variability and adaptability to cater for dynamic changes. Research efforts have been put on the extension of the languages and argumentation of the engines. However, how to ensure the correctness for the adaptation of a running composite service instance and minimize unnecessary re-execution of component services remains a challenge. To address this problem, we propose a model-based approach that allows run-time adaptation of composite services. It is based on an instance transfer mechanism that transfers an active instance of the old service composition schema to a appropriate state of the new schema. Algorithms are proposed to find the appropriate destination states of the transformation. After the migration, the suspended instances can resume their execution according to the new schema. An example based on a FindRoute composite service is also included. <div align="center"><a href="uploadfiles/2008/VIDEO/ICWS2008-1067_1068_1069/ICWS2008-1067_1068_1069.html" target="_blank"><strong>&amp;gt;&amp;gt;&amp;gt; View Video(Flash Player 9 please. Version 10 may not work as expected)</strong></a> </div><div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\ICWS2008-1067_1068_1069.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>6/02/2009 23:10</pubDate>
<author><![CDATA[Wei Song,Xiaoxing Ma,Wanchun Dou,Jian Lü]]></author></item>
<item><title><![CDATA[Toward the Development Of Contextually Aware Business Applications Via Model-driven Transformations]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1633</link>
<description><![CDATA[While the traditional model driven development techniques are useful for building solutions in a reusable manner, they do not say much about how the existing assets in a client environment can be leveraged effectively and efficiently. In this work, we enhance model driven transformation techniques to generate implementation artifacts on a given platform from platform independent models while leveraging the existing assets in a client environment. We apply semantic Web service matching technology to achieve automatic binding of generated artifacts with available client assets. By generating implementation artifacts that are bound where appropriate with clients&amp;rsquo; existing functionality, our approach helps cut down the development time during project implementations and thereby resulting in reduced project durations and costs. We demonstrate the feasibility of the two platforms: IBM WebSphere and SAP NetWeaver. Lessons learned are presented. <div align="center"><a href="uploadfiles/2008/VIDEO/ICWS2008-1067_1068_1069/ICWS2008-1067_1068_1069.html" target="_blank"><strong>&amp;gt;&amp;gt;&amp;gt; View Video(Flash Player 9 please. Version 10 may not work as expected)</strong></a> </div><div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\ICWS2008-1058_1059_1060.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>6/01/2009 22:47</pubDate>
<author><![CDATA[Rama Akkiraju, Tilak Mitra,Pankaj Dhoolia,Wei Zhao,Shiwa Fu,Manisha Bhandar,Nilay Ghosh,Dipankar Saha]]></author></item>
<item><title><![CDATA[Flexible Pattern Monitoring for WS-BPEL through Stateful Aspect Extension]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1634</link>
<description><![CDATA[&amp;nbsp; <span style=\"font-size: 10pt\">The execution of composite web services with WS-BPEL</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">relies on externally autonomous web services. This implies</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">the need to constantly monitor the running behavior</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">of the involved parties. Moreover, monitoring the execution</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">of such processes is critical to enforce business policies and</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">meet reliability goals. This paper proposes a stateful aspect</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">extension to WS-BPEL, as a solution to support flexible</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">behavior pattern monitoring for composite web services.</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">Specifically, in the stateful aspect, history-based point cut</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">specifies the pattern of interest within a range, while advice</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">describes the associated action to manage the process if the</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">specified pattern occurs. We also present its implementation</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">based on finite state automata through runtime weaving</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">mechanism. Our experiments indicate the proposed monitoring</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">approach incurs minimal overhead.</span><div></div><div></div>]]></description>
<pubDate>11/19/2008 04:00</pubDate>
<author><![CDATA[Guoquan Wu,Jun Wei,Tao Huang]]></author></item>
<item><title><![CDATA[Dynamic Thread Count Adaptation for Multiple Services in SMP Environments]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1635</link>
<description><![CDATA[&amp;nbsp; <span style=\"font-size: 10pt\">We propose a dynamic mechanism, thread count adaptation</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">that adjusts the thread counts that are allocated</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">to services for adapting to CPU requirement variations in</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">SMP environments. Our goal is to increase the maximum</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">throughput available on a system that has multiple dynamic</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">content services while meeting different service time criteria for these services in dynamic workloads. Our challenge</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">is to significantly improve response times for dynamic content on a busy well-tuned thread-pool-based system without</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">prioritizing any specific services. Our experiments demon-</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">strate that a prototype using our approach on J2EE mid-</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">dleware quickly (around every 20 ms) adjusted the thread</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">counts for the services and that it improved the average</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">90th-percentile response times by up to 27% (and 22% on</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">average) for the SPECjAppServer2004 benchmark.</span><div></div><div></div>]]></description>
<pubDate>11/19/2008 04:01</pubDate>
<author><![CDATA[Takeshi Ogasawara]]></author></item>
<item><title><![CDATA[Dynamic Exception Handling Based On Web Services and OPC XML-DA]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1636</link>
<description><![CDATA[&amp;nbsp; <span style=\"font-size: 10pt\">Programmable Logic Controllers (PLC) are widely</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">used in process automation due to their fast and</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">guarantee response time. However their programming</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">and interfacing capacities are limited.</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">In this paper we present a Surveillance software</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">aimed to extend the range of actions available to deal</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">with anomalous situations that are not critical in terms of</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">time and to complement any actions implemented by</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">other units in critical situations. The system combines the</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">possibilities offered by standard OPC XML-DA, the</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">integration capabilities provided by web services and</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">rule-based engines with state-of-the-art technologies for</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">communication such as e-mail, SMS, instant messaging</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">or VoIP.</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">Variables values are monitored by the component</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">using OPC XML-DA and a set of previously defined rules</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">that can trigger actions via web service invocations. These two characteristics allow creating a dynamic</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">behavior able to handle</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">exceptions.</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">In summary, this component extends control</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">Capacities.</span><div></div><div></div>]]></description>
<pubDate>11/19/2008 04:02</pubDate>
<author><![CDATA[Francisco Javier Díez,Iñaki Maurtua]]></author></item>
<item><title><![CDATA[Development of Service Control Server for Web-Telecom Coordination Service]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1637</link>
<description><![CDATA[&amp;nbsp; <span style=\"font-size: 10pt\">We propose the Service Control Technology for the</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">Web-telecom coordination service, and we show our</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">proposal effectiveness. In the NGN (Next-Generation</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">Network), many new applications are expected using</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">open network interfaces. In particular, we study the</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">SDP (Service Delivery Platform) for coordinating</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">existing Internet services and telecom services. In this</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">paper, we</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">propose the Service control technology,</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">which handles common process required in the</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">telecom trigger Web-telecom coordination service.</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">Our method achieves improvement in usability of</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">telecom user, reliability of the coordination service,</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">and processing performance. We implement our</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">method two types (Proxy type, Callable type) and</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">measured processing performance. In comparison to</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">related technologies, we show our method</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">effectiveness.</span><div></div><div></div>]]></description>
<pubDate>11/19/2008 04:03</pubDate>
<author><![CDATA[Yoji Yamato,Hiroyuki Ohnishi,Hiroshi Sunaga]]></author></item>
<item><title><![CDATA[Creating Bioinformatics Semantic Web Services from Existing Web Services: A Real-World Application of SAWSDL]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1638</link>
<description><![CDATA[&amp;nbsp; <span style=\"font-size: 10pt\">Semantic Annotations for WSDL (SAWSDL) is a recently adopted W3C recommendation that provides a mechanism by which WSDL documents can reference external, domain-specific semantic models in order to provide concept-level interoperability of Web Services.<span>&amp;nbsp; </span>Moby is an established protocol for providing semantic Web Services, developed by the bioinformatics community that has a well-defined syntax for semantically-encoded data and a service registry infrastructure.<span>&amp;nbsp; </span>SAWSDL does not specify a language for representing the semantic models, nor a service registration standard; therefore we have used Moby to provide a foundation for a SAWSDL implementation in bioinformatics. Our software (Daggoo) allows users to create Moby-compliant semantic Web Services by simply adding SAWSDL markup to the WSDL file describing their existing service.<span>&amp;nbsp; </span>These new services are compatible at a conceptual level (rather than just type-safe) with existing Moby services and client software. Implemented in Java, the software we present consists of proxy servlet, a URI-resolution mechanism, and rule systems for converting back and forth between Moby and XML Schema data formats. We highlight shortcomings of SAWSDL and compare the technical difficulties of using SAWSDL with Moby versus SAWSDL+RDF/OWL+UDDI.</span><div></div><div></div>]]></description>
<pubDate>11/19/2008 04:04</pubDate>
<author><![CDATA[Paul M.K. Gordon,Christoph W. Sensen]]></author></item>
<item><title><![CDATA[Information as A Service in A Data Analytics Scenario – A Case Study]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1639</link>
<description><![CDATA[&amp;nbsp; <span style=\"font-size: 10pt\">In this work we present a case study of a SOA realization exercise at a business information provider firm, which deals with disparate sources of data in-order to provide reliable reports to its clients. Unlike typical enterprise scenarios, where applications are required to be service enabled, the key requirement here was to service enable its data acquisition, quality check, reporting and other processes which are either mostly manual or ETL based workflows. This paper also addresses how shared services, business processes, rules, and semantics are used to provide quality and agility to the internal processes many of which are entirely dependent on the type of data received. The case and the scenario are chosen specifically to emphasize the fact, that mere web-services implementation does not lead to service oriented architecture, but it is the appropriate usage of them.</span><div></div><div></div>]]></description>
<pubDate>11/19/2008 04:05</pubDate>
<author><![CDATA[Vishal Dwivedi,Naveen Kulkarni]]></author></item>
<item><title><![CDATA[Transparent Reputation Management for Composite Web Services]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1640</link>
<description><![CDATA[&amp;nbsp; <span style=\"font-size: 10pt\">The dependability of composite services is largely affected</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">by their constituent Web services. Composite services</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">have to operate in an open and dynamically changing environment</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">in order to leverage the best performing services</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">available at the moment. Hence, there is the need for an</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">efficient mechanism to provide reliable service rankings.</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">In this paper we present a novel, generic, and customizable</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">reputation infrastructure to automatically and transparently</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">monitor the</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">execution of composite services, taking</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">both functional and non-functional properties into account.</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">The experienced Web service Quality-of-Service is</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">communicated to a configurable reputation mechanism that</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">publishes service rankings. Our reputation infrastructure</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">supports notifications upon changes in service reputation,</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">enabling self-tuning and self-healing properties in the execution</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">of composite services.</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">We implemented our architecture using standard</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">technologies, such as BPEL and JavaEE. Performance</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">measurements show that our infrastructure causes only</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">moderate overhead.</span><span style=\"font-size: 10pt\"> </span><div></div><div></div>]]></description>
<pubDate>11/19/2008 04:06</pubDate>
<author><![CDATA[Domenico Bianculli,Walter Binder,Luigi Drago,Carlo Ghezzi]]></author></item>
<item><title><![CDATA[A Monitoring Framework of WS-ResourceProperties in WS-GRAM]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1641</link>
<description><![CDATA[&amp;nbsp; <span style=\"font-size: 10pt\">Grid computing has been widely spread in pragmatic areas</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">and scientific research areas in order to achieve more</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">powerful computation than ordinary computation by single</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">computer. Globus Toolkit4 (GT4), which has been the</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">de facto standard middleware in Grid, gives to us many</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">chances of submitting jobs, especially using WSRF technologies.</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">However, in case of cluster type grid using GT4,</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">rules for job execution depend on a local scheduler(LS)</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">which interacts with WS-GRAM in GT4, so that clients can</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">not reflect their own rules to behaviors in each worker node.</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">In this paper, we formulate those potential problems</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">and solutions based on our proposed architecture,</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">whose main feature is to monitor Resource Property (RP)</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">in WS-GRAM and notify its status to worker nodes. Then</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">we describe how to implement a mechanism for monitoring</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">RP in WS-GRAM to achieve the transparent delivery</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">of client&amp;#39;s rules to worker nodes. Our experimental results</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">show that our proposed architecture can be incorporated</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">in WS-GRAM without bottleneck in performance points of</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">view.</span><div></div><div></div>]]></description>
<pubDate>11/19/2008 04:08</pubDate>
<author><![CDATA[Hidehiro Kanemitsu,Yoshiyori Urano]]></author></item>
<item><title><![CDATA[Declarative Constraint Framework for SOA Deployment and Configuration]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1642</link>
<description><![CDATA[&amp;nbsp; <span style=\"font-size: 10pt\">A generalized declarative constraint framework is</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">proposed in this paper to address challenges of applying</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">constraints to model-driven SOA deployment and</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">configuration. By representing deployment multimodal</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">and domain knowledge as patterns, constraints can be</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">easily described, automatically validated and analyzed.</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">This framework reduces the human-intensiveness and</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">error-proneness in the activity of applying constraints to</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">a SOA deployment topology. We implemented this</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">framework over a model-driven SOA deployment</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">platform leveraging OCL as the declarative constraint</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">language, and verified it in industry deployment</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">scenarios.</span><div></div><div></div>]]></description>
<pubDate>11/19/2008 04:09</pubDate>
<author><![CDATA[Jing Luo,Ying Li,Jie Qiu,Ying Chen]]></author></item>
<item><title><![CDATA[Dynamic Availability Estimation for Service Selection Based on Status Identification]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1643</link>
<description><![CDATA[&amp;nbsp; <span style=\"font-size: 10pt\">With the popularity of Service-Oriented Computing, how to</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">construct highly available service-oriented applications is becoming</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">a hot topic in both the research and industry communities. As</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">a fundamental problem in dynamic service selection, availability</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">estimation is challenging because of the dynamic nature of web</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">services. To grasp the dynamic nature of web services, we set up</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">an experimental environment for collecting runtime information</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">of web services. Based on the collected runtime information, we</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">identify several characteristics of service failures and successes,</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">and further define three typical service runtime statuses. Based on</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">these statuses, we propose a novel approach to dynamic availability</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">estimation, which is called Status Identification, based Availability</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">Estimation for Service Selection (SIBE). To evaluate our</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">approach, we compare SIBE with other approaches in an experiment</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">of dynamic service selection on the Internet. Experimental</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">results show that SIBE can efficiently improve the success rate of</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">selecting available services.</span><div></div><div></div>]]></description>
<pubDate>11/19/2008 04:10</pubDate>
<author><![CDATA[Lingshuang Shao,Lu Zhang,Tao Xie,Junfeng Zhao,Bing Xie,Hong Mei]]></author></item>
<item><title><![CDATA[QoS-driven Selection of Web Services for Transactional Composition]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1644</link>
<description><![CDATA[&amp;nbsp; <span style=\"font-size: 10pt\">Web services composition has been gaining interest over</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">the last years as it leverages the capabilities to offer complex</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">operations resulting from the aggregation of Web services</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">offered by different organizations. As composite Web</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">services are often long-running, loosely coupled and cross organizational</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">applications, advanced transactional support</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">is required to ensure reliable execution. In addition, in</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">the presence of multiple Web services with equivalent functionality,</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">users will discriminate the alternatives based on</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">their quality of service (QoS). This paper address the issue</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">of selecting and composing Web services not only according</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">to their functional requirements but also to their transactional</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">properties and QoS characteristics defined using a</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">quality model. In this model, Web services are selected in</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">a way that satisfies user preferences. These preferences are</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">expressed as weights over QoS criterion and as risk level</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">defining semantically the transactional requirements.</span><div></div><div></div>]]></description>
<pubDate>11/19/2008 04:11</pubDate>
<author><![CDATA[Joyce El Haddad,Maude Manouvrier,Guillermo Ramirez,Marta Rukoz]]></author></item>
<item><title><![CDATA[Autonomic Ranking and Selection of Web Services by Using Single Value Decomposition Technique]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1645</link>
<description><![CDATA[&amp;nbsp; <span style=\"font-size: 10pt; color: black\">With the proliferation of Web services as a</span><span style=\"font-size: 10pt; color: black\"> </span><span style=\"font-size: 10pt; color: black\">business solution to enterprise application</span><span style=\"font-size: 10pt; color: black\"> </span><span style=\"font-size: 10pt; color: black\">integration, ranking and selecting the best web services among the providers become an important factor in the success of the business solution. Quality of Services (QoS) determines the quality and usability of a service including its price, performance, reliability, integrity, accessibility, availability, interoperability, and security. Given a set of QoS attributes from a variety of sources, it is a challenge to sort through all of them and be able to get the best services that meet QoS requirement. In this paper, we describe a novel method by which web services can be ranked and selected automatically based on a number of observed QoS parameters and feedback responses learned from prior knowledge. This new approach treats the observed web services QoS attributes and target web services relationship, represented by a matrix, as a statistical problem. Using Singular Value Decomposition (SVD) technique, and an user assisted weighting system, implicit higher order correlations among web services and their associated QoS attributes are extracted and used to estimate the selection of recommended web services.</span><div></div><div></div>]]></description>
<pubDate>11/19/2008 04:12</pubDate>
<author><![CDATA[Hoi Chan,Trieu Chieu,Thomas Kwok]]></author></item>
<item><title><![CDATA[Integration and Data Sharing between WS-based Workflows]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1646</link>
<description><![CDATA[&amp;nbsp; <span style=\"font-size: 10pt\">Although the use of workflow techniques based on</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">Web services (WS) has grown rapidly for the past several</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">years, there is still a significant gap to be bridged before</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">such an approach is widely accepted as the standard way</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">to build and represent WS-based applications. One of the</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">reasons for this is the inability in most current workflow</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">languages to support large and complex applications that</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">require workflow integration and data sharing between</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">workflows. In this paper, this issue is addressed by the</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">introduction of the two approaches used in the Service</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">Workflow Language (SWFL): the Procedure-Oriented</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">approach, and the Objected-Oriented approach, for</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">workflow integration. The data sharing and related</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">synchronization issues that are associated with these</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">workflow integration approaches are also discussed.</span><div></div><div></div>]]></description>
<pubDate>11/19/2008 04:13</pubDate>
<author><![CDATA[C. Walker,D. W. Walker]]></author></item>
<item><title><![CDATA[SCWIM An Integrity Model for SOA Networks]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1647</link>
<description><![CDATA[&amp;nbsp; <span style=\"font-size: 10pt\">Interest in Service Oriented Architecture (SOA) is</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">rapidly increasing in the business world due to the many</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">benefits it offers such as reliability, manageability, reusability, flexibility, efficiency, and interoperability. There are</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">many security technologies and models being developed for</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">SOA. They implement or encode specific aspects of authentication,</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">authorization, encryption, trust, and access control</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">respectively but none of them was entirely devoted to</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">integrity. In this paper we propose Service Clark-Wilson</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">Integrity Model (SCWIM), a top down integrity model for</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">SOA capable of describing sufficient conditions to protect</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">data integrity in any SOA implementation. Based on the</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">original Clark-Wilson Integrity Model, our model can form</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">the basis for system security audits and assist SOA architects</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">in developing systems that protect data integrity, as</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">well as providing guidance for evaluating existing SOA systems.</span><div></div><div></div>]]></description>
<pubDate>11/19/2008 04:17</pubDate>
<author><![CDATA[Majd Al-kofahi,Su Chang,Thomas E. Daniels]]></author></item>
<item><title><![CDATA[A Consistency-preserving Mechanism for Web Services Response Caching]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1648</link>
<description><![CDATA[&amp;nbsp; <span style=\"font-size: 10pt\">Web services are rapidly emerging as a popular standard</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">technology for sharing data and functionality among</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">heterogeneous systems. Service providers and consumers</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">are loosely </span><span style=\"font-size: 10pt\">coupled</span><span style=\"font-size: 10pt\"> and distributed across the network, either</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">within an organization or across organizational boundaries,</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">and therefore, performance becomes a major concern</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">in such a distributed</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">environment. Furthermore, XML is</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">widely used as message format for service providers and</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">consumers in Web services environment. XML message</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">packaging and parsing brings extra overhead to both ends.</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">Web services response latency, as well as throughput, is becoming</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">a bottleneck problem. In this paper, we propose</span><span style=\"font-size: 10pt\"> a</span><span style=\"font-size: 10pt\"> consistency-preserving mechanism for Web services response</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">caching, which reduces the volume of data transmitted</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">without semantic interpretation of service requests</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">or responses, and accelerates the services response finally.</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">It achieves this reduction through the use of cryptographic</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">hashing to detect similarities with previous results. Experiments</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">with an initial prototype called SigsitAcclerator indicate</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">that our mechanism can lead to significant performance</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">improvement over more straightforward techniques.</span><div></div><div></div>]]></description>
<pubDate>11/19/2008 04:18</pubDate>
<author><![CDATA[Wubin Li,Zhuofeng Zhao,Kaiyuan Qi,Jun Fang,Weilong Ding]]></author></item>
<item><title><![CDATA[An Efficient Syntactic Web Service Composition Algorithm Based on the Planning Graph Model]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1649</link>
<description><![CDATA[&amp;nbsp; <span style=\"font-size: 10pt\">In this paper, we have studied a common Web service</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">composition problem, the syntactic matching problem,</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">where the output parameters of a Web service can be used as the input parameters of another Web service. Many automatic</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">Web service composition algorithms based on AI</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">planning techniques have been proposed. However, most of</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">them do not scale well when the number of Web services increases,</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">or may miss finding a solution even if one exists.</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">The</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">planning graph, another AI planning technique, provides</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">a unique search space. We have found that when we</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">model the Web service composition problem as a planning</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">graph, it actually provides a trivial solution to the problem.</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">Instead of following the usual way to find a solution</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">by a backward search, we put our efforts into removing the</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">redundant Web services contained in the</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">planning graph.</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">Our approach can find a solution in polynomial time, but</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">with possible redundant Web services. We have tested our</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">algorithms on the data set used in ICEBE&amp;#39;05 and compared</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">our results with existing methods.</span><div></div><div></div>]]></description>
<pubDate>11/19/2008 04:19</pubDate>
<author><![CDATA[Xianrong Zheng,Yuhong Yan]]></author></item>
<item><title><![CDATA[An Approach to Check Choreography with Channel Passing in WS-CDL]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1650</link>
<description><![CDATA[&amp;nbsp; <span style=\"font-size: 10pt\">Channel passing mechanisms enable dynamically determining destinations of message transferring. WS-CDL, a language developed by W3C for the specification of Web services choreographies, adopts channel passing to support dynamic Web services composition. A choreography can be projected into individual services or orchestration skeletons. It is a challenge to ensure the services generated from a choreography always have sufficient and correct channels to complete their collaboration. In fact, WSCDL is not ready for rigorous validation and implementation with respect to channel passing, since it provides no structure for specifying explicitly which role should firstly initialize which channel variable. Here we propose an algorithm to uncover these implicit assumptions, that is implemented as an extension to Pi4SOA. With the help of the algorithm, some existing methods for verification and implementation can be applied on choreographies written in WS-CDL. In addition, we propose an approach to detect design defects in choreographies, and show how a defect is found from the main sample choreography in WS-CDL Primer. It seems that choreographies with channel passing are error prone. Methods and tools are necessary tosupport</span> <p style=\"text-justify: inter-ideograph; text-align: justify\"><span style=\"font-size: 10pt\">designers in this field. Also, we suggest improving the situation by adding a syntactical construct to WS-CDL.</span></p><div></div><div></div>]]></description>
<pubDate>11/19/2008 04:20</pubDate>
<author><![CDATA[Cai Chao,Qiu Zongyan]]></author></item>
<item><title><![CDATA[A Policy-based Middleware for Web Services SLA Negotiation]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1651</link>
<description><![CDATA[&amp;nbsp; <span style=\"font-size: 10pt\">Negotiation of Service Level Agreements (SLAs) is very</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">important for maintaining Quality of Service (QoS) of</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">composite Web services-based business processes. The</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">process of negotiation involves specification of</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">negotiation parameters, exchanging offers to conduct the</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">actual negotiation process, and then finally generating</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">the formal SLA if the negotiating parties come to a</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">consensus. We propose a Negotiation Broker (NB)</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">middleware framework to facilitate automated</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">negotiations of SLAs for Web services in a Service</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">Oriented Architecture (SOA). High level business goals,</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">contexts, preferences, constraints, and values of the</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">negotiation issues are expressed as a policy specification</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">by each of the negotiating parties. The NB maps the</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">policy specifications to low level negotiation strategy</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">models and parameters in order to conduct the</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">negotiation locally as a trusted broker. We present a</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">model and an example of the high level negotiation policy</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">specification. We also present our NB framework</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">including a prototype implementation to illustrate the</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">mapping of the policy to a time-dependent negotiation</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">strategy model.</span><div></div><div></div>]]></description>
<pubDate>11/19/2008 04:21</pubDate>
<author><![CDATA[Farhana Zulkernine,Patrick Martin,Chris Craddock,Kirk Wilson]]></author></item>
<item><title><![CDATA[Interoperability among Service Registry Implementations: Is UDDI Standard Enough?]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1652</link>
<description><![CDATA[&amp;nbsp; <span style=\"font-size: 10pt\">The aim of this paper is to reveal some intrinsic</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">disadvantages of the current version of UDDI standard,</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">which create problems in using it as a standard for</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">private, in-house storage of enterprise services. Examples</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">include: access control mechanisms in UDDI, limited</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">rich queries capability, inappropriate mapping of Web service</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">artifacts into UDDI entities, impossibility of</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">managing classification system values, etc. For each</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">disadvantage we consider, we give an illustrative</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">example of its impact in an enterprise service</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">environment. To overcome these disadvantages, some</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">service registry implementations, based on UDDI</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">introduce proprietary</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">extensions to the standard, or</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">embed additional programmatic logic in their client</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">modules of UDDI, which decreases interoperability</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">between them.</span><div></div><div></div>]]></description>
<pubDate>11/19/2008 04:22</pubDate>
<author><![CDATA[Alexander Mintchev]]></author></item>
<item><title><![CDATA[Anchor Semantics Enabled Ranking Method for Service Discovery and Integration]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1653</link>
<description><![CDATA[&amp;nbsp; <span style=\"font-size: 10pt\">As web services proliferate, the discovery and</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">integration of appropriate services will become a</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">challenging task particularly with services that share</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">common similarities and functionalities. To assist</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">requesters to find Web services of interest easily, we need</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">to enhance the present service discovery mechanisms with</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">ranking method. Enlightened by disciplines of Web 2.0,</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">the anchor semantics enabled ranking method is proposed.</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">In this method, the service requestor, as a consumer, can</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">also become the producer to contribute not only the</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">request description but also the usage reputation as part</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">of service description. Based on case study and</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">analogical analysis, we argue that this method improves</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">recall and precise metrics at the same time.</span><div></div><div></div>]]></description>
<pubDate>11/19/2008 04:23</pubDate>
<author><![CDATA[Jing Luo,Ying Li]]></author></item>
<item><title><![CDATA[Web Services Discovery based on Latent Semantic Approach]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1654</link>
<description><![CDATA[&amp;nbsp; <span style=\"font-size: 10pt\">With an ever-increasing number of Web services being</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">available, finding desired Web service is crucial for</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">service users. Current keyword search and most existing</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">approaches are inefficient in two main aspects: poor</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">scalability and lack of semantics. Firstly, users are</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">overwhelmed by the huge number of irrelevant services</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">returned. Secondly, the intentions of users and the</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">semantics in Web services are ignored. Inspired by the</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">success of the Divide and Conquer approach used to</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">handle the complex information decomposition, we use a</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">novel approach to partition a large set of search results</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">into a set of smaller groups by employing a clustering</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">approach. Then we utilize Singular Value Decomposition</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">(SVD) to capture the main semantics hidden behind the</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">words in a query and the descriptions in the services, so</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">that service matching can be carried out at the concept</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">level. We report here on the preliminary experimental</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">evaluation that shows improvements overall precision.</span><div></div><div></div>]]></description>
<pubDate>11/19/2008 04:24</pubDate>
<author><![CDATA[Jiangang Ma,Yanchun Zhang,Jing He]]></author></item>
<item><title><![CDATA[Model-Driven Quality of Service for Web Services: an Aspect-Oriented Approach]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1655</link>
<description><![CDATA[<span style=\"font-size: 10pt; font-family: \'Times New Roman\'\">Implementation and modification of non-functional</span><span style=\"font-size: 10pt; font-family: \'Times New Roman\'\"> </span><span style=\"font-size: 10pt; font-family: \'Times New Roman\'\">properties related to monitoring Quality of Service</span><span style=\"font-size: 10pt; font-family: \'Times New Roman\'\"> </span><span style=\"font-size: 10pt; font-family: \'Times New Roman\'\">(QoS) can be both a expensive and complex task. This</span><span style=\"font-size: 10pt; font-family: \'Times New Roman\'\"> </span><span style=\"font-size: 10pt; font-family: \'Times New Roman\'\">paper presents a model-based approach to the</span><span style=\"font-size: 10pt; font-family: \'Times New Roman\'\"> </span><span style=\"font-size: 10pt; font-family: \'Times New Roman\'\">implementation of QoS monitors by describing them as</span><span style=\"font-size: 10pt; font-family: \'Times New Roman\'\"> </span><span style=\"font-size: 10pt; font-family: \'Times New Roman\'\">platform-independent models. Then, Model-Driven</span><span style=\"font-size: 10pt; font-family: \'Times New Roman\'\"> </span><span style=\"font-size: 10pt; font-family: \'Times New Roman\'\">Development (MDD) transformations are conducted to</span><span style=\"font-size: 10pt; font-family: \'Times New Roman\'\"> </span><span style=\"font-size: 10pt; font-family: \'Times New Roman\'\">create both a system implementation and QoS</span><span style=\"font-size: 10pt; font-family: \'Times New Roman\'\"> </span><span style=\"font-size: 10pt; font-family: \'Times New Roman\'\">constraints in the form of aspects according to the</span><span style=\"font-size: 10pt; font-family: \'Times New Roman\'\"> </span><span style=\"font-size: 10pt; font-family: \'Times New Roman\'\">Aspect-Oriented Programming (AOP) paradigm. Aspects are weaved within the system implementation</span><span style=\"font-size: 12pt; font-family: \'Times New Roman\'\">.</span><div></div><div></div>]]></description>
<pubDate>11/19/2008 04:25</pubDate>
<author><![CDATA[Guadalupe Ortiz,Behzad Bordbar]]></author></item>
<item><title><![CDATA[Data-enriched Modeling and Verification of WS-CDL Based on UML Models]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1656</link>
<description><![CDATA[&amp;nbsp;The Web Services Choreography Description Language (WS-CDL) is a specification developed by the W3C that can be viewed as a blueprint for the development of end-point services. Considering that it is the W3C candidate recommendation for web service choreography, it is worth providing a systematic approach for its modeling, analysis and verification. The Unified Modeling Language (UML) is the de facto industry standard for modeling. Applying UML to model WS-CDL is obviously a promising solution to bring together academics and practitioners in through a unique standard language. This paper proposes to use different UML diagrams to model WS-CDL. Given the UML specification of WS-CDL, we then provide a systematic way of formally analyzing and verifying WS-CDL. <div align="center"><a href="uploadfiles/2008/VIDEO/ICWS2008-1092/ICWS2008-1092.html" target="_blank"><strong>&amp;gt;&amp;gt;&amp;gt; View Video(Flash Player 9 please. Version 10 may not work as expected)</strong></a> </div><div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\ICWS2008-1092.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>3/28/2009 04:46</pubDate>
<author><![CDATA[Pengcheng Zhang,Bixin Li,Henry Muccini,Yu Zhou,Mingjie Sun]]></author></item>
<item><title><![CDATA[A Modeling Approach for Service-Oriented Application Based on Extensive Reuse]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1657</link>
<description><![CDATA[&amp;nbsp; <span style=\"font-size: 10pt\">This paper proposes an extensive reuse approach for</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">SOM, which utilizes a multi-facets ontology system supporting</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">reuse of various service-oriented assets, such as</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">business processes, collaboration templates and services.</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">The paper also presents an iterative service-oriented modeling</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">process based on the ontology and assets repository,</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">which reuses assets from the first to last modeling phase by</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">matching between assets descriptions, and results in a service</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">model that represents the specification of the required</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">service-oriented application.</span><div></div><div></div>]]></description>
<pubDate>11/19/2008 04:28</pubDate>
<author><![CDATA[Budan Wu,Zhi Jin,Bin Zhao]]></author></item>
<item><title><![CDATA[Exploiting Independence in Design of Web Service Composition]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1658</link>
<description><![CDATA[&amp;nbsp; <span style=\"font-size: 10pt\">Communications among web services are asynchronous. Asynchronous models of service compositions face the problem that the performance of verification is bring down with states explosion. We describe an approach, which utilize the interaction-independence of component services in the composition and forms all component services into different groups. Preliminary experiment results show that the verification of service compositions upon these groups can decrease the size of exploration states and hence improve the performance.</span><div></div><div></div>]]></description>
<pubDate>11/19/2008 04:29</pubDate>
<author><![CDATA[Fangfang Liu,Yan Chi,Xiangfeng Luo]]></author></item>
<item><title><![CDATA[Support Web Services Composition with Optimal Cost Using PPA]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1659</link>
<description><![CDATA[&amp;nbsp; <span style=\"font-size: 10pt\">Currently process algebras have been effectively used for describing and reasoning web services and their composition, but they are lack of cost modeling and analyzing capability and can&amp;#39;t support web services composition with optimal cost. This paper proposes a process algebra called PPA (Priced Process Algebra) basing on CCS (Calculus of Communicating Systems). We discuss the syntax and semantics of PPA extended with priced information and provide an algorithm to support web services composition with optimal cost.</span><div></div><div></div>]]></description>
<pubDate>11/19/2008 04:30</pubDate>
<author><![CDATA[Fangxiong Xiao,Zhiqiu Huang,Jun Hu,Min Yuan,Junhua Zhang]]></author></item>
<item><title><![CDATA[Automated Web Service Composition Using Extended Representation of Planning Domain]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1660</link>
<description><![CDATA[&amp;nbsp; <span style=\"font-size: 10pt\">The ability to automatically answer a request that requires the composition of a set of Web Services (WS) has received much interest, as it supports B2B applications. Most existing approaches for WS composition consider explicit request. An explicit request specifies the subset of activities and the constraints between them. Based on the request, the role of the proposed solutions is to find the set of optimized WS to accomplish those activities under predefined constraints. In our approach we propose a new kind of request in the domain of WS, we call it implicit request. An implicit request is defined by the initial and the goal states. It also allows the creation and elimination of new objects in the goal state. Many approaches are dedicated to answer to an explicit request dealing with nondeterministic domains, partial observability and extended goals. In this paper we propose an approach allowing the composition of WS in order to answer to implicit requests, by using the Artificial Intelligence (AI) planning techniques guided by available services.</span><div></div><div></div>]]></description>
<pubDate>11/19/2008 04:31</pubDate>
<author><![CDATA[Mohamad El Falou,Maroua Bouzid,Abdel-Illah Mouaddib,Thierry Vidal]]></author></item>
<item><title><![CDATA[Transforming Abstract QoS Requirements, Preferences,and Logic Constraints for Automatic Web Service Composition]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1661</link>
<description><![CDATA[&amp;nbsp; The constraints revealed during a logical composition of services are often too abstract for automatic service composition. The abstract constraints have to be transformed to concrete attributes. This research investigates semi-automatic transformation of intermediate constraints to concrete constraints for automatic service composition. It considers simultaneously a stack of composition attributes for QoS, preferences, and logic constraints. <div align="center"><a href="uploadfiles/2008/VIDEO/ICWS2008-1097/ICWS2008-1097.html" target="_blank"><strong>&amp;gt;&amp;gt;&amp;gt; View Video(Flash Player 9 please. Version 10 may not work as expected)</strong></a> </div><div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\ICWS2008-1097.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>3/28/2009 04:49</pubDate>
<author><![CDATA[Incheon Paik,Haruhiko Takada,Michael N. Huhns]]></author></item>
<item><title><![CDATA[Specify and Compose Web Services by TLA]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1662</link>
<description><![CDATA[&amp;nbsp; <span style=\"font-size: 10pt\">This paper introduces the concept of Temporal Logic of Actions (short for TLA), with which we can formally specify the behavior of a service, and compose Web services. The approach is demonstrated by an example. A services composition algorithm is presented.</span><div></div><div></div>]]></description>
<pubDate>11/19/2008 04:33</pubDate>
<author><![CDATA[Hongbing Wang,Hui Liu,Xiaohui Guo]]></author></item>
<item><title><![CDATA[A Tree-based Method of Web Service Composition]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1663</link>
<description><![CDATA[&amp;nbsp; <span style=\"font-size: 10pt\">Although service composition has received a great deal</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">of attention and there are many solutions to the problem</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">of composition, finding potential service compositions efficiently</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">is still challenging because of the fact that the number</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">of candidate services can be very large. In this paper, a</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">tree-based method of web service composition is proposed,</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">by which all potential candidate composite services that</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">meet the user&amp;#39;s request can be created. Moreover, these</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">composite services are ordered according to the QoS attribute</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">concerned by the user, so the user can find the best</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">and arbitrary top-n composite services.</span><div></div><div></div>]]></description>
<pubDate>11/19/2008 04:34</pubDate>
<author><![CDATA[Haiming Tang,Farong Zhong,Chang Yang]]></author></item>
<item><title><![CDATA[A Fast Method to Find Solution for Service Composition]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1664</link>
<description><![CDATA[&amp;nbsp; <span style=\"font-size: 10pt\">Web service has emerged as a new solution for enterprise application integration. Automatic service composite algorithm is to build a composite service for user&amp;#39;s request or complex business requirement. Most former work uses the dependence among services, however the relationship is often complicated and the composition algorithm is time consuming. This paper proposes a type based service composition algorithm, which can calculate a feasible solution in linear time. We conduct a series of experiments with real dataset and generated data. The experimental results demonstrate the efficiency of proposed method.</span><div></div><div></div>]]></description>
<pubDate>11/19/2008 04:35</pubDate>
<author><![CDATA[Yan Huang,Xiaoling Wang,Aoying Zhou]]></author></item>
<item><title><![CDATA[A User-Oriented Approach for Automated Service Composition]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1665</link>
<description><![CDATA[&amp;nbsp; <span style=\"font-size: 10pt; color: black\">In the past a few ye</span><span style=\"font-size: 10pt\">ars, the Web has undergone a tremendous change towards a highly user-centric environment. Millions of users can participate and collaborate for their own interests and benefits. Service Oriented Computing and web services have created great potential opportunities for the users to build their own applications. Then, it is a pressing issue that, the users can compose services without too complex tasks and efforts. In this paper, we introduce a user-oriented approach which aims to simplify service composition. We leverage the plentiful information residing in service tags, both from service descriptions (such as WSDL) and the annotations tagged by users. Employing some mining algorithms, a Direct Acyclic Graph is built up to represent potential composition opportunities. With a simple and intuitive search, it allows users to explore the space of potentially composable services and achieve service composition in a heuristic manner. We have developed a composition advisor to provide recommendations guiding and assisting the users. It also lets the users discover and make use of services without having to understand too many details of individual candidate services. To enable the users to accomplish service composition in a more interactive access channel, we finally provide a user-friendly prototype based on web browsers. It undoubtedly reduces the complexity and lowers the entry barrier for the users, and makes them better play their role in the Service-Oriented Web Environment.</span><div></div><div></div>]]></description>
<pubDate>11/19/2008 04:36</pubDate>
<author><![CDATA[Xuanzhe Liu,Gang Huang,Hong Mei]]></author></item>
<item><title><![CDATA[Change Sequence Mining for Context Aware Service Process Customization]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1666</link>
<description><![CDATA[&amp;nbsp; Service process usually needs to be changed during reuse because of the change of context. These change mapping relations provide additional information to help users customize service processes. In this paper, we present a mining approach to mining process change sequences based on different context and finding the best sequence to tailor the base process. <div align="center"><a href="uploadfiles/2008/VIDEO/ICWS2008-1102/ICWS2008-1102.html" target="_blank"><strong>&amp;gt;&amp;gt;&amp;gt; View Video(Flash Player 9 please. Version 10 may not work as expected)</strong></a> </div><div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\ICWS2008-1102.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>4/02/2009 20:36</pubDate>
<author><![CDATA[Yi Wang,Jian Cao,Minglu Li]]></author></item>
<item><title><![CDATA[An Architecture for Context-aware Semantic Web Services]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1667</link>
<description><![CDATA[&amp;nbsp; <span style=\"font-size: 10pt\">Context awareness in Web services is gaining momentum. Since it is not a trivial task, it suffers from lack of a general solution. In this paper, we introduce a novel approach for context-aware Semantic Web Services which is applicable for any environment. It is established based on composition of context provider Web Services and other context-aware Semantic Web Services. In addition, an extended version of the Semantic Web Service Ontology Language for Semantic Web services is introduced, in order to make it possible to find appropriate context-aware Semantic Web services based on available context information. So as to make it applicable for any environment, the solution does not hold any assumption about the user&amp;#39;s context source. Rather, the property of Context Level is defined.</span><div></div><div></div>]]></description>
<pubDate>11/19/2008 19:35</pubDate>
<author><![CDATA[Iman Keivanloo,Hassan Abolhassani]]></author></item>
<item><title><![CDATA[WS-CCDL: A Framework for Web Service Collaborative Context Definition Language for]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1668</link>
<description><![CDATA[&amp;nbsp; <span style=\"font-size: 10pt\">Dynamic collaborations involve contributed resources across the organisational boundaries that are subjected to different set of policies. The management of such resources for dynamic collaborations including negotiation, validation, instantiation and termination is difficult. Existing approaches for collaborations using Web Services such as WSLA are designed to deal with scenarios involving two parties: a service provider and a service consumer. These approaches do not scale well to multiparty nature of dynamic collaborations. To address this problem, we propose a framework for a language called Web Service Collaborative Context Definition Language for dynamic collaborations. The language itself has been defined using XML Schema and has been implemented in a dynamic collaboration platform.</span><div></div><div></div>]]></description>
<pubDate>11/19/2008 19:37</pubDate>
<author><![CDATA[Surya Nepal,John Zic,Shiping Chen]]></author></item>
<item><title><![CDATA[Composition Context for Web Services Selection]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1669</link>
<description><![CDATA[&amp;nbsp; <span style=\"font-size: 10pt\">Often there are several services providing similar functionality, moving the problem of selecting the most suitable to the forefront of interest. In this paper we consider the selection of services in a dynamic environment with changing requirements. In previous work we considered selecting services in isolation; here we present an enhancement to select services in their relation to each other to gain a global optimal solution which nevertheless respects local criteria. Novel contributions are the definition of a composition context and the global multi-criteria optimization mechanism.</span><div></div><div></div>]]></description>
<pubDate>11/19/2008 19:38</pubDate>
<author><![CDATA[Hong Qing Yu,Stephan Reiff-Marganiec,Marcel Tilly]]></author></item>
<item><title><![CDATA[A DDL-based Model for Web Service Composition in Context-aware Environment]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1670</link>
<description><![CDATA[&amp;nbsp; <span style=\"font-size: 10pt\">Dynamic description logic (DDL) is among the few</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">emerging service composition solutions through</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">logical reasoning. To overcome low efficiency and</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">lacking context-aware support of DDL reasoning, we</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">propose a new DDL-based service composition model,</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">which supports context-based service pre-filtering over</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">DDL reasoning space. The pre</span><span style=\"font-size: 10pt\">-</span><span style=\"font-size: 10pt\">filtering runs under the</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">BPEL workflow and a distributed reasoning algorithm</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">need to reasoning different contexts after pre-filtering.</span><div></div><div></div>]]></description>
<pubDate>11/19/2008 19:39</pubDate>
<author><![CDATA[Wenjia Niu,Zhongzhi Shi,Changlin Wan,Liang Chang,Hui Peng]]></author></item>
<item><title><![CDATA[Optimised Mobile Reasoning for Pervasive Service Discovery]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1671</link>
<description><![CDATA[&amp;nbsp; <span style=\"font-size: 10pt\">Today&amp;#39;s mobile users have access to a wide range of web-based services. This paper presents our m-Tableaux algorithm for enabling cost-efficient and optimized semantic reasoning to support pervasive service discovery. We present performance evaluation of the m- Tableaux optimisation strategies which clearly demonstrate its operational feasibility on a mobile device.</span><div></div><div></div>]]></description>
<pubDate>11/19/2008 19:41</pubDate>
<author><![CDATA[Luke Steller,Shonali Krishnaswamy]]></author></item>
<item><title><![CDATA[A Distributed e-Education System Based On the Service Oriented Architecture]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1672</link>
<description><![CDATA[&amp;nbsp; <span style=\"font-size: 10pt\">Next generation educational services must identify and support dynamic semantic mappings to support semantic interoperability. This study introduces a distributed e-education services system based on the service oriented architecture. The Service Oriented Architecture facilitates the development of such systems by supporting modular design, application integration and interoperation, and software reuse. With open standards, such as XML, SOAP, WSDL and UDDI, the Service Oriented Architecture supports interoperability between services operating on different platforms and between applications implemented in different programming languages. In this paper we describe a distributed e-education services system that uses the Service Oriented Architecture as a basis for designing, implementing, deploying, invoking and managing educational services.</span><div></div><div></div>]]></description>
<pubDate>11/19/2008 19:42</pubDate>
<author><![CDATA[Parichat Pasatcha,Komrhon Sunat]]></author></item>
<item><title><![CDATA[Service Design for 3D Virtual World Learning Applications]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1673</link>
<description><![CDATA[<p>&amp;nbsp; <span style=\"font-size: 10pt\">In this paper, we first analyze the urgent needs of training service skills in a global environment. We then analyze the different patterns that 3D virtual world technologies can help learning activities. Instead of using the well known MVC model for Web application development, we propose a new design pattern for designing 3D virtual world learning applications named PWI model based on our own accumulated experience.</span></p><p>&amp;nbsp;</p><div></div><div></div>]]></description>
<pubDate>11/19/2008 19:43</pubDate>
<author><![CDATA[Hong Cai]]></author></item>
<item><title><![CDATA[Middleware for Communication and Deployment of Time Independent Mobile Web Services]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1674</link>
<description><![CDATA[&amp;nbsp; <span style=\"font-size: 10pt\">With the increasing storage capacity, processing power and battery capabilities, mobile devices are now able to providing services instead of just being service consumers. This paper introduces a middleware for time independent Mobile Web Services (Mob-WS) that avoids the overheads of long durational synchronous communication. Details of communication architecture and interaction among the middleware components is presented and discussed. The Bluetooth binding for SOAP has been developed and brief presente</span><span style=\"font-size: 10pt\">d.</span><div></div><div></div>]]></description>
<pubDate>11/19/2008 19:44</pubDate>
<author><![CDATA[Fahad Aijaz,Seyed Mohammad Adeli,Bernhard Walke]]></author></item>
<item><title><![CDATA[Integrating Information-Providing Web Services into the Data Integration System]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1675</link>
<description><![CDATA[&amp;nbsp; <span style=\"font-size: 10pt\">I</span><span style=\"font-size: 10pt\">n order to naturally incorporate the information provided by Web Services into the data integration systems, we propose a novel model, Uniform Query, to uniformly describe the data query/view and the semantic of information-providing Web Services. With the proper matching algorithm we have implemented a prototype in which Web Services act as normal data sources (e.g. RDF datasets), and data queries could be answered through dynamic invocation of matched services.</span><div></div><div></div>]]></description>
<pubDate>11/19/2008 19:45</pubDate>
<author><![CDATA[Wenfeng Zhao,Xiangwu Meng,Junliang Chen,Chuanchang Liu]]></author></item>
<item><title><![CDATA[Services Characterization with Statistical Study on Existing Web Services]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1676</link>
<description><![CDATA[&amp;nbsp; <span style=\"font-size: 10pt\">Most of the current semantic representation methods for service capabilities are usually based on Top-down methodology. We aim to develop services characterization methods with statistical study on existing web services and to improve services capability representation with bottom-up software services comprehension. Two services characterization methods are proposed in our work: quantitative statistical study which used for probing the distribution of main objects in web services and relational statistical study which used for clustering actions or contents and measuring the similarity of web services. A statistical relational model is proposed for mining and recognizing the patterns of services.</span><div></div><div></div>]]></description>
<pubDate>11/19/2008 19:46</pubDate>
<author><![CDATA[Yan Liu, Mingguang Zhuang,Biao Yu,Guannan Zhang,Xiaojing Meng]]></author></item>
<item><title><![CDATA[Explaining Reputation for Informed Web Services Selection]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1677</link>
<description><![CDATA[&amp;nbsp; <span style=\"font-size: 10pt\">This paper explores the use of rationale for understanding the context of reputation information so as to facilitate the exchange and transfer of reputation information across distributed heterogeneous reputation systems for selection of the best service for a particular user&amp;#39;s requirements.</span><div></div><div></div>]]></description>
<pubDate>11/19/2008 19:48</pubDate>
<author><![CDATA[Wanita Sherchan,Shonali Krishnaswamy,Seng W. Loke]]></author></item>
<item><title><![CDATA[Identifying Security Aspects In Web-based Federations]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1678</link>
<description><![CDATA[&amp;nbsp; <span style=\"font-size: 10pt\">Today&amp;#39;s web applications and their respective business processes reside under the control of different organizations. Establishing federations between these organizations, i.e. bringing these business processes together by transcending organizational and security borders, raises a new class of security questions concerning the management of trust relationships between the autonomous bodies that wish to work together. Based on the Web Composition Architecture Model we provide a modeling approach for federated Web applications. In this paper we present a methodology for formalizing these models using the Ambient Calculus for use in further computation. Based on the results we help the users to identify and detect security related aspects in Web-based federations.</span><div></div><div></div>]]></description>
<pubDate>11/19/2008 19:49</pubDate>
<author><![CDATA[Andreas Heil,Martin Gaedke,Johannes Meinecke]]></author></item>
<item><title><![CDATA[Mining the Web of Trust for Web Services Selection]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1679</link>
<description><![CDATA[Trust and reputation mechanisms offer a promising way to solve the web services selection problem. Currently, many researches on this topic focus on collecting, storing and aggregating feedbacks which can be execution data from monitoring web services or user ratings reported by service consumers for web services evaluation. However, besides considering the evaluation methods, the reliability of feedbacks becomes equally crucial. It is pointed out that the accuracy of a web service&amp;rsquo;s reputation evaluation will be reduced as unreliable feedbacks are used. Therefore, the elicitation of trusted feedbacks and feed backers becomes very important. In this paper, we managed to elicit trusted users in our service registry through building and maintaining a &amp;ldquo;Web of Trust&amp;rdquo;. We mined this web of trust by our proposed algorithm which is based on the Kalman Filter Algorithm and analyzed the trustworthiness for each user. Feedbacks reported by trusted users then should be considered more reliable than others to ultimately facilitate the web services selection process. <div align="center"><a href="uploadfiles/2008/VIDEO/ICWS2008-1115/ICWS2008-1115.html" target="_blank"><strong>&amp;gt;&amp;gt;&amp;gt; View Video(Flash Player 9 please. Version 10 may not work as expected)</strong></a> </div><div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\ICWS2008-1115.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>3/28/2009 04:25</pubDate>
<author><![CDATA[Sibo Cai,Yanzhen Zou,Bing Xie,Weizhong Shao]]></author></item>
<item><title><![CDATA[New Broadcasting System Combined With Radio Broadcasting and WWW]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1680</link>
<description><![CDATA[&amp;nbsp; <span style=\"font-size: 10pt\">Despite the benefits those communities FM radio broadcasting services provide to their listeners, more than half of the community stations in Japan are struggling financially. This situation has arisen because the Internet has attracted advertising revenue away from radio broadcasting channels. One way to revive local FM radio broadcasting is by adding new representation function to radio signals. It is designed for many listeners to share the same information simultaneously. On the other hand, while the Web provides a variety of content, its ability to broadcast is inferior to that of TV or radio broadcasting. Combining radio broadcasting and the WWW provides a new broadcasting media. The control signals used for accessing the Web are put onto radio sound by using acoustic OFDM technology. We developed and evaluated such a broadcasting system.</span><div></div><div></div>]]></description>
<pubDate>11/19/2008 19:51</pubDate>
<author><![CDATA[Yoshitoshi Murata,Daisei Sato,Yuki Itoga,Tsuyoshi Takayama,Nobuyoshi Sato,Shoichi Horiguchi]]></author></item>
<item><title><![CDATA[Reliability Analysis of Component-Based Software Based on Relationships of Components]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1681</link>
<description><![CDATA[&amp;nbsp; <span style=\"font-size: 10pt\">Recent development in daily business life indicates</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">demand for higher reliability of SOA software. After</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">analyzing the traditional software reliability models</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">(Markov chain based), it was found that many software</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">with complicated relationships of components did not</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">satisfy the Markov property. This paper analyzed various</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">complex components&amp;#39; relationships (parallel, loops,</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">backup, fault- tolerance, request and response, etc.) how</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">to influence the reliability of the</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">whole system, and solved</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">these complicated relationships to satisfy the Markov</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">property. This work extended the scope of the application</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">of the Markov Model and improved the accuracy of</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">reliability estimation.</span><div></div><div></div>]]></description>
<pubDate>11/19/2008 19:53</pubDate>
<author><![CDATA[Dong Wang,Ning Huang,Ming Ye]]></author></item>
<item><title><![CDATA[An Acknowledgement-based Approach to Synthesizing Reliable Service Mediators]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1682</link>
<description><![CDATA[&amp;nbsp; <span style=\"font-size: 10pt\">In this paper, we characterize the problem of how to synthesize a reliable service mediator that can guarantee reliable interaction of the mediated Web services. We first present formal models of reliable protocols for Web services and service mediators. Then, we introduce an algorithm for synthesizing reliable service mediators.</span><div></div><div></div>]]></description>
<pubDate>11/19/2008 19:54</pubDate>
<author><![CDATA[Baoping Lin,Qing Li,Naijie Gu]]></author></item>
<item><title><![CDATA[Trust Management for Web Services]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1683</link>
<description><![CDATA[&amp;nbsp; <span style=\"font-size: 10pt\">I</span><span style=\"font-size: 10pt\">n this paper, we propose a comprehensive trust management</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">approach for web services that covers the analysis/</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">modeling of trust relationships and the development of</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">trust management</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">layer in a consistent manner. The specific</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">characteristics of trust relationships in web services are discussed.</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">We introduce a separated trust management layer</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">for web services that can hold computing components for</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">trust management tasks. Trust management architecture</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">for web services is proposed for building up the trust management</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">layer. The proposed trust management architecture</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">for web services deals with trust requirements, trust evaluation,</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">and trust consumption in web services under a unified</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">umbrella and it provides a solid foundation upon which may</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">evolve the trust management layer for web services.</span><div></div><div></div>]]></description>
<pubDate>11/19/2008 19:55</pubDate>
<author><![CDATA[Weiliang Zhao,Vijay Varadharajan]]></author></item>
<item><title><![CDATA[A Comprehensive Six-Dimensional Quality of Web Services Assessment Model]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1684</link>
<description><![CDATA[&amp;nbsp; <span style=\"font-size: 10pt\">We propose a six dimensional QoWS model including expected QoWS, agreed QoWS, delivered QoWS,</span><span style=\"font-size: 10pt\"> </span><span style=\"font-size: 10pt\">perceived QoWS, transmitted QoWS, and statistic QoWS to assess quality of Web services comprehensively and objectively. Meanwhile, the proposed assessment mechanism evaluates Web services from the view of compliance, end-to-end performance, and long-term performance.</span><div></div><div></div>]]></description>
<pubDate>11/19/2008 19:56</pubDate>
<author><![CDATA[Nan Guo,Tianhan Gao,Bin Zhang]]></author></item>
<item><title><![CDATA[Choreography = Orchestration with Scripts + Conversations]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1685</link>
<description><![CDATA[&amp;nbsp; <span style=\"font-size: 10pt\">The specification, design and implementation of web service applications need to address three major aspects: Orchestration of Services, Conversation and Choreography. In distributed computing, abstractions such as scripts have been used to abstract patterns of communication hiding low level details. In this paper, we demonstrate an approach of integrating orchestration with scripting to depict a pattern of communication or conversations among various agents.</span><div></div><div></div>]]></description>
<pubDate>11/19/2008 19:57</pubDate>
<author><![CDATA[A.K. Bhattacharjee,R.K. Shyamasundar]]></author></item>
<item><title><![CDATA[Developing Process Mediator for Web Service Interactions]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1686</link>
<description><![CDATA[&amp;nbsp; <span style=\"font-size: 10pt\">Web service interactions lie in the core of SOA. Due to the autonomy, heterogeneity and continuous evolution of Web services, mediators are usually needed to support service interactions to overcome possible mismatches that may exist among business processes. In this paper, we introduce a space-based architecture for process mediator which considers both control-flow and data-flow, present possible mismatch patterns, and suggest how they can be automatically mediated. Our work can be used to perform runtime mediation and thus to facilitate service interactions.</span><div></div><div></div>]]></description>
<pubDate>11/19/2008 19:58</pubDate>
<author><![CDATA[Zhangbing Zhou,Sami Bhiri,Walid Gaaloul,Lei Shu,Laurentiu Vasiliu,Manfred Hauswirth]]></author></item>
<item><title><![CDATA[Service Differentiation for Business Process by Value Based Service Scheduling]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1687</link>
<description><![CDATA[&amp;nbsp; <span style=\"font-size: 10pt; color: windowtext\">Service differentiation is a practical approach for service provider to deliver &amp;quot;good&amp;quot; service quality to different customers or customer segments under limited computing resources. In this paper, we address the problem of differentiating business process services by effectively scheduling tasks inside business processes, where dynamic value of service request, process instance execution status and workload of service components are all taken into consideration. Corresponding framework architecture and a scheduling algorithm are purposed for this purpose. </span><div></div><div></div>]]></description>
<pubDate>11/19/2008 20:00</pubDate>
<author><![CDATA[Chen Wang,Qiming Tian,Xiaoyan Chen,Chun Ying]]></author></item>
<item><title><![CDATA[Towards A Reversible BPEL Debugger]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1688</link>
<description><![CDATA[Despite the great momentum gained about the testing, analysis and verification of BPEL process, little attention has paid to the debugging issues, especially about the building of ad hoc debuggers. In this paper, we propose and implement RBDB (Reversible BPEL DeBugger), a specially made reversible debugger for BPEL process. RBDB is built on the abstract debugging APIs to fulfill its functionality. A reversible concurrent debugging model and three strategies to handle different type of external web services are introduced later. Finally, a comprehensive analysis of experiment data is presented. Evaluation results demonstrate that RBDB can improve users&amp;rsquo; efficiency significantly and decrease the invoking times of external services substantially. <div align="center"><a href="uploadfiles/2008/VIDEO/ICWS2008-1124/ICWS2008-1124.html" target="_blank"><strong>&amp;gt;&amp;gt;&amp;gt; View Video(Flash Player 9 please. Version 10 may not work as expected)</strong></a> </div><div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\ICWS2008-1124.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>4/12/2009 20:54</pubDate>
<author><![CDATA[Liang Bao,Sheng Chen,Xiyang Liu,Shengming Hu,Ping Chen]]></author></item>
<item><title><![CDATA[Control Flow Intervention for Semantic Failure Handling during Composite Service Execution]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1689</link>
<description><![CDATA[&amp;nbsp; <span style=\"font-size: 10pt\">In this paper we report on our work towards a novel system that aims at the combination of classical failure handling methods for composite service execution and support for automatic handling of semantic application level failures. In particular, we formulate the notion of Control Flow Intervention; a generalization for handling those two types of failure categories. When combined with automatic service composition it constitutes an optimistic forward recovery method. The method adopts expressive semantic service annotations provided by OWL resp. OWL-S.</span><div></div><div></div>]]></description>
<pubDate>11/19/2008 20:02</pubDate>
<author><![CDATA[Thorsten Möller,Heiko Schuldt]]></author></item>
<item><title><![CDATA[SWFilter: Semantic Web Services Filtering System]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1690</link>
<description><![CDATA[&amp;nbsp; Web services search and discovery systems have received a great deal of attention recently. However, little attention has been given to a web services filtering system. In this paper, we propose a design and architecture of a semantic web services filtering system called SWFilter. SWFilter uses Pr&amp;uml;ufer sequences transformed from web services and user queries. The filtering process is performed in a bottomup manner. Ontology information and compositions of web services are also considered in the filtering process. <div align="center"><a href="uploadfiles/2008/VIDEO/ICWS2008-1126/ICWS2008-1126.html" target="_blank"><strong>&amp;gt;&amp;gt;&amp;gt; View Video(Flash Player 9 please. Version 10 may not work as expected)</strong></a> </div><div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\ICWS2008-1126.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>4/12/2009 20:59</pubDate>
<author><![CDATA[Joonho Kwon,Sukho Lee]]></author></item>
<item><title><![CDATA[A Clustering-based Approach for Assisting Semantic Web Service Retrieval]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1691</link>
<description><![CDATA[&amp;nbsp; <span style=\"font-size: 10pt\">The discovery of suitable web services for a given task from a brokerage system is the core part of current Service Oriented Architecture (SOA). With the number of registered web services growing, organization of search results is critical for improving the utility of any service search engine. A clustering view of search results is more effective than traditional ranked-list style in helping users to navigate into relevant services quickly and accurately. In this paper, we will propose an efficient clustering algorithm for organizing returned services. Our experiments validated the efficiency of the proposed method.</span><div></div><div></div>]]></description>
<pubDate>11/19/2008 20:15</pubDate>
<author><![CDATA[Dong Shou,Chi-Hung Chi]]></author></item>
<item><title><![CDATA[Research on WS-Management-based System and Network Resource Management Middleware]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1692</link>
<description><![CDATA[Nowadays, system and network resource management software should deal with more and more heterogeneous specific interfaces of different resource. This is a tightly-coupled management model. Recent years, Web Services have become the major technology and architecture of SOA for enterprise applications. Web Services provides a loosely-coupled management model. In this paper, based on the Web Services-based management protocol-WSManagement, we propose the distributed System and Network Resource Management Middleware Model. In this model, every managed IT resource provides the manageability interfaces via WS-Management specification. Furthermore, we utilize WSManagement Java implementation prototype-wiseman and WMI management interface to carry out the scheme implementation and test case work of the novel model, and then analyze the experiment results. At last, we analyze the prospective research direction and challenges in this field. <div align="center"><a href="uploadfiles/2008/VIDEO/ICWS2008-1128/ICWS2008-1128.html" target="_blank"><strong>&amp;gt;&amp;gt;&amp;gt; View Video(Flash Player 9 please. Version 10 may not work as expected)</strong></a> </div><div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\ICWS2008-1128.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>4/12/2009 21:03</pubDate>
<author><![CDATA[ZhiHui Lu,Jie Wu,ShiYong Zhang,YiPing Zhong]]></author></item>
</Channel>
</rss>