<?xml version="1.0" encoding="utf-8"?>
<rss version="2.0">
<Channel>
<language>en-us</language>
<title>APSCC 2006</title>
<link>http://www.servicescomputing.tv/rss/view/rssFeed.php?category=22</link>
<description>APSCC 2006 all articles</description>
<item><title><![CDATA[Message from the Chairs]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1317</link>
<description><![CDATA[ <p>Full Article Text: <a href="http://csdl.computer.org/comp/proceedings/apscc/2006/2751/00/2751xiii.pdf"><img class="hspace" src="/common/images/pdf_icon_green.gif" border="0" alt="Download PDF of full text" width="40" height="18" align="absmiddle" /></a>  </p> <p><strong>DOI Bookmark: </strong><a href="http://doi.ieeecomputersociety.org/10.1109/APSCC.2006.70">http://doi.ieeecomputersociety.org/10.1109/APSCC.2006.70</a>  </p><div></div><div></div>]]></description>
<pubDate>7/31/2007 21:26</pubDate>
<author><![CDATA[]]></author></item>
<item><title><![CDATA[Organizing Committee]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1318</link>
<description><![CDATA[ <p>Full Article Text: <a href="http://csdl.computer.org/comp/proceedings/apscc/2006/2751/00/2751xiv.pdf"><img class="hspace" src="/common/images/pdf_icon_green.gif" border="0" alt="Download PDF of full text" width="40" height="18" align="absmiddle" /></a>  </p> <p><strong>DOI Bookmark: </strong><a href="http://doi.ieeecomputersociety.org/10.1109/APSCC.2006.75">http://doi.ieeecomputersociety.org/10.1109/APSCC.2006.75</a>  </p><div></div><div></div>]]></description>
<pubDate>7/31/2007 21:30</pubDate>
<author><![CDATA[]]></author></item>
<item><title><![CDATA[Program Committee]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1319</link>
<description><![CDATA[ <p>Full Article Text: <a href="http://csdl.computer.org/comp/proceedings/apscc/2006/2751/00/2751xv.pdf"><img class="hspace" src="/common/images/pdf_icon_green.gif" border="0" alt="Download PDF of full text" width="40" height="18" align="absmiddle" /></a>  </p> <p><strong>DOI Bookmark: </strong><a href="http://doi.ieeecomputersociety.org/10.1109/APSCC.2006.80">http://doi.ieeecomputersociety.org/10.1109/APSCC.2006.80</a>  </p><div></div><div></div>]]></description>
<pubDate>7/31/2007 21:30</pubDate>
<author><![CDATA[]]></author></item>
<item><title><![CDATA[Fuzzy Similarity from Conceptual Relations]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1320</link>
<description><![CDATA[<p>Semantic similarity between concepts supported by the use of ontology plays a  prominent role in the concept of the semantic level to provide semantic  information for web services discovery and composition. In this work we consider  ontology as knowledge structure that specifies concepts and their semantic  relations. And we propose a fuzzy similarity measure for not only atomic  concepts with inclusion relation but also complex concepts with semantic  relation. This fuzzy similarity measure has property of weak fuzzy similarity  relation, which conquers existing limitations of equivalence relation.  Furthermore, this fuzzy similarity measure based on shared information content  could reflect latent semantic relation of concepts better than ever.  </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510003.pdf&amp;amp;T=Fuzzy%20Similarity%20from%20Conceptual%20Relations"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br />&amp;nbsp;</p><div></div><div></div>]]></description>
<pubDate>7/31/2007 21:31</pubDate>
<author><![CDATA[Ling Song,Jun Ma,Li Lian,Zhumin Chen]]></author></item>
<item><title><![CDATA[Fuzzy Petri Net-Based Evaluation to the Process of ERP Implementation]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1321</link>
<description><![CDATA[<p>To avoid the risks on the process of enterprise resource planning(ERP)  implementation, summarize the process of ERP implementation, and sum up the  experiences and lessons, establishing an evaluation system to the process of ERP  implementation. The evaluation indexes emphasized on the human-related critical  factors which have important effects to implementation. An evaluation model and  method based on fuzzy Petri net are proposed. This evaluation model is visible  and plain, and it&amp;rsquo;s possible to quantitatively evaluate the process of ERP  implementation. Finally, an example was given to illustrate the use of the  model. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510011.pdf&amp;amp;T=Fuzzy%20Petri%20Net-Based%20Evaluation%20to%20the%20Process%20of%20ERP%20Implementation"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br />&amp;nbsp;</p><div></div><div></div>]]></description>
<pubDate>7/31/2007 21:33</pubDate>
<author><![CDATA[Shaojun Wang,Gang Wang,Guoan Gao]]></author></item>
<item><title><![CDATA[Improved Secret Sharing with Access Structures in a Hierarchy]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1322</link>
<description><![CDATA[<p>In 2004, Chang et al. presented an approach firstly to solve the problem of  secret sharing with access structures in a hierarchy. After that, based on one  way hash function, another proposed scheme was suggested by Lin et al. However,  there is the same drawback in both schemes. When group secret keys need to be  changed, the trust authority has to update related parameters of each branch in  both the above schemes. In this paper, using discrete logarithm, an improved  secret sharing with access structures in a hierarchy is given. It can achieve  the property that related parameters do not have to update even if group secret  keys are altered. So, the presented scheme may be more suitable for  applications. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510018.pdf&amp;amp;T=Improved%20Secret%20Sharing%20with%20Access%20Structures%20in%20a%20Hierarchy"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br />&amp;nbsp;</p><div></div><div></div>]]></description>
<pubDate>7/31/2007 21:34</pubDate>
<author><![CDATA[Yi Liu,Ling Zhang,Yumin Wang]]></author></item>
<item><title><![CDATA[A Semantic Matchmaking Method of Web Services Based on SHOIN^+ (D)*]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1323</link>
<description><![CDATA[<p>Capability matchmaking is one of the key issue in the field of web services  research community because it is the basis of doing service discovery and  composition. Generally, the matchmaking of web services involves the so called  IOPE matchmaking. The method used in matchmaking IO is very different from the  one used in matchmaking of PE. And the semantics reflected by IO is also very  different from PE. So they need to be treated in different way.The match-making  of IO has got some good results but the PE is still lack of method to tract. In  this paper we propose a method based on Description Logic to meet this  problem. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510026.pdf&amp;amp;T=A%20Semantic%20Matchmaking%20Method%20of%20Web%20Services%20Based%20on%20SHOIN%5E+%20%28D%29*"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> </p><div></div><div></div>]]></description>
<pubDate>7/31/2007 21:35</pubDate>
<author><![CDATA[Hai Wang,Zengzhi Li]]></author></item>
<item><title><![CDATA[An Efficient Approach to Web Services Discovery and Composition when Large Scale Services are Available]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1324</link>
<description><![CDATA[<p>Web Services composition and discovery are two most important research issues in  the study of Web Services. Based on the study on previous known conferences it  is pointed out that the Web Service Composition Tree (WSCT) is the key that  affects the performance of Web Services compositions when a large number of  services are available. Then the mutual search operations among Web Service  operations, inputs and outputs are studied, and a novel data structure called  Double Parameter Inverted File (DuoParaInvertedFile) is proposed to implement  these operations. An algorithm to build DuoParaInvertedFile is provided as well.  Based on above results an efficient algorithm for constructing the WSCT is  given. Furthermore, the QoS (Quality of Service) of Web Service Composition  Results (WSCRs) is defined, and then an algorithm used to get the best WSCR in  terms of QoS is proposed. Experiments show that this approach not only ensures  the success of the performance of Web Services composition but also ensures the  QoS of Web Services composition. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510034.pdf&amp;amp;T=An%20Efficient%20Approach%20to%20Web%20Services%20Discovery%20and%20Composition%20when%20Large%20Scale%20Services%20are%20Available"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br />&amp;nbsp;</p><div></div><div></div>]]></description>
<pubDate>7/31/2007 21:37</pubDate>
<author><![CDATA[Zhumin Chen,Jun Ma,Ling Song,Li Lian]]></author></item>
<item><title><![CDATA[An Effective Technique for Personalization Recommendation Based on Access Sequential Patterns]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1325</link>
<description><![CDATA[<p>Considering that personalization recommendation systems based on association  rules suffer from some limitations that a lot of time is spent on matching  current user session with all discovered patterns in patterns database, authors  propose a new approach to build personalization recommendation system based on  access sequential patterns discovered form usage data and highly compressed into  a tree structure. During personalization recommendation stage we just need to  intercept nearest access subsequence from current user session to match some sub  paths of the tree. The speed of pattern matching is improved enormously, which  satisfies the need of real-time recommendation better. The results of  experiments show the proposed methodology can achieve better recommendation  effectiveness. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510042.pdf&amp;amp;T=An%20Effective%20Technique%20for%20Personalization%20Recommendation%20Based%20on%20Access%20Sequential%20Patterns"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br />&amp;nbsp;</p><div></div><div></div>]]></description>
<pubDate>7/31/2007 21:38</pubDate>
<author><![CDATA[Xiaoqiu Tan,Min Yao,Miaojun Xu]]></author></item>
<item><title><![CDATA[An Algorithm for Predicting Customer Churn via BP Neural Network Based on Rough Set]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1326</link>
<description><![CDATA[<p>To solve the prediction of customer churn, the paper proposed a new algorithm.  Based on rough set theory, the algorithm used the consistency of condition  attributes and decision attributes in information table, and the conception of  super-cube and scan vector to discretize the continuous attributes, reduce the  redundant attributes. And furthermore, it took BP neural network as the  calculating tool to predict customer churn. The experimental results showed the  refined data by rough set was more concise and more convenient to be applied in  BP neural network, whose prediction result was more accurate. So, the algorithm  via BP neural network based on rough set theory is efficient and  effective. </p><p>&amp;nbsp;<a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510047.pdf&amp;amp;T=An%20Algorithm%20for%20Predicting%20Customer%20Churn%20via%20BP%20Neural%20Network%20Based%20on%20Rough%20Set"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> </p><div></div><div></div>]]></description>
<pubDate>7/31/2007 21:39</pubDate>
<author><![CDATA[E Xu,Liangshan Shao,Xuedong Gao,Baofeng Zhai]]></author></item>
<item><title><![CDATA[A Fuzzy Multi-attribute Decision Making Algorithm for Web Services Selection Based on QoS]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1327</link>
<description><![CDATA[<p>One of the challenging problems that Web service technology faces is the ability  to rapidly locate useful on-line services based on their capabilities. With the  increasing popularity of Web services, a wide variety of services are offered  that can satisfy the functional requirements of a special task, therefore there  is need for mediation infrastructures able to support humans or agents in the  eventual selection of appropriate services. To address this problem, a fuzzy  multi-attribute decision making algorithm for Web services selection based on  quality of service is proposed, which can select the most appropriate one with  the highest degree of membership belonging to the positive ideal solution. The  experimental results indicate that the fuzzy multi-attribute decision making  algorithm proposed in this paper outperforms the random and round robin  selection policies </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510051.pdf&amp;amp;T=A%20Fuzzy%20Multi-attribute%20Decision%20Making%20Algorithm%20for%20Web%20Services%20Selection%20Based%20on%20QoS"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br />&amp;nbsp;</p><div></div><div></div>]]></description>
<pubDate>7/31/2007 21:40</pubDate>
<author><![CDATA[Hongxia Tong,Shensheng Zhang]]></author></item>
<item><title><![CDATA[Three Dimensional Layered Approach for Analyzing Value Chain Re-organization Cross ICT Industries for Converged Mobile Multimedia Services]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1328</link>
<description><![CDATA[ICT innovations, while driving technological advances, also create new services  and new value chain structures. The nascent mobile multimedia services exhibit  distinct attributes from conventional telecom, broadcast and Internet services.  While traditional two-dimensional approach for value chain analysis serves less  inadequate for the complex value system structures of converged mobile  multimedia service.  <p>This paper thus, proposes a three dimensional layered approach for analyzing  value chain re-organization cross ICT industries under convergent market  context. The case of mobile TV is studied as a representative application of  converged mobile multimedia services, by applying this approach to diagnose its  value system composition in functional, industry and application dimensions.</p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510058.pdf&amp;amp;T=Three%20Dimensional%20Layered%20Approach%20for%20Analyzing%20Value%20Chain%20Re-organization%20Cross%20ICT%20Industries%20for%20Converged%20Mobile%20Multimedia%20Services"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br />&amp;nbsp;</p><div></div><div></div>]]></description>
<pubDate>7/31/2007 21:41</pubDate>
<author><![CDATA[Yun Jiang,Laurent Gille]]></author></item>
<item><title><![CDATA[An Efficient Algorithm for Web Services Composition with a Chain Data Structure]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1329</link>
<description><![CDATA[<p>Automatic composition of web services has drawn a great deal of attention  recently. Current web service (WS) composition algorithms are not only logical  presented in a rough way, but also existed inefficient or limited applied scope  problem. In this paper a data structure called WS chain table, which describes  the dependent relations among web services, is proposed, and an efficient  algorithm for WS composition is developed based on the data structure. The time  complexity of the new algorithm is O(max(log_mm,n)), improved the known  O(nXlog_m) one, where n is the number of WSs and m denotes the number of output  parameters of WSs. Experiments are carried out in order to compare the  performance of the algorithms with different data structure. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510064.pdf&amp;amp;T=An%20Efficient%20Algorithm%20for%20Web%20Services%20Composition%20with%20a%20Chain%20Data%20Structure"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br />&amp;nbsp;</p><div></div><div></div>]]></description>
<pubDate>7/31/2007 21:42</pubDate>
<author><![CDATA[Li Lian,Jun Ma,ZhuMin Chen,Ling Song]]></author></item>
<item><title><![CDATA[TreeLogit Model for Customer Churn Prediction]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1330</link>
<description><![CDATA[<p>For the purpose of improving the predictive accuracy and interpretability of  churn prediction model, TreeLogit model, which integrates the advantage of  ADTree model and Logistic regression model, is proposed in this paper to predict  customers&amp;#39; churn propensities. Compared with TreeNet\oR , a model which won the  Gold Prize in the 2003 mobile customer churn prediction modeling contest (The  Duke/NCR Teradata Churn Modeling Tournament), the overall predictive accuracy of  TreeLogit model is not inferior. In fact, the predictive accuracy of TreeLogit  is superior to the one of TreeNet\oR on two important observation points (i.e.  the captured rates in 10% and 50% of the most likely churn groups  respectively). </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510070.pdf&amp;amp;T=TreeLogit%20Model%20for%20Customer%20Churn%20Prediction"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br />&amp;nbsp;</p><div></div><div></div>]]></description>
<pubDate>7/31/2007 21:43</pubDate>
<author><![CDATA[Jiayin Qi,Yangming Zhang,Yingying Zhang,Shuang Shi]]></author></item>
<item><title><![CDATA[An Improved Trust Model in P2P]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1331</link>
<description><![CDATA[<p>Based on the Bayesian network trust model, an improved trust model is proposed  in this paper. It includes two parts: one is the improved searching resource  peers algorithm, which can reduce the redundancy packages received by peers and  enhance the reliability of system; the other is the improved trust computing and  updating method, which applies logarithm for evaluation and the number of  services to compute and update the trust, so that it can prevent malicious peers  from attacking normal peers efficiently, meanwhile restrain malicious peers from  increasing their trust respectively by collusion in its clique. The sketch maps  of trust value illustrate that the new model controls the behavior of malicious  peer in P2P more efficiently. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510076.pdf&amp;amp;T=An%20Improved%20Trust%20Model%20in%20P2P"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br />&amp;nbsp;</p><div></div><div></div>]]></description>
<pubDate>7/31/2007 21:44</pubDate>
<author><![CDATA[Xiaohui Ren,Kenli Li,Renfa Li,Lei Yang]]></author></item>
<item><title><![CDATA[A Model-Driven Aspect Framework for Grid Service Development]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1332</link>
<description><![CDATA[<p>Service-Oriented Architecture (SOA) plays an important role in the next  generation computing models for scientific and commercial applications. But  difficulties in the development and maintenance of Grid services slow down the  spread of service-based applications. A Model- Driven Aspect Framework (MDAF) is  proposed in this paper to facilitate the development of Grid services, which  benefits from the combination of Model-Driven Architecture and Aspect-Oriented  Programming. The UML output in XMI format derived from a CASE tool is used as  the input of the framework to generate a suite of source code files and related  settings. The design and implementation of MDAF are built on AspectJ along with  several open source toolkits, including Eclipse, Velocity and Ant. Finally a  case study of a full text search application developed with MDAF is presented to  demonstrate the advantages of Grid service development with MDAF. MDAF enables a  better separation of business logic and Grid specific details at both model and  code levels, which makes it easy to develop, test and maintain Grid service  based applications. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510082.pdf&amp;amp;T=A%20Model-Driven%20Aspect%20Framework%20for%20Grid%20Service%20Development"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br />&amp;nbsp;</p><div></div><div></div>]]></description>
<pubDate>7/31/2007 21:45</pubDate>
<author><![CDATA[Wen-jun Li,Chu-wei Huang,Qiang-chao Chen,Hui Bian]]></author></item>
<item><title><![CDATA[Reversible Sketch Based on the XOR-Based Hashing]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1333</link>
<description><![CDATA[We provided a novel reversible sketch data structure which had exactly  sub-linear finding time proportional to the sketch length. We first introduced  the XOR-based hash functions over the Galois field GF({0,1},\square ,&amp;middot;), defined  the full-ranked boolean matrix over GF({0,1},\square ,&amp;middot;) and the maximum  dispersion among the hash functions. Then, we chose d non-singular boolean  matrices randomly to implement the random projection from the source address  space {0,1}^n to the hash address space {0,1}^m, and used the inverse matrix of  one of the randomly chosen nonsingular matrices to implement the reversal  mapping. Based on the reversible sketch, we implemented an algorithm that finds  and estimates the frequent items online with good accuracy. The estimate  procedure used a two-stage strategy which includes Identification step and  Verification step. The Identification step generates the candidate frequent  items and the Verification step further verifies these items.  <p>Using a large amount of real Internet traffic data, the experiments  demonstrated great improvement at the finding speed and some improvement at the  accuracy than the current representative sketch, e.g. Count-Min sketch. Our  preliminary results hint at the possibility of using the reversible sketch as a  building block for network anomaly detection and distributed real-time traffic  analysis.</p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510093.pdf&amp;amp;T=Reversible%20Sketch%20Based%20on%20the%20XOR-Based%20Hashing"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br />&amp;nbsp;</p><div></div><div></div>]]></description>
<pubDate>7/31/2007 22:37</pubDate>
<author><![CDATA[Wenfeng Feng,Zhibin Zhang,Zongpu Jia,Ziyi Fu]]></author></item>
<item><title><![CDATA[Process-Based Design Verification for Systems Involving Shared Resources]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1334</link>
<description><![CDATA[<p>In system synthesis, one need to derive from a given set of processes a system  design which is correct in the sense that the system is well-behaved (that is,  live, bounded and reversible). This is especially important for shared-resource  systems, in which erroneous situations such as deadlock and capacity overflow  are easily induced because of the sharing of common resources among different  asynchronous processes. In this paper, a process-based method is proposed for  verifying the well-behavedness of a system. The method can be performed at an  early stage of system development, where functional requirements are elicited  and interpreted as processes. By specifying the given processes as augmented  marked graphs, we perform stepwise synthesis of these augmented marked graphs  through the fusion of their common places which denote the shared resources.  Liveness, boundedness and reversibility can be effectively checked by making use  of the special properties of augmented marked graphs. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510099.pdf&amp;amp;T=Process-Based%20Design%20Verification%20for%20Systems%20Involving%20Shared%20Resources"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br />&amp;nbsp;</p><div></div><div></div>]]></description>
<pubDate>7/31/2007 22:39</pubDate>
<author><![CDATA[K.S. Cheung,K.O. Chow]]></author></item>
<item><title><![CDATA[Fair E-cash Payment Model on Credit Overdraft]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1335</link>
<description><![CDATA[<p>It proposes a fair e-cash payment model on credit outdrawing, which can avoid  the odd change and division of E-cash, Users, according to the bill of credit  issued by the bank, get the E-cash to pay their consumption to sellers after  verification by the sellers without the participation of bank at each time. The  role of banks is to solve the disputes between the users and sellers to ensure  the fairness. It can avoid the problem of partition e-cash for changes, prevent  from reusing e-cash and faking e-cash. It fits justice, anonymity, non-deny and  impartiality. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510107.pdf&amp;amp;T=Fair%20E-cash%20Payment%20Model%20on%20Credit%20Overdraft"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br />&amp;nbsp;</p><div></div><div></div>]]></description>
<pubDate>7/31/2007 22:40</pubDate>
<author><![CDATA[Shaobin Wang,Na Su,Lei Hu]]></author></item>
<item><title><![CDATA[A Fuzzy Neural Network Model with Application to Telecommunications Business]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1336</link>
<description><![CDATA[<p>There are many factors involved in a revenue-forecasting problem of  telecommunications business (TB), which are not independent and conflicted with  each other. The traditional methods of forecasting TB revenues are based on  regression analysis, but the precisions of the results are usually not satisfied  in practice. In this study, statistical analysis is first used to evaluate  factors and then the main factors are selected as inputs to construct a neural  network model combined with fuzzy rules. Furthermore, the fuzzy neural network  (FNN) model is applied to predict the revenue of a specific telecommunications  business. The results indicate that the developed FNN model satisfies practical  requirements and is possible to expand to other business applications, such as  customers&amp;rsquo; evaluation and financial risk pre-warning. To make this clearer, an  illustrative example is given for demonstration. </p><p>&amp;nbsp;<a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510112.pdf&amp;amp;T=A%20Fuzzy%20Neural%20Network%20Model%20with%20Application%20to%20Telecommunications%20Business"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> </p><div></div><div></div>]]></description>
<pubDate>7/31/2007 22:43</pubDate>
<author><![CDATA[Yongping Li,Rongjun Li]]></author></item>
<item><title><![CDATA[Cooperative Design and Development of Logistics Information System Based on Simple Factory Pattern]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1337</link>
<description><![CDATA[<p>The logistics information system usually includes many subsystems with close  interaction. The cooperative design is an inevitable in the development issue.  This paper adopts the simple factory pattern to solve the programming problem at  the beginning of system design that every subsystem is defined with interfaces  to its referencing subsystems in order to invoke during programming and reduce  the coupling with other subsystems. When adopting this simple factory pattern,  it is convenient to design and develop the overall system cooperatively, and  saving time and improving efficiency simultaneously. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510118.pdf&amp;amp;T=Cooperative%20Design%20and%20Development%20of%20Logistics%20Information%20System%20Based%20on%20Simple%20Factory%20Pattern"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a>&amp;nbsp; </p><div></div><div></div>]]></description>
<pubDate>7/31/2007 22:43</pubDate>
<author><![CDATA[Bo Yan,Biqing Huang,Hongbo Sun,Chin E. Lin]]></author></item>
<item><title><![CDATA[An Integration of Web Service and Workflow to a Wealth Management Order Placement System: A Case Study of International Brokerages]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1338</link>
<description><![CDATA[<p>With the increase in personal wealth and organization sizes, there is also an  increase in their assets. So, there is a great demand of professionals to manage  these assets and coordinate investment activities in order to maintain the  growth. Wealth Management Services are now widely offered by banks, trusts  companies, and brokerages. As the financial market becomes well-developed  worldwide, the variety of financial products also increases: equities, mutual  funds, bonds, securities, foreign currencies, and derivatives (like options,  futures, forwards, and swaps). As a Wealth Management System (WMS) plays the  role of an order placement hub, it becomes more and more complicated during each  enhancement to support order placement of additional kinds of financial  products. This is because a WMS requires different channels to communicate with  different Instrument Markets. For an international investment company, the  problem comes more complicated because the order placement processes are  heterogeneous in different countries and locations. In fact, trading systems for  different instrument markets of different countries and even different cities  are different. Workflows are also hard to coincide with different sites.  Therefore, we propose the use of Web services to implement the workflow of order  placement process. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510123.pdf&amp;amp;T=An%20Integration%20of%20Web%20Service%20and%20Workflow%20to%20a%20Wealth%20Management%20Order%20Placement%20System:%20A%20Case%20Study%20of%20International%20Brokerages"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> </p><div></div><div></div>]]></description>
<pubDate>7/31/2007 22:44</pubDate>
<author><![CDATA[Brenda Y. Hon,Dickson K.W. Chiu]]></author></item>
<item><title><![CDATA[Lot Sizing, Pricing and Lead Time Decisions with Time and Price Sensitive Demand]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1339</link>
<description><![CDATA[<p>Speed has emerged, in addition to price, as the dominant factor in determining  competitive advantage. Therefore, innovation-oriented firms have been competing  along dimensions other than price, lead time being one such dimension. In this  paper, we take a more complicated system: multiple operation system as research  object to study how to make lot sizing, pricing and lead time decisions with  time and price sensitive demand. This is different from many previous studies  which take simple systems such as M/M/1, G/G/s as their object. In this paper,  we develop an analytic model integrating both activity-based costing and  mixed-integer programming to analyze the impact of demand and lot size on  work-in-process and lead time, then studies the operating decisions of optimal  lot size, lead time and price under given conditions and the effects of market  capacity and raw material cost on these optimal decisions. The results provide  useful managerial insights for making the best competing operating decisions for  make-to-order (MTO) firms not only in service sectors but also manufacturing  sectors. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510130.pdf&amp;amp;T=Lot%20Sizing,%20Pricing%20and%20Lead%20Time%20Decisions%20with%20Time%20and%20Price%20Sensitive%20Demand"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> </p><div></div><div></div>]]></description>
<pubDate>7/31/2007 22:45</pubDate>
<author><![CDATA[Jian-jun Shao,Da-gang Ke]]></author></item>
<item><title><![CDATA[The Research on the Application Strategies of Information and Communication Technologies to Promote the Knowledge Transfer in Regional Innovation System]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1340</link>
<description><![CDATA[<p>This paper does research on the application of the information and communication  technologies to the knowledge transfer process in regional innovation system.  Firstly, we analyze the characteristics of the knowledge in regional innovation  system that involves the analysis of the nature of knowledge, the classification  of the knowledge, the knowledge transfer process and the SECI model of knowledge  transformation in regional innovation system. Secondly, the paper investigates  the benefits derived from the application of information and communication  technologies to regional innovation system. At last, we bring forward the ideas  to apply the information and communication technologies to knowledge transfer  process in regional innovation system and put forward the implementing  strategies accordingly, which include the application of the information and  communication technologies to the SECI model and the construction of the  integrated regional knowledge management system. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510138.pdf&amp;amp;T=The%20Research%20on%20the%20Application%20Strategies%20of%20Information%20and%20Communication%20Technologies%20to%20Promote%20the%20Knowledge%20Transfer%20in%20Regional%20Innovation%20System"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> </p><div></div><div></div>]]></description>
<pubDate>7/31/2007 22:47</pubDate>
<author><![CDATA[Jie Xue,Zhengang Zhang]]></author></item>
<item><title><![CDATA[Applied Research on Logistics Grid Based on ASP]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1341</link>
<description><![CDATA[<p>This paper analyzes the status and tendency of network logistic, grid and ASP  around the world, and explains the technical route of Networked-Logistic Grid  (Netlog), which can be divided into three layers, including the layer of grid  foundation, the layer of grid application enabled and the layer of grid  application realizing separately for the grid basic service, domain related grid  middleware and grid application. The target of Netlog is to research the  architecture of Netlog system, establish the platform of Netlog system and  develop the networked-logistic agile grid service system including publishing,  finding, exchanging, scheduling and optimizing the logistics resources in order  to support completely the creation, operation and integrated optimization of the  networked-logistic based on Globus and Web Service Resource Framework. AS core  enabled technologies of the networked logistics, grid and ASP will play  important roles in deploying optimally resources in logistics industry,  improving the whole competitive power of medium and small-sized enterprises and  accelerating the development of the logistic software industry. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510146.pdf&amp;amp;T=Applied%20Research%20on%20Logistics%20Grid%20Based%20on%20ASP"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> </p><div></div><div></div>]]></description>
<pubDate>7/31/2007 22:50</pubDate>
<author><![CDATA[Bo Yan,Yiyun Chen,Zhiyong Zhang]]></author></item>
<item><title><![CDATA[Task-Role-Based Access Control in Application on MIS]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1342</link>
<description><![CDATA[<p>Access control is an important measure to ensure the security of the management  information system in enterprise environment. Taking the characteristics of  Task-Role-Based Access Control (TRBAC) and the requirement of practical  application into consideration, the paper introduces TRBAC which is suitable for  enterprise environment into the design of MIS. Task is classified to support  both passive and active access control and permission assignment is also  analyzed according to task and task instance, and then the complexity of  permission management is reduced. At the same time, responsibility separation is  introduced to increase the security and performance of the system. Finally, an  application instance of TRBAC in MIS is given to show the superiority of TRBAC  in MIS. </p><p>&amp;nbsp;<a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510153.pdf&amp;amp;T=Task-Role-Based%20Access%20Control%20in%20Application%20on%20MIS"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> </p><div></div><div></div>]]></description>
<pubDate>7/31/2007 22:51</pubDate>
<author><![CDATA[Li Zhang,Lili Luo,Liyong Zhang,Tiesuo Geng,Zongge Yue]]></author></item>
<item><title><![CDATA[Alert-Driven E-government Service Management: A Case Study on Road Maintenance Management System]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1343</link>
<description><![CDATA[<p>Effective and efficient process management is of paramount importance in today&amp;rsquo;s  businesses. This is also indispensable for the maintenance of public road  system. Since the maintenance work involves lots of humans and critical  conditions, the complex communication among government departments often delay  progress of work and exceed the scheduled completion date. In order to shorten  the time of communication among departments and facilitate the workflow of  different maintenance stages, we develop a conceptual model of Road Maintenance  Management System (RMMS). The RMMS makes use of alert mechanism and Web services  for B2B interactions for handling urgent requests of road maintenance work. By  using Web services, the RMMS integrates the internal systems of various  government departments and major service providers. Based on the information  provided by the involved parties, the RMMS analyzes and handles urgent  requirements automatically and therefore could maintain the timeliness and  accuracy of public road maintenance services. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510160.pdf&amp;amp;T=Alert-Driven%20E-government%20Service%20Management:%20A%20Case%20Study%20on%20Road%20Maintenance%20Management%20System"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> </p><div></div><div></div>]]></description>
<pubDate>7/31/2007 22:52</pubDate>
<author><![CDATA[Trewina P.Y. Leung,Dickson K.W. Chiu]]></author></item>
<item><title><![CDATA[A Modified Particle Swarm Algorithm Combined with Fuzzy Neural Network with Application to Financial Risk Early Warning]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1344</link>
<description><![CDATA[<p>Particle Swarm Optimization (PSO) algorithm and Fuzzy Neural Network (FNN)  system has been widely used to solve complex decision making problems in  practice. However, both of them more or less suffer from the slow convergence  and occasionally involve in a local optimal solution. To overcome these  drawbacks of PSO and FNN, in this study a modified particle swarm optimization  algorithm (MPSO) is developed and then combined with neural network to optimize  the network weight training process. Furthermore, the new MPSO-FNN model has  been applied to financial risk early warning problem, and the results indicate  that the predictive accuracies obtained from MPSO-FNN are much higher than the  ones obtained from original FNN system. To make this clearer, an illustrative  example is also demonstrated in this study. It seems that the proposed new  comprehensive evolution algorithm may be an efficient forecasting system in  financial time series analysis. </p><p>&amp;nbsp;<a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510168.pdf&amp;amp;T=A%20Modified%20Particle%20Swarm%20Algorithm%20Combined%20with%20Fuzzy%20Neural%20Network%20with%20Application%20to%20Financial%20Risk%20Early%20Warning"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> </p><div></div><div></div>]]></description>
<pubDate>7/31/2007 23:00</pubDate>
<author><![CDATA[Fu-yuan Huang,Rong-jun Li,Han-xia Liu,Rui Li]]></author></item>
<item><title><![CDATA[The Win-Win Optimization for the Supply Chain Supernetwork with Electronic Commerce Based on the Variational Inequalities]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1345</link>
<description><![CDATA[<p>In this paper, we develop a framework for the modeling, analysis, and  computation of solutions to a supply chain supernetwork with electronic  commerce. The association processes between the manufacturers and the consumers  are accomplished through the Internet. Manufacturers are assumed to produce  homogeneous materiality products, faced with the criteria --the maximum profit.  And the demand markets can purchase the products from the manufacturers  according to their economic status through Internet. Then, logistics department  union is the combination of a manufacturer&amp;rsquo;s order management, inventory,  transportation, warehousing, materials handling, and packaging as integrated  throughout the supply chain supernetwork. Hereon this base, the optimality  conditions for the manufacturers, the logistics department union and the demand  markets are established using the variational inequality. Then we describe the  win-win situation for the supply chain supernetwork model; get the stationary  points for this situation. And an example is illustrated to validate the utility  of the model in the last part. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510174.pdf&amp;amp;T=The%20Win-Win%20Optimization%20for%20the%20Supply%20Chain%20Supernetwork%20with%20Electronic%20Commerce%20Based%20on%20the%20Variational%20Inequalities"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> </p><div></div><div></div>]]></description>
<pubDate>7/31/2007 23:02</pubDate>
<author><![CDATA[Guangfen Yang,Zhiping Wang,Youjun Wang]]></author></item>
<item><title><![CDATA[The Design and Implementation of Enterprise Strategy Outsourcing Decision-Making System Based on UML]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1346</link>
<description><![CDATA[<p>Under the environment of agile and decentralized manufacturing, manufacturing  enterprises are increasingly outsourcing their business. From the perspective of  protection and acquirement of manufacturing specification, companies&amp;rsquo; strategic  outsourcing decision-making is been focused on. The requirement analysis derived  from strategy outsourcing decision is conducted. The system of outsourcing  decision is analyzed and designed by UML. Requirement model, objects model and  system structure are developed. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510182.pdf&amp;amp;T=The%20Design%20and%20Implementation%20of%20Enterprise%20Strategy%20Outsourcing%20Decision-Making%20System%20Based%20on%20UML"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> </p><div></div><div></div>]]></description>
<pubDate>7/31/2007 23:03</pubDate>
<author><![CDATA[F. Wu,C. Liu,P.P. Li,P. Zhao]]></author></item>
<item><title><![CDATA[Supply Chain Quality Control Decision under Different Product Structures]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1347</link>
<description><![CDATA[<p>In designing a supply chain, product structure has been proved to be an  important factor affecting supply chain quality control level decision of the  buyers and the suppliers. In this article, product structure is divided into  separable and non-separable sorts. And then principal agent models for them are  set up accordingly. Classic control theory is used to solve the models. Results  under different product structures are compared. Under non-separable product  structure, the buyer&amp;rsquo;s decision on quality evaluation level is higher than that  under separable product structure, and correspondingly the buyer&amp;rsquo;s income is  higher. And the effect of product structure on supply chain quality control  decision is analyzed. At last simulation calculation is done.</p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510189.pdf&amp;amp;T=Supply%20Chain%20Quality%20Control%20Decision%20under%20Different%20Product%20Structures"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> </p><div></div><div></div>]]></description>
<pubDate>7/31/2007 23:04</pubDate>
<author><![CDATA[Cuihua Zhang,Guangshu Chang,Haibin Yu]]></author></item>
<item><title><![CDATA[Using Statistical Similarity to Identify Corresponding Attributes between Heterogeneous Spatial Databases]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1348</link>
<description><![CDATA[<p>One step in integrating heterogeneous database systems is matching equivalent  attributes: Determine which fields in two databases refer to same real world  entity character. In this paper, we present a methodology based on instance  statistic similarity for identifying corresponding attributes in heterogonous  spatial databases which has three basic steps. In first step, the corresponding  of the same entities in heterogeneous spatial datasets is built by means of  geometrical matching. In second step, attribute similarity, which is expressed  by a value between 0 and 1, is computed according to attributes values of the  same entity. We design different similarity compute models for different kind of  attributes. At last, corresponding attributes are identified by means of  comparing attribute similarity value with the predefined threshold. An  experimental result is presented which shows the effectiveness and precision 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/apscc/2006/2751/00/27510194.pdf&amp;amp;T=Using%20Statistical%20Similarity%20to%20Identify%20Corresponding%20Attributes%20between%20Heterogeneous%20Spatial%20Databases"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br />&amp;nbsp;</p><div></div><div></div>]]></description>
<pubDate>7/31/2007 23:05</pubDate>
<author><![CDATA[Su-ling Wang,Jun Xu,Qi Zeng]]></author></item>
<item><title><![CDATA[Applying Data Mining and Petri Net in Reengineering of Manufacture Management Information System]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1349</link>
<description><![CDATA[<p>This paper studied association rules mining algorithm for mining process model  in workflow log of manufacture management information system with XML  technology, applied Petri Net in modelling, simulation and optimization of  process model, and studied the method for reengineering and optimization of  information system based on function units in terms of optimized process model,  it was pointed that the difference between actual process model and the process  model implied in information system would lead to the decrease of efficiency of  information system, and the reengineering and optimization of information system  based on actual optimized process model would lead to improvement of efficiency.  It was proved with experiments that the association rules mining algorithm put  forward in this paper is better than traditional algorithm Apriori in  performance. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510200.pdf&amp;amp;T=Applying%20Data%20Mining%20and%20Petri%20Net%20in%20Reengineering%20of%20Manufacture%20Management%20Information%20System"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> </p><div></div><div></div>]]></description>
<pubDate>7/31/2007 23:12</pubDate>
<author><![CDATA[Shaoqin Wu,Chaoan Lai,Yanming Sun]]></author></item>
<item><title><![CDATA[Decision Process Reengineering of Outsourcing Based on Manufacturing Specification Management]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1350</link>
<description><![CDATA[<p>Outsourcing decision-making is related widely factors which are complex and  multi- perspectives problems. It is necessary a visual logic process which could  be used to recognize complex decision processes in order to let the problems be  discussed under an open environment. AS-IS outsourcing process of decision is  analyzed by IDEF0 which includes the faults such as only operational  consideration for continuous production and short aim of profit and no strategic  consideration for core manufacturing competence acquiring and holding.  Re-engineering of outsourcing decision process is carried out based on above  from perspectives of object, subject, outcome of decision and supplier  selection. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510207.pdf&amp;amp;T=Decision%20Process%20Reengineering%20of%20Outsourcing%20Based%20on%20Manufacturing%20Specification%20Management"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> </p><div></div><div></div>]]></description>
<pubDate>7/31/2007 23:14</pubDate>
<author><![CDATA[F. Wu,C. Liu,P.P. Li,L.J. Ai]]></author></item>
<item><title><![CDATA[A Portal for Logistics Service Provider to Integrate Supply Chain]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1351</link>
<description><![CDATA[<p>This paper investigates the integration strategies for logistics service  provider (LSP) and supply chain (SC). Firstly, we analyze the existing issues of  supply chain integration and the research on third party logistics (3PL) as well  as fourth party logistics (4PL). Secondly, we propose the integration strategies  from logistics activities integration and information integration respectively.  From the information technology (IT) point of view, we present the measures for  LSP to integrate supplier, manufacturer and wholesaler in SC. On the basis of  this, we investigate the information exchange mode, logistics activities  integration and coordination, as well as the implementation methods of supply  chain integration based on information and logistics activities. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510213.pdf&amp;amp;T=A%20Portal%20for%20Logistics%20Service%20Provider%20to%20Integrate%20Supply%20Chain"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br />&amp;nbsp;</p><div></div><div></div>]]></description>
<pubDate>7/31/2007 23:15</pubDate>
<author><![CDATA[Zhiyong Zhang,Tao Cheng,Bo Yan]]></author></item>
<item><title><![CDATA[The Optimization and Design of Procurement Strategy in E-commerce]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1352</link>
<description><![CDATA[<p>Procurement management is one of the most valuable parts in supply chain  management (SCM). In e-commerce era, the complexity and levity of procurement  management become greatly outstanding because customer demands are changing  faster and faster. Modern information technology (IT) plays an increasingly  important role in procurement management and brings a global e-procurement  /e-purchasing. In this paper, we establish a two-period replenishment model of  (s, S) strategy to analyze the operation cost efficiency of the traditional  procurement in strategic partnership, e-procurement and the mixed procurement  strategy respectively. The model quantifies the effect of the Internet on  procurement management. Then, the validity of the model is verified through a  case study of a state-owned extra-large steel enterprise of China. The study  concluded that the implementation of e-procurement technology can effectively  reduce supply base and increase the profit margin of both the buyer and the  supplier. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510219.pdf&amp;amp;T=The%20Optimization%20and%20Design%20of%20Procurement%20Strategy%20in%20E-commerce"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> </p><div></div><div></div>]]></description>
<pubDate>7/31/2007 23:17</pubDate>
<author><![CDATA[Guangshu Chang]]></author></item>
<item><title><![CDATA[Research on Hot Line Lottery-Ticket-Buying Project Based on PSTN SMS]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1353</link>
<description><![CDATA[<p>This paper introduces a kind of hot line lottery-ticket-buying project based on  China&amp;rsquo;s Publish Switch Telephone Network (PSTN) Short Message System (SMS). This  project expands and improves on SMS. It adds a trade module of Chinese Terminal  Service Interface (CTSI) server, operation trade gateway and specialized CP  system (it also means to connect with the lottery service system and the lottery  center), and meanwhile expands the CTSI protocol to enable SMS to connect with  lottery center interactively, which can overcome the shortages of SMS that just  carries out storage and retransmit functions. Different from  lottery-ticket-buying system nowadays in China, this system is a kind of hot  line system which can extends the deadline of bet and increases the lottery  sale. The content of this paper are system constitution, protocol expanding,  system function and advantages and disadvantages of this system. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510225.pdf&amp;amp;T=Research%20on%20Hot%20Line%20Lottery-Ticket-Buying%20Project%20Based%20on%20PSTN%20SMS"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> </p><div></div><div></div>]]></description>
<pubDate>7/31/2007 23:18</pubDate>
<author><![CDATA[Yong Xu]]></author></item>
<item><title><![CDATA[A Logistics Service Differentiation Decision Model Based on Service Level]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1354</link>
<description><![CDATA[<p>This paper sets up a decision-made process model of logistics service  differentiation based on market segments and customer demands analysis and  elaborates the design of logistics service differentiation and the total cost  service analysis. Especially, this paper provides a method of cost-service  tradeoffs through the determination of the lowest demand quantity, which is  determined by the quota relations among the income, the unit logistics cost and  the demand quantity on a certain service level. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510233.pdf&amp;amp;T=A%20Logistics%20Service%20Differentiation%20Decision%20Model%20Based%20on%20Service%20Level"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br />&amp;nbsp;</p><div></div><div></div>]]></description>
<pubDate>7/31/2007 23:19</pubDate>
<author><![CDATA[Juan Xu,Zhixue Liu]]></author></item>
<item><title><![CDATA[The Oversea Investment Decision of a Horizontally Integrated Multinationals--A Research in View of the Monopolistic Competition Frame]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1355</link>
<description><![CDATA[This paper investigates the following factors: (1) population scale;(2) income  level;(3) the expenditure proportion on industrial products;(3) wages level;(5)  transaction costs;(6) elasticity of substitution;(7) marginal costs, which  functions acted on the horizontal FDI scale of host country from developed  country in a monopolistic competition model composed of the developed country  enterprises and the host country enterprises. On this foundation trying to study  whether the developing country can keep on to draw on more and more horizontal  FDI.  <p>This paper mainly concludes the following: Horizontal FDI flows to the  flourishing countries and regions which economic development levels reach to a  certain stage from developed countries generally, but the change of transaction  costs would influence the location to horizontal FDI. When the transaction cost  is bigger, the horizontal FDI also may be thrown to comparatively less developed  countries and regions.</p> <p>In a certain period, the market scale of the host country is an important  factor to choose location for horizontal FDI. Under the conditions for  horizontal FDI entering into, as long as the growth speed of market scale is  bigger than it of production cost, the host country can draw on horizontal FDI  constantly.</p> <p>Because of the diversified characteristics of the economic development stage,  China should choose and arrange in pairs or groups effectively when China makes  use of the special policy to draw on foreign direct investments. For eastern  littoral it is good to adopt general foreign direct investment policy to attract  horizontal FDI, but not to adopt encouraging preferential policies. For the  Midwestern it is good to adopt special pertinent preferential policy to promote  vertical FDI steps transfer to the Midwest from the eastern  littoral.</p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510239.pdf&amp;amp;T=The%20Oversea%20Investment%20Decision%20of%20a%20Horizontally%20Integrated%20Multinationals--A%20Research%20in%20View%20of%20the%20Monopolistic%20Competition%20Frame"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> </p><div></div><div></div>]]></description>
<pubDate>7/31/2007 23:19</pubDate>
<author><![CDATA[Yan-bo Zhang,Yan-hui Wang]]></author></item>
<item><title><![CDATA[The Bipartite Network Based Growth Mechanisms of Complex Company Competitive Relationship Networks]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1356</link>
<description><![CDATA[<p>Prominent scale-free distributions of competitive relationships are observed in  some empirical studies on some complex company competitive relationship networks  (CRNs). To uncover the driving forces of these properties, the company-product  bipartite network model, which is the prototype of CRN, is used to depict the  dynamics of industries. The growth mechanisms of the network model based on the  industry-specific traits are helpful in understanding the different properties  of CRNs between industries. A simplified simulation implies that the structural  properties of CRNs can be different among industries and may alter at different  life cycle stages of an industry. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510247.pdf&amp;amp;T=The%20Bipartite%20Network%20Based%20Growth%20Mechanisms%20of%20Complex%20Company%20Competitive%20Relationship%20Networks"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> </p><div></div><div></div>]]></description>
<pubDate>7/31/2007 23:21</pubDate>
<author><![CDATA[Dong Zhuang,Jianmei Yang,Xiangdong Pan,Weiliang Tang]]></author></item>
<item><title><![CDATA[Integrated Design for Electronic Experimental System over Internet]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1357</link>
<description><![CDATA[<p>A UML model and modeling method of Electronic Experimental System (EES) operated  over internet were addressed in this paper. EES operated over internet is a  system that can support the operating of electronic instruments and circuits. It  is a challenge that the normal running of the electronic instruments and  circuits should be guaranteed. The EES is designed for multi-terminal to operate  the same experiment circuitry and a set of instruments such as function  generator and oscilloscope. After a brief introduction about UML, this article  details the modeling procedure with the application of UML, especially use case  diagram, class diagram and statechart of the system, and verifies it with SPIN  by transforming the model into PROMELA. </p><p>&amp;nbsp;<a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510253.pdf&amp;amp;T=Integrated%20Design%20for%20Electronic%20Experimental%20System%20over%20Internet"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a></p><div></div><div></div>]]></description>
<pubDate>7/31/2007 23:23</pubDate>
<author><![CDATA[Yichan Lu,Zheying Li]]></author></item>
<item><title><![CDATA[Determinants of Venture Capital-Backed Firms Performance: A Conceptual Framework]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1358</link>
<description><![CDATA[<p>As the intensity increases rapidly in terms of business competition, it is very  necessary to gain a better insight into what factors could influence the  performance of venture capital-backed firms, which will enable venture  capitalists to identify viable business opportunities and entrepreneurs to  explore competitive advantages. This paper mainly studies the determinants of  venture capital-backed firms&amp;#39; performance. The authors develop a conceptual  framework for analyzing the impact of different factors on performance of  venture capital-backed firms, and propose five hypotheses. Namely, industry  growth, internal capabilities, entrepreneurial strategy making, venture  capitalists value-added activities and external networks will be positively  related to the performance of venture capital-backed firms. Finally, this paper  discusses implications of the study and also provides directions for future  research. This study provides a platform to future empirical investigation. It  will facilitate researchers to go one step further to find out what factors can  improve the performance of venture capital-backed firms. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510265.pdf&amp;amp;T=Determinants%20of%20Venture%20Capital-Backed%20Firms%20Performance:%20A%20Conceptual%20Framework"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> </p><div></div><div></div>]]></description>
<pubDate>7/31/2007 23:25</pubDate>
<author><![CDATA[Erli Liu,Yi Cui,Ronghui Fan]]></author></item>
<item><title><![CDATA[Explore New Profiting Method for TV Based on P2P Streaming Media Technology]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1359</link>
<description><![CDATA[<p>Looking back on the transition of the profiting mode in internal broadcasting  and television industry, the paper mainly analyzes the basic framework and  applying prospect of a web living broadcast system based on p2p mode. The system  is comprised of four parts: directory server, channel information server,  publishing server and client-end program. With the system, traditional TV  station media can easily their programs on Internet by configuring one or two  servers, which spends just a little cost. At last, we look in a new profiting  mode, which is based on the new-generation P2 P-IPTV platform for TV  stations. </p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510276.pdf&amp;amp;T=Explore%20New%20Profiting%20Method%20for%20TV%20Based%20on%20P2P%20Streaming%20Media%20Technology"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a><div></div><div></div>]]></description>
<pubDate>7/31/2007 23:27</pubDate>
<author><![CDATA[Jing Tang,Can Yang,Xinxin Chen]]></author></item>
<item><title><![CDATA[The Study of Strategy of Persuasive Advertising Investment]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1360</link>
<description><![CDATA[<p>This paper develops the model of advertising investment with game theory,  studies the advertising investment strategy of two companies separately in  duopoly, and gives theory support for doing investment in advertising of  enterprise. With the persuading effects of advertisement, enterprise makes  products different professedly through advertising activity in order to persuade  consumers to spend more money buying those products with higher price. This  paper provides strategy of advertisement investment in the simultaneous-move  game and judge from the results of comparing the result got from the paper with  the result of Cournot equilibrium .The paper concludes that enterprises have  possibilities of advertising by the influence of the efficiency factor.  Otherwise the investment will consume the profits rather than make profits for  the enterprise. Meanwhile we analyze the influence on profits, which is put by  the efficiency factor in making price. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510280.pdf&amp;amp;T=The%20Study%20of%20Strategy%20of%20Persuasive%20Advertising%20Investment"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> </p><div></div><div></div>]]></description>
<pubDate>8/01/2007 02:11</pubDate>
<author><![CDATA[Tiebo Song,Xiong Chen,Yonggang Yin,Wenfeng Cen]]></author></item>
<item><title><![CDATA[The Research and Realization of a New Workflow Model with Step-Task Two Layers Based on Document]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1361</link>
<description><![CDATA[<p>With the increasing in complexion of large-scale activities in business process,  workflow model has been focused on highly than before. In this research, a new  workflow model (WfM) with two layers (Step and Task layers) was proposed, which  leads to process logic and concrete affairs couple loose, and deals with  problems of simple logic of directed graph WfM and complex realization of net  structure WfM. With the half structure model, process logic is defined during  design, and real tasks route is chosen in practice, which enhances the  flexibility of WfM. Besides, the notion, document-driven workflow, was  introduced in that WfM. The parsing process of documents, the design format of  documents and the delivery technology were also given. In order to accomplish a  complete WfM, we integrated WfM and organization model in both static and  dynamic ways. Finally we delineate the realization of S-T platform based on that  WfM in this paper. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510285.pdf&amp;amp;T=The%20Research%20and%20Realization%20of%20a%20New%20Workflow%20Model%20with%20Step-Task%20Two%20Layers%20Based%20on%20Document"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> </p><div></div><div></div>]]></description>
<pubDate>8/01/2007 02:20</pubDate>
<author><![CDATA[Lin Zhao,Jianping Xing,Lingguo Meng]]></author></item>
<item><title><![CDATA[The Research of Competitive Intelligence Organization of Dynamic Alliance (CIODA) in E-Commerce]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1362</link>
<description><![CDATA[<p>This paper points out the research of Competitive Intelligence Organization of  dynamic alliance (CIODA) in E-commerce and analyzes the frame and the operation  flow of CIODA with the modeling tools such as IDEF0 and IDEF3. Then it studies  the complexity as well as the solution mentality of CIODA. </p><p>&amp;nbsp;<a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510293.pdf&amp;amp;T=The%20Research%20of%20Competitive%20Intelligence%20Organization%20of%20Dynamic%20Alliance%20%28CIODA%29%20in%20E-Commerce"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> </p><div></div><div></div>]]></description>
<pubDate>8/01/2007 02:21</pubDate>
<author><![CDATA[Xiaowei Wu,Xiaobei Liang,Wenguan Song]]></author></item>
<item><title><![CDATA[Suspicious Financial Transaction Detection Based on Empirical Mode Decomposition Method]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1363</link>
<description><![CDATA[<p>Traditional financial surveillance system usually discriminates suspicious  transaction by comparing every transaction against its corresponding account  history. This process always results in high false positive rate because it is  regardless of the existence of economic cycle and business fluctuation. We  conceived a new analyzingprototype by comparing an account time series  transaction data against its peer group. It has deeply considered the injuence  of normal jluctuation widely existing in real life and could eflciently reduce  the number of false positives with a better understanding of customer 5.  behavior pattern. A new method Empirical Mode Decomposition (EMD) developed  initially for natural and engineering sciences has now been applied to financial  time series data. This method has shown its superiorities in analyzing nonlinear  and nonstationary stochastic engineering time series over traditional Discrete  Fourier Decomposrtlon (DFD) and wavelet decomposition methods. Firstly the  complex financial time series is decomposed into some local detail parts and one  global tendency part which represent different time scales like daily, monthly,  seasonal or annuat. Then a linear segment approximation method based on  hierarchical piecewise linear representation (LPR) is used to fulfill the quick  matching of the major tendency parts between two time series. The results from  experiments on real life bank data lfoveign exchange transaction data sets)  exhibit that the EMD can become a vital technique for the analysis offinancial  suspicious transaction detection. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510300.pdf&amp;amp;T=Suspicious%20Financial%20Transaction%20Detection%20Based%20on%20Empirical%20Mode%20Decomposition%20Method"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br />&amp;nbsp;</p><div></div><div></div>]]></description>
<pubDate>8/01/2007 02:41</pubDate>
<author><![CDATA[Tianqing Zhu]]></author></item>
<item><title><![CDATA[A Sandwich Model for Business Integration in BOA (Business Oriented Architecture)]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1364</link>
<description><![CDATA[<p>With the constant development of enterprises, the cost of developing new  business becomes higher than that in the past, but there is still no better  strategy to integrate old businesses together. Comparing integrated tactics such  as EAI (Enterprise Application Integration), SOI (Service-Oriented Integration),  etc., combining the most popular technology SOA (Services Oriented  Architecture), pouring the relevant experience into integration according to the  idea proposed by BOA (Business Oriented Architecture) and utilizing different  kinds of Agents to deal with different businesses, I will introduce a Sandwich  Model to solve the problem of business integration. And at the end of this  paper, the feasibility, advantages, and disadvantages of the model are  regarded. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510305.pdf&amp;amp;T=A%20Sandwich%20Model%20for%20Business%20Integration%20in%20BOA%20%28Business%20Oriented%20Architecture%29"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br />&amp;nbsp;</p><div></div><div></div>]]></description>
<pubDate>8/01/2007 02:43</pubDate>
<author><![CDATA[Juan Zhu,Li Zhen Zhang]]></author></item>
<item><title><![CDATA[Evaluating ERP Performance from User Perspective]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1365</link>
<description><![CDATA[<p>Over the past decade, organizations have spent billions of dollars implementing  ERP systems. Most of evaluation methodologies for ERP systems originated in the  functional/technical and/or economic/financial paradigms. Previous researches  have suggested user satisfaction is one of key factor evaluating IS performance.  This study investigated ERP performance from user perspective. A multi case  study approach was used to collect data in 13 Taiwanese companies. The findings  indicated that ERP users were satisfied with their systems in terms of task and  decision support although information quality was critiqued by some users. ERP  implementation was found to impact employee&amp;rsquo;s feelings, physical needs and  psychological states. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510311.pdf&amp;amp;T=Evaluating%20ERP%20Performance%20from%20User%20Perspective"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br />&amp;nbsp;</p><div></div><div></div>]]></description>
<pubDate>8/01/2007 02:44</pubDate>
<author><![CDATA[ Jen-Yin Yeh]]></author></item>
<item><title><![CDATA[Process Computing of Complaint Service Management in Reverse Logistics]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1366</link>
<description><![CDATA[<p>Nowadays, the significance of reverse logistics (RL) has been regarded by more  and more enterprises increasingly. The complaint service management in reverse  logistics (CSMRL) is an important content for reverse logistics strategy. Along  with the rapid development of art and science, it is necessary and required to  enable these advanced technologies to help CSMRL perform more efficiently and  effectively. In this paper we take into consideration the process computing of  CSMRL. The process of CSMRL includes three parts of collection, evaluation and  disposal. Based on the computer telephone integration technology an integration  multi-channels collection route-way can be designed; the evaluation of complaint  and production is supported by intelligent decision support system; in accord  with the different disposal countermeasures, the CSMRL processing system is  established to implement corresponding disposal. As mentioned of the paper at  last, the research on the process computing of CSMRL will be significant for  business service computing in the future. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510315.pdf&amp;amp;T=Process%20Computing%20of%20Complaint%20Service%20Management%20in%20Reverse%20Logistics"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br />&amp;nbsp;</p><div></div><div></div>]]></description>
<pubDate>8/01/2007 02:45</pubDate>
<author><![CDATA[Yi He,Zhixue Liu]]></author></item>
<item><title><![CDATA[Approach to SOA-Based Bioinformatics Grid]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1367</link>
<description><![CDATA[<p>Bioinformatics grid has emerged to meet the sharp requirement for computation  and storage resource in the bioinformatics research field. In this paper, a  design of SOA-based bioinformatics grid system is put forward under the WSRF  specification. It aggregates existing tools such as BLAST, wrapped as Web  Services, through WS-ServiceGroup, and supports the development, deployment,  execution and monitoring of complex bioinformatics grid application. Based on  the supporting environment, applications can access bioinformatics resource in a  transparent manner. This paper also presents a use case to show the process of  workflow building, execution and monitoring. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510323.pdf&amp;amp;T=An%20Approach%20to%20SOA-Based%20Bioinformatics%20Grid"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br />&amp;nbsp;</p><div></div><div></div>]]></description>
<pubDate>8/01/2007 02:47</pubDate>
<author><![CDATA[Guoshi Xu,Yin Luo,Huashan Yu,Zhuoqun Xu]]></author></item>
<item><title><![CDATA[Web Services Publishing and Discovery on Peer-to-Peer Overlay]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1368</link>
<description><![CDATA[<p>Centralized UDDI currently becomes harder to catch up with the need of  Internet-scale service publishing and discovery. Peer-to-Peer technology with  its advantages of scalability, fault-tolerance and dynamics is suitable for  loose-coupled Web services&amp;rsquo; distribution in nature and prevailing nowadays. In  this paper, we present a distributed, collaborative Peer-to-Peer service overlay  suitable for service publishing and discovery based on Skip Graph which could be  organized by planar model or tree model according to the scale of services. We  propose a prefix-ordered clustering mechanism that congregates the keys within a  fixed prefix into the same bucket and make the smallest one appeared as the key  in the service overlay which would support prefix, range query and semantic  matching onWeb services. We then analyze the performance of our proposed with  simulation that validates the effectiveness of the service overlay. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510329.pdf&amp;amp;T=Web%20Services%20Publishing%20and%20Discovery%20on%20Peer-to-Peer%20Overlay"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br />&amp;nbsp;</p><div></div><div></div>]]></description>
<pubDate>8/01/2007 02:48</pubDate>
<author><![CDATA[JianJun Yu,Rui Chen,Hao Su,Shengmin Guo]]></author></item>
<item><title><![CDATA[Applying Software Component Technology to NP-based System for Novel Network Services]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1369</link>
<description><![CDATA[<p>With the explosion of low-cost bandwidth availability, many desirable e-business  features require new functionality in enterprise networking systems, and thus  force the network components to be both flexible and powerful. Programmable  routers (typically NP-based systems) as a platform on which to implement the  enterprise applications seem to fit the bill. Meanwhile, the demands for  accommodating an increasingly diverse range of novel network services in such  system are still keep growing. To meet these challenges, this paper presents a  novel methodology for building control plane software using component technology  in programmable network environment. The proposed approach can facilitate the  developing of scalable, flexible modular NP-based systems that are required to  the e-business world. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510335.pdf&amp;amp;T=Applying%20Software%20Component%20Technology%20to%20NP-based%20System%20for%20Novel%20Network%20Services"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br />&amp;nbsp;</p><div></div><div></div>]]></description>
<pubDate>8/01/2007 02:49</pubDate>
<author><![CDATA[Xian-Cheng Xu,Ling Zhang,Shou-Bin Dong]]></author></item>
<item><title><![CDATA[Semantic Web Services Composition Using AI Planning of Description Logics]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1370</link>
<description><![CDATA[<p>Web services composition techniques are gaining momentum as the opportunity to  establish reusable and versatile inter-operability applications. The purpose of  Semantic Web Services is to use semantic specification to automate the  discovery, invocation, and composition Web services. Description logics is the  formalized foundation of Semantic Web Services and provides well-defined  semantics. And many researchers propose their composition approach based on  planning techniques. We propose our service composition methods based on  description logics and AI planning technologies. Our algorithm for Services  composition uses backward-chaining search method to find potential candidate  services. And We propose a DAG-based method to generate the planning process and  filtering the inappropriate services during the DAG generation process. We test  our approach on a simple, yet realistic example, and the preliminary results  demonstrate that our implementation provides a practical solution. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510340.pdf&amp;amp;T=Semantic%20Web%20Services%20Composition%20Using%20AI%20Planning%20of%20Description%20Logics"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br />&amp;nbsp;</p><div></div><div></div>]]></description>
<pubDate>8/01/2007 02:50</pubDate>
<author><![CDATA[Lirong Qiu,Fen Lin,Changlin Wan,Zhongzhi Shi]]></author></item>
<item><title><![CDATA[Discovering Web Services Based on Functional Semantics]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1371</link>
<description><![CDATA[<p>With the rapid development of web services technologies, discovering web  services is becoming the most urgent problem to be resolved. The existing web  service discovery methods are not mature, and cannot cope with the requests from  different fields very well. In this paper we suggest an effective and feasible  approach of web service discovery based on functional semantics. We define web  services functional semantic description that provides a unified manner to  semantically describe the function of web service for service providers and  customers. In order to avoid semantic heterogeneity, we build domain-oriented  functional ontology and propose semantic annotation mechanism. Then we describe  the matching algorithm. Finally we evaluate the performance of our algorithm by  an experimental setup. The results of the experiment prove that our approach is  feasible and effective. </p><p>&amp;nbsp;<a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510348.pdf&amp;amp;T=Discovering%20Web%20Services%20Based%20on%20Functional%20Semantics"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> </p><div></div><div></div>]]></description>
<pubDate>8/01/2007 02:51</pubDate>
<author><![CDATA[Lei Ye,Bin Zhang]]></author></item>
<item><title><![CDATA[Personalized Recommendation Services Based on Service-Oriented Architecture]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1372</link>
<description><![CDATA[<p>Recommendation systems are special personalization tools that help users to find  interesting information and services. This paper proposes a personalized  recommendation system based on service-oriented architectures (SOAs). It  introduces service-oriented recommendation technologies such as recommendation  engines, data mining, content-based approach and collaborative filtering. It  discusses service-oriented architecture, especially for service discovery and  SOA for recommendation system. Then, it analyzes personalized recommendation  system and proposes relative system architectures. Finally, it gives a case  study about e-shop recommendation to illustrate the novel services. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510356.pdf&amp;amp;T=Personalized%20Recommendation%20Services%20Based%20on%20Service-Oriented%20Architecture"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br />&amp;nbsp;</p><div></div><div></div>]]></description>
<pubDate>8/01/2007 03:16</pubDate>
<author><![CDATA[Quan Wen,Jianmin He]]></author></item>
<item><title><![CDATA[The Lagrangian Algorithm Implement of QoS-Aware Service Composition on P2P Network]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1373</link>
<description><![CDATA[<p>This paper introduces QoS attributes into the P2P network and proposes a service  composition model, then gives a computing method of service composition. Then,  we adopt a Lagrangian relaxtion algorithm, providing an approach to satisfy the  customer&amp;rsquo;s service level agreement. Finally, a set of experiments show that the  proposed model and algorithms can achieve better performance. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510356.pdf&amp;amp;T=The%20Lagrangian%20Algorithm%20Implement%20of%20QoS-Aware%20Service%20Composition%20on%20P2P%20Network"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br />&amp;nbsp;</p><div></div><div></div>]]></description>
<pubDate>8/01/2007 03:19</pubDate>
<author><![CDATA[Xiao-Yan Gao,Zhen-Wei Yu,Yin-Long Shi]]></author></item>
<item><title><![CDATA[A Grid-Enabled Architecture for Geospatial Data Sharing]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1374</link>
<description><![CDATA[<p>This paper explores combining OGC and Grid technologies for geospatial data  sharing. OGC and Grid technologies have different focuses: OGC technologies  focus more on interface specifications and encodings for the access to  geospatial data sources, while Grid technologies focus more on the collaboration  and sharing of resources. By combining both, we hope to leverage each other&amp;rsquo;s  strengths. In the paper, we first introduce our Grid-enabled architecture which  is based on both OGC and Grid technologies, then we discuss how Grid-enabled OGC  web services can be integrated with non-Grid-enabled ones, and finally, we  report our initial implementation of a case study. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510369.pdf&amp;amp;T=A%20Grid-Enabled%20Architecture%20for%20Geospatial%20Data%20Sharing"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br />&amp;nbsp;</p><div></div><div></div>]]></description>
<pubDate>8/01/2007 03:20</pubDate>
<author><![CDATA[Yanfeng Shu,Jack Fan Zhang,Xiaofang Zhou]]></author></item>
<item><title><![CDATA[Investigating Rivalry in Tele-mobile Service Industry in China: A System Dynamics Approach]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1375</link>
<description><![CDATA[<p>The current mobile service in China displays a highly dynamic competition  between two major operators, China Mobile and China Unicom. Their market share  concerning the number of subscriber is influenced by the subscriber base,  service quality, pricing policy, etc. Current researches and analyses are mostly  direct comparisons of the relative advantage of the two operators, in which  weights of every item being compared are chosen almost arbitrarily and the  dynamic relationships between these items are usually ignored. This research  stands from the view of China Mobile, the bigger and earlier operator, to  explore the reason of its shrinking market share after SMS (Short Message  Service) becomes popular in China. The dynamics between the service quality,  exchange capacity, price in the mobile service are highlighted to show how these  factors influence the growth of the total mobile market and the relative  advantage in the duopoly as well. Long run and short run effects of these  factors are differentiated so as to make it possible to suggest some proper  policies for China Mobile to keep the leadership in the market. </p><p>&amp;nbsp;<a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510376.pdf&amp;amp;T=Investigating%20Rivalry%20in%20Tele-mobile%20Service%20Industry%20in%20China:%20A%20System%20Dynamics%20Approach"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> </p><div></div><div></div>]]></description>
<pubDate>8/01/2007 03:21</pubDate>
<author><![CDATA[Yueping Chen,Yongguang Zhong]]></author></item>
<item><title><![CDATA[A New Architecture of Data Access Middleware under Grid Environment]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1376</link>
<description><![CDATA[<p>Data sharing is one of the most important research areas in data grid.  Distributed data resource and heterogeneous data schema bring difficulties to  data Access and sharing. This article mainly focuses on how to deal with the  heterogeneity of data schema and put forward a blueprint to solve the data  access and sharing problem of heterogeneous physical data resources in the grid.  To solve this problem we propose the SDB resource model which extracts three  data layers from the physical data resource in order to facilitate the access  and sharing of data resource. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510384.pdf&amp;amp;T=A%20New%20Architecture%20of%20Data%20Access%20Middleware%20under%20Grid%20Environment"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a>&amp;nbsp; </p><div></div><div></div>]]></description>
<pubDate>8/01/2007 03:22</pubDate>
<author><![CDATA[Qingyang Wang,Jingshu Chen,Xibin Gao,Wei Zhou,Baoping Yan]]></author></item>
<item><title><![CDATA[A Lightweight Approach towards Autonomic Service-Oriented Computing System Development]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1377</link>
<description><![CDATA[<p>Autonomic service-oriented computing system, which exposes much flexbility and  intelligence, is taken as a promising paradigm to deal with drawbacks appearing  in current complex large scale heterogeneous computing systems, such as  difficulties in construction, administration and maintenance. However presently  there are not suitable approaches to design and implement such kind of systems.  In this paper, a lightweight approach to autonomic service-oriented computing  system development is proposed. The approach consists of three parts: an  architectural style which entails quite a few flexible and intelligent  properties; a lightweight process to design computing system under the proposed  architectural style; a high level executable modeling language to implement the  designed system. A case study is given to illustrate the approach. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510392.pdf&amp;amp;T=A%20Lightweight%20Approach%20towards%20Autonomic%20Service-Oriented%20Computing%20System%20Development"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br />&amp;nbsp;</p><div></div><div></div>]]></description>
<pubDate>8/01/2007 03:23</pubDate>
<author><![CDATA[Guoyong Cai,Ji Gao,Bin Hu]]></author></item>
<item><title><![CDATA[ZigBee Routing Selection Strategy Based on Data Services and Energy-Balanced ZigBee Routing]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1378</link>
<description><![CDATA[<p>A mixed routing strategy of AODV and Tree Routing is designed in the ZigBee  specification. But there is no method designed to balance these two Routing  modes in order to achieve better performance. We realized the ZigBee protocol  module in NS2. Simulations had been run to analyze the ZigBee network  performance. According to the analysis, a strategy of ZigBee routing selection  based on data services has been proposed. The simulation results show that such  routing selection strategy has excellent network performance and low energy  consumption. Additionally, the power control is not much considered in ZigBee  Routing specification. But for the ad hoc wireless network application, power  control is the most significant issue in ZigBee. So a power control strategy is  proposed to improve the ZigBee routing, the simulation results show that this  power control strategy will greatly balance the node energy, avoid that nodes  use up all the battery power and die too early. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510400.pdf&amp;amp;T=ZigBee%20Routing%20Selection%20Strategy%20Based%20on%20Data%20Services%20and%20Energy-Balanced%20ZigBee%20Routing"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br />&amp;nbsp;</p><div></div><div></div>]]></description>
<pubDate>8/01/2007 03:23</pubDate>
<author><![CDATA[Peng Ran,Mao-heng Sun,You-min Zou]]></author></item>
<item><title><![CDATA[A BPEL4WS-based Composite Service Modeling Solution in Manufacturing Grid]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1379</link>
<description><![CDATA[<p>In Manufacturing Grid, a lot of applications and resources in manufacturing  enterprises are encapsulated as web services and a cooperative work environment  is provided. Applying web service composition and workflow technologies,  services are integrated into a composite service to represent a cooperative  business process. Therefore the enterprise cooperation can be implemented by  executing and monitoring the composite service. According to the characteristics  of Manufacturing, this paper presents a composite service modeling solution  based on BPEL4WS and discusses how this solution support BPEL4WS during the  whole modeling process. The solution includes dynamic service discovery and  service selection to support a flexible binding with the partners&amp;rsquo; services.  This paper also describes how to execute and monitor the composite  service. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510405.pdf&amp;amp;T=A%20BPEL4WS-based%20Composite%20Service%20Modeling%20Solution%20in%20Manufacturing%20Grid"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br />&amp;nbsp;</p><div></div><div></div>]]></description>
<pubDate>8/01/2007 03:36</pubDate>
<author><![CDATA[Lei Duan,Shi-jun Liu,Chang-he Tu,Xiang-xu Meng]]></author></item>
<item><title><![CDATA[Research on Grid-Based Traffic Simulation Platform]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1380</link>
<description><![CDATA[With the improvement of the traffic complexity extent, the solution of traffic  problems becomes more and more difficult in the reality, so traffic simulation  is an effective method for analyzing the traffic states and problems. As the  simulation area becomes larger and more complicate, which requires large  computing and storage resources, it can&amp;#39;t be resolved by the traditional  computing technology. Due to grid technology&amp;#39;s advantages on such aspects, a new  simulation architecture named GHA, which implements the HLA&amp;#39;s [4] component as  grid service and combined with the agent technology is presented in this paper.  Thus the simulation architecture can offer high-capable computing resources to  solve the complex traffic issues with great expansibility and flexibility;  moreover, it also makes solid foundation to the authenticity of traffic  simulation by adopting agent model the character of traffic entity.  <p>At last, a traffic simulation platform is implemented based on GHA and the  performance tests are given.</p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510411.pdf&amp;amp;T=Research%20on%20Grid-Based%20Traffic%20Simulation%20Platform"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br />&amp;nbsp;</p><div></div><div></div>]]></description>
<pubDate>8/01/2007 03:37</pubDate>
<author><![CDATA[Jiankun Wu,Linpeng Huang,Jian Cao,Minglu Li,Xin Wang]]></author></item>
<item><title><![CDATA[An ECA-Rule-Based Workflow Approach for Advance Resource Reservation in ShanghaiGrid]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1381</link>
<description><![CDATA[<p>ShanghaiGrid is the first metropolitan grid in China. The project aims to  develop an environment to share distributed resources in Shanghai conveniently  based on grid technology. Yet, resources are finite for ever, especially for  some expensive and specific resources. Users must reserve these resources in  advance before use them. Present solutions need users confirm the absolute start  time of reservation before the reservation which is impossible in practice at  most time. But they can often estimate the relative time to start reservation  after a specific event, e.g. beginning or finishing a task. As a part of  ShanghaiGrid, we develop an ECA rule-based workflow management system (EWMS)  which can serve for arranging the relative start time of advance resource  reservation as users&amp;rsquo; demand. We introduce the design architecture of EWMS in  the paper, and give a modeling demo to show how to realize advance resource  reservation through our system. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510421.pdf&amp;amp;T=An%20ECA-Rule-Based%20Workflow%20Approach%20for%20Advance%20Resource%20Reservation%20in%20ShanghaiGrid"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br />&amp;nbsp;</p><div></div><div></div>]]></description>
<pubDate>8/01/2007 03:38</pubDate>
<author><![CDATA[Yi Wang,Minglu Li,Jian Cao,Ying Li,Lin Chen,Xinhua Lin,Feilong Tang]]></author></item>
<item><title><![CDATA[Dual-Role Based Access Control Framework for Grid Services]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1382</link>
<description><![CDATA[<p>In the grid environment, the resource providers should maintain the ultimate  authority over their resources, including access authorization and grain scale  control. Apparently, the traditional RBAC model will be inappropriate in  multi-autonomous domains environment. Focusing on the autonomous, heterogeneous  and dynamic features of grid computing, we propose the concept of &amp;quot;Resource  Role&amp;quot;. We also initiate the Dual-Role Based Access Control (DRBAC) framework,  where the resource role permission mapping is defined in resource domain and  user role resource role mapping is negotiated by user domain and resource  domain. This framework is simple and works better than the traditional RBAC in  multi domains environment. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510427.pdf&amp;amp;T=Dual-Role%20Based%20Access%20Control%20Framework%20for%20Grid%20Services"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br />&amp;nbsp;</p><div></div><div></div>]]></description>
<pubDate>8/01/2007 03:39</pubDate>
<author><![CDATA[Lina Ge,Shaohua Tang,Qiao Kuang]]></author></item>
<item><title><![CDATA[QoS-aware Scheduling Algorithm Based on Complete Matching of User Jobs and Grid Services]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1383</link>
<description><![CDATA[<p>Grid Services Scheduling is a challenging problem under Open Grid Service  Architecture(OGSA). Grid Services running on Clusters must have mechanism and  policies for establishing and supporting QoS. A graph theory formal description  is introduced into the Service Grid Model in this paper. The necessary and  sufficient condition of complete matching of user job and service resources has  been given and proved. Optimal Solution to matchmaking of grid jobs and grid  services is developed based on the running time weight matrix, and the  arithmetic has been verified by simulation analysis which proved to be more  efficient than the alike arithmetic. The arithmetic has been implemented and  running well. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510433.pdf&amp;amp;T=QoS-aware%20Scheduling%20Algorithm%20Based%20on%20Complete%20Matching%20of%20User%20Jobs%20and%20Grid%20Services"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br />&amp;nbsp;</p><div></div><div></div>]]></description>
<pubDate>8/01/2007 03:40</pubDate>
<author><![CDATA[Weidong Hao,Yang Yang,Chuang Lin,Zhengli Zhai]]></author></item>
<item><title><![CDATA[GlobalWatch: A Distributed Service Grid Monitoring Platform with High Flexibility and Usability]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1384</link>
<description><![CDATA[<p>GlobalWatch is a distributed platform to monitor various resources of grid  platforms so as to improve the flexibility and usability of grid systems. In  order to enhance the flexibility, we make improvements from three aspects. 1) We  take advantage of both centralized and decentralized methods in the architecture  and adopt a loosely coupled architecture to get monitored data; 2) We integrate  GlobalWatch with VO (Virtual Organization) concept so as to make it compatible  with grid circumstances. 3) We design a XML format to make GlobalWatch flexible  for users to submit and receive information. In order to enhance the usability,  we not only integrate various functions into GlobalWatch client application, but  also make the visual effect better than some other monitoring platforms. At  last, we conclude from the experimental result that monitored nodes in  GlobalWatch are indeed loosely coupled and the transmission of map data is the  main bottleneck in server end. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510440.pdf&amp;amp;T=GlobalWatch:%20A%20Distributed%20Service%20Grid%20Monitoring%20Platform%20with%20High%20Flexibility%20and%20Usability"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br />&amp;nbsp;</p><div></div><div></div>]]></description>
<pubDate>8/01/2007 03:41</pubDate>
<author><![CDATA[Sheng Di,Hai Jin,Shengli Li,Ling Chen,Chengwei Wang]]></author></item>
<item><title><![CDATA[An Adaptive Resource Scheduling Algorithm for Computational Grid]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1385</link>
<description><![CDATA[<p>The emerging computational grid infrastructure consists of heterogeneous  resource in widely distributed autonomous domains, which makes resource  scheduling even more challenging. In this paper, we propose an adaptive resource  scheduling algorithm for computational grid called BLBD (Based on Load Balancing  and Demand). According to the computational grid job&amp;rsquo;s personal resource  requirements, the system load of computational grid nodes and the load balancing  of computational grid system, the algorithm choose an appropriate node  self-adaptively for computational grid job from the candidates. It has been  successfully tested in NPU Campus Computational Grid environment. The  experimental result shows that the new task scheduling algorithm can lead to  significant performance gain for a variety of applications </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510447.pdf&amp;amp;T=An%20Adaptive%20Resource%20Scheduling%20Algorithm%20for%20Computational%20Grid"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br />&amp;nbsp;</p><div></div><div></div>]]></description>
<pubDate>8/01/2007 03:54</pubDate>
<author><![CDATA[Tao Wang,Xing-she Zhou,Qiu-rang Liu,Zhi-yi Yang,Yun-lan Wang]]></author></item>
<item><title><![CDATA[GSGCP-FEM: A General Service-Oriented Grid Computing Platform for FEM-Based Simulations]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1386</link>
<description><![CDATA[<p>Finite Element Method (FEM)-based scientific numerical simulations are often  computing-extensive and Grid platform can speed up the simulation progress  significantly. However, the coupling of FEM-based simulation tasks with Grid  platform isn&amp;rsquo;t so straightforward. Adopting the Service-oriented Architecture  (SOA), we develop a General Service-oriented Grid Computing Platform for  FEM-based Simulations (GSGCP-FEM). GSGCP-FEM provides users with the ability to  make a general FEM-based simulation to be service-oriented. Basing on the  services provided by GSGCP-FEM and Grid middleware, users can deploy new  scientific simulation applications easily. In this paper, we explain the design,  architecture, and implementation of GSGCP-FEM in detail. We also deploy two  practical applications based on GSGCP-FEM to demonstrate its  usefulness. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510458.pdf&amp;amp;T=GSGCP-FEM:%20A%20General%20Service-Oriented%20Grid%20Computing%20Platform%20for%20FEM-Based%20Simulations"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br />&amp;nbsp;</p><div></div><div></div>]]></description>
<pubDate>8/01/2007 03:55</pubDate>
<author><![CDATA[Kejing He,Shoubin Dong,Jianfei He,Liqun Tang]]></author></item>
<item><title><![CDATA[AOCMS: An Adaptive and Scalable Monitoring System for Large-Scale Clusters]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1387</link>
<description><![CDATA[<p>In this paper, we present the design and implementation of AOCMS, an adaptive,  scalable and efficient monitoring system for a large-scale cluster. We describe  an adaptive architecture of AOCMS in detail, and focus on the discussion about  some techniques as to enhancing the adaptation, scalability and efficiency of  AOCMS. These techniques include: a solution to monitor a heterogeneous cluster;  a universal applet-servlet communicating controller responsible for  communication between the clients and the web server; adaptive pools providing  threads or connections to the database for the monitoring tasks on demand; and  an AOP-based alarm decoupling the alarming logic from the monitoring logic.  Moreover, we measured the performance of AOCMS. The results show that AOCMS runs  with low overheads and responds to clients quickly. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510466.pdf&amp;amp;T=AOCMS:%20An%20Adaptive%20and%20Scalable%20Monitoring%20System%20for%20Large-Scale%20Clusters"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br />&amp;nbsp;</p><div></div><div></div>]]></description>
<pubDate>8/01/2007 03:57</pubDate>
<author><![CDATA[Zhenghua Xue,Xiaoshe Dong,Weiguo Wu]]></author></item>
<item><title><![CDATA[GridPPI: A Lightweight Grid-Enabled Parallel Programming Framework]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1388</link>
<description><![CDATA[<p>Parallel application development for Grids can benefit from tools that abstract  the underlying Grid middleware, hide the critical aspects of heterogeneous  resources and provide utilities for parallelism. As a research on these issues,  we have developed Grid Parallel Programming Interface (GridPPI), a Java library  aiming at providing a framework for MPI-style development and execution of Java  applications in service-oriented Grids. GridPPI primarily comprises an open  architecture that is adaptive to various Grid platforms and an MPI-like parallel  communication library that includes both basic and collective operations. We  describe the design of GridPPI framework and its implementation on ChinaGrid  Support Platform 2 (CGSP2) in detail, and present the performance  evaluation. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510473.pdf&amp;amp;T=GridPPI:%20A%20Lightweight%20Grid-Enabled%20Parallel%20Programming%20Framework"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br />&amp;nbsp;</p><div></div><div></div>]]></description>
<pubDate>8/01/2007 03:59</pubDate>
<author><![CDATA[Sikan Chen,Minglu Li,Feng He]]></author></item>
<item><title><![CDATA[FEISI: Towards Enterprise Information Semantic Integration]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1389</link>
<description><![CDATA[<p>Nowadays, Enterprise Information Semantic Integration (EISI) constitutes a real  and growing need for most large enterprises, The main problem of EISI is the  heterogeneity problem, especially the semantic integration. Current solutions  mainly focus on structural and syntactical integration, and the solutions for  semantic integration are still immature. In this paper, we introduce a novel  FuseGrid-based EISI architecture named FEISI which can achieve dynamic, adaptive  and semantic integration of enterprise information resources by organizing,  sharing and fusing the information of enterprise. The key issues of FEISI are  ontology building and query rewriting, we analyses the organization of ontology  and describes a multi-level tree-based ontology structure for the former, for  the latter, we show the key algorithm of FEISI. The aim of our approach is to  correctly capture, structure and also to manage the semantics within large,  dynamic and multidisciplinary enterprises especially enterprise  groups. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510481.pdf&amp;amp;T=FEISI:%20Towards%20Enterprise%20Information%20Semantic%20Integration"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br />&amp;nbsp;</p><div></div><div></div>]]></description>
<pubDate>8/01/2007 04:00</pubDate>
<author><![CDATA[Xiong Wen Pang,De Yu Qi,Yong Jun Li]]></author></item>
<item><title><![CDATA[Adaptive Task Scheduling on Optical Grid]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1390</link>
<description><![CDATA[<p>Optical Grid will be an attractive proposition, as the bandwidth of electrical  network becomes the bottleneck of grid application. However, few scheduling  methods consider the communication contention on optical Grid. This paper raises  an optical grid model based on the characters of optical network. In this model,  the network resource was granted the same level to be considered as the  computation and storage resource. In order to reflect the reality in job  scheduling, allocation of network resource for data transfer was taken into  consideration. Then, this paper presents a communication contention-aware  solution based on the list scheduling to minimize the total execution time for  given tasks towards an optical grid, where the router algorithm was modified  from Dijkstra route algorithm. Results proved the feasibility and efficiency of  the solution proposed. </p><p>&amp;nbsp;<a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510486.pdf&amp;amp;T=Adaptive%20Task%20Scheduling%20on%20Optical%20Grid"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> </p><div></div><div></div>]]></description>
<pubDate>8/01/2007 04:01</pubDate>
<author><![CDATA[Xuebin Liang,Xinhua Lin,Minglu Li]]></author></item>
<item><title><![CDATA[MICE: An Efficient Grid Scheme for Mathematical Computing]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1391</link>
<description><![CDATA[<p>We designed a Grid Computing model in math based on current network computing  technologies. MICE is an emerging technology to provide uniform programming,  task submission, and management specifications across the large scale  distributed computing nodes which deployed some famous mathematical software.  MICE utilizes a three-level architecture that shields users from low-level  computing resource discovery and provides globe uniform view for users. We  extended MathML to solve the mathematical semantic objects&amp;#39; expression. CSP  (Computing Service Platform) servers are adopted in MICE to provide uniform task  access, transfer and management of heterogeneous distributed resources across  multiple administrative domains. This architecture enables the mathematical  software resources to be deployed as services on the internet. MICE can achieve  good scalability, reliability and can be flexibly deployed and  configured. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510492.pdf&amp;amp;T=MICE:%20An%20Efficient%20Grid%20Scheme%20for%20Mathematical%20Computing"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br />&amp;nbsp;</p><div></div><div></div>]]></description>
<pubDate>8/01/2007 04:02</pubDate>
<author><![CDATA[Yi Yang,Li Liu,Lian Li,Zhenfang Li,Rui Zhou]]></author></item>
<item><title><![CDATA[Optimizing Repetitive Resource Accesses with Stateful Web Services]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1392</link>
<description><![CDATA[<p>Many modern scientific applications consist of numerous executions of legacy  programs. The repetitive but discontinuous resource access pattern in these  applications causes challenge in solving them with Grid technologies. A stateful  Web service model is proposed, which exploits the factory/instance pattern to  schedule resources according to job submitters instead of submitted jobs. Each  instance represents a customized execution environment that is exclusively  accessed by one job submitter, and can be accessed repetitively to perform as  many jobs as desired. At the same time, this model introduces an individualizing  operation for every instance, which provides a mechanism to minimize the amount  cost of remote data accesses required by all jobs submitted to the instance.  This service model is exploited in enabling and optimizing repetitive resource  accesses that occur in AS applications </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510499.pdf&amp;amp;T=Optimizing%20Repetitive%20Resource%20Accesses%20with%20Stateful%20Web%20Services"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br />&amp;nbsp;</p><div></div><div></div>]]></description>
<pubDate>8/01/2007 04:03</pubDate>
<author><![CDATA[Huashan Yu,Zhuoqun Xu]]></author></item>
<item><title><![CDATA[Research on the Grid/Web-Service-Based Visualization Model and Its Application]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1393</link>
<description><![CDATA[<p>The combined exploration of grid technology and science of data visualization is  a new paradigm in cross-domain science research. GVis presented in the paper is  a distributed and collaborative web-service-based visualization environment that  we developed to support automated availability and allocation of heterogeneous  visualization resources. It provides a flexible framework for sharing of  visualization components by geologically distributed collaborative users. The  framework based on grid/web services specified by OGSA model uses Visualization  resources Broker (VisBroker) for the availability and allocation of remote  components. Visualization Grid Services (VGS) runs as the core layer of GVis  which splits and distributes visualization components on the grid following  distributed visualization pipeline mapping model. Data driven mechanism is used  for updating data and pipeline of collaborative users. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510507.pdf&amp;amp;T=Research%20on%20the%20Grid/Web-Service-Based%20Visualization%20Model%20and%20Its%20Application"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br />&amp;nbsp;</p><div></div><div></div>]]></description>
<pubDate>8/01/2007 04:05</pubDate>
<author><![CDATA[Chunmei Duan,Xiangxu Meng]]></author></item>
<item><title><![CDATA[A Systematic Approach for Application Migration in a Grid Computing Environment]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1394</link>
<description><![CDATA[<p>Enterprises are looking at Grid computing as a technology of enormous potential.  One such issue is the issue of Grid application migration, where legacy  applications are migrated to the Grid environment. The Grid Application  Migration Framework (GAMF), is an attempt to provide a systematic approach for  handling the migration process. The framework consists of three independently  deployable components: Grid Code Analyzer (GCA), Grid Task Generator (GTG), and  Grid Simulator (GS). The GCA component analyzes the different applications and  generates a Directed Acyclic Graph (DAG) based on the information obtained from  analysis. The DAG is based on both static and runtime information available from  application profiling. The DAG information is then analyzed and Grid tasks are  generated based on different DAG reducing and clustering algorithms. The  simulator takes the generated DAG as input and provides and analyzes the  application performance with respect to Grid infrastructure and  policies. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510512.pdf&amp;amp;T=A%20Systematic%20Approach%20for%20Application%20Migration%20in%20a%20Grid%20Computing%20Environment"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br />&amp;nbsp;</p><div></div><div></div>]]></description>
<pubDate>8/01/2007 04:12</pubDate>
<author><![CDATA[Anirban Chakrabarti,Shubhashis Sengupta,Adarsh Upadhyay,Anish Damodaran]]></author></item>
<item><title><![CDATA[Web Resource Monitoring Based on Common Information Model]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1395</link>
<description><![CDATA[<p>The monitoring of resources is a crucial issue for the high-performance of web  computing, and the scheduling strategies, the management of resources, and the  performance analysis are dependent on the monitoring data. The traditional  monitoring solution does not provide a unified and consistent model to the  devices, resources and services of heterogeneous environments. In this paper a  novel monitoring approach is proposed based on the common information model CIM.  CIM defines a basic meta-model, syntax for the description of managed object and  hierarchical structure of generic object classes. The monitoring system RMCS is  given that integrates and extends the existing monitoring system to gather and  retrieve the monitoring information. The CIM-based method addresses the variety  and heterogeneity of resources in object-oriented way that the monitoring  resource is regarded as a class or object. The RMCS enables administrators and  users define a wide variety of resources, customize the monitoring parameters  and the display way. The experiments show that this monitoring approach provides  the scalable and flexible capabilities, and satisfies the web application  requirements. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510520.pdf&amp;amp;T=Web%20Resource%20Monitoring%20Based%20on%20Common%20Information%20Model"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br />&amp;nbsp;</p><div></div><div></div>]]></description>
<pubDate>8/01/2007 04:13</pubDate>
<author><![CDATA[Hongyan Mao,Linpeng Huang,Minglu Li]]></author></item>
<item><title><![CDATA[GHIDS: Defending Computational Grids against Misusing of Shared Resources]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1396</link>
<description><![CDATA[<p>Detecting intrusions at host level is vital to protecting shared resources in  grid, but traditional Host-based Intrusion Detecting System (HIDS) is not  suitable for grid environment. Grid-specific attacks are different from  traditional ones, and traditional HIDS can not recognize a grid user and always  with high performance overhead. This paper proposes a Grid- specific Host-based  Intrusion Detection System (GHIDS) which employs bottleneck verification  approach to detect intrusions with low false alarm rate and high detection rate.  Working within operating system kernel and performing bottleneck verification by  integer comparison, GHIDS achieves high efficiency and accuracy. Security  reports generated by GHIDS are indexed not only by local user ID, but also by  Grid user ID. That is more useful for analyzing grid user behaviors globally by  both host administrators and high level Grid-based IDS. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510526.pdf&amp;amp;T=GHIDS:%20Defending%20Computational%20Grids%20against%20Misusing%20of%20Shared%20Resources"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br />&amp;nbsp;</p><div></div><div></div>]]></description>
<pubDate>8/01/2007 04:33</pubDate>
<author><![CDATA[Guofu Feng,Xiaoshe Dong,Weizhe Liu,Ying Chu,Junyang Li]]></author></item>
<item><title><![CDATA[Free-Riding Analysis of BitTorrent-Like Peer-to-Peer Networks]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1397</link>
<description><![CDATA[<p>BitTorrent is a very popular P2P file sharing system.It has been successful at  distributing large files quickly and efficiently. Embedded in BitTorrent is a  set of incentive mechanisms to encourage sharing and contribute, and prevent  systematic free-riding. In this paper, a fluid model with two classes of peers  is used to capture the effect of free-riding in a BitTorrent system. With the  model, we explore how does free-riding influenced the BitTorrent system. From  results, it is shown that BitTorrent mechanism is successful to guard against  free-riding. Finally, we discuss the dying process of a BitTorrent system and  the probability of system dead that is induced by free-riding. </p><p>&amp;nbsp;<a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510534.pdf&amp;amp;T=Free-Riding%20Analysis%20of%20BitTorrent-Like%20Peer-to-Peer%20Networks"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a></p><div></div><div></div>]]></description>
<pubDate>8/01/2007 04:34</pubDate>
<author><![CDATA[ Jiadi Yu,Minglu Li,Feng Hong,Guangtao Xue]]></author></item>
<item><title><![CDATA[Using Ant Colony Optimization for SuperScheduling in Computational Grid]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1398</link>
<description><![CDATA[<p>The problem of how to allocate the resources optimally and adaptively in the  dynamic, scalable and distribute-controlled grid environment is introduced and  discussed numerously. But recent researches can&amp;rsquo;t satisfy with the needs of  resource allocation in grid system thoroughly. In this paper, we use the  SuperScheduling concept in grid system, which is with no explicit model. And we  introduce Ant Colony Optimization applied for those models to implement resource  allocation. We test the validity of Ant Colony Optimization which gets good  results to satisfy with the needs of resource allocation in the dynamic,  scalable grid environment with no global control. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510539.pdf&amp;amp;T=Using%20Ant%20Colony%20Optimization%20for%20SuperScheduling%20in%20Computational%20Grid"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br />&amp;nbsp;</p><div></div><div></div>]]></description>
<pubDate>8/01/2007 04:36</pubDate>
<author><![CDATA[Li Liu,Yi Yang,Lian Li,Wanbin Shi]]></author></item>
<item><title><![CDATA[Research on Association Rules Based Group Ranking Model with Fuzzy Preference Relation Structure]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1399</link>
<description><![CDATA[<p>In this paper, we propose a method that takes full advantage of the  characteristic that association rules can reflect the logic relationships  between items in the frequent itemsets for ranking the numbered alternatives. In  group ranking, the decision data are usually pairwise comparisons based on fuzzy  preference relations. The concordance and discordance factors are pivotal to the  quality of the solutions. And fuzzy preference relations usually can not hold  the consensus in the real situation. In our method, all the preference  information that is obtained by abstracting association rules from the frequent  itemsets of pairwise comparisons is considered as contribution to the consistent  measures of the solutions, which shows the majority rule of the collective based  on statistic and makes the solutions obtained more objectively true. An example  is given to show the availability, which is compared with the result of the  method using the ordered weighted averaging (OWA) operator. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510546.pdf&amp;amp;T=Research%20on%20Association%20Rules%20Based%20Group%20Ranking%20Model%20with%20Fuzzy%20Preference%20Relation%20Structure"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br />&amp;nbsp;</p><div></div><div></div>]]></description>
<pubDate>8/01/2007 04:37</pubDate>
<author><![CDATA[Xinqiao Yu,Bo Meng,Fei Yan]]></author></item>
<item><title><![CDATA[GOI-Based Information Service Architecture in Grid]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1400</link>
<description><![CDATA[<p>Grid Information Service (GIS) provides the function of discovering and  monitoring resources, which is the foundation of the grid infrastructure. It is  important to ensure its reliability and efficiency. This paper proposes a novel  information service architecture based on Group of Interest (GOI) mechanism,  which is completely distributed and has high scalability and reliability. In a  GOI, all GIS nodes have the uniform view of information by exchanging their  information periodically for efficient service discovery and fault-tolerance. A  super GIS node is selected in each GOI to take full responsibility for the  queries submitted to this GOI. This mechanism can reduce the query distance and  enhance the query efficiency. Experimental results show that the mechanism  satisfies the expectations. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510553.pdf&amp;amp;T=GOI-Based%20Information%20Service%20Architecture%20in%20Grid"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br />&amp;nbsp;</p><div></div><div></div>]]></description>
<pubDate>8/01/2007 05:18</pubDate>
<author><![CDATA[Xiangang Zhao,Bai Wang,Liutong Xu,Nan Du]]></author></item>
<item><title><![CDATA[The Research on an Adaptive Information Grid Architecture for Recommendation System]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1401</link>
<description><![CDATA[<p>This paper presents an adaptive information grid architecture for recommendation  systems, which consists of the features of the recommendation rule and a  co-citation algorithm. The algorithm addresses some challenges that are  essential for further searching and recommendation algorithms. It does not  require users to provide a lot of interactive communication. Furthermore, it  supports other queries, such as keyword, URL and document investigations. When  the structure is compared to other algorithms, the scalability is noticeably  better. The high online performance can be obtained as well as the repository  computation, which can achieve a high group-forming accuracy using only a  fraction of web pages from a cluster. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510560.pdf&amp;amp;T=The%20Research%20on%20an%20Adaptive%20Information%20Grid%20Architecture%20for%20Recommendation%20System"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br />&amp;nbsp;</p><div></div><div></div>]]></description>
<pubDate>8/01/2007 05:20</pubDate>
<author><![CDATA[Xiao-gao Yu,Xiao-peng Yu]]></author></item>
<item><title><![CDATA[Remote Sensing Data Distribution by a Grid-Based Data Distribution System]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1402</link>
<description><![CDATA[<p>Data distribution is one of the most important steps in the Remote Sensing  applications; it is the bridge between consumers and providers of remote sensing  data. Most of the conventional data distribution systems provide web-based user  interface and support a small quantity of data types only. It is not friendly  for integrated Remote Sensing applications. So, a distributed and  platform-independent remote sensing data distribution framework which supports  multi data type, multi data source, and machine-to-machine intelligent  integration is needed. Based on Grid technology, a 3-layered Remote Sensing Data  Distribution System named SIG-DDS is designed and implemented in this paper. In  order to make the system simple, extensible and platform-independent, a  well-defined extensible data accessing language based on XML is adopted as the  accessing language of data sources and data brokers. The distribution system can  distribute different sources, types and formats of Remote Sensing Data in one  system and make it easier to build up a distributed integrated remote sensing  application. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510566.pdf&amp;amp;T=Remote%20Sensing%20Data%20Distribution%20by%20a%20Grid-Based%20Data%20Distribution%20System"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br />&amp;nbsp;</p><div></div><div></div>]]></description>
<pubDate>8/01/2007 05:20</pubDate>
<author><![CDATA[ZhenChun Huang,GuoQing Li]]></author></item>
<item><title><![CDATA[ICA/RBF-Based Prediction of Varying Trend in Real Exchange Rate]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1403</link>
<description><![CDATA[<p>The flexibility of Radial Basis Function Neural Network to handle complex  patterns in the data has lead to the diffusion and implementation of such models  in economics and econometrics. The financial time series such as real exchange  rate are Multivariate data containing many underlying factors. In this paper,  ICA as one of the most popular signal decomposition technologies in recent years  is introduced to excavate the potential information for better analysis of real  exchange rate where ICA plays an important role of preprocessing. We address the  essential difference of dimension reduction using PCA and ICA; show that these  two approaches are different at the aspect of sensitivity to dimensions although  they both are pre-processing methods of dynamic data, even if the accumulative  contribution rate of ICA is less than that of PCA, the former still attains the  same prediction results as the latter. With ICA/RBF mixed prediction model, not  only we can compress the dimensions of input data greatly, but also find the  factors behind to better direct prediction. In the analysis of real exchange  rate, independent influence factors such as the policy influence of the  enhancement of currency interest and the customer marketing period of exchange  are mined to rich knowledge base for make better prediction  strategy. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510572.pdf&amp;amp;T=ICA/RBF-Based%20Prediction%20of%20Varying%20Trend%20in%20Real%20Exchange%20Rate"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br />&amp;nbsp;</p><div></div><div></div>]]></description>
<pubDate>8/01/2007 05:21</pubDate>
<author><![CDATA[Ling Huang,Fenggang Li,Lin Xin]]></author></item>
<item><title><![CDATA[Find the Best to Share]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1404</link>
<description><![CDATA[<p>In a virtual enterprise, how to find the best expert to share their experience  and information is an important way to improve work efficiency. Semantic  matching provides a basic technique to solve this problem. In this paper,  semantic matching is measured by a semantic attractive force model, which is  based on a domain ontology, and semantic distance computation is a core problem  in semantic matching. The depth of ontology tree is considered when computing  semantic distance then an agent could account semantic attractive force of  optional information and chooses the best matching information to share with  each other. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510581.pdf&amp;amp;T=Find%20the%20Best%20to%20Share"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br />&amp;nbsp;</p><div></div><div></div>]]></description>
<pubDate>8/01/2007 05:22</pubDate>
<author><![CDATA[Mingwei Yuan,Ping Jiang,Jian Wu]]></author></item>
<item><title><![CDATA[A New Pricing Approach for Service Network Using Explicit Congestion Notification]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1405</link>
<description><![CDATA[<p>Advances in technology have greatly increased the demand for a single integrated  service network that can provide multiple service classes for different user  requirements. Currently, the predominant form of Internet retail pricing is  flat-rate pricing which incurs the inevitable emergence of congestion. So in  this paper, we present a new pricing approach for service network using explicit  congestion notification. In order to alleviate the congestion and enhance the  use of network efficiently, this proposed pricing mechanism charges every user  according to their actual usage of network, and keeps the balance of supply and  demand between users and network by the fluctuation of price. In the end of this  paper, some experiment results suggest this proposed approach is correct,  feasible and valid. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510585.pdf&amp;amp;T=A%20New%20Pricing%20Approach%20for%20Service%20Network%20Using%20Explicit%20Congestion%20Notification"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br />&amp;nbsp;</p><div></div><div></div>]]></description>
<pubDate>8/01/2007 05:23</pubDate>
<author><![CDATA[Jun Tao,Dian-Xun Shuai]]></author></item>
<item><title><![CDATA[EbXML-Based Application Integration in Service-Oriented Business]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1406</link>
<description><![CDATA[<p>The XML-based e-Business specifications are the main stream in B2B (Business to  Business) field, and the ebXML (electronic business XML) specification is the  most promising industry-defined XML schema. This paper addresses  service-oriented business integration based on ebXML. It introduces the  evolvement of ebXML and presents how ebXML technologies enable enterprises to  collaborate at the business process level. In particular, it discusses data  interchange from EDI (Electronic Data Interchange) to ebXML in business  processes. Some business requirements are also discussed including  service-oriented computing, business process modeling, etc. Specifically, the  business process modeling is described by modeling flow and message sequence.  The recent implementations and the development trends are shown by two cases of  official projects on the basis of ebXML. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510589.pdf&amp;amp;T=EbXML-Based%20Application%20Integration%20in%20Service-Oriented%20Business"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br />&amp;nbsp;</p><div></div><div></div>]]></description>
<pubDate>8/01/2007 05:23</pubDate>
<author><![CDATA[Quan Wen]]></author></item>
<item><title><![CDATA[Model and Algorithm for a Time-Constrained Regions-Integrated Distribution Problem]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1407</link>
<description><![CDATA[<p>Besides minimizing the delivery cost, the design of distribution system should  also satisfied the time limit of the supply for resellers in e-business  environment, in which traditional region-based distribution model can no longer  meet the requirements of logistics distribution. Rather, a new distribution  strategy of regions- integrated with replenishments along the distribution  routine can solve the above-mentioned contradiction effectively. This paper  firstly stated the assumptions of the strategy, and then built the model for  regions-integrated distribution system. According to the model&amp;rsquo;s specific  configuration, a heuristic algorithm was developed for gradual optimization, by  which a time-constrained distribution routing can be established via methods of  inserting routing parts in descending order of their saving values. A numerical  example was given to demonstrate the arithmetic operation at the end of this  paper. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510593.pdf&amp;amp;T=Model%20and%20Algorithm%20for%20a%20Time-Constrained%20Regions-Integrated%20Distribution%20Problem"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br />&amp;nbsp;</p><div></div><div></div>]]></description>
<pubDate>8/01/2007 05:24</pubDate>
<author><![CDATA[Xiang Liu,Yanhui Li]]></author></item>
<item><title><![CDATA[Research and Design of Phishing Alarm System at Client Terminal]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1408</link>
<description><![CDATA[<p>In this paper, it analyses Phishing&amp;rsquo;s characteristics and harms, and finds out  the sticking point of Phishing. Then it designs and realizes the alarm system  according to Phishing&amp;rsquo;s intrinsic disadvantages in this article. The system is  transparent to users with spacious detection scope, short response time, good  security and friendly interface, without increasing users&amp;rsquo; workload.  </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510597.pdf&amp;amp;T=Research%20and%20Design%20of%20Phishing%20Alarm%20System%20at%20Client%20Terminal"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br />&amp;nbsp;</p><div></div><div></div>]]></description>
<pubDate>8/01/2007 05:25</pubDate>
<author><![CDATA[Ming Qi,Chaobo Yang]]></author></item>
<item><title><![CDATA[An Outlier Detection Model Based on Cross Datasets Comparison for Financial Surveillance]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1409</link>
<description><![CDATA[<p>Outlier detection is a key element for intelligent financial surveillance  systems which intend to identify fraud and money laundering by discovering  unusual customer behaviour pattern. The detection procedures generally fall into  two categories: comparing every transaction against its account history  andficrther more, comparing against a peer group to determine if the behavior is  unusual. The later approach shows particular merits in efficiently extracting  suspicious transaction and reducing false positive rate. Peer group analysis  concept is largely dependent on a cross-datasets outlier detection model. In  this paper, we propose a new cross outlier detection model based on distance  definition incorporated with the financial transaction data features. An  approximation algorithm accompanied with the model is provided to optimize the  computation of the deviation from tested data point to the reference dataset. An  experiment based on real bank data blended with synthetic outlier cases shows  promising results of our model in reducing false positive rate while enhancing  the discriminative rate remarkably. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510601.pdf&amp;amp;T=An%20Outlier%20Detection%20Model%20Based%20on%20Cross%20Datasets%20Comparison%20for%20Financial%20Surveillance"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br />&amp;nbsp;</p><div></div><div></div>]]></description>
<pubDate>8/01/2007 05:25</pubDate>
<author><![CDATA[Tianqing Zhu]]></author></item>
<item><title><![CDATA[Transform from Models to Service Description Based on MDA]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1410</link>
<description><![CDATA[Within MDA framework, system models can be built up on an abstract level that is  independent from the platform. Later on, this abstract model can be transmitted  into service description, which is related to specific platform on the  implementation level. In Web Services applications, this transition has a great  advantage. Because, while the model of implementation changes from one case to  another to fit the different platforms, the model of whole system, on a higher  abstract level, stays the same. Thus, the efficiency is promoted.  <p>This paper firstly discusses the extension of UML for Web Services, and then  it presents the modeling process of WSDL. Finally, it gives the rules and  arithmetic of transition from models to WSDL documents in  detail.</p><p>&amp;nbsp;<a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510605.pdf&amp;amp;T=Transform%20from%20Models%20to%20Service%20Description%20Based%20on%20MDA"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> </p><div></div><div></div>]]></description>
<pubDate>8/01/2007 05:27</pubDate>
<author><![CDATA[Bin Yu,Chen Zhang,Yang Zhao]]></author></item>
<item><title><![CDATA[Research on Supply Chain Performance Evaluation Based on DEA/AHP Model]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1411</link>
<description><![CDATA[<p>According to the principle of Balanced Score Card method (BSC), this paper  constructs the evaluating index system of the supply chain on four aspects,  financial value, business process, client service and study- innovation. On the  basis of illustrating the DEA and the AHP methods, this paper combines them in  progress and constructs the DEA/AHP model for evaluating the supply chain  performance. The principle of DEA/AHP model is to use DEA method to calculate  the relative efficiency rate of the decision-making units (DMU), with which  construct the judging matrices of AHP, and then get the characteristic vector of  judging matrices and rank the DMUs at last. This model overcomes the limitations  that DEA can&amp;rsquo;t rank all the DMUs and AHP is highly subjective, so it can  evaluate the supply chain performance more scientific and more  reasonable. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510609.pdf&amp;amp;T=Research%20on%20Supply%20Chain%20Performance%20Evaluation%20Based%20on%20DEA/AHP%20Model"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br />&amp;nbsp;</p><div></div><div></div>]]></description>
<pubDate>8/01/2007 05:27</pubDate>
<author><![CDATA[Jing-yuan Guo,Jia Liu,Li Qiu]]></author></item>
<item><title><![CDATA[Coordination Strategy for Production Planning in Supply Chain Based on Lagrange Relaxation Algorithm]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1412</link>
<description><![CDATA[<p>To solve the coordination problem of multi-enterprises supply chain production  planning, a coordination and optimization strategy of distributed  decision-making based on Lagrange relaxation algorithm is presented. By relaxing  the material flow balance constraints among enterprises with the internal price,  i.e. Lagrange multipliers, the whole supply chain production planning problem is  decomposed into multiple single enterprise production planning sub problems,  each of which can make its own production plan through local information.  Through iterative update of the internal price for each kind of products  provided by enterprises, the supply chain could be coordinated and the nearest  optimal solution can be achieved. The simulation experiments show that the  method can better solve the multi-enterprise supply chain production planning  problem. </p><p>&amp;nbsp;<a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510613.pdf&amp;amp;T=Coordination%20Strategy%20for%20Production%20Planning%20in%20Supply%20Chain%20Based%20on%20Lagrange%20Relaxation%20Algorithm"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> </p><div></div><div></div>]]></description>
<pubDate>8/01/2007 05:28</pubDate>
<author><![CDATA[Cuihua Zhang,Guangshu Chang,Yan Fan,Haibin Yu]]></author></item>
<item><title><![CDATA[GAOM: Genetic Algorithm Based Ontology Matching]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1413</link>
<description><![CDATA[<p>In this paper a genetic algorithm-based optimization procedure for ontology  matching problem is presented as a feature-matching process. First, from a  global view, we model the problem of ontology matching as an optimization  problem of a mapping between two compared ontologies, and every ontology has its  associated feature sets. Second, as a powerful heuristic search strategy,  genetic algorithm is employed for the ontology matching problem. Given a certain  mapping as optimizing object for GA, fitness function is defined as a global  similarity measure function between two ontologies based on feature sets.  Finally, a set of experiments are conducted to analysis and evaluate the  performance of GA in solving ontology matching problem. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510617.pdf&amp;amp;T=GAOM:%20Genetic%20Algorithm%20Based%20Ontology%20Matching"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br />&amp;nbsp;</p><div></div><div></div>]]></description>
<pubDate>8/01/2007 05:35</pubDate>
<author><![CDATA[Junli Wang,Zhijun Ding,Changjun Jiang]]></author></item>
<item><title><![CDATA[Reliability Modeling and Analysis of Service-Oriented Robot Management System]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1414</link>
<description><![CDATA[<p>It is an obvious trend that computer network and robot technology will more and  more closely combine with each other. And the robot, especially the service  robot such as house robot, entertainment robot, etc, will provide different  kinds of services to the mankind. This paper introduces a Service-Oriented  Network Robotic Management System (SONRMS) to coordinate and management the  behaviors between robots and their users so as to provide high reliability and  safety measures to users. Then SONRMS&amp;rsquo; architecture is put forward. SONRMS  reliability model is described by use of Stochastic Reward Net, Reliability  Block Datagram and Hierarchical Model. The influence among parameters of the  system upon SONRMS reliability is analyzed in the end. </p><p>&amp;nbsp;<a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510621.pdf&amp;amp;T=Reliability%20Modeling%20and%20Analysis%20of%20Service-Oriented%20Robot%20Management%20System"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> </p><div></div><div></div>]]></description>
<pubDate>8/01/2007 05:36</pubDate>
<author><![CDATA[Ping Zhang,Renqing Lu,Jing Zhang]]></author></item>
<item><title><![CDATA[State Machine Based CDMA Stress Testing Service System]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1415</link>
<description><![CDATA[<p>This paper introduces a system model of CDMA stress testing service platform  based on state machine technology. This system provides an efficient service  oriented solution on protocol and stress testing of CDMA system. with high  performance and automatic capability. The concurrent multitask mechanism and the  state machine framework enable the high performance and automatic capability of  this system. And the scalable distributed architecture offers the maximum  flexibility of deployment. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510625.pdf&amp;amp;T=State%20Machine%20Based%20CDMA%20Stress%20Testing%20Service%20System"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br />&amp;nbsp;</p><div></div><div></div>]]></description>
<pubDate>8/01/2007 05:38</pubDate>
<author><![CDATA[Lan Liu,Jun Lin,Zhitang Li,Jiachun Li]]></author></item>
<item><title><![CDATA[An Approach to Dynamic Model Combination on Solving Decision-Making Problem]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1416</link>
<description><![CDATA[<p>This paper discusses an approach to distributed parallel model combination for  solving complicated decision-making problem. Firstly, we classify those existed  models by model logic types, implement a model combination strategy to realize  automatic combined model dynamic reconstruction and obtain the model series of  decision-making problem solving by using and/or graph. Furthermore, during the  process on model combination, we develop an index table based fast parameter  matching algorithm to implement parameter match among those related models and  also to apply blackboard dynamic storage technique so as to implement parameter  transfer among related models. Finally, we concentrate our deep study on  combined model dynamic reconstruction, fast parameter dynamic matching and  transferring algorithm. Algorithm analysis listed in this paper shows that the  fast parameter matching algorithm outperforms other translation  methods. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510629.pdf&amp;amp;T=An%20Approach%20to%20Dynamic%20Model%20Combination%20on%20Solving%20Decision-Making%20Problem"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br />&amp;nbsp;</p><div></div><div></div>]]></description>
<pubDate>8/01/2007 21:49</pubDate>
<author><![CDATA[Chao Wu,Ming Jun Xin,Wei Hua Li]]></author></item>
<item><title><![CDATA[Entropy Evaluation Model of Enterprises Performance Based on Supply Chain Management Theory]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1417</link>
<description><![CDATA[<p>On the basis of analyzing the shortcomings of the traditional performance  evaluation, the evaluation-index system of enterprises performance based on  supply chain management was built. In order to be able to evaluate objectively  and scientifically enterprises performance, entropy appraisal model was set up,  which was an objective empower approach. Then it was utilized to evaluate the  performance of five listed electronic enterprises according to the evaluation  results. Finally, stronger guidance was given in conclusions. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510635.pdf&amp;amp;T=Entropy%20Evaluation%20Model%20of%20Enterprises%20Performance%20Based%20on%20Supply%20Chain%20Management%20Theory"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br />&amp;nbsp;</p><div></div><div></div>]]></description>
<pubDate>8/01/2007 21:51</pubDate>
<author><![CDATA[Jun Xu,Qi Zeng]]></author></item>
<item><title><![CDATA[A Workflow Model Supporting Flexible Process Based on Extensible Organization]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1418</link>
<description><![CDATA[<p>How to make business process flexibly adapted to the changes of organization is  the key problem for an enterprise to improve its competitive power. Aimed at  providing a solution to this problem, a new flexible workflow model based on  extensible organization definition is put forward. The proposed model is  composed of organization model and process model. In organization model the new  concept of sub-organization has been introduced with the realization mechanism,  making the organization model extensible qualified. In process model all  sub-organizations and workgroups are allowed to create sub-process independently  and refer to sub-process dynamically. Compared with the traditional workflow  model with the capability of sub-process definition, the proposed model reduces  the effects on business process imposed by the change of enterprise organization  structure, gains much more flexibility, and provides management means at all  administrative levels. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510640.pdf&amp;amp;T=A%20Workflow%20Model%20Supporting%20Flexible%20Process%20Based%20on%20Extensible%20Organization"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br />&amp;nbsp;</p><div></div><div></div>]]></description>
<pubDate>8/01/2007 21:51</pubDate>
<author><![CDATA[Hongli Wu,Baolin Yin,Xia Zhao,Gang Xiang]]></author></item>
<item><title><![CDATA[Dynamic Selection and Optimization of Design Paradigms in Mobile Services]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1419</link>
<description><![CDATA[<p>Mobile computing environments pose two challenging problems for the design and  configuration of mobile services: constant changes of computation contexts and  resource limitation of mobile devices. This paper presents a dynamic software  configuration approach implemented by using different design paradigms during  execution time. After analyzing the features of these paradigms, we propose the  selection rules of design paradigms under different contexts, which are used to  dynamically reconfigure mobile services to adapt to environmental changes and  meet the users&amp;rsquo; requirements. The rules make the automatic or semi-automatic  software configuration possible. To conserve resources, we present an optimal  software partitioning algorithm based on network flow theory to optimize the  design paradigms. Finally, a case study shows the flexibility and effectiveness  of our approach. </p><p>&amp;nbsp;<a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510646.pdf&amp;amp;T=Dynamic%20Selection%20and%20Optimization%20of%20Design%20Paradigms%20in%20Mobile%20Services"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> </p><div></div><div></div>]]></description>
<pubDate>8/01/2007 21:52</pubDate>
<author><![CDATA[Songqiao Han,Shensheng Zhang,Yong Zhang]]></author></item>
<item><title><![CDATA[Design and Implementation of Intelligent Vehicle Monitoring and Management System Based on the Multi-Net]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1420</link>
<description><![CDATA[<p>In this paper, an intelligent vehicle monitoring and management system (IVMMS)  based on the multi-net is designed. First, its architecture and functions are  introduced. It uses many technologies fusing GPS, GPRS/CDMA, GIS, RS and  Internet, and is composed mainly by two major parts: the Mobile Terminal and the  Monitoring Center. Especially, GPRS/CDMA technology is the reliable technical  support for wireless communication smooth transition from the 2.5G to the 3G;  then, the principles and the key technologies of Mobile Terminal and Monitoring  Center are discussed respectively in detail, and figures of their structures are  also shown below; finally, a novel vehicle scheduling model based on ant  algorithms are proposed and the course of scheduling tasks is also introduced.  It is indicated that, the vehicles scheduling efficiency is enhanced greatly.  The system not only can be used in the vehicles scheduling, but also in the  vessel and other fields, and the solid technical support will be provided for  the ITS research. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510650.pdf&amp;amp;T=Design%20and%20Implementation%20of%20Intelligent%20Vehicle%20Monitoring%20and%20Management%20System%20Based%20on%20the%20Multi-Net"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br />&amp;nbsp;</p><div></div><div></div>]]></description>
<pubDate>8/01/2007 21:53</pubDate>
<author><![CDATA[Kaihua Xu,Ya Wang,Wei Teng,Yuhua Liu]]></author></item>
<item><title><![CDATA[Double-Indexing Mechanism of Search Engine Based on Campus Net]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1421</link>
<description><![CDATA[<p>This paper discusses the double-indexing mechanism of search engine based on  campus net. At first of the paper, we introduce the search engine and it&amp;rsquo;s  types. Then, we refer to the search engine of campus net that is not general  full-text search engine and the necessary of designing CNSE. Furthermore, the  structure of the index is described. In addition, we discuss the word-filtering  mechanism, performance optimization of index and implement scheme of CNSE  system. And we conclude by combining the search engine with Web  Service. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510654.pdf&amp;amp;T=Double-Indexing%20Mechanism%20of%20Search%20Engine%20Based%20on%20Campus%20Net"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br />&amp;nbsp;</p><div></div><div></div>]]></description>
<pubDate>8/01/2007 21:54</pubDate>
<author><![CDATA[Changsheng Zhou,Wei Ding,Na Yang,Zhiqiang Ma]]></author></item>
<item><title><![CDATA[Research on the Preventive Strategy of Credit Risk in On-Line Auction Market]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1422</link>
<description><![CDATA[<p>Along with the swift development of on-line auction, credit problem has become a  focus attracting increasing attention of people. Information flow, capital flow  and logistics exist in both traditional business transaction and on-line  auction. Only when all of the above three factors finish backflow, could it be  regarded as the completion of transaction. Therefore, carrying out strict  supervision on the three factors could thoroughly solve the credit problems in  on-line auction. Therefore, the following will analyze the credit mechanism in  on-line auction from three aspects of transaction rule, credit index and payment  tool. It&amp;rsquo;s believed that, if only such three sections are perfected, could we  realize the objective of establishing perfect credit mechanism very soon.  Surely, the on-line auction will develop in a healthy, orderly and rapid way  under perfect mechanism. Finally, the thesis put forward the relevant Preventive  Strategy of Credit Risk. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510658.pdf&amp;amp;T=Research%20on%20the%20Preventive%20Strategy%20of%20Credit%20Risk%20in%20On-Line%20Auction%20Market"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br />&amp;nbsp;</p><div></div><div></div>]]></description>
<pubDate>8/01/2007 21:55</pubDate>
<author><![CDATA[Qinghua Zhang]]></author></item>
<item><title><![CDATA[On Loan-to-Value Ratios of Inventory Financing with Doubly Stochastic Poisson Default Processes]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1423</link>
<description><![CDATA[<p>To determine appropriate loan-to-value ratios of inventory collateral can make  bank mitigate credit risk of inventory financing effectively. Based on  reduced-form approaches, this paper assumes that the default of the enterprise  is exogenous and follows a doubly stochastic poisson process, and then provides  a model on the determination of loan-to-value ratios for banks. In this model,  some factors, such as risk appetite of banks, expected rate of return and price  volatility of collateral, frequency of marking to market and maturity time of  loan, are considered synthetically, so banks may determine appropriate  loan-to-value ratios of particular inventory financing operation to keep the  level of taken risk consistent. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510663.pdf&amp;amp;T=On%20Loan-to-Value%20Ratios%20of%20Inventory%20Financing%20with%20Doubly%20Stochastic%20Poisson%20Default%20Processes"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br />&amp;nbsp;</p><div></div><div></div>]]></description>
<pubDate>8/01/2007 21:58</pubDate>
<author><![CDATA[Yixue Li,Yu Xu,Gengzhong Feng,Wenqiang Dai]]></author></item>
<item><title><![CDATA[An Evolutionary Algorithm for Constrained Multi-objective Optimization Problems]]></title>
<link>http://www.servicescomputing.tv/rss/view/readarticle_view.php?info_id=1424</link>
<description><![CDATA[<p>Constrained multi-objective optimization problems (CMOP) are challenging and  difficult to solve. In this paper, a simple and practical evolutionary algorithm  for constrained multi-objective optimization problems (EACMOP) is presented, by  defining constraints using non-parameter punitive functions, using Pareto  strength value to represent Pareto order strength among individuals and using  crowding density to ensure group diversity. It defines the evolutionary  algorithm fitness functions by combining constraint treatment, comparison of  Pareto strength optimization and crowding density. Test results on several  benchmark functions showed that the approach is effective and  robust. </p><p><a href="https://newton.computer.org/DocDelivery/Shopping.nsf/AddToCart?OpenAgent&amp;amp;U=http://csdl.computer.org/dl/proceedings/apscc/2006/2751/00/27510667.pdf&amp;amp;T=An%20Evolutionary%20Algorithm%20for%20Constrained%20Multi-objective%20Optimization%20Problems"><img class="hspace" src="/common/images/buy_icon9.jpg" alt="Buy this article" align="absmiddle" /></a> <br />&amp;nbsp;</p><div></div><div></div>]]></description>
<pubDate>8/01/2007 22:04</pubDate>
<author><![CDATA[Hua-Qing Min,Yu-Ren Zhou,Yan-Sheng Lu,Jia-zhi Jiang]]></author></item>
</Channel>
</rss>