<?xml version="1.0" encoding="utf-8"?>
<rss version="2.0">
<Channel>
<language>en-us</language>
<title>SCC 2009</title>
<link>http://www.servicescomputing.tv/rss/view/rssFeed.php?category=41</link>
<description>SCC 2009 all articles</description>
<item><title><![CDATA[Alignment of Choreography Changes in BPEL Processes]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=2274</link>
<description><![CDATA[Choreography changes performed by one party may affect other parties. The changes and the implication for other parties can be determined.However, the required changes on the orchestration are difficult to determine since a choreography is an abstraction of the orchestration and thus information is lost. In this paper an approach is proposed to enrich the orchestration with the observed changes using a syntactical representation of the orchestration language and semantic invariants of the orchestration language.<div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2009\PPT\SCC-0001.ppt.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>11/23/2009 02:48</pubDate>
<author><![CDATA[Andreas Wombacher]]></author></item>
<item><title><![CDATA[Automatically Deriving Choreography-Conforming Systems of Services]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=2275</link>
<description><![CDATA[We present a formal method to derive a set of web services from a given choreography, in such a way that the system consisting of these services necessarily conforms to the choreography. A formal model to represent orchestrations and choreographies is given, and we define several conformance semantic relations allowing to detect whether a set of orchestration models, representing some web services, leads to the overall communications described by a choreography.<div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2009\PDF\SCC-0002.pdf.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>9/29/2009 23:27</pubDate>
<author><![CDATA[Gregorio Diaz, Ismael Rodríguez]]></author></item>
<item><title><![CDATA[QoS-Enabled Business-to-Business Integration Using ebBP to WS-BPEL Translations]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=2276</link>
<description><![CDATA[Business-To-Business Integration (B2Bi) is a key mechanism for enterprises to gain competitive advantage. However, developing B2Bi applications is far from trivial. Inter alia, agreement among integration partners about the business documents and the control flow of business document exchanges, applying suitable communication technologies for overcoming heterogeneous IT landscapes as well as ensuring a Quality of Service (QoS) level that is sufficient for B2Bi are major challenges. In this context, applying choreography languages like ebXML BPSS (ebBP) for agreement among integration partners, orchestration languages like WS-BPEL for specifying partner-specific behavior, and Web Services for communication promises seamless interactions among business partners. In this scenario, the conformance of orchestration models to choreography models and cost-effective development are of paramount importance. Consequently, top-down approaches that automatically translate choreography models into orchestration models have been proposed. By now, the realization of QoS attributes has not yet received the necessary attention that makes such approaches suitable for B2Bi. In this paper, we describe a proof-of-concept implementation of a translation of ebBP choreographies into WS-BPE orchestrations that respects B2Bi relevant QoS attributes. <div align="center"><a href="uploadfiles/2009/VIDEO/SCC-0003/SCC-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/2009\PPT\SCC-0003.ppt.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>12/08/2009 00:55</pubDate>
<author><![CDATA[Andreas Schoenberger, Thomas Benker, Stefan Fritzemeier, Matthias Geiger, Simon Harrer, Tristan Kessner, Johannes Schwalb and Guido]]></author></item>
<item><title><![CDATA[Organizing Documented Processes]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=2278</link>
<description><![CDATA[A frequent hurdle in applying Business Process Management (BPM) to large enterprises is that, since business processes are not only numerous but also documented in an engagement in multiple representations, it is difficult to work with the documented &amp;lsquo;as-is&amp;rsquo; or &amp;lsquo;to-be&amp;rsquo; state of the business, leave aside make accurate transformation decisions. In this paper, we consider the problem of how to reconcile and organize documented information about processes into groups that convey inter-process similarity. The discovered knowledge can be used for many applications like search, e.g., find all requirements across all available processes that are similar to those of the &amp;ldquo;Account Receivable&amp;rdquo; process. The method has been tested on a dataset consisting of hundreds of processes documented in Word and Visio, where from it could find process clusters that significantly boosted search performance. <div align="center"><a href="uploadfiles/2009/VIDEO/SCC-0004/SCC-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/2009\PPT\SCC-0004.ppt.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>11/24/2009 21:54</pubDate>
<author><![CDATA[Biplav Srivastava, Debdoot Mukherjee]]></author></item>
<item><title><![CDATA[Change Propagation in Process Models using Behavioural Profiles]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=2280</link>
<description><![CDATA[Business process change is at the very core of business process management, which aims at enabling flexible adaptation to changing business needs. However, the wide variety of drivers for business process modelling initiatives, reaching from business evolution to process enactment, results in multiple models that overlap in content due to serving different purposes. That, in turn, imposes serious challenges for the propagation of changes between these process models. Given a change in one model, this paper introduces an approach to determine a change region in another model by exploiting the behavioural profile of corresponding activities. It, therefore, supports the process of change propagation and eases the synchronisation of process models significantly. As a major contribution, our approach can handle changes in pairs of models, even if they are not defined in terms of a hierarchical refinement <div align="center"><a href="uploadfiles/2009/VIDEO/SCC-0005/SCC-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/2009\PPT\SCC-0005.ppt.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>11/24/2009 21:55</pubDate>
<author><![CDATA[Matthias Weidlich, Mathias Weske, Jan Mendling]]></author></item>
<item><title><![CDATA[Theoretical Framework for Eliminating Redundancy in Workflows]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=2283</link>
<description><![CDATA[In this paper we look at combining and compressing a set of workflows, such that computation can be minimized. In this context, we look at two novel theoretical problems with applications in workflow systems and services research, which are duals of each other. The first problem looks at merging the maximum number of vertices in two DAGs (directed acyclic graphs) without creating a cycle. We prove that the dual of this problem is the problem of maximizing the length of the LCS (longest common subsequence) between all pairs of topological orderings of the two DAGs. This formulation generalizes to a new definition of LCS between complex structures like workflows or XML documents, which we call M-LCS. - 18 - Subsequently, we present a taxonomy of the different kinds of problems in this set, and find the M-LCS solution for a tree and a chain with a dynamic programming algorithm. Along with this theoretical formulation, we implement the algorithms in C++ and run it on representative workflows. We evaluate the performance of the M-LCS algorithm on a set of random workflows and observe that it is substantially better than traditional AI based approaches. <div align="center"><a href="uploadfiles/2009/VIDEO/SCC-0006/SCC-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></div><div></div>]]></description>
<pubDate>11/24/2009 21:58</pubDate>
<author><![CDATA[Smruti Sarangi, Dhrubajyoti Saha, Abhishek Samant]]></author></item>
<item><title><![CDATA[Spatio-Temporal Patterns for Problem Determination in IT Services]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=2285</link>
<description><![CDATA[Problem determination in a large and dynamic IT service is a challenging task. In this paper we propose a framework for problem determination based on monitoring the event streams generated by the different components of an IT service. We give a generic representation of a problem through spatial-temporal patterns, which is a graph where the vertices capture the location and the time of the matching events, and the edges represent the spatio-temporal conditions between two matching events. The spatial conditions are based on the underlying system topology graph, and the temporal conditions are based on event timestamps. A practical implementation of the above framework will require fast algorithms for detecting patterns. We present efficient algorithms when the pattern graph is a range and a tree, which are then used as building blocks for a hierarchical heuristic for detecting general patterns. Finally, we show that our algorithms perform well in practice through extensive numerical simulations. <div align="center"><a href="uploadfiles/2009/VIDEO/SCC-0007/SCC-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/2009\PPT\SCC-0007.ppt.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>11/24/2009 21:59</pubDate>
<author><![CDATA[Shubhadip Mitra, Partha Dutta, Shivkumar Kalyanaraman, Prashant Pradhan]]></author></item>
<item><title><![CDATA[Multi-dimensional Knowledge Integration for Efficient Incident Management in a Services Cloud]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=2287</link>
<description><![CDATA[The increasing complexity and dynamics in IT infrastructure and the emerging Cloud services present challenges to timely incident/problem diagnosis and resolution. In this paper we present a problem determination platform with multi-dimensional knowledge integration (e.g. configuration data, system vital data, log data, related tickets) and enablement for efficient incident and problem management of the enterprise. Three features of the platform are discussed: automated ticket classification, the automated association of resource with tickets based on integration with configuration database, and the collection of the system vitals relevant to the ticket through integration with monitoring systems. In response to the emerging Cloud services and their highly dynamic service operation context, we identify the need for a proactive service management approach which incorporates configurations and deployment of incident management tools, policies, and templates throughout the service life cycle in order to enable effective and efficient incident management in service operation. <div align="center"><a href="uploadfiles/2009/VIDEO/SCC-0008/SCC-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/2009\PPT\SCC-0008.ppt.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>11/24/2009 22:00</pubDate>
<author><![CDATA[Rajeev Gupta, Hima Karanam, Laura Luan, Daniela Rosu, Chris Ward]]></author></item>
<item><title><![CDATA[Managing Faults in the Service Delivery Process of Service Provider Coalitions]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=2289</link>
<description><![CDATA[In recent years, IT Service Management (ITSM) has become one of the most researched areas of IT. Incident Management and Problem Management form the basis of the tooling provided by an Incident Ticket System (ITS). As more compound or interdependent services are collaboratively offered by providers, the delivery of a service therefore becomes a responsibility of more than one provider&amp;rsquo;s organization. In the ITS systems of various providers seemingly unrelated tickets are created and the connection between them is not realized automatically. The introduction of automation will reduce human involvement and time required for incident resolution. In this paper we consider a collaborative service delivery model that supports both per-request services and continuous high-availability services. In the case of high availability service the information stored in the ITS of the provider often includes information on the outage of a particular service rather than on the failure of a particular request. In this paper we offer an information model that consolidates and supports interorganizational incident management and probabilistic model for fault discovery. <div align="center"><a href="uploadfiles/2009/VIDEO/SCC-0009/SCC-0009.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/2009\PPT\SCC-0009.ppt.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>11/24/2009 22:02</pubDate>
<author><![CDATA[Patricia Marcu, Larisa Shwartz, Genady Grabarnik, David Loewenstern]]></author></item>
<item><title><![CDATA[SolutionFinder: Intelligent Knowledge Integration and Dissemination for Solution Retrieval in IT Support Services]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=2293</link>
<description><![CDATA[Online support centers are emerging as a costeffective and innovative solution designed to enable end-users to resolve technical problems more effectively without relying on live support from contact center agents. However, the capacity limitation of corporate knowledge bases prevents online support centers from effectively resolving user problems. In addition, traditional textual search techniques employed by most online support centers fall short from accurately interpreting user queries due to the ambiguity of user requests and the heterogeneity of technical problems. In this paper, we present SolutionFinder, an autonomous framework, which dynamically integrates online resources to enrich the knowledge base for IT support systems. SolutionFinder provides context-aware search support to remove the textual ambiguity embedded in user queries. Furthermore, SolutionFinder transforms solution documents into solution paths to analyze their similarity to provide high-quality solution recommendations. Evaluation results suggest by leveraging our proposed algorithms, a support service can accurately locate Web solution resources and provide high-quality services. <div align="center"><a href="uploadfiles/2009/VIDEO/SCC-0010/SCC-0010.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></div><div></div>]]></description>
<pubDate>11/24/2009 22:03</pubDate>
<author><![CDATA[Huajing Li, Maja Vukovic, Gopal Pingali, Wang-Chien Lee]]></author></item>
<item><title><![CDATA[Protecting Sensitive Customer Information in Call Center Recordings]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=2295</link>
<description><![CDATA[Protecting sensitive information while preserving the shareability and usability of data is becoming increasingly important in the outsourced business process industry. Particularly in the context of call-centers a lot of customer related sensitive information is stored in audio recordings. In this work, we address the problem of protecting sensitive customer information in audio recordings and Automatic Speech Recognition (ASR) transcripts. The high word error rates, spontaneous nature of communication and the variability in agent-customer interaction makes it harder and expensive to craft rules or build annotators to detect sensitive information. In this paper we propose a semisupervised method to model sensitive - 19 - information as a directed graph which is automatically generated from ASR transcripts. Vocabularies specific to the nodes are generated using features of context sensitive clusters. The direction and weight of the edge capture the ordering and timing constraints respectively for these features. These constraints are learnt from the time stamps associated with ASR transcripts. The effectiveness of this approach is demonstrated by applying it to the problem of detecting and locating credit card transaction in real life conversations between agents and customer of a call center<div></div><div></div>]]></description>
<pubDate>9/29/2009 23:45</pubDate>
<author><![CDATA[Tanveer Faruquie, Sumit Negi, L V Subramaniam]]></author></item>
<item><title><![CDATA[Dependency Analysis Framework for Software Service Delivery]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=2298</link>
<description><![CDATA[Various phases in the delivery of software services such as solution design, application deployment, and maintenance require analysis of the dependencies of software products that form the solution. As software systems become more complex and involve a large number of software products from multiple vendors, availability of correct and up-to-date system requirement information becomes critical to ensure proper functioning of managed and maintained software solutions. System requirement information, is mostly made available in unstructured formats from sources such as websites or product documents and are not amenable to programmatic analysis. In this paper, we motivate the benefits of capturing this information in a structured format for software service delivery, and present a dependency analysis system that collects and integrates software dependency/interoperability information from multiple unstructured sources using text mining techniques. Information hence collected, is used to support analytics useful in software service delivery. We report the results of our experiments on mining millions of webpages to collect dependency information for more than 700 software products. <div align="center"><a href="uploadfiles/2009/VIDEO/SCC-0012/SCC-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/2009\PPT\SCC-0012.ppt.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>11/24/2009 22:04</pubDate>
<author><![CDATA[Rema Ananthanarayanan, Vijil Chenthamarakshan, Heng Chu, Prasad Deshpande, Raghu Krishnapuram, Shajeer Mohammed]]></author></item>
<item><title><![CDATA[Efficient Seat Utilization in Global IT Delivery Service Systems]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=2299</link>
<description><![CDATA[Rapidly growing service delivery organizations need efficient tools to manage their business and reduce the cost of growth. These delivery businesses run round the clock due to demands coming from different geographical locations for different shifts. Cost of adding new physical infrastructure and space to tap incoming business is a key inhibitor of growth. Physical space availability and its effective management is the key infrastructure enabler for effective business delivery apart from human resources. A considerable impact can be realized if space utilization can be increased by optimal allocation around different work shifts. Optimal space utilization can bring down the number of physical seats required to serve the existing demand and also allow service delivery organizations to commit to new business needs with the existing capacity. The paper addresses this business problem and proposes an effective seat utilization planning solution using a mathematical programming approach to meet various strategic and tactical business objectives in this setting <div align="center"><a href="uploadfiles/2009/VIDEO/SCC-0013/SCC-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/2009\PPT\SCC-0013.ppt.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>12/09/2009 01:24</pubDate>
<author><![CDATA[Pranav Gupta, Gyana Parija]]></author></item>
<item><title><![CDATA[Effective Decision Support For Workforce Deployment Service Systems]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=2301</link>
<description><![CDATA[An IT services businesses must continually manage the assignment and movement of practitioners to or between projects balancing multiple objectives (1) to minimize their idle bench, while aiming (2) to increase revenue from new project opportunities. The key to simultaneously achieving these objectives is a well managed Service System for Workforce Deployment with distributed decision making. In this paper, we discuss the decision support needs for this Service System, and present a decision support tool that computes an &amp;lsquo;optimal&amp;rsquo; assignment of practitioners to projects, and improves the effectiveness and efficiency of this assignment process. The tool comprises of a matching module that matches practitioners to project openings, an optimization module that produces globally optimal recommendations, and a user interface for displaying the recommendations. We describe the decision support tool, our experiences with developing and deploying it in an IT services company, and our efforts to promote a common shared perspective among decision-makers enabling multiple decision makers to independently arrive at near-optimal decisions using the tool recommendations. <div align="center"><a href="uploadfiles/2009/VIDEO/SCC-0014/SCC-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/2009\PPT\SCC-0014.ppt.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>12/09/2009 01:25</pubDate>
<author><![CDATA[Kashyap Dixit, Munish Goyal, Pranav Gupta, Nanda Kambhatla, Rohit Lotlikar, Debapriyo Majumdar, Gyana Parija, Sambuddha Roy,]]></author></item>
<item><title><![CDATA[An Optimal Capacity Planning Algorithm for Provisioning Cluster-Based Failure-Resilient Composite Services]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=2303</link>
<description><![CDATA[Resilience against unexpected server failures is a key desirable function of quality-assured service systems. A good capacity planning decision should cost-effectively allocate spare capacity for exploiting failure resilience mechanisms. In this paper, we propose an optimal capacity planning algorithm for server-cluster based service systems, particularly the ones that provision composite services via several servers. The algorithm takes into account two commonly used failure resilience mechanisms: intra-cluster load-controlling and inter-cluster failover. The goal is to minimize the resource cost while assuring service levels on the end-to-end throughput and response time of provisioned composite services under normal conditions and server failure conditions. We illustrate that the stated goal can be formalized as a capacity planning optimization problem and can be solved mathematically via convex analysis and linear optimization techniques. We also quantitatively demonstrate that the proposed algorithm can find the min-cost capacity planning solution that assures the end-to-end performance of managed composite services for both the nonfailure case and the common server failure cases in a threetier web-based service system with multiple server clusters. To the best of our knowledge, this paper presents the first research effort in optimizing the cost of supporting failure resilience for quality-assured composite services. <div align="center"><a href="uploadfiles/2009/VIDEO/SCC-0015/SCC-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></div><div></div>]]></description>
<pubDate>11/23/2009 23:15</pubDate>
<author><![CDATA[Chun Zhang, Rong N. Chang, Charles Perng, Edward So, Chunqiang Tang, Tao Tao]]></author></item>
<item><title><![CDATA[Performance Management for Large Scale Service Delivery Platforms]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=2305</link>
<description><![CDATA[Managing performance of modern service Delivery Platforms (SDPs) is a challenging task due to scale, dynamicity and heterogeneity of these systems. With the presence of a plethora of widely divergent applications, it becomes almost impossible to model these SDPs accurately enough for basic management tasks. The dynamicity of these platforms adds another dimension of complexity. Precisely due to these reasons, traditional - 20 - learning based approaches are not adequate since these approaches are inherently very slow. In this paper, we present a novel technique for performance management in SDP environment to overcome these challenges. In our approach, we construct a multi-dimensional performance model grid called datagrid. Datagrid presents a unified management approach for various system management tasks such as provisioning, fault management and SLA management. According to our understanding, ours is a first system to have a unified approach for large scale SDP environments for multiple management tasks. We have implemented our technique in real distributed system and it shows promising results. <div align="center"><a href="uploadfiles/2009/VIDEO/SCC-0016/SCC-0016.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/2009\PPT\SCC-0016.ppt.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>11/24/2009 01:07</pubDate>
<author><![CDATA[Manoj Agarwal]]></author></item>
<item><title><![CDATA[ITBVM: IT Business Value Modeler]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=2306</link>
<description><![CDATA[Today, enterprise IT environments are complex as never before with individual applications, tiers, or technologies segregated into individual management domains. Typically, the value of business applications and the dependencies between business and IT objects and IT objects among each other is unknown or at least not up to date. Thus, ultimately, the business value of individual IT tasks is unknown. Hence it is very hard to perform global management services such as performance optimization in resource-constrained environments. This deficiency is even more deeply felt by an internal or external services provider called in to perform an optimization or to improve an IT management framework. We propose a framework ITBVM for business-value driven IT optimization with particular emphasis on such enterprise environments. A key part is the use of discovery technologies to provide the link between business value and IT objects. As one instance of the framework, we show how discovery can improve a performance-optimization problem in an otherwise blackbox scenario. We validate these improvements through experiments in a controlled setup and through statistical interpretation of fine-grained dependency discovery in a large real enterprise environment. <div align="center"><a href="uploadfiles/2009/VIDEO/SCC-0017/SCC-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/2009\PPT\SCC-0017.ppt.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>11/24/2009 01:09</pubDate>
<author><![CDATA[Nikolai Joukov, Birgit Pfitzmann, HariGovind V. Ramasamy, Norbert G. Vogl, Murthy V. Devarakonda, and Tryg Ager]]></author></item>
<item><title><![CDATA[Towards Providing Value Based Differentiated QoS]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=2308</link>
<description><![CDATA[In this paper we present a model for delivering differentiated quality of service based on the value for the provider. The value for the provider is captured by taking into account the i) client value, ii) service value, and certain exogenous factors. We enumerate and articulate different dimensions which will affect these components. We present a couple of case studies to demonstrate the usefulness of the proposed model. The first case study is from Retail Banking based on our real life experience of deploying a service delivery system in a leading bank in India. The second case study is from a Business Process Outsourcing industry. We also define the notion of value plot to visualize the relative importance of customers from value perspective and highlight how the value plot can be used for both operational as well as strategic planning in service delivery. <div align="center"><a href="uploadfiles/2009/VIDEO/SCC2009-0018/SCC2009-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/2009\PPT\SCC2009-0018.ppt.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>12/09/2009 02:10</pubDate>
<author><![CDATA[Girish Chafle, Sameep Mehta, Gyana Parija]]></author></item>
<item><title><![CDATA[A Holistic View of Industry Standards across SOA Solution Stack]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=2310</link>
<description><![CDATA[Businesses recently began shifting from proprietary models towards industry standards. Today, when businesses are faced with medium and large SOA projects, they strive to standardize their business process models, information models, and message models by complying with known industry standards. As service orientation and composition become more important, these standards also become critical for efficient SOA integration. However, in doing so, the businesses face a new challenge &amp;ndash; the challenge to effectively utilize the industry standards models. Using industry standards models effectively is difficult since they are typically large and complex, thus resulting in the creation of vast amounts of interrelationships. To meet this challenge, we describe a new approach that provides a holistic view of these heterogeneous SOA models and corresponding industry standards. Such a unified view must provide access to heterogeneous data sources and models, allow search and query of them as a single model source all across the SOA solution stack, and provide advanced services such as traceability, scoping, and impact analysis. To validate the proposed holistic approach, we describe a model catalog and repository system and present its use on a fieldbased example. <div align="center"><a href="uploadfiles/2009/VIDEO/SCC2009-0019/SCC2009-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/2009\PPT\SCC2009-0019.ppt.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>12/09/2009 20:21</pubDate>
<author><![CDATA[Nir Mashkif, Natalia Razinkov, David Amid, Amit Fisher]]></author></item>
<item><title><![CDATA[Managing Configuration Complexity during Deployment and Maintenance of SOA Solutions]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=2311</link>
<description><![CDATA[Successful deployment and maintenance of enterprise SOA solutions involves configuring and managing several middleware software stacks. These middleware stacks have several hundreds to thousands of configuration attributes to be configured and managed. Ineffective Management of configuration information increases the cost, labor and time of troubleshooting configuration problems. The reason for it are two-folds: (a) configuration dependencies cut across different software stacks and there is no formal method to capture and consolidate them, and (b) incorrect configuration of attributes results in runtime exceptions. Correlating exceptions obtained during runtime to deployment/maintenance time configuration values is difficult as the context of the error is lost and is often not traceable. Current approaches to managing and troubleshooting problems associated with configuration information involve extensive human labor which comes at a premium. In this paper, we introduce Configuration Map (CM), which is an ordered set of configuration attributes for a deployable middleware component. Such a map when associated with exceptions helps reduce the cost of resolving configuration problems. We present several use cases and show from real life deployment scenarios that CM significantly reduces the cost of labor and time. <div align="center"><a href="uploadfiles/2009/VIDEO/SCC-0020/SCC-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/2009\PPT\SCC-0020.ppt.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>12/09/2009 20:25</pubDate>
<author><![CDATA[Kalapriya Kannan, Nanjangud C. Narendra, Lakshmish Ramaswamy]]></author></item>
<item><title><![CDATA[Evaluating Service Identification with Design Metrics on Business Process Decomposition]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=2312</link>
<description><![CDATA[One of the key activities to construct a successful Service-Oriented Architecture (SOA) is the identification of services with the right level of abstraction. Most of existing SOA design methodologies advocate identifying services from the top-down decomposition of business processes. However, the identification quality in these methodologies heavily depends on the expertise and experience of individual designers. The ability to quantitatively evaluate service identification is absolutely needed. In this paper, we propose an approach that supports such evaluation by applying the measurement technology to the service-based business process decomposition. A model to capture related architectural elements with their relationships is presented. A set of design metrics are proposed for measuring various features of identified services in the service portfolio, including service granularity, coupling, cohesion, and business entity convergence. To apply the approach, a prototypical measurement tool for service identification is developed. An automotive work order scenario is used as an illustration example to explain our approach and demonstrate its effectiveness. <div align="center"><a href="uploadfiles/2009/VIDEO/SCC-0021/SCC-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/2009\PPT\SCC-0021.ppt.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>11/24/2009 01:46</pubDate>
<author><![CDATA[Qian Ma, Nianjun Zhou, Yanfeng Zhu, Hao Wang]]></author></item>
<item><title><![CDATA[Integrated Constraint Violation Handling for Dynamic Service Composition]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=2313</link>
<description><![CDATA[Dynamic service composition is suitable for on-demand business requests. For autonomic computing, service composition needs to deal with runtime environment faults, but also with business constraint violations which result from business requirements. We propose an approach for integrated handling of business constraint violations and runtime environment faults for dynamic service composition. We introduce a loosely coupled implementation architecture to maintain the platform-independent nature. <div align="center"><a href="uploadfiles/2009/VIDEO/SCC-0022/SCC-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/2009\PPT\SCC-0022.ppt.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>12/09/2009 20:36</pubDate>
<author><![CDATA[Mingxue Wang, Kosala Yapa Bandara, Claus Pahl]]></author></item>
<item><title><![CDATA[Optimal Replacement Policy of Services based on Markov Decision Process]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=2318</link>
<description><![CDATA[Traditional approaches towards self-healing of services, have emphasized reactive self-healing; viz., stopping a failed service, replacing/reconfiguring it and restarting. Since this is disruptive, we investigate a proactive self-healing approach in this paper. The key issue in proactive self-healing, is the decision by the consumer, based on available observations of the performance of the provider service, to decide when to replace the currently running service (in case of atomic service) before the service fails, or when to replace a component service (in case of composite service), and in a manner that minimizes the cost involved in this replacement. In this paper we address this problem via a Markov Decision Process. We determine the optimal value and define the best action to be taken, when the consumer service is in a particular state of loss due to QoS failure of the provider service. Since the current state is known, our decision will help in proactive self-healing, by initiating service replacement earlier, and thereby minimizing losses to the consumer. We illustrate our ideas using a realistic example in the purchase order domain, and present an implementation prototype for the same. <div align="center"><a href="uploadfiles/2009/VIDEO/SCC-0023/SCC-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></div><div></div>]]></description>
<pubDate>11/24/2009 01:50</pubDate>
<author><![CDATA[Sandhya Pillai, C. Nanjangud Narendra]]></author></item>
<item><title><![CDATA[A Model to Design and Verify Context-Aware Adaptive Service Composition]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=2321</link>
<description><![CDATA[The introduction of mobile clients and context-aware behaviours intoWeb Service compositions may generate faults and inconsistencies. We introduce an extension of a composition model where context-awareness is made explicit and a number of correctness properties are verifiable. In particular, our extended model enables the verification of properties commonly used to validate context dependent applications. We also propose a set of algorithms to verify these properties efficiently.<div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2009\PPT\SCC-0024.ppt.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>12/09/2009 20:38</pubDate>
<author><![CDATA[Javier Cubo, Michele Sama, Franco Raimondi, David Rosenblum]]></author></item>
<item><title><![CDATA[Towards Autonomic Service Discovery - A Survey and Comparison]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=2323</link>
<description><![CDATA[Service-oriented architecture has become the standard paradigm for software component integration. However, with the permanently increasing amount of available services and dynamic changes, the complexity of such service infrastructures, their maintenance, and consequently the expenditures spent for their operation increase equally. To deal with these effects, an improvement of service composition and discovery becomes necessary, especially a higher degree of automation. Following the idea of Autonomic Computing, which similarly aims at automating processes and workflows to a high degree, service composition and discovery have to proceed autonomously, which will on the one hand side reduce human involvement to a minimum, but on the other side require certain capabilities on the part of these mechanisms. For these purposes, in this paper we define prime criteria that have to be fulfilled for an autonomic service discovery. Based on that we present a comprehensive survey on existing service discovery approaches and evaluate to which extent they already fulfill these criteria. As a result, the paper reveals that there already exist some approaches that support or even fulfill a couple of the proposed criteria, which principally enables autonomic properties, but what is missing is an holistic approach focusing explicitly on providing autonomic properties. <div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2009\PPT\SCC-0025.ppt.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>11/24/2009 21:56</pubDate>
<author><![CDATA[Michael Rambold, Holger Kasinger, Florian Lautenbacher, Bernhard Bauer]]></author></item>
<item><title><![CDATA[Identifying Client Goals for Web Service Discovery]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=2325</link>
<description><![CDATA[Web service discovery has become a daunting task primarily due to its inability for allowing clients to articulate proper service search queries. Improving the quality of service search results could not be achieved unless we determine ways for correctly identifying Web service query goals. In this paper, we indentify client goals when performing a Web service search. As part of this work, we introduce the concept of Quality of Web Service (QWS) for our quality-driven discovery mechanism. We determint that client goals in service discovery can be defined as exploratory or informational. We use this information to demonstrate how the knowledge of client goals can become beneficial in improving the way clients conduct service search queries. Results from our experiments are intriguing and show that the performance of informational service queries in terms of precision improve the querying process by 36.26% and 40.39% when compared to Google&amp;rsquo;s PageRank and Yahoo, respectively, we further use our findings to provide insights on improving the service retrieval process.<div></div><div></div>]]></description>
<pubDate>9/30/2009 00:03</pubDate>
<author><![CDATA[Eyhab Al-Masri, Qusay Mahmoud]]></author></item>
<item><title><![CDATA[Web Service Substitution based on Preferences over Non-functional Attributes]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=2327</link>
<description><![CDATA[In many applications involving composite Web services, one or more component services may become unavailable. This presents us with the problem of identifying other components that can take their place, while maintaining the overall functionality of the composite service. Given a choice of candidate substitutions that offer the desired functionality, it is often necessary to select the most preferred substitution based on nonfunctional attributes of the service, e.g., security, reliability, etc. We propose an approach to this problem using preference networks for representing and reasoning about preferences over non-functional properties. We present algorithms for solving several variants of this problem: a) when the choice of the preferred substitution is independent of the other constituents of the composite service; b) when the choice of the preferred substitution depends on the other constituents of the composite service; and c) when multiple constituents of a composite service need to be - 22 - replaced simultaneously. The proposed solutions to the service substitution problem based on preferences over non-functional properties are independent of the specific formalism used to represent functional requirements of a composite service as well as the specific algorithm used to assemble the composite service. <div align="center"><a href="uploadfiles/2009/VIDEO/SCC-0027/SCC-0027.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/2009\PDF\SCC-0027.pdf.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>1/28/2010 21:15</pubDate>
<author><![CDATA[Ganesh Ram Santhanam, Samik Basu, Vasant Honavar]]></author></item>
<item><title><![CDATA[Analyzing Impact Factors on Composite Services]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=2331</link>
<description><![CDATA[Although Web services are intended for short term, ad hoc collaborations, in practice many Web service compositions are offered longterm to customers. While the Web services making up the composition may vary, the structure of the composition is rather fixed. For companies managing such Web service compositions, however, challenges arise which go far beyond simple bilateral contract monitoring. It is not only important to determine whether or not a component (i.e., Web service) in a composition is performing properly, but also to understand what the impact of its performance is on the overall service composition. In this paper we show which challenges emerge and we provide an approach on determining the impact each Web service has on the composition at runtime. <div align="center"><a href="uploadfiles/2009/VIDEO/SCC-0028/SCC-0028.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/2009\PPT\SCC-0028.ppt.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>1/28/2010 21:17</pubDate>
<author><![CDATA[Lianne Bodenstaff, Andreas Wombacher, Manfred Reichert, Michael C. Jaeger]]></author></item>
<item><title><![CDATA[Model Aware Execution of Composite Web Services]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=2332</link>
<description><![CDATA[One of the most interesting aspects of WSs is the possibility to combine them into Composite Web Services (CWSs). While Business Process Execution Language (BPEL) has emerged as the most popular language to orchestrate services, it introduces serious challenges with respect to the manageability of CWSs. This paper shows an approach to overcome these challenges with a model-aware execution of CWSs based on the Coloured Petri Nets (CPN) modeling language. Although the use of any mathematically grounded formalism enables verification of properties of CWSs, here it is used at runtime to guide the execution of the CWS. This paper presents the architecture and evaluation of using CPN as means for the model-aware execution, monitoring and runtime optimizations of CWSs. Compared to BPEL, the model-aware approach based on CPN significantly improves the performance.<div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2009\PDF\SCC-0029.pdf.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>1/28/2010 21:19</pubDate>
<author><![CDATA[Karolina Zurowska, Ralph Deters]]></author></item>
<item><title><![CDATA[QoS Analysis for Web Service Composition]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=2333</link>
<description><![CDATA[The quality of service (QoS) is a major concern in the design and management of Web service composition. Existing methods for QoS calculation either do not take the probability of path execution into consideration when QoSs are provided for different execution paths, or do not take different execution paths into consideration when a single integrated QoS is provided for the whole composition. In this paper, a comprehensive QoS analysis approach is proposed that calculates the QoS probability distribution by considering both the execution probability and execution conditions of each path in the service composition. Four types of basic composition patterns in the service composition are discussed: sequential, parallel, loop and conditional. In particular, a QoS solution is provided for all types of loop structured service composition. <div align="center"><a href="uploadfiles/2009/VIDEO/SCC-0030/SCC-0030.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/2009\PPT\SCC-0030.ppt.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>1/28/2010 21:20</pubDate>
<author><![CDATA[Huiyuan Zheng, Weiliang Zhao, Jian Yang, Athman Bouguettaya]]></author></item>
<item><title><![CDATA[Enhancing Claim-Based Identity Management by Adding a Credibility Level to the Notion of Claims]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=2334</link>
<description><![CDATA[Claim-based identity management denotes an open identity model which uses the notion of claims to describe identity attributes. A claim is an identity attribute named with an abstract identifier (e.g. a URI), which applications and services can use to specify the attributes they need. Open and extensible formats for the exchange of identity attributes ensure interoperability among different identity systems. For this reason, claim-based identity management lays the ground for Identity Metasystems, which provide an identity layer on top of existing identity systems and promise an easier management of digital identities among the Internet. However, the Internet grew into an environment of mostly isolated domains for a good reason. Service providers find it hard to accept identity information from any other than the own domain. While claim-based identity management provides the means to specify identity information on a perattribute basis, trust is usually defined in a general manner. Service providers state the issuers of identity information, they trust, but do not restrict for what. In this paper, we argue that for a truly decentralized management of identity information, trust should be defined on the same granular level as identity information. We propose a model which considers trust on a per-claim basis. In our model, trust into a claim is defined as the assumed correctness and integrity of a claim in dependence of the issuer. As a proof-ofconcept, we implemented a small flight booking scenario which uses claims augmented with an expected trust level to show how we can achieve more flexibility for the user in his choice of an identity provider when considering not only whom to trust, but for wh <div align="center"><a href="uploadfiles/2009/VIDEO/SCC-0031/SCC-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/2009\PPT\SCC-0031.ppt.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>1/28/2010 21:21</pubDate>
<author><![CDATA[Ivonne Thomas, Christoph Meinel]]></author></item>
<item><title><![CDATA[A Security Meta-Model for Service-oriented Architectures]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=2335</link>
<description><![CDATA[Service-oriented Architectures (SOA) facilitate the provision and orchestration of business services to enable a faster adoption to changing business demands. Several approaches have been described to generate executable description of service orchestrations based on visual business process models. These models describe workflows and related information on an abstract level supporting business analysts to state and verify business requirements. In previous work, we have adopted this approach to simplify the security engineering in Service-oriented Architectures. We foster a model-driven approach based on the integration of security annotations in visual modelling notation. These annotations are gathered and translated to a domain-independent security model that facilitates the generation of enforceable security configurations (e.g. WSSecurityPolicy). In this paper, we introduce our security meta-model for SOA that constitutes the foundation for our model-driven approach. Based on a model for service interactions that describes the exchange of information in a service-based system, we define a model to express security requirements and policies, and introduce a mapping to WS-Policy and WS-SecurityPolicy. <div align="center"><a href="uploadfiles/2009/VIDEO/SCC-0032/SCC-0032.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/2009\PPT\SCC-0032.ppt.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>1/28/2010 21:24</pubDate>
<author><![CDATA[Michael Menzel, Christoph Meinel]]></author></item>
<item><title><![CDATA[Effective Detection of SQL/XPath Injection Vulnerabilities in Web Services]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=2336</link>
<description><![CDATA[This paper proposes a new automatic approach for the detection of SQL Injection and XPath Injection vulnerabilities, two of the most common and most critical types of vulnerabilities in web services. Although there are tools that allow testing web applications against security vulnerabilities, previous research shows that the effectiveness of those tools in web services environments is very poor. In our approach a representative workload is used to exercise the web service and a large set of SQL/XPath Injection attacks are applied to disclose vulnerabilities. Vulnerabilities are detected by comparing the structure of the SQL/XPath commands issued in the presence of attacks to the ones previously learned when running the workload in the absence of attacks. Experimental evaluation shows that our approach performs much better than known tools (including commercial ones), achieving extremely high detection coverage while maintaining the false positives rate very low. <div align="center"><a href="uploadfiles/2009/VIDEO/SCC-0033/SCC-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/2009\PPT\SCC-0033.ppt.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>1/28/2010 21:49</pubDate>
<author><![CDATA[Nuno Antunes, Nuno Laranjeiro, Marco Vieira, Henrique Madeira]]></author></item>
<item><title><![CDATA[Reconfigurable SCA Applications with the FraSCAti Platform]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=2337</link>
<description><![CDATA[The Service Component Architecture (SCA) is a technology agnostic standard for developing and deploying distributed service-oriented applications. However, SCA does not define standard means for runtime manageability (including introspection and reconfiguration) of SOA applications and of their supporting environment. This paper presents the FraSCAti platform, which brings runtime management features to SCA, and discusses key principles in its design: the adoption of an extended SCA component model for the implementation of SOA applications and of the FraSCAti platform itself; the use of component-based interception techniques for dynamically weaving non-functional services such as transaction management with components. The paper presents micro-benchmarks that show that runtime manageability in the FraSCAti platform is achieved without hindering its performance relative to the de facto reference SCA implementation, Apache&amp;rsquo;s Tuscany. <div align="center"><a href="uploadfiles/2009/VIDEO/SCC-0034/SCC-0034.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/2009\PPT\SCC-0034.ppt.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>1/28/2010 21:51</pubDate>
<author><![CDATA[Lionel Seinturier, Philippe Merle, Damien Fournier, Nicolas Dolet, Valerio Schiavoni, Jean-Bernard Stefani]]></author></item>
<item><title><![CDATA[Ontology-based Information Sharing in Service-Oriented Database Systems]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=2338</link>
<description><![CDATA[This paper presents a novel information sharing framework using Service-Oriented Database System (SODB) for service registry and repository that facilitates data integration. A SODB is a database architecture composed with reusable services to support searching, querying, deleting, and storing data. As SODB is organized in a service-oriented manner, SODB can be easily changed or maintained by reusing different services. Thus, it can be used to share information in the cloud. The Information Sharing System (ISS) component of the SODB employs domain ontology to share data sources. The domain ontology utilizes mathematical equivalence relations to map data sources into appropriate domain ontology. It also facilitates dynamic query composition across data sources. This paper also presents the design, implementation, and performance evaluation of the ISS component. Our implementation is based on a real application, the Arizona Healthcare Cost Containment System (AHCCCS). This application demonstrates that the ISS can facilitate complex information integration. Finally, this paper presents the performance of the ISS using WAPT (Web Application Testing) for Microsoft Windows XP, and the response time consistently fall in between 0.1 to 0.15 second for each request. <div align="center"><a href="uploadfiles/2009/VIDEO/SCC-0035/SCC-0035.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/2009\PPT\SCC-0035.ppt.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>1/28/2010 21:52</pubDate>
<author><![CDATA[TszYan Chow, Wei-Tek Tsai, Janaka Balasooriya, Xiaoying Bai]]></author></item>
<item><title><![CDATA[A Task Abstraction and Mapping Approach to the Shimming Problem in Scientific Workflows]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=2339</link>
<description><![CDATA[Recently, there has been an increasing need in scientific workflows to solve the shimming problem, the use of a special kind of adaptors, called shims, to link related but incompatible workflow tasks. However, existing techniques produce scientific workflows that are cluttered with many visible shims, which distract a scientist&amp;rsquo;s focus on functional components. Moreover, these techniques do not address a new type of shimming problem that occurs due to the incompatibility between the ports of a task and the inputs/outputs of its internal task component. To address these issues, 1) we propose a task template model which encapsulates the composition and mapping of shims and functional task component within a task interface; 2) we design an XMLbased task specification language, called TSL, to realize the proposed task template model; 3) we propose a serviceoriented architecture for task management to enable the distributed execution of shims and functional components; and 4) we implement the proposed model, language and architecture and present a case study to validate them. Our technique uniquely addresses both types of shimming problems. To our best knowledge, this is the first shimming technique that makes shims invisible at the workflow level, resulting in scientific workflows that are more elegant and readable. <div align="center"><a href="uploadfiles/2009/VIDEO/SCC-0036/SCC-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/2009\PPT\SCC-0036.ppt.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>1/28/2010 21:54</pubDate>
<author><![CDATA[Cui Lin, Shiyong Lu, Xubo Fei, Darshan Pai, Jing Hua]]></author></item>
<item><title><![CDATA[Interaction Mismatch Discovery based Transformation from BPMN to BPEL]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=2340</link>
<description><![CDATA[Many techniques have been proposed to transform BPMN into BPEL. The transformation for single BPMN process is studied well. But multiple BPMN processes often suffer from mismatch issues. This paper aims to better transform multiple BPMN processes containing interaction mismatches. The challenges for such transformation are: 1) ensuring transformed BPEL processes compatible 2) ensuring transformation interactionpreserved, which means keeping interactions those do not cause transformed processes mismatch preserved and transformed. In the paper, interaction mismatches are classified into two categories: static and runtime interaction mismatch. Both of them can be discovered by our approach based on interaction control-flow relations. For better transformation, discovered mismatch interactions are minimized and only the minimized result will not be transformed. A case study is given to illustrate the approach. The transformation also provides general support for transforming cross-organizational business processes into executable processes.<div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2009\PPT\SCC-0037.ppt.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>9/30/2009 01:19</pubDate>
<author><![CDATA[Shuai Gong, Jinhua Xiong]]></author></item>
<item><title><![CDATA[Extracting Behavioral Models from WS-BPEL Processes for Service Discovery]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=2341</link>
<description><![CDATA[As service behavior plays a key role in service interaction, behavior-based service discovery has been increasingly recognized as a critical activity for service-based systems. However, little attention has been paid to the retrieval of behavioral models, which is critical for behavior-based discovery. This paper proposes an approach for extracting service behavioral models from WS-BPEL, which has been emerging as the prominent language for service orchestration. Our approach identifies all participants involved in a WSBPEL process and abstracts the interaction of the process with its participants through behavioral models. Furthermore, we distinguish three types of ordering constraints between activities in behavioral models. Based on this, we present a mechanism to automatically adapt WS-BPEL processes to find and use other similar services when no service satisfies exactly the specified requirements. We have implemented a prototype to demonstrate and evaluate our approach. <div align="center"><a href="uploadfiles/2009/VIDEO/SCC-0038/SCC-0038.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/2009\PPT\SCC-0038.ppt.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>12/01/2009 22:04</pubDate>
<author><![CDATA[Xiao Zan, Donggang Cao, Chao You, Hong Mei]]></author></item>
<item><title><![CDATA[Improving the Performance of ActiveXML Workflows: The Formal Descriptions]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=2342</link>
<description><![CDATA[Modern business applications are typically required to support collaboration and coordination of several business partners. Web services have become the de facto technology for implementing such applications. One approach for specifying web service calls and interactions is ActiveXML (AXML), a data-oriented workflow language. A problem with state-of-the-art workflow engines for AXML is that the execution is poorly optimized and thus too time-consuming. In a previous short paper, we proposed an optimization approach for workflows specified in AXML. Here, we elaborate on this proposal in more detail, providing the formal descriptions to show the general execution of the optimization rule, the algorithm to group the Web service calls, and an analytical argument for the resulting performance gain. <div align="center"><a href="uploadfiles/2009/VIDEO/SCC-0039/SCC-0039.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/2009\PPT\SCC-0039.ppt.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>12/08/2009 02:13</pubDate>
<author><![CDATA[Sattanathan Subramanian, Guttorm Sindre]]></author></item>
<item><title><![CDATA[A Service Oriented Architecture for Personalized Rich Media Delivery]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=2343</link>
<description><![CDATA[Multimedia streaming means delivering continuous data to a plethora of client devices. Besides the actual data transport this also needs a high degree of content adaptation respecting the end users&amp;rsquo; needs given by the form of content preferences, transcoding constraints, and device capabilities. When it comes to content editing (like mixing in subtitles or picture-in-picture composition) relying on third party service providers may be necessary. For improved efficiency all adaptation should be done in a service-oriented way, because a lot of adaptation modules can be reused within different adaptation workflows. In this paper we discuss the extensions of Web service frameworks, and present a first implementation of a service-oriented framework for media streaming and digital item adaptation, concentrating on the technical realization of the services. Our experimental results show the praticality of the actual deployment of service-oriented multimedia frameworks. <div align="center"><a href="uploadfiles/2009/VIDEO/SCC-0040/SCC-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/2009\PPT\SCC-0040.ppt.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>10/13/2009 03:46</pubDate>
<author><![CDATA[Sascha Toennies,Benjamin Köhncke, Patrick Hennig,Wolf-Tilo Balke]]></author></item>
<item><title><![CDATA[WS-CDSP: A Novel Web Services-based Content Delivery Service Peering Scheme]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=2344</link>
<description><![CDATA[Nowadays, faced with heterogeneous, isolated content service systems, people require peering or allied content services. Firstly, we analyze some existing content service hybrid schemes, such as CDN over P2P Architecture and Peering of CDN Architecture. Based on problem statement, we propose A Novel Web Services-based Content Delivery Service Peering Scheme (WS-CDSP), and we describe scheme architecture design, which support multiple-to-multiple loosely-coupled peering services through Web Service Information Endpoint and Web Service Management Endpoint. And then we focus on main system function design, Web Service Information Endpoint and Web Service Management Endpoint design mechanism. After that, We discuss CDN or VoD composite resource model based on CIM. As part of experiment work, we discuss WS-CDSP scheme implementation and comparative experiment, and then analyze the experiment results. At last, from our research experiences and related survey, we analyze the prospective research direction and challenges in this field.<div></div><div></div>]]></description>
<pubDate>9/30/2009 01:25</pubDate>
<author><![CDATA[Lu ZhiHui, Jie Wu, Chuan XIAO, WeiMing Fu, YiPing Zhong]]></author></item>
<item><title><![CDATA[Ensuring Coordination of Multi-business Interactions]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=2345</link>
<description><![CDATA[While the potential benefits of multi-business interaction automation are truly phenomenal, the complexity of business has increased dramatically, and building reliable and secure e-business application systems becomes an important issue. Industry standards for Web service composition, such as BPEL, provide the notion of LRT (Long running transaction) for the execution of business processes in Web service collaborations. Formal verification of BPEL programs and specifications has become a hot topic. However, the notion of LRT described in BPEL is purely local and occurs within a single business process instance. In this work a two-step model checking method, from simply to the complex, is proposed for multi-business process. A preliminary step is to judge business correctness on external logic transition relations amongst businesses with various simple symbolic model checking tools, and then make further checking interaction validation based on internal system behavior in multi-business coordination with model checking verification environment for mobile processes. The typical scenario is illustrated to show how model checking is applied to verify the reliability of multibusiness coordination. All of these have important implications for ensuring multi-business process coordination. <div align="center"><a href="uploadfiles/2009/VIDEO/CLOUD-0005/CLOUD-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/2009\PPT\SCC-0042.ppt.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>10/13/2009 03:48</pubDate>
<author><![CDATA[Min Yuan, Zhiqiu Huang, Jun Hu, Xiang Li, and Yi Zhu]]></author></item>
<item><title><![CDATA[Componentization of Business Process Layer in the SOA Reference Architecture]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=2346</link>
<description><![CDATA[This paper discusses and analyzes the Business Process layer in the SOA Solution Stack (S3) model, which is also known as the SOA Reference Architecture (SOA-RA). Business Process layer leverages the Service layer to quickly compose and choreograph services and to coordinate business processes to fulfill customer requirements. Based on industry practice, we introduce a set of architectural building blocks of the layer, together with the interdependencies and interactions between them, to componentize the Business Process layer in the context of SOA Reference Architecture. We also report industry experiences of applying this layer in SOA solution engagements.<div></div><div></div>]]></description>
<pubDate>9/30/2009 01:35</pubDate>
<author><![CDATA[Liang-Jie Zhang, Jia Zhang]]></author></item>
<item><title><![CDATA[Web2Exchange: A Model-Based Service Transformation and Integration Environment]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=2347</link>
<description><![CDATA[Dattatreya, Sharad Singhal, Jim Pruyne (HP Technology Solutions Group Bangalore, India; HP Laboratories Palo Alto, Canada) (SCC-0044) The rush is on to service-enable everything, and those that fail to capitalize on this trend will be left behind in the marketplace. While new applications can be written for this environment, substantial value exists in legacy applications and systems. Successfully service enabling these applications is not easy for software vendors due to the complexity of integration. To address this problem, we focus on the issue of service specification using models which clearly capture the scope, capability and state of a service. Such models make integration of services more certain and can allow previously incompatible services to be combined more easily. We have prototyped Web2Exchange, a platform for modeling, transforming and integrating services. We have publicly demonstrated the platform by showcasing a &amp;ldquo;mashup&amp;rdquo; of the HP Opencall Media platform with web-based calendaring in November of 2008. Since then, we have developed additional services on the platform, and are beginning to make the platform available to others outside of our organization.<div></div><div></div>]]></description>
<pubDate>9/30/2009 01:36</pubDate>
<author><![CDATA[Venugopal Srinivasmurthy, Sanjeeva Manvi, Sharad Singhal, Jim Pruyne, Ravi Gullapalli, Dattathreya Sathyamurthy, Nandan Reddy, Hemant Dattatreya, Sharad Singhal, Jim Pruyne]]></author></item>
<item><title><![CDATA[Towards a Unified Approach for Business Process Modeling Using Context-based Artifacts and Web Services]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=2348</link>
<description><![CDATA[Service-Oriented Architecture is a paradigm for modeling and enacting business processes that promotes improved flexibility and monitorability through the composition of loosely-coupled Web services. However, such process-centric composition, with focus on invoking Web services to reach a stated goal, still does not provide the desired flexibility. Web services implementations are typically locked into the business logic of the business processes that they implement. Additionally, monitoring such Web services compositions becomes cumbersome especially for business analysts and managers who are not IT experts. To address these issues, this paper presents a unified process- and data-centric approach with focus on Web services as a driving element to the changes affecting both processes and data. In this approach a business process is modeled as a collection of interacting (business) artifacts, each of which behaves as per a predefined state transition system called Artifact Life-Cycle (ALC). An ALC is enriched with contextual details, which permits business process execution monitoring. Throughout this paper, a realistic running example in the purchase order domain is used for illustration purposes.<div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2009\PPT\SCC-0045.ppt.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>10/10/2009 05:01</pubDate>
<author><![CDATA[Nanjangud Narendra, Youakim Badr,Philippe Thiran, Zakaria Maamar]]></author></item>
<item><title><![CDATA[Identifying Data Constrained Activities for Migration Planning]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=2351</link>
<description><![CDATA[Constant and rapid changes in the market place have inevitably brought changes to business process including the long running process. When changes are mandatory or require retroactive compliance, it may be necessary to migrate existing running process instances to a new version model. Current dynamic instance adaptation approach requires each instance to adapt to the changes individually. To support multiple instance migration across process models, we present an approach where we leverage model comparison technique; control and data flow analyses to identify data constraints for changed activities and identify potential migration points where we could migrate the instances. We then capture the migration point information in a migration plan which can later be used in the runtime environment to orchestrate the migration. We have implemented a prototype of our approach to demonstrate its applicability.<div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2009\PPT\SCC-0046.ppt.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>9/30/2009 01:38</pubDate>
<author><![CDATA[Linh Lam, Qin Tang, Zhi Le Zou,Liana Fong, David Frank]]></author></item>
<item><title><![CDATA[Cost-Effective Semantic Annotation of XML Schemas and Web Service Interfaces]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=2354</link>
<description><![CDATA[Research in the field of semantic Web services aims at automating the discovery, selection, composition and management of Web services based on semantic descriptions. However, the applicability of many solutions developed in this field is hampered by the costs associated with semantically annotating large repositories of Web services. To overcome this gap we propose a practical method for semantically annotating collections of XML Schemas and Web service interfaces. We have evaluated this method on a large repository of governmental Web services. The evaluation shows that relatively simple techniques are surprisingly cost-effective, saving hundreds of man-hours of semantic annotation effort. Moreover, the proposed method does not assume the availability of a preexisting ontology or controlled vocabulary. Instead, the space of annotations is dynamically built during the annotation process. <div align="center"><a href="uploadfiles/2009/VIDEO/SCC-0047/SCC-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/2009\PPT\SCC-0047.ppt.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>12/08/2009 02:03</pubDate>
<author><![CDATA[Peep Küngas, Marlon Dumas]]></author></item>
<item><title><![CDATA[Clustering Web Services for Automatic Categorization]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=2356</link>
<description><![CDATA[Analyzing the functionality of Web services is the basis of using Web services effectively and efficiently. The first step in such an analysis of Web services is to categorize different services, which may be offered by different service providers, based on their functionalities. In this paper, we present a clusteringbased approach to Web service categorization in order to form a hierarchy of service taxonomy. Our novel clustering scheme takes into consideration not only individual factors such as input or output of service operations, but also the latent inter-relationships among the individual factors. Given a set of services that may or may not have been categorized, we adopt individual methods to handle the issue and mark out their classification labels in terms of a common (given) taxonomy, such as UNSPSC. When a new service description is published, the unclassified service is compared with the classified ones and measures of the likelihood that the new service description is belonging to each cluster are calculated. Based on this calculation, the service will be assigned to a suitable category. <div align="center"><a href="uploadfiles/2009/VIDEO/SCC-0048/SCC-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/2009\PPT\SCC-0048.ppt.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>11/24/2009 22:10</pubDate>
<author><![CDATA[Qianhui Liang, Li Peipei, Patrick C.K. Hung, Xindong Wu]]></author></item>
<item><title><![CDATA[Quantitative Modeling of Communication Cost for Global Service Delivery]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=2358</link>
<description><![CDATA[IT service providers are increasingly utilizing globally distributed resources to drive down costs, reduce risk through diversification and gain access to a larger talent pool. However, fostering effective collaboration among geographically distributed resources is a difficult challenge. In this - 26 - paper, we present our initial attempt to quantify the increased overhead in leveraging distributed resources as one of the project costs. We associate this overhead cost measurement with metrics that measure communication quality, such as reduction in productivity and communication delay. These metrics can in turn be computed as functions of underlying project parameters. To achieve this goal, we first build a project communication model (PCM) to categorize different types of collaborative communication. We then represent communication efficiency and changes in resource availability in terms of information theoretic concepts such as reduced channel capacity, information encoding efficiency and channel availability. This analysis is used to help determine the cost associated with team formation and task distribution during the project planning phase <div align="center"><a href="uploadfiles/2009/VIDEO/SCC-0049/SCC-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/2009\PPT\SCC-0049.ppt.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>11/24/2009 01:53</pubDate>
<author><![CDATA[Nianjun Zhou, Qian Ma, Krishna Ratakonda]]></author></item>
<item><title><![CDATA[Simplify Stochastic QoS Admission Test for Composite Services through Lower Bound Approximation]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=2362</link>
<description><![CDATA[A composite service can have its overall Quality of Service (QoS) measure computed with the QoS measures of its constituent services. In the stochastic case of QoS modeling, accurate computation for the probability distribution of the composite QoS measure is NP-hard because of the inherent complexities of probability value calculation for the function of discrete random variables. However, given reasonable assumptions on the monotony of the composite QoS function and on the independence of constituent QoS measures, we have proposed a lower bound approximation algorithm that computes the approximate value of the composite QoS distribution for admission test purpose in much lower-order complexity of time even in the worst case. The effectiveness of the proposed method is verified and compared against the naive algorithm using simulative trace data.<div></div><div></div>]]></description>
<pubDate>9/30/2009 01:44</pubDate>
<author><![CDATA[Kaibo Wang, Xingshe Zhou, Shandan Zhou, Ning Fu]]></author></item>
<item><title><![CDATA[Port Based Reliability Computing for Service Composition]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=2365</link>
<description><![CDATA[Web service composition is a distributed model to construct new web service on top of existing primitive or other composite web services. However, current service technologies, including proposed composition languages, do not address the reliability of web service composition. Thus it is hard to predict the system reliability. In this paper, we propose a method to compute system reliability based on Service Component Architecture (SCA), a standard that provides a language-independent way to define and compose service components in the system. We first present a formal service component signature model with respect to the specification of the SCA assembly model, and then propose a languageindependent dynamic behaviour model for specifying the interface behaviour of the service component by port activities. Then the failure behaviors of ports are defined through the Enhanced Non-Homogeneous Poisson Process (ENHPP). Based on the semantics of ports, several rules have been generated to compute reliabilities of port expressions, thus the overall system reliability can be automatically computed. Finally, a testing bed is given to calculate port reliability.<div></div><div></div>]]></description>
<pubDate>9/30/2009 01:45</pubDate>
<author><![CDATA[Zuohua Ding, Mingyue Jiang]]></author></item>
<item><title><![CDATA[Dynamic Service Composition in Ambient Intelligence Environment]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=2368</link>
<description><![CDATA[In Ambient Intelligence (AmI) environments, some services provided by AmI devices are often not visible to users and to other devices. The existing approaches deal with services&amp;rsquo; composition and discovery as two independent parts. In this paper, we propose an alternative approach based on logical reasoning agent system. This system is supported by a communication protocol where agents discover automatically services provided in their environment and construct dynamically composite services. The service composition is constructed from an exchange of idiomatic expressions among agents and users, while the discovery process takes the form of an information request via the communication protocol. The advantage of this approach is that agents are able to acquire knowledge from each other and when interacting with users. This capability will facilitate the satisfaction of user&amp;rsquo;s requirements in an intelligent way. This study shows that agents are able to satisfy new services previously unknown to the system.<div></div><div></div>]]></description>
<pubDate>9/30/2009 01:46</pubDate>
<author><![CDATA[Yazid Benazzouz, Nicolas Sabouret, Belkacem]]></author></item>
<item><title><![CDATA[A Backwards Composition Context Based Service Selection Approach for Service Composition]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=2370</link>
<description><![CDATA[In SOA applications are built from individual services offered by different providers. Typically an application comprises of several such services usually stemming from different providers leading to the question of which services to select and compose. We present the new concept of composition context together with a novel service selection algorithm. The approach has been evaluated in our test bed and shows good scalability. <div align="center"><a href="uploadfiles/2009/VIDEO/SCC-0053/SCC-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/2009\PPT\SCC-0053.ppt.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>12/09/2009 20:41</pubDate>
<author><![CDATA[Hong Qing Yu, Stephan Reiff-Marganiec]]></author></item>
<item><title><![CDATA[A Public-View Approach to Timed Properties Verification for B2B Web Service Compositions]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=2373</link>
<description><![CDATA[Timed properties are an important quality criterion in Business-to-Business (B2B) Web service compositions. To guarantee the correctness of these compositions, the deadlock freeness as well as some non-functional properties such as timed constraints should be satisfied. Since there are some recent research efforts concerning the correctness of service composition from the structural and behavioral compatibility perspective, this paper will mainly focus on the timed properties verification. Existing verification techniques however need to know all the activities and activities&amp;rsquo; time delays of the whole process, thus these techniques are infeasible when some business parties are unwilling to reveal their internal process for privacy or business reasons. To address this problem, a timing property preserving public view approach is proposed. By composing those public views published by all the participants, timed verification can be conducted so that business parties can identify suitable services that meet their timed requirements. A case study of B2B collaboration is included to illustrate our approach. <div align="center"><a href="uploadfiles/2009/VIDEO/SCC-0054/SCC-0054.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/2009\PPT\SCC-0054.ppt.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>11/24/2009 01:58</pubDate>
<author><![CDATA[Wei Song, Xiaoxing Ma, S.C. Cheung, Wanchun Dou, Jian Lvs (]]></author></item>
<item><title><![CDATA[A Model for Designing Generic Services]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=2378</link>
<description><![CDATA[This paper describes a model for capturing service designs and the design of service product lines. The model promotes reuse of service artifacts, enables a balanced view of the service from different stakeholder viewpoints, and provides a foundation for design for service quality. The model leverages a phased approach to design, engineering and management of services. The model has applicability throughout the service lifecycle and provides a standardized vocabulary and structure for designing and maintaining generic services, irrespective of the domain of application. <div align="center"><a href="uploadfiles/2009/VIDEO/SCC-0055/SCC-0055.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/2009\PPT\SCC-0055.ppt.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>11/24/2009 02:01</pubDate>
<author><![CDATA[Anshu Jain,Alan Hartman,Ketki Dhanesha]]></author></item>
<item><title><![CDATA[Design Pattern for Object-Triple Mapping]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=2380</link>
<description><![CDATA[Up to now, developing software for the Semantic Web is much more complex than developing software for other data representation paradigms, such as relational data-bases. Software development for relational databases is dramatically simplified by so-called object-relational mappers. Due to the conceptual difference between relational databases and the Semantic Web, the design patterns for object-relational mapping cannot directly be used for linked data. In this paper we show how design patterns for object-relational mapping can be used to achieve the more complex object triple mapping, which will make developing Semantic Web-enabled software much easier. <div align="center"><a href="uploadfiles/2009/VIDEO/SCC-0056/SCC-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/2009\PPT\SCC-0056.ppt.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>11/24/2009 02:05</pubDate>
<author><![CDATA[Matthias Quasthoff,Christoph Meinel]]></author></item>
<item><title><![CDATA[Constructing a Context-aware Service-Oriented Reputation Model using Attention Allocation Points]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=2383</link>
<description><![CDATA[In this paper we examine the problem of rich information environments and the need to narrow the agents attention to what is important for them to interact and later to evaluate and transfer reputation values, using Attention Allocation technique (AA). We also argue that this cannot be done without the aid of Service Oriented Architecture (SOA). Reputation is used in our work as a service, presenting a new concept- that is Reputationas- a-Service (RaaS). We then present a service-oriented model for optimizing the presentation and the use of reputation in order to maximize its value to both users and providers. <div align="center"><a href="uploadfiles/2009/VIDEO/SCC-0057/SCC-0057.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></div><div></div>]]></description>
<pubDate>12/09/2009 21:01</pubDate>
<author><![CDATA[Rehab Alnemr, Justus Bross, Christoph Meinel]]></author></item>
<item><title><![CDATA[A Case Study on Bi-lateral Resource Integration Oriented Marine Logistics Service System]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=2386</link>
<description><![CDATA[Marine logistics service is one of the fundamental production services supporting the import and export businesses of other industries. The current marine logistics service eco-system formed spontaneously, and during its development, various types of service providers were stepwise imported and complex business collaborations formed between them. Based on our investigation on marine logistics services between South Korea and Weihai, China, we found that some deficiencies existed in such a decentralized service eco-system and led to non-optimized quality of marine logistics service. To solve these issues, we designed a bi-lateral resource integration oriented solution, in which a third-party service agency is established to help cargo owners and various logistics providers set up mutual service relationships, integrate bi-lateral resources, and monitor and evaluate quality/credit of services, thereby improving QoS and customer satisfaction. Business operation mechanisms, especially profit patterns, are briefly discussed. Benefits and disadvantages of BIRIS-based solutions are analyzed. Business and technological lessons learned from the solution are briefly put forward. Finally some possible directions for future innovations and improvements are discussed. <div align="center"><a href="uploadfiles/2009/VIDEO/SCC-0058/SCC-0058.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/2009\PPT\SCC-0058.ppt.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>1/28/2010 21:56</pubDate>
<author><![CDATA[Zhongjie Wang, Xiaofei Xu, Dianhui Chu, Chao Ma]]></author></item>
<item><title><![CDATA[Business Entities: An SOA Approach to Progressive Core Banking Renovation]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=2387</link>
<description><![CDATA[The challenges in banking industry are forcing banks to renovate their core systems to survive fierce competition. A progressive renovation approach is preferable to total replacement because it is less intrusive and risky. In this paper, we present an incremental core banking renovation methodology based on the concept of business entities. We implemented this methodology to develop an SOA solution to dynamic product bundling for an Asian bank. This renovation project provided an opportunity for us to explore SOA design principles regarding service component modularity, service reusability, change management and integration, and also to empirically demonstrate the advantages of the business entitycentric approach in achieving well-designed SOA solutions.<div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2009\PPT\SCC-0059.ppt.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>1/28/2010 22:21</pubDate>
<author><![CDATA[Rong Liu, Frederick Wu, Yasodhar Patnaik, Santhosh Kumaran]]></author></item>
<item><title><![CDATA[Design and Implementation of Secure Internet Based Voting System with User Anonymity using Identity Based Encryption System]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=2388</link>
<description><![CDATA[With Internet becoming ubiquitous, electronic transactions over the Internet have become an integral part of day to day life. The Internet is used for more and more secure transactions like banking, shopping, submitting tax returns etc. In a way, the need for a secure Internet based electronic voting system is an obvious demand. The task of designing a secure Internet based voting system is a cryptographic challenge. This paper proposes and discusses the design and implementation of secure Internet based electronic voting system using Identity Based Encryption System (IBES). This proposed system satisfies various security requirements like, privacy, anonymity, eligibility, accuracy, fairness, uniqueness, verifiability and receipt freeness. Total user anonymity is achieved using IBES.<div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2009\PPT\SCC-0060.ppt.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>2/01/2010 21:23</pubDate>
<author><![CDATA[Purushothama B R, Alwyn R Pais]]></author></item>
<item><title><![CDATA[Trust Evaluation in Composite Services Selection and Discovery]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=2389</link>
<description><![CDATA[In Serviced-Oriented Computing (SOC) environments, the trust level of a service or a service provider is a critical issue for a service client to consider, particularly when the client is looking for a service from a large set of services or service providers. However, a service may invoke other services offered by different providers forming composite services. The complex invocation relations significantly increase the complexity of trust evaluation in composite services. In this paper, we propose a novel algorithm for trust evaluation in composite services that takes all atomic invocations into account, which is essential for composite services selection and discovery. <div align="center"><a href="uploadfiles/2009/VIDEO/SCC-0061/SCC-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/2009\PPT\SCC-0061.ppt.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>12/09/2009 21:10</pubDate>
<author><![CDATA[Lei Li, Yan Wang]]></author></item>
<item><title><![CDATA[Service Composition based on Natural Language Requests]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=2390</link>
<description><![CDATA[The easiest way for a user to express his needs regarding a desired service is to use natural language. The main issues come from the fact that the natural language is incomplete and ambiguous, while the service composition process should lead to valid services. In this paper we propose a natural language service assemblage method based on composition templates (patterns). The use of templates assures that the composition result is always valid. The proposed system, called NLSC (Natural Language Service Composer), was implemented on the top of a service-oriented middleware called WComp and tested in an intelligent home environment.<div></div><div></div>]]></description>
<pubDate>9/30/2009 02:00</pubDate>
<author><![CDATA[Marcel Cremene, Jean-Yves Tigli, Stephane Lavirotte, Florin-Claudiu Pop, Michel Riveill, Gaetan Rey]]></author></item>
<item><title><![CDATA[Domain-Specific Deployment and Configuration Language for Composition and Adaptation of Coarse-Grained Services]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=2391</link>
<description><![CDATA[Domain-specific languages promise an unprecedented integration of business and IT aspects in software development. This translates into a stronger focus on user requirements, higher adaptability, and shorter time-to-market. DSLs provide the opportunity to bring business actors and IT experts closer together by raising the mutual understanding of the models underpinning software development. A closer cooperation in modeling improves the understanding of systems and allows for experimentation. Business actors can identify their business processes and resources in the models and can experiment with them. This paper presents work-in-progress addressing a model layer for the dynamic composition and adaptation of coarse-grained web services through configuration information. Our domain-specific configuration language (DSCL) enables IT experts and business actors to concentrate on model representations that reflect individually tailored compositions of generic portal services. Our approach fosters modeling on two different levels of abstraction. Business actors define high-level models focusing on the definition of processes across coarse-grained services. Low-level concepts complete technical aspects that are abstracted away in high-level concepts.<div></div><div></div>]]></description>
<pubDate>9/30/2009 02:03</pubDate>
<author><![CDATA[Kurt Englmeier, Ricki Koinig]]></author></item>
<item><title><![CDATA[Ontology Alignment Based Service Interface Adaptation]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=2392</link>
<description><![CDATA[The most commonly deployed web service applications employ client-server communication patterns, with clients running remotely and services hosted in data centers. In this paper, we make the case for Service-Oriented Collaboration applications that combine service-hosted data with collaboration features implemented using peer-to-peer protocols. Collaboration features are awkward to support solely based on the existing web services technologies. Indirection through the data center introduces high latencies and limits scalability, and precludes collaboration between clients connected to one-another but lacking connectivity to the data center. Cornell&amp;rsquo;s Live Distributed Objects platform combines web services with direct peer-to-peer communication to eliminate these issues.<div></div><div></div>]]></description>
<pubDate>9/30/2009 02:04</pubDate>
<author><![CDATA[Lu Jin, Jian Wu, Jianwei Yin, Ying Li, Shuiguang Deng]]></author></item>
<item><title><![CDATA[Effective Knowledge Sharing in Service Systems]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=2393</link>
<description><![CDATA[A model of a knowledge intensive service system is introduced to study knowledge sharing in these systems. Simulation experiments based on the model are conducted to relate particular aspects of knowledge creation and sharing to a metric of service performance. The results indicate that certain network configurations of knowledge sharing among the service provider agents have performance advantages over others. In addition, the degree of fallibility associated with shared knowledge has a significant impact on performance. This paper is part of a research program that investigates the knowledge dynamics within service systems with particular focus on the influence of human, social and structural factors. <div align="center"><a href="uploadfiles/2009/VIDEO/SCC-0065/SCC-0065.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/2009\PPT\SCC-0065.ppt.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>12/09/2009 21:13</pubDate>
<author><![CDATA[Waiho Wong, Joseph Davis]]></author></item>
<item><title><![CDATA[An Information Model for Managing Service Lifecycle Resources]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=2394</link>
<description><![CDATA[The development of enterprise-wide Serviceoriented Architectures (SOA) is a complex task. In most cases, evolutionary approaches are used to deal with the arising complexity. However, most of the existing design methodologies and implementation strategies focus on more technical, service realization specific aspects. Challenges regarding the definition and the management of related service artifacts throughout the whole service lifecycle are neglected. Also the implementation of a lifecycle-encompassing information management infrastructure is not addressed adequately in research and industry. In this paper we introduce a common service management information model (coSIM) that builds a foundation for the management of services and service infrastructures during design-, run- , and change-time.<div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2009\PPT\SCC-0066.ppt.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>11/19/2009 02:09</pubDate>
<author><![CDATA[Roman Belter,André Ludwig]]></author></item>
<item><title><![CDATA[Service Innovation in Value-Network through Clusters Consolidation]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=2395</link>
<description><![CDATA[Now-a-days, the rapidly changing technology development and the demand to provide high-end solutions to customers needs increase the opportunity of networking various small enterprises, offering service oriented businesses. The existing value network should be, viewed as a fluid infrastructure, clustering together various enterprises (subnetworks). Based on the business scenario of individual enterprises&amp;rsquo; in a specified time interval, few subnets maybe underutilized and few subnets may be over-utilized, thereby necessitates periodic changes in the distribution of customers. Here we propose a number of redesign operations on the customers&amp;rsquo; clusters (enterprises), which are sub-networks in the value network, with the conscious to minimize the extratraffic in the backbone network. Thus we have proposed an optimization re-design problem to reduce the extra-traffic at the value network and maximize the intra-traffic within the clusters (subnets) by considering customers&amp;rsquo; movement and clusters consolidation. We have utilized Simulated Annealing (SA) algorithm to search for the best solution to the reclustering problem. Our simulation results show a better trade-off in minimizing the extra-traffic through clusters consolidation and improve efficiency in operations for the service providers. <div align="center"><a href="uploadfiles/2009/VIDEO/SCC-0067/SCC-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/2009\PPT\SCC-0067.ppt.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>12/09/2009 21:17</pubDate>
<author><![CDATA[Sami J. Habib, Paulvanna Nayaki Marimuthu]]></author></item>
<item><title><![CDATA[A Dynamic Compensation Mechanism for Web Transactions]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=2396</link>
<description><![CDATA[Composite services are often long-running, loosely coupled, and cross-platform, so they bring additional complexity to the system in the presence of failures. Transaction is a basic concept in building reliable distributed system. However, Web transaction cannot be easily rolled back as conventional ACID transactions, so a main problem that remains is how to cancel a long-runningWeb transaction. This paper introduces a calculus - 29 - based on &amp;pi;-calculus, which deals with the faults ofWeb service composition in long-running business processes. The calculus is equipped with operational semantics to guarantee both appropriate installation and activation of compensation of Web Transaction. <div align="center"><a href="uploadfiles/2009/VIDEO/SCC-0068/SCC-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/2009\PPT\SCC-0068.ppt.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>12/09/2009 21:18</pubDate>
<author><![CDATA[Jiajie Wu, Farong Zhong, Qiu Yufang]]></author></item>
<item><title><![CDATA[JabberWocky: Crowd-Sourcing Metadata for Files]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=2397</link>
<description><![CDATA[Finding relevant files in a personal file system continues to be a challenge. It is still easier to find stuff on the Web with its exponential growth than in one&amp;rsquo;s personal file system. Yet, the exponential growth of personal data renders the current services of personal file systems increasingly inadequate. A reason for this failure is the &amp;ldquo;cold-start&amp;rdquo; problem: algorithms that dramatically improve a user&amp;rsquo;s ability to find documents on the Web become ineffective in personal file systems because there is not enough information about these documents. We propose JabberWocky, a service that allows users to manage the content of their personal file system by leveraging semantic relationships available on the Web. More specifically, JabberWocky is using keyword/resource associations of social bookmarking web sites as a basis for recommending keywords for files. We chose social bookmarking web sites because of their popularity and because the assignment of keywords (a process also referred to as &amp;ldquo;tagging&amp;rdquo;) is an established and popular way to manage photos, music, movies, and audio resources on the Web &amp;ndash; very much the kind of resources that need to be managed in personal file systems. The goal of JabberWocky is to overcome the &amp;ldquo;cold-start&amp;rdquo; problem of personal file systems and to provide recommendations in a scalable way while maintaining the user&amp;rsquo;s privacy. In this work-in-progress report we describe the motivation and challenges of designing a system like JabberWocky, present the initial design of an on-going user study, and briefly discuss what we have learned so far.<div></div><div></div>]]></description>
<pubDate>9/30/2009 02:09</pubDate>
<author><![CDATA[Varun Bhagwan,Carlos Maltzahn]]></author></item>
<item><title><![CDATA[Cloud Security Issues]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=2398</link>
<description><![CDATA[In past three decades, the world of computation has changed from centralized (client-server not web-based) to distributed systems and now we are getting back to the virtual centralization (Cloud Computing). Location of data and processes makes the difference in the realm of computation. On one hand, an individual has full control on data and processes in his/her computer. On the other hand, we have the cloud computing wherein, the service and data maintenance is provided by some vendor which leaves the client/customer unaware of where the processes are running or where the data is stored. So, logically speaking, the client has no control over it. The cloud computing uses the internet as the communication media. When we look at the security of data in the cloud computing, the vendor has to provide some assurance in service level agreements (SLA) to convince the customer on security issues. Organizations use cloud computing as a service infrastructure, critically like to examine the security and confidentiality issues for their business critical insensitive applications. Yet, guaranteeing the security of corporate data in the &amp;quot;cloud&amp;quot; is difficult, if not impossible, as they provide different services like Software as a service (SaaS), Platform as a service (PaaS), and Infrastructure as a service (IaaS). Each service has their own security issues. So the SLA has to describe different levels of security and their complexity based on the services to make the customer understand the security policies that are being implemented. There has to be a standardized way to prepare the SLA irrespective to the providers. This can help some of the enterprises to look forward in using the cloud services. In this paper, we put forward some security issues that have to be included in SLA. <div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2009\PPT\SCC-0070.ppt.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>12/09/2009 21:20</pubDate>
<author><![CDATA[BalachandraReddy Kandukuri, RamaKrishna Paturi, Atanu Rakshit]]></author></item>
<item><title><![CDATA[GridSaaS: A Grid-enabled and SOA-based SaaS Application Platform]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=2399</link>
<description><![CDATA[This paper introduces a grid-enabled and SOA-based SaaS application platform, which is named GridSaaS. The major contributions of the GridSaaS platform are: (1) construction of a value-added supply chain of SaaS applications; (2) adoption of grid technologies to deliver SaaS applications in high level maturity model; (3) rapid development and delivery of new SaaS applications; (4) well-designed solutions for the requirements of integration in UI layer, process layer and data layer.<div></div><div></div>]]></description>
<pubDate>9/30/2009 02:11</pubDate>
<author><![CDATA[Yong Zhang, Shijun Liu]]></author></item>
<item><title><![CDATA[Mobility Management for Seamless flow of Real Time Information in Heterogeneous Networks]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=2400</link>
<description><![CDATA[Today&amp;rsquo;s Industrial growth mainly depends on the real time and on line information rather than stored data. It is a challenging one for the communication industry to provide the required information continuously without delay. As the communication industry is considered the major factor is the interconnection between the different networks and the cooperation between the service providers in the form of QoS. The major issue is the mobility management (MM) to provide and maintain connectivity between the different networks. Here in this paper an approach is proposed for MM based on the session management, location management[4][9] which are common to any type of network. By considering and having the control over the common control management techniques the flow of information is maintained without/ with delay based on the services offered ie., either online service or offline service. Moreover the proposed work also concentrates on the allocation of the transmission channel is purely based on the type of information transmission applications involved such as data, voice, voice &amp;amp; data, multimedia information, video images[1] [2], real time video applications etc. Based on the type of application and also the network and the service provider a common procedure is being followed so as to provide a seamless transmission. <div align="center"><a href="uploadfiles/2009/VIDEO/SCC-0072/SCC-0072.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/2009\PPT\SCC-0072.ppt.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>10/22/2009 23:34</pubDate>
<author><![CDATA[Adiline Macriga, P. Anandha Kumar]]></author></item>
<item><title><![CDATA[Agent with Rule Engine: The Glue for Web Service Oriented Computing applied to Network Management]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=2401</link>
<description><![CDATA[Service Oriented Computing (SOC) is the fast emerging successor of the Object Oriented Computing design paradigm. Web Services technology, which is considered as an implementation of the SOC model, has had an incredible acceptance but tumultuous growth. This apparent chaos is due to its inherent lack of flexible cooperation strategies, generic service model and weak semantic description, mainly when deployed for Enterprise Applications with distributed computing transactions. Agent Based Web Services (AWS) is an appropriate approach to implement the Enterprise- Agent Design Model, which aims to overcome these inherent limitations of Web Services. In this paper, we report our ongoing efforts to use AWS in a Network Management System (NMS) we have built. Our NMS employs both SNMP and Mobile Agents (Aglets). We are developing an intelligent software agent, which is integrated with the Drools Rule Engine so that appropriate rules are triggered when predefined events occur. Our work is a novel approach covering a multitude of technologies such as SOC, AWS, Rule Engine, SNMP and Mobile Agents, with our Software Agent acting as a &amp;lsquo;glue&amp;rsquo; imbibing this synergy. <div align="center"><a href="uploadfiles/2009/VIDEO/SCC-0073/SCC-0073.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/2009\PPT\SCC-0073.ppt.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>10/22/2009 23:39</pubDate>
<author><![CDATA[Mydhili Nair, Shishir Kakaraddi, Keerthi Ramanarayan, Gopalakrishna V]]></author></item>
<item><title><![CDATA[Context Aware Middleware Architecture for Wireless Sensor Network]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=2402</link>
<description><![CDATA[Wireless sensor networks are application specific, data centric networks where different applications run on deployed network. Each application interprets the underlying sensor network differently and each changing event has different effect on running applications. In this paper we have proposed context aware middleware architecture called as &amp;lsquo;MidSen&amp;rsquo;. This architecture bridges the gap between multiple applications running at application level and deployed sensor networks. MidSen architecture handles static as well as dynamically changing network and application components. MidSen has adopted a rule based engine to handle system dynamics. Midsen makes applications flexible by allowing them to update their rules against knowledge base. Our experimental results show that proposed Context Aware Service Discovery (CASD) algorithm gives better recall value and precision compare to previously proposed discovery algorithms. <div align="center"><a href="uploadfiles/2009/VIDEO/SCC-0074/SCC-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/2009\PPT\SCC-0074.ppt.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2009\PDF\SCC-0074.pdf.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>12/09/2009 21:28</pubDate>
<author><![CDATA[Pankesh Patel,Sunil Jardosh,Sanjay chaudhary,Parabhat Ranjan]]></author></item>
<item><title><![CDATA[Towards an Agent-Based Simulation of Hospital Emergency Departments]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=2403</link>
<description><![CDATA[Hospital emergency departments are complex systems, characterised by uncertainty and variability, often operating with limited resources and high demands. Simulations of these departments have proven to be efficient tools in improving their performance in certain circumstances, however the human aspect is often overlooked in the application of modelling and simulation to this field. This paper describes an ongoing project which is applying agent-based modeling techniques to the simulation of hospital emergency departments. The work performed so far, including system analysis and a preliminary model, are shown and the advantages of this technique explored.1 <div align="center"><a href="uploadfiles/2009/VIDEO/SCC-0075/SCC-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/2009\PDF\SCC-0075.pdf.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>10/23/2009 02:24</pubDate>
<author><![CDATA[Hayden Stainsby, Manel Taboada,Emilio Luque]]></author></item>
<item><title><![CDATA[Ensuring Quality of Services at Runtime - A Case Study]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=2404</link>
<description><![CDATA[Designing the Qualities of Services (QoS) and verifying their ensuring at runtime are key issues addressed by today information systems. In this paper, we present our solution to these issues through a case study related to the provisioning of media streaming services. Our approach is based on the main concepts of the Service Oriented Architecture and exploits the Service Level Agreements to express QoS and adaptive mechanisms to monitor and change QoS at runtime.<div></div><div></div>]]></description>
<pubDate>9/30/2009 02:15</pubDate>
<author><![CDATA[Claudia Raibulet, Marco Massarelli, Daniele Cammareri, Nicolo Perino]]></author></item>
<item><title><![CDATA[Cloud Computing and Service Oriented Architecture]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=2405</link>
<description><![CDATA[Cloud is emerging as a phenomenon and it is happening at the confluence of several trends in the software industry. Service oriented architectures; virtualization and internet based application delivery have all matured over past several years. Cloud is a major next step in this area. Cloud computing allows various tasks to be executed over a network using various services. Different types of services including infrastructure as a service, platform as a service, software as service have been proposed for cloud computing. Some of the benefits of cloud computing include reduced cost, scalability, better performance, service oriented and availability of agile application development. There are many types of cloud computing services available from various vendors. Computational cloud services provide on demand commuting resources that are scalable, inexpensive and can run any type of application. Storage cloud services all clients to store their large datasets on provider&amp;rsquo;s storage banks. Application cloud allows access to many services that a developer can integrate to build their application. There is still a debate about what the cloud is and how it changes things. Are there many clouds? Is SaaS the same thing as cloud? The debate is still going on and several definitions of what cloud is and what it means are emerging as the IT providers are getting ready to make the cloud concept real. Technologically, cloud is a very large scale, elastic IT infrastructure that a business can adopt on its own terms. While talking about cloud it is important to note a few things: first the cloud forms a foundation for business relationships and inter-relationship between consumers and providers, next cloud is elastic and it can grow and shrink for a consumer according to their needs and last but not the least, cloud follows payas- you-use model. While a cloud may be defined as many things it helps to think about cloud as an abstraction for establishing business partnerships through services integration. There is one cloud not many and services are delivered in the cloud by the providers and consumers consume these services. Service level agreements (SLAs) are a way to ensure availability, scalability and performance for consumers who are willing to give up system level control of their applications and would trust platform service providers in the cloud for their critical infrastructure. It is very critical to understand that services in the cloud do not necessarily eliminate needs for in-house data centers. Cloud services (especially Platform as a service in the cloud) provide a new set of options to choose from. It is quite likely that as the services become robust and reliable in a cloud, users may benefit from moving all their applications in the cloud but a lot is yet to be proven. Another important observation to make is that cloud based services are gradually appearing and over time it will become a viable platform but the change will take place gradually not over night. The goal of the tutorial is to provide detailed understanding of cloud computing framework and its relation to service oriented architecture. This will include discussion on core concepts of virtualization, types of cloud computing services, and some of the commercial services available from various vendors. The tutorial will include demonstration and sample case studies from Azure cloud computing environment. Brief organization of tutorial is given below: High Level Tutorial Outline: &amp;bull;Introduction to Cloud computing &amp;bull;Understanding the impact &amp;bull;Doing business in the cloud &amp;bull;Cloud computing: Technologies Under the Hood &amp;bull;Types of Cloud Services &amp;bull;How to be a provider of cloud services &amp;bull;Consuming cloud services &amp;bull;Cloud computing case studies with code &amp;bull;Challenges for cloud computing &amp;bull;What to expect going forward <div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2009\PPT\Congress2009-1006.ppt.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>12/09/2009 00:50</pubDate>
<author><![CDATA[Anup Kumar]]></author></item>
<item><title><![CDATA[Ubiquitous, Inter-organizational, P2P Workflows for Enterprise, Business Process Automation]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=2406</link>
<description><![CDATA[This tutorial first provides background on RESTful Web services, and composition languages like WS-BPEL. Technical challenges in specifying and coordinating distributed, data-oriented, embedded workflows for business process automation are outlined next. Existing solutions for modeling document-centric workflows, composing inter-organizational business processes and choreographing embedded web services are reviewed afterwards. The session concludes with a summary of reviewed state-of-the-art and future research directions for overcoming issues like data heterogeneity, security / privacy and constrained footprint. We summarize below background/challenges/solutions for a flavor of tutorial topics. Technical Challenges: While the first-generation, mobile applications were based on fixed interfaces with well-known service points which nomadic device connect to, emergence of mobile commerce requires dynamic association of devices/users with services in local environments. Such transient usage pattern presents tremendous information modeling challenges w.r.t workflow context and I/O relationships between various workflow tasks. Also, security constraints of component Web services allow only pair-wise interaction without any coordinating third-party entity and centralized workflows suffer from issues pertaining to performance, scalability and fault-tolerance as well as deployment difficulties on footprint-constrained ubiquitous devices. Existing Solutions (Modeling document-centric workflows): Document-centered collaboration exposes workflow state as a set of documents that can be operated on with existing tools transparent to users whereas computation attached to the document enforces workflow coordination constraints. An extensive tooling platform/client modules, which work with self-describing data and handle records at run-time, enables RESTful e-commerce services that are accessed by ubiquitous, mobile devices. BPEL4REST natively supports the composition of light-weight services augmenting the concept of a business process with notion of a resource. GUI-based toolkits make it easy for users to discover, compose, invoke and publish atomic/composite services thereby enabling graphical creation of workflows in a transparent manner and save them as BPEL processes. Composing inter-organizational business processes: Declarative composition of Web services through state charts and data conversion rules are translated into XML documents which can be interpreted by P2P interconnected software components to provision the distributed workflow without requiring a central authority. The innovative execution model specifies how partner process instances across enterprises are made aware of peer progress through messages for synchronization/data exchange with management at the process rather than conversation level. This model enforces inter-task dependencies without incurring a significant communication cost through: a light-weight component called workflow stub which attaches to an agent located at each peer organization; disjoint partitions called self-describing workflows with sufficient information to be executed by the local agent. Choreographing embedded web services: Lightweight coordination component with minimal footprint on each peer node allows these workflows to be executed even on a handheld device and empowers stateless Web services into self-coordinating stateful entities interlinked through workflow primitives. Active ECA rules governing the behavior of individual devices are executed in a decentralized fashion thereby resulting in scalable/light-weight implementation of message communication based on events. An innovative BPM agent framework, wherein a document is encapsulated as a mobile agent that handles the business activity and can trace/monitor the business document, reduces network loading and makes the communication between agents more flexible.<div></div><div></div>]]></description>
<pubDate>9/30/2009 02:18</pubDate>
<author><![CDATA[Chelliah Muthusamy]]></author></item>
<item><title><![CDATA[Enterprise Mashups enabled by Data Dissemination Middleware]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=2407</link>
<description><![CDATA[The tutorial first provides background on RESTful Web services, syndication standards and mashups basics. Technical challenges in casually combining available data sources in a user-friendly manner are outlined next. Existing solutions for opening data feeds deeply buried in enterprise repositories, combining them in an intuitive fashion with off-the-shelf toolkits and realizing interesting situational applications are reviewed afterwards. The session concludes with a summary of reviewed state-of-the-art and future research directions for overcoming issues like data heterogeneity, security / privacy and ease of use. We summarize below background/challenges/solutions for a flavor of tutorial topics. Background: Phenomenal increase of enterprise data in the past decade has necessitated powerful integration solutions which go beyond enabling simple data exchange. Moreover, a lot of semi-structured data and services is available on the web today to accomplish a goal within or outside of enterprises. End user however cannot anticipate which data sources or how they need to be integrated or displayed. Even if a specialpurpose application is developed through labor-intensive programming, users would still want to tailor it for their own needs. Mashups however move data closer to point of use and thus differ from traditional integration techniques wherein owners connect data in planned/structured fashion. Compared to developer-centric composition technologies (e.g., BPEL), mashups provide a flexible/easy-to-use way for drawing upon content retrieved from external data sources to create entirely new services. Key problem faced today in creating mashups though is the programming expertise necessary in areas like databases, HTML, web crawling and pattern matching. Also, users need to understand various web services and installation of web application environments. Existing Solutions (Data Service Platforms): A prototype information broker uses SaaS model to collect/integrate diverse patient data from autonomous healthcare agencies while respecting individual/organization privacy constraints. A similar service for integrated access to a huge amount of hydrological information from a collection of heterogeneous data sources exists as well. A middleware platform provides a declarative foundation for building generic services that need to compose information from a range of enterprise data sources. A comprehensive data architecture strategy tackles with inconsistencies/redundancies in enterprise data storage mechanisms; there is still a need for presentation-oriented services which data aggregators could use for dynamic generation of content from the same base XML data. Mashup Toolkits: Existing mashup enablement solutions alternatively adopt two fundamentally different approaches for data integration: mashing external content while browsing; programming activity in visual environment can be further subdivided on the basis of data flow support; wizards which help the user pass through several screens and enter required data; drag/drop of functional modules from a list on the canvas and linking those blocks together. A mashup framework pioneered value-add services (e.g., query generation, iterative refinement and online matching) as well as script-based development necessary for complex, dynamic, data integration mashups. Most of the readily available mashup toolkits do not deal with enterprise data sources unlike a few emerging research prototypes described next. Enterprise Situational Applications: A light-weight enterprise data integration engine advocates a data model/primitive operators and an abstraction built on the model for combining, filtering and transforming enterprise data feeds. An AJAX-based Web 2.0 application allows the user to combine unstructured information from the web with structured business content from an enterprise system. Its light-weight composition platform enables a user to create information mashups without needing cumbersome development. <div align="center"><a href="uploadfiles/2009/VIDEO/Congress2009-1008/Congress2009-1008.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/2009\PPT\Congress2009-1008.ppt.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>12/03/2009 03:27</pubDate>
<author><![CDATA[Chelliah Muthusamy]]></author></item>
<item><title><![CDATA[Assessing the Robustness and Security of Web Services: State-of-the-art and Research Opportunities]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=2408</link>
<description><![CDATA[Developing robust and non-vulnerable web services is a difficult task. Field studies show that a large number of web services are deployed with robustness problems (i.e., presenting unexpected behaviors in the presence of invalid inputs) and/or security flaws (e.g., having code injection vulnerabilities). Several techniques for the identification of robustness problems and security vulnerabilities have been proposed in the past, including both blackbox (e.g., robustness testing, penetration testing) and white-box (e.g., code inspection, static code analysis) approaches. Software faults (i.e., program defects or bugs) are recognized as the major cause of computer system failures. Interface faults, related to problems in the interaction among software components/modules [33], are particularly relevant in service-oriented environments. In fact, web services must provide a robust and non-vulnerable interface to the client applications, even in the presence of invalid inputs, which may occur due to bugs in the client applications, corruptions caused by silent network failures, or even security attacks (web services are so widely exposed that any existing security vulnerability will most probably be uncovered and exploited by hackers). This way, it is clear that web service developers urge the definition of tools that help them identifying robustness and security issues. These tools have to be of easy use and as much automated as possible. In this tutorial we will present different approaches and tools for the evaluation of robustness and security of web services, ranging form blackbox approaches (e.g., robustness testing, penetration testing) to white-box approaches (e.g., code inspection, static code analysis, vulnerability injection). The tutorial will address both current research topics and industry practice. Several case studies will be presented and used to demonstrate the effectiveness of existing tools. Future research opportunities will be identified and discussed. The intended audience is researchers and practitioners interested in learning the state-of-theart on techniques and tools to assess and compare the robustness and security of web services.<div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2009\PPT\Congress2009-1009.ppt.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>10/10/2009 05:03</pubDate>
<author><![CDATA[Marco Vieira]]></author></item>
<item><title><![CDATA[Cloud Annexation & Security 2.0]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=2409</link>
<description><![CDATA[Security is the final frontier of the Cloud Computing model. While Cloud Computing has become the main delivery platform, and most enterprise applications have been Cloud enabled, the weakest link is the Trust element. This session will discuss in detail‐ , how the technical foundations of Cloud Computing, including Service-Oriented Architecture and Virtualization, are leveraged to deliver on the promise of hosted computing. Step 1 is to understand the techniques of Cloud Computing for sharing resources in the cloud value chain. Step 2 is to implement these elements into the framework in a scalable yet cost‐effective way. In this session you will also learn the barriers to entry to Cloud Computing in terms of security. Also, discuss the infrastructure (e.g. hardware, IT infrastructure management), software cloud (e.g. SaaS focusing on middleware as a service), application cloud (e.g. modeling tools as a service, social network as a service), and business cloud (e.g. business process as a service). As the Cloud Computing model proliferates, it will experience threats. The currency of countermeasures will be difficult and expensive for maintaining endpoint security and enforcing security across the Cloud fabric. While traditional endpoint security tools may protect organizations from external threats by enforcing security policies, the main driver would be to invent algorithms that can do predictive risk analysis with a high degree of reliability and trust. In this session you will learn about detective, preventive and corrective controls in the Cloud Computing model that ought to be implemented in layers using a combination of open source as well as proprietary tools to protect the business assets at the edge of the network in concert with the hub of the enterprise. Thanks to the Cloud, the line between the endpoint and the enterprise has blurred, and therefore it calls for a different kind of approach to secure the Cloud with trustworthy computing model.<div></div><div></div>]]></description>
<pubDate>9/30/2009 02:24</pubDate>
<author><![CDATA[Dipto Chakravarty]]></author></item>
<item><title><![CDATA[Past, Present & Future: Advances in IT and the Practice of Services]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=2413</link>
<description><![CDATA[The last few decades have seen unprecedented advances in technology and specifically in the domain of Information Technology. IT has also become inseparable from the business itself and has also started to move up the business value chain. If the past were to be any indication of the future, the scale of such advances and innovation is expected to continue at more rapid pace. IT Services has significantly morphed and matured with this explosion of technologies and related innovation. Maturation of Service Oriented Architecture, Platform Independent Models, Model Driven Development, dynamic composition of services, standardization of industry services, development of industry specific IT components, newer delivery models enabled by the cloud, etc. &amp;ndash; the list goes on.<div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2009\PPT\Congress2009-1003.ppt.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>11/23/2009 22:54</pubDate>
<author><![CDATA[Ray Harishankar]]></author></item>
</Channel>
</rss>