Business Process Redesign in Information Technology Incident Management: A teaching case

This paper consists of a detailed case narrative on how a leading Australian Finance organisation has utilised contemporary Business Process Management (BPM) concepts for improving the IT incident management processes within the whole organisation. The target audience includes practitioners who are interested in BPM case studies and Academics who may be seeking case studies for innovative teaching practices.

YAWL : power through patterns

Workflow Management Systems (WfMSs) enable the development and maintenance of workflow specifications at design time and their execution and monitoring at runtime. The open source WfMS YAWL supports the YAWL language – a formally defined language based on Petri nets which offers comprehensive support for control-flow and resource patterns. In addition, the YAWL system provides extensive support for process flexibility, in particular for process configuration, exception handling, dynamic workflow and declarative workflow. Due to its formal foundation, sophisticated verification support can also be achieved. This paper presents the YAWL system and its main applications.

Merging business process models

This paper addresses the following problem: given two or more business process models, create a process model that is the union of the process models given as input. In other words, the behavior of the produced process model should encompass that of the input models. The paper describes an algorithm that produces a single configurable process model from an arbitrary collection of process models. The algorithm works by extracting the common parts of the input process models, creating a single copy of them, and appending the differences as branches of configurable connectors. This way, the merged process model is kept as small as possible, while still capturing all the behavior of the input models. Moreover, analysts are able to trace back from which original model(s) does a given element in the merged model come from. The algorithm has been prototyped and tested against process models taken from several application domains.

Rigour versus Relevance Revisited : Evidence from IS Conference Reviewing Practice

A commonly held belief in the IS discipline is that rigour and relevance are contrary to each other and that addressing both is virtually impossible. It is also believed widely that the editorial practices of our premier conferences and journals over-emphasise rigour on the cost of relevance. However, while these two topics have been filled with numerous subjective discussions, more solid evidence into the true relationship between rigour and relevance and the impact of conference editors on this relationship is still outstanding. This paper contributes to this debate by deriving empirical evidence from a comprehensive and detailed analysis of the characteristics of the submissions and the reviewing practices of three recent IS conferences. It provides first insights into the actual relationship between rigour and relevance and into the role conference chairs play in balancing rigour and relevance. Besides the outcomes that the current set of evaluation criteria does not provide a straight forward proxy for relevance to practitioners, the paper offers two main contributions. First, empirical insights are provided that rigour and relevance do in fact not have to be mutually exclusive. Second, the editorial practices at conferences are skewed towards rigorous papers rather than relevant papers.

Enhancing an Incremental Clustering Algorithm for Web Page Collections

With the size and state of the Internet today, a good quality approach to organizing this mass of information is of great importance. Clustering web pages into groups of similar documents is one approach, but relies heavily on good feature extraction and document representation as well as a good clustering approach and algorithm. Due to the changing nature of the Internet, resulting in a dynamic dataset, an incremental approach is preferred. In this work we propose an enhanced incremental clustering approach to develop a better clustering algorithm that can help to better organize the information available on the Internet in an incremental fashion. Experiments show that the enhanced algorithm outperforms the original histogram based algorithm by up to 7.5%.

Interestingness Measures for Multi-Level Association Rules

Association rule mining is one technique that is widely used when querying databases, especially those that are transactional, in order to obtain useful associations or correlations among sets of items. Much work has been done focusing on efficiency, effectiveness and redundancy. There has also been a focusing on the quality of rules from single level datasets with many interestingness measures proposed. However, with multi-level datasets now being common there is a lack of interestingness measures developed for multi-level and cross-level rules. Single level measures do not take into account the hierarchy found in a multi-level dataset. This leaves the Support-Confidence approach,which does not consider the hierarchy anyway and has other drawbacks, as one of the few measures available. In this paper we propose two approaches which measure multi-level association rules to help evaluate their interestingness. These measures of diversity and peculiarity can be used to help identify those rules from multi-level datasets that are potentially useful.

Personal Access Tutor - helping students to learn MS Access

The paper describes Personal Access Tutor (PAT),an Intelligent Tutoring System which helps students to learn how to create forms and reports in MS Access. We present the architecture and components of PAT and also the services that PAT provides to the students. Results for an external (system) evaluation of PAT (both qualitative and quantitative data) are presented and discussed.

An examination of IS conference reviewing practices

There has been considerable interest over the years within the IS research community into how to shape articles for successful publication. Little effort has been made, however, to examine the reviewing criteria that make a difference to publication. We argue that, to provide better guidance to authors, more solid evidence is needed into the factors that contribute to acceptance decisions. This paper examines empirically the outcomes of the reviewing processes of three well-known IS conferences held in 2007. Our analyses reveal four major findings. First, the evaluation criteria that influence the acceptance/rejection decision vary by conference. Second, those differences can be explained in terms of the maturity and breadth of the specific conference of interest. Third, while objective review criteria influence acceptance/rejection decisions, subjective assessment on the part of the program committees may also play a substantial role. Fourth, while high scores on objective criteria are essential for acceptance, they do not guarantee acceptance. On the other hand, low scores on any criterion are likely to result in rejection.

Virtual Environment Visualisation of Executable Business Process Models

Business Process Modelling is a fast growing field in business and information technology, which uses visual grammars to model and execute the processes within an organisation. However, many analysts present such models in a 2D static and iconic manner that is difficult to understand by many stakeholders. Difficulties in understanding such grammars can impede the improvement of processes within an enterprise due to communication problems. In this chapter we present a novel framework for intuitively visualising animated business process models in interactive Virtual Environments. We also show that virtual environment visualisations can be performed with present 2D business process modelling technology, thus providing a low barrier to entry for business process practitioners. Two case studies are presented from film production and healthcare domains that illustrate the ease with which these visualisations can be created. This approach can be generalised to other executable workflow systems, for any application domain being modelled.

Business Process Model Merging : An Approach to Business Process Consolidation

This paper addresses the problem of constructing consolidated business process models out of collections of process models that share common fragments. The paper considers the construction of unions of multiple models (called merged models) as well as intersections (called digests). Merged models are intended for analysts who wish to create a model that subsumes a collection of process models - typically representing variants of the same underlying process - with the aim of replacing the variants with the merged model. Digests, on the other hand, are intended for analysts who wish to identify the most recurring fragments across a collection of process models, so that they can focus their efforts on optimizing these fragments. The paper presents an algorithm for computing merged models and an algorithm for extracting digests from a merged model. The merging and digest extraction algorithms have been implemented and tested against collections of process models taken from multiple application domains. The tests show that the merging algorithm produces compact models and scales up to process models containing hundreds of nodes. Furthermore, a case study conducted in a large insurance company has demonstrated the usefulness of the merging and digest extraction operators in a practical setting.