Perturbing event logs to identify cost reduction opportunities: a genetic algorithm-based approach

Organisations are constantly seeking new ways to improve operational efficiencies. This research study investigates a novel way to identify potential efficiency gains in business operations by observing how they are carried out in the past and then exploring better ways of executing them by taking into account trade-offs between time, cost and resource utilisation. This paper demonstrates how they can be incorporated in the assessment of alternative process execution scenarios by making use of a cost environment. A genetic algorithm-based approach is proposed to explore and assess alternative process execution scenarios, where the objective function is represented by a comprehensive cost structure that captures different process dimensions. Experiments conducted with different variants of the genetic algorithm evaluate the approach's feasibility. The findings demonstrate that a genetic algorithm-based approach is able to make use of cost reduction as a way to identify improved execution scenarios in terms of reduced case durations and increased resource utilisation. The ultimate aim is to utilise cost-related insights gained from such improved scenarios to put forward recommendations for reducing process-related cost within organisations.

A random key genetic algorithm for live migration of multiple virtual machines in data centers

Live migration of multiple Virtual Machines (VMs) has become an integral management activity in data centers for power saving, load balancing and system maintenance. While state-of-the-art live migration techniques focus on the improvement of migration performance of an independent single VM, only a little has been investigated to the case of live migration of multiple interacting VMs. Live migration is mostly influenced by the network bandwidth and arbitrarily migrating a VM which has data inter-dependencies with other VMs may increase the bandwidth consumption and adversely affect the performances of subsequent migrations. In this paper, we propose a Random Key Genetic Algorithm (RKGA) that efficiently schedules the migration of a given set of VMs accounting both inter-VM dependency and data center communication network. The experimental results show that the RKGA can schedule the migration of multiple VMs with significantly shorter total migration time and total downtime compared to a heuristic algorithm.

Mission path planning of aerial survey tasks using hybrid game evolutionary algorithm

The work presented in this report is aimed to implement a cost-effective offline mission path planner for aerial inspection tasks of large linear infrastructures. Like most real-world optimisation problems, mission path planning involves a number of objectives which ideally should be minimised simultaneously. Understandably, the objectives of a practical optimisation problem are conflicting each other and the minimisation of one of them necessarily implies the impossibility to minimise the other ones. This leads to the need to find a set of optimal solutions for the problem; once such a set of available options is produced, the mission planning problem is reduced to a decision making problem for the mission specialists, who will choose the solution which best fit the requirements of the mission. The goal of this work is then to develop a Multi-Objective optimisation tool able to provide the mission specialists a set of optimal solutions for the inspection task amongst which the final trajectory will be chosen, given the environment data, the mission requirements and the definition of the objectives to minimise. All the possible optimal solutions of a Multi-Objective optimisation problem are said to form the Pareto-optimal front of the problem. For any of the Pareto-optimal solutions, it is impossible to improve one objective without worsening at least another one. Amongst a set of Pareto-optimal solutions, no solution is absolutely better than another and the final choice must be a trade-off of the objectives of the problem. Multi-Objective Evolutionary Algorithms (MOEAs) are recognised to be a convenient method for exploring the Pareto-optimal front of Multi-Objective optimization problems. Their efficiency is due to their parallelism architecture which allows to find several optimal solutions at each time

Facilitators of expanded and extended scope of paramedic practice - what makes them work?

Introduction Better integration of health services and redefinition of health workforce roles through expanding and extending traditional scope of clinical practice have been explored nationally and internationally. This paper aims to extend our earlier work by examining models of expanded and extended scope of paramedic practice for attributes which facilitate such a practice. Methods An exploratory multi-case study analysis of Australia, New Zealand, Canada and the United Kingdom expanded and extended paramedic practices were analysed. Results Successful models of advanced practice harness the capacity and personality of the paramedic practitioner, and are supported by enabling infrastructures, specifically: professional development/ education; clinical guideline and policy (boundary); access to physical infrastructure and clinical support from senior medical practitioners; and, ability to directly refer to other health services (service integration). The scope of advanced practice is however influenced by individual employers’ capacity, perceived needs and preference/ prioritises. The potential for advanced paramedic practice is equally applicable to urban as well as rural Australia. The Council of Ambulance Authorities’ Professional Competency Standard provides the form and functions for building on advanced paramedic practice. Recognition of such advanced paramedic practice provides a structure for professional growth, process for career progression and will support workforce retention. Conclusion The achievement of advanced knowledge and skills has positioned the paramedic profession to be recognized as a valuable clinician. The Council of Ambulance Authorities’ Professional Competency Standards provides the form and function for supporting advanced paramedic practice.

Approximate Bayesian Computation for astronomical model analysis : a case study in galaxy demographics and morphological transformation at high redshift

Approximate Bayesian Computation’ (ABC) represents a powerful methodology for the analysis of complex stochastic systems for which the likelihood of the observed data under an arbitrary set of input parameters may be entirely intractable – the latter condition rendering useless the standard machinery of tractable likelihood-based, Bayesian statistical inference [e.g. conventional Markov chain Monte Carlo (MCMC) simulation]. In this paper, we demonstrate the potential of ABC for astronomical model analysis by application to a case study in the morphological transformation of high-redshift galaxies. To this end, we develop, first, a stochastic model for the competing processes of merging and secular evolution in the early Universe, and secondly, through an ABC-based comparison against the observed demographics of massive (Mgal > 1011 M⊙) galaxies (at 1.5 < z < 3) in the Cosmic Assembly Near-IR Deep Extragalatic Legacy Survey (CANDELS)/Extended Groth Strip (EGS) data set we derive posterior probability densities for the key parameters of this model. The ‘Sequential Monte Carlo’ implementation of ABC exhibited herein, featuring both a self-generating target sequence and self-refining MCMC kernel, is amongst the most efficient of contemporary approaches to this important statistical algorithm. We highlight as well through our chosen case study the value of careful summary statistic selection, and demonstrate two modern strategies for assessment and optimization in this regard. Ultimately, our ABC analysis of the high-redshift morphological mix returns tight constraints on the evolving merger rate in the early Universe and favours major merging (with disc survival or rapid reformation) over secular evolution as the mechanism most responsible for building up the first generation of bulges in early-type discs.

A pseudo-marginal sequential Monte Carlo algorithm for random effects models in Bayesian sequential design

A computationally efficient sequential Monte Carlo algorithm is proposed for the sequential design of experiments for the collection of block data described by mixed effects models. The difficulty in applying a sequential Monte Carlo algorithm in such settings is the need to evaluate the observed data likelihood, which is typically intractable for all but linear Gaussian models. To overcome this difficulty, we propose to unbiasedly estimate the likelihood, and perform inference and make decisions based on an exact-approximate algorithm. Two estimates are proposed: using Quasi Monte Carlo methods and using the Laplace approximation with importance sampling. Both of these approaches can be computationally expensive, so we propose exploiting parallel computational architectures to ensure designs can be derived in a timely manner. We also extend our approach to allow for model uncertainty. This research is motivated by important pharmacological studies related to the treatment of critically ill patients.

Dalby Shopping Precinct Survey Report : Consumer Attitudes towards Proposed Extended Trading Hours at Dalby

Data was collected to measure shopper’s attitudes toward the proposed Sunday and limited public holiday trading in Dalby. Survey questionnaires were conducted between 29th August to 31st August at Coles Dalby and Dalby Shoppingtown Plaza. In total, 150 respondents participated in the survey. Overall, the findings suggest that most respondents, especially males, couples with children, fulltime workers and those under the age of 49 years, embrace the proposed Sunday and limited holiday trading in Dalby. While there are concerns over increasing competition for smaller retailers who already trade on Sundays, a majority of respondents indicated it would suit their lifestyle, be convenient, provide more jobs, increase trade for smaller retailers within the area, reduce queues and congestion observed on Saturdays. The majority of those shoppers that indicated they currently did some shopping on a Sunday reported they would continue to support smaller retailers who currently trade on Sundays and some public holidays, if changes came about. Those opposed to changes to trading hours indicated a belief that existing trading hours were sufficient. Most people indicated the proposed extension of trading hours would not harm the community or have a negative, detrimental effect on themselves or their family. The main findings presented in the report are as follows: - 96.8% of respondents surveyed reported to be local, permanent residents of Dalby. - Residents of Dalby visited shopping centres and stores on average 2.8 times per week. This frequency is proportionately higher than the average Australian shopping behaviour at 2.5 times per week (Roy Morgan Supermarket Monitor). - It was determined that weekday evenings (after 5 pm) were the busiest times for shopping, with Saturday the next most popular day to shop. - 68% of respondents support the proposal of the extended trading hours at supermarkets, department stores and the shopping centre in Dalby, 26% oppose and 6% are unsure. - 90% of the respondents agreed that residents of Dalby should be allowed the same choice as other regional towns and cities in supporting/opposing changes to trading hours. The remaining 10% expressed a disagreement. - A larger percentage of males supported the proposal for Sunday and limited holiday trading. Of all the males surveyed, 80% were in support, 15% were opposed and 5% unsure. 60% of female respondents support the proposal, while 33% oppose it and 5% were unsure. - The highest percentage of support exists in fulltime workers with 90% of those respondents supporting the proposal. - In contrast, the lowest percentage of support was found in the non-working (retired/unemployed) respondents, where 67% opposed the application. - It was noted that 71% of respondents employed casually also indicated opposition against proposed changes. Further questioning identified an underlying concern from casually employed persons that Sunday trade would force them onto Sunday work rosters. - 92% of shared households expressed support for Sunday and limited public holiday trading, while 83% of both couples with children and single parent with children at home also supported the application. - 72% of the respondents often find it necessary to do some grocery shopping in Dalby on a Sunday. 76% of shoppers who indicated they already undertook some shopping on Sunday, indicated would continue to shop and support smaller retailers. - Of the respondents surveyed, 44% have travelled outside of Dalby on a Sunday to shop. This indicates that such residents find it necessary to undertake some shopping on a Sunday and in order to do so, drive an hour to Toowoomba in order to access a range of retailers. - The most cited reasons for supporting Sunday and limited public holiday trade were; ‘More choice about when I shop and that is convenient’ (69%), ‘Sunday trade will create job opportunities’ (71%), ‘Sunday trade will be helpful when preparing school lunches and getting ready for the working week’ (62%), and ‘Sunday trade will reduce shopping congestion during peak shopping periods’ (62%) - The most cited reasons for opposing the proposed changes are that ‘Sunday trade may increase competition for small retailers who already trade on Sunday’ (41%), ‘Shops are already open 6 days a week which is enough’ (31%), and ‘Sunday is a day of rest or a religious day and shopping should not be allowed’ (23%). - 97% of respondents indicated they would not change their sporting or social commitment if changes to trading hours were implemented.

Mt Isa Shopping Precinct Survey Report : Consumer Attitudes towards Proposed Extended Trading Hours at Mt Isa

Data was collected to measure shopper’s attitudes toward the proposed Sunday and limited public holiday trading in Mt Isa. Survey questionnaires were conducted between 15th August to 17th August at Kmart Plaza, Woolworths, Miles St. and Mt Isa Plaza. In total, 300 respondents participated in the survey. Overall, the findings suggest that most respondents, especially males, couples with children and fulltime workers, embrace the proposed Sunday and limited holiday trading in Mt Isa. While there are concerns over increasing competition for smaller retailers who already trade on Sundays, a majority of respondents indicated it would suit their lifestyle, be convenient, provide more jobs, increase trade for smaller retailers within the area, reduce queues and congestion, and offer a less expensive grocery shopping. The majority of those shoppers that indicated they currently did some shopping on a Sunday reported they would continue to support smaller retailers who currently trade on Sundays and some public holidays, if changes came about. Those opposed to changes to trading hours also indicated a belief that existing trading hours were sufficient. Most people indicated the proposed extension of trading hours would not harm the community or have a negative, detrimental effect on themselves or their family. The main findings presented in the report are as follows: - 96% of respondents surveyed reported to be local, permanent residents of Mt Isa. - Residents of Mt Isa visited shopping centres and stores on average 2.4 times per week. This mirrors the average Australian shopping behaviour at 2.5 times per week (Roy Morgan Supermarket Monitor) - It was determined that Saturday was the busiest day for shopping with a majority of respondents indicating they visited stores on that day of the week. - 71% of respondents support the proposal of extended trading hours at shopping centres in Mt Isa, 25% oppose and 4% are unsure. - 87% of the respondents agreed that residents of Mt Isa should be allowed the same choice as other regional towns and cities in supporting/opposing changes to trading hours. The remaining 13% expressed a disagreement. - A larger percentage of males supported the proposal for Sunday and limited holiday trading. Of all the males surveyed, 81% were in support, 17% were opposed and 2% unsure. By contrast, 64% of female respondents support the proposal, while 31% oppose it and 5% are unsure. - The highest percentage of support exists in fulltime workers with 85% of those respondents supporting the proposal. In contrast, the lowest percentage of support was found in the non-working respondents, where 62% opposed the application. - 78% of couples living with children at home expressed support for Sunday and limited public holiday trading, while 60% of couples without children also supported the application. - Of the respondents surveyed, virtually none (less than 1%) have travelled outside of Mt Isa on a Sunday to shop. This indicates that due to the remote and isolated location of this town, residents do not have the option to travel reasonable distances in order to access a range of retailers. - 70% of the respondents often find it necessary to do some grocery shopping in Mt Isa on a Sunday. - Convenience is cited as the major reason for support (79%) followed by lifestyle (75%). - The most cited reasons for supporting ‘it would be convenient’ (81%), ‘It may create more jobs’ (77%), ‘It may reduce congestion during busy shopping periods’ (74%, and ‘It would make it easier for working families with kids’ (74%). - The most cited reasons for opposing the proposed changes are that ‘It will disadvantage smaller businesses’ (44%), ‘It is unnecessary’ (29%). - 72% of shoppers who indicated they already undertook some shopping on Sunday, indicated would continue to shop and support smaller retailers. - 98% of respondents indicated they would not change their sporting or social commitment if changes to trading hours were implemented.

Adaptive estimation of HMM transition probabilities

This paper presents new schemes for recursive estimation of the state transition probabilities for hidden Markov models (HMM's) via extended least squares (ELS) and recursive state prediction error (RSPE) methods. Local convergence analysis for the proposed RSPE algorithm is shown using the ordinary differential equation (ODE) approach developed for the more familiar recursive output prediction error (RPE) methods. The presented scheme converges and is relatively well conditioned compared with the ...

A Memetic Algorithm for the location-based continuously operating reference stations placement problem in Network Real-Time Kinematic

Network Real-Time Kinematic (NRTK) is a technology that can provide centimeter-level accuracy positioning services in real time, and it is enabled by a network of Continuously Operating Reference Stations (CORS). The location-oriented CORS placement problem is an important problem in the design of a NRTK as it will directly affect not only the installation and operational cost of the NRTK, but also the quality of positioning services provided by the NRTK. This paper presents a Memetic Algorithm (MA) for the location-oriented CORS placement problem, which hybridizes the powerful explorative search capacity of a genetic algorithm and the efficient and effective exploitative search capacity of a local optimization. Experimental results have shown that the MA has better performance than existing approaches. In this paper we also conduct an empirical study about the scalability of the MA, effectiveness of the hybridization technique and selection of crossover operator in the MA.

BOSTER : an efficient algorithm for mining frequent unordered induced subtrees

Extracting frequent subtrees from the tree structured data has important applications in Web mining. In this paper, we introduce a novel canonical form for rooted labelled unordered trees called the balanced-optimal-search canonical form (BOCF) that can handle the isomorphism problem efficiently. Using BOCF, we define a tree structure guided scheme based enumeration approach that systematically enumerates only the valid subtrees. Finally, we present the balanced optimal search tree miner (BOSTER) algorithm based on BOCF and the proposed enumeration approach, for finding frequent induced subtrees from a database of labelled rooted unordered trees. Experiments on the real datasets compare the efficiency of BOSTER over the two state-of-the-art algorithms for mining induced unordered subtrees, HybridTreeMiner and UNI3. The results are encouraging.