Northern wing, General Purpose North 3, University of Queensland, St Lucia

As seen from Blair Road.

Northern wing, General Purpose North 3, University of Queensland, St Lucia

As seen from Balir Road.

West elevation, General Purpose North 3, University of Queensland, St Lucia

Formal elevation facing University of Queensland entrance roads.

Eastern edge, General Purpose North 3, University of Queensland, St Lucia

As seen from informal courtyard; Duhig Tower beyond.

West elevation, General Purpose North 3, University of Queensland, St Lucia

Formal elevation facing University of Queensland entrance roads.

West elevation, General Purpose North 3, University of Queensland, St Lucia

Formal elevation facing University of Queensland entrance roads.

West elevation, General Purpose North 3, University of Queensland, St Lucia

Formal elevation facing University of Queensland entrance roads.

A general-purpose tunable landscape generator

The research literature on metalieuristic and evolutionary computation has proposed a large number of algorithms for the solution of challenging real-world optimization problems. It is often not possible to study theoretically the performance of these algorithms unless significant assumptions are made on either the algorithm itself or the problems to which it is applied, or both. As a consequence, metalieuristics are typically evaluated empirically using a set of test problems. Unfortunately, relatively little attention has been given to the development of methodologies and tools for the large-scale empirical evaluation and/or comparison of metaheuristics. In this paper, we propose a landscape (test-problem) generator that can be used to generate optimization problem instances for continuous, bound-constrained optimization problems. The landscape generator is parameterized by a small number of parameters, and the values of these parameters have a direct and intuitive interpretation in terms of the geometric features of the landscapes that they produce. An experimental space is defined over algorithms and problems, via a tuple of parameters for any specified algorithm and problem class (here determined by the landscape generator). An experiment is then clearly specified as a point in this space, in a way that is analogous to other areas of experimental algorithmics, and more generally in experimental design. Experimental results are presented, demonstrating the use of the landscape generator. In particular, we analyze some simple, continuous estimation of distribution algorithms, and gain new insights into the behavior of these algorithms using the landscape generator.

Spatial indexing for scalability in FCA

The paper provides evidence that spatial indexing structures offer faster resolution of Formal Concept Analysis queries than B-Tree/Hash methods. We show that many Formal Concept Analysis operations, computing the contingent and extent sizes as well as listing the matching objects, enjoy improved performance with the use of spatial indexing structures such as the RD-Tree. Speed improvements can vary up to eighty times faster depending on the data and query. The motivation for our study is the application of Formal Concept Analysis to Semantic File Systems. In such applications millions of formal objects must be dealt with. It has been found that spatial indexing also provides an effective indexing technique for more general purpose applications requiring scalability in Formal Concept Analysis systems. The coverage and benchmarking are presented with general applications in mind.

Allergen databases

Allergies represent a significant medical and industrial problem. Molecular and clinical data on allergens are growing exponentially and in this article we have reviewed nine specialized allergen databases and identified data sources related to protein allergens contained in general purpose molecular databases. An analysis of allergens contained in public databases indicates a high level of redundancy of entries and a relatively low coverage of allergens by individual databases. From this analysis we identify current database needs for allergy research and, in particular, highlight the need for a centralized reference allergen database.

Host plant specificity in several species of generalist mite predators

1. Species in the genus Neoseiulus are considered to be generalist predators. with some species used in biological control programmes against phytophagous mites and insects. 2. A general survey of Neoseiulus species in inland Australia indicated that different species are associated with particular tree species. This pattern of host plant use was investigated for four Neoseiulus species (N. buxeus, N. cappari, N. brigarinus, N. eremitus) by means of a sampling programme through time and across space. 3. Each species of Neoseiulus was collected entirely or mostly from one species of tree: little or no overlap was detected despite the tree species growing in well-mixed stands. Host plant specificity thus appears to be strong in this genus. 4. Species in two other genera (Pholaseius and Australiseiulus), also considered to be predatory, showed a similar association with particular tree species. 5. The implications for the use of these predators in biological control are considerable. In particular, phytoseiid species with specific needs in terms of host plants may not be suitable for use as general purpose predators. Meeting the needs of phytoseiids through the modification of host plant attributes may be a step towards enhancing their efficacy as biological control agents.

Analysis of a circular patch antenna radiating in a parallel-plate radial guide

A field matching method is described to analyze a recessed circular cavity radiating into a radial waveguide. Using the wall impedance approach, the analysis is divided into two separate problems of the cavity and its external environment. Based on this analysis, a computer algorithm is developed for determining wall admittances as seen at the edge of the patch in the cavity, the radial admittance matrix for the two-probe feed arrangement, and the input impedance as observed from the coaxial line feeding the cavity. This algorithm is tested against the general-purpose Hewlett-Packard finite-element High Frequency Structure Simulator as well as against measured results. Good agreement in all considered cases is noted.

Earnings management in response to the introduction of the Australian gold tax

Earnings from gold mining in Australia remained tax-exempt for almost seven decades until January 1, 1991. In the early 1980s, rapid economic prosperity induced by escalated gold prices brought the Australian gold-mining industry under intense political scrutiny. Using a variant of the modified Jones model, this paper provides evidence of significant downward earnings management by Australian gold-mining firms, which is consistent with their attempts to mitigate political costs during the period from June 1985 to May 1988. In contrast, test of earnings management over a similar period in a control sample of Canadian gold-mining firms produced insignificant results. Further, empirical results are robust to several sensitivity tests performed. During the period from June 1988 to December 1990, the Australian firms were found to have engaged in economic earnings management. This is consistent with the sample firms' incentive of maximizing economic earnings immediately prior to the introduction of income tax on gold mining. The findings of this study help to understand the impact of earnings management on the efficient resource allocation in an economy. They also contribute toward understanding the linkage between regulation of accounting for special purposes and general-purpose financial. reporting.

Statistical racing techniques for improved empirical evaluation of evolutionary algorithms

In empirical studies of Evolutionary Algorithms, it is usually desirable to evaluate and compare algorithms using as many different parameter settings and test problems as possible, in border to have a clear and detailed picture of their performance. Unfortunately, the total number of experiments required may be very large, which often makes such research work computationally prohibitive. In this paper, the application of a statistical method called racing is proposed as a general-purpose tool to reduce the computational requirements of large-scale experimental studies in evolutionary algorithms. Experimental results are presented that show that racing typically requires only a small fraction of the cost of an exhaustive experimental study.

Ontological clarity and comprehension in health data models

Conceptual modeling forms an important part of systems analysis. If this is done incorrectly or incompletely, there can be serious implications for the resultant system, specifically in terms of rework and useability. One approach to improving the conceptual modelling process is to evaluate how well the model represents reality. Emergence of the Bunge-Wand-Weber (BWW) ontological model introduced a platform to classify and compare the grammar of conceptual modelling languages. This work applies the BWW theory to a real world example in the health arena. The general practice computing group data model was developed using the Barker Entity Relationship Modelling technique. We describe an experiment, grounded in ontological theory, which evaluates how well the GPCG data model is understood by domain experts. The results show that with the exception of the use of entities to represent events, the raw model is better understood by domain experts