Integrated scheduling for ambulances and ambulance crews

This project developed three mathematical models for scheduling ambulances and ambulance crews and proceeded to solve each model for test scenarios based on real data. Results from these models can serve as decision aids for dispatching or relocating ambulances; and for strategic decisions on the ambulance crews needed each shift. This thesis used Flexible Flow Shop Scheduling techniques to formulate strategic, dynamic and real time models. Metaheuristic solutions techniques were applied for a case study with realistic data. These models are suitable for ambulance planners and dispatchers.

Adaptive aneuploidy protects against thiol peroxidase deficiency by increasing respiration via key mitochondrial proteins

Aerobic respiration is a fundamental energy-generating process; however, there is cost associated with living in an oxygen-rich environment, because partially reduced oxygen species can damage cellular components. Organisms evolved enzymes that alleviate this damage and protect the intracellular milieu, most notably thiol peroxidases, which are abundant and conserved enzymes that mediate hydrogen peroxide signaling and act as the first line of defense against oxidants in nearly all living organisms. Deletion of all eight thiol peroxidase genes in yeast (∆8 strain) is not lethal, but results in slow growth and a high mutation rate. Here we characterized mechanisms that allow yeast cells to survive under conditions of thiol peroxidase deficiency. Two independent ∆8 strains increased mitochondrial content, altered mitochondrial distribution, and became dependent on respiration for growth but they were not hypersensitive to H2O2. In addition, both strains independently acquired a second copy of chromosome XI and increased expression of genes encoded by it. Survival of ∆8 cells was dependent on mitochondrial cytochrome-c peroxidase (CCP1) and UTH1, present on chromosome XI. Coexpression of these genes in ∆8 cells led to the elimination of the extra copy of chromosome XI and improved cell growth, whereas deletion of either gene was lethal. Thus, thiol peroxidase deficiency requires dosage compensation of CCP1 and UTH1 via chromosome XI aneuploidy, wherein these proteins support hydroperoxide removal with the reducing equivalents generated by the electron transport chain. To our knowledge, this is the first evidence of adaptive aneuploidy counteracting oxidative stress.

Post-quantum key exchange for the TLS protocol from the ring learning with errors problem

Lattice-based cryptographic primitives are believed to offer resilience against attacks by quantum computers. We demonstrate the practicality of post-quantum key exchange by constructing cipher suites for the Transport Layer Security (TLS) protocol that provide key exchange based on the ring learning with errors (R-LWE) problem, we accompany these cipher suites with a rigorous proof of security. Our approach ties lattice-based key exchange together with traditional authentication using RSA or elliptic curve digital signatures: the post-quantum key exchange provides forward secrecy against future quantum attackers, while authentication can be provided using RSA keys that are issued by today's commercial certificate authorities, smoothing the path to adoption. Our cryptographically secure implementation, aimed at the 128-bit security level, reveals that the performance price when switching from non-quantum-safe key exchange is not too high. With our R-LWE cipher suites integrated into the Open SSL library and using the Apache web server on a 2-core desktop computer, we could serve 506 RLWE-ECDSA-AES128-GCM-SHA256 HTTPS connections per second for a 10 KiB payload. Compared to elliptic curve Diffie-Hellman, this means an 8 KiB increased handshake size and a reduction in throughput of only 21%. This demonstrates that provably secure post-quantum key-exchange can already be considered practical.

Key opportunities for the future of roads to contribute to Australia's climate change response

Road agencies face growing pressure to respond to a range of issues associated with climate change and the reliance on fossil fuels. A key part of this response will be to reduce the dependency on fossil fuel based energy (and the associated greenhouse gas emissions) of transport, both vehicles and infrastructure. This paper presents findings of investigations into three key areas of innovative technologies and processes, namely the inclusion of onsite renewable energy generation technologies as part of road and transport infrastructure, the potential for automated motorways to reduce traffic fuel consumption (referred to as 'Smart Roads'), and the reduction of energy demand from route and signal lighting. The paper then concludes with the recommendation for the engineering profession to embrace sustainability performance assessment and rating tools as the basis for enhancing and communicating the contribution to Australia's response to climate change. Such tools provide a rigorous structure that can standardise approaches to key issues across entire sectors and provide clarity on the evidence required to demonstrate leading performance. The paper has been developed with funding and support provided by Australia's Sustainable Built Environment National Research Centre (SBEnrc), working with partners including Main Roads Western Australia, NSW Roads and Maritime Services, Queensland Department of Transport and Main Roads, John Holland Group, the Infrastructure Sustainability Council of Australia, Roads Australia, and the CRC for Low Carbon Living.

Application of simulated annealing to data distribution for all-to-all comparison problems in homogeneous systems

Distributed systems are widely used for solving large-scale and data-intensive computing problems, including all-to-all comparison (ATAC) problems. However, when used for ATAC problems, existing computational frameworks such as Hadoop focus on load balancing for allocating comparison tasks, without careful consideration of data distribution and storage usage. While Hadoop-based solutions provide users with simplicity of implementation, their inherent MapReduce computing pattern does not match the ATAC pattern. This leads to load imbalances and poor data locality when Hadoop's data distribution strategy is used for ATAC problems. Here we present a data distribution strategy which considers data locality, load balancing and storage savings for ATAC computing problems in homogeneous distributed systems. A simulated annealing algorithm is developed for data distribution and task scheduling. Experimental results show a significant performance improvement for our approach over Hadoop-based solutions.

Using genetic algorithm in profile-based assignment of applications to virtual machines for greener data centers

The increase in data center dependent services has made energy optimization of data centers one of the most exigent challenges in today's Information Age. The necessity of green and energy-efficient measures is very high for reducing carbon footprint and exorbitant energy costs. However, inefficient application management of data centers results in high energy consumption and low resource utilization efficiency. Unfortunately, in most cases, deploying an energy-efficient application management solution inevitably degrades the resource utilization efficiency of the data centers. To address this problem, a Penalty-based Genetic Algorithm (GA) is presented in this paper to solve a defined profile-based application assignment problem whilst maintaining a trade-off between the power consumption performance and resource utilization performance. Case studies show that the penalty-based GA is highly scalable and provides 16% to 32% better solutions than a greedy algorithm.

A penalty-based genetic algorithm for the migration cost-aware virtual machine placement problem in cloud data centers

In the past few years, the virtual machine (VM) placement problem has been studied intensively and many algorithms for the VM placement problem have been proposed. However, those proposed VM placement algorithms have not been widely used in today's cloud data centers as they do not consider the migration cost from current VM placement to the new optimal VM placement. As a result, the gain from optimizing VM placement may be less than the loss of the migration cost from current VM placement to the new VM placement. To address this issue, this paper presents a penalty-based genetic algorithm (GA) for the VM placement problem that considers the migration cost in addition to the energy-consumption of the new VM placement and the total inter-VM traffic flow in the new VM placement. The GA has been implemented and evaluated by experiments, and the experimental results show that the GA outperforms two well known algorithms for the VM placement problem.

An algorithm for constructing Hjelmslev planes

Projective Hjelmslev planes and affine Hjelmslev planes are generalisations of projective planes and affine planes. We present an algorithm for constructing projective Hjelmslev planes and affine Hjelmslev planes that uses projective planes, affine planes and orthogonal arrays. We show that all 2-uniform projective Hjelmslev planes, and all 2-uniform affine Hjelmslev planes can be constructed in this way. As a corollary it is shown that all $2$-uniform affine Hjelmslev planes are sub-geometries of $2$-uniform projective Hjelmslev planes.

Efficient simulation of stochastic chemical kinetics with the Stochastic Bulirsch-Stoer extrapolation method

Background Biochemical systems with relatively low numbers of components must be simulated stochastically in order to capture their inherent noise. Although there has recently been considerable work on discrete stochastic solvers, there is still a need for numerical methods that are both fast and accurate. The Bulirsch-Stoer method is an established method for solving ordinary differential equations that possesses both of these qualities. Results In this paper, we present the Stochastic Bulirsch-Stoer method, a new numerical method for simulating discrete chemical reaction systems, inspired by its deterministic counterpart. It is able to achieve an excellent efficiency due to the fact that it is based on an approach with high deterministic order, allowing for larger stepsizes and leading to fast simulations. We compare it to the Euler τ-leap, as well as two more recent τ-leap methods, on a number of example problems, and find that as well as being very accurate, our method is the most robust, in terms of efficiency, of all the methods considered in this paper. The problems it is most suited for are those with increased populations that would be too slow to simulate using Gillespie’s stochastic simulation algorithm. For such problems, it is likely to achieve higher weak order in the moments. Conclusions The Stochastic Bulirsch-Stoer method is a novel stochastic solver that can be used for fast and accurate simulations. Crucially, compared to other similar methods, it better retains its high accuracy when the timesteps are increased. Thus the Stochastic Bulirsch-Stoer method is both computationally efficient and robust. These are key properties for any stochastic numerical method, as they must typically run many thousands of simulations.

The koala immunological toolkit: Sequence identification and comparison of key markers of the koala (Phascolarctos cinereus) immune response

The koala (Phascolarctos cinereus) is an Australian marsupial that continues to experience significant population declines. Infectious diseases caused by pathogens such as Chlamydia are proposed to have a major role. Very few species-specific immunological reagents are available, severely hindering our ability to respond to the threat of infectious diseases in the koala. In this study, we utilise data from the sequencing of the koala transcriptome to identify key immunological markers of the koala adaptive immune response and cytokines known to be important in the host response to chlamydial infection in other species. This report describes the identification and preliminary sequence analysis of (1) T lymphocyte glycoprotein markers (CD4, CD8); (2) IL-4, a marker for the Th2 response; (3) cytokines such as IL-6, IL-12 and IL-1β, that have been shown to have a role in chlamydial clearance and pathology in other hosts; and (4) the sequences for the koala immunoglobulins, IgA, IgG, IgE and IgM. These sequences will enable the development of a range of immunological reagents for understanding the koala’s innate and adaptive immune responses, while also providing a resource that will enable continued investigations into the origin and evolution of the marsupial immune system.

A data mining approach for fault diagnosis: An application of anomaly detection algorithm

Rolling-element bearing failures are the most frequent problems in rotating machinery, which can be catastrophic and cause major downtime. Hence, providing advance failure warning and precise fault detection in such components are pivotal and cost-effective. The vast majority of past research has focused on signal processing and spectral analysis for fault diagnostics in rotating components. In this study, a data mining approach using a machine learning technique called anomaly detection (AD) is presented. This method employs classification techniques to discriminate between defect examples. Two features, kurtosis and Non-Gaussianity Score (NGS), are extracted to develop anomaly detection algorithms. The performance of the developed algorithms was examined through real data from a test to failure bearing. Finally, the application of anomaly detection is compared with one of the popular methods called Support Vector Machine (SVM) to investigate the sensitivity and accuracy of this approach and its ability to detect the anomalies in early stages.

One practical algorithm for both stochastic and adversarial bandits

We present an algorithm for multiarmed bandits that achieves almost optimal performance in both stochastic and adversarial regimes without prior knowledge about the nature of the environment. Our algorithm is based on augmentation of the EXP3 algorithm with a new control lever in the form of exploration parameters that are tailored individually for each arm. The algorithm simultaneously applies the “old” control lever, the learning rate, to control the regret in the adversarial regime and the new control lever to detect and exploit gaps between the arm losses. This secures problem-dependent “logarithmic” regret when gaps are present without compromising on the worst-case performance guarantee in the adversarial regime. We show that the algorithm can exploit both the usual expected gaps between the arm losses in the stochastic regime and deterministic gaps between the arm losses in the adversarial regime. The algorithm retains “logarithmic” regret guarantee in the stochastic regime even when some observations are contaminated by an adversary, as long as on average the contamination does not reduce the gap by more than a half. Our results for the stochastic regime are supported by experimental validation.

Predicting tours and probabilistic simulation for BKZ lattice reduction algorithm

We investigate the terminating concept of BKZ reduction first introduced by Hanrot et al. [Crypto'11] and make extensive experiments to predict the number of tours necessary to obtain the best possible trade off between reduction time and quality. Then, we improve Buchmann and Lindner's result [Indocrypt'09] to find sub-lattice collision in SWIFFT. We illustrate that further improvement in time is possible through special setting of SWIFFT parameters and also through the combination of different reduction parameters adaptively. Our contribution also include a probabilistic simulation approach top-up deterministic simulation described by Chen and Nguyen [Asiacrypt'11] that can able to predict the Gram-Schmidt norms more accurately for large block sizes.

Profiles of illicit drug use during annual key holiday and control periods in Australia: Wastewater analysis in an urban, a semi-rural and a vacation area

AIMS: To examine changes in illicit drug consumption between peak holiday season (23 December-3 January) in Australia and a control period two months later in a coastal urban area, an inland semi-rural area and an island populated predominantly by vacationers during holidays. DESIGN: Analysis of representative daily composite wastewater samples collected from the inlet of the major wastewater treatment plant in each area. SETTING: Three wastewater treatment plants. PARTICIPANTS: Wastewater treatment plants serviced approximately 350, 000 persons in the urban area, 120,000 in the semi-rural area and 1100-2400 on the island. MEASUREMENTS: Drug residues were analysed using liquid chromatography coupled to a tandem mass spectrometer. Per capita drug consumption was estimated. Changes in drug use were quantified using Hedges' g. FINDINGS: During the holidays, cannabis consumption in the semi-rural area declined (g = -2.8) as did methamphetamine (-0.8), whereas cocaine (+1.5) and ecstasy (+1.6) use increased. In the urban area, consumption of all drugs increased during holidays (cannabis +1.6, cocaine +1.2, ecstasy +0.8 and methamphetamine +0.3). In the vacation area, methamphetamine (+0.7), ecstasy (+0.7) and cocaine (+1.1) use increased, but cannabis (-0.5) use decreased during holiday periods. CONCLUSIONS: While the peak holiday season in Australia is perceived as a period of increased drug use, this is not uniform across all drugs and areas. Substantial declines in drug use in the semi-rural area contrasted with substantial increases in urban and vacation areas. Per capita drug consumption in the vacation area was equivalent to that in the urban area, implying that these locations merit particular attention for drug use monitoring and harm minimisation measures.

Illicit drug use between an annual key holiday and a control period: Wastewater analysis in a semi-rural, an urban and a vacation area

Introduction and Aims: Holiday periods are potentially a time for increased substance use as social events and private parties are more common. Data on community illicit drug consumption during holiday periods are limited. Besides existing methods for determining drug use, such as population surveys, one emerging method is to measure illicit drugs and/or their metabolites in wastewater samples. This study examined the change in consumption of cannabis, methamphetamine, cocaine and 3,4- methylenedioxymethamphetamine in three different types of areas (an inland semi-rural area, a coastal urban area and a vacation island) with respect to holiday times. Design and Methods: Samples were collected at the inlet of the major wastewater treatment plant in each area during a key annual holiday (i.e. the summer holiday including Christmas and New Year) and control period. Illicit drug residues in the daily composited samples were measured by liquid chromatography coupled with tandem mass spectrometry. Results: Drug use varied substantially among the three areas within each monitoring period as well as between the holiday and control period within each area. Use consistently increased and peaked over New Year particularly for cocaine and 3,4-methylenedioxymethamphetamine whereas cannabis and methamphetamine were relatively less subjected to holiday times in all the areas. Discussion and Conclusions: Wastewater sampling and analysis provides higher spatio-temporal resolution than national surveys and supplements drug epidemiology studies originating primary in metropolitan locations. Such data is essential for policy makers to plan potential intervention strategies associated with these illicit substances in regional areas and other settings besides urban areas in the future.