Embedded Files
Presentations are 3 minutes long and are followed by 2 minutes of question. Below you can find the abstracts and the precise time for the talks. Times in Bracket are SA times.
Monday
Scheduling staff shifts of a blood donor centre
Achini Erandi, University of Melbourne 2:45 - 2:51 (2:15 - 2:21)
Our objective is to create rosters that optimise the use of donor centre staff and resources based on predicted demand. The resulting roster will minimise donor waiting times at the queues, understaffing and overstaffing, staff overtime and the total staff working hours.
Stochastic Matching: FCFM, Double Auctions and Beyond
Behrooz Niknami, University of Melbourne 2:52 - 2:58 (2:22 - 2:28)
Stochastic Matching Models are ledgers where orders are matched to each other via some compatibility structure and in accordance to a priority regime. But why and where are these systems used?
Maximum Entropy Inverse Reinforcement Learning
Aaron Snoswell, University of Queensland 2:59 - 3:05 (2:29 - 2:35)
Inverse Reinforcement Learning is the science of rationalizing sequential decision making behaviour. In this talk I will describe my recent work in developing efficient algorithms for this challenging and interesting problem by through the use of Maximum Entropy models.
pseudo marginal MCMC for symbolic data analysis
Yu Yang, University of New South Wales Sydney 3:06 - 3:12 (2:36 - 2:42)
This talk focuses on using pseudo marginal MCMC to do a Bayesian analysis for symbolic data. The symbolic data here are constructed from multivariate normal distribution.
Latent group time effects in nonparametric Bayesian linear models with unit-level heterogeneity
Igor Balnozan, University of New South Wales Sydney 3:13 - 3:19 (2:43 - 2:49)
This project aims to explore the suitability of using a nonparametric Bayesian linear model to estimate latent group-level time-varying unobservable heterogeneity in observational longitudinal (panel) data where there is also potential bias from unit-level unobservables.
The length of weakly self-avoiding walks on the complete graph
Abrahim Nasrawi, Monash University 3:20 - 3:26 (2:50 - 2:56)
A weakly self-avoiding walk on the complete graph, and its corresponding model will be introduced. We will then present some important statistical results such as the mean and variance of the walk length, as well as limit theorems.
Manifold learning with approximate nearest neighbors
Fan Cheng, Monash University 3:27 - 3:33 (2:57 - 3:03)
We proposed to solve the large-scale manifold learning problem using approximate nearest neighbors by replacing the exact nearest neighbor graph with an approximate one to represent the local data structure, followed by the standard manifold learning process. Therefore, we are able to apply manifold learning methods to large-scale data with much higher dimension, and gain a major decrease in computation time without losing much accuracy.
Reneging from a tandem server system with blocking
Jiesen Wang, University of Melbourne 3:34 - 3:40 (3:04 - 3:10)
We study a system with two servers in tandem. Customers calculate their expected waiting time at their arrival to decide to join or not, and keep calculating the expected remaining waiting time if they chose to join but have to wait, and decide to balk or to renege.
Bayesian non-parametric analysis for reinforcement learning experimental results
Vektor Dewanto, University of Queensland 3:41 - 3:47 (3:11 - 3:17)
Bayesian analysis is underused, if any, in analyzing reinforcement learning experimental results.
We identify the challenges and aim for a suitable Bayesian (non-parametric) analysis for such a purpose.
On the Equilibrium Behaviour of Queueing in Dynamic Matching Markets
Chenchen Xing, University of Melbourne 3:48 - 3:52 (3:18 - 3:22)
Matching is important throughout our lives. We consider a simple dynamic matching model in which agents are matched based on different queueing discipline. We compare the equilibrium thresholds under FIFO and LIFO protocols.
Tuesday
Advanced Bayesian approaches for modelling soil carbon sequestration
Mohammad Javad Davoudabadi, Queensland University of Technology 10:45 - 10:51 (10:15 - 10:21)
Sequestering carbon into the soil can mitigate the atmospheric concentration of greenhouse gases, improving crop productivity and yield financial gains for farmers through the sale of carbon credits. In this work, we develop and evaluate advanced Bayesian methods for modelling soil carbon sequestration and quantifying uncertainty around predictions that are needed to fit more complex soil carbon models, such as multiple-pool soil carbon dynamic models.
Fractional Dynamic Models of MRI to Probe Tissue Microstructure
Kyle McLaren, Queensland University of Technology 10:52 - 10:58 (10:22 - 10:28)
The time-space fractional Bloch-Torrey equation (TS-FBTE) is an important model for modelling anomalous diffusion and relaxation of the magnetisation of magnetic resonance images (MRI) of the brain. The development of high order numerical solutions and the accompanying analysis for TS-FBTE is limited and will be introduced in this presentation.
Scheduling arrivals into a system which accepts random arrivals
Wathsala Karunarathne, University of Melbourne 10:59 - 11:05 (10:29 - 10:35)
We pay attention to a system which we need to schedule N customers and the server accepts random arrivals during the time it is open for service. Our objective here is to derive an optimization model that generates an optimum schedule which minimizes the total expected cost of customer waiting time.
Developing a recommender system to triage forensic biology exhibits to achieve the best justice outcome.
Louise Campbell, University of Adelaide 11:06 - 11:12 (10:36 - 10:42)
You are a crime scene investigator who has collected 120 pieces of evidence, but forensics do not have the time or resources to be able to test all (or most) of these. How can we optimise which pieces of evidence are tested based on both the relevance to the type of crime and probability of obtaining a DNA profile?
A database of Australian forensic glass evidence
Oliver Lountain, University of Adelaide 11:13 - 11:19 (10:43 - 10:49)
Forensic glass evidence is used widely for presentation in courts, and recently, a new method – Laser Ablation Inductively Coupled Plasma Mass Spectrometry (LA-ICPMS) – has been developed to compare glass evidence which is considered to have more discriminating capabilities than those which have been used in the past. The project aims to create a database of elemental glass samples and develop a statistical model to analyse the evidence derived from LA-ICPMS data.
Predicting The Unpredictable: Emergency Departments
Michael Ucci, University of Adelaide 11:20 - 11:26 (10:50 - 10:56)
Emergency department overcrowding has become an increasingly prominent issue in recent times, not least in South Australian public hospitals. This work is focused toward using openly available data attained from the SA Health Emergency Department Dashboard to create a short-term prediction model for emergency department demand. The ultimate goal of the project is to implement a robust forecasting engine in a user-friendly software solution for decision makers within hospitals.
When all you have is a hammer, everything is a nail: a basis for probability.
Angus Lewis, University of Adelaide 11:27 - 11:33 (10:57 - 11:03)
I know next to nothing about functional analysis, but I know epsilon>0 about probability. Our aim is to develop a numerical PDE solver (a nail) with a probabilistic interpretation (our hammer).
Evolution by Ecological Scaffolding in a Non-Synchronized Environment
Cody Nitschke, University of Adelaide 11:34 - 11:40 (11:04 - 11:10)
Recent theories about the transition from unicellular to multi-cellular life have introduced the idea of ecological scaffolding as a potential explanation for how early groups of cells would have gained the properties needed to participate in evolution by natural selection. This is the idea that particular ecologies and environments can scaffold Darwinian properties onto groups of cells.
The ingredients needed for this process to operate are only patchily distributed resources and a regularly recurring dispersal process that also creates a bottleneck. Previous modelling work has shown how this process works when the dispersal process occurs synchronously across all patches at the same instant. In this talk, we show how we can relax this assumption by introducing more ecology into the problem.
Google Sites
Report abuse