Abstract— Despite impressive technical advances in tools and methodologies and the organizational insights provided by many years of academic and business researches, the underperformance of Information Technology (IT) remains.In the past and even today, organizations experience difficulty in managing technology, changing from system to system, implementing new technology, maintaining compatibility with existing technologies, and changing from one business process to another. These problems impact significantly on business performance and will continue to do so if not addressed. As a result, many organizations have deployed EA in an attempt to address these challenges. However, the design and development of EA has proven to be easier than its institutionalization. The study explored the development and implementation of EA to determine the factors, which are barriers to its institutionalization. Two case studies were conducted.
{"title":"The Factors Affecting Institutionalisation of Enterprise Architecture in the Organisation","authors":"T. Iyamu","doi":"10.1109/CEC.2009.57","DOIUrl":"https://doi.org/10.1109/CEC.2009.57","url":null,"abstract":"Abstract— Despite impressive technical advances in tools and methodologies and the organizational insights provided by many years of academic and business researches, the underperformance of Information Technology (IT) remains.In the past and even today, organizations experience difficulty in managing technology, changing from system to system, implementing new technology, maintaining compatibility with existing technologies, and changing from one business process to another. These problems impact significantly on business performance and will continue to do so if not addressed. As a result, many organizations have deployed EA in an attempt to address these challenges. However, the design and development of EA has proven to be easier than its institutionalization. The study explored the development and implementation of EA to determine the factors, which are barriers to its institutionalization. Two case studies were conducted.","PeriodicalId":384060,"journal":{"name":"2009 IEEE Conference on Commerce and Enterprise Computing","volume":"25 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":"116781340","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 current art in optimal combinatorial auctions islimited to handling the case of single units of multiple items, with each bidder bidding on exactly one bundle (single minded bidders). This paper extends the current art by proposing an optimal auction for procuring multiple units of multiple items when the bidders are single minded. We develop a procurement auction that minimizes the cost ofprocurement while satisfying Bayesian incentive compatibility and interim individual rationality. Under appropriate regularity conditions, this optimal auction also satisfies dominant strategy incentive compatibility. The results presented here hold true for equivalent forward auction settings as well.
{"title":"Optimal Multi-unit Combinatorial Auctions with Single Minded Bidders","authors":"Sujit Gujar, Y. Narahari","doi":"10.1109/CEC.2009.86","DOIUrl":"https://doi.org/10.1109/CEC.2009.86","url":null,"abstract":"The current art in optimal combinatorial auctions islimited to handling the case of single units of multiple items, with each bidder bidding on exactly one bundle (single minded bidders). This paper extends the current art by proposing an optimal auction for procuring multiple units of multiple items when the bidders are single minded. We develop a procurement auction that minimizes the cost ofprocurement while satisfying Bayesian incentive compatibility and interim individual rationality. Under appropriate regularity conditions, this optimal auction also satisfies dominant strategy incentive compatibility. The results presented here hold true for equivalent forward auction settings as well.","PeriodicalId":384060,"journal":{"name":"2009 IEEE Conference on Commerce and Enterprise Computing","volume":"123 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":"127503580","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}
Modern IT systems serve many different business processes on a shared infrastructure in parallel. The automatic request execution on the numerous interconnected components, hosted on heterogeneous hardware resources, is coordinated in distributed transaction processing (DTP) systems. While pre-defined quality-of-service metrics must be met, IT providers have to deal with a highly dynamic environment concerning workload structure and overall demand when provisioning their systems. Adaptive prioritization is a way to react to short-term demand variances. Performance models can be applied to predict the impacts of prioritization strategies on the overall performance of the system. In this paper we describe the workload characteristics and particularities of two real-world DTP systems and evaluate the effects of prioritization concerning supported overall load and resulting end-to-end performance measures.
{"title":"Evaluation of Prioritization in Performance Models of DTP Systems","authors":"Christian Markl, Oliver Hühn","doi":"10.1109/CEC.2009.11","DOIUrl":"https://doi.org/10.1109/CEC.2009.11","url":null,"abstract":"Modern IT systems serve many different business processes on a shared infrastructure in parallel. The automatic request execution on the numerous interconnected components, hosted on heterogeneous hardware resources, is coordinated in distributed transaction processing (DTP) systems. While pre-defined quality-of-service metrics must be met, IT providers have to deal with a highly dynamic environment concerning workload structure and overall demand when provisioning their systems. Adaptive prioritization is a way to react to short-term demand variances. Performance models can be applied to predict the impacts of prioritization strategies on the overall performance of the system. In this paper we describe the workload characteristics and particularities of two real-world DTP systems and evaluate the effects of prioritization concerning supported overall load and resulting end-to-end performance measures.","PeriodicalId":384060,"journal":{"name":"2009 IEEE Conference on Commerce and Enterprise Computing","volume":"21 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":"126634725","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}
S. Schneider, M. Bichler, Kemal Güler, Mehmet Sayal
Economies of scale and scope describe key characteristics of production cost functions that influence allocations and prices on procurement markets. Combinatorial auctions have been analyzed intensively, and enable the bidders to express economies of scope, but they typically are designed for single units of each item only and cannot easily be extended to the multi-unit case. Auction designs for markets with economies of scale are much less well understood, they require new bidding languages, and the supplier selection typically becomes a hard computational problem. We suggest a bidding language allowing to describe economies of scope and scale. It enables bidders to specify supply curves, representing economies of scale, and variousrebates accounting for economies of scope. In addition, we support a number of side constraints enabling the auctioneer to consider various business rules in the winner determination. We conduct computational experiments based on a branch-and-cut solver to explore the incremental computational burden to determine optimal solutions brought about by the need to express economies of scope for problems of practical size.
{"title":"Bidding Languages and Supplier Selection for Procurement Markets with Economies of Scale and Scope","authors":"S. Schneider, M. Bichler, Kemal Güler, Mehmet Sayal","doi":"10.1109/CEC.2009.42","DOIUrl":"https://doi.org/10.1109/CEC.2009.42","url":null,"abstract":"Economies of scale and scope describe key characteristics of production cost functions that influence allocations and prices on procurement markets. Combinatorial auctions have been analyzed intensively, and enable the bidders to express economies of scope, but they typically are designed for single units of each item only and cannot easily be extended to the multi-unit case. Auction designs for markets with economies of scale are much less well understood, they require new bidding languages, and the supplier selection typically becomes a hard computational problem. We suggest a bidding language allowing to describe economies of scope and scale. It enables bidders to specify supply curves, representing economies of scale, and variousrebates accounting for economies of scope. In addition, we support a number of side constraints enabling the auctioneer to consider various business rules in the winner determination. We conduct computational experiments based on a branch-and-cut solver to explore the incremental computational burden to determine optimal solutions brought about by the need to express economies of scope for problems of practical size.","PeriodicalId":384060,"journal":{"name":"2009 IEEE Conference on Commerce and Enterprise Computing","volume":"185 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":"122804040","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}
Process mining facilitates the analysis of business processes by extracting a process model from event logs. Most mining algorithms perform well on single-system event logs that explicitly refer to a process instance or case. However, in many operational environments such case identifiers are not directly recorded. In supply chain processes there are even further challenges, since different identification numbers and numerous aggregation steps prevent individual work items to become traceable as a case. In this paper, we investigate how the EPCglobal standard for processing Radio Frequency Identification (RFID) events can make supply chain data accessible for process mining. Our contribution is an algorithm that is able to deal with challenges of case identification and focus shifts. We present a prototypicalimplementation and use a process based on the Supply Chain Operations Reference (SCOR) Model to evaluate our implementation.
{"title":"Process Mining of RFID-Based Supply Chains","authors":"Kerstin Gerke, Alexander Claus, J. Mendling","doi":"10.1109/CEC.2009.72","DOIUrl":"https://doi.org/10.1109/CEC.2009.72","url":null,"abstract":"Process mining facilitates the analysis of business processes by extracting a process model from event logs. Most mining algorithms perform well on single-system event logs that explicitly refer to a process instance or case. However, in many operational environments such case identifiers are not directly recorded. In supply chain processes there are even further challenges, since different identification numbers and numerous aggregation steps prevent individual work items to become traceable as a case. In this paper, we investigate how the EPCglobal standard for processing Radio Frequency Identification (RFID) events can make supply chain data accessible for process mining. Our contribution is an algorithm that is able to deal with challenges of case identification and focus shifts. We present a prototypicalimplementation and use a process based on the Supply Chain Operations Reference (SCOR) Model to evaluate our implementation.","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":"114241824","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}
According to recent surveys, information workerssend and receive an average of 133 messages per day, andusers talk about “living” in email, spending an average of21 percent of their time on it, as well as reporting generalproblems with overload. Information created by a business can represent either an asset or a liability, depending largely on how well it is managed. Email is no different in this respect: it can be a highly efficient and useful tool for communication, but only if the information it contains can be managed effectively. One of the main drawbacks of email usage today is its insufficient integration into the collective workspace environment. We believe that by integrating it with other external information (both onthe desktop and on distributed servers), one can migrate some of this information to more appropriate storage environments, thereby partly addressing the problem of overload and offering users an integrated access to data and functionality. Currently, there is much research in the area of both personalised and business information management, but very little research that focuses on email as the primary information source, despite its ubiquity. In this paper we survey the current state of the art in email processing and communication research, focusing onthe current and potential roles played by email in information management, and commercial and research efforts to integrate a semantic-based approach to email.
{"title":"Motivating Intelligent E-mail in Business: An Investigation into Current Trends for E-mail Processing and Communication Research","authors":"M. Laclavik, D. Maynard","doi":"10.1109/CEC.2009.47","DOIUrl":"https://doi.org/10.1109/CEC.2009.47","url":null,"abstract":"According to recent surveys, information workerssend and receive an average of 133 messages per day, andusers talk about “living” in email, spending an average of21 percent of their time on it, as well as reporting generalproblems with overload. Information created by a business can represent either an asset or a liability, depending largely on how well it is managed. Email is no different in this respect: it can be a highly efficient and useful tool for communication, but only if the information it contains can be managed effectively. One of the main drawbacks of email usage today is its insufficient integration into the collective workspace environment. We believe that by integrating it with other external information (both onthe desktop and on distributed servers), one can migrate some of this information to more appropriate storage environments, thereby partly addressing the problem of overload and offering users an integrated access to data and functionality. Currently, there is much research in the area of both personalised and business information management, but very little research that focuses on email as the primary information source, despite its ubiquity. In this paper we survey the current state of the art in email processing and communication research, focusing onthe current and potential roles played by email in information management, and commercial and research efforts to integrate a semantic-based approach to email.","PeriodicalId":384060,"journal":{"name":"2009 IEEE Conference on Commerce and Enterprise Computing","volume":"70 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":"123478891","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}
Liying Cui, S. Kumara, John Jung-Woon Yoo, F. Çavdur
In this paper, we propose a web service composition technique considering Semantic properties and Quality of Service attributes using CK- matrix and large scale network topology analysis. This method stores the network structure in CK-matrix and decomposes the query into sub-regions according to the structure of the large-scale network. The method can find optimal, alternative or inferior solutions according to the varying requirements of the customers.
{"title":"Large-Scale Network Decomposition and Mathematical Programming Based Web Service Composition","authors":"Liying Cui, S. Kumara, John Jung-Woon Yoo, F. Çavdur","doi":"10.1109/CEC.2009.91","DOIUrl":"https://doi.org/10.1109/CEC.2009.91","url":null,"abstract":"In this paper, we propose a web service composition technique considering Semantic properties and Quality of Service attributes using CK- matrix and large scale network topology analysis. This method stores the network structure in CK-matrix and decomposes the query into sub-regions according to the structure of the large-scale network. The method can find optimal, alternative or inferior solutions according to the varying requirements of the customers.","PeriodicalId":384060,"journal":{"name":"2009 IEEE Conference on Commerce and Enterprise Computing","volume":"53 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":"127620324","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 a contract, exceptional clauses specify sanctions that come in force when the primary obligations are not fulfilled. An important aspect of exception handling is their resolution: determining which particular exception clause should be enforced when a violation is detected. This paper presents a specification and resolution technique for electronic contracts that can be used by a third party exception resolution service.
{"title":"Exception Handling in Electronic Contracting","authors":"Carlos Molina-Jiménez, S. Shrivastava, M. Strano","doi":"10.1109/CEC.2009.77","DOIUrl":"https://doi.org/10.1109/CEC.2009.77","url":null,"abstract":"In a contract, exceptional clauses specify sanctions that come in force when the primary obligations are not fulfilled. An important aspect of exception handling is their resolution: determining which particular exception clause should be enforced when a violation is detected. This paper presents a specification and resolution technique for electronic contracts that can be used by a third party exception resolution service.","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":"132278142","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}
G. Redding, M. Dumas, A. T. Hofstede, A. Iordachescu
Mainstream business process modelling techniques promote a design paradigm wherein the activities that may be performed within a case, together with their usual execution order, form the backbone on top of which other aspects are anchored. This Fordist paradigm, while effective in standardised and production-oriented domains, breaks when confronted with processes in which case-by-case variations and exceptions are the norm. We contend that the effective design of flexible processes calls for a substantially different modelling paradigm: one where processes are organized as interacting business objects rather than as chains of activities. This paper presents a meta-model for business process modelling based on business objects. The paper also presents a real-life case study in which a number of human service delivery processes were designed using the presented meta-model. The case study demonstrates that the meta-model addresses three key flexibility requirements encountered in this domain.
{"title":"Modelling Flexible Processes with Business Objects","authors":"G. Redding, M. Dumas, A. T. Hofstede, A. Iordachescu","doi":"10.1109/CEC.2009.39","DOIUrl":"https://doi.org/10.1109/CEC.2009.39","url":null,"abstract":"Mainstream business process modelling techniques promote a design paradigm wherein the activities that may be performed within a case, together with their usual execution order, form the backbone on top of which other aspects are anchored. This Fordist paradigm, while effective in standardised and production-oriented domains, breaks when confronted with processes in which case-by-case variations and exceptions are the norm. We contend that the effective design of flexible processes calls for a substantially different modelling paradigm: one where processes are organized as interacting business objects rather than as chains of activities. This paper presents a meta-model for business process modelling based on business objects. The paper also presents a real-life case study in which a number of human service delivery processes were designed using the presented meta-model. The case study demonstrates that the meta-model addresses three key flexibility requirements encountered in this domain.","PeriodicalId":384060,"journal":{"name":"2009 IEEE Conference on Commerce and Enterprise Computing","volume":"10 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":"127660302","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}
Supply chain formation problem is one of the important research topics in e-Commence. In an e-Marketplace where buyers and sellers meet and trade online, dynamic supply chains can be formed among them by mediating agents. SET and CSET are two typical make-to-order supply chain models. CSET represents a scenario that has a central authority in charge of the formation, management and dissolution of a sup-ply chain. The principal authority selects the partners under certain principles which may either aim for maximizing profits of the whole supply chain or for ensuring every partner to re-ceive a job for communal prosperity. In SET, every supply chain partner uses local knowledge to compete for jobs at each supply chain level. We have implemented a Java-based simu-lator for simulating the process of dynamic supply chain for-mation. The simulator can operate in both modes whose results may be useful in decision-support in supply chain planning.
{"title":"Decision-Support for Optimizing Supply Chain Formation Based on CSET Model","authors":"Yang Hang, S. Fong, Zhuang Yan","doi":"10.1109/CEC.2009.51","DOIUrl":"https://doi.org/10.1109/CEC.2009.51","url":null,"abstract":"Supply chain formation problem is one of the important research topics in e-Commence. In an e-Marketplace where buyers and sellers meet and trade online, dynamic supply chains can be formed among them by mediating agents. SET and CSET are two typical make-to-order supply chain models. CSET represents a scenario that has a central authority in charge of the formation, management and dissolution of a sup-ply chain. The principal authority selects the partners under certain principles which may either aim for maximizing profits of the whole supply chain or for ensuring every partner to re-ceive a job for communal prosperity. In SET, every supply chain partner uses local knowledge to compete for jobs at each supply chain level. We have implemented a Java-based simu-lator for simulating the process of dynamic supply chain for-mation. The simulator can operate in both modes whose results may be useful in decision-support in supply chain planning.","PeriodicalId":384060,"journal":{"name":"2009 IEEE Conference on Commerce and Enterprise Computing","volume":"16 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":"114895729","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
扫码关注我们
求助内容：
应助结果提醒方式：