Stefan Stieglitz, Christoph Fuchß, Christoph Lattemann
Portable devices with Bluetooth interfaces, such as mobile phones and PDAs, are enabled for near field communication (
具有蓝牙接口的便携设备，例如流动电话和掌上电脑，可进行近场通讯(
{"title":"A Business Model for Mobile Ad-Hoc Communities","authors":"Stefan Stieglitz, Christoph Fuchß, Christoph Lattemann","doi":"10.1109/CEC.2009.73","DOIUrl":"https://doi.org/10.1109/CEC.2009.73","url":null,"abstract":"Portable devices with Bluetooth interfaces, such as mobile phones and PDAs, are enabled for near field communication (","PeriodicalId":384060,"journal":{"name":"2009 IEEE Conference on Commerce and Enterprise Computing","volume":"31 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":"124001189","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}
Semantic information, which is well-regulated and easy to be retrieved, has greatly enriched the expressive ability of the Web. These advantages can be applied in Web Services to meet the increasing complexity of Web applications. In this paper, we propose a service composition approach. It combines the large-scaled Web Services and semantic information which is described in WSC’09. Besides, QoS has become a critical issue to evaluate the performance of Web applications. Being different from improving the QoS of single services, our approach focuses on the overall QoS of the service composition. The algorithm shows that the semantic information based and QoS driven approach improves the efficiency and QoS performance of service composition.
{"title":"A QoS-Driven Approach for Semantic Service Composition","authors":"Yixin Yan, Bin Xu, Zhifeng Gu, Sen Luo","doi":"10.1109/CEC.2009.44","DOIUrl":"https://doi.org/10.1109/CEC.2009.44","url":null,"abstract":"Semantic information, which is well-regulated and easy to be retrieved, has greatly enriched the expressive ability of the Web. These advantages can be applied in Web Services to meet the increasing complexity of Web applications. In this paper, we propose a service composition approach. It combines the large-scaled Web Services and semantic information which is described in WSC’09. Besides, QoS has become a critical issue to evaluate the performance of Web applications. Being different from improving the QoS of single services, our approach focuses on the overall QoS of the service composition. The algorithm shows that the semantic information based and QoS driven approach improves the efficiency and QoS performance of service composition.","PeriodicalId":384060,"journal":{"name":"2009 IEEE Conference on Commerce and Enterprise Computing","volume":"48 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":"115658692","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}
Handling of confidential and sensitive data is an important issue facing any professional service provider that wishes to use services from a third party company. This paper describes an infrastructure, the Privacy Infrastructure Appliance that was designed to protect confidential information when outsourcing service fulfillment. A comparison is made with an embedded solution that does not use an infrastructure.There are two use cases to consider, one use case is the outsourcing of back-end service fulfillment, such as executing foreign exchange trade orders and the second use case is the outsourcing of back-office activities, such as non-core competence office work. In considering back-end service delivery, we look at the use of computer systems and processes, which are not privy to confidential information. In considering back-office clerical activities, we look at the human component of service fulfillment, the clerical office worker. The clerical office worker that is outsourced, will still use the applications of the outsourcing company, but he is no longer privy to confidential information. This paper describes and contrasts two solutions. An infrastructure that was built to meet confidential information requirements for doing outsourcing of solution delivery systems and an application approach to mask confidential information from outsourced back office workers.
{"title":"Privacy Application Infrastructure: Confidential Data Masking","authors":"B. Liver, K. Tice","doi":"10.1109/CEC.2009.43","DOIUrl":"https://doi.org/10.1109/CEC.2009.43","url":null,"abstract":"Handling of confidential and sensitive data is an important issue facing any professional service provider that wishes to use services from a third party company. This paper describes an infrastructure, the Privacy Infrastructure Appliance that was designed to protect confidential information when outsourcing service fulfillment. A comparison is made with an embedded solution that does not use an infrastructure.There are two use cases to consider, one use case is the outsourcing of back-end service fulfillment, such as executing foreign exchange trade orders and the second use case is the outsourcing of back-office activities, such as non-core competence office work. In considering back-end service delivery, we look at the use of computer systems and processes, which are not privy to confidential information. In considering back-office clerical activities, we look at the human component of service fulfillment, the clerical office worker. The clerical office worker that is outsourced, will still use the applications of the outsourcing company, but he is no longer privy to confidential information. This paper describes and contrasts two solutions. An infrastructure that was built to meet confidential information requirements for doing outsourcing of solution delivery systems and an application approach to mask confidential information from outsourced back office workers.","PeriodicalId":384060,"journal":{"name":"2009 IEEE Conference on Commerce and Enterprise Computing","volume":"1 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":"128699705","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}
As companies more and more often turn todocumenting their business processes in models, the task ofmanaging large model collections becomes essential. Thereis a number of techniques simplifying this task, e.g., constructionof customized process views and business processmodel abstraction. The latter aims at deriving abstract processrepresentations from existing low-level models omitting detailsirrelevant for the current task. A number of papers on processmodel abstraction conceptualized the abstraction problem andproposed algorithms handling simplistic models. To the bestof our knowledge there is no work discussing abstraction ofmodels in BPMN. In this paper we present an abstractionapproach, addressing specific features of BPMN 1.2. Theabstraction approach is order-preserving and is capable ofhandling graph-structured process models.
{"title":"Structural Aspects of Business Process Diagram Abstraction","authors":"S. Smirnov","doi":"10.1109/CEC.2009.18","DOIUrl":"https://doi.org/10.1109/CEC.2009.18","url":null,"abstract":"As companies more and more often turn todocumenting their business processes in models, the task ofmanaging large model collections becomes essential. Thereis a number of techniques simplifying this task, e.g., constructionof customized process views and business processmodel abstraction. The latter aims at deriving abstract processrepresentations from existing low-level models omitting detailsirrelevant for the current task. A number of papers on processmodel abstraction conceptualized the abstraction problem andproposed algorithms handling simplistic models. To the bestof our knowledge there is no work discussing abstraction ofmodels in BPMN. In this paper we present an abstractionapproach, addressing specific features of BPMN 1.2. Theabstraction approach is order-preserving and is capable ofhandling graph-structured process models.","PeriodicalId":384060,"journal":{"name":"2009 IEEE Conference on Commerce and Enterprise Computing","volume":"18 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":"125316111","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}
R. Kannan, Dinesh Garg, Karthik Subbian, Y. Narahari
In this paper, we consider an emerging scenario in sponsored web search auctions where ad networks would be involved as intermediaries between a search engine and its advertisers. In this context, we address the problem of the ad network identifying a bid profile that makes the sponsored search auction attractive to the registered bidders. Given (1) the valuation of the advertisers competing for sponsored slots corresponding to a keyword, and (2) relevant click-through rates, the proposed algorithm generates a bid profile that can be input to a standard generalized second price based sponsored search auction mechanism. The bid profile is derived using a two person Nash bargaining model which ensures a fair share of utility between the search engine and the advertisers. In the proposed model, the auctioneer (search engine) is one player and a virtual aggregated bidder representing all the $n$ advertisers is the other player. We show that the feasible set for the Nash bargaining formulation is a convex hull with three points that can be computed in $O(nlogn)$ time. We derive the Nash bargaining solution and show that it can be mapped to a bid profile of the bidders in $O(n)$ time.
{"title":"Nash Bargaining Based Ad Networks for Sponsored Search Auctions","authors":"R. Kannan, Dinesh Garg, Karthik Subbian, Y. Narahari","doi":"10.1109/CEC.2009.46","DOIUrl":"https://doi.org/10.1109/CEC.2009.46","url":null,"abstract":"In this paper, we consider an emerging scenario in sponsored web search auctions where ad networks would be involved as intermediaries between a search engine and its advertisers. In this context, we address the problem of the ad network identifying a bid profile that makes the sponsored search auction attractive to the registered bidders. Given (1) the valuation of the advertisers competing for sponsored slots corresponding to a keyword, and (2) relevant click-through rates, the proposed algorithm generates a bid profile that can be input to a standard generalized second price based sponsored search auction mechanism. The bid profile is derived using a two person Nash bargaining model which ensures a fair share of utility between the search engine and the advertisers. In the proposed model, the auctioneer (search engine) is one player and a virtual aggregated bidder representing all the $n$ advertisers is the other player. We show that the feasible set for the Nash bargaining formulation is a convex hull with three points that can be computed in $O(nlogn)$ time. We derive the Nash bargaining solution and show that it can be mapped to a bid profile of the bidders in $O(n)$ time.","PeriodicalId":384060,"journal":{"name":"2009 IEEE Conference on Commerce and Enterprise Computing","volume":"4 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":"125360860","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 the first quarter of year 2008, electronic reverseauctions (e-RAs) allowed the Brazilian Government tosave up to US$ 270 million, which account for 87% ofits acquisitions in the period, against 1% in the sameperiod 6 years earlier – according to the Ministry ofPlanning, Budget and Management. A tool of suchimportance is subjected to fraud or even anomalousbehaviors, which are difficult to detect with simpleanalysis over the current system. In this paper we lookforward into identifying suspicious behaviors in egovernmentprocurement systems, through the use ofbusiness intelligence techniques. The results confirmthat our methodology can help discovering interestingaspects that can be used to help market players indecision support and auctioneer’s management.
{"title":"A Business Intelligence Methodology for E-government Reverse Auctions","authors":"Rafael Souza, A. Pereira","doi":"10.1109/CEC.2009.37","DOIUrl":"https://doi.org/10.1109/CEC.2009.37","url":null,"abstract":"In the first quarter of year 2008, electronic reverseauctions (e-RAs) allowed the Brazilian Government tosave up to US$ 270 million, which account for 87% ofits acquisitions in the period, against 1% in the sameperiod 6 years earlier – according to the Ministry ofPlanning, Budget and Management. A tool of suchimportance is subjected to fraud or even anomalousbehaviors, which are difficult to detect with simpleanalysis over the current system. In this paper we lookforward into identifying suspicious behaviors in egovernmentprocurement systems, through the use ofbusiness intelligence techniques. The results confirmthat our methodology can help discovering interestingaspects that can be used to help market players indecision support and auctioneer’s management.","PeriodicalId":384060,"journal":{"name":"2009 IEEE Conference on Commerce and Enterprise Computing","volume":"219 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":"121311152","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}
Usually, for a particular business process a multitude of variants exist. Each of them constitutes an adjustment of a reference process model to specific requirements building the process context. While some progress has been achieved regarding the configuration of process variants, there exists only little work on how to accomplish this in a sound and efficient manner, especially when considering the large number of process variants that exist in practice as well as the many syntactical and semantical constraints they have to obey. In this paper we discuss advanced concepts for the context- and constraint-based configuration of process variants, and show how they can be utilized to ensure soundness of the configured process variants. Enhancing process-aware information systems with the capability to easily configure sound process models, belonging to the same process family and fitting to the given application context, will enable a new quality in engineering process-aware information systems.
{"title":"Guaranteeing Soundness of Configurable Process Variants in Provop","authors":"Alena Hallerbach, T. Bauer, M. Reichert","doi":"10.1109/CEC.2009.62","DOIUrl":"https://doi.org/10.1109/CEC.2009.62","url":null,"abstract":"Usually, for a particular business process a multitude of variants exist. Each of them constitutes an adjustment of a reference process model to specific requirements building the process context. While some progress has been achieved regarding the configuration of process variants, there exists only little work on how to accomplish this in a sound and efficient manner, especially when considering the large number of process variants that exist in practice as well as the many syntactical and semantical constraints they have to obey. In this paper we discuss advanced concepts for the context- and constraint-based configuration of process variants, and show how they can be utilized to ensure soundness of the configured process variants. Enhancing process-aware information systems with the capability to easily configure sound process models, belonging to the same process family and fitting to the given application context, will enable a new quality in engineering process-aware information systems.","PeriodicalId":384060,"journal":{"name":"2009 IEEE Conference on Commerce and Enterprise Computing","volume":"42 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":"125660525","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}
Cloud resource providers in a market face dynamic and unpredictable consumer behavior. The way, how prices are set in a dynamic environment, can influence the demand behavior of price sensitive customers. A Cloud resource provider has to decide on how to allocate his scarce resources in order to maximize his profit. The application of bid price control for evaluating incoming service requests is a common approach for capacity control in network revenue management. In this paper we introduce a customized version of the concept of selfadjusting bid prices and apply it to the area of Cloud Computing. Furthermore, we perform a simulation in order to test the efficiency of the proposed model.
{"title":"A Heuristic Approach for Capacity Control in Clouds","authors":"Arun Anandasivam, Stefan Buschek, R. Buyya","doi":"10.1109/CEC.2009.20","DOIUrl":"https://doi.org/10.1109/CEC.2009.20","url":null,"abstract":"Cloud resource providers in a market face dynamic and unpredictable consumer behavior. The way, how prices are set in a dynamic environment, can influence the demand behavior of price sensitive customers. A Cloud resource provider has to decide on how to allocate his scarce resources in order to maximize his profit. The application of bid price control for evaluating incoming service requests is a common approach for capacity control in network revenue management. In this paper we introduce a customized version of the concept of selfadjusting bid prices and apply it to the area of Cloud Computing. Furthermore, we perform a simulation in order to test the efficiency of the proposed model.","PeriodicalId":384060,"journal":{"name":"2009 IEEE Conference on Commerce and Enterprise Computing","volume":"23 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":"125638592","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}
Enterprise Architecture (EA) is getting more common also in public sector as a means to ensure ‘business’ and IT alignment. This study reports a follow-up and theme interviews of the key actors/informants in two EA projects in public administration offices during and half year after the projects were completed. The early experience shows that the process of establishing a government EA is a tedious and complicated process and this study considers the root causes. Three set of factors are found hindering EA’s potential to operate as a strategic alignment tool: lack of establishing proper EA governance, insufficient support for the development, and inadequate resources to do the former two.
{"title":"Key Issues in EA-Implementation: Case Study of Two Finnish Government Agencies","authors":"Ville Seppänen, J. Heikkilä, Katja Liimatainen","doi":"10.1109/CEC.2009.70","DOIUrl":"https://doi.org/10.1109/CEC.2009.70","url":null,"abstract":"Enterprise Architecture (EA) is getting more common also in public sector as a means to ensure ‘business’ and IT alignment. This study reports a follow-up and theme interviews of the key actors/informants in two EA projects in public administration offices during and half year after the projects were completed. The early experience shows that the process of establishing a government EA is a tedious and complicated process and this study considers the root causes. Three set of factors are found hindering EA’s potential to operate as a strategic alignment tool: lack of establishing proper EA governance, insufficient support for the development, and inadequate resources to do the former two.","PeriodicalId":384060,"journal":{"name":"2009 IEEE Conference on Commerce and Enterprise Computing","volume":"141 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":"133700575","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}
Recently, the topic of social network formation has received significant attention since the structure of thenetworks has a profound impact on the economic outcomes inmany real world applications such as large exchange markets, sponsored search auctions, and viral marketing. Stability and efficiency are two important properties which are sought in such networks. These two properties are both desirable but not always compatible. This paper investigates the tradeoff between stability and efficiency in a noncooperative game model of social network formation. In our model, we consider network formation in which each node can form at most k links due toscarcity of the resources. We formulate the network formation process as a strategic form game.We view the notion of stability as obtaining a Nash equilibrium outcome and efficiency as maximizing the value of the network. In this setting, we show that all efficient networks are stable in both the cases: (i) k = 1 and (ii) k = 2.
最近，社会网络形成的话题受到了极大的关注，因为网络的结构对许多现实世界的应用(如大型交易市场、赞助搜索拍卖和病毒式营销)的经济结果产生了深远的影响。稳定性和效率是这类网络所追求的两个重要特性。这两种特性都是可取的，但并不总是兼容的。本文研究了社会网络形成的非合作博弈模型中稳定性与效率的权衡问题。在我们的模型中，由于资源的稀缺性，我们考虑每个节点最多只能形成k个链路的网络结构。我们将网络的形成过程表述为一种战略形式博弈。我们认为稳定性的概念是获得纳什均衡结果，效率的概念是最大化网络的价值。在这种情况下，我们证明了所有有效网络在(i) k = 1和(ii) k = 2两种情况下都是稳定的。
{"title":"Stability and Efficiency of Social Networks with Strategic, Resource Constrained Nodes","authors":"Ramasuri Narayanam, Y. Narahari","doi":"10.1109/CEC.2009.59","DOIUrl":"https://doi.org/10.1109/CEC.2009.59","url":null,"abstract":"Recently, the topic of social network formation has received significant attention since the structure of thenetworks has a profound impact on the economic outcomes inmany real world applications such as large exchange markets, sponsored search auctions, and viral marketing. Stability and efficiency are two important properties which are sought in such networks. These two properties are both desirable but not always compatible. This paper investigates the tradeoff between stability and efficiency in a noncooperative game model of social network formation. In our model, we consider network formation in which each node can form at most k links due toscarcity of the resources. We formulate the network formation process as a strategic form game.We view the notion of stability as obtaining a Nash equilibrium outcome and efficiency as maximizing the value of the network. In this setting, we show that all efficient networks are stable in both the cases: (i) k = 1 and (ii) k = 2.","PeriodicalId":384060,"journal":{"name":"2009 IEEE Conference on Commerce and Enterprise Computing","volume":"96 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":"133134196","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
扫码关注我们
求助内容：
应助结果提醒方式：