<?xml version="1.0" encoding="utf-8"?>
<rss version="2.0">
<Channel>
<language>en-us</language>
<title>SCC2008</title>
<link>http://www.servicescomputing.tv/rss/view/rssFeed.php?category=27</link>
<description>SCC2008 all articles</description>
<item><title><![CDATA[Verification of Access Control Requirements in Web Services Choreography]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1693</link>
<description><![CDATA[Web services choreography is used to design peer-topeer applications where each peer is potentially a Web service. It defines the required behavior of participating Web services along with their interactions through message exchanges. Implementing a complex system described by a choreography requires selecting actual Web services whose individual behaviors are compatible with the overall behavior described by the choreography. Although the selected Web services implement the specified behavior, they may not be able to interact due to the policies they enforce to protect their resources. A Web service&amp;#39;resource can be an operation or a credential type to be submitted to be able to invoke an operation. In this paper, we propose a novel approach to determine at design time whether a choreography can be implemented by a set of Web services based on their access control policies and the disclosure policies regulating the release of their credentials. We model both Web services and Web services choreography as transition systems and represent Web services credential disclosure policies as directed graphs. We then verify that all possible conversations of the Web services choreography can be implemented by matching credential disclosure policies of the invoker Web service with the access control policy of the Web services being invoked. We propose a resource release graph to enable this verification. <div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0001/SCC2008-0001.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\PDF\SCC2008-0001.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\SCC2008-0001.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>1/14/2009 22:49</pubDate>
<author><![CDATA[Federica Paci,Mourad Ouzzani,Massimo Mecella]]></author></item>
<item><title><![CDATA[Pattern-based Policy Configuration for SOA Applications]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1694</link>
<description><![CDATA[<p>Service Component Architecture (SCA) defines a component model that allows for a late binding with a concrete implementation. Similarly, the SCA policy framework defines a policy mechanism that uses intents, which are high-level declarations of desired nonfunctional features that are bound to concrete policies at a later time. The definitions of intents are simple, but the actual intent application is complex. Meeting policy requirements requires application of intents at many points in an assembly, and presumes domain knowledge about the semantics and constraints related to using a particular combination of intents. We propose patternbased policy configuration to resolve these difficulties. Our proposed configuration system has two features: policy intent patterns and pattern application rules. Domain knowledge is encoded as roles and role constraints in policy intent patterns. Pattern application rules can be used to define how patterns are applied automatically. This paper takes the original approach of thinking about policy application from a compositional perspective; this reduces the complexity of meeting nonfunctional requirements for SCA assemblies and provides a validation framework for applied intents.</p><div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0002/SCC2008-0002.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\PDF\SCC2008-0002.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\SCC2008-0002.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>12/24/2008 20:19</pubDate>
<author><![CDATA[Fumiko Satoh,Nirmal K. Mukhi,Yuichi Nakamura,Shinichi Hirose]]></author></item>
<item><title><![CDATA[Monitoring Dependencies for SLAs: The MoDe4SLA Approach]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1695</link>
<description><![CDATA[In service oriented computing different techniques for monitoring Service Level Agreements (SLAs) are available. Many of these monitoring approaches focus on bilateral agreements between partners. However, when monitoring composite services it is not only important to figure out whether SLAs are violated, but we also need to analyze why these violations have occurred. When offering a composite service a company depends on its content providers to meet the service level they agreed upon. Due to these dependencies a company should not only monitor the SLA of the composite service, but also the SLAs of the services it depends on. By analyzing and monitoring the composite service in this way, causes for SLA violations can be easier found. In this paper we demonstrate how to analyze SLAs during development phase and how to monitor these dependencies using event logs during runtime. We call our approach MoDe4SLA (Monitoring Dependencies for SLAs). <div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0003/SCC2008-0003.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\PDF\SCC2008-0003.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\SCC2008-0003.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>12/24/2008 20:17</pubDate>
<author><![CDATA[Lianne Bodenstaff,Andreas Wombacher,Manfred Reichert,Michael C. Jaeger]]></author></item>
<item><title><![CDATA[Towards Effective Project Management across Multiple Projects with]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1696</link>
<description><![CDATA[<p>Software service providers develop custom solutions to meet their customers&amp;#39; requirements. Large customers can typically contract out multiple projects to the same vendor which run the projects assigned to them simultaneously. Large providers are increasingly using a distributed/ global model for software development (delivery) wherein they can leverage the skills and cost-advantages of different sites to deliver the projects effectively and efficiently, for which project coordination with accurate information is of central importance. In this paper, we highlight the challenges in effective project coordination for a customer across multiple projects with distributed performing centers. This situation is not addressed by current project management or software development tools. The nature of the problem requires standardized metadata, schedule and resource management, and measurements for project monitoring. We propose a framework for global project management and governance to addresses the identified challenges which also takes current project tools into perspective. Our approach extensively leverages historical data gathered on metrics pertaining to different types of work requests. </p><div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0004/SCC2008-0004.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\PDF\SCC2008-0004.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\SCC2008-0004.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>3/19/2009 04:17</pubDate>
<author><![CDATA[Rohit M. Lotlikar,Ramana Polavarapu,Sadhika Sharma,Biplav Srivastava]]></author></item>
<item><title><![CDATA[Optimizing Change Request Scheduling in IT Service Management]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1697</link>
<description><![CDATA[Enterprises of today face the challenge of managing large, complex IT eco-systems consisting of software applications, servers, network routers, and other type of resources. Change management, especially scheduling of changes, is known to be one of the most challenging problems in managing IT operations. In this paper, we propose an optimization model for IT change scheduling that takes into account the constraints and cost factors typically encountered in a service provider environment. In particular, we formulate the model in a way that can be solved using standard mathematical programming techniques (i.e., mixed integer programming). This not only results in strictly optimal solutions, but also provides a scalable means for scheduling a large set of change requests with complex constraints. Furthermore, having a computational efficient optimization solution facilitates the study of the scheduling sensitivity with respect to parameter inaccuracy and leads to more robust change schedules. Finally, we demonstrate the effectiveness of the proposed approach in an IT change management example which is built using insights from a large service delivery account and over two hundred thousand change instances. <div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0005/SCC2008-0005.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\PDF\SCC2008-0005.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\SCC2008-0005.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>3/11/2009 03:56</pubDate>
<author><![CDATA[Leila Zia,Yixin Diao,Daniela Rosu,Chris Ward,Kamal Bhattacharya]]></author></item>
<item><title><![CDATA[Predictive Admission Control Algorithm for Advance Reservation in Equipment]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1698</link>
<description><![CDATA[Experiments submitted to equipment grid have quality of service (QoS) requirements, and advance reservation is used to satisfy such requirements. Due to the dynamic behaviors and fluctuations of resources in equipment grid, some previously accepted advance reservations are unable to be fulfilled. In this paper, we present a predictive admission control algorithm to decide whether new advance reservation requests can be accepted according to their QoS requirements and prediction of future resource utilization. Historical data are used in this algorithm to predict future status of resources. Experiments demonstrate that our algorithm can reduce the number of accepted advance reservations that fail to be fulfilled and keep the resource utilization ratio at an acceptable level. <div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0006/SCC2008-0006.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\PDF\SCC2008-0006.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\SCC2008-0006.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>12/24/2008 19:52</pubDate>
<author><![CDATA[Jie Yin,Yuexuan Wang,Meizhi Hu,Cheng Wu]]></author></item>
<item><title><![CDATA[End-to-End Versioning Support for Web Services]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1699</link>
<description><![CDATA[Software services are, just like any other software system, subject to permanent change. We argue that these changes should generally be transparent to service consumers. However, currently consumers are often tied to a given version of a service and have no means of easily upgrading to a newer version. In this paper we propose a WSDL-driven classification of Web service change types and discuss a versioning mechanism for service-oriented systems that considers revision management on registryand client-side. We use the concepts of service version graphs and selection strategies to provide transparent endto- end versioning support, and show how this approach is implemented in our service-oriented computing runtime VRESCo. Furthermore, we illustrate the advantages of our approach in comparison to the current state of the art using a realistic case study. <div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0007/SCC2008-0007.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\PDF\SCC2008-0007.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\SCC2008-0007.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>12/24/2008 19:54</pubDate>
<author><![CDATA[Philipp Leitner,Anton Michlmayr,Florian Rosenberg,Schahram Dustdar]]></author></item>
<item><title><![CDATA[Representing and Accessing Design Knowledge for Service Integration]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1700</link>
<description><![CDATA[Process construction from existing services requires use of appropriate design knowledge. For services that are mapped to underlying legacy applications, this takes the form of enterprise integration solutions. Design knowledge in this domain is available in the form of Enterprise Integration Patterns (EIP). These patterns are, however, difficult to understand; they also use primitives that are different from those used for process representation. As a result, accessing EIP based on process requirements remains a cognitively demanding task for designers. In this paper, we describe a knowledge-base that represents the EIPs, infusing them with semantics derived from speech acts; and a set of heuristics, which can be used to retrieve EIPs for a set of requirements. An example serves to illustrate how the two can work in tandem to assist the designer. <div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0008/SCC2008-0008.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\PDF\SCC2008-0008.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\SCC2008-0008.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>12/24/2008 19:56</pubDate>
<author><![CDATA[Karthikeyan Umapathy,Sandeep Purao]]></author></item>
<item><title><![CDATA[Incomplete Preference-driven Web Service Selection]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1701</link>
<description><![CDATA[Selecting services from those available according to user preferences plays a important role in Web services composition. Current solutions for service selection focus on selecting services quantitatively. In many domains it is desirable to assess such preference in a qualitative rather than quantitative way. Furthermore, in many practical situations, if the user is reluctant to provide complete preference information or to totally order the values of each attributes in every possible context, it is natural to ask how to model in these incompletely specified cases. This paper uses a qualitative graphical representation tool, called CP-nets, to describe qualitative preference relations in a relatively compact, intuitive, and structured manner under conditional ceteris paribus (all else being equal) preference statements. Our goal is to select the optimal set of services available according to user preference with this technique. Experiment results demonstrate the effectiveness and performance of this approach.<div></div><div></div>]]></description>
<pubDate>11/19/2008 21:21</pubDate>
<author><![CDATA[Hongbing Wang,Junjie Xu,Peicheng Li,Patrick Hung]]></author></item>
<item><title><![CDATA[Zazen: A Mediating SOA Between Ajax Applications and Enterprise Data]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1702</link>
<description><![CDATA[One reason that enterprises are adopting serviceoriented architectures (SOA) is to develop applications more quickly by packaging - and then reusing - applications and data assets as services. Service encapsulation of implementation details is an important feature, and contributes to the loosely-coupled nature of a SOA. From this perspective, SOA data-services seem incompatible with AJAX frameworks which presume a great degree of client-side control of an application&amp;#39;s data. For their part, AJAX frameworks promise to increase web-application performance by reducing the number of interactions between the browser and server. Caching server data on the web-client is a wellknown technique for achieving this goal, but implies that enterprise data is exposed to client-side developers. This paper presents ZAZEN, a SOA that mediates between the need to encapsulate enterprise data as a service and the needs of AJAX developers who want more control of their application&amp;#39;s data. We describe ZAZEN&amp;#39;s server-side architecture and discuss two APIs to the data-service: a REST API, and an implementation of the DOJO data APIs for relational databases.<div></div><div></div>]]></description>
<pubDate>11/19/2008 21:23</pubDate>
<author><![CDATA[Avraham Leff,James T. Rayfield]]></author></item>
<item><title><![CDATA[To Establish Enterprise Service Model from Enterprise Business Model]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1703</link>
<description><![CDATA[One of the key activities that are needed to construct a quality service-oriented solution is the identification of its architectural elements with the right granularity. The selection of an appropriate method for identification of services from business models of an enterprise is thus quite crucial to the success of any service-oriented solution for that enterprise. Existing methods for service identification ignore required performance metrics and semantics integrity of business elements; more importantly, they focus on entity-based services while ignoring process based ones. This paper proposes a new process for identification and specification of enterprise software services and their architectural elements. A novel clustering technique, named Elementary business process and business Entity Affinity analysis Technique (EEAT), is introduced for identifying candidate architectural elements. This technique identifies each candidate service with the right granularity, while satisfying low coupling, high cohesion, and low reuse cost principles for reusable software services.<div></div><div></div>]]></description>
<pubDate>11/19/2008 21:26</pubDate>
<author><![CDATA[P. Jamshidi,M. Sharifi,S. Mansour]]></author></item>
<item><title><![CDATA[SCOOP: Automated Social Recommendation in Enterprise Process Management]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1704</link>
<description><![CDATA[The interplay between labor arbitrage and consistent service delivery in IT outsourcing continues to drive business process standardization. New emerging standards, like ITIL, is defining an industry-wide taxonomy for IT service management. These standards are often at a high level and require substantial investment from service providers to define and implement these standards across the various low-level processes they offer. This paper presents a process management system, called Cyano, that uses social networks and recommendation to greatly increase the effectiveness of process capture and knowledge maintenance. We particularly focus on Cyano&amp;#39;s social recommendation engine, called SCOOP, which utilizes the intrinsic graph property of process content for recommendation. More specifically, SCOOP maintains a user-process interaction graph G and computes the user-to-user similarity scores using the random walk with restart on G. Finally, we evaluate SCOOP in the context of a large-scale deployment of Cyano, with thousands of processes and users. <div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0012/SCC2008-0012.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\SCC2008-0012.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>3/11/2009 03:59</pubDate>
<author><![CDATA[Huiming Qu,Jimeng Sun,Hani T. Jamjoom]]></author></item>
<item><title><![CDATA[Auction Based Models for Ticket Allocation Problem in IT Service Delivery Industry]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1705</link>
<description><![CDATA[In this paper, we study the service request (ticket) allocation problem which arises in every IT service delivery organization. We refer to this problem as Ticket Allocation Problem (TAP). We first show that TAP is an instance of the online scheduling problem on unrelated machines, which is known to be a hard problem. Next, we describe a baseline model, namely push model, that deals with the TAP. The push model is an industry wide standard and can be used with any known online scheduling algorithm for unrelated machines. To elaborate this further, we discuss a well known Generalized List Scheduling algorithm which can be used by the push model. We prove a bound for this algorithm&amp;#39;s competitive ratio which beats all the known bounds. We show that push model suffers from an inherent inefficiency due to scheduler having incomplete and imprecise information regarding agents&amp;#39; proficiency. Finally, we show that if the scheduling algorithm used by the push model can be converted into a truthful auction mechanism then all the inefficiencies of the push model can be overcome. We refer to the resulting model as the pull model. To illustrate the idea, we map the Generalized List Scheduling algorithm into a truthful auction mechanism. Through simulation experiments, we show that the auction based pull model results in higher efficiency than the push model. <div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0013/SCC2008-0013.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\SCC2008-0013.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>12/24/2008 19:57</pubDate>
<author><![CDATA[Prasad M Deshpande,Dinesh Garg,N Rama Suri]]></author></item>
<item><title><![CDATA[Experimental Robustness Evaluation of JMS Middleware]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1706</link>
<description><![CDATA[The use of Java Message Service (JMS) for enterprise applications communication and integration is increasing very quickly. However, although JMS is frequently used in business-critical environments, applications are typically developed with the assumption that the middleware being used is robust, which is not always the case. Robustness failures in such environments are particularly dangerous, as they may originate vulnerabilities that can be maliciously exploited with severe consequences for the systems subject of attack. This paper proposes an approach for the evaluation of the robustness of JMS middleware. Our approach is presented through a concrete example of evaluating the robustness of three well-known JMS solutions (JBoss MQ 3.2.8.SP1, JBoss MQ 4.2.1.GA, and Active MQ 4.1.1), in which several robustness and critical security related problems have been disclosed (including specification conformance disparities). <div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0014/SCC2008-0014.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\PDF\SCC2008-0014.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\SCC2008-0014.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>12/24/2008 20:02</pubDate>
<author><![CDATA[Nuno Laranjeiro,Marco Vieira,Henrique Madeira]]></author></item>
<item><title><![CDATA[Locating Components Realizing Services in Existing Systems]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1707</link>
<description><![CDATA[Organizations adopting Service Oriented Architecture can derive higher business value only if the functionality provided by existing systems is reused. &amp;quot;Servicising&amp;quot; existing systems (locating and exposing available functionality as a set of service based operations), is an efficient way forward, to the evolution of existing systems to SOA. To facilitate the location of service(s) already implemented in the systems, a helpful step is to locate components that realize the required functionality. In this paper, a static and semi-automatic approach to locating components realizing service is proposed. The approach consists of three steps: retrieval of links between a service and the components in the source code, filtering of links using static structural analysis and finally categorizing them as functional and technical components. The results of the approach applied to two open source systems are presented. The results indicate that the approach is quite effective in identifying the links between the service descriptions and source code components and categorizing them into functional and technical components. <div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0015/SCC2008-0015.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\PDF\SCC2008-0015.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\SCC2008-0015.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>1/15/2009 00:03</pubDate>
<author><![CDATA[Renuka Sindhgatta,Karthikeyan Ponnalagu]]></author></item>
<item><title><![CDATA[On The Specification Of Payment Requirements For Collaborative Services]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1708</link>
<description><![CDATA[Payment arrangement is one of the vital issues in a B2B setting. For example, failing to accurately specify and communicate payment details such as the method of the payment, whether payment is refundable and negotiable, and what settlement model is used, can lead to serious disputes between the provider and requester of a service. However current development and solutions in service description, e.g., WSDL, do not cater for the specification and negotiation of payment related requirements for services. In this paper we present a comprehensive modeling approach for capturing and specifying payment requirements in the context of business collaboration. It will lay a foundation for service providers and requesters to explicitly define and adjust their business and technical requirements for payment in an adaptive and verifiable way. Furthermore, it provides support for terms of payment to be negotiated effectively to reach service provisioning agreements.<div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\PDF\SCC2008-0016.pdf.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>11/19/2008 21:40</pubDate>
<author><![CDATA[Bart Orriens,Jian Yang]]></author></item>
<item><title><![CDATA[A Graph Theory Based Impact and Completion Analysis Framework and A Graph Theory Based Impact and Applications for Modeling SOA Solution Components]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1709</link>
<description><![CDATA[Evolved from our engineering experience, this paper presents a mathematical framework to define and analyze an SOA (Service-Oriented Architecture) model. SOA model, composed by design elements, is represented as directed graph based on graph theory. For each design element, two directed graphs are created to reflect the panoramic view and relationships of this design element with other design elements of same model, and used for impact and completion analysis of this design element. A numerical value called the relative importance indicator is computed to quantify the relationship between any two design elements. This indicator forms a matrix that is used as a base for more advanced analysis, such as model partition, model coupling, and variation-oriented design. Some future research directions such as model reduction are discussed at the end of this paper. <div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0017/SCC2008-0017.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\PDF\SCC2008-0017.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\SCC2008-0017.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>3/16/2009 23:57</pubDate>
<author><![CDATA[Nianjun Zhou,Liang-Jie Zhang]]></author></item>
<item><title><![CDATA[Web Service Matching By Ontology Instance Categorization]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1715</link>
<description><![CDATA[Identifying similar Web services is becoming increasingly important to ensure the success of dynamically integrated Web-service-based applications. We propose a categorization-based scheme to match equivalent Web services that can operate on heterogeneous domain ontologies. Given the upper ontology for services and domain ontologies, our service matching scheme determines whether a given Web service is a possible replacement using a categorization utility called OnExCat. OnExCat categorizes ontology instances extracted from the service descriptions by a probabilistic categorization measurement that incorporates the concept relationships in the upper ontology for services. In addition to tackling the issue of heterogeneity of domain ontology in service descriptions using categorization, our matching scheme also adapts itself by enhancing the known ontologies with newly discovered ontology instances. Experiments on service matching using our matching scheme based on the OnExCat utility have been performed with promising results, a correct matching rate of over 85%. 1. Introduction Web services facilitate dynamic formation <div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0023/SCC2008-0023.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\PDF\SCC2008-0023.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\SCC2008-0023.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>3/11/2009 04:10</pubDate>
<author><![CDATA[Qianhui Althea Liang,Herman Lam]]></author></item>
<item><title><![CDATA[Rapid Deployment of SOA Solutions via Automated Image Replication and Reconfiguration]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1710</link>
<description><![CDATA[Deployment is an important aspect of software solutions&amp;#39; life-cycle and is repeatedly employed at many stages including development, testing, delivery, and demonstration. Traditional script-based approaches for deployment are primarily manual and hence error prone, resulting in wasted time and labor. In this paper we propose a framework and approach for faster redeployment of distributed software solutions. In our approach the solution is first deployed on virtual machines using traditional methods. Then environment dependent configurations of the solution are discovered and preserved along with the images of virtual machines. For subsequent deployments, the preserved images are provisioned, and the deployer is provided an opportunity to change a subset of the recorded configurations that cannot be automatically derived e.g. IP addresses, ports. The remaining recorded configurations are derived by executing meta-model level constraints on the solution configuration model. Finally, the virtual machines are updated with new configurations by leveraging the semantics of appropriate scripts. Our framework allows product experts to describe the configuration meta-model, constraints, and script semantics. This product knowledge is specified only once, and is reused across solutions for automatic configuration discovery and re-configuration. We demonstrate with case studies that our approach reduces the time for repeated deployments of a solution from an order of weeks to an order of hours. <div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0018/SCC2008-0018.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\PDF\SCC2008-0018.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\SCC2008-0018.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>3/11/2009 04:02</pubDate>
<author><![CDATA[Manish Sethi,Kalapriya Kannan,Narendran Sachindran,Manish Gupta]]></author></item>
<item><title><![CDATA[Security Specification at Process Level]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1711</link>
<description><![CDATA[In this paper, we present a process-oriented tool allowing the specification of security properties at the service composition level. The tool is based on the notions of abstract and concrete services as well as on the concept of separation of concerns. It provides a framework that allows different people to effectively discuss security issues. Abstract services can be viewed as activities rather than as technical services and are such better understood by nontechnical people. Similarly, security is discussed in terms of needs and no complex security technologies are to be specified. The tool relies between these two meta-models specifying orchestration-related concepts and security concepts. Meta-links between the meta-models have been defined to specify the authorized security constraints on the orchestrated services. The tool has been validated on an application specified by Thales. <div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0019/SCC2008-0019.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\PDF\SCC2008-0019.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\SCC2008-0019.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>1/15/2009 01:24</pubDate>
<author><![CDATA[St´ephanie Chollet,Philippe Lalanda]]></author></item>
<item><title><![CDATA[Adaptive Secure Access to Remote Services]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1712</link>
<description><![CDATA[Since the inception of service-oriented computing paradigm, we have witnessed a plethora of services deployed across a broad spectrum of applications, ranging from conventional RPC-based services to SOAP-based Web services. Likewise, the proliferation of mobile devices has enabled the remote &amp;quot;on the move&amp;quot; access of these services from anywhere at any time. Secure access to these services is challenging especially in a mobile computing environment with heterogeneous modalities. Conventional static access control mechanisms are not able to accommodate complex secure access requirements. In this paper, we propose an adaptive secure access mechanism to address this problem. Our mechanism, which consists of two components: an adaptive access control module and an adaptive function invocation module, not only adapts access control policies to diverse requirements, but also introduces function invocation adaptation during access. We have successfully applied the proposed adaptive secure access mechanism to a computer-assisted surgery application called UbiCAS. Performance evaluation shows that with limited overhead, our technique enforces secure access to the services provided by the UbiCAS system in a flexible way. <div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0020/SCC2008-0020.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\PDF\SCC2008-0020.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\SCC2008-0020.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>12/24/2008 20:05</pubDate>
<author><![CDATA[Hanping Lufei,Weisong Shi,Vipin Chaudhary]]></author></item>
<item><title><![CDATA[A Secure Information Flow Architecture for Web Services]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1713</link>
<description><![CDATA[Current web service platforms (WSPs) often perform all web services-related processing, including securitysensitive information handling, in the same protection domain. Consequently, the entire WSP may have access to security-sensitive information such as credit card numbers, forcing us to trust a large and complex piece of software. To address this problem, we propose ISO-WSP, a new information flow architecture that decomposes current WSPs into two parts executing in separate protection domains: (1) a small trusted TWSP to handle security-sensitive data, and (2) a large, legacy untrusted U-WSP that provides the normal WSP functionality, but uses the T-WSP for security-sensitive data handling. By restricting security-sensitive data access to T-WSP, ISO-WSP reduces the software complexity of trusted code, thereby improving the testability of ISO-WSP. Using a prototype implementation based on the Apache Axis2 WSP, we show that ISOWSP reduces software complexity of trusted components by a factor of five, while incurring a modest performance overhead of few milliseconds per request. <div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0021/SCC2008-0021.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\PDF\SCC2008-0021.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\SCC2008-0021.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>12/24/2008 20:06</pubDate>
<author><![CDATA[Lenin Singaravelu,Jinpeng Wei,Calton Pu]]></author></item>
<item><title><![CDATA[Morpheus: Semantics-based Incremental Change Propagation in SOA-based Solutions]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1714</link>
<description><![CDATA[<p>&amp;nbsp;</p><p>SOA-based solutions are typically modeled as business processes composed of loosely coupled services. Such an approach promises the flexibility to more easily customize the solution functionality in line with constantly changing customer requirements. The research issue that we address in this paper, therefore, is how to best accomplish this customization. Current approaches are typically manual and rather ad-hoc, involving repeated attempts to synchronize between (higher-level) design artifacts and (lowerlevel) source code to determine the configuration points. Alternatively, we propose a framework, Morpheus, which uses design artifacts to locate points of change in an SOAbased solution via multi-level change propagation. First, we formally define the structure and semantics of the design artifacts, and the relationships among them. Second, we use these relationships to enumerate all possible changes in each design artifact; if two design artifacts share a relationship, then we also map a change in one design artifact to related changes in the other. Third, using these change relationships, we present an algorithm to traverse the design artifacts so as to propagate changes based on change requirements, ultimately resulting in the modifications needed to support the changed requirements. We illustrate our ideas on a simple yet realistic example in the insurance domain, and also present a prototype implementation.</p><div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0022/SCC2008-0022.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\PDF\SCC2008-0022.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\SCC2008-0022.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>3/11/2009 04:06</pubDate>
<author><![CDATA[Ramya Ravichandar,Nanjangud C. Narendra, Karthikeyan Ponnalagu,Dipayan Gangopadhyay]]></author></item>
<item><title><![CDATA[An Automatic Semantic Segment Detection Service for HTML Documents]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1716</link>
<description><![CDATA[To facilitate wide adoption of wireless devices for Internet access, it is important to enable the &amp;quot;develop once and use everywhere&amp;quot; trademark. This means that a Web page can be developed in HTML for presentation on desktop machines, and then be automatically adapted and displayed on any device including handheld devices. In this paper, we propose a mediator Web service that automatically adapts Web content into suitable formats based on receiving contexts. Our underpinning is a hierarchical semantic meta model and a semantic ontology that guide in partitioning a Web page into semantic segments, which refer to atomic units encapsulating one or more of the four types of semantically coherent elements in a content page: function (functionality related), typesetting (readability related), presentation relationship (space and time related), and literary context (semantics related). We also report our experiences in designing and implementing the mediator service. Our experimental results demonstrate that our service is effective and efficient in automatically transforming Web content into semantic-retained formats suitable to be displayed on handheld devices. <div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0024/SCC2008-0024.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\PDF\SCC2008-0024.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\SCC2008-0024.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>3/11/2009 04:13</pubDate>
<author><![CDATA[Stephen J.H. Yang,Jia Zhang,Stella T.C. Tsai]]></author></item>
<item><title><![CDATA[Chord4S: A P2P-based Decentralised Service Discovery Approach]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1717</link>
<description><![CDATA[Service-oriented computing is emerging as a paradigm for developing distributed applications. A critical issue of utilising service-oriented computing is to have a scalable, reliable and robust service discovery mechanism. However, traditional service discovery methods using centralised registries can easily suffer from problems such as performance bottleneck and vulnerability to failures in the large scalable service network, thus functioning abnormally. To address these problems, this paper proposes a peer-to-peer based decentralised service discovery approach named Chord4S. Chord4S utilises the data distribution and lookup capabilities of the popular Chord to distribute and discover services in a decentralised manner. Data availability is further improved by distributing service descriptions of functionally-equivalent services to different successor nodes that are organised into a virtual segment in the Chord circle. In addition, the Chord routing protocol is extended to support efficient discovery of multiple services with single request. This enables late negotiation of service level agreements between a service consumer and multiple service providers. The experimental evaluation shows that Chord4S achieves higher data availability and provides efficient query with reasonable overhead. <div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0025/SCC2008-0025.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\PDF\SCC2008-0025.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\SCC2008-0025.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>12/24/2008 20:07</pubDate>
<author><![CDATA[Qiang He,Jun Yan,Yun Yang,Ryszard Kowalczyk,Hai Jin]]></author></item>
<item><title><![CDATA[Predicting Service Mashup Candidates Using Enhanced Syntactical Message Management]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1718</link>
<description><![CDATA[The descriptiveness of capabilities advertised on service-oriented architectures provides a promising platform for crafting new knowledge. Service mashup has been introduced as an approach for integrating the information provided from multiple web services into one common operational picture. In the future, scale will be a barrier to these types of approaches. With the entry and exit of large numbers of services on the Internet, it will be difficult to find and suggest the most relevant service candidates for new mashups. In this work, we present an efficient syntactical approach for actively discovering web service candidates for service mashups. This approach leverages the message naming characteristics of the developers and of the target service repository to inform search algorithms. Favorable precision results are described based on experimentation executed on an open repository of web service from the Internet. <div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\PDF\SCC2008-0026.pdf.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>11/19/2008 22:31</pubDate>
<author><![CDATA[M. Brian Blake ,Michael F. Nowlan]]></author></item>
<item><title><![CDATA[Proactive Runtime Service Discovery]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1719</link>
<description><![CDATA[In this paper we describe a framework that supports runtime service discovery in both pull and push modes. Our framework supports service discovery based on structural and behavioural models of services and applications, as well as quality and contextual constraints. In the approach, we use a proactive push mechanism in which services are identified in parallel to the execution of the system based on subscriptions of services and queries. A prototype tool has been implemented in order to illustrate and evaluate the framework.<div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\PDF\SCC2008-0027.pdf.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>11/19/2008 22:33</pubDate>
<author><![CDATA[Andrea Zisman,James Dooley,George Spanoudakis]]></author></item>
<item><title><![CDATA[Instance Isolation Analysis for Service-Oriented Architectures]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1720</link>
<description><![CDATA[When a service engages in multiple conversations concurrently, incoming messages must be correlated with messages previously sent or received. Languages such as BPEL incorporate correlation as rst-class citizen. However, current veri cation and testing techniques for service implementations largely ignore possible cor- relation anomalies as they typically focus on isolated conversations. This paper de nes the notion of instance isolation and shows how to check this property. For doing so it introduces -nets, a Petri net extension with name creation and name passing. <div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0028/SCC2008-0028.html" target="_blank"><strong>>>> 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\SCC2008-0028.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>1/15/2009 03:23</pubDate>
<author><![CDATA[Gero Decker,Mathias Weske]]></author></item>
<item><title><![CDATA[Variation-Oriented Engineering (VOE):Enhancing Reusability of SOA-based Solutions]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1721</link>
<description><![CDATA[Software service organizations typically develop custom solutions from scratch in each project engagement. This is not a scalable proposition, since it depends too heavily on labor alone. Rather, creating and reusing software &amp;quot;assets&amp;quot; is more scalable and profitable. One prevalent approach to building software solutions is to use service-oriented architecture (SOA) to compose software services to support business processes. In this context, the key to reusing assets is to support the right mechanisms to incrementally refine existing software services as well as business processes. In this paper, we propose a set of mechanisms called Variation- Oriented Engineering (VOE) to support this incremental refinement. VOE is a comprehensive formal approach for modeling end-to-end variability in SOA-based solutions for the purpose of enhancing reusability. We illustrate our approach on a realistic example from the insurance domain, via a prototype implementation. <div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0029/SCC2008-0029.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\PDF\SCC2008-0029.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\SCC2008-0029.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>1/15/2009 03:30</pubDate>
<author><![CDATA[N.C. Narendra,K. Ponnalagu,B. Srivastava,G.S. Banavar]]></author></item>
<item><title><![CDATA[Promoting Reuse via Extraction of Domain Concepts and Service Abstractions from Design Diagrams]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1722</link>
<description><![CDATA[Systematic reuse of software artifacts has been an elusive goal for several years. Service-Oriented Architecture (SOA) has been touted in recent years due its promise of fostering reuse. Even so, reuse with SOA continues to be limited due to the lack of formal techniques for extracting domain knowledge from existing reusable software assets. In this paper, we present an approach that extracts the domain knowledge and service abstractions from design diagrams of existing software solutions and represents it in a form that can be reused in new projects. We have implemented our approach and preliminary results indicate that both domain knowledge and service abstraction thus extracted can promote reuse of software assets to a large extent.<div></div><div></div>]]></description>
<pubDate>11/19/2008 22:41</pubDate>
<author><![CDATA[Kalapriya Kannan,Biplav Srivastava]]></author></item>
<item><title><![CDATA[Study of Service Processing Agent for Context-Aware Service Coordination]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1723</link>
<description><![CDATA[We proposed service processing agent which enables end-users to use context aware services easily. In ubiquitous network environments in the future, context-aware services are expected because the context-awareness is one of the most important factors in ubiquitous network. Therefore, the flexible service composition based on user context is required. Our proposed approach is that a service processing agent searches and selects suitable service components based on the user context and binds them dynamically. Users can send a request to the service processing agent in usual web service messaging. Through the study, implementation and performance measurement, we showed the effectiveness and practicality of our proposed method. <div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0031/SCC2008-0031.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\PDF\SCC2008-0031.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\SCC2008-0031.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>1/12/2009 22:05</pubDate>
<author><![CDATA[Yoji Yamato,Hiroyuki Ohnishi,Hiroshi Sunaga]]></author></item>
<item><title><![CDATA[PASS: An Approach to Personalized Automated Service Composition]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1724</link>
<description><![CDATA[With the rapid development of SOC (Service oriented computing), the automated service composition has become an important research direction. Through automated service composition, business processes need not to be constructed in advance, which helps to improve the flexibility of service composition. The current research on automated service composition is mainly based on AI techniques, and a common domain-oriented knowledge base is usually required to perform the heuristic planning. In practice, it is impossible for the knowledge base to characterize the personalized requirements of different users, so the AI-based methods can not apply to the user-centric application scenarios. In this paper, we propose PASS, a novel approach to personalized automated service composition. With PASS, both the hard-constraints represented by user&amp;#39;s initial state, and the soft-constraints represented by user preferences can be satisfied in the process of automated service composition. Furthermore, three algorithms are designed to implement preference-aware automated service composition. In these algorithms, the Pareto dominance principle and relaxation degree are used to select the most satisfied composite service for users. Finally, comprehensive simulations are conducted to evaluate the performance and effectiveness of the proposed algorithms.<div></div><div></div>]]></description>
<pubDate>11/19/2008 22:48</pubDate>
<author><![CDATA[Yang Li,JinPeng Huai,Hailong Sun,Ting Deng,Huipeng Guo]]></author></item>
<item><title><![CDATA[Runtime Protocol Binding: Flexible Service Integration By Means Of Flexible Service Interactions]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1725</link>
<description><![CDATA[Dynamic and flexible service composition and interaction are a must in Service Oriented Computing (SOC) scenarios. In this paper the authors present an extension to a previous work, the DENEB platform for the development and execution of Web processes, allowing Web processes to acquire and execute new interaction protocols at runtime. This makes DENEB a well adapted and flexible platform for service integration, useful to work in complex and evolving inter-organisational environments. The proposed solution is exemplified by means of the development of a real use case. <div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0033/SCC2008-0033.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\PDF\SCC2008-0033.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\SCC2008-0033.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>1/14/2009 20:55</pubDate>
<author><![CDATA[J. Fabra,P. A´ lvarez,J.A. Banares,J. Ezpeleta]]></author></item>
<item><title><![CDATA[A QSQL-based Efficient Planning Algorithm for Fully-automated Service Composition in Dynamic Service Environments]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1726</link>
<description><![CDATA[Web service composition is emerging as a promising technology for supporting large-scale, sophisticated business process integration in a variety of complex e-science or e-business domains. Particularly, semantics have been proposed as a key to automatically solving the discovery and composition problem. However, most of semantic composition approaches still remain at a stage of low efficiency because of the performance issues brought by the involved ontology reasoning and manual processing. To address this problem, in this paper, we present a QSQL-based service composition algorithm towards a fully-automated service composition. QSQL (Quick Service Query List) is an efficient service query index list which can achieve about the same semantic service discovery effects as other existing semantic composition methods, but with much less reasoning. With our proposed QSQL-based service composition algorithm, composition plans can be created to meet a user&amp;#39;s query in an automatic, efficient and semantic manner. In particular, with our algorithm, most existing composition plans in QSQL can be founded and ranked by exploiting a weighted Petri net representation; which will facilitate the execution verification. The final experiment is conducted to further demonstrate the feasibility of our proposed composition approach and its efficiency. <div></div><div></div>]]></description>
<pubDate>11/19/2008 22:54</pubDate>
<author><![CDATA[Kaijun Ren, Xiao Liu,Jinjun Chen,Nong Xiao,Junqiang Song,Weimin Zhang]]></author></item>
<item><title><![CDATA[A User-Steering Exploratory Service Composition Approach]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1727</link>
<description><![CDATA[Service orchestration logics can be difficult to be totally pre-fabricated when facing uncertain requirements. It is sometimes indispensable to get end users involved. However, there are some requirements: 1)Allow users to express their desired goals incrementally. 2)Allow users to specify key trajectory constraints. 3)Provide intelligent assistance to users in the composition. Intuitively we propose a usersteering explorative service composition approach that can support extended goals. It gives users more control and facilitates incremental development by suggesting candidate paths. During the generation of candidate paths, we use heuristics to find better plan paths, then guide users to gradually progress towards the goal. The proposed approach is verified in a typical bioinformatics scenario. The preliminary experiment results show that the approach can improve the efficiency and timelyness of service composition.<div></div><div></div>]]></description>
<pubDate>11/19/2008 22:57</pubDate>
<author><![CDATA[Shuying Yan,Yanbo Han,Jing Wang,Chen Liu,Guiling Wang]]></author></item>
<item><title><![CDATA[Leveraging Service Composition Relationship to Improve CPU Demand Estimation in SOA Environments]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1728</link>
<description><![CDATA[Service Oriented Architecture (SOA) helps dynamically construct composite services out of a set of low-level atomic services to satisfy customer requirements. For the purpose of capacity planning and resource provisioning, it is important to understand these services&amp;#39; demand for system resources, e.g., CPU. In this paper, we propose a blackbox method for estimating CPU demand of service requests based on linear regression between the observed request throughput and resource utilization level. A key advantage of our method is that its input data (i.e., request-processing throughput and resource utilization) can be easily obtained without intrusive software instrumentation. Moreover, we observe that, in an SOA environment, the service composition relationship (i.e., how low-level atomic services are connected into a composite service) is either known in advance or can be discovered through various means. We leverage this composition relationship to further improve the quality of CPU demand estimation. By analyzing the dependency between a composite service and its constituent low-level atomic services using linear algebra, our method can eliminate the collinear problem (e.g., atomic servicesX and Y are always invoked together) introduced by the service composition relationship. Moreover, our method can further reduce the number of unknown variables in the linear regression problem, and hence reduce the time duration needed to collect input data. In a dynamic SOA environment, this translates into faster response to changing workloads and more accurate estimation. We demonstrate these advantages of our method over a baseline method through extensive evaluation. <div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0036/SCC2008-0036.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\SCC2008-0036.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>1/15/2009 03:36</pubDate>
<author><![CDATA[Chun Zhang,Rong N. Chang,Chang-Shing Perng,Edward So,Chunqiang Tang,Tao Tao]]></author></item>
<item><title><![CDATA[Dynamic Support for BPEL Process Instance Adaptation]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1729</link>
<description><![CDATA[Rapidly changing market conditions and IT systems are forcing companies to adapt their business processes more dynamically than in the past. Most current commercial BPMS products lack the full capability to support changing processes. To address this challenge, we discuss three aspects of dynamic adaptation in a BPM system: model-level, instance-level, and runtime environment changes. We focus on analyzing the patterns of the instance-level navigation changes, including the preconditions, actions and consequences of each change. Based on this analysis, we propose a system design for the runtime environment to support dynamic instancelevel changes. We have implemented a prototype of such a system with the motivating scenarios to demonstrate the usefulness of our proposal. <div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0037/SCC2008-0037.html" target="_blank"><strong>>>> 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\PDF\SCC2008-0037.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\SCC2008-0037.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>12/24/2008 20:29</pubDate>
<author><![CDATA[Ru Fang,Zhi Le Zou,Corina Stratan,Liana Fong,David Marston,Linh Lam,David Frank]]></author></item>
<item><title><![CDATA[Service-Oriented Architecture for VIEW: a Visual ScientificWorkflow Management System]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1730</link>
<description><![CDATA[Scientific workflows have recently emerged as a new paradigm for scientists to formalize and structure complex and distributed scientific processes to enable and accelerate many scientific discoveries. In contrast to business workflows, which are typically controlflow oriented, scientific workflows tend to be dataflow oriented, introducing a new set of requirements for system development. These requirements demand a new architectural design for scientific workflow management systems (SWFMSs). Although several SWFMSs have been developed that provide much experience for future research and development, a study from an architectural perspective is still missing. The main contributions of this paper are: i) based on a comprehensive survey of the literature and identification of key requirements for SWFMSs, we propose the first reference architecture for SWFMSs, ii) in compliance with the reference architecture, we further propose a service-oriented architecture for VIEW (a VIsual sciEntificWorkflow management system), iii) we implement VIEW to validate the feasibility of the proposed architectures, and iv) we present two case studies to showcase the applications of our VIEW system.<div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\PDF\SCC2008-0038.pdf.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>11/19/2008 23:09</pubDate>
<author><![CDATA[Cui Lin,Shiyong Lu,Zhaoqiang Lai,Artem Chebotko,Xubo Fei,Jing Hua,Farshad Fotouhi]]></author></item>
<item><title><![CDATA[A Reflective Framework to Improve the Adaptability of BPEL-based Web Service Composition]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1731</link>
<description><![CDATA[Web services composition is receiving significant amount of interest as an important strategy to allow enterprise collaboration. Current web services composition solutions are rather restricted and inflexible as they are based on pre-defined models of the process environment. These solutions have assumed that the information in the models and consequently the compositions remain static and unchanged throughout the life cycle of the web services composition. However, web services may run in a highly dynamic environment. Therefore, a mechanism is required to support web services composition in dynamic and flexible process environment. The reflective framework presented here aims to improve the adaptability of BPEL-based web service composition. A meta-model was defined to build the self-representation of the web services composition. The meta-model will be modified to adapt to the changing environment, and then, the reflection mechanism utilized in the framework will adjust the web services composition automatically. To ensure the correctness of dynamic adaptation, a set of constraints and a verification approach are proposed. A prototype adaptive service composition environment has been developing to implement our reflective framework and demonstrate its effectiveness on providing adaptive web services composition. In summary, it is stated that the reflective framework provides a suitable solution to the adaptive service composition and reliable control flow and data flow correctness.<div></div><div></div>]]></description>
<pubDate>11/19/2008 23:13</pubDate>
<author><![CDATA[Yanlong Zhai,Hongyi Su,Shouyi Zhan]]></author></item>
<item><title><![CDATA[Formalising Message Exchange Patterns using BPELlight]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1733</link>
<description><![CDATA[In a message-driven SOA, message exchange patterns (MEPs) define a reusable notion of conversational contracts between a service consumer and a service provider from the provider&amp;#39;s point of view. They enable a common understanding regarding a message flow between both parties. In contrast to version 1.1 of the Web Service Description Language (WSDL) the current version 2.0 has introduced a template for defining such patterns that allows to define and reference patterns beyond the standard input/output ones defined in the specification. Although reasonable, this approach brings several disadvantages which we point out in this paper. Since WSDL 2.0 MEPs and WS-BPEL processes describe interaction behaviour from the same perspective BPEL makes a perfect candidate as a language for formalising MEPs, especially because it provides a powerful mechanism for describing control flow and correlation of related messages. In this work we propose a way to formalising MEPs using a WSDL-less BPEL dialect called BPELlight. We introduce a new abstract BPEL profile for defining reusable and machine-readable MEPs that is capable of expressing arbitrary message exchanges. With this approach we pave the way for more flexible interaction styles and reduce the impedance mismatch between imperative programming and message orientation. <div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0040/SCC2008-0040.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\PDF\SCC2008-0040.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\SCC2008-0040.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>2/02/2009 03:19</pubDate>
<author><![CDATA[Tammo van Lessen,Jörg Nitzsche,Frank Leymann]]></author></item>
<item><title><![CDATA[Composing Web Services through Automatic Reformulation of Service Specifications]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1734</link>
<description><![CDATA[Typical approaches to service composition seek to realize a goal service specification, described using a labeled transition system (LTS) provided by a service developer, by constructing a structurally equivalent LTS using a set of available component services (also described using LTSs) that match the input and output requirements of the transitions. As such, existing composition approaches fail to realize the goal LTS whenever available component service LTSs cannot be used to &amp;quot;mimic&amp;quot; the structure of the goal LTS. This failure requires that the service developer formulates an alternate goal LTS and re-iterates the composition step. However, the process of manual reformulation of the goal LTS is both laborious and error prone. In this setting, we describe an efficient data structure and algorithms for analyzing data and control flow dependencies implicit in a user-supplied goal LTS specification to automatically generate alternate LTS specifications that capture the same overall functionality with respect to the data and control dependencies, and determine whether any of the alternatives can lead to a feasible composition. The result is a significant reduction in the need for the tedious manual intervention in reformulating LTS specifications of the goal service. <div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0041/SCC2008-0041.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\SCC2008-0041.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>1/15/2009 03:54</pubDate>
<author><![CDATA[Jyotishman Pathak,Samik Basu,Vasant Honavar]]></author></item>
<item><title><![CDATA[A Middleware Architecture for Enhancing Web Services Infrastructure for Distributed Coordination of Workflows]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1736</link>
<description><![CDATA[This paper discusses a layered workflow software architecture for distributed coordination of workflows over web services and proposes fundamental enhancements to the web services infrastructure that facilitate the layered workflow software architecture. We verify our layered approach using a detailed simulation and a proof-of-concept prototype implementation. Our proposed architecture for Web Service Coordination Management Middleware (WSCMM) is a simple but powerful enhancement to the web service infrastructure enabling the services to locally manage their dependencies and to handle messages resulting from multiple workflows. We have carried out a detailed simulation to identify key components of our middleware architecture. We also compare and contrast our architecture with the current web service technologies. Our experiments demonstrate that we can develop both centralized and distributed workflows over the architecturally enhanced web services with relative simplicity. In addition, our lightweight coordination components with footprint no larger than 150 KB allow these workflows to be executed even on a handheld.<div></div><div></div>]]></description>
<pubDate>11/20/2008 01:05</pubDate>
<author><![CDATA[Janaka Balasooriya,Sushil K. Prasad,Shamkant B. Navathe]]></author></item>
<item><title><![CDATA[A Risk Reducation Framework for Dynamic Workflows]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1737</link>
<description><![CDATA[Workflows tend to fail in real-world scenarios due to the uncertain/unreliable sensory information which sometimes needs to be updated during the execution of workflows. In a logic based framework, these dynamic predicates that can be updated are called non-monotonic predicates (NMPs). In this paper, we focus on reducing the risk of a given workflow due to the NMPs in that workflow. The main idea is to synthesize a backup workflow by augmenting the main workflow without introducing new NMPs. The backup workflow is generated by using expected values of NMPs if necessary instead of given values. The expected values are calculated from the execution history or provided by a domain expert. It is argued that total risk reduces to the square root of the main workflow itself. <div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0043/SCC2008-0043.html" target="_blank"><strong>>>> 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\PDF\SCC2008-0043.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\SCC2008-0043.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>12/24/2008 20:30</pubDate>
<author><![CDATA[Prabhdeep Singh,Fatih Gelgi,Hasan Davulcu,Stephen S. Yau,Supratik Mukhopadhyay]]></author></item>
<item><title><![CDATA[A Folksonomy-Based Model of Web Services for Discovery and Automatic CompositionComposition]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1738</link>
<description><![CDATA[In this paper, we propose a novel way of modeling web services using folksonomies. The key advantage of our model is that it allows a large number of users to participate, easily, in annotating services with tags. This is in contrast to more expressive, logic based models of services, such as Semantic Web Service models, which require significant expertise for annotation and maintenance. Our folksonomy-based model allows associating semantic constraints on the input and output messages of web service operations using tags obtained from a folksonomy. We show how the model can be used for discovery and composition of services. We also describe a planner that uses this model to compose services and create workflows, automatically. We present performance results for the planner and our experiences in using this model in a sample real-world domain. <div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0044/SCC2008-0044.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\PDF\SCC2008-0044.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\SCC2008-0044.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>1/08/2009 01:50</pubDate>
<author><![CDATA[Eric Bouillet,Mark Feblowitz,Hanhua Feng,Zhen Liu,Anand Ranganathan,Anton Riabov]]></author></item>
<item><title><![CDATA[An incremental graph-based approach to Automatic Service Composition]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1739</link>
<description><![CDATA[In the Service Oriented Architecture paradigm services are self-contained software units of functionality. Several services can be composed to assemble a composite service that provides an overall functionality. This process is called Service Composition. The automation of the service composition process aims at decreasing the human intervention during the service discovery, matching, ranking, filtering and reasoning about the resulting composition candidates. The paper presents an innovative approach to automatic service composition. The discovery and matchmaking is based on semantic annotations of service properties, e.g. their inputs, outputs and goals. The approach uses a graph-based search algorithm to determine all possible composition candidates and applies certain measures to rank them. Filtering and reasoning is accomplished by validating the composition candidates using goal-based expressions. <div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0045/SCC2008-0045.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\PDF\SCC2008-0045.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\SCC2008-0045.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>1/08/2009 01:54</pubDate>
<author><![CDATA[Mazen Malek Shiaa,Jan Ove Fladmark,Benoit Thiell]]></author></item>
<item><title><![CDATA[Byzantine Fault Tolerant Coordination for Web Services Business Activities]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1740</link>
<description><![CDATA[In this paper, we present a comprehensive study on the threats towards the coordination services for Web services business activities and explore the most optimal solution to mitigate such threats. A careful analysis of the state model of the coordination services reveals that it is sufficient to use a lightweight Byzantine fault tolerance algorithm that avoids performing expensive total ordering of all request messages. The algorithm and the associated mechanisms have been incorporated into an open-source framework implementing the standard Web services business activity specification and an extension protocol that enables the separation of the coordination tasks from the business logic. The performance evaluation results obtained using the working prototype confirm the optimality of our solution. <div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0046/SCC2008-0046.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\PDF\SCC2008-0046.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\SCC2008-0046.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>1/15/2009 04:05</pubDate>
<author><![CDATA[Wenbing Zhao,Honglei Zhang]]></author></item>
<item><title><![CDATA[Towards a SLA-based Approach to Handle Service Disruptions]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1741</link>
<description><![CDATA[Service-orientation enables cooperation between multiple organizations and has become a solution of choice to tackle the complexity of ubiquitous computing. The very nature of ubiquitous applications implies a need for dynamic solutions. Service oriented computing provides support for these dynamic applications. However, current solutions overlook important aspects, particularly when dynamically substituting services. Some applications may be mission-critical and therefore the disruption of a particular service could be harmful. Other applications may tolerate the disappearance of a service if the service returns within a predefined amount of time. Hence, guarantees regarding availability of services that compose an application are required. In this paper we propose to take into account service disruptions through service level agreements for dynamic service-oriented applications. Keywords. Dynamic SOC, service disruption, SLA, mission critical, OSGi. <div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0047/SCC2008-0047.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\PDF\SCC2008-0047.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\SCC2008-0047.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>1/15/2009 20:18</pubDate>
<author><![CDATA[Lionel Touseau,Didier Donsez,Walter Rudametkin]]></author></item>
<item><title><![CDATA[Making BPEL Flexible – Adapting in the Context of Coordination Constraints Using WS-BPEL]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1742</link>
<description><![CDATA[While WS-BPEL is emerging as the prominent language for modeling executable business processes, it provides limited support for designing flexible processes. An important need of adaptive processes is for concurrent activities in the process to respect coordination constraints. These require that concurrent activities coordinate their behaviors in response to events otherwise the process may become inconsistent. We show how the constraints that necessitate coordination may be represented in WS-BPEL, and use generalized adaptation and constraint enforcement models to provide a way to transform the traditional BPEL process to an adaptive one. The final outcome is an executable WSBPEL process without extensions capable of executing on standard BPEL implementations and able to adapt to events while respecting coordination constraints. <div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0048/SCC2008-0048.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\PDF\SCC2008-0048.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\SCC2008-0048.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>1/15/2009 20:23</pubDate>
<author><![CDATA[Yunzhou Wu,Prashant Doshi]]></author></item>
<item><title><![CDATA[Optimal Resource Action Planning Analytics for Services Delivery Using Hiring Contracting & Cross-Training of Various Skills]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1743</link>
<description><![CDATA[We address the problem of optimal resource action planning, which is faced by firms in the services business in the context of planning delivery of services with an expected demand outlook for various skills. Firms have the option of cross-training a chosen number of resourceunits from a primary skill type into secondary skills, tertiary skills, and so on. They have the option of further hiring and increasing the system availability of any chosen skill type. They also have the option of contracting out a required amount of any chosen skill type. We address the problem of identifying the optimal set of planned resource control actions, in terms of both the timing and extent of hiring, cross-training, and contracting combination, so that they are well positioned to meet the actual demand. We present a mathematical model that can be described in terms of a constrained network flow and map it to a mixed integer linear programming formulation. The model considers practical constraints such as minimum residence time that a resource unit needs to spend in a skill-type into which it gets cross-trained or hired, minimum acceptable contracting duration for a contracted skill type, first order and higher orders of cross-training for a skill type, with lead-times, logical business rules associated with cross-training transfer sequences, as well as firm-specific targets on service levels and resource utilization, in determining the optimal resource action plan. <div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0049/SCC2008-0049.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\PDF\SCC2008-0049.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\SCC2008-0049.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>1/20/2009 21:47</pubDate>
<author><![CDATA[Dharmashankar Subramanian,Lianjun An]]></author></item>
<item><title><![CDATA[A 3-level e-Business Registry Meta Model]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1744</link>
<description><![CDATA[Business partners willing to do business electronically with each other must reach an agreement (1) on the economic level, (2) on the inter-organizational process choreography, and (3) on the services implementing the choreography. In order to search for a potential business partner, one will first look for a partner who offers a required service on the economic level and who supports a complementary role in a choreography, before binding to its IT services. Inasmuch, a registry for inter-organizational systems should cover all three levels and maintain the dependencies between them. In this paper we set up on well accepted approaches on the different levels, i.e. (1) the e3value ontology, (2) the UN/CEFACT modeling methodology (UMM), and (3) the business process execution language (BPEL). We specify a registry meta model on top of ebRIM registering the artifacts on the different levels and defining their inter-dependencies. <div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0050/SCC2008-0050.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\PDF\SCC2008-0050.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\SCC2008-0050.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>1/20/2009 21:53</pubDate>
<author><![CDATA[Christian Huemer,Philipp Liegl,Rainer Schuster,Marco Zapletal]]></author></item>
<item><title><![CDATA[Scaling Location-based Services with Dynamically Composed Location Index]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1745</link>
<description><![CDATA[Performance and scalability of location-based services (LBSs) are crucial to the wide deployment of mobile enterprise systems. Location queries are a fundamental capability of LBSs. Conventional approaches to location query processing have been centered on an object-centric architecture where static and moving objects are processed under a unified framework through an object index or query index. In this paper, we identify and exploit the performance benefit of a location-centric framework by promoting a clean separation of location query processing over static objects from query processing over moving objects. We show the performance benefits of treating locations as first class citizens instead of objects. Concretely, we develop a federated location indexing scheme for processing location queries over static objects and maintain a grid-based object index for processing queries over moving objects. Our experimental results demonstrate that the location-centric framework enables highly efficient processing of different types of location queries in a mobile environment, prevails under all types of query workloads compared to the object-centric approaches, and in some scenarios it requires as low as only 6% of the IOs required by a corresponding object index for query evaluation. <div></div><div></div>]]></description>
<pubDate>11/20/2008 01:29</pubDate>
<author><![CDATA[Bhuvan Bamba,Sangeetha Seshadri,Ling Liu]]></author></item>
<item><title><![CDATA[Service Functionality Indexing and Matching for Service-Based Systems]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1746</link>
<description><![CDATA[In service-based systems, one of the most basic re- quirements for service matching is to &amp;macr;nd services with functionalities similar to the expected functionality of a given service discovery request. In this paper, a functionality-compatibility-based service indexing and matching approach is presented. This approach indexes a set of services using functionality-compatibility de- &amp;macr;ned on their parameters and conditions, and &amp;macr;lters the indexed services to identify those with compatible func- tionalities to the service discovery request e&amp;plusmn;ciently. This approach is evaluated to show the e&amp;reg;ectiveness and e&amp;plusmn;ciency. <div></div><div></div>]]></description>
<pubDate>11/20/2008 01:33</pubDate>
<author><![CDATA[Stephen S. Yau,Junwei Liu]]></author></item>
<item><title><![CDATA[A Structured Service-Centric Approach for the Integration of Command and Control Components]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1747</link>
<description><![CDATA[Service-oriented architecture (SOA) ideally provides reliable access to a scalable, agile, and affordable computing environment. In the tactical military context its ultimate goals are greater situational awareness and enhanced operational capability through the efficient sharing of information. Component systems, such as networks and data sources, can provide many of the necessary services to achieve these goals. A structured approach, however, is needed to realize this within command and control systems. This paper describes a hierarchical approach to information integration, called integration layers, and the conceptual foundations for such a structure, using chemical and biological warfare information-system services as examples. <div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0053/SCC2008-0053.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\PDF\SCC2008-0053.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\SCC2008-0053.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>12/29/2008 20:17</pubDate>
<author><![CDATA[Dwight R. Wilcox,Marion G. Ceruti]]></author></item>
<item><title><![CDATA[A Customer-Centric Privacy Protection Framework for Mobile Service-Oriented Architectures]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1748</link>
<description><![CDATA[Mobile companions such as smartphones and PDAs carry a lot of sensitive data about their owners. With new services aimed at providing more targeted information retrieval through increased interactions with these devices, privacy concerns of individuals must be addressed. Existing mobile service computing solutions give users little control over the release of this information. In this paper, we present a privacy-aware information brokerage framework called MUPPET that incorporates three novel techniques to give users control over the release of their data. First, it introduces Operation-focused Access Control, a purposebased access control model that supports flexible and finegrain policies using typed operation labels. Second, MUPPET includes a Purpose Detector that has a number of techniques to detect the active purpose in a pervasive environment. Third, our system allows Reward-Driven Information Exchange, a protocol for explicit communication and negotiation of justifications and rewards supporting tunable privacy policies based on ongoing evaluation of the information exchange. To validate our design, the MUPPET prototype has been integrated with a personalized coupon offering application for two different service providers in an experimental retail kiosk setting. <div></div><div></div>]]></description>
<pubDate>11/20/2008 01:52</pubDate>
<author><![CDATA[Winnie Cheng,Jun Li,Keith Moore,Alan H. Karp]]></author></item>
<item><title><![CDATA[Rule-based XML Mediation for Data Validation and Privacy Anonymization]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1749</link>
<description><![CDATA[XML mediation for data validation and privacy anonymization of very large complicated XML messages defined in some industry-specific specifications such as HL7 is becoming increasingly important in SOA because a lot of applications depend on various kinds of hardcoded data validation and privacy anonymization functions, which makes it difficult to keep consistency of the functions among the applications in SOA when the schema of the XML messages in the specifications is updated. This paper proposes a uniform rule-based approach to realize the functions as an XML mediation separated from the applications, which makes it easy to maintain consistency of the functions even when they are updated in accord with the changes to the specifications. Therefore, application developers can readily utilize the mediation with many applications in SOA without additional modification to the applications. Our approach allows the developers to define a set of rules that consist of two components: 1) constraint conditions in a conceptual data notation in the XML message, and 2) actions performed only when the conditions are satisfied. In order to make the rules independent from both the implementation-specific data representation and the industry-specific knowledge, we automatically transform the rules into the implementation-specific data representation using two more factors; one is the data mappings from the data notation in the rules to the concrete data representation in the implementation, and the other is the implied data relationships hidden in the rules. It is very important to take into consideration a general way to import the implied knowledge because it often depends on the industry-specific data structure and it is usually given outside of the mediation system.<div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\PDF\SCC2008-0056.pdf.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>11/20/2008 01:56</pubDate>
<author><![CDATA[Masayoshi Teraguchi,Issei Yoshida,Naohiko Uramoto]]></author></item>
<item><title><![CDATA[A Policy Distribution Service for Proactive Fraud Management over Financial Data Streams]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1750</link>
<description><![CDATA[With the ever-increasing number of unmanned customer interaction channels (e.g. internet and mobile banking), financial platforms are becoming subject to an expanding collection of system attacks due to their unique potential for large scale monetary theft. Significant challenge therefore remains in keeping fraud policy repositories current to prevent financial loss and customer inconvenience, due to the rapid rate at which fraudsters re-engineer their methods and deploy new system attacks. Accordingly, fraud policy development based upon mining of an institution&amp;#39;s transactional data provides only an isolated view of industry behaviour with no support for the exchange of fraud policy data with other institutions that are likely to experience similar behavioural attacks as fraudsters horizontally permeate their efforts through analogous sector organisations. This paper proposes a Policy Distribution Service for the automated collection, analysis and distribution of emerging fraud policy definitions through a collaborative policy sharing model. A key aspect of the service is the creation of an industry wide policy knowledge base within a centralised mediator component and distribution of policies using a common modelling formalism which maybe mapped into multiple disparate target fraud management implementations. <div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0056/SCC2008-0056.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\SCC2008-0056.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>1/09/2009 01:33</pubDate>
<author><![CDATA[Michael Edge,Pedro Sampaio,Oliver Philpott,Mohammed Choudhary]]></author></item>
<item><title><![CDATA[A Two Stage Heuristic Algorithm for Solving the Server Consolidation Problem with Item-Item and Bin-Item Incompatibility Constraints]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1751</link>
<description><![CDATA[The problem of server sprawl is common in data centers of most business organizations. It is most often the case that an application is run on dedicated servers. This leads to situations where organizations end up having numerous servers that remain under-utilized most of the times. The servers, in such scenarios, are allocated more resources (disk, cpu and memory) than are justified by their present workloads. Consolidating multiple underutilized servers into a fewer number of non-dedicated servers that can host multiple applications is an effective tool for businesses to enhance their returns on investment. The problem can be modeled as a variant of the bin packing problem where items to be packed are the servers being consolidated and bins are the target servers. The sizes of the servers/items being packed are resource utilizations which are obtained from the performance trace data. Here we describe a novel two stage heuristic algorithm for taking care of the &amp;quot;bin-item&amp;quot; incompatibility constraints that are inherent in any server consolidation problem. The model is able to solve extremely large instances of problem in a reasonable amount of time. <div></div><div></div>]]></description>
<pubDate>11/20/2008 02:01</pubDate>
<author><![CDATA[Rohit Gupta,Sumit Kumar Bose,Srikanth Sundarrajan,Manogna Chebiyam,Anirban Chakrabarti]]></author></item>
<item><title><![CDATA[Policy-Based Automation to Improve Solution Engineering in IT Services]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1752</link>
<description><![CDATA[IT outsourcing service providers are increasingly being challenged to reduce costs while improving the quality of service implementation and delivery. A key contributor to those goals can be an improved methodology for services solution engineering - which involves analysis of the client&amp;#39;s requirements and environment, mapping the information to the capabilities of the service provider, documenting the design and implementation of each service, and defining transformations of the customer&amp;#39;s environment to the target IT infrastructure defined by the overall design that facilitates more efficient service delivery. One such improved methodology leverages reuse, in the form of a taxonomy of standardized service offerings and a repository of standardized service designs they can be mapped to. In this paper, we describe a prototype system that provides automation for such a methodology by encoding design policies that are used to assist the services solution architect gather relevant information from the customer and cross check design decisions. The approach demonstrates how the notion of computer-aided design can be applied to the world of IT services and introduced in an incremental manner. This paper presents the system architecture, discusses the sources and models of knowledge, and illustrates how this knowledge can be used with specific examples from the services field. <div></div><div></div>]]></description>
<pubDate>11/20/2008 02:04</pubDate>
<author><![CDATA[Ronnie Sarkar,Murthy Devarakonda,Axel Tanner]]></author></item>
<item><title><![CDATA[A Fault Tolerance Approach for Enterprise Applications]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1753</link>
<description><![CDATA[Service Oriented Architectures (SOAs) have emerged as a preferred solution to tackle the complexity of large-scale, complex, distributed, and heterogeneous systems. Key to successful operation of these systems is their reliability and availability. In this paper, we propose an approach to creating fault tolerant SOA implementations based on an architectural pattern called Rich Services. Our approach is model-driven, focuses on interaction specifications as the means for defining services and managing their failures, and is technology independent. We leverage an Enterprise Service Bus (ESB) framework to implement a system based on the fault tolerant Rich Service pattern. We evaluate our approach by measuring availability and reliability of an experimental system in the e-business domain. <div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0059/SCC2008-0059.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\PDF\SCC2008-0059.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\SCC2008-0059.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>12/29/2008 20:16</pubDate>
<author><![CDATA[Vina Ermagan,Ingolf Krüger,Massimiliano Menarini]]></author></item>
<item><title><![CDATA[External Business Environment Analysis with RSS/Web]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1754</link>
<description><![CDATA[<p>The purpose of this article is to introduce the system that analyzes external business environment utilizing RSS or web news. The proposed system will visualize positioning of companies in an industry. The positioning analysis shows the company priority issues in changing market. Conventionally, such information is collected and regenerated manually by analysts. Our technique retrieves RSS or web news, applies characteristic analysis for each sentence in the content, evaluates the sentences with business rules, and performs macro analysis based on the Five Forces analysis. This technique will grasp competitive powers of companies in the specific industry and will discover the differentiation factors of the company. The authors apply the proposed system to the optical network industry, and the system revealed that rivalry among the existing competitors was the most influential force in the industry. </p><div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0060/SCC2008-0060.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\PDF\SCC2008-0060.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\SCC2008-0060.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>12/29/2008 20:14</pubDate>
<author><![CDATA[Shigeaki Matsumoto,Takatoshi Kitano,Shigeru Hosono]]></author></item>
<item><title><![CDATA[Business Transformation Workbench:A Practitioner’s Tool for Business Transformation]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1755</link>
<description><![CDATA[Business transformation is a key management initiative that attempts to align people, process and technology of an enterprise more closely with its business strategy and vision. It is an essential part of the competitive business cycle. Existing consulting methods and tools do not address issues such as scalability of methodology, knowledge management, asset reuse, and governance well, to name a few. This paper presents Business Transformation Workbench, a practitioner&amp;#39;s tool for business transformation addressing these problems. It implements a methodical approach that was devised to analyze business transformation opportunities and make business cases for transformation initiatives and thereby provides decision-support to the consultants. It provides an intuitive way to evaluate and understand various opportunities in staff and IT consolidation and process standardization. It embodies structured analytical models, both qualitative and quantitative, to enhance the consultants&amp;#39; practices. BT Workbench has been instantiated with data from finance management domain and applied to address a client situation as a case study. An alpha testing of the tool was conducted with about dozen practitioners. 90% of the consultants who tested the BT Workbench tool felt that the tool would help them do a better job during a client engagement. The tool is currently being piloted with customer engagements in a large IT consulting organization. <div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0061/SCC2008-0061.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\PDF\SCC2008-0061.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\SCC2008-0061.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>12/29/2008 20:13</pubDate>
<author><![CDATA[Juhnyoung Lee,Rama Akkiraju,Chun Hua Tian,Shun Jiang,Sivaprashanth Danturthy,Ponn Sundhararajan,Carl Nordman,Rakesh Mohan,Hitansh Singala,Wei Ding]]></author></item>
<item><title><![CDATA[Built-to-Order Service Engineering for Enterprise IT Discovery]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1756</link>
<description><![CDATA[Enterprise IT environments are complex: business applications rely on distributed middleware running on diverse hardware with components depending on each other in many unexpected ways. Discovery of applications&amp;#39; dependency on IT is a critical step in managing application and IT infrastructure together. Many tools and practices have emerged to discover and report IT assets and applications&amp;#39; dependency on the IT assets. However, our experience in the field shows that there are significant challenges in effectively deploying the tools. There is a critical need to research and develop flexible processes, methods, and practices, and architecture-level support for them in the tools to enable successful discovery using a &amp;quot;built-to-order&amp;quot; approach. In this paper we discuss our experiences with an advanced application-data relationship discovery tools in large scale enterprise environments and based on these experiences we identify three main challenges of effective discovery. They are: deployment process and related security issues; unavailability of software and administrationrelated information; and tool integration. To address these challenges, here we demonstrate a holistic approach that includes flexible processes, methods, and practices in the tools for achieving the necessary built-to order capability. <div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0062/SCC2008-0062.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\PDF\SCC2008-0062.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\SCC2008-0062.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>2/01/2009 21:16</pubDate>
<author><![CDATA[Nikolai Joukov,Murthy V Devarakonda,Kostas Magoutis,Norbert Vogl]]></author></item>
<item><title><![CDATA[A Framework for Service Interoperability Analysis using Enterprise Architecture Models]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1757</link>
<description><![CDATA[Good IT decision making is a highly desirable property that can be furthered by the use of enterprise architecture, an approach to IT management using diagrammatic models. In order to support decision making, the models must be amenable to various kinds of analysis. It is desirable that the models support the sought after analysis effectively since creation of enterprise architecture models often is a demanding task. This paper suggests a framework for enterprise service interoperability analysis and a metamodel containing the information needed to perform the analysis. The paper also illustrates the use of the framework and metamodel in a fictional example. <div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0063/SCC2008-0063.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\PDF\SCC2008-0063.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\SCC2008-0063.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>1/20/2009 21:59</pubDate>
<author><![CDATA[Johan Ullberg,Robert Lagerström,Pontus Johnson]]></author></item>
<item><title><![CDATA[A Context Model for B2B Collaborations]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1758</link>
<description><![CDATA[Context-awareness (CA) has been applied in different domains, particularly in ubiquitous computing, to provide better value-added services. CA has also been used, albeit sporadically, in business related applications. This paper discusses an on-going research effort in enhancing Business-to-Business (B2B) collaborations through context awareness, specifically to support the formation of short and dynamic connectivity between partners collaborating in a supply chain. Through an understanding of context awareness and how companies evaluate and select prospective suppliers, a B2B Context Model is proposed to discover and match suitable partners. The prospective partners are represented as services in a Service-Oriented Architecture (SOA) paradigm. <div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\PDF\SCC2008-0064.pdf.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>11/20/2008 02:26</pubDate>
<author><![CDATA[P. S. Tan,A.E.S. Goh,S.S.G. Lee]]></author></item>
<item><title><![CDATA[Three Factors to Sustainable Service System Excellence: A Case Study of Service Systems]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1759</link>
<description><![CDATA[Prior service science work defines a service system as dynamic configuration of people, technology, organizations, and shared information from both service providers and clients that co-creates value [1]. Although such an abstraction is important, it does not directly address core issues we face in today&amp;#39;s service industry, such as sustainable service excellence. This paper expands such prior service science work by analyzing how service systems evolve over time and what factors are critical to sustain service excellence. The paper identified and analyzed three factors attributing to the service system health throughout its lifecycle phases: the instilling of the value co-creation concept in the service system, the balancing of innovation and commoditization dynamics, and the configuration of core resources in the service system, i.e., people, technology, organization, and shared information. The analysis is derived from many real-world case studies in the information analytics service area. Key recommendations and lessons learned are presented as well. <div></div><div></div>]]></description>
<pubDate>11/20/2008 02:28</pubDate>
<author><![CDATA[Ying Chen,Ana Lelescu,Jim Spohrer]]></author></item>
<item><title><![CDATA[Constructing Service Oriented Dynamic Virtual Enterprises in Chinese Apparel Industry]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1760</link>
<description><![CDATA[Service oriented computing technologies facilitate design and implementation of virtual enterprises. By keeping the systems of business partners as autonomous and lose coupled service components, the service oriented paradigm supports flexible integration of heterogeneous systems or components within virtual enterprises. Taking a real world project in Chinese apparel industry as an example, this paper firstly analyzed the challenges in virtual enterprise construction. Then it presented a service oriented framework that supports IT-enabled heterogeneous resource sharing and dynamic virtual enterprise construction. According to the deployments in apparel companies in China, we conclude that the framework presented in this paper facilitates the construction of dynamic virtual enterprises with process services, participant management and message based interorganizational process collaborations. <div></div><div></div>]]></description>
<pubDate>11/20/2008 02:31</pubDate>
<author><![CDATA[Gang Li,Ying Liang]]></author></item>
<item><title><![CDATA[Study of Execution Centric Payment Issues in E-contracts]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1761</link>
<description><![CDATA[A contract is a legal agreement involving parties, activities, clauses and payments. The activities are to be executed by the parties satisfying the clauses, in accordance with the associated terms of payment. An econtract is a contract modeled, specified, executed, controlled and monitored by a software system. In this paper, we study payment issues in e-contracts. Payments are meant for, and so are closely related to, the execution of activities specified in the contract. We consider (i) the payment amount for the execution of an activity, (ii) the time of payment relative to the execution and (iii) tracking the payment against the execution of the activity. For the first two, we use an execution model that enables representing a variety of states encountered in the generally complex executions of the activities in a contract. For tracking, we use a multi-level composition model for the activities. Our study brings out various issues that need to be addressed in designing a payment monitoring system. Keywords: e-contracts, payments, transaction properties, composition graph, payment tree. <div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0067/SCC2008-0067.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\PDF\SCC2008-0067.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\SCC2008-0067.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>1/16/2009 02:42</pubDate>
<author><![CDATA[K. Vidyasankar,P. Radha Krishna,Kamalakar Karlapalem]]></author></item>
<item><title><![CDATA[Modelling Service Systems for Collaborative Innovation in the Enterprise Software Industry - The St. Gallen Media Reference Model Applied]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1762</link>
<description><![CDATA[As organizational structures shift from centralized and hierarchical structures to decentralized and loosely coupled networks, value creation and innovation processes are changing as well. Especially in the services sector, we observe a shift from closed and companyinternal innovation processes to more open and collaborative forms of innovation (e.g. via various types of communities that emerge in enterprises&amp;#39; surrounding ecosystems). Communities of co-innovation or innovation networks can be described from a service systems perspective. In this work, a modelling approach to generally describe service systems is developed leveraging the St. Gallen Media Reference Model (MRM). A specific instantiation of this model is presented that allows for modelling service systems in terms of communities of co-innovation. The model is applied for the case of co-innovation in the enterprise software ecosystem of the SAP AG. The approach fosters understanding, organizing and managing such new networks of collaborative innovation in service science. <div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0068/SCC2008-0068.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\SCC2008-0068.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>1/20/2009 22:02</pubDate>
<author><![CDATA[Till Janner,Christoph Schroth,Beat Schmid]]></author></item>
<item><title><![CDATA[Differentiating Commoditized Services in a Services Marketplace]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1763</link>
<description><![CDATA[In a services marketplace where a service is provided by multiple service providers, service offerings have to be differentiated against competitor services. Differentiation helps to sustain as well as grow market share. Strategies to differentiate service offerings have to be unintrusive - without requiring major changes to the existing service realization mechanisms. In this paper, we present a strategy for service providers to differentiate their commoditized services. We show how to identify and document differentiating aspects of a service. By unintrusively manipulating these differentiation aspects we can differentiate services from that of competition. We specify these differentiating aspects as service policies using the WS-Policy framework. <div></div><div></div>]]></description>
<pubDate>11/20/2008 02:38</pubDate>
<author><![CDATA[Harshavardhan Jegadeesan,Sundar Balasubramaniam]]></author></item>
<item><title><![CDATA[A Graphical Approach to Providing Infrastructure Recommendations for IT]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1764</link>
<description><![CDATA[We present SPIRIT, a Service for Providing Infrastructure Recommendations for Information Technology. SPIRIT allows maintenance support providers for Small-to-Medium Businesses (SMBs) to recommend solutions which are standardized (SMBs usually cannot afford customized IT solutions), flexible (accommodating as much as possible the customer&amp;#39;s existing IT environment), and cost-effective (minimizing the cost of upgrading the customer&amp;#39;s environment). SPIRIT works by first aligning the customer&amp;#39;s IT infrastructure with a &amp;quot;template&amp;quot; describing the best practices recommended by the maintenance support provider. This step is done using an efficient graph algorithm that finds the most cost-effective transformations of the customer&amp;#39;s environment that are consistent with the template. Then the aligned environment can be upgraded by choosing from a standard set of well understood, highly automated (and therefore economical) options. We show that the algorithm performs well on both real and synthetic data. <div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0070/SCC2008-0070.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\PDF\SCC2008-0070.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\SCC2008-0070.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>1/20/2009 22:04</pubDate>
<author><![CDATA[Ashwin Lall,Anca Sailer,Mark Brodie]]></author></item>
<item><title><![CDATA[Mining Top Issues from Contact Center Logs for Self Help Portals]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1765</link>
<description><![CDATA[Self help portals are increasingly popular means for enabling users to find information, resolve problems, and process transactions directly without calling contact centers. Such portals can result in faster problem resolution for users and cost savings for the contact center. However, the effectiveness of self help portals is often limited by the topicality, recency, and relevance of the knowledge (documents, etc.) that users are provided access to. In this paper, we present a system and an architecture for automatically mining the top issues - questions people are calling contact centers for - and presenting corresponding solution documents to users through self help portals. Running the top issues mining regularly (e.g. hourly, daily, etc.) ensures dynamically updated and relevant content on the portals and can greatly reduce costs at contact centers by avoiding calls. Furthermore, top issues mining can highlight the knowledge gap or the issues for which no solution documents currently exist. We describe our end to end system, present algorithms for mining, and discuss the knowledge gap that can prevent self enabling portals from realizing its potential benefits. <div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0071/SCC2008-0071.Html" target="_blank"><strong>>>> 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\PDF\SCC2008-0071.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\SCC2008-0071.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>1/08/2009 02:50</pubDate>
<author><![CDATA[Dinesh Garg,Nanda Kambhatla,Maja Vukovic,Gopal Pingali]]></author></item>
<item><title><![CDATA[A Software as a Service with Multi-tenancy Support for an Electronic Contract Management Application]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1766</link>
<description><![CDATA[In most commercial electronic contract management applications available today, different customized code base has to be developed, deployed and operated to support each tenant. Few advanced commercial electronic contract management applications use a single code base with configuration options to support multitenants. However, a separate instance of the code base still has to be deployed and operated for each tenant even in these applications. The business model of having to support a single application instance for each tenant makes an electronic contract management application and other critical business applications out of reach for most small and medium businesses (SMBs), in particular, the very small businesses (SVBs) because of its high development and maintenance cost. Recently, a new business model of a single application instance supporting multi-tenancy based on Software as a Service (SaaS) has emerged making expensive business applications more affordable for SMBs and SVBs for multi-tenancy [1]. In this paper, we present the first of a kind multitenancy SaaS electronic contract management application. We also describe several novel methods used in the metadata, security and shared services, as well as customization and tenant extensions modules to support multi-tenancy SaaS in this application. This multi-tenancy SaaS application has shown to benefit both the application service providers as well as their tenants. This new multi-tenancy SaaS model can reduce the application hosting cost and make the application more affordable to the tenants because of its capabilities in customization and scalability while continuing to support an increasing number of tenants. It furthers benefits tenants by saving their money and time with immediate access to the latest IT innovations and infrastructure improvements on a single application code base. Most end users of tenants have found their productivities increased, the contract transaction time accelerated, contractual errors reduced in using this multi-tenancy SaaS electronic contract management application as demonstrated in several ongoing IBM pilot programs serving more than ten tenants with over 3000 end users. <div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0072/SCC2008-0072.html" target="_blank"><strong>>>> 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\PDF\SCC2008-0072.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\SCC2008-0072.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>1/08/2009 02:54</pubDate>
<author><![CDATA[Thomas Kwok,Thao Nguyen,Linh Lam]]></author></item>
<item><title><![CDATA[wsrbench: An On-Line Tool for Robustness Benchmarking]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1767</link>
<description><![CDATA[Testing web services for robustness is a difficult task. In fact, existing development support tools do not provide any practical mean to assess web services robustness in the presence of erroneous inputs. Previous works proposed that web services robustness testing should be based on a set of robustness tests (i.e., invalid web services call parameters) that are applied in order to discover both programming and design errors. Web services can be classified based on the failure modes observed. In this paper we present and discuss the architecture and use of an online tool that provides an easy interface for web services robustness testing. This tool is publicly available and can be used by both web services providers (to assess the robustness of their web services code) and consumers (to select the web services that best fit their requirements). The tool is demonstrated by testing several web services available in the Internet. <div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0073/SCC2008-0073.html" target="_blank"><strong>>>> 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\PDF\SCC2008-0073.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\SCC2008-0073.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>1/16/2009 03:33</pubDate>
<author><![CDATA[Nuno Laranjeiro,Salvador Canelas,Marco Vieira]]></author></item>
<item><title><![CDATA[A Framework for Model-Based Continuous Improvement of Global IT Service Delivery Operations]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1768</link>
<description><![CDATA[In recent years, the ability to deliver IT infrastructure services from multiple geographically distributed locations has given rise to an entirely new IT services business model. In this model, called the &amp;quot;Global Delivery Model&amp;quot;, clients outsource components of their IT infrastructure operations to multiple service providers, who in turn use a combination of onsite and offsite (including offshore) resources to manage the components on behalf of their clients. Since the components of services provided can be assembled and processed at any of the delivery centers, a framework for continuous monitoring of quality and productivity of the delivery processes is essential to pinpoint and remedy potential process inefficiencies. In this paper, we describe a framework implemented by a large global service provider that uses continuous monitoring and process behavior charts to detect any potential shifts in its global IT service delivery environment. Using this framework, the service provider has already improved several of its IT delivery processes resulting in improved quality and productivity. We discuss the major components of the framework, challenges in deploying such a system for global processes whose lifecycle spans multiple delivery centers, and present examples of process improvements that resulted from deploying the framework. <div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0074/SCC2008-0074.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\PDF\SCC2008-0074.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\SCC2008-0074.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>2/12/2009 20:08</pubDate>
<author><![CDATA[Abhijit Bose,Aliza Heching,Sambit Sahu]]></author></item>
<item><title><![CDATA[WIPdroid – A Two-way Web Services and Real-time Communication Enabled Mobile Computing Platform for Distributed Services Computing]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1769</link>
<description><![CDATA[We present a mobile distributed computing platform, WIPdroid, for distributed services computing in mobile environment with real-time communication capabilities. It is based on WIP, Web Services Session Initiation Protocol, for real-time service-oriented communication over IP. It integrates the emerging mobile endpoint platform, Android, from Google&amp;#39;s initiative of Open Handset Alliance (OHA). The WIP component of WIPdroid supports web services based communication over IP. But most importantly, it transforms WIPdroid into a mobile SOA web services endpoint. Applications developed on WIPdroid can be exposed and enabled by two-way web services. This makes WIPdroid well suited for distributed computing and SOA based applications, such as communication enabled business process (CEBP) and software-as-a-service (SaaS). It also leads to a new type of dual-mode phone, with one communication mode from the binding with the physical mobile environment, e.g. GSM, CDMA, 3G, etc., and one fully web services enabled, service-oriented communication over IP mode from WIP. A prototype WIPdroid mobile computing platform is developed and tested. In order to support advance web services capabilities on mobile endpoints,, we developed an endpoint-edition of two-way web services application proxy (2SAP) which has a small memory footprint (2~3 MB) and can be hosted on a mobile endpoint/handset, e.g. smart phone and PDA. <div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0075/SCC2008-0075.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\PDF\SCC2008-0075.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\SCC2008-0075.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>1/08/2009 02:59</pubDate>
<author><![CDATA[Wu Chou,Li Li]]></author></item>
<item><title><![CDATA[Virtual Learning Services over 3D Internet: Patterns and Case Studies]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1770</link>
<description><![CDATA[Traditional concept of services focus on Web based information centric services. In this paper, we study virtual services which mean services over 3D Internet/virtual worlds. We focus on studying the learning applications as one type of killer applications of virtual services. We show that virtual learning services have rich opportunities of service innovation. Virtual services have additional dimensions beyond traditional Web services which have significant influence on both its research and industry applications. We not only give the problems of learning design in 3D virtual worlds, but also summarize patterns for virtual learning solutions and architecture of virtual learning. With several case studies, we show the applicability of those key concepts and methods in the design and development of virtual learning services.<div></div><div></div>]]></description>
<pubDate>11/20/2008 02:58</pubDate>
<author><![CDATA[Hong Cai,Bo Sun,Patty Farh,Meng Ye]]></author></item>
<item><title><![CDATA[Surrogate: A Simulation Apparatus for Continuous Integration Testing in Service Oriented Architecture]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1771</link>
<description><![CDATA[CIT (Continuous Integration Testing) has been widely studied in the testing research field in order to start some levels of integration test as early as possible. One challenge of CIT lies in how to simulate the behavior of those unavailable components. Existing methods like stud and mock fail to provide the advanced component simulation capabilities required by CIT from perspectives like diversified program artifacts, behavior transitivity, and configurability. This paper proposes a new simulation apparatus, namely surrogate, to address this problem. The surrogate generator generates platform specific code skeleton from definition of the component to be simulated. The generated code communicates with surrogate engine and returns simulated platform specific behaviors. The surrogate engine simulates component behaviors including both output and possible invocation on dependent components. Moreover, it provides platform independent interfaces and configuration model. Early implementations of surrogate generator and surrogate engine are introduced in detail. To validate the value of surrogate technology in CIT, a case study has been carried out with careful analysis. The result shows that this technology really helps identify some bugs at early stage of development.<div></div><div></div>]]></description>
<pubDate>11/20/2008 03:02</pubDate>
<author><![CDATA[He Yuan Huang,He Hui Liu,Zhong Jie Li,Jun Zhu]]></author></item>
<item><title><![CDATA[Towards Agile Service-oriented Business Systems: A Directive-oriented Pattern Analysis Approach]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1772</link>
<description><![CDATA[Volatile requirements should be managed such that changes can be introduced into the system in a quick and structured way. This paper presents Directive-oriented Pattern Analysis (DoPA), a requirements engineering approach that handles volatile requirements by managing the coupling between business intentions and service integration. The key insight is to utilise services as commodities via service choreography patterns. DoPA captures differentiating enterprise intentions as Directives, while using patterns to handle common business needs. This enables the notion of declarative configuration of services to achieve business agility. <div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0078/SCC2008-0078.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\PDF\SCC2008-0078.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\SCC2008-0078.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>3/17/2009 00:03</pubDate>
<author><![CDATA[Soo Ling Lim,Fuyuki Ishikawa,Eric Platon,Karl Cox]]></author></item>
<item><title><![CDATA[Development tool for service-oriented applications in smart homes]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1773</link>
<description><![CDATA[In this paper, we present a model-driven, domaincentric tool allowing the specification of service-oriented applications through abstract services composition. Executable applications, made of concrete services, are automatically generated and deployed. This tool can be customized with domain-specific knowledge. Our contributions in this paper are to slightly extend the tool to be used in the demanding home computing domain. An approach for modelling and implementing dynamic service composition is provided for satisfying the dynamic home environment. This work has been carried out in collaboration with Schneider Electric.<div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\PDF\SCC2008-0078.pdf.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>11/20/2008 03:10</pubDate>
<author><![CDATA[Jianqi Yu,Philippe Lalanda,Stéphanie Chollet]]></author></item>
<item><title><![CDATA[A Scenario-View Based Approach to Analyze External Behavior of Web Services for Supporting Mediated Service Interactions]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1774</link>
<description><![CDATA[Web service interactions have triggered the initiative to identify and solve mismatches from a behavioral aspect. Current approaches are limited since they mainly focus on control-flow but largely ignore data-flow. In this paper, we propose an approach to automatically generate scenarios and views for describing external behavior of Web services, i.e. the public process, considering both control-flow and data-flow. We define a scenario as a set of complete execution paths for a public process. Data dependencies are presented as a dependency graph, which is optimized into a minimal dependency graph. Then, a view is generated to describe a scenario for analysis purposes, and external behavior of a Web service is described as a finite set of views. Our approach is very useful for service modelers and users to better understand the external behavior of Web services, to identify and solve mismatches from a behavioral aspect, and thus to facilitate Web service interactions.<div></div><div></div>]]></description>
<pubDate>11/20/2008 03:12</pubDate>
<author><![CDATA[Zhangbing Zhou,Sami Bhiri,Lei Shu,Laurentiu Vasiliu,Manfred Hauswirth,Kaizhu Huang]]></author></item>
<item><title><![CDATA[Data Model Design of Strategic Analysis Services for Specific Customer Oriented Industries]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1775</link>
<description><![CDATA[Facing fast changing and more diversified customers, specific customer oriented industries&amp;#39; executives should continuously make customer oriented strategic transformation decisions faster than competitors to obtain sustained growth. However, due to higher transformation cost per facility, increased frequency of transformation efforts, and greater complexity associated with rolling out quickly across large diverse facility networks, enterprises invest heavily yet often fail to deliver the required impacts. Executives in these industries are eager to have a quantitative method and tool to help them derive more scientific strategic transformation suggestions. In this paper, we describe a general analytics and optimization solution designed to provide strategic analysis services for those specific industries to adapt to the fast changing needs. The data model design is elaborated for efficient communication and quick solution development, and an implementation case study on intelligent facility network analytics and optimization services design in retailing industry is finally presented to illustrate how the proposed data model improves the flexibility of solutions across industries.<div></div><div></div>]]></description>
<pubDate>11/20/2008 03:15</pubDate>
<author><![CDATA[Xinxin Bai, Minghua Zhu,Longjun Cai,Wenjun Yin,Jin Dong,Hairong Lv]]></author></item>
<item><title><![CDATA[Simplifying Service Deployment with Virtual Appliances]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1776</link>
<description><![CDATA[As IT services become more powerful and com- plex, service deployment gets more difficult and ex- pensive. Service deployment, the process of making a service ready for use, often includes deploying multiple, interrelated software components into het- erogeneous environments. Different technologies and tools try to address these complexities by describing the environments, abstracting the dependencies, and automating the process. Virtual Appliances, a set of virtual machines including optimized operating sys- tems, pre-built, pre-configured, ready-to-run applica- tions and embedded appliance specific components, are emerging as a breakthrough technology to solve the complexities of service deployment. Virtual appliances provide a simple, unified and easy to use interface for service deployment by encapsulating entire custom environments, and resolving the execution policy con- straints and inter-dependencies through pre-installing the software applications. The motivation of this paper is to prove virtual appliances offer a better service deployment mecha- nism. We start with an easy to understand model to describe the complexity of service deployment and in- troduce the architecture of a virtual appliance. We then analyze the deployment process of using traditional deployment mechanisms, and quantitatively and qual- itatively compare the deployment time, operations and parameters of the traditional approach with the use of virtual appliances. The results show virtual appliances offer significant advantages for service deployment by making the deployment process much simpler and easier, even for the deployment of advanced enterprise services. <div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0082/SCC2008-0082.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\PDF\SCC2008-0082.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\SCC2008-0082.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>2/03/2009 01:53</pubDate>
<author><![CDATA[Changhua Sun,Le He,Qingbo Wang,Ruth Willenborg]]></author></item>
<item><title><![CDATA[Implementing Multi-Vendor Home Network System with Vendor-Neutral Services and Dynamic Service Binding]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1777</link>
<description><![CDATA[The home network system (HNS) consists of networked household appliances, intended to provide value-added services. The conventional HNS has been built on the singlevendor system, which severely limits potential of the HNS. To overcome the problem, this paper presents a method that constructs the HNS with multi-vendor appliances. The proposed method first defines vendor-neutral standard services, with which various HNS applications and services are developed. Then, we exploit a dynamic service binding mechanism, which binds each standard service on a vendorspecific API of an appliance during run-time. With this mechanism, common HNS applications and services can be achieved by various combinations of multi-vendor appliances. Moreover, replacing any appliance with another never affects the execution of the applications. We have implemented the proposed method using Apache Axis Web services and Rhino JavaScript engine. The experimental evaluation showed that our implementation works well for a practical HNS with sufficiently small overhead. <div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0083/SCC2008-0083.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\PDF\SCC2008-0083.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\SCC2008-0083.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>2/08/2009 20:52</pubDate>
<author><![CDATA[Masahide Nakamura,Yusuke Fukuoka,Hiroshi Igaki,Ken-ichi Matsumoto]]></author></item>
<item><title><![CDATA[A Conflict Neighbouring Negotiation Algorithm for Resource Services in Dynamic Collaborations]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1778</link>
<description><![CDATA[Dynamic collaborations are the means by which a group of autonomous entities collaborate to achieve common objectives through sharing their own resources (e.g. specialised applications, controlled information and data, and storage and networking infrastructures). With the emergence of &amp;quot;Cloud Computing&amp;quot;, it is now possible to share such resources as services. However, sharing such resource services requires that the participants agree to the terms and conditions of their responsibilities, as well as access to information and policies regulating their behaviour within the collaboration. This is done through the use of an eContract that captures the contributed resource-oriented services, as well as their respective service level agreements. One of the unique characteristics of the contract in dynamic collaborations is that each autonomous participant must agree with the services contributed by other participants against a set of its own policies. Within this context, this paper presents an efficient contract negotiation algorithm, called Conflict Neighbouring Algorithm (CNA). We model and verify the algorithm using SPIN model checker, and compare its performance results with other alternative algorithms. <div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0084/SCC2008-0084.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\PDF\SCC2008-0084.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\SCC2008-0084.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>3/27/2009 02:08</pubDate>
<author><![CDATA[Surya Nepal,John Zic]]></author></item>
<item><title><![CDATA[DeclarativeWeb Service Entities with Virtual Endpoints]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1779</link>
<description><![CDATA[The shape of entities used in web services are mainly defined with the idea of a specific business case in mind. As soon as any third party uses these web services with another perception of the process, the shape of the entities may not be optimal any longer. Our paper proposes a solution that involves the service consumer party by letting the service consumer re-define the entities. Two architectural approaches are shown that provide an unobtrusive solution towards dynamic shaped web service entities. Furthermore we discuss the principles of declarative web services and the usage of context oriented programming for our concept of virtual endpoints. <div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0085/SCC2008-0085.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\PDF\SCC2008-0085.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\SCC2008-0085.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>3/11/2009 04:25</pubDate>
<author><![CDATA[Martin Grund,Jens Krueger,Alexander Zeier]]></author></item>
<item><title><![CDATA[National Population Information System Based on Web Services]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1780</link>
<description><![CDATA[To address the issue of isolated information island in national population information system, we present a kind of multi-layers hierarchical service-oriented architecture. In the architecture, the top nodes are only the requestors of web services, and all the leaf nodes of the bottom layer are only the providers of web services. For those nodes of intermediate layers, every node is not only the provider of web services, but also the dispatcher of web services. All isolated information islands are connected by web services dispatcher and web services registry database to form a uniform collaborative system. The command (web service invocation) is recursively multicasted from top layer to bottom layer and statistical result data are gathered from bottom layer to top layer. We implement service integration, information integration and information sharing of national population information system.<div></div><div></div>]]></description>
<pubDate>11/20/2008 03:33</pubDate>
<author><![CDATA[Hengjian Tong,Zhenfeng Shao,]]></author></item>
<item><title><![CDATA[Modeling Service Quality for Dynamic QoS Publishing]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1781</link>
<description><![CDATA[As web services are widely adopted, the nonfunctional requirements (i.e. QoS constraints) have become a significant factor in implementing trustworthy and predictable service applications. In this paper, we analyze the QoS publishing necessity, and categorize QoS parameters to refine their characteristics. Then we propose a conceptual publishing model, which is adaptive for the distributed and decentralized service-oriented computing environment. We further introduce the perception service quality measurement models, and extend P-E model for web services. The extended model takes both dynamic QoS parameters and customer expectations into consideration. A compensation mechanism is also incorporated into the model for trade-off when nonfunctional requirements cannot be fully satisfied. <div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0087/SCC2008-0087.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\PDF\SCC2008-0087.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\SCC2008-0087.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>2/02/2009 00:39</pubDate>
<author><![CDATA[Qixing Du,Chi-Hung Chi,Shuo Chen,Jianming Deng]]></author></item>
<item><title><![CDATA[Partitioning the WS Execution Environment for Hosting Mobile Web Services]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1782</link>
<description><![CDATA[Hosting web services on mobile and wireless devices is challenging because of their limited resources. A few efforts have been made to facilitate hosting of web services on such devices, but the proposed solutions do not always conform to the multiple web service standards and security frameworks that have been proposed by the web service community. Secondly, the performance of these solutions is often limited due to the resource limitations of mobile devices. In this paper, we propose to address this issue by introducing a novel system partitioning technique to be used by a web service provider so that a few WS components can be executed on an intermediate node. The use of the proposed partitioning technique for a WS execution environment has shown a significant performance improvement. The proposed partitioning technique is analyzed using a prototype WS execution environment hosting sample web services. <div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0088/SCC2008-0088.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\SCC2008-0088.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>2/02/2009 01:15</pubDate>
<author><![CDATA[Muhammad Asif,Shikharesh Majumdar,Raluca Dragnea]]></author></item>
<item><title><![CDATA[Using an Interface Proxy to Host Versioned Web Services]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1783</link>
<description><![CDATA[Web services have become important building blocks of distributed applications and have matured to the point where service lifecycle issues such as version management are now paramount. However, there is a lack of versioning support in relevant standards and tools. We present an approach which leverages the existing WSDL service definition model to build a versioned service hosting solution. We distinguish between a web service interface (published) version and its implementation version (private). We introduce the concept of a service interface proxy. This proxy, which can be generated automatically, implicitly defines the service interface version, and is published as the logical service endpoint. Client requests are routed dynamically by the proxy to appropriate implementation versions. We have implemented a prototype of our approach to demonstrate its applicability. <div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0089/SCC2008-0089.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\PDF\SCC2008-0089.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\SCC2008-0089.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>3/11/2009 04:28</pubDate>
<author><![CDATA[David Frank,Linh Lam,Liana Fong,Ru Fang,Manoj Khangaonkar]]></author></item>
<item><title><![CDATA[Ensuring Service Level Agreements for Service Workflows]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1784</link>
<description><![CDATA[<p>Specifying and monitoring Service Level Agreements (SLA) has been the subject of intensive research. However, methods of enforcing SLA have not addressed the specific issues of Composite Services (CS). Our work focuses on the problem of keeping prearranged SLAs for service workflows including workflows supporting long lived transactions (e.g. WS-BA). As a solution we offer scheduling of component service requests. The latter is based on regaining control over legacy services by means of transparent proxies and later scheduling of their invocations. Various heuristics based policies are evaluated under two different types of Service Level Agreements. The policies vary from the simpler, operating only on the base of business value, to the more complex which also consider Quality of Service requirements, topologies of workflows, utilization of components services, etc. The experiments conducted over the model, which precisely captures the behavior of web services, reveal the benefits of providing schedulers with various types of context. Index Terms-Web Services, workflows, transactional workflows, scheduling, Service Level Agreements, Lawlers algorithm, deadline decomposition, static scheduling, Quality of Service.</p><div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0090/SCC2008-0090.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\PDF\SCC2008-0090.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\SCC2008-0090.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>3/11/2009 04:31</pubDate>
<author><![CDATA[Dmytro Dyachuk,Ralph Deters]]></author></item>
<item><title><![CDATA[On Improving Change Management Process for Enterprise IT Services]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1785</link>
<description><![CDATA[In this paper, we consider the Change Management Process for Enterprise IT services with the goal of improving the efficiency of this process, i.e., minimizing change completion time and maximizing the &amp;quot;change capacity&amp;quot;. The change management process handles critical updates in the system that must be implemented by a set of executing personnel. In presence of such timing constraints and scheduling conflicts between change classes, we argue that addressing the application change management question optimally involves computing solutions to NP-hard problems. Using appropriate simulation models, we evaluate various batched scheduling alternatives to understand the effect of simple process re-engineering on the change completion time, and the change capacity of the system. In addition, we examine the benefit of executor cross-training and degree of conflicts on the performance of the system. Our results indicate that a simple longest queue based scheduling approach works well in a wide range of practical scenarios. Based on these results, we recommend process re-engineering based on longest queue based scheduling with a small degree of executor cross-training. <div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0091/SCC2008-0091.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\PDF\SCC2008-0091.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\SCC2008-0091.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>3/17/2009 01:21</pubDate>
<author><![CDATA[Xiang Luo,Koushik Kar,Sambit Sahu,Prashant Pradhan,Anees Shaikh]]></author></item>
<item><title><![CDATA[Managing Security and Privacy Integration across Enterprise Business Process and Infrastructure]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1786</link>
<description><![CDATA[<p>Managing information security and privacy assurance are fiduciary responsibilities of all government and commercial organizations, but standing up a comprehensive fully-assured environment from the onset may be technically or financially impossible. Many organizations inadequately address this challenge from a &amp;lsquo;bottomup&amp;#39; or piece-meal perspective, certifying and accrediting individual systems or focusing on perimeter systems and portals. A systematic enterprise-wide risk-management approach to information security and privacy is both practical and economically feasible, but must holistically integrate such requirements into both business process management and the technical infrastructure to be effective. The authors&amp;#39; development of the Roadmap for Information Security across the Enterprise (RISE) methodology establishes a systematic approach to security and privacy management by leveraging enterprise architecture approaches, and ensures implementation control by integrating the processes and responsibility with enterprise-level portfolio management. RISE defines an iterative threat assessment and response cycle and integrates it with capital planning and investment control (CPIC) for both operational and infrastructure initiatives. This paper describes how RISE ensures risk-informed continuous process improvement and capital planning by maintaining an architecturally founded knowledge base supporting strategic planning and investment review.</p><div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0092/SCC2008-0092.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\PDF\SCC2008-0092.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\SCC2008-0092.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>2/02/2009 01:44</pubDate>
<author><![CDATA[John A. Anderson,Vijay Rachamadugu]]></author></item>
<item><title><![CDATA[Generation of BPEL Customization Processes for SaaS Applications from Variability Descriptors]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1787</link>
<description><![CDATA[Software as a Service (SaaS) is a new delivery model for software. Software in a SaaS model is no longer run exclusively for one customer at a customer&amp;#39;s premise but run at a service provider and accessed via the Internet. A provider of Software as a Service exploits economies of scale by hosting and providing the same application for several different customers. However, each individual customer has different requirements for the same basic application. In order to allow each customer to customize the process layer and related artifacts of a SaaS application to their specific needs the application needs to provide a set of variability points that can be modified by customers. In this paper we describe the notion of a variability descriptor that defines variability points for the process layer and related artifacts of process-based, service-oriented SaaS applications. Furthermore we describe how these variability descriptors can be transformed into a WS-BPEL process model that can then be used to guide a customer through the customization of the SaaS application. <div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0093/SCC2008-0093.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\PDF\SCC2008-0093.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\SCC2008-0093.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>2/02/2009 01:56</pubDate>
<author><![CDATA[Ralph Mietzner,Frank Leymann]]></author></item>
<item><title><![CDATA[Deriving Explicit Data Links in WS-BPEL Processes]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1788</link>
<description><![CDATA[WS-BPEL is a standard language to model business processes. Control flow is modeled explicitly using links. Data is passed via shared variables and there is no notion of explicit data links. However, explicit data links are an important means to reason about business process models. We present an algorithm to derive explicit data links in WS-BPEL processes. By considering dead path elimination as defined in WS-BPEL, we reduce the number of derived data links when compared to existing approaches that ignore dead path elimination. <div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0094/SCC2008-0094.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\SCC2008-0094.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>2/02/2009 01:59</pubDate>
<author><![CDATA[Oliver Kopp,Rania Khalaf,Frank Leymann]]></author></item>
<item><title><![CDATA[Component-Based Composition Of Wide-AreaWorkflows]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1789</link>
<description><![CDATA[The evolution of workflow models has been characterized by profound flux ever since the formative days of flow charts. Despite, or because of, a proliferation of workfloworiented standards, none can honestly claim to be ubiquitous. In a widely distributed grid, gaps will inevitably exist in the model of workflows deployed therein. Thus, there is a need to present a consistent view of disparate processes to high-level roles such as analysts. To that end, we propose virtualizing the workflow layer to reconcile such gaps, both in the modeling and the execution sense. Given a wide area network of workflow providers, we overlay it with one based on WS-BPEL, our reference model. For every provider, we build virtualization-enabling silos, realized as components driven by a SCA container. Further, we describe design patterns to facilitate bindings to other models at various levels. Finally, we take reality checks by identifying those patterns in such standards as BPMN, XPDL, WWF and ebBP.<div></div><div></div>]]></description>
<pubDate>11/20/2008 04:04</pubDate>
<author><![CDATA[Karthick Sankarachary]]></author></item>
<item><title><![CDATA[Solving the Service Composition Puzzle]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1790</link>
<description><![CDATA[We observed and grouped common service composition techniques into six patterns with distinct characteristics of their integration intermediary. No pattern is better than others in all business and IT situations. Therefore our analysis suggests a formal methodology in impact and cost analysis to justify the choice of composition patterns in service design. Our contribution leads to an advisory tool consisting of questionnaire, semantic reasoning and assessment map to assist IT architects in making a decision of lasting impact. Through solving the service composition puzzle, we hope further values of service oriented architecture may be demonstrated at a fraction of total ownership cost. <div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0096/SCC2008-0096.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\PDF\SCC2008-0096.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\SCC2008-0096.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>3/11/2009 04:34</pubDate>
<author><![CDATA[Yuan-Chi Chang,Pietro Mazzoleni,George A. Mihaila,David Cohn]]></author></item>
<item><title><![CDATA[Optimum Decentralized Choreography for Web Services Composition]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1791</link>
<description><![CDATA[Typical solutions for Web services composition problem develop a single intermediary which mediates or choreographs computation and communication among the existing services to realize a target/goal service. However, such a centralized choreography mechanism can involve communication/computation overhead that can be reduced through its decentralized realization. With this as motivation, we study the problem of synthesizing a decentralized choreography strategy that will have an optimum overhead for service composition by developing a set of sitespecific choreographers working concurrently to implement a desired goal service. Each communication/computation is quantified by a cost. We develop an algorithm that takes as input the existing services, the goal service, the costs and produces as an output a set of site-specific choreographers that optimally realize the goal service using the existing services. The contribution lies in the formulation of the optimal decentralized choreographer synthesis problem as well as its solution and extends our earlier work [13, 12] in two ways: decentralization of solution and its optimality. <div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0097/SCC2008-0097.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\PDF\SCC2008-0097.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\SCC2008-0097.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>3/11/2009 04:37</pubDate>
<author><![CDATA[Saayan Mitra,Ratnesh Kumar,Samik Basu]]></author></item>
<item><title><![CDATA[Service-Oriented Mobile Applications for Ad-Hoc networks]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1792</link>
<description><![CDATA[Mobile phones are becoming a new popular platform for business applications. The number of mobile business users increases and so does the need for efficient mobile data exchange and collaboration. However, a traditional business application design approach is not suitable for mobile devices because of the limited memory and connection bandwidth. This paper presents a lightweight mobile SOA-based approach to interaction between business applications running on J2ME enabled devices such as cell phones. The paper includes position statement based on our experience and describes a prototype implementation of the architecture. The important features of our design are: using the knowledge of business processes workflow and XML compression to minimize data transferred; pro-active data push and allowing applications to fully function in a disconnected mode. The above approach results in a lightweight framework which can be used in order to develop a wide spectrum of business-oriented applications. <div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0098/SCC2008-0098.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\PDF\SCC2008-0098.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\SCC2008-0098.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>2/02/2009 02:16</pubDate>
<author><![CDATA[Yuri Natchetoi,Huaigu Wu,Yi Zheng]]></author></item>
<item><title><![CDATA[A Service-Oriented Approach to Storage Backup]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1793</link>
<description><![CDATA[Various organizations face an explosive growth of data that must be protected and backed up. This challenge is made more difficult by the movement from stand-alone server backup to backup over the local area network (LAN) and by the need to automatically manage multiple backup servers efficiently for concurrent backup jobs. In this paper, we present a novel software approach to backup service, where application servers provide their unused resources to participate in a virtual backup environment. We implement a prototype with the following desirable features: single-instance storage to save storage and communication costs, data replication to enhance data availability, data redirection to avoid job resubmission, and intelligent scheduling to achieve workload balance. The experimental study shows that our approach is promising.<div></div><div></div>]]></description>
<pubDate>11/20/2008 04:15</pubDate>
<author><![CDATA[Hao Cheng,Yao H. Ho,Kien A. Hua,Danzhou Liu,Fei Xie,Ynn-Pyng Tsaur]]></author></item>
<item><title><![CDATA[Toward Web Service Dependency Discovery for SOA Management]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1794</link>
<description><![CDATA[The Service-Oriented Architecture (SOA) has become today&amp;#39;s reference architecture for modern distributed systems. As SOA concepts and technologies become more and more widespread and the number of services in operation within enterprises increases, the problem of managing these services becomes manifest. One of the most pressing needs we hear from customers is the ability to &amp;quot;discover&amp;quot;, within a maze of services each offering functionality to (and in turn using functionality offered by) other services, which are the actual dependencies between such services. Understanding dependencies is essential to performing two functions: impact analysis (understanding which other services are affected when a service becomes unavailable) and service-level root-cause analysis (which is the opposite problem: understanding the causes of a service failure by looking at the other services it relies on). Discovering dependencies is essential as the hope that the enterprise maintains documentation that describe these dependencies (on top of a complex maze and evolving implementations) is vane. Hence, we have to look for dependencies by observing and analyzing the interactions among services. In this paper we identify the importance of the problem of discovering dynamic dependencies among Web services and we propose a solution for the automatic identification of traces of dependent messages, based on the correlation of messages exchanged among services. We also discuss our lessons learned and results from applying the techniques to data related to HP processes and services. <div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0100/SCC2008-0100.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\PDF\SCC2008-0100.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\SCC2008-0100.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>2/02/2009 02:22</pubDate>
<author><![CDATA[Sujoy Basu,Fabio Casati,Florian Daniel]]></author></item>
<item><title><![CDATA[A Method for Service Center Architecture Based on Industry Standards]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1795</link>
<description><![CDATA[Component Business Modeling (CBM) designs a framework for defining non-overlapping, independent, reusable, cost-effective business components or service centers that provide business services. CBM is gaining broad acceptance in today&amp;#39;s marketplace. On the other hand, compliance with industry standards is becoming an imperative in today&amp;#39;s enterprises. We propose a bottom-up method for deriving business components from industry standards, based on the artifact-centric approach. In a climate of constant and unpredictable change, alignment between service centers and industry standards becomes essential to the success of enterprises. <div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0101/SCC2008-0101.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\PDF\SCC2008-0101.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\SCC2008-0101.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>2/02/2009 02:26</pubDate>
<author><![CDATA[Avivit Bercovici,Amit Fisher,Fabiana Fournier]]></author></item>
<item><title><![CDATA[Text to Intelligence: Building and Deploying a Text Mining Solution in the Services Industry for Customer Satisfaction Analysis]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1796</link>
<description><![CDATA[We present our experiences in building and deploying a text mining solution in services industry settings, specifically in contact centers. We describe the Voice of Customer (VoC) and Customer Satisfaction (C-Sat) analysis settings and outline several unique research challenges brought about by this confluence of text mining and industrial services research. We describe our system for integrated text classification, business intelligence and interactive text labeling for C-Sat analysis. We recount invaluable lessons learned as computer science researchers in services research engagements. The system has been deployed in multiple accounts in contact centers and can be extended to any industrial CRM service practice to analyze unstructured text data. <div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0102/SCC2008-0102.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\PDF\SCC2008-0102.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\SCC2008-0102.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>2/03/2009 20:26</pubDate>
<author><![CDATA[Shantanu Godbole,Shourya Roy]]></author></item>
<item><title><![CDATA[Tool Support for Safety Analysis of Service Composition and Deployment Models]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1797</link>
<description><![CDATA[<div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0103/SCC2008-0103.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\PDF\SCC2008-0103.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\SCC2008-0103.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>2/02/2009 02:32</pubDate>
<author><![CDATA[Howard Foster]]></author></item>
<item><title><![CDATA[iFAO: Spatial Decision Support Services for Facility Network Transformation]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1798</link>
<description><![CDATA[Facility Network Transformation (FNT) is a strategic approach involving assessing and optimizing the industrial facility networks such as new site selection, demand forecasting, performance evaluation in banking, retailing, etc. In practice, FNT requirements are often diverse, dynamic and industry specific, it&amp;#39;s often difficult to implement a generic FNT service fully integrated with legacy systems. The heterogeneity of spatial information further calls for a loosely coupled architecture. An innovative spatial decision support system, iFAO (Intelligent Facility Network Analytics and Optimization), is therefore developed based on Service Oriented Architecture for FNT problems. In this paper, key FNT service patterns are identified and modeled to develop an industrial independent solution, and an SOA-based framework for iFAO is proposed correspondingly. Implementation of iFAO services is presented with a Model-Driven approach. With a real case in banking, it&amp;#39;s illustrated how the SOA based iFAO services are integrated to solve the real industrial problems, especially for quick decisions on business strategy in the competitive and ever-changing marketplaces. <div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0104/SCC2008-0104.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\PDF\SCC2008-0104.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\SCC2008-0104.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>2/02/2009 02:38</pubDate>
<author><![CDATA[Wenjun Yin,Xinxin Bai,Minghua Zhu,Ming Xie,Jin Dong]]></author></item>
<item><title><![CDATA[A Method and Case Study of Designing Presentation Module in An SOA-based Solution Using Configurable Architectural Building Blocks (ABBs)]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1799</link>
<description><![CDATA[Service-Oriented Architecture (SOA) projects typically pose challenging requirements on software developers such as flexibility, speed to market, and adaptability to ever changing business requirements. In this paper, we propose a novel method of rapidly designing presentation module for an SOA-based solution using fine-grained configurable architectural building blocks (ABBs). An ABB-based presentation pattern derived from industry best practices is presented, associated with a tailored ABB configuration framework. We also introduce a formal way of modeling ABBs and their interactions. Real-life experiences of applying our ABB-based model are condensed into sixteen architectural decision points, which are further applied into a variety of SOA solution projects. Experiences accumulated over these decision points are summarized into a set of guidelines to help engineers select and configure ABBs specific to services scenarios and requirements.<div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\PDF\SCC2008-0105.pdf.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>11/20/2008 04:28</pubDate>
<author><![CDATA[Liang-Jie Zhang,Jia Zhang,Abdul Allam]]></author></item>
<item><title><![CDATA[SDMA: A Service-based Architecture for Data Mining Applications]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1800</link>
<description><![CDATA[In the field of data mining, most of necessary resources, such as datasets, computing resources, might be distributed in different places of the world, which impedes scientists to do research successfully. Service science advocates every available resource as a service and focuses on their collaboration to settle a problem. Here, we propose a servicebased architecture for data mining applications, including configuration service, service engine, monitor service, analysis service, visualization service, computing service and data&amp;amp;algorithm provision service. The first 5 services focus on 5 specific aspects of data mining requirements. A demo system has also been developed to validate the feasibility of our architecture.<div></div><div></div>]]></description>
<pubDate>11/20/2008 19:45</pubDate>
<author><![CDATA[Liutong Xu,Yi Wang,Guanhui Geng,Xiangang Zhao,Nan Du]]></author></item>
<item><title><![CDATA[An Interdisciplinary Methodology for Building Service-oriented Systems on the Web]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1801</link>
<description><![CDATA[Services can be characterized as activities in which providers and customers co-create value. The need for a tight collaboration between providers and customers is thus an important distinguishing aspect of services compared to products. Traditional software engineering methodologies provide limited support for collaborative processes at runtime and are therefore not directly applicable to service engineering. In particular, the design of coordination mechanisms between service provider and customers as well as the design of a common vocabulary in an interorganizational setting is not adequately addressed. To face these shortcomings, we present an interdisciplinary approach integrating just recently proposed Web service engineering methodologies with market and ontology engineering to one coherent service engineering methodology. <div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0107/SCC2008-0107.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\PDF\SCC2008-0107.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\SCC2008-0107.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>1/19/2009 01:51</pubDate>
<author><![CDATA[Steffen Lamparter,York Sure,]]></author></item>
<item><title><![CDATA[SOAMS: A Novel SOA-based System and Network Management Model and Scheme]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1802</link>
<description><![CDATA[Traditionally, system and network management software is tightly tied with the managed IT resources through their specific manageability interfaces, such as SNMP,CIM,WMI,JMX. Because Web Service Distributed Management specification (WSDM), as an initiative of OASIS organization, helps to build the SOA-Support manageability interfaces of IT resources, we proposed SOAMS-a novel SOA-based system and network Management Scheme and WSDM-based management middle mode for SOAMS. As part of experiment work, we discuss MUSE-JMX based management scheme implementation- SOAMSPlatform, including Manager Layer, WSDM-Gateway Layer, and Agent Layer, and then analyze the prospective research direction. <div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0108/SCC2008-0108.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\PDF\SCC2008-0108.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\SCC2008-0108.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>1/19/2009 02:25</pubDate>
<author><![CDATA[ZhiHui Lu,Yong Li,Jie Wu,ShiYong Zhang,YiPing Zhong]]></author></item>
<item><title><![CDATA[Extended BPEL System for e-Engineering Framework Considering the Characteristics of Mechanical Engineering Services]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1803</link>
<description><![CDATA[Product development in mechanical industry can be defined as an engineering process based on the collaboration between different experts using various engineering services. The e-Engineering framework aims to integrate engineering services and mediate between them for the processing of the engineering process. The collaboration within the framework is very similar to a business process, in terms of web service composition. However, the existing web service composition system shows some limitations when dealing with engineering services. This paper presents a QoS-based web service orchestration system for the e-Engineering framework by analyzing the characteristics of engineering services which usually perform numerical analysis. The characteristics of the services are expressed in the form of constraint and selection specification. <div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0109/SCC2008-0109.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\PDF\SCC2008-0109.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\SCC2008-0109.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>1/14/2009 22:57</pubDate>
<author><![CDATA[Jai-Kyung Lee,Seung Hak Kuk,Hyeon Soo Kim,Seong-Whan Park]]></author></item>
<item><title><![CDATA[WSLA+: Web Service Level Agreement Language for Collaborations]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1804</link>
<description><![CDATA[The Web Service Level Agreement (WSLA) is a Web Service specification language developed to provide a SLA template to capture all the information negotiated and agreed upon by a service provider and service consumer. Though this specification is suitable for many Business-to-Business collaborations involving two parties, it does not fulfil the requirement of a new business model involving multiple parties, where a party provides multiple services to other parties and consumes services provided by other parties. To address this requirement, this paper proposes an extension to the WSLA language to capture multi-party collaborations, called WSLA+. <div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0110/SCC2008-0110.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\PDF\SCC2008-0110.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\SCC2008-0110.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>1/15/2009 20:55</pubDate>
<author><![CDATA[Surya Nepal,John Zic,Shiping Chen]]></author></item>
<item><title><![CDATA[A Methodology for Model-Driven Web Application Composition]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1805</link>
<description><![CDATA[Web application composition can greatly benefit from the utilization of existing frameworks and reusable components, in order to reduce development effort. Frameworks implementing the Model-View-Controller architectural pattern standardize the development process to a great extent, while business layer components may consist of consumers of existing web services. On this line of thought a web application can be seen as a composition of web services around a user interface flow. In this paper, an approach for the application of modeldriven techniques for the automation of the development of such a web application is presented. Specifically, we present a methodology for the modeling of the application using UML state transition and class diagrams and the generation of the appropriate source code and configuration files. The appropriate UML profiles to assist the service design are defined and the final transformation is performed exploiting model parsing tools. <div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0111/SCC2008-0111.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\PDF\SCC2008-0111.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\SCC2008-0111.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>1/15/2009 20:59</pubDate>
<author><![CDATA[Dimitrios A. Kateros,Georgia M. Kapitsaki,Nikolaos D. Tselikas,Iakovos S. Venieris]]></author></item>
<item><title><![CDATA[A Formal Model for Channel Passing in Web Service Composition]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1806</link>
<description><![CDATA[Despite the importance for expressing location mobility and dynamic composition, channel passing has almost been ignored in the formal work on Web service composition. One important problem here is to ensure that each service in a composition can always get sufficient and correct channels for completing their collaborative work. To support reasoning and verification of those properties of service compositions, in this paper we propose a pair of formal languages that support channel passing on both global and local levels, together with their semantics. Also we present a top-down design methodology that generates local-level processes from global description, and prove that the generated processes must be deadlock-free under the sufficient conditions we proposed. <div></div><div></div>]]></description>
<pubDate>11/20/2008 20:02</pubDate>
<author><![CDATA[Cai Chao,Yang Hongli,Zhao Xiangpeng,Qiu Zongyan]]></author></item>
<item><title><![CDATA[Towards a General Framework forWeb Service Composition]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1807</link>
<description><![CDATA[Service-oriented computing (SOC) has emerged as the eminent market environment for sharing and reusing service-centric capabilities. The underpinning for an organization&amp;#39;s use of SOC techniques is the ability to discover and compose Web services. In this paper we present a generalized semantics-based technique for automatic service composition that combines the rigor of process-oriented composition with the descriptiveness of semantics. Our generalized approach extends the common practice of linearly linked services by introducing the use of a conditional directed acyclic graph (DAG) where complex interactions, containing control flow, information flow and pre/post conditions, are effectively represented. <div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0113/SCC2008-0113.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\PDF\SCC2008-0113.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\SCC2008-0113.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>1/15/2009 21:07</pubDate>
<author><![CDATA[Srividya Kona,Ajay Bansa,M. Brian Blake,Gopal Gupta]]></author></item>
<item><title><![CDATA[Composable Data Processing in Environmental Science - A Process View]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1808</link>
<description><![CDATA[Data processing in environmental science is essential for doing science. The heterogeneity of data sources, data processing operations and infrastructures results in a lot of manual data and process integration work done by each scientist individually. This is very inefficient and time consuming. The aim is to provide a view based approach on accessing and processing data supporting a more generic infrastructure to integrate processing steps from different organizations, systems and libraries. We propose an approach modelled in Colored Place/Transition Nets which has been implemented in a Web Service infrastructure. <div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0114/SCC2008-0114.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\PDF\SCC2008-0114.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\SCC2008-0114.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>1/15/2009 21:27</pubDate>
<author><![CDATA[Andreas Wombacher]]></author></item>
<item><title><![CDATA[Enhancing Semantic Web Services Composition with User Interaction]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1809</link>
<description><![CDATA[The semantic web services composition process arranges several web services into one composite to realize complex workflows. To do this, semantic metadata of web services&amp;#39; description are used. The current approaches based mainly on AI planning are immature to be used in practice. In this paper we propose an approach involving users in the semantic web services composition to help overcome problems occurring in the composition process. The basic idea is to find the users helpful in situations when preconditions are not satisfied or some input data are not available which are in demand to create a composition. <div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0115/SCC2008-0115.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\PDF\SCC2008-0115.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\SCC2008-0115.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>1/15/2009 21:35</pubDate>
<author><![CDATA[Peter Bartalos,Maria Bielikova]]></author></item>
<item><title><![CDATA[A Fault Propagation Approach for Highly Distributed Service Compositions]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1810</link>
<description><![CDATA[Today, the techniques for realizing service compositions (e.g. WS-BPEL) have become mature. Nevertheless, when it comes to execution faults within service compositions, many problems are still unsolved. Especially the propagation and global handling of errors in service compositions yet remains an open issue. In this paper, we describe some preliminary results of our ongoing work in the field of fault propagation and exception handling in service compositions. We provide some service classification criteria and show how they relate to service composition fault handling. Further, we present a fault propagation approach for service compositions. <div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0116/SCC2008-0116.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\PDF\SCC2008-0116.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\SCC2008-0116.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>1/15/2009 21:38</pubDate>
<author><![CDATA[Meiko Jensen]]></author></item>
<item><title><![CDATA[SpiG4WSC: A Calculus for Secure Services Composition]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1811</link>
<description><![CDATA[Orchestration and choreography language provide basic composition techniques and specification among services, but they don&amp;#39;t give any secure manners or secure operation styles and specifications. For giving a general guide to implement secure orchestration and choreography, we give a formal approach for carrying out this goal. To this target, we address those by designing an extension of the Spi calculus with Secure Global Calculus. We named our method SpiG4WSC calculus. The combination of strong practical needs for secure Web services composition and the theoretical foundations will lead to a bridge between practice and theories. Index Terms- Spi calculus, Global calculus, Orchestration, Choreography <div></div><div></div>]]></description>
<pubDate>11/20/2008 20:20</pubDate>
<author><![CDATA[Xu Dong Hong,Qi Yong,Hou Di,Chen Ying]]></author></item>
<item><title><![CDATA[A Formal Model of Service Delivery]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1812</link>
<description><![CDATA[We define a service delivery system as a set of interacting entities that are involved in the delivery of one or more business services. A service operating system manages the processes and resources within a service delivery system. This paper presents our ongoing work on developing a formal model for these concepts, with the goal of clearly and precisely describing the delivery behavior of service systems. The model lays the groundwork for reasoning about the scenarios that occur in service delivery. <div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0118/SCC2008-0118.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\PDF\SCC2008-0118.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\SCC2008-0118.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>1/15/2009 21:50</pubDate>
<author><![CDATA[Lakshmish Ramaswamy,Guruduth Banavar]]></author></item>
<item><title><![CDATA[Robust Web Service Discovery in Large Networks]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1813</link>
<description><![CDATA[Web service discovery is a fundamental part in web service architectures. UDDI is a web service directory that was primarily intended to discover new web services in the Internet for business-to-business interaction. Another application domain of web service discovery is local area networking, where a dynamic web service discovery at runtime is required. Web Services Dynamic Discovery (WS-Discovery) is a specification that deals with local ad-hoc networks. A predefined IP multicast group is used for dynamic discovery within a subnet. In this paper we present an enhancement of WS-Discovery that allows for service lookups across subnet boundaries. We propose a dedicated proxy server, that implements cross-subnet discovery while preserving the multicast discovery within each subnet for compatibility and robustness. Thus, this technology becomes usable in enterprise-level networks. <div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0119/SCC2008-0119.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\PDF\SCC2008-0119.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\SCC2008-0119.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>1/15/2009 21:59</pubDate>
<author><![CDATA[Stephan Pöhlsen,Christian Werner]]></author></item>
<item><title><![CDATA[Formal Verification of Web Service Interaction Contracts]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1814</link>
<description><![CDATA[Recovery is the last resort when other components exhibit bugs. It is therefore of paramount importance that the correctness of the recovery protocols be formally verified. Recovery not only needs to cope with database failures but should handle and ideally mask message and process failures in clients and servers. Otherwise, when a reply message is lost the application must be able to determine &amp;quot;manually&amp;quot; whether the interaction is to be repeated. This paper develops a statechart specification of a recovery framework that generically guarantees exactly-once execution and applies model checking to prove its correctness. <div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0120/SCC2008-0120.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\SCC2008-0120.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>1/15/2009 22:03</pubDate>
<author><![CDATA[German Shegalov,Gerhard Weikum]]></author></item>
<item><title><![CDATA[A Fuzzy-set based Semantic Similarity Matching Algorithm for Web Service]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1815</link>
<description><![CDATA[A critical step in the process of reusing existing WSDL-specified services for building web-based applications is the discovery of potentially relevant services. However, the category-based service discovery, such as UDDI, is clearly insufficient. Semantic Web Services, augmenting Web service descriptions using Semantic Web technology, were introduced to facilitate the publication, discovery, and execution of Web services at the semantic level. Semantic matchmaker enhances the capability of UDDI service registries in the Semantic Web Services architecture by applying some matching algorithms between advertisements and requests described in OWL-S to recognize various degrees of matching for Web services. Based on Semantic Web Service framework, semantic matchmaker, specification matching and probabilistic matching approach, this paper proposes a fuzzy-set based semantic similarity matching algorithm for Web Service to support a more automated and veracity service discovery process in the Semantic Web Service Framework.<div></div><div></div>]]></description>
<pubDate>11/20/2008 20:31</pubDate>
<author><![CDATA[Li BAI,Min LIU]]></author></item>
<item><title><![CDATA[A Model-Driven Approach to Service Orchestration]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1816</link>
<description><![CDATA[Software systems based on Service-Oriented Architectures (SOAs) promise high flexibility, improved maintainability, and simple re-use of functionality. A variety of languages and standards have emerged for working with SOA artifacts; however, service computing still lacks an effective and intuitive model-driven approach starting from models written in an established modeling language like UML and, in the end, generating comprehensive executable code. In this paper, we present a conservative extension to the UML2 for modeling service orchestrations at a high level of abstraction, and a fully automatic approach for transforming these orchestrations down to the wellknown Web Service standard BPEL. <div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0122/SCC2008-0122.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\PDF\SCC2008-0122.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\SCC2008-0122.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>2/02/2009 02:04</pubDate>
<author><![CDATA[Philip Mayer,Andreas Schroeder,Nora Koch]]></author></item>
<item><title><![CDATA[A Framework for QoS Driven Selection of Services]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1817</link>
<description><![CDATA[In a service-oriented system (SoS), service requests de- fine tasks to execute and quality of service (QoS) criteria to optimize. A service request is submitted to the service selec- tor in the SoS, which allocates tasks to the service that can &amp;#39;best&amp;#39; satisfy the given QoS criteria. When the selector can- not optimize simultaneously the given QoS criteria, users need to specify priorities and preferences over the said cri- teria. Accounting for users QoS priorities and preferences is therefore necessary during service selection. <div></div><div></div>]]></description>
<pubDate>11/20/2008 20:36</pubDate>
<author><![CDATA[Caroline Herssens,St´ephane Faulkner,Franc¸ois Fouss,Ivan J. Jureta,]]></author></item>
<item><title><![CDATA[Query Evaluation and Performance Optimization in Distributed Community Data Sharing System Based on Web Services]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1818</link>
<description><![CDATA[Community data sharing is an emerging paradigm of data sharing. Web Services can be used in distributed community data sharing system to share data between communities resized in different nodes. We implement a community data sharing system based on Web Services, Honeycomb. In Honeycomb, Web Services invocation is the main performance bottleneck of query execution and cache technique is utilized to improve query performance. This paper describes the query evaluation, cache design and implementation in Honeycomb. <div></div><div></div>]]></description>
<pubDate>11/20/2008 20:39</pubDate>
<author><![CDATA[Wenlong Huang,Taoying Liu,Yi Zhao]]></author></item>
<item><title><![CDATA[On Service Orchestration in Mobile Computing Environments]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1819</link>
<description><![CDATA[In this paper, we present a realistic but high-level service orchestration model where services are dynamically orchestrated with respect to the mobile behavior of nodes that provide them. We present an intermittence analyze model that monitors and quantifies the mobility of nodes. We present an orchestration model that characterizes the temporal behavior of orchestration specification based on probabilistic measures. We merge two different analysis to decide whether the mobile nodes are appropriate for use for service providing. Our contribution targets mobile computing environments but the proposed approach can be generalized in varying degrees in more traditional dynamic orchestration applications. <div></div><div></div>]]></description>
<pubDate>11/20/2008 20:41</pubDate>
<author><![CDATA[Ustun Yildiz,Remi Badonnel,Claude Godart]]></author></item>
<item><title><![CDATA[Towards a User-perceived Service Availability Metric]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1820</link>
<description><![CDATA[Web services availability has been regarded as one of the key properties for (critical) service-oriented applications. Based on analyzing the limitations of current metrics for &amp;quot;User-perceived&amp;quot; availability, we propose a service status based availability metric and a corresponding estimating approach. Experiments demonstrate that this metric and the corresponding estimation approach could get a reasonable measurement on web services availability. <div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0126/SCC2008-0126.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\PDF\SCC2008-0126.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\SCC2008-0126.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>1/15/2009 22:15</pubDate>
<author><![CDATA[Lingshuang Shao,Lu Zhang,Junfeng Zhao,Bing Xie,Hong Mei]]></author></item>
<item><title><![CDATA[Towards a Service Management System in Virtualized Infrastructures]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1821</link>
<description><![CDATA[<div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0127/SCC2008-0127.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\PDF\SCC2008-0127.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\SCC2008-0127.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>1/15/2009 22:20</pubDate>
<author><![CDATA[Roman Belter]]></author></item>
<item><title><![CDATA[Exploring the Impact of Queue Management on Quality of Service for SMBs]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1822</link>
<description><![CDATA[Small to medium businesses (SMBs) are an integral part of the U.S. economy, accounting for about half of private-sector output and employing more than half of private-sector workers. Managing limited resources as well as providing additional services that meet the range of customer expectations and improve the overall customer experience is a nontrivial activity for SMBs, who like any business, must focus on the seemingly conflicting goals of minimizing cost while maximizing customer value and profit. Queue management has been a problem for many years as an organization&amp;#39;s ability (or inability) to adequately address queue management often has a direct correlation to the quality a customer associates with an overall service experience. This study describes QueueAdmin, a database driven, online application designed to support SMBs in the management of various queues uncovering the impact that QueueAdmin&amp;#39;s design and delivery has on the quality of customers&amp;#39; overall service experience. <div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0128/SCC2008-0128.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\PDF\SCC2008-0128.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\SCC2008-0128.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>1/15/2009 22:27</pubDate>
<author><![CDATA[Kinnis Gosha,Jakita O. Thomas,Juan E.Gilbert]]></author></item>
<item><title><![CDATA[Exploiting XML Schema for Interpreting XML Documents as RDF]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1823</link>
<description><![CDATA[Interpreting legacy XML documents is a great challenge for realizing the vision of the Semantic Web (SW). This paper presents an algorithm to transform XML data into RDF- foundation language of the SW - automatically. Our approach maps element definitions stored in XML Schema to RDF Schema ontology, where the ontology is used to describe the meaning and relationships between XML elements. The RDF results containing XML data at the semantic level while retaining their nesting structure make huge XML data source on the current web be available for the SW.<div></div><div></div>]]></description>
<pubDate>11/20/2008 20:55</pubDate>
<author><![CDATA[Pham Thi Thu Thuy,Young-Koo Lee,Sungyoung Lee,Byeong-Soo Jeong]]></author></item>
<item><title><![CDATA[Identify Authorization Control Requirement in Business Collaboration]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1824</link>
<description><![CDATA[Different types of business collaborations exist in terms of the way that the collaboration is carried out. In this paper, we will look into the characteristics of different collaborations and analyze their policy requirements accordingly. Various inconsistencies between authorization policies from different business units are identified and suggestions are made according to different types collaborations. <div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0130/SCC2008-0130.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\PDF\SCC2008-0130.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\SCC2008-0130.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>1/20/2009 22:09</pubDate>
<author><![CDATA[Daisy Daiqin He,Jian Yang]]></author></item>
<item><title><![CDATA[A General Service-Oriented Grid Computing Framework For Global Optimization Problem Solving]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1825</link>
<description><![CDATA[MetaHeuristics Grid (MHGrid) is a service oriented Grid application that enables the user to solve almost any global optimization problem using metaheuristics tech- niques. Two problems potentially limit the generality of MHGrid over the problem type space; having a fixed set of solvers and lacking the solver-problem relation semantics. The set of strategies enforced to resolve these two problems are: offering the solvers as services, enabling the user to define his parallelization model, allowing the user to add his own service and maintaining service-based functional- ities on both the middleware layer and application layer. This paper explains the design, architecture and implemen- tation of the SOA that MHGrid endorses that would allow the enforcing of the resolving strategies. <div></div><div></div>]]></description>
<pubDate>11/20/2008 21:03</pubDate>
<author><![CDATA[M. Wahib,Asim Munawar,Masaharu Munetomo,Akama Kiyoshi]]></author></item>
<item><title><![CDATA[A Negotiation Service for Trading Intangible Goods on Real-time Markets]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1826</link>
<description><![CDATA[There is a constantly increasing need for dynamically trading intangible goods in today&amp;#39;s economies. Electronic markets for intangible goods are on the rise. IT-based services support transaction activities between suppliers and customers. The vital task is negotiating a contract. Managing flexible transactions with varying market partners, considering multidimensional terms and conditions, and acting within short periods of time are crucial challenges for automated negotiation services of electronic markets. The approach of intelligent software agents as a negotiation service is presented. Aspects on negotiation protocol, software agent design and implementation are outlined. Insights into sample experiments and results are given. <div></div><div></div>]]></description>
<pubDate>11/20/2008 21:08</pubDate>
<author><![CDATA[Freimut Bodendorf,Florian Lang]]></author></item>
<item><title><![CDATA[GSMA based Automated Negotiation Model for Grid Scheduling]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1827</link>
<description><![CDATA[In 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 users and the resource providers that clearly states the QoS required, restrictions on resource utilization and penalties during violation of the objective. In this paper, we propose an architecture called GSMA (Grid SLA Management Architecture) that supports entire operations in SLA lifecycle such as negotiation, creation, monitoring, violation, enforcement and destroy. We propose a deviation based resource ordering algorithm (DRS) and successfully automates the SLA negotiation process with backing up of resource support. The negotiation process is implemented based on WSAgreement specification. Simulation results against gridway meta scheduler shows improved performance in terms of average SLA creation time, success rate and throughput. <div></div><div></div>]]></description>
<pubDate>11/20/2008 21:10</pubDate>
<author><![CDATA[P.Balakrishnan,S.Thamarai Selvi,G.Rajesh Britto]]></author></item>
<item><title><![CDATA[Virtual Execution Environments for ensuring SLA-compliant Job Migration in Grids]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1828</link>
<description><![CDATA[OpenCCS is an SLA-aware resource management system which uses transparent checkpointing of applications and migration of checkpoint datasets for ensuring SLA-compliance also in case of resource outages. Migration of checkpoints presumes a high grade of compatibility between source and target resource. Hence, even in large Grid systems only a small number of resources are eligible migration targets. This short paper describes the concept of virtual execution environments and how they increase the number of potential migration targets. It will also outline an implementation within OpenCCS. <div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0134/SCC2008-0134.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\PDF\SCC2008-0134.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\SCC2008-0134.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>1/20/2009 22:13</pubDate>
<author><![CDATA[Dominic Battr´e,Matthias Hovestadt,Odej Kao,Axel Keller,Kerstin Voss]]></author></item>
<item><title><![CDATA[Mining Process Variants: Goals and Issues]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1829</link>
<description><![CDATA[Recently, Process-Aware Information Systems (PAIS) were introduced, which allow for dynamic process and service changes. This, in turn, has led to a large number of process model variants, which are difficult to maintain and expensive to configure. This paper deals with goals and issues related to the mining of process model variants. Our overall goal is to learn from process changes and to &amp;quot;merge&amp;quot; the resulting model variants into a generic process model in the best possible way. By adopting this generic process model in the PAIS, future cost of process change and need for process adaptations will decrease. <div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0135/SCC2008-0135.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\PDF\SCC2008-0135.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\SCC2008-0135.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>1/20/2009 22:15</pubDate>
<author><![CDATA[Chen Li,Manfred Reichert,Andreas Wombacher]]></author></item>
<item><title><![CDATA[A Practical Geographic Ontology for Spatial Web Services]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1830</link>
<description><![CDATA[The application of ontology in Web services context for dynamic discovery, autonomous composition, invocation and monitoring has been deemed as very promising in semantic Web based enterprise application integration and m-commerce. There are many initiatives aiming to realize pervasive services to enable effective enactment of better quality of services, such as sensitiveness on service locations. The traditional WSDL is hardly qualified enough to tackle new challenges such as accurate representation of the non-functional properties of services. Hence, OWL-S came up with an effectual approach to facilitating semantic service description, dynamic composition, on-the-fly execution, and many other tasks. In this paper, we propose a practical geographic ontology based on Geography Markup Language (GML) and extend OWL-S profile to formulate new geographic profiles. We also discuss specific scenarios where context-aware services invocation peers, which are advertised and coordinated via a newly designed GeoProfile, can be equipped with geographic information inherently to distinguish different peers.<div></div><div></div>]]></description>
<pubDate>11/20/2008 21:18</pubDate>
<author><![CDATA[Shuai Yuan,Jun Shen,Jun Yan]]></author></item>
<item><title><![CDATA[A Situations & Goals Semantic Model for Designing and Implementing Semantic Web Services-based Processes]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1831</link>
<description><![CDATA[The use of Semantic Web Services (SWS) increases the agility and adaptability of process execution in many settings. On the basis of available semantic descriptions, SWS allow the automatic selection, composition and mediation of the most adequate Web services to accomplish a specific process activity. However, we claim the need of a comprehensive semantic layer to cope with process, activity and domain-concept descriptions, beyond the scope of current SWS technologies. Therefore, we propose a semantic model that provides a starting point for the design and implementation of SWS-based processes across different settings and applications. The proposed Situations &amp;amp; Goals (S&amp;amp;G) Semantic Model bases on a user-centric view of processes. Particularly, the following main elements have been identified: situations define the possible states of the world; situation descriptions capture, from a user perspective, the context in a particular situation; goals link between a situation and the following and are defined in terms of initial and target situation descriptions. The S&amp;amp;G semantic model is the epistemological core of a Situation Driven Processes (SDP) Ontology, which defines a general pattern for representing processes and can be derived for concrete settings and applications. As a result, Web applications can exploit the knowledge captured by the model to opportunely invoke SWS and thus address adaptive and flexible process executions.<div></div><div></div>]]></description>
<pubDate>11/20/2008 21:20</pubDate>
<author><![CDATA[Alessio Gugliotta,Stefan Dietze,John Domingue]]></author></item>
<item><title><![CDATA[Using Semantics for Resource Allocation in Computing Service Providers]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1832</link>
<description><![CDATA[Service providers (SP) business goals require an efficient management of their computational resources in order to perform provisioning, deployment, execution and adaptation which traditionally require human intervention. The Semantically-Enhanced Resource Allocator (SERA) is a framework designed to obtain an efficient autonomous service provider management while fulfilling customers&amp;#39; requests. While the efficient dynamic resource management is obtained by means of virtualization and agents, in this paper, we focus on how semantics can help on the task scheduling and resource allocation. In SERA, tasks and resources are semantically described following a resource ontology and resource assignments are inferred by means of a set of rules that define the scheduling policies taking into account the SP business goals. <div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0138/SCC2008-0138.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\PDF\SCC2008-0138.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\SCC2008-0138.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>2/02/2009 04:16</pubDate>
<author><![CDATA[Jorge Ejarque,Marc de Palol,Inigo Goiri,Ferran Julia,Jordi Guitart,Jordi Torres,Rosa M. Badia]]></author></item>
<item><title><![CDATA[Grounding and Execution of OWL-S Based Semantic Web Services]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1833</link>
<description><![CDATA[OWL-S is an ontology for specifying semantic web services written using the Web Ontology Language (OWL). In order to leverage the vast array of existing WSDL-based, non-semantic web services, OWL-S provides a grounding (or binding) mechanism that maps OWL ontological input and output concepts to the standard XML data types used in WSDL input and output messages. In this paper, we discuss an approach using the SPecification and EXecution tool (SPEX), that facilitates the automated generation of OWL-S groundings and associated XSLT transformations and also supports the execution of fully-grounded OWL-Sbased semantic web services. In addition, we will present a comprehensive example that will demonstrate the use of the SPEX tool for the grounding and execution activities. This work is a follow-on to our previous work in the area of model-driven semantic web services and is the final piece in the end-to-end development approach. <div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0139/SCC2008-0139.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\PDF\SCC2008-0139.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\SCC2008-0139.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>2/03/2009 04:42</pubDate>
<author><![CDATA[John T. E. Timm,Gerald C. Gannod]]></author></item>
<item><title><![CDATA[Verification of Privacy Timed Properties in Web Service Protocols]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1834</link>
<description><![CDATA[In this work we propose an approach for verifying privacy timed-related properties of web service protocol. While in [2] the addressed problem in business protocols is focused on the analysis and management of functional requirements that support rich timing constraints, our approach extends the previous results to capture the timed behavior of privacy constraints. Hence, we provide a model called Timed Private Business Protocol T PBP. Next, we emphasize the timed properties related to privacy in T PBP. Finally, we present the different types of timed property verification to achieve upon the timed private business protocol.<div></div><div></div>]]></description>
<pubDate>11/20/2008 21:32</pubDate>
<author><![CDATA[K.Mokhtari,S.Benbernou,M.Said,E.Coquery,M.S.Hacid,F.Leymann]]></author></item>
<item><title><![CDATA[A New Optimal Policy for Spare Part Service System under Nonstationary Stochastic Demand]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1835</link>
<description><![CDATA[<div></div><div></div>]]></description>
<pubDate>11/20/2008 21:36</pubDate>
<author><![CDATA[Jie Yang,Hongwei Ding,Wei Wang,Jin Dong]]></author></item>
<item><title><![CDATA[The Impossibility of Boosting Resilience of Fully-connected Services for Solving Set-consensus Tasks]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1836</link>
<description><![CDATA[<div></div><div></div>]]></description>
<pubDate>11/20/2008 21:37</pubDate>
<author><![CDATA[Juhua Pu,Zhang Xiong,Xingwu Liu]]></author></item>
<item><title><![CDATA[Enterprise Mashups: Design Principles towards the Long Tail of User Needs]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1837</link>
<description><![CDATA[<div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0143/SCC2008-0143.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\PDF\SCC2008-0143.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\SCC2008-0143.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>2/03/2009 03:09</pubDate>
<author><![CDATA[Volker Hoyer,Katarina Stanoesvka-Slabeva,Till Janner,Christoph Schroth]]></author></item>
<item><title><![CDATA[A Model for Digital Business Ecosystem and Topological Analysis]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1838</link>
<description><![CDATA[<div></div><div></div>]]></description>
<pubDate>11/20/2008 21:40</pubDate>
<author><![CDATA[Juan Wang,Philippe De Wilde]]></author></item>
<item><title><![CDATA[From Feature Models to Business Processes]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1839</link>
<description><![CDATA[The variability level of average-size Business Information Systems (BIS) is highly enough for making the design of this kind of systems a complex task. There is an approach called Process Family Engineering (PFE) that tries to ease the design of BIS using ideas from the Software Product Lines (SPL) field. Roughly speaking, they propose to, first, study the variability of the system without entering into details by means of building a variability model (called feature model), that is used later for building the business process. However, in PFE the process of deriving the business process from the feature model is performed manually. Authors use feature models with a different meaning that is commonly accepted in SPL. In this paper, we provide a rigorous description for the new meaning of feature models, and a mapping relationship that defines how to use the information in the FM for obtaining the basic structure of the business process. In addition, as a proof of concepts, we have implemented an MDD transformation that provides the expected results. <div></div><div></div>]]></description>
<pubDate>11/20/2008 21:57</pubDate>
<author><![CDATA[Ildefonso Montero,Joaquín Peña,Antonio Ruiz-Cortés]]></author></item>
<item><title><![CDATA[SLA Negotiation System Design Based on Business Rules]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1840</link>
<description><![CDATA[Service Level Agreements (SLAs) are commonly prepared and signed documents that form the contracts between a service provider and its customers, defining the obligations and liabilities of the parties. SLAs reflect the business needs of both customer and supplier as far as possible. SLAs are usually formed through either the adoption of a boilerplate agreement from the provider, or by negotiation between the parties. With the increasing adoption of software supply being implemented as a network service - Software as a Service (SaaS) - these methods are rigid or slow and costly. We propose a system that the parties can use to facilitate both fast and flexible agreements through the automation of SLA creation from a combination of Service Level Objectives (SLOs) and Business Rules. We look at a means for generating these with a SLA-NM (SLA Negotiation Manager), complying with e-negotiation rules and creates agreements from existing business objectives. <div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0146/SCC2008-0146.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\PDF\SCC2008-0146.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\SCC2008-0146.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>1/20/2009 22:20</pubDate>
<author><![CDATA[Halina Kaminski,Mark Perry]]></author></item>
<item><title><![CDATA[Hierarchical Business Process Clustering]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1841</link>
<description><![CDATA[Business process is collection of standardized and structured tasks inducing value creation of a company. Nowadays, it is recognized as one of significant intangible business assets to achieve competitive advantages. This research introduces a novel approach of business process analysis, which has more and more significance as process-aware information systems are spreading widely over a lot of companies. In this paper, a methodology of business process clustering based on process similarity is illustrated. The purpose of business process clustering is to analyze accumulated process models in order to assist design of new processes and reengineering of existing ones. The proposed methodology exploits structural similarity metrics of business processes. The methodology is illustrated with synthetic process models of insurance processes. <div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0147/SCC2008-0147.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\PDF\SCC2008-0147.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\SCC2008-0147.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>1/15/2009 22:36</pubDate>
<author><![CDATA[Jae-Yoon Jung,Joonsoo Bae,Ling Liu]]></author></item>
<item><title><![CDATA[PoEM - Potsdam Encoding for Models]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1842</link>
<description><![CDATA[Modeling with graphical notations is characterized by a wide range of notations, stakeholders, and tools. In the course of this paper, a generic web-based model encoding and editing protocol is outlined to introduce a novel approach to modeling utilizing open web standards only. It eases tool integration, aids collaborative model editing and is ultimately supported by browser-based editing environments.<div></div><div></div>]]></description>
<pubDate>11/20/2008 22:04</pubDate>
<author><![CDATA[Hagen Overdick,Martin A. Czuchra]]></author></item>
<item><title><![CDATA[Enhanced Maintenance Services with Automatic Structuring of IT Problem Ticket Data]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1843</link>
<description><![CDATA[We propose a novel technique to enhance the IT problem isolation and resolution Maintenance Services by automatically structuring problem tickets consisting of free form, heterogeneous textual data. The originality of our technique consists in applying the Conditional Random Fields (CRFs) supervised learning process to automatically identify individual units of information in the raw data. We apply our technique to identify structural patterns specific to the problem ticket data used in Call Centers since this data is not explicitly structured, is highly noisy, and very heterogeneous in content, making it hard to analyze and search by the remote technical support personnel. We present a study of the accuracy of our experiments. <div></div><div></div>]]></description>
<pubDate>11/20/2008 22:07</pubDate>
<author><![CDATA[Xing Wei,Anca Sailer,Ruchi Mahindru]]></author></item>
<item><title><![CDATA[Mobile Clinical Systems on an Interoperable Medical Framework]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1844</link>
<description><![CDATA[Rapid evaluation and treatment of time-dependent diseases such as acute stroke need fast and consistent communication between medical service providers. Our framework accepts data from hospital systems and medical evaluations, and composes it into new forms to suit different recipients and mobile devices. We have implemented a prototype application for stroke therapy which reduces the time from patient arrival to CT scan by 43%, and the time from arrival to treatment by 48% respectively. Our system can perform context-based CT image retrieval and allows images to be reviewed on mobile devices. Context-based QoS adaptation has been shown to reduce the transmission time required to transmit 619 brain images to mobile devices from 1336 seconds to 106 seconds. The system utilizes medical information standards, including DICOM and HL7. <div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0150/SCC2008-0150.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\PDF\SCC2008-0150.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\SCC2008-0150.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>1/20/2009 22:23</pubDate>
<author><![CDATA[Eunjeong Park a,Hyo Suk Namb,Heonshik Shinc]]></author></item>
<item><title><![CDATA[Tourism, Peer Production, and Location-Based Service Design]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1845</link>
<description><![CDATA[This paper describes characteristics of information and service design by exploring the needs and motivations of tourists. Tourists are expected to be important and demanding users of location-based services. They will need customized means to filter their experience of destinations, as well as ways to meaningfully participate in the creation of narratives and histories about different places. Mobile technologies will also allow tourists to be more discriminating in their patronage of different service offerings, especially as they gain greater knowledge of so-called &amp;quot;backstage&amp;quot; processes. These demanding needs will require choreography between services offered by many different commercial, cultural, educational, and community providers. The paper suggests approaches to deliver tourist location-based services based on low barrier of entry principles of web architecture. The paper concludes with a discussion on how the erosion of backstage/front-stage distinctions in service systems impacts service innovation. <div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0151/SCC2008-0151.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\PDF\SCC2008-0151.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\SCC2008-0151.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>1/15/2009 22:39</pubDate>
<author><![CDATA[Eric C. Kansa,Erik Wilde]]></author></item>
<item><title><![CDATA[SOAR: SOcially Aware Routing for Request Matching in Enterprise Environments]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1846</link>
<description><![CDATA[<div align="center"><a href="uploadfiles/2008/VIDEO/SCC2008-0152/SCC2008-0152.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\PDF\SCC2008-0152.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2008\MP3\SCC2008-0152.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>1/15/2009 22:45</pubDate>
<author><![CDATA[Asheq Khan,Hani Jamjoom]]></author></item>
</Channel>
</rss>