21 September 2013 in Virtual Reality
9 February 2023 in Journal of the Royal Society of New Zealand
Artificial Intelligence (AI) is playing an increasingly significant role in various scientific research areas and real-world applications, ranging from AlphaGo design through medical imaging analys...
1 December 2016 in Intensive and Critical Care Nursing
17 May 2012 in Australasian Journal of Educational Technology
Computer games are purported to be effective instructional tools that enhance motivation and improve engagement. The aim of this study was to investigate how tertiary student experiences change when instruction was computer game based compared to lecture based, and whether experiences differed between high and low achieving students. Participants consisted two cohorts enrolled in a first year university course (Cohort 1, traditional: male=42, female=17; Cohort 2, computer game: male=42, female=7). Cohort 1 experienced course content as traditional lectures, Cohort 2 experienced course content embedded within a computer game. Csikszentmihalyi's experience sampling method was used to sample experiences of students for each cohort during instruction. Results showed that the computer game group were more challenged and valued the activity more than the traditional group, but were inclined to wish they were doing something else. High achieving students during game mode showed greater concentration but found it harder to concentrate and found game mode more sociable and lecture mode more boring. High achievers perceived greater success for lecture mode and found lectures more satisfying. Individual profiles of high and low achieving students for each mode indicated that games afforded better experiences for low achieving students but poorer experiences for high achieving students.
1 January 2013 in Journal of Applied Mathematics
Harmony search (HS) was introduced in 2001 as a heuristic population-based optimisation algorithm. Since then HS has become a popular alternative to other heuristic algorithms like simulated annealing and particle swarm optimisation. However, some flaws, like the need for parameter tuning, were identified and have been a topic of study for much research over the last 10 years. Many variants of HS were developed to address some of these flaws, and most of them have made substantial improvements. In this paper we compare the performance of three recent HS variants: exploratory harmony search, self-adaptive harmony search, and dynamic local-best harmony search. We compare the accuracy of these algorithms, using a set of well-known optimisation benchmark functions that include both unimodal and multimodal problems. Observations from this comparison led us to design a novel hybrid that combines the best attributes of these modern variants into a single optimiser called generalised adaptive harmony search.