Pub Date : 2003-07-14DOI: 10.1109/COEC.2003.1210263
R. Jurca, B. Faltings
Traditional centralized approaches to security are difficult to apply to large, distributed marketplaces in which software agents operate. Developing a notion of trust that is based on the reputation of agents can provide a softer notion of security that is sufficient for many multi-agent applications. We address the issue of incentive-compatibility (i.e. how to make it optimal for agents to share reputation information truthfully), by introducing a side-payment scheme, organized through a set of broker agents, that makes it rational for software agents to truthfully share the reputation information they have acquired in their past experience. We also show how to use a cryptographic mechanism to protect the integrity of reputation information and to achieve a tight bounding between the identity and reputation of an agent.
{"title":"An incentive compatible reputation mechanism","authors":"R. Jurca, B. Faltings","doi":"10.1109/COEC.2003.1210263","DOIUrl":"https://doi.org/10.1109/COEC.2003.1210263","url":null,"abstract":"Traditional centralized approaches to security are difficult to apply to large, distributed marketplaces in which software agents operate. Developing a notion of trust that is based on the reputation of agents can provide a softer notion of security that is sufficient for many multi-agent applications. We address the issue of incentive-compatibility (i.e. how to make it optimal for agents to share reputation information truthfully), by introducing a side-payment scheme, organized through a set of broker agents, that makes it rational for software agents to truthfully share the reputation information they have acquired in their past experience. We also show how to use a cryptographic mechanism to protect the integrity of reputation information and to achieve a tight bounding between the identity and reputation of an agent.","PeriodicalId":375124,"journal":{"name":"EEE International Conference on E-Commerce, 2003. CEC 2003.","volume":"250 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116719988","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2003-06-24DOI: 10.1109/COEC.2003.1210276
Debra E. VanderMeer, Anindya Datta, K. Dutta, Helen M. Thomas, K. Ramamritham, S. Navathe
Service portals are systems which expose a bundle of Web services to the user, allowing the specification and subsequent execution of complex tasks defined over these individual services. Examples of situations where service portals would be valuable include making travel plans or purchasing a home. Service portals must be capable of converting an abstract user goal into a correct and optimal concrete execution plan, executing according to the plan, verifying the result against a user's stated satisfaction criteria, and in the case of satisfaction failure, initiating the appropriate recovery procedures. The basic framework needed to support this functionality, from gathering the input to generating an optimal plan and executing that plan, is a prerequisite for all service portals, yet there are currently no such commercial systems in existence, and the research literature has given only cursory treatment to some of these issues. In this paper, we describe FUSION, a comprehensive software system which provides the underlying framework for a service portal. We show how using the elements of this framework, service portal designers and architects can easily create domain-specific service portals, e.g., a travel service portal. We also present the Web services execution specification language (WSESL), a language that we have developed to describe execution plans in the context of the FUSION services model. Finally, we develop a set of data structures and algorithms for generating correct and optimal execution plans.
{"title":"FUSION: a system allowing dynamic Web service composition and automatic execution","authors":"Debra E. VanderMeer, Anindya Datta, K. Dutta, Helen M. Thomas, K. Ramamritham, S. Navathe","doi":"10.1109/COEC.2003.1210276","DOIUrl":"https://doi.org/10.1109/COEC.2003.1210276","url":null,"abstract":"Service portals are systems which expose a bundle of Web services to the user, allowing the specification and subsequent execution of complex tasks defined over these individual services. Examples of situations where service portals would be valuable include making travel plans or purchasing a home. Service portals must be capable of converting an abstract user goal into a correct and optimal concrete execution plan, executing according to the plan, verifying the result against a user's stated satisfaction criteria, and in the case of satisfaction failure, initiating the appropriate recovery procedures. The basic framework needed to support this functionality, from gathering the input to generating an optimal plan and executing that plan, is a prerequisite for all service portals, yet there are currently no such commercial systems in existence, and the research literature has given only cursory treatment to some of these issues. In this paper, we describe FUSION, a comprehensive software system which provides the underlying framework for a service portal. We show how using the elements of this framework, service portal designers and architects can easily create domain-specific service portals, e.g., a travel service portal. We also present the Web services execution specification language (WSESL), a language that we have developed to describe execution plans in the context of the FUSION services model. Finally, we develop a set of data structures and algorithms for generating correct and optimal execution plans.","PeriodicalId":375124,"journal":{"name":"EEE International Conference on E-Commerce, 2003. CEC 2003.","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115493973","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2003-06-24DOI: 10.1109/COEC.2003.1210274
D. Rocco, David J. Buttler, Ling Liu
We introduce Page Digest, a mechanism for efficient storage and processing of Web documents. The Page Digest design encourages a clean separation of the structural elements of Web documents from their content. Its encoding transformation produces many of the advantages of traditional string digest schemes yet remains invertible without introducing significant additional cost or complexity. Using the Page Digest encoding can provide at least an order of magnitude speedup when traversing a Web document as compared to using a standard document object model implementation. Our experiments show that change detection using Page Digest operates in linear time, offering 75% improvement in execution performance compared with existing systems. In addition, the Page Digest encoding can reduce the tag name redundancy found in Web documents, allowing 30% to 50% reduction in document size.
{"title":"Page Digest for large-scale Web services","authors":"D. Rocco, David J. Buttler, Ling Liu","doi":"10.1109/COEC.2003.1210274","DOIUrl":"https://doi.org/10.1109/COEC.2003.1210274","url":null,"abstract":"We introduce Page Digest, a mechanism for efficient storage and processing of Web documents. The Page Digest design encourages a clean separation of the structural elements of Web documents from their content. Its encoding transformation produces many of the advantages of traditional string digest schemes yet remains invertible without introducing significant additional cost or complexity. Using the Page Digest encoding can provide at least an order of magnitude speedup when traversing a Web document as compared to using a standard document object model implementation. Our experiments show that change detection using Page Digest operates in linear time, offering 75% improvement in execution performance compared with existing systems. In addition, the Page Digest encoding can reduce the tag name redundancy found in Web documents, allowing 30% to 50% reduction in document size.","PeriodicalId":375124,"journal":{"name":"EEE International Conference on E-Commerce, 2003. CEC 2003.","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115516258","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2003-06-24DOI: 10.1109/COEC.2003.1210254
Weidong Qiu, Mingxing He, F. Kaderali
We introduce a highly efficient string-ring certificate architecture. Compared with the conventional X.509 certificate architecture, this new architecture has the advantage of simple management and convenient verification. There is only one route transverse to the root. To realize the new certificate architecture a modified group signature scheme is presented.
{"title":"Group oriented digital certificate architecture","authors":"Weidong Qiu, Mingxing He, F. Kaderali","doi":"10.1109/COEC.2003.1210254","DOIUrl":"https://doi.org/10.1109/COEC.2003.1210254","url":null,"abstract":"We introduce a highly efficient string-ring certificate architecture. Compared with the conventional X.509 certificate architecture, this new architecture has the advantage of simple management and convenient verification. There is only one route transverse to the root. To realize the new certificate architecture a modified group signature scheme is presented.","PeriodicalId":375124,"journal":{"name":"EEE International Conference on E-Commerce, 2003. CEC 2003.","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117044259","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2003-06-24DOI: 10.1109/COEC.2003.1210257
Sudhir Vallamkondu, L. Gruenwald
The success of an e-commerce (electronic commerce) site is measured in terms of the number of users visiting the site. A survey of essential qualities for a successful EC site suggests that reduced user perceived latency is the second most important quality after good site navigation quality. The most successful approach towards reducing user perceived latency has been the extraction of path traversal patterns from past users access history to predict future user traversal behavior and to prefetch the required resources. However this approach is suited for only non-EC sites where there is no purchase behavior. In this paper we describe a new approach to predict user behavior in EC sites. The core of our approach involves extracting knowledge from integrated data of purchase and path traversal patterns of past users to predict the purchase and traversal behavior of future users. Simulations were conducted using synthetic data, which showed that the proposed model produces more accurate modeling of the user behavior.
{"title":"Integrating purchase patterns and traversal patterns to predict HTTP requests in e-commerce sites","authors":"Sudhir Vallamkondu, L. Gruenwald","doi":"10.1109/COEC.2003.1210257","DOIUrl":"https://doi.org/10.1109/COEC.2003.1210257","url":null,"abstract":"The success of an e-commerce (electronic commerce) site is measured in terms of the number of users visiting the site. A survey of essential qualities for a successful EC site suggests that reduced user perceived latency is the second most important quality after good site navigation quality. The most successful approach towards reducing user perceived latency has been the extraction of path traversal patterns from past users access history to predict future user traversal behavior and to prefetch the required resources. However this approach is suited for only non-EC sites where there is no purchase behavior. In this paper we describe a new approach to predict user behavior in EC sites. The core of our approach involves extracting knowledge from integrated data of purchase and path traversal patterns of past users to predict the purchase and traversal behavior of future users. Simulations were conducted using synthetic data, which showed that the proposed model produces more accurate modeling of the user behavior.","PeriodicalId":375124,"journal":{"name":"EEE International Conference on E-Commerce, 2003. CEC 2003.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129667384","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2003-06-24DOI: 10.1109/COEC.2003.1210237
Jin Baek Kim, A. Segev
The importance of personalized products and services is increasing in the dynamic customer-oriented business marketplace. Open environment of dynamic interoperable eBusiness processes is a key requirement for the emerging business models. Negotiation processes are at the core of dynamic eBusiness. While research on negotiation is not new, the vast majority of the studies to date have focused on auctions and bilateral negotiations. More complex negotiations are often required for dynamic formation of supply network and personalized fulfillment of the requests. In addition, it is very common that negotiation processes are "interleaved" with other business processes. We propose a framework for negotiation processes that provides a consistent model for supporting a comprehensive range of negotiations in dynamic eBusiness environment. The new framework leverages the scope of existing research on the negotiations and extends it to the level of complexity necessary for next generation eBusiness applications. The framework provides the foundation for constructing dynamic negotiation processes by enabling the required functionality in five components: 1) negotiation requirements, 2) negotiation structure, 3) negotiation process, 4) negotiation protocol, and 5) negotiation strategy.
{"title":"A framework for dynamic eBusiness negotiation processes","authors":"Jin Baek Kim, A. Segev","doi":"10.1109/COEC.2003.1210237","DOIUrl":"https://doi.org/10.1109/COEC.2003.1210237","url":null,"abstract":"The importance of personalized products and services is increasing in the dynamic customer-oriented business marketplace. Open environment of dynamic interoperable eBusiness processes is a key requirement for the emerging business models. Negotiation processes are at the core of dynamic eBusiness. While research on negotiation is not new, the vast majority of the studies to date have focused on auctions and bilateral negotiations. More complex negotiations are often required for dynamic formation of supply network and personalized fulfillment of the requests. In addition, it is very common that negotiation processes are \"interleaved\" with other business processes. We propose a framework for negotiation processes that provides a consistent model for supporting a comprehensive range of negotiations in dynamic eBusiness environment. The new framework leverages the scope of existing research on the negotiations and extends it to the level of complexity necessary for next generation eBusiness applications. The framework provides the foundation for constructing dynamic negotiation processes by enabling the required functionality in five components: 1) negotiation requirements, 2) negotiation structure, 3) negotiation process, 4) negotiation protocol, and 5) negotiation strategy.","PeriodicalId":375124,"journal":{"name":"EEE International Conference on E-Commerce, 2003. CEC 2003.","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116310131","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2003-06-24DOI: 10.1109/COEC.2003.1210258
S. Yang, Liang-Jie Zhang, T. Chao, J. Xu, Ying Nan Zuo, Zhong Tian, Henry Chang
Effectively profiling customer, merchant and service information is critical to today's e-commerce (electronic commerce) environment. The challenge is to build a flexible profiling system to dynamically collect relevant information about consumers according to diverse profiling requirements of different services, so that the services can get provisioned. We present a service hub based two-phase profiling framework equipped with two profiling methods namely Delegated Profiling and Punchout Profiling to address this challenge. Powered by D3Form (Data Driven Dynamic Form) technology, Delegated Profiling is able to cost-effectively collect consumers' information for services in addition to a common base profiling requirement by specifying service-specific delta. Punchout Profiling enables seamless integration between services' profiling systems and the hub by the Profiling Punchout Protocol.
{"title":"Adaptive profiling framework and system for service provisioning","authors":"S. Yang, Liang-Jie Zhang, T. Chao, J. Xu, Ying Nan Zuo, Zhong Tian, Henry Chang","doi":"10.1109/COEC.2003.1210258","DOIUrl":"https://doi.org/10.1109/COEC.2003.1210258","url":null,"abstract":"Effectively profiling customer, merchant and service information is critical to today's e-commerce (electronic commerce) environment. The challenge is to build a flexible profiling system to dynamically collect relevant information about consumers according to diverse profiling requirements of different services, so that the services can get provisioned. We present a service hub based two-phase profiling framework equipped with two profiling methods namely Delegated Profiling and Punchout Profiling to address this challenge. Powered by D3Form (Data Driven Dynamic Form) technology, Delegated Profiling is able to cost-effectively collect consumers' information for services in addition to a common base profiling requirement by specifying service-specific delta. Punchout Profiling enables seamless integration between services' profiling systems and the hub by the Profiling Punchout Protocol.","PeriodicalId":375124,"journal":{"name":"EEE International Conference on E-Commerce, 2003. CEC 2003.","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133940571","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2003-06-24DOI: 10.1109/COEC.2003.1210243
T. Pham
This paper outlines the process of adopting electronic data interchange into a business cycle and the issues encountered in the process. These issues are categorized into technical, financial, scheduling, and ethical areas. Real-life case studies are presented to illustrate the difficulties of adopting electronic data interchange. Common-sense experiences from these case studies are summarized as strategic moves that might be helpful in avoiding the pain that others have already experienced.
{"title":"Managerial considerations to adopting electronic data interchange","authors":"T. Pham","doi":"10.1109/COEC.2003.1210243","DOIUrl":"https://doi.org/10.1109/COEC.2003.1210243","url":null,"abstract":"This paper outlines the process of adopting electronic data interchange into a business cycle and the issues encountered in the process. These issues are categorized into technical, financial, scheduling, and ethical areas. Real-life case studies are presented to illustrate the difficulties of adopting electronic data interchange. Common-sense experiences from these case studies are summarized as strategic moves that might be helpful in avoiding the pain that others have already experienced.","PeriodicalId":375124,"journal":{"name":"EEE International Conference on E-Commerce, 2003. CEC 2003.","volume":"231 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126137388","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2003-06-24DOI: 10.1109/COEC.2003.1210239
Carlos Molina-Jiménez, S. Shrivastava, E. Solaiman, J. Warne
Converting a conventional contract into an electronic equivalent that can be executed and enforced by computers is a challenging task. The difficulties are caused by the ambiguities that the original human-oriented text is likely to contain. The conversion process involves the conversion of the original text into mathematical notation. We discuss how standard conventional contracts can be described by means of finite state machines (FSMs). This mathematical description helps eliminate ambiguities from the original text before the contract is coded into a computer program. We describe how to map the rights and obligations extracted from the clauses of the contract into the states, transition and output functions, and input and output symbols of a FSM. The FSM representation can be used to guarantee that the clauses stipulated in the contract are observed when the contract is executed. We describe the middleware required for the enactment of the contract represented as a FSM.
{"title":"Contract representation for run-time monitoring and enforcement","authors":"Carlos Molina-Jiménez, S. Shrivastava, E. Solaiman, J. Warne","doi":"10.1109/COEC.2003.1210239","DOIUrl":"https://doi.org/10.1109/COEC.2003.1210239","url":null,"abstract":"Converting a conventional contract into an electronic equivalent that can be executed and enforced by computers is a challenging task. The difficulties are caused by the ambiguities that the original human-oriented text is likely to contain. The conversion process involves the conversion of the original text into mathematical notation. We discuss how standard conventional contracts can be described by means of finite state machines (FSMs). This mathematical description helps eliminate ambiguities from the original text before the contract is coded into a computer program. We describe how to map the rights and obligations extracted from the clauses of the contract into the states, transition and output functions, and input and output symbols of a FSM. The FSM representation can be used to guarantee that the clauses stipulated in the contract are observed when the contract is executed. We describe the middleware required for the enactment of the contract represented as a FSM.","PeriodicalId":375124,"journal":{"name":"EEE International Conference on E-Commerce, 2003. CEC 2003.","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126203509","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2003-06-24DOI: 10.1109/COEC.2003.1210271
Zhen Liu, L. Wynter, Cathy H. Xia
Design of competitive e-commerce services, in such a quickly responding market, requires the analyses of prices and price structures. We present a general model of an e-commerce market that allows us to analyze optimal price structures, both flat and usage-based. Based on the price structure of a major Web hosting provider, we consider both single-tier and two-tier (burst-rate) pricing, and our result suggests that the more complex two-tier structure may not be worth the marketing effort, as the firm's equilibrium profits will not increase through the use of this structure. An essential feature of our approach is that we model explicitly the spread of price-QoS tradeoffs across the end-user population.
{"title":"Usage-based versus flat pricing for e-business services with differentiated QoS","authors":"Zhen Liu, L. Wynter, Cathy H. Xia","doi":"10.1109/COEC.2003.1210271","DOIUrl":"https://doi.org/10.1109/COEC.2003.1210271","url":null,"abstract":"Design of competitive e-commerce services, in such a quickly responding market, requires the analyses of prices and price structures. We present a general model of an e-commerce market that allows us to analyze optimal price structures, both flat and usage-based. Based on the price structure of a major Web hosting provider, we consider both single-tier and two-tier (burst-rate) pricing, and our result suggests that the more complex two-tier structure may not be worth the marketing effort, as the firm's equilibrium profits will not increase through the use of this structure. An essential feature of our approach is that we model explicitly the spread of price-QoS tradeoffs across the end-user population.","PeriodicalId":375124,"journal":{"name":"EEE International Conference on E-Commerce, 2003. CEC 2003.","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114561355","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：