ORCID Profile
0000-0002-5415-0544
Current Organisation
University of Western Australia
Does something not look right? The information on this page has been harvested from data sources that may not be up to date. We continue to work with information providers to improve coverage and quality. To report an issue, use the Feedback Form.
In Research Link Australia (RLA), "Research Topics" refer to ANZSRC FOR and SEO codes. These topics are either sourced from ANZSRC FOR and SEO codes listed in researchers' related grants or generated by a large language model (LLM) based on their publications.
Analysis of Algorithms and Complexity | Other Artificial Intelligence | Computation Theory and Mathematics | Software Engineering | Computational Logic and Formal Languages | Renewable Power and Energy Systems Engineering (excl. Solar Cells) | Power and Energy Systems Engineering (excl. Renewable Power) | Knowledge Representation And Machine Learning | Infrastructure Engineering and Asset Management | Electrical and Electronic Engineering | Information Systems | Logics And Meanings Of Programs | Simulation and Modelling | Cognitive Science | Engineering Practice | Interdisciplinary Engineering | Data Security | Global Information Systems
Computer Software and Services not elsewhere classified | Productivity (excl. Public Sector) | Information processing services | Energy Transmission and Distribution (excl. Hydrogen) | Communication services not elsewhere classified | Computer software and services not elsewhere classified | Energy Systems Analysis | Mining Machinery and Equipment | Expanding Knowledge in Engineering |
Publisher: Elsevier BV
Date: 04-2017
Publisher: IEEE
Date: 09-2011
DOI: 10.1109/TIME.2011.29
Publisher: IEEE
Date: 03-2018
Publisher: Springer International Publishing
Date: 2013
Publisher: Springer Berlin Heidelberg
Date: 2009
Publisher: Springer Berlin Heidelberg
Date: 2005
DOI: 10.1007/11590156_31
Publisher: IEEE
Date: 2019
Publisher: Open Publishing Association
Date: 24-08-2014
DOI: 10.4204/EPTCS.161.16
Publisher: Elsevier BV
Date: 05-2010
Publisher: Oxford University Press (OUP)
Date: 12-1999
Publisher: Springer-Verlag
Date: 1994
DOI: 10.1007/BFB0013984
Publisher: IEEE
Date: 06-2019
Publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
Date: 2021
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 09-2019
Publisher: ACM
Date: 10-2018
Publisher: Elsevier BV
Date: 06-2006
Publisher: Springer Berlin Heidelberg
Date: 2011
Publisher: Open Publishing Association
Date: 13-09-2016
DOI: 10.4204/EPTCS.226.20
Publisher: Springer International Publishing
Date: 2020
Publisher: Springer International Publishing
Date: 2019
Publisher: IEEE
Date: 12-2018
Publisher: Informa UK Limited
Date: 2010
Publisher: Springer Berlin Heidelberg
Date: 2001
Publisher: ACM
Date: 26-06-2021
Publisher: IEEE
Date: 07-2019
Publisher: Springer International Publishing
Date: 2019
Publisher: IEEE
Date: 11-2018
Publisher: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany
Date: 2018
Publisher: IEEE
Date: 09-2014
DOI: 10.1109/TIME.2014.22
Publisher: Oxford University Press (OUP)
Date: 27-06-2014
Publisher: Springer Science and Business Media LLC
Date: 24-08-2023
DOI: 10.1186/S12879-023-08535-Y
Abstract: Bloodstream infections (BSIs) are a significant burden on the global population and represent a key area of focus in the hospital environment. Blood culture (BC) testing is the standard diagnostic test utilised to confirm the presence of a BSI. However, current BC testing practices result in low positive yields and overuse of the diagnostic test. Diagnostic stewardship research regarding BC testing is increasing, and becoming more important to reduce unnecessary resource expenditure and antimicrobial use, especially as antimicrobial resistance continues to rise. This study aims to establish a machine learning (ML) pipeline for BC outcome prediction using data obtained from routinely analysed blood s les, including complete blood count (CBC), white blood cell differential (DIFF), and cell population data (CPD) produced by Sysmex XN-2000 analysers. ML models were trained using retrospective data produced between 2018 and 2019, from patients at Sir Charles Gairdner hospital, Nedlands, Western Australia, and processed at Pathwest Laboratory Medicine, Nedlands. Trained ML models were evaluated using stratified 10-fold cross validation. Two ML models, an XGBoost model using CBC/DIFF/CPD features with boruta feature selection (BFS) , and a random forest model trained using CBC/DIFF features with BFS were selected for further validation after obtaining AUC scores of $$0.76 \\pm 0.04$$ 0.76 ± 0.04 and $$0.75 \\pm 0.04$$ 0.75 ± 0.04 respectively using stratified 10-fold cross validation. The XGBoost model obtained an AUC score of 0.76 on a internal validation set. The random forest model obtained AUC scores of 0.82 and 0.76 on internal and external validation datasets respectively. We have demonstrated the utility of using an ML pipeline combined with CBC/DIFF, and CBC/DIFF/CPD feature spaces for BC outcome prediction. This builds on the growing body of research in the area of BC outcome prediction, and provides opportunity for further research.
Publisher: IEEE
Date: 09-2014
DOI: 10.1109/TIME.2014.25
Publisher: IEEE
Date: 12-2018
Publisher: Elsevier BV
Date: 02-2012
Publisher: Elsevier BV
Date: 05-2017
Publisher: Springer Berlin Heidelberg
Date: 2010
Publisher: IEEE
Date: 04-2019
Publisher: Open Publishing Association
Date: 16-07-2013
DOI: 10.4204/EPTCS.119
Publisher: IEEE
Date: 11-2006
Publisher: EasyChair
Date: 2017
DOI: 10.29007/3HB9
Abstract: Linear Temporal Logic (LTL) is a de-facto standard formalism for expressing properties of systems and temporal constraints in formal verification, artificial intelligence, and other areas of computer science. The problem of LTL satisfiability is thus prominently important to check the consistency of these temporal specifications. Although adding past operators to LTL does not increase its expressive power, recently the interest for explicitly handling the past in temporal logics has increased because of the clarity and succinctness that those operators provide. In this work, a recently proposed one-pass tree-shaped tableau system for LTL is extended to support past operators. The modularity of the required changes provides evidence for the claimed ease of extensibility of this tableau system.
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 11-2018
Publisher: Springer International Publishing
Date: 2016
Publisher: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany
Date: 2018
Publisher: MDPI AG
Date: 23-09-2022
DOI: 10.3390/INFORMATICS9040073
Abstract: While the consumption of visual information becomes a daily commodity integrated into our lives, data visualisation is dominated by dashboards and charts. The main contribution of this article is an advanced way to visualise data as a data story. We converged paradigms from digital storytelling, serious games, and data visualisation to turn data into useful insights. The creation, management, and analysis of data have been increasingly given more attention in industry and professional practices. However, the potential of packaging data and analytic results into easily digestible and visually explorable content intended for non-professional audiences has not yet been investigated to its full extent. We contributed towards overcoming the gap between data analytics and data presentation. By integrating a story-like environment and entertainment into data visualisation, we explore the possibilities of efficiently communicating data and insights to general audiences in a casual context. We present this modular approach to customising messages for visual data storytelling from an information and communication perspective, including a test prototype developed to illustrate our data storytelling framework.
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2021
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2020
Publisher: IEEE
Date: 06-2015
Publisher: IEEE
Date: 09-2013
DOI: 10.1109/TIME.2013.21
Publisher: Springer International Publishing
Date: 2018
Publisher: IEEE
Date: 11-2017
Publisher: Springer International Publishing
Date: 2018
Publisher: Springer International Publishing
Date: 2015
Publisher: Duke University Press
Date: 07-1997
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2020
Publisher: Informa UK Limited
Date: 03-07-2015
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 12-2021
Publisher: EasyChair
Date: 2018
DOI: 10.29007/FZRQ
Abstract: Search and optimization problems are a major arena for the practical application of Artificial Intelligence. However, when supply chain optimization and scheduling is tackled, techniques based on linear or non-linear programming are often used in preference to Evolutionary Computation such as Genetic Algorithms (GAs). It is important to analyse whether GA are suitable for continuous real-world supply chain scheduling tasks which need regular updates. We analysed a practical situation involving iron ore train networks which is indeed one of significant economic importance. In addition, iron ore train networks have some interesting and distinctive characteristics so analysing this situation is an important step toward understanding the performance of GA in real-world supply chain scheduling. We compared the performance of GA with Nonlinear programming heuristics and existing industry scheduling approaches. The main result is that our comparison of techniques here produce an ex le in which GAs perform well and is a cost effective approach.
Publisher: Springer Science and Business Media LLC
Date: 04-1994
DOI: 10.1007/BF01050343
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 04-2019
Publisher: Wiley
Date: 18-07-2022
DOI: 10.1002/MP.15840
Abstract: The use of deep learning (DL) to improve cone‐beam CT (CBCT) image quality has gained popularity as computational resources and algorithmic sophistication have advanced in tandem. CBCT imaging has the potential to facilitate online adaptive radiation therapy (ART) by utilizing up‐to‐date patient anatomy to modify treatment parameters before irradiation. Poor CBCT image quality has been an impediment to realizing ART due to the increased scatter conditions inherent to cone‐beam acquisitions. Given the recent interest in DL applications in radiation oncology, and specifically DL for CBCT correction, we provide a systematic theoretical and literature review for future stakeholders. The review encompasses DL approaches for synthetic CT generation, as well as projection domain methods employed in the CBCT correction literature. We review trends pertaining to publications from January 2018 to April 2022 and condense their major findings—with emphasis on study design and DL techniques. Clinically relevant endpoints relating to image quality and dosimetric accuracy are summarized, highlighting gaps in the literature. Finally, we make recommendations for both clinicians and DL practitioners based on literature trends and the current DL state‐of‐the‐art methods utilized in radiation oncology.
Publisher: IEEE
Date: 04-2019
Publisher: Association for the Advancement of Artificial Intelligence (AAAI)
Date: 17-07-2019
DOI: 10.1609/AAAI.V33I01.33013224
Abstract: One of the factors hindering the use of classification models in decision making is that their predictions may contradict expectations. In domains such as finance and medicine, the ability to include knowledge of monotone (nondecreasing) relationships is sought after to increase accuracy and user satisfaction. As one of the most successful classifiers, attempts have been made to do so for Random Forest. Ideally a solution would (a) maximise accuracy (b) have low complexity and scale well (c) guarantee global monotonicity and (d) cater for multi-class. This paper first reviews the state-of-theart from both the literature and statistical libraries, and identifies opportunities for improvement. A new rule-based method is then proposed, with a maximal accuracy variant and a faster approximate variant. Simulated and real datasets are then used to perform the most comprehensive ordinal classification benchmarking in the monotone forest literature. The proposed approaches are shown to reduce the bias induced by monotonisation and thereby improve accuracy.
Publisher: Springer Berlin Heidelberg
Date: 2013
Publisher: IEEE
Date: 10-2016
DOI: 10.1109/TIME.2016.21
Publisher: Springer Science and Business Media LLC
Date: 1992
DOI: 10.1007/BF00370112
Publisher: Springer Berlin Heidelberg
Date: 2010
Publisher: Oxford University Press (OUP)
Date: 09-10-2013
Publisher: EasyChair
Date: 2017
DOI: 10.29007/N11T
Abstract: We apply genetic algorithms (GAs) to evolve cyclic finite automata for scheduling the dispatch of trucks in mines. The GA performs well generally, and on problems which include one-lane roads, the GA was able to find solutions that utilised shovels very well, with low contention and using fewer trucks than both the widely-used linear programming DISPATCH algorithm, and commonly-used greedy heuristics. The GA provides significant cost-savings, or production increases, on problems where alternative algorithms do not adapt well.
Publisher: Elsevier BV
Date: 03-2003
Publisher: Oxford University Press (OUP)
Date: 23-08-2007
Publisher: Elsevier BV
Date: 06-2021
Publisher: Springer Science and Business Media LLC
Date: 19-04-2017
Publisher: Springer Nature Singapore
Date: 2022
Publisher: Oxford University Press (OUP)
Date: 08-2002
Publisher: Association for Computing Machinery (ACM)
Date: 11-2011
DOI: 10.1007/S00165-011-0193-4
Abstract: We present a sound, complete and implementable tableau method for deciding satisfiability of formulas in the propositional version of computation tree logic CTL*. This is the first such tableau. CTL* is an exceptionally important temporal logic with applications from hardware design to agent reasoning, but there is no easily automated reasoning approach to CTL*. The tableau here is a traditional tree-shaped or top-down style tableau, and affords the possibility of reasonably quick decisions on the satisfiability of medium-sized formulas and construction of small models for them. A straightforward subroutine is given for determining when looping allows successful branch termination, but much needed further development is left as future work. In particular, a more general repetition prevention mechanism is needed to speed up the task of tableau construction.
Publisher: Springer Science and Business Media LLC
Date: 07-07-2019
Publisher: ACTAPRESS
Date: 2010
Publisher: Oxford University Press (OUP)
Date: 12-2001
Publisher: Springer Science and Business Media LLC
Date: 13-06-2016
Publisher: Vandenhoeck & Ruprecht
Date: 30-03-2011
Publisher: Elsevier BV
Date: 06-2019
Publisher: Springer International Publishing
Date: 2019
Publisher: Elsevier BV
Date: 02-2017
Publisher: IEEE
Date: 03-2020
Publisher: Elsevier BV
Date: 08-2005
Publisher: Springer International Publishing
Date: 2014
Publisher: ACM Press
Date: 2006
Publisher: Springer Berlin Heidelberg
Date: 2013
Publisher: Elsevier BV
Date: 02-2022
Publisher: IEEE
Date: 04-2018
Publisher: IEEE
Date: 09-2013
DOI: 10.1109/TIME.2013.17
Publisher: IEEE
Date: 09-2013
DOI: 10.1109/TIME.2013.18
Publisher: Informa UK Limited
Date: 2009
Publisher: Open Publishing Association
Date: 06-09-2017
DOI: 10.4204/EPTCS.256.12
Publisher: Open Publishing Association
Date: 07-09-2018
DOI: 10.4204/EPTCS.277.13
Publisher: IEEE
Date: 05-2019
Publisher: Springer Science and Business Media LLC
Date: 28-05-2021
Publisher: Association for Computing Machinery (ACM)
Date: 11-10-2019
DOI: 10.1145/3358219
Abstract: This paper presents a novel framework for decentralized monitoring of Linear Temporal Logic (LTL) formulas, under the situation where processes are synchronous and the formula is represented as a tableau. The tableau technique allows one to construct a semantic tree for the input LTL formula, which can be used to optimize the decentralized monitoring of LTL in various ways. Given a system P and an LTL formula φ, we construct a tableau T φ . The tableau T φ is used for two purposes: (a) to synthesize an efficient round-robin communication policy for processes, and (b) to find the minimal ways to decompose the formula and communicate observations of processes in an efficient way. In our framework, processes can propagate truth values of both atomic and compound formulas (non-atomic formulas) depending on the syntactic structure of the input LTL formula and the observation power of processes. We demonstrate that this approach of decentralized monitoring based on tableau construction is more straightforward, more flexible, and more likely to yield efficient solutions than alternative approaches.
Publisher: Association for Computing Machinery (ACM)
Date: 11-2015
DOI: 10.1007/S00165-015-0340-4
Abstract: The paper presents a new efficient algorithm for computing worst case execution time (WCET) of systems modelled as timed automata (TA). The algorithm uses a set of abstraction techniques that improve significantly the efficiency of WCET analysis of TA models with cyclic behaviour. We show that the proposed abstractions are exact with respect to the WCET problem in the sense that the WCET computed in the abstract model is equal to the one computed in the concrete model. We also compare our algorithm with the one implemented in the model checker UPPAAL which shows that when infinite cycles exist (i.e. cycles that can be run infinitely often), UPPAAL’s algorithm may not terminate, and when largely repetitive finite cycles exist (i.e. cycles that can be run a large number of times but finite), UPPAAL’s algorithm suffers from the state space explosion, thus leading to a low efficiency or resource exhaustion.
Publisher: Springer International Publishing
Date: 2019
Publisher: Elsevier BV
Date: 12-2011
Publisher: American Physical Society (APS)
Date: 02-2019
Publisher: Springer Berlin Heidelberg
Date: 2011
Publisher: Springer Science and Business Media LLC
Date: 09-07-2019
Publisher: Springer Berlin Heidelberg
Date: 2007
Publisher: Elsevier BV
Date: 04-2018
Publisher: IEEE
Date: 11-2017
Publisher: Cambridge University Press (CUP)
Date: 09-2001
DOI: 10.2307/2695091
Abstract: We give a sound and complete axiomatization for the full computation tree logic. CTL*, of R -generable models. This solves a long standing open problem in branching time temporal logic.
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 08-2020
Publisher: Springer Berlin Heidelberg
Date: 2000
DOI: 10.1007/10722086_26
Publisher: IEEE
Date: 07-2009
DOI: 10.1109/TIME.2009.18
Publisher: Springer Berlin Heidelberg
Date: 2019
Publisher: Cambridge University Press (CUP)
Date: 09-2018
DOI: 10.1017/JSL.2017.79
Abstract: We consider Minkowski spacetime, the set of all point-events of spacetime under the relation of causal accessibility. That is, x can access y if an electromagnetic or (slower than light) mechanical signal could be sent from x to y. We use Prior’s tense language of F and P representing causal accessibility and its converse relation. We consider two versions, one where the accessibility relation is reflexive and one where it is irreflexive. In either case it has been an open problem, for decades, whether the logic is decidable or axiomatisable. We make a small step forward by proving, in each case, that the set of valid formulas over two-dimensional Minkowski spacetime is decidable and that the complexity of each problem is PSPACE-complete. A consequence is that the temporal logic of intervals with real endpoints under either the containment relation or the strict containment relation is PSPACE-complete, the same is true if the interval accessibility relation is “each endpoint is not earlier”, or its irreflexive restriction. We provide a temporal formula that distinguishes between three-dimensional and two-dimensional Minkowski spacetime and another temporal formula that distinguishes the two-dimensional case where the underlying field is the real numbers from the case where instead we use the rational numbers.
Publisher: Elsevier BV
Date: 08-2015
Publisher: IEEE
Date: 11-2018
Publisher: IEEE
Date: 07-2009
DOI: 10.1109/TIME.2009.16
Publisher: Springer Berlin Heidelberg
Date: 1995
Publisher: Elsevier
Date: 2005
Publisher: Elsevier BV
Date: 02-2021
Publisher: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany
Date: 2019
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 04-2020
Publisher: Springer Science and Business Media LLC
Date: 10-1996
DOI: 10.1007/BF00370836
Publisher: Springer Science and Business Media LLC
Date: 24-05-2020
Publisher: Elsevier BV
Date: 05-2012
Publisher: IEEE
Date: 18-07-2022
Publisher: Elsevier BV
Date: 05-2020
Start Date: 2011
End Date: 12-2014
Amount: $255,000.00
Funder: Australian Research Council
View Funded ActivityStart Date: 2014
End Date: 12-2017
Amount: $360,000.00
Funder: Australian Research Council
View Funded ActivityStart Date: 2004
End Date: 12-2010
Amount: $480,000.00
Funder: Australian Research Council
View Funded ActivityStart Date: 2017
End Date: 12-2020
Amount: $381,000.00
Funder: Australian Research Council
View Funded ActivityStart Date: 11-2003
End Date: 12-2004
Amount: $20,000.00
Funder: Australian Research Council
View Funded ActivityStart Date: 02-2019
End Date: 02-2025
Amount: $3,925,357.00
Funder: Australian Research Council
View Funded Activity