Multitasking: multiple, domain-specific cognitive functions in a virtual environment

Multitasking among three or more different tasks is a ubiquitous requirement of everyday cognition, yet rarely is it addressed in research on healthy adults who have had no specific training in multitasking skills. Participants completed a set of diverse subtasks within a simulated shopping mall and office environment, the Edinburgh Virtual Errands Test (EVET). The aim was to investigate how different cognitive functions, such as planning, retrospective and prospective memory, and visuospatial and verbal working memory, contribute to everyday multitasking. Subtasks were chosen to be diverse, and predictions were derived from a statistical model of everyday multitasking impairments associated with frontal-lobe lesions (Burgess, Veitch, de Lacy Costello, & Shallice, 2000b). Multiple regression indicated significant independent contributions from measures of retrospective memory, visuospatial working memory, and online planning, but not from independent measures of prospective memory or verbal working memory. Structural equation modelling showed that the best fit to the data arose from three underlying constructs, with Memory and Planning having a weak link, but with both having a strong directional pathway to an Intent construct that reflected implementation of intentions. Participants who followed their preprepared plan achieved higher scores than those who altered their plan during multitask performance. This was true regardless of whether the plan was efficient or poor. These results substantially develop and extend the Burgess et al. (2000b) model to healthy adults and yield new insight into the poorly understood area of everyday multitasking. The findings also point to the utility of using virtual environments for investigating this form of complex human cognition.

Image reduction operators based on non-monotonic averaging functions

Image reduction is a crucial task in image processing, underpinning many practical applications. This work proposes novel image reduction operators based on non-monotonic averaging aggregation functions. The technique of penalty function minimisation is used to derive a novel mode-like estimator capable of identifying the most appropriate pixel value for representing a subset of the original image. Performance of this aggregation function and several traditional robust estimators of location are objectively assessed by applying image reduction within a facial recognition task. The FERET evaluation protocol is applied to confirm that these non-monotonic functions are able to sustain task performance compared to recognition using nonreduced images, as well as significantly improve performance on query images corrupted by noise. These results extend the state of the art in image reduction based on aggregation functions and provide a basis for efficiency and accuracy improvements in practical computer vision applications.

Zeros of Dirichlet L-functions on the critical line with the accuracy of 40000 decimal places

The zeros of Dirichlet L-functions for various moduli and characters are being computed with very high accuracy on a cluster of workstations at Deakin University. This collection is growing to include more zeros (other moduli and characters).

Characterisation of RNA in milk and prediction of microRNA functions

 Milk is considered on of the world’s most ‘complete’ food. To characterise milk composition, Amit investigated RNA present of milk form 8 different species ranging from platypus to human. By applying latest RNA sequencing and bioinformatic techniques, his work led to uncover hundreds of novel milk RNAs.

Characterisation of an ancient S100 protein with multiple functions

 This project focused on the novel S100A19 protein, expressed exclusively in marsupials and monotremes, identifying it as an important component of the innate immune system. Data showed that S100A19 is differentially regulated in the pouch and mammary gland of the wallaby to protect the infant when most susceptible to infection.

Weakly monotone averaging functions

Averaging behaviour of aggregation functions depends on the fundamental property of monotonicity with respect to all arguments. Unfortunately this is a limiting property that ensures that many important averaging functions are excluded from the theoretical framework. We propose a definition for weakly monotone averaging functions to encompass the averaging aggregation functions in a framework with many commonly used non-monotonic means. Weakly monotonic averages are robust to outliers and noise, making them extremely important in practical applications. We show that several robust estimators of location are actually weakly monotone and we provide sufficient conditions for weak monotonicity of the Lehmer and Gini means and some mixture functions. In particular we show that mixture functions with Gaussian kernels, which arise frequently in image and signal processing applications, are actually weakly monotonic averages. Our concept of weak monotonicity provides a sound theoretical and practical basis for understanding both monotone and non-monotone averaging functions within the same framework. This allows us to effectively relate these previously disparate areas of research and gain a deeper understanding of averaging aggregation methods. © Springer International Publishing Switzerland 2014.