Recommender systems help customers toidentify products which fulfill certain requirements.Many different approaches have been developed andwork well for different domains. What has been ignoredso far is the fact that psychological phenomena can resultin suboptimal decision taking on recommender resultpages. This paper presents a user study investigating theAsymmetric Dominance Effect and the CompromiseEffect in the domain of financial services. The empiricalfindings are compared with the calculations of the SimpleDominance Model which serves as a model foridentification and explanation of such effects.Furthermore, we show how to identify misleading effectson recommender result pages, and how to correctproduct perception such that the felt utility reflects theutility calculated by recommender systems.
{"title":"Asymmetric Dominance- and Compromise Effects in the Financial Services Domain","authors":"E. Teppan, A. Felfernig","doi":"10.1109/CEC.2009.69","DOIUrl":"https://doi.org/10.1109/CEC.2009.69","url":null,"abstract":"Recommender systems help customers toidentify products which fulfill certain requirements.Many different approaches have been developed andwork well for different domains. What has been ignoredso far is the fact that psychological phenomena can resultin suboptimal decision taking on recommender resultpages. This paper presents a user study investigating theAsymmetric Dominance Effect and the CompromiseEffect in the domain of financial services. The empiricalfindings are compared with the calculations of the SimpleDominance Model which serves as a model foridentification and explanation of such effects.Furthermore, we show how to identify misleading effectson recommender result pages, and how to correctproduct perception such that the felt utility reflects theutility calculated by recommender systems.","PeriodicalId":384060,"journal":{"name":"2009 IEEE Conference on Commerce and Enterprise Computing","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128070729","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}
In order to open-up enterprise applications to e-businessand make them profitable for a communication with otherenterprise applications, a business model is needed showingthe business essentials of the e-commerce business caseto be developed. Currently there are two major businessmodeling techniques - e3-value and REA (Resource-Event-Agent). Whereas e3-value was designed for modeling valueexchanges within an e-business network of multiple businesspartners, the REA ontology assumes that, in the presence ofmoney and available prices, all multi-party collaborationsmay be decomposed into a set of corresponding binarycollaborations. This paper is a preliminary attempt to viewe3-value and REA used side-by-side to see where they cancomplement each other in coordinated use in the context ofmultiple-partner collaboration. A real life scenario from theprint media domain has been taken to proof our approach.
{"title":"From e3-value to REA: Modeling Multi-party E-business Collaborations","authors":"R. Schuster, Thomas Motal","doi":"10.1109/CEC.2009.58","DOIUrl":"https://doi.org/10.1109/CEC.2009.58","url":null,"abstract":"In order to open-up enterprise applications to e-businessand make them profitable for a communication with otherenterprise applications, a business model is needed showingthe business essentials of the e-commerce business caseto be developed. Currently there are two major businessmodeling techniques - e3-value and REA (Resource-Event-Agent). Whereas e3-value was designed for modeling valueexchanges within an e-business network of multiple businesspartners, the REA ontology assumes that, in the presence ofmoney and available prices, all multi-party collaborationsmay be decomposed into a set of corresponding binarycollaborations. This paper is a preliminary attempt to viewe3-value and REA used side-by-side to see where they cancomplement each other in coordinated use in the context ofmultiple-partner collaboration. A real life scenario from theprint media domain has been taken to proof our approach.","PeriodicalId":384060,"journal":{"name":"2009 IEEE Conference on Commerce and Enterprise Computing","volume":"188 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132077404","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}
Roland Klueber, H. McCann, R. Wehrle, Thomas Knopf
The challenges of establishing a global information and document exchange system are described in the case study of Jet Aviation. The context is the improvement of its spare parts supply chain with Fiege Logistics to expand its reach through Internet based software as a service (SaaS) solution. The resulting innovative solution has the capability to integrate several worldwide operating organizations with different IT infrastructures and environments to increase the total customer service.
{"title":"Service Innovation in Spare Parts Logistics in the Business Aviation Industry","authors":"Roland Klueber, H. McCann, R. Wehrle, Thomas Knopf","doi":"10.1109/CEC.2009.82","DOIUrl":"https://doi.org/10.1109/CEC.2009.82","url":null,"abstract":"The challenges of establishing a global information and document exchange system are described in the case study of Jet Aviation. The context is the improvement of its spare parts supply chain with Fiege Logistics to expand its reach through Internet based software as a service (SaaS) solution. The resulting innovative solution has the capability to integrate several worldwide operating organizations with different IT infrastructures and environments to increase the total customer service.","PeriodicalId":384060,"journal":{"name":"2009 IEEE Conference on Commerce and Enterprise Computing","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129820179","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}
The goal of the Web Service Composition (WSC) problem is to find an optimal composition of web services to satisfy a given request using their syntactic and/or semantic features. In this paper, in particular, we study the Quality of Services (QoS)-driven WSC problem to optimize service quality criteria, e.g., response time and/or throughput. We propose a novel solution based on Learning-based Depth First Search (LDFS). Given a set of web service descriptions including QoS information and a requirement web service, we reduce the QoS-driven WSC problem into a planning problem on a state-transition system. We then find the optimal solution for the problem using a dynamic programming based on LDFS which recently has shown a promising result.
{"title":"QoS-Driven Web Service Composition Using Learning-Based Depth First Search","authors":"Wonhong Nam, Hyunyoung Kil, Jungjae Lee","doi":"10.1109/CEC.2009.50","DOIUrl":"https://doi.org/10.1109/CEC.2009.50","url":null,"abstract":"The goal of the Web Service Composition (WSC) problem is to find an optimal composition of web services to satisfy a given request using their syntactic and/or semantic features. In this paper, in particular, we study the Quality of Services (QoS)-driven WSC problem to optimize service quality criteria, e.g., response time and/or throughput. We propose a novel solution based on Learning-based Depth First Search (LDFS). Given a set of web service descriptions including QoS information and a requirement web service, we reduce the QoS-driven WSC problem into a planning problem on a state-transition system. We then find the optimal solution for the problem using a dynamic programming based on LDFS which recently has shown a promising result.","PeriodicalId":384060,"journal":{"name":"2009 IEEE Conference on Commerce and Enterprise Computing","volume":"2008 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125594038","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}
Marco Aiello, E. Khoury, A. Lazovik, Patrick Ratelband
The availability of many independent services on anopen network opens the opportunity of composing individualinstances to achieve complex functionality. Most often thereare several possible compositions to achieve the same highlevelfunctionality; the advantage of choosing one compositioninstead of another one may lie in the different quality ofthe composition, e.g., one might be cheaper, faster, or morereliable. In this paper, we focus on services described withXML documents and accessed via XML Protocols, knownas Web services, and enriched with semantic and Qualityof Service (QoS) annotations. We propose an algorithmthat, given a desired functionality, returns a composition ofservices from a repository with the optimal response time orthroughput. Services are composed taking into account anontology of operation names expressed in OWL. RuGQoS isthe related implementation.
{"title":"Optimal QoS-Aware Web Service Composition","authors":"Marco Aiello, E. Khoury, A. Lazovik, Patrick Ratelband","doi":"10.1109/CEC.2009.63","DOIUrl":"https://doi.org/10.1109/CEC.2009.63","url":null,"abstract":"The availability of many independent services on anopen network opens the opportunity of composing individualinstances to achieve complex functionality. Most often thereare several possible compositions to achieve the same highlevelfunctionality; the advantage of choosing one compositioninstead of another one may lie in the different quality ofthe composition, e.g., one might be cheaper, faster, or morereliable. In this paper, we focus on services described withXML documents and accessed via XML Protocols, knownas Web services, and enriched with semantic and Qualityof Service (QoS) annotations. We propose an algorithmthat, given a desired functionality, returns a composition ofservices from a repository with the optimal response time orthroughput. Services are composed taking into account anontology of operation names expressed in OWL. RuGQoS isthe related implementation.","PeriodicalId":384060,"journal":{"name":"2009 IEEE Conference on Commerce and Enterprise Computing","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128590979","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}
The ever increasing number of adoptions from companies and the growing interest upon BPMN entails the need of having one more structured underlying conceptual model. In the past different proposals to equip BPMN with a conceptual model have been defined, but the solution currently adopted remains unclear and too complex. Also the proposals submitted to the BPMN 2.0 RFP, which calls for a single notation to define notation, metamodel and interchange format addressing BPDM concepts, are still - in part - unsatisfactory. We developed a new model starting from scratch, and the result of this work is a complete conceptual model for BPMN with a clear metamodel and its related XML-based serialization which provides a self-validating mechanism for checking BP syntax and semantics.
{"title":"Modeling and Validating BPMN Diagrams","authors":"Michele Chinosi, Alberto Trombetta","doi":"10.1109/CEC.2009.48","DOIUrl":"https://doi.org/10.1109/CEC.2009.48","url":null,"abstract":"The ever increasing number of adoptions from companies and the growing interest upon BPMN entails the need of having one more structured underlying conceptual model. In the past different proposals to equip BPMN with a conceptual model have been defined, but the solution currently adopted remains unclear and too complex. Also the proposals submitted to the BPMN 2.0 RFP, which calls for a single notation to define notation, metamodel and interchange format addressing BPDM concepts, are still - in part - unsatisfactory. We developed a new model starting from scratch, and the result of this work is a complete conceptual model for BPMN with a clear metamodel and its related XML-based serialization which provides a self-validating mechanism for checking BP syntax and semantics.","PeriodicalId":384060,"journal":{"name":"2009 IEEE Conference on Commerce and Enterprise Computing","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121817242","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}
In recent years, the proliferation of the world wide web has lead toan increase in the number of public auctions on the internet. One ofthe characteristics of online auctions is that a successfulimplementation requires a high volume of buyers and sellers at itswebsite. Consequently, auction sites which have a high volume oftraffic have an advantage over those in which the volume is limited.This results in even greater polarization of buyers and sellerstowards a particular site. This is often referred to as the``network effect'' in a variety of web and telecommunicationapplications involving interactions among a large number ofentities. While this effect has qualitatively been known toincrease the value of the overall network, its effect has never beenmodeled or studied rigorously. In this paper, we construct a MarkovModel to analyze the network effect in the case of web auctions. Weshow that the network effect is very powerful for the case of webauctions and can result in a situation in which one auction canquickly overwhelm its competing sites. This results in a situationin which the natural stable equilibrium is that of a single onlineauction seller for a given product and geographical locality. Whilea single player structure is unlikely because of some approximationassumptions in the model, the trend seems to show the likelyexistence of single dominant player in the web auction space.
{"title":"Online Auctions: There Can Be Only One","authors":"C. Aggarwal, Philip S. Yu","doi":"10.1109/CEC.2009.12","DOIUrl":"https://doi.org/10.1109/CEC.2009.12","url":null,"abstract":"In recent years, the proliferation of the world wide web has lead toan increase in the number of public auctions on the internet. One ofthe characteristics of online auctions is that a successfulimplementation requires a high volume of buyers and sellers at itswebsite. Consequently, auction sites which have a high volume oftraffic have an advantage over those in which the volume is limited.This results in even greater polarization of buyers and sellerstowards a particular site. This is often referred to as the``network effect'' in a variety of web and telecommunicationapplications involving interactions among a large number ofentities. While this effect has qualitatively been known toincrease the value of the overall network, its effect has never beenmodeled or studied rigorously. In this paper, we construct a MarkovModel to analyze the network effect in the case of web auctions. Weshow that the network effect is very powerful for the case of webauctions and can result in a situation in which one auction canquickly overwhelm its competing sites. This results in a situationin which the natural stable equilibrium is that of a single onlineauction seller for a given product and geographical locality. Whilea single player structure is unlikely because of some approximationassumptions in the model, the trend seems to show the likelyexistence of single dominant player in the web auction space.","PeriodicalId":384060,"journal":{"name":"2009 IEEE Conference on Commerce and Enterprise Computing","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116745367","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
扫码关注我们
求助内容：
应助结果提醒方式：