<?xml version="1.0" encoding="utf-8"?>
<rss version="2.0">
<Channel>
<language>en-us</language>
<title>SERVICES 2007</title>
<link>http://www.servicescomputing.tv/rss/view/rssFeed.php?category=20</link>
<description>SERVICES 2007 all articles</description>
<item><title><![CDATA[Interaction and Potential Synergy between Commercial and Governmental Web Services - a Case Study]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1484</link>
<description><![CDATA[<p>Recent progress in the field of Web services has resulted in deployment of a  significant number of Web services. Furthermore, it is expected that the number  of available Web services will constantly grow in the following years. Due to  the high number of available Web services, it is a hard task for developers and  business analysts to choose which Web services are most suitable for  integration.</p> <p>However, despite the increased academic and commercial interest to Web  services, there is currently no survey available analysing most relevant Web  services. Moreover, to the best of our knowledge, there is no publicly available  study analysing the structure and potential synergy between commercial and  governmental Web services.</p> <p>In this paper we target these shortcomings by providing a case study of  automated Web service composition for semantically annotated commercial and  governmental Web services. We propose a method for identifying most  applicableWeb services and demonstrate it on a case study.We also analyse  interaction and potential synergy between commercial and governmental Web  services.</p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/services/2007/2926/00/29260001.pdf&amp;amp;T=Interaction%20and%20Potential%20Synergy%20between%20Commercial%20and%20Governmental%20Web%20Services%20-%20a%20Case%20Study"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br /> </p>   <div align="center"> <a href="uploadfiles/2007/video/SERVICES2007-9001/SERVICES2007-9001.html" target="_blank"><strong> &amp;gt;&amp;gt;&amp;gt; View Video</strong></a> </div>  <div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2007\PDF\SERVICES2007-9001.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2007\MP3\SERVICES2007-9001.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>9/29/2007 23:58</pubDate>
<author><![CDATA[Peep Kungas,Mihhail Matskin]]></author></item>
<item><title><![CDATA[Modeling and Analysis of Performance Oriented and Revenue Based Admission Control Framework for Service Providers]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1485</link>
<description><![CDATA[<p>In our earlier work, competitive Web Services market was proposed to address the  hierarchical structure of large scale service systems. To better reflect the  business reality, we model this system using finite capacity queues. To give the  service provider more flexibility in controlling the priority level of incoming  requests, we propose a performance oriented management architecture based on  admission controller in this paper. Moreover, we study the design of an adaptive  admission controller based on Markov decision processes and investigate the  stationary policy based on different performance requirements. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/services/2007/2926/00/29260009.pdf&amp;amp;T=Modeling%20and%20Analysis%20of%20Performance%20Oriented%20and%20Revenue%20Based%20Admission%20Control%20Framework%20for%20Service%20Providers"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br /> </p>     <div align="center"> <a href="uploadfiles/2007/video/SERVICES2007-9002/SERVICES2007-9002.html" target="_blank"><strong> &amp;gt;&amp;gt;&amp;gt; View Video</strong></a> </div>  <div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2007\PDF\SERVICES2007-9002.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2007\MP3\SERVICES2007-9002.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>9/30/2007 00:01</pubDate>
<author><![CDATA[Shuxing Cheng,Carl K. Chang,Liang-Jie Zhang]]></author></item>
<item><title><![CDATA[A Policy Driven Authorization Control Framework for Business Collaboration]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1486</link>
<description><![CDATA[<p>Business collaboration is about coordinating the flow of information among  organizations and linking their business processes. However unique and  challenging security issues concerning business collaboration in the context of  SOC have arisen because of its dynamic and loosely coupling nature. In this  paper we firstly identify elements for security policy specification. We then  discuss different types of collaboration patterns based on which rules for  security policy integration can be developed. A framework is developed for  handling authorization control for business collaboration. The discussion in the  paper is based on the collaboration scenarios in health care. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/services/2007/2926/00/29260017.pdf&amp;amp;T=A%20Policy%20Driven%20Authorization%20Control%20Framework%20for%20Business%20Collaboration"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br /> </p>    <div align="center"> <a href="uploadfiles/2007/video/SERVICES2007-9003/SERVICES2007-9003.html" target="_blank"><strong> &amp;gt;&amp;gt;&amp;gt; View Video</strong></a> </div>  <div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2007\PDF\SERVICES2007-9003.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2007\MP3\SERVICES2007-9003.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>9/30/2007 00:02</pubDate>
<author><![CDATA[Daisy Daiqin He,Jian Yang]]></author></item>
<item><title><![CDATA[A Service Architecture for Context Awareness and Reaction Provisioning]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1487</link>
<description><![CDATA[<p>Context awareness has emerged as an important element in distributed computing.  It offers mechanisms allowing applications to be aware of their environment and  enabling them to adjust their behavior to the current context. In order to keep  track of the relevant context information, a flexible service mechanism should  be available for the client applications. In this paper we present a service  architecture to provide contextawareness capabilities to users and client  applications. Moreover, the service is able to react depending on the user&amp;rsquo;s  preferences and context. The conditions for the reaction and the reaction itself  are defined in rules the users submit to the service by means of a convenient  rule language. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/services/2007/2926/00/29260025.pdf&amp;amp;T=A%20Service%20Architecture%20for%20Context%20Awareness%20and%20Reaction%20Provisioning"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br /> </p>    <div align="center"> <a href="uploadfiles/2007/video/SERVICES2007-9004/SERVICES2007-9004.html" target="_blank"><strong> &amp;gt;&amp;gt;&amp;gt; View Video</strong></a> </div>  <div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2007\PDF\SERVICES2007-9004.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2007\MP3\SERVICES2007-9004.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>9/30/2007 00:03</pubDate>
<author><![CDATA[Luiz Olavo Bonino da Silva Santos,Fano Ramparany,Patricia Dockhorn Costa,Peter Vink,Richard Etter,Tom Broens]]></author></item>
<item><title><![CDATA[Compliance Proofs for Collaborative Interactions using Aspect-Oriented Approach]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1488</link>
<description><![CDATA[<p>Service Oriented Architecture approach in general and the Web services  technology in particular play significant role in modern collaborative  environments. However, it is not enough to have the business functionality of  the partners packaged as (Web) services; there is also a need for  business-aligned order of interaction between these services (business  protocols). Furthermore, it is necessary to guarantee that these protocols are  enacted in compliance with the effective policies and regulations. This paper  discusses business protocol compliance issues and suggests some techniques for  enhancement of business protocols for better compliance. Such enhancements, for  example, can support the proposed structured proof of compliance concept and its  construction mechanism, which together address the issues of both correct course  of collaboration at its critical steps and existence of a tangible proof of  correctness of the whole collaborative interaction. Such proof, consisting of  individually signed and time-stamped evidence statements, can serve for various  audit purposes and, if necessary, in the court of law. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/services/2007/2926/00/29260033.pdf&amp;amp;T=Compliance%20Proofs%20for%20Collaborative%20Interactions%20using%20Aspect-Oriented%20Approach"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br /> </p>    <div align="center"> <a href="uploadfiles/2007/video/SERVICES2007-9005/SERVICES2007-9005.html" target="_blank"><strong> &amp;gt;&amp;gt;&amp;gt; View Video</strong></a> </div>  <div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2007\PDF\SERVICES2007-9005.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2007\MP3\SERVICES2007-9005.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>9/29/2007 23:59</pubDate>
<author><![CDATA[Adomas Svirskas,Carine Courbis,Refik Molva,Justinas Bedzinskas]]></author></item>
<item><title><![CDATA[A Ranking Mechanism for SemanticWeb Service Discovery]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1489</link>
<description><![CDATA[<p>This paper presents an approach for ranking semantic Web service advertisements  with respect to a service request. The use of recall and precision is proposed  as suitable measures for determining the degree of match between the request and  the advertisement. Ranking is based on the use of the domain ontology to infer  the semantic similarity between the parameters of the request and the  advertisement. The proposed approach is applicable to several types of  ontologies, ranging from simple taxonomies to highly expressive ontologies, such  as OWL ontologies. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/services/2007/2926/00/29260041.pdf&amp;amp;T=A%20Ranking%20Mechanism%20for%20SemanticWeb%20Service%20Discovery"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br /> </p>    <div align="center"> <a href="uploadfiles/2007/video/SERVICES2007-9006/SERVICES2007-9006.html" target="_blank"><strong> &amp;gt;&amp;gt;&amp;gt; View Video</strong></a> </div><div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2007\PDF\SERVICES2007-9006.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2007\MP3\SERVICES2007-9006.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>9/30/2007 01:45</pubDate>
<author><![CDATA[Dimitrios Skoutas,Alkis Simitsis,Timos Sellis]]></author></item>
<item><title><![CDATA[A Statechart-Based Model for the Semantic Composition of Web Services]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1490</link>
<description><![CDATA[<p>In this paper, we present a semantic web services composition framework based on  a distributed architecture and on semantic and uniform basedontology service  descriptions. Central to our work is the use of the concept of community of  services. Community constitutes a unified, homogeneous and consistent access  interface to existing and heterogeneous eservices which propose similar  functionalities for services belonging to this community. Moreover, based on  OWL-S language, our framework supports a rich expressivity in services and user  constraints descriptions. It takes into account the nondeterministic behaviors  of e-services instances, in particular when their internal state cannot be  predicted in advance. In our framework, we use an operational semantic given par  Statecharts formalism to make composition execution strategies  model. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/services/2007/2926/00/29260049.pdf&amp;amp;T=A%20Statechart-Based%20Model%20for%20the%20Semantic%20Composition%20of%20Web%20Services"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br /> </p>  <div align="center"> <a href="uploadfiles/2007/video/SERVICES2007-9007/SERVICES2007-9007.html" target="_blank"><strong> &amp;gt;&amp;gt;&amp;gt; View Video</strong></a> </div><div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2007\PDF\SERVICES2007-9007.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2007\MP3\SERVICES2007-9007.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>9/30/2007 01:48</pubDate>
<author><![CDATA[Youssef Gamha,Nacéra Bennacer,Lotfi Ben Romdhane,Guy Vidal-Naquet,Bechir Ayeb]]></author></item>
<item><title><![CDATA[Exchanging Policies between Web Service Entities using Rule Languages]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1491</link>
<description><![CDATA[<p>Web rule languages with the ability to cover various types of rules have been  recently emerged to make interactions between web resources and broker agents  possible. The chance of describing resources and users of a domain through the  use of vocabularies is another feature of Web rule languages. Combination of  these two properties makes Web rule languages an appropriate medium to make a  hybrid model of representing both contexts and rules of a policy-aware system,  such as a web service. In this paper, we describe how REWERSE Rule Markup  Language (R2ML) can be employed to bridge between different policy languages  using its rich set of rules, vocabulary, and built-in constructs. We show how  the concepts of the KAoS and Rei policy languages can be transformed to R2ML and  then from R2ML to the other policy languages. Following these mappings, we have  implemented transformers, which enable us not only to share policies between  KAoS and Rei, but also to transform policies onto other rule languages (e.g.,  F-Logic) for which transformations from/to R2ML are already  developed. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/services/2007/2926/00/29260057.pdf&amp;amp;T=Exchanging%20Policies%20between%20Web%20Service%20Entities%20using%20Rule%20Languages"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br /> </p>   <div align="center"> <a href="uploadfiles/2007/video/SERVICES2007-9008/SERVICES2007-9008.html" target="_blank"><strong> &amp;gt;&amp;gt;&amp;gt; View Video</strong></a> </div><div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2007\PDF\SERVICES2007-9008.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2007\MP3\SERVICES2007-9008.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>9/30/2007 01:49</pubDate>
<author><![CDATA[Nima Kaviani,Dragan Gasevic,Marek Hatala,Gerd Wagner,Ty Mey Eap]]></author></item>
<item><title><![CDATA[Web Service Composition via Problem Decomposition Across Multiple Ontologies]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1492</link>
<description><![CDATA[<p>Web service composition (WSC) problems involve using domain knowledge about  the underlying problem domains during the composition process. Existing research  on Web service composition procedures has generally assumed that this domain  knowledge is encoded as a single ontology that must be provided as an input to a  composition procedure. In composition problems that span over knowledge across  multiple ontologies that are connected via concept inheritence/ extension, the  users must examine the available ontologies and services in order to decide for  the extent of the domain knowledge and the set of services relevant to their  composition problems in hand.</p> <p>In this paper, we describe an automated way to generate solutions for service  composition problems that span over multiple ontologies that have similar but  not exactly the same structure. Our approach is based on a Hierarchical Task  Network (HTN) planning model and extends the HTN-DL framework. This HTN planning  model allows ontological problem decomposition in order to evaluate structural  properties that span across multiple ontologies that are relevant to an input  composition problem. We present a demonstration of the advantages of this  approach.</p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/services/2007/2926/00/29260065.pdf&amp;amp;T=Web%20Service%20Composition%20via%20Problem%20Decomposition%20Across%20Multiple%20Ontologies"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br /> </p>   <div align="center"> <a href="uploadfiles/2007/video/SERVICES2007-9009/SERVICES2007-9009.html" target="_blank"><strong> &amp;gt;&amp;gt;&amp;gt; View Video</strong></a> </div><div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2007\PDF\SERVICES2007-9009.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2007\MP3\SERVICES2007-9009.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>9/30/2007 01:45</pubDate>
<author><![CDATA[Naiwen Lin,Ugur Kuter,James Hendler]]></author></item>
<item><title><![CDATA[Bringing Web Principles to Services: Ontology-BasedWeb Services]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1493</link>
<description><![CDATA[<p>Researchers are beginning to realize the potential of web services that can use  the web as a place for information publication and access as opposed to the  traditional webservices paradigm that merely uses the web as a transport medium.  Traditional web services can be difficult to discover, can have complex  invocation APIs, and require strong coupling between communicating applications.  In previous work, we presented ontology-based techniques in which users make  service requests using free-form, naturallanguage- like specifications. This  paper shows how we can use these ontological techniques to automatically create  ontology-based web services that (1) are easy for software agents to discover  because they are created based on machine-processable formalisms (ontologies),  (2) have invocation APIs requiring only simple read and write operations, and  (3) require no a priori agreements regarding types and data formats between  communicating applications. Experiments with our prototype implementation in  several domains show that our approach can effectively create web services with  these characteristics. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/services/2007/2926/00/29260073.pdf&amp;amp;T=Bringing%20Web%20Principles%20to%20Services:%20Ontology-BasedWeb%20Services"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br /> </p>   <div align="center"> <a href="uploadfiles/2007/video/SERVICES2007-9010/SERVICES2007-9010.html" target="_blank"><strong> &amp;gt;&amp;gt;&amp;gt; View Video</strong></a> </div><div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2007\PDF\SERVICES2007-9010.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2007\MP3\SERVICES2007-9010.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>9/30/2007 01:50</pubDate>
<author><![CDATA[Muhammed J. Al-Muhammed,David W. Embley,Stephen W. Liddle,Yuri A. Tijerino]]></author></item>
<item><title><![CDATA[Semantic Web for the Life Sciences - Hype, Why, How and Use Case for AIDS Inhibitors]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1496</link>
<description><![CDATA[<p>One of the difficulty in applying the concepts of Semantic Web technology to a  drug discovery is the creation of a software generated URI suitable both for  ontology independent and ontology dependent properties of drugs. We propose the  use of two types of URI; structure invariants (URI) to identify the ontology  independent features and structure semi-invariants (OURI) to identify ontology  dependent features. URI are defined by the most fundamental properties (chemical  connectivity, bond type, etc.). OURI are defined from context dependent  (semantic) properties (binding mode, chemical core). </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/services/2007/2926/00/29260087.pdf&amp;amp;T=Semantic%20Web%20for%20the%20Life%20Sciences%20-%20Hype,%20Why,%20How%20and%20Use%20Case%20for%20AIDS%20Inhibitors"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br /> </p>  <div align="center"> <a href="uploadfiles/2007/video/SERVICES2007-9012/SERVICES2007-9012.html" target="_blank"><strong> &amp;gt;&amp;gt;&amp;gt; View Video</strong></a> </div><div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2007\PDF\SERVICES2007-9012.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2007\MP3\SERVICES2007-9012.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>9/30/2007 01:52</pubDate>
<author><![CDATA[Bhat T.Narayana,Barkley,John]]></author></item>
<item><title><![CDATA[Bluejay: A Highly Scalable and Integrative Visual Environment for Genome Exploration]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1497</link>
<description><![CDATA[<p>Many questions that biologists want to answer using the information available  from completely sequenced genomes are complex. A graphical environment allows  users to visually explore and operate on a sequence. Sequence and annotation  data exists in bewildering varieties of types and levels of detail. The  graphical environment therefore needs to adapt to this variation to provide the  user the best possible visual representation of genomic data in a given context.  As more and more online tools and services become available for biologists,  mediating software should also be able to integrate and link to them. The  Bluejay browser is a Java-based visual environment for exploring biological  sequences. Uniquely, Bluejay fully integrates existing gene expression software  into a genomic context. Bluejay also differentiates itself from most form-based  HTML sequence browsers because it: (i) is highly scalable so that it can  visualize a wide range of genomic objects ranging from a large whole genome down  to individual nucleotides by using data-transformational Web services; and (ii)  dynamically discovers and provides links to disparate resources such as gene  annotation data (via XLinks) and semantically-described biological Web Services  (via the BioMOBY protocol). </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/services/2007/2926/00/29260092.pdf&amp;amp;T=Bluejay:%20A%20Highly%20Scalable%20and%20Integrative%20Visual%20Environment%20for%20Genome%20Exploration"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br /> </p>   <div align="center"> <a href="uploadfiles/2007/video/SERVICES2007-9013/SERVICES2007-9013.html" target="_blank"><strong> &amp;gt;&amp;gt;&amp;gt; View Video</strong></a> </div><div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2007\PDF\SERVICES2007-9013.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2007\MP3\SERVICES2007-9013.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>9/30/2007 01:51</pubDate>
<author><![CDATA[Jung Soh,Paul M.K. Gordon,Andrew C. qAh-Seng,Andrei L. Turinsky,Morgan Taschuk,Krzysztof Borowski,Christoph W. Sensen]]></author></item>
<item><title><![CDATA[Web Service decision-making model based on uncertain-but-bounded attributes]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1495</link>
<description><![CDATA[<p>Web services have become one of the most popular technologies of web  application. But the quality of web services is not as stable as traditional  software components&amp;#39; because of the uncertainty of network. Based on  non-probability-set, the convex method is used to judge the range of performance  affected by uncertain-butbounded attributes. This method only requires the  highest and lowest value of the uncertain attribute values and need not to know  their probability distribution. This paper proposes the metric algorithm of the  change of web service quality, and proposes the web service decisionmaking  algorithm based on the theory of multiple attributes decision by TOPSIS  (Technique for Order Preference by Similarity to Idea Solution) in operations  research. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/services/2007/2926/00/29260081.pdf&amp;amp;T=Web%20Service%20decision-making%20model%20based%20on%20uncertain-but-bounded%20attributes"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br /> </p><div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2007\PDF\SERVICES2007-9011.pdf.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>9/05/2007 05:51</pubDate>
<author><![CDATA[Wan Cheng,Wang Hongbing]]></author></item>
<item><title><![CDATA[XOA: Web-Enabled Cross-Ontological Analytics]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1498</link>
<description><![CDATA[<p>We describe the development of the Cross- Ontological Analytics (XOA) system,  which implements a novel web-enabled approach for computing similarities across  gene and gene products with associated specifications of functional genomic  relationships. The XOA system enables biologists to leverage combinations of  hierarchical and associative data across multiple subontologies in order to  reveal relationships between gene and gene products that might not otherwise be  exposed by existing methods of computational analysis. We also provide examples  of specific proof-ofconcept applications in which XOA has been successfully  tested. </p><p> <a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/services/2007/2926/00/29260099.pdf&amp;amp;T=XOA:%20Web-Enabled%20Cross-Ontological%20Analytics"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> </p>  <div align="center"> <a href="uploadfiles/2007/video/SERVICES2007-9014/SERVICES2007-9014.html" target="_blank"><strong> &amp;gt;&amp;gt;&amp;gt; View Video</strong></a> </div><div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2007\PDF\SERVICES2007-9014.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2007\MP3\SERVICES2007-9014.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>9/30/2007 01:54</pubDate>
<author><![CDATA[Roderick M. Riensche,Bob L. Baddeley,Antonio P. Sanfilippo,Christian Posse,Banu Gopalan]]></author></item>
<item><title><![CDATA[Bioinformatics Services Discovery Using Ontology Classification]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1499</link>
<description><![CDATA[<p>The number of available bioinformatics resources is overwhelming. The most  critical issues met by scientists are (1) to identify the resources suitable to  express their protocols, and (2) to compose them in an executable workflow. Many  advanced projects offer solutions to the composition of services in a workflow,  while others address the interoperability of services. We present an approach  that allows the organization of bioinformatics resources in a scientifically  meaningful framework that leverages existing effort on interoperability and  workflow composition and execution. We present ServiceSemanticMap, a system that  allows users to explore the wide availability of bioinformatics resources  organized with respect to an ontology. The user interacts with the system  through a graph-based interface, discovering the resources by exploring the  graph. The system exploits a resource catalog where providers may register their  bioinformatics tools through a Web resource entry form. We demonstrate the  approach with a semantic map devoted to structural bioinformatics. Our approach  is collaborative: a group of experts develop and maintain the ontology, while  providers and users may register new resources. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/services/2007/2926/00/29260106.pdf&amp;amp;T=Bioinformatics%20Services%20Discovery%20Using%20Ontology%20Classification"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br /> </p>  <div align="center"> <a href="uploadfiles/2007/video/SERVICES2007-9015/SERVICES2007-9015.html" target="_blank"><strong> &amp;gt;&amp;gt;&amp;gt; View Video</strong></a> </div><div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2007\PDF\SERVICES2007-9015.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2007\MP3\SERVICES2007-9015.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>9/30/2007 01:51</pubDate>
<author><![CDATA[Herve Menager,Zoe Lacroix,Pierre Tuffery]]></author></item>
<item><title><![CDATA[Development of NeuronBank: A Federation of Customizable Knowledge Bases of Neuronal Circuitry]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1500</link>
<description><![CDATA[<p>Knowledge of neuronal circuitry is foundational to the neurosciences, but no  tools have been developed for cataloguing this knowledge. Part of the problem is  that the concepts used to describe neural circuits are rapidly evolving and vary  substantially across different species. The NeuronBank project  (http://neuronbank.org) is developing an informatics infrastructure for managing  the dynamic, domain-specific knowledge of neural circuitry, providing a  reference source, an outlet for publishing new knowledge, and a useful research  tool. Our solution is a federation of customizable knowledge bases, each  adaptable to store knowledge of the neural circuitry of a single species. The  federation is united by a common set of web services and a central portal that  provides core functionality across various knowledge bases. This  service-oriented architecture provides domain-specific representations of  specialized scientific knowledge while maintaining interoperability across a  broad discipline. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/services/2007/2926/00/29260114.pdf&amp;amp;T=Development%20of%20NeuronBank:%20A%20Federation%20of%20Customizable%20Knowledge%20Bases%20of%20Neuronal%20Circuitry"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br /> </p>  <div align="center"> <a href="uploadfiles/2007/video/SERVICES2007-9016/SERVICES2007-9016.html" target="_blank"><strong> &amp;gt;&amp;gt;&amp;gt; View Video</strong></a> </div><div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2007\PDF\SERVICES2007-9016.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2007\MP3\SERVICES2007-9016.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>9/30/2007 01:55</pubDate>
<author><![CDATA[Robert J. Calin-Jageman,Akshaye Dhawan,Hong Yang,Hsiu-Chung Wang,Hao Tian,Piyaphol Phoungphol,Chad Frederick,Janaka Balasooriya,Yan Chen,Sushil K. Prasad,Raj Sunderraman,Ying Zhu,Paul S. Katz]]></author></item>
<item><title><![CDATA[Infrastructure for Annotation-Driven Information Extraction from the Primary Scientific Literature: Principles and Practice]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1501</link>
<description><![CDATA[<p>We present an informatics infrastructure for biocuration, based on a combination  of techniques from Information Extraction (IE) and Knowledge Engineering (KE).  We describe the high-level design of this infrastructure which we base on the  concept of &amp;lsquo;experimental type&amp;rsquo;. Here, we treat each experiment as a specific  type of knowledge statement determined by the experiment&amp;rsquo;s design. We provide a  preliminary, detailed example of the use of the infrastructure to support the  construction of a database pertaining to neuroanatomical tract-tracing  experiments. This work generalizes to provide support for other experimental  types and could be used to make biocuration efforts more efficient. We also  discuss how the process of annotating text for IE directly supports designing  schema for databases. We envisage how this architecture could support  small-scale, laboratory-centric knowledge bases that each support  service-oriented functionality. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/services/2007/2926/00/29260122.pdf&amp;amp;T=Infrastructure%20for%20Annotation-Driven%20Information%20Extraction%20from%20the%20Primary%20Scientific%20Literature:%20Principles%20and%20Practice"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br /> </p>   <div align="center"> <a href="uploadfiles/2007/video/SERVICES2007-9017/SERVICES2007-9017.html" target="_blank"><strong> &amp;gt;&amp;gt;&amp;gt; View Video</strong></a> </div><div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2007\PDF\SERVICES2007-9017.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2007\MP3\SERVICES2007-9017.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>9/30/2007 01:56</pubDate>
<author><![CDATA[Gully Burns,Donghui Feng,Tommy Ingulfsen,Eduard Hovy]]></author></item>
<item><title><![CDATA[Analysis of a Scientific Protocol: Selecting Suitable Resources]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1502</link>
<description><![CDATA[<p>We analyze a scientific protocol developed to support a service devoted to  alternative splicing analysis. We explain the process of selection of resources  to implement each scientific task and present a methodology for scientific tools  analysis and benchmarking to produce sound and efficient scientific  protocols. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/services/2007/2926/00/29260130.pdf&amp;amp;T=Analysis%20of%20a%20Scientific%20Protocol:%20Selecting%20Suitable%20Resources"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br /> </p>   <div align="center"> <a href="uploadfiles/2007/video/SERVICES2007-9018/SERVICES2007-9018.html" target="_blank"><strong> &amp;gt;&amp;gt;&amp;gt; View Video</strong></a> </div><div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2007\PDF\SERVICES2007-9018.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2007\MP3\SERVICES2007-9018.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>9/30/2007 01:55</pubDate>
<author><![CDATA[ Zoe Lacroix,Christophe Legendre]]></author></item>
<item><title><![CDATA[Data-aware SOA for Gene Expression Analysis Processes]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1503</link>
<description><![CDATA[<p>In the context of genome research, the method of gene expression analysis has  been used for several years. Related microarray experiments are conducted all  over the world, and consequently, a vast amount of microarray data sets are  produced. Having access to this variety of repositories, researchers would like  to incorporate this data in their analyses processes to increase the statistical  significance of their results. Such analyses processes are typical examples of  data-intensive processes. In general, data-intensive processes are characterized  by (i) a sequence of functional operations processing large amount of data and  (ii) the transportation and transformation of huge data sets between the  functional operations. To support data-intensive processes, an efficient and  scalable environment is required, since the performance is a key factor today.  The service-oriented architecture (SOA) is beneficial in this area according to  process orchestration and execution. However, the current realization of SOA  with Web services and BPEL includes some drawbacks with regard to the  performance of the data propagation between Web services. Therefore, we present  in this paper our data-aware service-oriented approach to efficiently support  such data-intensive processes. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/services/2007/2926/00/29260138.pdf&amp;amp;T=Data-aware%20SOA%20for%20Gene%20Expression%20Analysis%20Processes"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br /> </p><div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2007\PDF\SERVICES2007-9019.pdf.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>9/05/2007 06:02</pubDate>
<author><![CDATA[Dirk Habich,Sebastian Richly,Wolfgang Lehner,Uwe Assmann,Mike Grasselt,Albert Maier,Christian Pilarsky]]></author></item>
<item><title><![CDATA[An Approach to Model Cross-organizational Processes using Object Petri net]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1504</link>
<description><![CDATA[<p>Business process modeling is an important topic of enterprise modeling. Modeling  process can help us to define new process, evaluate and improve existing ones.  As the development of Internet and B2B commerce, business partnerships are being  fostered in order to broaden the scope of their market. Business process thus  has been scatted over multiple organizations. At the same time, each participant  of the cooperation has their own private process. So how to define and model  cross-organizational process while keep each participant&amp;rsquo;s autonomy poses new  challenge to us. In this paper, we will focus on two problems:1) How can we  guarantee the private process of each participant is consistent to the  coordination protocol specified by Message Sequence Charts? 2) How can we  formalize the execution of the interaction protocol, which means the execution  of private processes conforms to the interaction protocol? An approach based on  Object Petri net and behavior inheritance will be proposed in this paper to  solve the above two problems. </p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/services/2007/2926/00/29260146.pdf&amp;amp;T=An%20Approach%20to%20Model%20Cross-organizational%20Processes%20using%20Object%20Petri%20net"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2007\PDF\SERVICES2007-9020.pdf.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>9/05/2007 06:02</pubDate>
<author><![CDATA[Qiang Lin,JiDong Ge,Hao Hu,Jian Lu]]></author></item>
<item><title><![CDATA[Continuous SPA: Continuous Assessing and Monitoring Software Process]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1505</link>
<description><![CDATA[<p>In the past ten years many assessment approaches have been proposed to help  manage software process quality. However, few of them are configurable and  real-time in practice. Hence, it is advantageous to find ways to monitor the  current status of software processes and detect the improvement opportunities.  In this paper, we introduce a webbased prototype system (Continuous SPA) on  continuous assessing and monitoring software process, and perform a practical  study in one process area: project management. Our study results are positive  and show that features such as global management, well-defined responsibility  and visualization can be integrated in process assessment to help improve the  software process management. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/services/2007/2926/00/29260153.pdf&amp;amp;T=Continuous%20SPA:%20Continuous%20Assessing%20and%20Monitoring%20Software%20Process"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br /> </p>  <div align="center"> <a href="uploadfiles/2007/video/SERVICES2007-9021/SERVICES2007-9021.html" target="_blank"><strong> &amp;gt;&amp;gt;&amp;gt; View Video</strong></a> </div><div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2007\PDF\SERVICES2007-9021.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2007\MP3\SERVICES2007-9021.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>9/30/2007 02:00</pubDate>
<author><![CDATA[Xian Chen,Paul Sorenson,John Willson]]></author></item>
<item><title><![CDATA[Variation-Oriented Requirements Analysis (VORA)]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1506</link>
<description><![CDATA[<p>One approach to improve the reusability of business process-based solutions  is to represent the business process as a combination of autonomous services via  a service-oriented architecture (SOA) centric style. Such an approach would  represent variations at service and business process level in terms of two key  constructs - variation points (the placeholders in the solution model where  variations can be introduced) and variation features (the actual variations that  can be introduced at a subset of the listed variation points for that  solution).</p> <p>One key research issue that has arisen out of the VOE project is how to  actually identify and subsequently justify these variation points and variation  features based on changed requirements. In this paper we propose our approach  called Variation- Oriented Requirements Analysis (VORA) that addresses this  issue. VORA is based on a traceability model that maps requirements to use  cases, sequence diagrams, business processes and finally service specifications.  We show how this mapping can also be used to (semi-) automatically map  requirement changes down to variation points and variation features at service  and business process level. We also demonstrate VORA via a simple yet realistic  running example.</p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/services/2007/2926/00/29260159.pdf&amp;amp;T=Variation-Oriented%20Requirements%20Analysis%20%28VORA%29"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br /> </p>  <div align="center"> <a href="uploadfiles/2007/video/SERVICES2007-9022/SERVICES2007-9022.html" target="_blank"><strong> &amp;gt;&amp;gt;&amp;gt; View Video</strong></a> </div><div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2007\PDF\SERVICES2007-9022.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2007\MP3\SERVICES2007-9022.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>9/30/2007 02:00</pubDate>
<author><![CDATA[N.C. Narendra,Karthikeyan Ponnalagu]]></author></item>
<item><title><![CDATA[Process Discovery from Model and Text Artefacts]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1507</link>
<description><![CDATA[<p>Modeling is an important and time consuming part of the Business Process  Management life-cycle. An analyst reviews existing documentation and queries  relevant domain experts to construct both mental and concrete models of the  domain. To aid this exercise, we propose the Rapid Business Process Discovery  (R-BPD) framework and prototype tool that can query heterogeneous information  resources (e.g. corporate documentation, web-content, code e.t.c.) and rapidly  construct proto-models to be incrementally adjusted to correctness by an  analyst. This constitutes a departure from building and constructing models  toward just editing them. We believe this rapid mixed-initiative modeling will  increase analyst productivity by significant orders of magnitude over  traditional approaches. Furthermore, the possibility of using the approach in  distributed and real-time settings seems appealing and may help in significantly  improving the quality of the models being developed w.r.t. being consistent,  complete, and concise. </p><p> <a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/services/2007/2926/00/29260167.pdf&amp;amp;T=Process%20Discovery%20from%20Model%20and%20Text%20Artefacts"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> </p>  <div align="center"> <a href="uploadfiles/2007/video/SERVICES2007-9023/SERVICES2007-9023.html" target="_blank"><strong> &amp;gt;&amp;gt;&amp;gt; View Video</strong></a> </div><div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2007\PDF\SERVICES2007-9023.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2007\MP3\SERVICES2007-9023.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>9/30/2007 01:59</pubDate>
<author><![CDATA[Aditya Ghose,George Koliadis,Arthur Chueng]]></author></item>
<item><title><![CDATA[Coupling RDF/RSS, WSRP and AJAX for Dynamic Reusable Portlets: An Approach and a Use Case]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1508</link>
<description><![CDATA[<p>XML vocabularies like RSS (Really Simple Syndication) or domain specific  syntactic syndication frameworks allow for creation of raw data that can be  understood by a wide range of consuming portals and web sites. Often individual  aggregators create content from such feeds however, every single aggregator  needs to render UI content separately. Avoiding this via reuse requires creation  of presentation-oriented services for dynamic generation of content from same  base XML data.</p> <p>Web services for remote portlets (WSRP) provides standards based interfaces  for creation of presentation oriented services using web services technology  .However, any WSRP based remote portlet needs to be refreshed every time when  even a single data element changes in the portlet. Complementarily, technologies  like Asynchronous JavaScript and XML (AJAX) also allow for content aggregation  and asynchronous data retrieval. Unlike WSRP, in AJAX only the required control  needs to be refreshed, whenever data changes. In AJAX too,, every aggregator is  required to include AJAX control accessing the same back end service leading to  considerable replication of effort. These two technologies complement each other  in terms of ease of sharing of aggregated content and better usability of such  content.</p> <p>Overall, often there is a requirement to dynamically generate UI content from  XML data, customize and share aggregated content with remote consumers and  finally allow for partial updates of remote aggregated content for better  usability. We take a holistic view of the problem statement and propose an end  to end architectural approach that combines usage of WSRP, AJAX along with XML  syndication feeds like RSS for creation of standards based, customizable, and  dynamically generated reusable UI that has better interactivity, speed and  usability.</p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/services/2007/2926/00/29260175.pdf&amp;amp;T=Coupling%20RDF/RSS,%20WSRP%20and%20AJAX%20for%20Dynamic%20Reusable%20Portlets:%20An%20Approach%20and%20a%20Use%20Case"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br /> </p>   <div align="center"> <a href="uploadfiles/2007/video/SERVICES2007-9024/SERVICES2007-9024.html" target="_blank"><strong> &amp;gt;&amp;gt;&amp;gt; View Video</strong></a> </div><div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2007\PDF\SERVICES2007-9024.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2007\MP3\SERVICES2007-9024.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>9/30/2007 01:59</pubDate>
<author><![CDATA[Srinivas Padmanabhuni,Krishnendu Kunti,Lipika Sahoo,Shaurabh Bharti]]></author></item>
<item><title><![CDATA[Distributed execution of aggregated multi domain workflows using an agent framework]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1509</link>
<description><![CDATA[<p>In e-Science, meaningful experiment processes and workflow engines emerge as  important scientific resources. A complex experiment often involves services and  processes developed in different scientific domains. Aggregating different  workflows into one meta workflow avoids unnecessary rewriting of experiment  processes and thus improves the reuse efficiency. Remote workflow engines  explore the computing power of distributed environment. However, the diversity  of workflow description and execution models makes the integration between  engines difficult. An agent framework uses ontology based communication language  and makes the integration to semantic information of resources seamless, it is  thus suitable for coupling distributed engines. In this paper, we present our  work in the context of Dutch Virtual Laboratory for e-Science (VL-e) project. A  semantic registry for describing workflow engines is implemented, and mobile  agents are used to manage distributed workflow coordination. </p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/services/2007/2926/00/29260183.pdf&amp;amp;T=Distributed%20execution%20of%20aggregated%20multi%20domain%20workflows%20using%20an%20agent%20framework"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a>   <div align="center"> <a href="uploadfiles/2007/video/SERVICES2007-9025/SERVICES2007-9025.html" target="_blank"><strong> &amp;gt;&amp;gt;&amp;gt; View Video</strong></a> </div> <div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2007\PDF\SERVICES2007-9025.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2007\MP3\SERVICES2007-9025.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>9/30/2007 01:59</pubDate>
<author><![CDATA[Zhiming Zhao,Adam Belloum,Cees de Laat,Pieter Adriaans,Bob Hertzberger]]></author></item>
<item><title><![CDATA[An Architecture of a Workflow System for Integrated Asset Management in the Smart Oil Field Domain]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1510</link>
<description><![CDATA[<p>Integrated Asset Management (IAM) is the vision of IT-enabled transformation of  oilfield operations where information integration from a variety of tools for  reservoir modeling, simulation, and performance prediction will lead to rapid  decision making for continuous optimization of oil production. In this paper, we  discuss the similarities and differences of IAM applications and typical  e-Science applications. We then propose an architecture for a workflow system  for IAM based on the four key requirements: support for creation, orchestration  and management of workflows including those involving legacy tools, support for  audit trails and data quality indicators for data objects, usability and  extensibility. Our architecture builds upon current research in the scientific  workflow area and applies many of its learnings to address the requirements of  our system. We propose some implementation strategies and technologies and  identify some of the key research challenges in realizing our architectural  vision. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/services/2007/2926/00/29260191.pdf&amp;amp;T=An%20Architecture%20of%20a%20Workflow%20System%20for%20Integrated%20Asset%20Management%20in%20the%20Smart%20Oil%20Field%20Domain"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br /> </p>   <div align="center"> <a href="uploadfiles/2007/video/SERVICES2007-9026/SERVICES2007-9026.html" target="_blank"><strong> &amp;gt;&amp;gt;&amp;gt; View Video</strong></a> </div><div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2007\PDF\SERVICES2007-9026.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2007\MP3\SERVICES2007-9026.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>9/30/2007 02:02</pubDate>
<author><![CDATA[Ramakrishna Soma,Amol Bakshi,Viktor K Prasanna]]></author></item>
<item><title><![CDATA[Swift: Fast, Reliable, Loosely Coupled Parallel Computation]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1511</link>
<description><![CDATA[<p>We present Swift, a system that combines a novel scripting language called  SwiftScript with a powerful runtime system based on CoG Karajan, Falkon, and  Globus to allow for the concise specification, and reliable and efficient  execution, of large loosely coupled computations. Swift adopts and adapts ideas  first explored in the GriPhyN virtual data system, improving on that system in  many regards. We describe the SwiftScript language and its use of XDTM to  describe the logical structure of complex file system structures. We also  present the Swift runtime system and its use of CoG Karajan, Falkon, and Globus  services to dispatch and manage the execution of many tasks in parallel and Grid  environments. We describe application experiences and performance experiments  that quantify the cost of Swift operations. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/services/2007/2926/00/29260199.pdf&amp;amp;T=Swift:%20Fast,%20Reliable,%20Loosely%20Coupled%20Parallel%20Computation"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br /> </p>  <div align="center"> <a href="uploadfiles/2007/video/SERVICES2007-9027/SERVICES2007-9027.html" target="_blank"><strong> &amp;gt;&amp;gt;&amp;gt; View Video</strong></a> </div><div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2007\PDF\SERVICES2007-9027.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2007\MP3\SERVICES2007-9027.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>9/30/2007 02:03</pubDate>
<author><![CDATA[Yong Zhao,Mihael Hategan,Ben Clifford,Ian Foster,Gregor von Laszewski,Veronika Nefedova,Ioan Raicu,Tiberiu Stef-Praun]]></author></item>
<item><title><![CDATA[VIEW: a VIsual sciEntificWorkflow management system]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1512</link>
<description><![CDATA[<p>In this demo, we present the current status of our VIsual sciEntificWorkflow  management system called VIEW, highlighting the following two features: (i) the  use of Semantic Web technology to represent, store, and query provenance  metadata, leading to an interoperable and extensible provenance system, and (ii)  the support of visualization of various provenance graphs and intermediate or  final data products of a workflow run in the form of medical images or 3-D  graphical models. VIEW seamlessly integrates the interoperability,  extensibility, and reasoning advantages of Semantic Web technology, the querying  and storage power of a RDBMS, and the appealing visual features of visualization  techniques. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/services/2007/2926/00/29260207.pdf&amp;amp;T=VIEW:%20a%20VIsual%20sciEntificWorkflow%20management%20system"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br /> </p>   <div align="center"> <a href="uploadfiles/2007/video/SERVICES2007-9028/SERVICES2007-9028.html" target="_blank"><strong> &amp;gt;&amp;gt;&amp;gt; View Video</strong></a> </div><div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2007\PDF\SERVICES2007-9028.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2007\MP3\SERVICES2007-9028.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>9/30/2007 02:02</pubDate>
<author><![CDATA[Artem Chebotko,Cui Lin,Xubo Fei,Zhaoqiang Lai,Shiyong Lu,Jing Hua,Farshad Fotouhi]]></author></item>
<item><title><![CDATA[Storing and Discovering Critical Workflows from Log in Scientific Exploration]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1513</link>
<description><![CDATA[<p>Workflows are widely used in various scientific fields, such as chemical  physics, astronomy, environmental science and bioinformatics. A scientific  workflow represents a set of experiments performed in an order that is  consistent with certain constraints in order to achieve a scientific goal. We  differentiate the design and the execution of a workflow. The design captures  the conceptual model of the workflow, including the format of its input and  output, the functionality of each experiment, as well as the logical constraints  on experiment execution order. The execution of a workflow represents a sequence  of the experiment runs, consisting of the actual input and output of each  experiment, and the order of the execution that satisfies the specification in  the design. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/services/2007/2926/00/29260209.pdf&amp;amp;T=Storing%20and%20Discovering%20Critical%20Workflows%20from%20Log%20in%20Scientific%20Exploration"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br /> </p>  <div align="center"> <a href="uploadfiles/2007/video/SERVICES2007-9029/SERVICES2007-9029.html" target="_blank"><strong> &amp;gt;&amp;gt;&amp;gt; View Video</strong></a> </div><div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2007\PDF\SERVICES2007-9029.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2007\MP3\SERVICES2007-9029.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>9/30/2007 02:02</pubDate>
<author><![CDATA[Qihong Shao,Michel Kinsy,Yi Chen]]></author></item>
<item><title><![CDATA[Semantic-based Dynamic Service Composition and Adaptation]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1514</link>
<description><![CDATA[<p>This paper presents a semantic-based dynamic service composition and adaptation  framework. It explores WSMO, a starting point for the semantic-based composer  construction using backward-chaining reasoning. WSMO and the orchestration  procedure proposed by this model are described, together with the architecture  of the proposed framework for semantic-based dynamic service composition and  adaptation. The backward-chaining composer and Mule-based executor, are  essential parts of the proposed framework. Its usage is illustrated by  examples. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/services/2007/2926/00/29260213.pdf&amp;amp;T=Semantic-based%20Dynamic%20Service%20Composition%20and%20Adaptation"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br /> </p>   <div align="center"> <a href="uploadfiles/2007/video/SERVICES2007-9030/SERVICES2007-9030.html" target="_blank"><strong> &amp;gt;&amp;gt;&amp;gt; View Video</strong></a> </div><div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2007\PDF\SERVICES2007-9030.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2007\MP3\SERVICES2007-9030.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>9/30/2007 02:02</pubDate>
<author><![CDATA[Artur Hibner,Krzysztof Zielinski]]></author></item>
<item><title><![CDATA[A Framework for Automatic Composition of RFQ Web Services]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1515</link>
<description><![CDATA[<p>The growth of web service formats over the Internet is increasing. These  services should often be composed to achieve a user request. We propose in this  paper a framework to cope with web service composition, from discovery to  optimization. This framework, called SPOC, is composed of four successive  phases: discovery, planning, quote execution and optimization. Only RFQ (Request  for Quote) web services are treated in this first version of SPOC. The Discovery  phase aims to search for web services in a repository. The Planning phase  determines which services satisfy the user request. The Quote Execution phase  involves processing a Request For Quote (RFQ) by calling web services. The last  phase optimizes these results giving tradeoff compositions. As a  proof-of-concept example, we applied SPOC to public competition processes in  Public Markets. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/services/2007/2926/00/29260221.pdf&amp;amp;T=A%20Framework%20for%20Automatic%20Composition%20of%20RFQ%20Web%20Services"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br /> </p><div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2007\PDF\SERVICES2007-9031.pdf.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>9/05/2007 22:30</pubDate>
<author><![CDATA[Daniela Barreiro Claro,Patrick Albers,Jin-Kao Hao]]></author></item>
<item><title><![CDATA[Polynomial-Time Reasoning for Semantic Web Service Composition]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1516</link>
<description><![CDATA[<p>Automatic composition of semantic web services should make use of the ontology  in which the services are specified. While the approaches can strongly benefit  from doing so, they have to deal with the frame and ramification problems,  necessitating worst-case exponential reasoning even to determine the outcome of  applying a single web service. The existing approaches to composition either  ignore the background ontology, matching web services based on concept names and  hence removing the need for reasoning; or they employ full-scale reasoning and  suffer from the unavoidable performance deficiencies. In our work, we instead  look for interesting classes of ontologies where the required reasoning is  polynomial. We define a formalism for semantic web service composition. We  present polynomial-time methods for dealing with several of the most commonly  used ontology modelling constructs; further extensions are possible. We prove  that our methods are correct. We are currently developing an implementation of  our techniques. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/services/2007/2926/00/29260229.pdf&amp;amp;T=Polynomial-Time%20Reasoning%20for%20Semantic%20Web%20Service%20Composition"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br /> </p>   <div align="center"> <a href="uploadfiles/2007/video/SERVICES2007-9032/SERVICES2007-9032.html" target="_blank"><strong> &amp;gt;&amp;gt;&amp;gt; View Video</strong></a> </div><div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2007\PDF\SERVICES2007-9032.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2007\MP3\SERVICES2007-9032.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>9/30/2007 02:06</pubDate>
<author><![CDATA[Jorg Hoffmann,James Scicluna,Tomasz Kaczmarek,Ingo Weber]]></author></item>
<item><title><![CDATA[Modeling and Verifying Non-DAG Workflows for Computational Grids]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1517</link>
<description><![CDATA[<p>The advent of grid technology has provided a promising methodology for usage of  distributed resources for complex scientific workflow applications. Grid  workflow management systems (GWMS) enable even a non-expert grid user to compose  workflows and further provide functionality to coordinate execution of the  complete workflow thereby masking the grid-specific details from the user. We  have designed a non- DAG workflow specification model for workflow composition.  Our model allows a user to compose a workflow using directed graphs, thereby  allowing modeling of sequence, parallel, choice and iteration patterns in the  workflow. We have also provided for structural verification of workflows using  Petri net based analysis techniques. A workflow is said to he structurally  correct if it does not have errors like deadlock and lack of synchronization. A  workflow found correct by structural verification techniques can be executed  correctly for all possible workflow instances. We have incorporated our workflow  model into a previously existing workflow management system for Sun Grid engine  [I]. Experiments show that the model allows for composition of wider range of  workflow applications. Also the verification procedure provides appropriate  error messages to user, indicating the nature and cause of error, when a  structural error is detected. We have composed and executed the workflow of EMAN  [2], a real-world Bio-informatics application. The experimentation results show  the efficient utilization of compute power of the grid by the inherent parallel  tasks in the EMAN workflow. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/services/2007/2926/00/29260237.pdf&amp;amp;T=Modeling%20and%20Verifying%20Non-DAG%20Workflows%20for%20Computational%20Grids"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br /> </p>  <div align="center"> <a href="uploadfiles/2007/video/SERVICES2007-9033/SERVICES2007-9033.html" target="_blank"><strong> &amp;gt;&amp;gt;&amp;gt; View Video</strong></a> </div><div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2007\PDF\SERVICES2007-9033.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2007\MP3\SERVICES2007-9033.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>9/30/2007 02:07</pubDate>
<author><![CDATA[Sumit W Sorde,Sanjeev K Aggarwal,Jie Song,Melvin Koh,Simon See]]></author></item>
<item><title><![CDATA[Tailorability of personalized BPEL-based Workflow Compositions]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1518</link>
<description><![CDATA[<p>Recent composition languages like BPEL allow for composing single Web Services  as higher-level business workflows. Runtime engines obtain the task to deploy  and to publish these processes as regular Web services that can be located and  used by any client. These runtime engines, however, do not enable end-users to  flexibly adapt the constructs that represent a workflow in a personalized  manner. The claim of this work is that end-user adaptability (tailorability) of  personalized workflows will be increasingly significant for future applications.  Based on our experience with component-based tailoring methods, we propose the  multi-tier architecture TailorBPEL that supports the tailoring of personalized  BPEL-based workflow compositions. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/services/2007/2926/00/29260245.pdf&amp;amp;T=Tailorability%20of%20personalized%20BPEL-based%20Workflow%20Compositions"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br /> </p>   <div align="center"> <a href="uploadfiles/2007/video/SERVICES2007-9034/SERVICES2007-9034.html" target="_blank"><strong> &amp;gt;&amp;gt;&amp;gt; View Video</strong></a> </div><div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2007\PDF\SERVICES2007-9034.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2007\MP3\SERVICES2007-9034.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>9/30/2007 02:07</pubDate>
<author><![CDATA[Sascha Alda,Julia Kuck,Armin B. Cremers]]></author></item>
<item><title><![CDATA[Specification of Adaptive Client-Tailored Product Models]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1519</link>
<description><![CDATA[<p>Traditionally, product models often have a rigid nature, both with respect to  the manner in which they are initially tailored to clients, and to the way they  are maintained over time. Especially when such products are offered at a highly  interactive medium such as Internet in the form of web services, addressing such  aspects might be a necessity to obtain a competitive advantage. To cope with  these rigidity problems, this paper proposes a dynamic approach to product  models, which supports an ongoing interaction process that continuously adapts a  product to the background and desires of the client. The generic approach has  been formalised and tested in a case study in the domain of car  insurances. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/services/2007/2926/00/29260253.pdf&amp;amp;T=Specification%20of%20Adaptive%20Client-Tailored%20Product%20Models"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br /> </p>  <div align="center"> <a href="uploadfiles/2007/video/SERVICES2007-9035/SERVICES2007-9035.html" target="_blank"><strong> &amp;gt;&amp;gt;&amp;gt; View Video</strong></a> </div><div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2007\PDF\SERVICES2007-9035.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2007\MP3\SERVICES2007-9035.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>9/30/2007 02:06</pubDate>
<author><![CDATA[Tibor Bosse,Fiemke Both,Mark Hoogendoorn,Jan Treur]]></author></item>
<item><title><![CDATA[Composing Web-service-like Abstract State Machines (ASMs)]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1520</link>
<description><![CDATA[<p>We ease the design of collaborative business processes respecting desired  business goals by the composition algorithm presented in this paper. The  composition of multiple parties&amp;rsquo; business processes is always done with a  specific objective in mind. Not only in the positive case, but also if the  objective of a business process can not be fulfilled, all participating business  processes need to be in some expected recovery state.</p> <p>We propose a composition algorithm solving the task of designing a  collaborative business process while respecting a set of primary and recovery  goals. In our model, each business process is described as a finite state  machine. The multiplication of all business processes in one single model of  possible executions would lead to an explosion of the number of states.  Therefore, our composition algorithm directly interprets the multiple finite  state machine (FSM) representations and creates a collaborative business process  without integrating all FSMs into a single FSM upfront.</p> <p>Our composition algorithm returns an orchestration of the given business  processes only in the case that it can be assured that each execution only leads  to an expected primary or recovery goal. In order to prove our concepts, we  first mathematically define the execution of business processes and  orchestrations by providing abstract state machine (ASM) representations for  them. Second, we execute the ASMs in the execution engine CoreASM which shows  that the generated orchestration steers the execution of the business processes  as intended.</p><p> <a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/services/2007/2926/00/29260262.pdf&amp;amp;T=Composing%20Web-service-like%20Abstract%20State%20Machines%20%28ASMs%29"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> </p>   <div align="center"> <a href="uploadfiles/2007/video/SERVICES2007-9036/SERVICES2007-9036.html" target="_blank"><strong> &amp;gt;&amp;gt;&amp;gt; View Video</strong></a> </div><div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2007\PDF\SERVICES2007-9036.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2007\MP3\SERVICES2007-9036.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>9/30/2007 02:09</pubDate>
<author><![CDATA[Jens Lemcke,Andreas Friesen]]></author></item>
<item><title><![CDATA[Service Selection Model Based on QoS Reference Vector]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1521</link>
<description><![CDATA[<p>In SOA, one challenging problem is the QoS evaluation for the newly composed  service. Most existing work on service composition focuses mainly on the static  QoS behavior of individual components. Many other factors such as execution  profile (e.g. service task and network dynamics) and &amp;quot;best results&amp;quot; with slow  selection time vs. &amp;quot;good enough&amp;quot; results with fast selection time are often  ignored. To address the practical aspect of service selection and to perform  more appropriate tradeoff, we propose a service QoS model and evaluate two  selection algorithms in this paper. Experimental results show that our model and  mechanism can provide good tradeoff between service selection time and QoS  metrics. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/services/2007/2926/00/29260270.pdf&amp;amp;T=Service%20Selection%20Model%20Based%20on%20QoS%20Reference%20Vector"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br /> </p>  <div align="center"> <a href="uploadfiles/2007/video/SERVICES2007-9037/SERVICES2007-9037.html" target="_blank"><strong> &amp;gt;&amp;gt;&amp;gt; View Video</strong></a> </div><div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2007\PDF\SERVICES2007-9037.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2007\MP3\SERVICES2007-9037.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>9/30/2007 02:09</pubDate>
<author><![CDATA[BangYu Wu,Chi-Hung Chi,Shijie Xu]]></author></item>
<item><title><![CDATA[A Reliability-Aware Approach for Web Services Execution Planning]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1522</link>
<description><![CDATA[<p>The dynamic composition of Web services from independent service providers for  complicated distributed applications is emerging as a key technique in the  Internet world for future critical software systems. In such an environment, a  user may need to compose some Web services to perform critical tasks along a  given execution path that needs high reliability to avoid unacceptable failures  due to service crashes. To achieve high reliability, the active parallel  replication and standby parallel replication strategies can be used for managing  the redundancy existing in each task of an execution plan. However, more  replicas of Web services used during a task execution means higher price a user  has to pay for. In this paper, we propose an approach to select necessary Web  services from different vendors for the purpose of their composition in a way  that satisfies the user-specified reliability, price and response time, while  trying to minimize the price and delay of an execution plan. We provide  simulation results to study the performance of the proposed approach and compare  it with four variations that use different heuristics for service  selections. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/services/2007/2926/00/29260278.pdf&amp;amp;T=A%20Reliability-Aware%20Approach%20for%20Web%20Services%20Execution%20Planning"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br /> </p><div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2007\PDF\SERVICES2007-9038.pdf.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>9/05/2007 22:37</pubDate>
<author><![CDATA[Chien-Min Wang,Shun-Te Wang,Hsi-Min Chen,Chi-Chang Huang]]></author></item>
<item><title><![CDATA[Aspect-oriented Approach for Non-functional Adaptation of Composite Web Services]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1523</link>
<description><![CDATA[<p>We provide a novel approach for specifying and relating non-functional  properties for distributed component web services that can be used to adapt a  composite web service. Our approach uses distributed aspect-oriented programming  (AOP) technology to model an adaptive architecture for web services composition  and execution. Existing web service adaptation mechanisms are limited only to  the process of web service choreography in terms of web service  selection/invocation vis-&amp;agrave;-vis pre-specified (Service Level Agreement) SLA  constraints. Our system extends this idea by representing the non-functional  properties of each web service - composite and component - via AOP. Hence our  system models a relation function between the aspects of the composite web  service, and the individual aspects of the component web services. This enables  mid-flight adaptation of the composite web service - in response to changes in  non-functional requirements - via suitable modifications in the individual  aspects of the component web service. From the end users&amp;rsquo; viewpoint, such  upfront aspectoriented modeling of non-functional properties enables on-demand  composite Web service adaptation with minimal disruption in quality of  service. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/services/2007/2926/00/29260284.pdf&amp;amp;T=Aspect-oriented%20Approach%20for%20Non-functional%20Adaptation%20of%20Composite%20Web%20Services"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br /> </p><div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2007\PDF\SERVICES2007-9039.pdf.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>9/05/2007 22:38</pubDate>
<author><![CDATA[Karthikeyan Ponnalagu,Jayatheerthan R. Krishnamurthy]]></author></item>
<item><title><![CDATA[Improving Performance of CompositeWeb Services Over a Wide Area Network]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1524</link>
<description><![CDATA[<p>Performance of distributed applications over a wide area network (WAN) has  remained an important issue as WAN conditions change over time. Networking  community has employed various approaches to improve application performance by  adapting to changes in WAN conditions. Composite web services with components  distributed over a WAN pose similar performance problems, however, with a  different set of challenges and opportunities to improve. With their unique  architecture, these composite web services can be partitioned and orchestrated  in a decentralized fashion on a distributed infrastructure. In this paper, we  investigate how different topologies generated by decentralized orchestration  are affected differently by variations in WAN conditions. We present a system  that exploits this and adapts to changes in WAN conditions. The system monitors  the availability of network bandwidth, evaluates its effect on the performance  of each topology using a performance model based on bandwidth availability, and  then selects the optimal topology at runtime. The results from our simulation  show that the adaptive system improves performance. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/services/2007/2926/00/29260292.pdf&amp;amp;T=Improving%20Performance%20of%20CompositeWeb%20Services%20Over%20a%20Wide%20Area%20Network"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br /> </p>   <div align="center"> <a href="uploadfiles/2007/video/SERVICES2007-9040/SERVICES2007-9040.html" target="_blank"><strong> &amp;gt;&amp;gt;&amp;gt; View Video</strong></a> </div><div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2007\PDF\SERVICES2007-9040.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2007\MP3\SERVICES2007-9040.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>9/30/2007 02:09</pubDate>
<author><![CDATA[Girish Chafle,Sunil Chandra,Neeran Karnik,Vijay Mann,Mangala Gowri Nanda]]></author></item>
<item><title><![CDATA[An Automated Composition of Information Web Services based on Functional Semantics]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1525</link>
<description><![CDATA[<p>There have been many studies on the automated composition of Web services. Most  of previous works build a composite Web service by chaining the input and output  of a Web service without considering the functional semantics of the Web service  itself. However, they cannot guarantee that the service composed will provide a  requested functionality. Furthermore, they have high time-complexity since every  possible combination of available services should be considered. This paper  proposes a composition method that explicitly specifies and uses the functional  semantics of Web services. First, the proposed method constructs a graph model,  which represents the functional semantics of Web services as well as the  dependency among inputs and outputs. Second, composition paths with core  services, which satisfy the functionality requested by a client, and value-added  services, which support the transformation between I/O types, are searched in  the graph model. Finally, possible composite services are built from the paths  searched. The proposed method improves the semantic correctness of composite  services by considering the functionalities of Web services, as well as the  composition speed by only considering functionally related services.  </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/services/2007/2926/00/29260300.pdf&amp;amp;T=An%20Automated%20Composition%20of%20Information%20Web%20Services%20based%20on%20Functional%20Semantics"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br /> </p>  <div align="center"> <a href="uploadfiles/2007/video/SERVICES2007-9041/SERVICES2007-9041.html" target="_blank"><strong> &amp;gt;&amp;gt;&amp;gt; View Video</strong></a> </div> <div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2007\PDF\SERVICES2007-9041.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2007\MP3\SERVICES2007-9041.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>9/30/2007 02:14</pubDate>
<author><![CDATA[Dong-Hoon Shin,Kyong-Ho Lee]]></author></item>
<item><title><![CDATA[Quantifying Trust through Delegation in Service Oriented Architecture]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1526</link>
<description><![CDATA[<p>In SOA, service composition and selection can be viewed as delegation behaviors.  Due to multi-levels service workflow, the delegation relationship among services  is often confused and the overall trust of component services by the requester  cannot be evaluated quantitatively. In this paper, we propose a model to depict  the delegation relationship and quantitatively measure the implied trust degree  among services in SOA. Firstly, we use Hierarchical Elementary Net System (HENS)  that is based on the Petri Net to model the service workflow. Then, a Delegation  Tree is abstracted from the HENS. Based on the Delegation Tree, we can derive  the delegation relationship among services, calculate the trust degree among  services which have delegation relationship, and find out the Critical Trust  Path in the Delegation Tree. This model is important because it can quantify  service delegation in SOA; it can also be used to guide delegation process thus  reducing service risk due to delegation. </p><p> <a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/services/2007/2926/00/29260308.pdf&amp;amp;T=Quantifying%20Trust%20through%20Delegation%20in%20Service%20Oriented%20Architecture"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> </p>  <div align="center"> <a href="uploadfiles/2007/video/SERVICES2007-9042/SERVICES2007-9042.html" target="_blank"><strong> &amp;gt;&amp;gt;&amp;gt; View Video</strong></a> </div><div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2007\PDF\SERVICES2007-9042.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2007\MP3\SERVICES2007-9042.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>9/30/2007 02:15</pubDate>
<author><![CDATA[Zhiheng Xie,Chi-Hung Chi]]></author></item>
<item><title><![CDATA[Services Composition Modeling with Mobility and Time]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1527</link>
<description><![CDATA[<p>The mobile ambient is a formal model for mobile computation in which processes  reside and move in a hierarchy of named locations organised as a tree-like  structure, but the real-time property of the mobility has not been well  described. In this paper, we extend mobile ambient with time, and then present  discrete time mobile ambient calculus (DTMA). Based on DTMA, we investigate the  modelling for web service composition orchestration that has some mobility and  time constraint. The service orchestration case which is used for the service  composition example is formalized based on BPEL4WS basic actions modelling, and  this work is a foundation for the model checking of the real-time mobile service  orchestration. </p><p> <a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/services/2007/2926/00/29260316.pdf&amp;amp;T=Services%20Composition%20Modeling%20with%20Mobility%20and%20Time"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> </p><div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2007\PDF\SERVICES2007-9043.pdf.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>9/05/2007 22:42</pubDate>
<author><![CDATA[Chunming Gao,Yong Li,Huowang Chen]]></author></item>
<item><title><![CDATA[A Hybrid Event-Processing Architecture based on the Model-driven Approach for High Performance Monitoring]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1528</link>
<description><![CDATA[<p>Business Activity Monitoring (BAM) is a concept for computer systems which  support monitoring situations and the performance of business processes as they  execute. The monitoring system needs to capture and to process numerous events  while correlating them with other events stored in a database. If the database  accesses become very frequent, read-only and write-only accesses can achieve  high throughputs by applying well known solutions; a result cache and a batch  update. However, the event processing of the monitoring includes both  simultaneously. It is the case that is hard for the existing solutions to  achieve high throughputs.</p> <p>Here, we introduce a new architecture, HM-Hybrid, to process events for  monitoring efficiently. It is a hybrid of a result cache and a batch update. And  our model-driven approach makes it possible for them to work together in  situations that are normally regarded as being unsuited for them. It processed  1207 events per second, about 43000 queries per second. It is 6 times better  performance over a naive caching architecture in our experiments. The  architecture seems useful for monitoring applications where there are many  update and select queries.</p><p> <a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/services/2007/2926/00/29260324.pdf&amp;amp;T=A%20Hybrid%20Event-Processing%20Architecture%20based%20on%20the%20Model-driven%20Approach%20for%20High%20Performance%20Monitoring"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a></p><div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2007\PDF\SERVICES2007-9044.pdf.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>9/05/2007 22:44</pubDate>
<author><![CDATA[Yosuke Ozawa,Teruo Koyanagi,Mari Abe,Liangzhao Zeng]]></author></item>
<item><title><![CDATA[Towards Service Composition Based on Mashup]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1529</link>
<description><![CDATA[<p>Mashup is a hallmark of Web 2.0 and attracts both industry and academia  recently. It refers to an ad hoc composition technology of Web applications that  allows users to draw upon content retrieved from external data sources to create  entirely new services. Compared to traditional &amp;quot;developer-centric&amp;quot; composition  technologies, e.g., BPEL and WSCI, mashup provides a flexible and easy-of-use  way for service composition on web. It makes the consumers free to compose  services as they wish as well as simplifies the composition task. This paper  makes two contributions. Firstly, we propose the mashup architecture, extend  current SOA model with mashup and analyze how it facilitates service  composition. Secondly, we propose a mashup component model to help developers  leverage to create their own composite services. A case study is given to  illustrate how to do service composition by mashup. This paper also discusses  about some interesting topics about mashup. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/services/2007/2926/00/29260332.pdf&amp;amp;T=Towards%20Service%20Composition%20Based%20on%20Mashup"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br /> </p><div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2007\PDF\SERVICES2007-9045.pdf.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>9/05/2007 22:45</pubDate>
<author><![CDATA[Xuanzhe Liu,Yi Hui,Wei Sun,Haiqi Liang]]></author></item>
<item><title><![CDATA[The Resource-Oriented Architecture]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1530</link>
<description><![CDATA[<p>Astonishingly, a prevalent point of view amongst protagonists of SOA is REST to  be &amp;quot;just&amp;quot; a light-weight approach to web services. Rants pick on concepts and  implementations at will, very few argumentations have a clear scientific  foundation, some even discuss SOA and REST as an either-or decision. However,  REST is just a manifestation of resource orientation. To return to a fruitful  discussion and achieve progress, this paper outlines the origins of service  orientation and resource orientation, providing a foundation for future  agreement and new implementation approaches. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/services/2007/2926/00/29260340.pdf&amp;amp;T=The%20Resource-Oriented%20Architecture"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br /> </p>  <div align="center"> <a href="uploadfiles/2007/video/SERVICES2007-9046/SERVICES2007-9046.html" target="_blank"><strong> &amp;gt;&amp;gt;&amp;gt; View Video</strong></a> </div><div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2007\PDF\SERVICES2007-9046.pdf.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>9/30/2007 02:16</pubDate>
<author><![CDATA[Hagen Overdick]]></author></item>
<item><title><![CDATA[MCSAMS: A Novel WSRF and Multi-agent based Distributed Multimedia Content Service Alliance and Management Scheme]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1531</link>
<description><![CDATA[<p>Application integration is becoming the hottest topic in information technology  today. Heterogeneous, isolated content service systems are faced with difficult  integration problem. Firstly, we propose a novel Web Services Composition-based  Content Service Alliance Platform (CSA-Platform). In this platform, we emphasize  on heterogeneous service status monitoring and service scheduling switching  issue; we propose a novel WSRF and Multi-agent based content service alliance  and management scheme in CSA-Platform. Furthermore, we describe WSDM-based  content service monitoring and scheduling model, including Manager Layer,  WSDM-Gateway Layer, and Agent Layer. And then we study multi-agent-based content  service status collecting strategy. As part of experiment work, we design  JMX-MUSE based content service monitoring and scheduling scheme, and carry out  the module implementation, and then analyze the experiment results. At last, we  analyze the prospective research direction and challenges in this  field. </p><p> <a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/services/2007/2926/00/29260348.pdf&amp;amp;T=MCSAMS:%20A%20Novel%20WSRF%20and%20Multi-agent%20based%20Distributed%20Multimedia%20Content%20Service%20Alliance%20and%20Management%20Scheme"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> </p><div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2007\PDF\SERVICES2007-9047.pdf.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>9/05/2007 22:49</pubDate>
<author><![CDATA[ZhiHui Lu,Jie Wu,YiPing Zhong,WeiMing Fu,ShiYong Zhang]]></author></item>
<item><title><![CDATA[Integrated Pricing Modeling for Digital Services Providers in Web 2.0 Envrionment]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1532</link>
<description><![CDATA[<p>Apart from Web services enablement technology and infrastructure, services  pricing strategies determine its ultimate outcome for any services delivery in  the community-based collaboration environment such as Web 2.0 enabled service  market. In this paper, we model pricing strategies by taking services&amp;rsquo; demands  into consideration. We show that the presented different pricing models are  complement to each other. They fit the needs of different consumer types such as  savvy consumers or causal consumers. One implication of the analysis is to  design flexible pricing schemes within Web 2.0 services market as much as  possible. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/services/2007/2926/00/29260356.pdf&amp;amp;T=Integrated%20Pricing%20Modeling%20for%20Digital%20Services%20Providers%20in%20Web%202.0%20Envrionment"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br /> </p>   <div align="center"> <a href="uploadfiles/2007/video/SERVICES2007-9048/SERVICES2007-9048.html" target="_blank"><strong> &amp;gt;&amp;gt;&amp;gt; View Video</strong></a> </div><div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2007\PDF\SERVICES2007-9048.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2007\MP3\SERVICES2007-9048.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>9/30/2007 02:17</pubDate>
<author><![CDATA[Zhixiong Chen,Liang-Jie Zhang]]></author></item>
<item><title><![CDATA[A Study of Language-Action Perspective as a Theoretical Framework for Web Services]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1533</link>
<description><![CDATA[<p>This dissertation contributes to the services science discipline by examining  appropriateness of Language- Action Perspective (LAP) as a theoretical framework  for web services, the technology component of services science. This research  consists of three inter-dependent studies. The first study (completed)  investigates whether LAP constructs can describe and explain the web services  architecture. Findings from this study indicate that there is a lack of  mechanisms to generate conversation specifications that guide interactions among  services. Conversation specifications are crucial for developing large-scaled  enterprise integration solutions using web services. The second study  (work-in-progress) builds on this finding and demonstrates the appropriateness  of LAP constructs to access design knowledge to develop web service solutions  for enterprise integration. The third study (work-in-progress) evaluates the  usefulness of LAP constructs to develop effective web service solutions  (artifact developed in the second study). </p><p> <a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/services/2007/2926/00/29260364.pdf&amp;amp;T=A%20Study%20of%20Language-Action%20Perspective%20as%20a%20Theoretical%20Framework%20for%20Web%20Services"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> </p>    <div align="center"> <a href="uploadfiles/2007/video/SERVICES2007-9049/SERVICES2007-9049.html" target="_blank"><strong> &amp;gt;&amp;gt;&amp;gt; View Video</strong></a> </div><div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2007\PDF\SERVICES2007-9049.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2007\MP3\SERVICES2007-9049.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>9/30/2007 02:18</pubDate>
<author><![CDATA[Karthikeyan Umapathy]]></author></item>
<item><title><![CDATA[Critical Review of Unsecured WEP]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1534</link>
<description><![CDATA[<p>The wireless LANs (WLANs) have become more prevalent and are widely deployed in  many places such as corporate office conference rooms, industrial warehouses,  campus, residences, caf&amp;eacute; etc. The IEEE 802.11-based WLAN presents new challenges  for network administrators and information security administrators alike. The  security of a WLAN is very important, especially for applications hosting  valuable information. Unlike the relative simplicity of wired Ethernet  deployments, 802.11-based WLANs broadcast radio-frequency (RF) data for the  client stations to receive. This presents new and complex security issues that  involve augmenting the 802.11 standard. This paper critically reviews main  security flaws of WEP, including short IV, key reuse, poor key management, and  inappropriate RC4 and CRC-32 algorithms. It also describes a useful VPN security  measure to enhance the level of security for the WLAN employing WEP.  </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/services/2007/2926/00/29260368.pdf&amp;amp;T=Critical%20Review%20of%20Unsecured%20WEP"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> </p><div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2007\PDF\SERVICES2007-9050.pdf.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>9/05/2007 22:52</pubDate>
<author><![CDATA[Songhe Zhao,Charles A. Shoniregun]]></author></item>
<item><title><![CDATA[A Systematic Analysis and Design Approach to Develop Adaptable Services in Service Oriented Computing]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1535</link>
<description><![CDATA[<p>Service-Oriented Architecture (SOA) provides a considerably new of invoking  functionality. Service providers are to develop and deploy reusable services,  and service consumers are to discover right services. A main difficulty in  developing generic services is to design services generic enough so that the  services can be effectively adapted to diverse service consumers. Moreover, this  adaptation takes place at runtime, and hence dynamic adaptation and compositions  are essential in service-oriented computing (SOC). For this, service variability  among different consumers and contexts should be analyzed and designed into  service components. In this dissertation, a service-oriented analysis and design  (SOAD) process is presented, which focuses on modeling service variability and  mismatch, engineering adaptability into service components and adapters, and  enabling dynamic composition of services. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/services/2007/2926/00/29260375.pdf&amp;amp;T=A%20Systematic%20Analysis%20and%20Design%20Approach%20to%20Develop%20Adaptable%20Services%20in%20Service%20Oriented%20Computing"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br /> </p>   <div align="center"> <a href="uploadfiles/2007/video/SERVICES2007-9051/SERVICES2007-9051.html" target="_blank"><strong> &amp;gt;&amp;gt;&amp;gt; View Video</strong></a> </div><div><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2007\PDF\SERVICES2007-9051.pdf.\"  target=_black></a><br><br><div align="left"></div><br><a href="http://www.servicescomputing.tv/rss/view/uploadfiles/2007\MP3\SERVICES2007-9051.mp3.\"  target=_black></a><br></div><div></div>]]></description>
<pubDate>9/30/2007 02:19</pubDate>
<author><![CDATA[Soo Ho Chang]]></author></item>
<item><title><![CDATA[Message from the General Chair]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1539</link>
<description><![CDATA[<strong>DOI Bookmark: </strong><a href="http://doi.ieeecomputersociety.org/10.1109/SERVICES.2007.39">http://doi.ieeecomputersociety.org/10.1109/SERVICES.2007.39</a><div></div><div></div>]]></description>
<pubDate>8/14/2007 22:21</pubDate>
<author><![CDATA[Liang-Jie Zhang]]></author></item>
<item><title><![CDATA[Author Index]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1538</link>
<description><![CDATA[<a href="http://doi.ieeecomputersociety.org/10.1109/SERVICES.2007.19"><strong>DOI Bookmark: </strong></a><a href="http://doi.ieeecomputersociety.org/10.1109/SERVICES.2007.19">http://doi.ieeecomputersociety.org/10.1109/SERVICES.2007.19</a>  <div></div><div></div>]]></description>
<pubDate>8/14/2007 22:16</pubDate>
<author><![CDATA[]]></author></item>
<item><title><![CDATA[Message from the Workshop Chair]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1540</link>
<description><![CDATA[<strong>DOI Bookmark: </strong><a href="http://doi.ieeecomputersociety.org/10.1109/SERVICES.2007.46">http://doi.ieeecomputersociety.org/10.1109/SERVICES.2007.46</a>  <div></div><div></div>]]></description>
<pubDate>8/14/2007 22:28</pubDate>
<author><![CDATA[Jian Yang]]></author></item>
<item><title><![CDATA[Message from the MDA4SOA07 Chairs]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1541</link>
<description><![CDATA[<strong>DOI Bookmark: </strong><a href="http://doi.ieeecomputersociety.org/10.1109/SERVICES.2007.40">http://doi.ieeecomputersociety.org/10.1109/SERVICES.2007.40</a>  <div></div><div></div>]]></description>
<pubDate>8/14/2007 22:29</pubDate>
<author><![CDATA[Arne J. Berre,Cory Casanave,Dumitru Roman,Jian Yang]]></author></item>
<item><title><![CDATA[MDA4SOA07 Organization]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1542</link>
<description><![CDATA[<strong>DOI Bookmark: </strong><a href="http://doi.ieeecomputersociety.org/10.1109/SERVICES.2007.38">http://doi.ieeecomputersociety.org/10.1109/SERVICES.2007.38</a>  <div></div><div></div>]]></description>
<pubDate>8/14/2007 22:37</pubDate>
<author><![CDATA[]]></author></item>
<item><title><![CDATA[Message from the SWSP07 Chairs]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1543</link>
<description><![CDATA[<strong>DOI Bookmark: </strong><a href="http://doi.ieeecomputersociety.org/10.1109/SERVICES.2007.44">http://doi.ieeecomputersociety.org/10.1109/SERVICES.2007.44</a>  <div></div><div></div>]]></description>
<pubDate>8/14/2007 22:38</pubDate>
<author><![CDATA[Jorge Cardoso,Amit Sheth,Rama Akkiraju,Kunal Verma]]></author></item>
<item><title><![CDATA[SWSP07 Organization]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1545</link>
<description><![CDATA[<strong>DOI Bookmark: </strong><a href="http://doi.ieeecomputersociety.org/10.1109/SERVICES.2007.64">http://doi.ieeecomputersociety.org/10.1109/SERVICES.2007.64</a>  <div></div><div></div>]]></description>
<pubDate>8/14/2007 22:56</pubDate>
<author><![CDATA[]]></author></item>
<item><title><![CDATA[Message from the SOBDAT 2007 Program Chairs]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1546</link>
<description><![CDATA[<strong>DOI Bookmark: </strong><a href="http://doi.ieeecomputersociety.org/10.1109/SERVICES.2007.41">http://doi.ieeecomputersociety.org/10.1109/SERVICES.2007.41</a>  <div></div><div></div>]]></description>
<pubDate>8/14/2007 22:58</pubDate>
<author><![CDATA[Phillip E. Bourne,Shamkant B. Navathe,Sushil K. Prasad]]></author></item>
<item><title><![CDATA[SOBDAT 2007 Organization]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1547</link>
<description><![CDATA[<strong>DOI Bookmark: </strong><a href="http://doi.ieeecomputersociety.org/10.1109/SERVICES.2007.58">http://doi.ieeecomputersociety.org/10.1109/SERVICES.2007.58</a>  <div></div><div></div>]]></description>
<pubDate>8/14/2007 23:00</pubDate>
<author><![CDATA[]]></author></item>
<item><title><![CDATA[Message from the SOPOSE-07 Workshop Co-Chairs]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1548</link>
<description><![CDATA[<strong>DOI Bookmark: </strong><a href="http://doi.ieeecomputersociety.org/10.1109/SERVICES.2007.42">http://doi.ieeecomputersociety.org/10.1109/SERVICES.2007.42</a>  <div></div><div></div>]]></description>
<pubDate>8/14/2007 23:04</pubDate>
<author><![CDATA[Aditya Ghose,Srinivas Padmanabhuni]]></author></item>
<item><title><![CDATA[SOPOSE-07 Organization]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1549</link>
<description><![CDATA[<strong>DOI Bookmark: </strong><a href="http://doi.ieeecomputersociety.org/10.1109/SERVICES.2007.59">http://doi.ieeecomputersociety.org/10.1109/SERVICES.2007.59</a>  <div></div><div></div>]]></description>
<pubDate>8/14/2007 23:06</pubDate>
<author><![CDATA[]]></author></item>
<item><title><![CDATA[SWF 2007 Organization]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1550</link>
<description><![CDATA[<strong>DOI Bookmark: </strong><a href="http://doi.ieeecomputersociety.org/10.1109/SERVICES.2007.62">http://doi.ieeecomputersociety.org/10.1109/SERVICES.2007.62</a><div></div><div></div>]]></description>
<pubDate>8/14/2007 23:12</pubDate>
<author><![CDATA[]]></author></item>
<item><title><![CDATA[Message from the SWF07 Workshop Chairs]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1551</link>
<description><![CDATA[<strong>DOI Bookmark: </strong><a href="http://doi.ieeecomputersociety.org/10.1109/SERVICES.2007.43">http://doi.ieeecomputersociety.org/10.1109/SERVICES.2007.43</a>  <div></div><div></div>]]></description>
<pubDate>8/15/2007 02:02</pubDate>
<author><![CDATA[Shiyong Lu,Farshad Fotouhi]]></author></item>
<item><title><![CDATA[Message from the WSCA07 Organizing Committee Chairs]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1552</link>
<description><![CDATA[<strong>DOI Bookmark: </strong><a href="http://doi.ieeecomputersociety.org/10.1109/SERVICES.2007.48">http://doi.ieeecomputersociety.org/10.1109/SERVICES.2007.48</a>  <div></div><div></div>]]></description>
<pubDate>8/15/2007 02:13</pubDate>
<author><![CDATA[Samik Basu,Vasant Honavar,Marco Pistore,Amit Sheth]]></author></item>
<item><title><![CDATA[WSCA07 Organization]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1553</link>
<description><![CDATA[<strong>DOI Bookmark: </strong><a href="http://doi.ieeecomputersociety.org/10.1109/SERVICES.2007.72">http://doi.ieeecomputersociety.org/10.1109/SERVICES.2007.72</a>  <div></div><div></div>]]></description>
<pubDate>8/14/2007 23:34</pubDate>
<author><![CDATA[]]></author></item>
<item><title><![CDATA[Message from the WS-Testing 2007 Chairs]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1554</link>
<description><![CDATA[<strong>DOI Bookmark: </strong><a href="http://doi.ieeecomputersociety.org/10.1109/SERVICES.2007.47">http://doi.ieeecomputersociety.org/10.1109/SERVICES.2007.47</a>  <div></div><div></div>]]></description>
<pubDate>8/15/2007 01:59</pubDate>
<author><![CDATA[Jia Zhang,Hong Zhu]]></author></item>
<item><title><![CDATA[Message from the WebX 2007 Chairs]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1555</link>
<description><![CDATA[<strong>DOI Bookmark: </strong><a href="http://doi.ieeecomputersociety.org/10.1109/SERVICES.2007.45">http://doi.ieeecomputersociety.org/10.1109/SERVICES.2007.45</a>  <div></div><div></div>]]></description>
<pubDate>8/15/2007 01:57</pubDate>
<author><![CDATA[Liang-Jie Zhang,Hong Cai,Thomas Kwok]]></author></item>
<item><title><![CDATA[IEEE Computer Society Technical Committee on Services Computing]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1556</link>
<description><![CDATA[<strong>DOI Bookmark: </strong><a href="http://doi.ieeecomputersociety.org/10.1109/SERVICES.2007.32">http://doi.ieeecomputersociety.org/10.1109/SERVICES.2007.32</a>  <div></div><div></div>]]></description>
<pubDate>8/14/2007 23:35</pubDate>
<author><![CDATA[]]></author></item>
</Channel>
</rss>