Screen to verandah, Sunshine Coast University Library, Maroochydore

View of steel-framed timber screen to verandah.

Second floor reading area interior, Sunshine Coast University Library, Maroochydore

View of second floor reading area with rigid frames and air-conditioning ducting.

South-east elevation, Sunshine Coast University Library, Maroochydore

View to south-east elevation as seen from exterior.

North-west elevation, Sunshine Coast University Library, Maroochydore

North-west elevation as seen from Building K.

Entrance elevation, Sunshine Coast University Library, Maroochydore

View to entrance verandah on north-east elevation and sunshades to north-west elevation.

Fast evolution strategies

Evolution strategies are a class of general optimisation algorithms which are applicable to functions that are multimodal, nondifferentiable, or even discontinuous. Although recombination operators have been introduced into evolution strategies, the primary search operator is still mutation. Classical evolution strategies rely on Gaussian mutations. A new mutation operator based on the Cauchy distribution is proposed in this paper. It is shown empirically that the new evolution strategy based on Cauchy mutation outperforms the classical evolution strategy on most of the 23 benchmark problems tested in this paper. The paper also shows empirically that changing the order of mutating the objective variables and mutating the strategy parameters does not alter the previous conclusion significantly, and that Cauchy mutations with different scaling parameters still outperform the Gaussian mutation with self-adaptation. However, the advantage of Cauchy mutations disappears when recombination is used in evolution strategies. It is argued that the search step size plays an important role in determining evolution strategies' performance. The large step size of recombination plays a similar role as Cauchy mutation.

A novel method for selection of chymotrypsin inhibitors from a phage peptide library

A novel screening strategy has been developed for the identification of alpha-chymotrypsin inhibitors from a phage peptide library. In this strategy, the standard affinity selection protocol was modified by adding a proteolytic cleavage period to avoid recovery of alpha-chymotrypsin substrates. After four cycles of selection and further activity assay, a group of related peptides were identified by DNA sequencing. These peptides share a consensus sequence motif as (S/T)RVPR(R/H). Then, a corresponding short peptide (Ac-ASRVPRRG-NH2) was synthesized chemically and proved to be an inhibitor of alpha-chymotrypsin. The present work provides a useful way for searching proteinase inhibitors without detailed knowledge of the molecular structure.

Practical parallel coset enumeration

Coset enumeration is a most important procedure for investigating finitely presented groups. We present a practical parallel procedure for coset enumeration on shared memory processors. The shared memory architecture is particularly interesting because such parallel computation is both faster and cheaper. The lower cost comes when the program requires large amounts of memory, and additional CPU's. allow us to lower the time that the expensive memory is being used. Rather than report on a suite of test cases, we take a single, typical case, and analyze the performance factors in-depth. The parallelization is achieved through a master-slave architecture. This results in an interesting phenomenon, whereby the CPU time is divided into a sequential and a parallel portion, and the parallel part demonstrates a speedup that is linear in the number of processors. We describe an early version for which only 40% of the program was parallelized, and we describe how this was modified to achieve 90% parallelization while using 15 slave processors and a master. In the latter case, a sequential time of 158 seconds was reduced to 29 seconds using 15 slaves.

Minimum-order stable recursive filter design via the genetic algorithm approach

In this paper, the minimum-order stable recursive filter design problem is proposed and investigated. This problem is playing an important role in pipeline implementation sin signal processing. Here, the existence of a high-order stable recursive filter is proved theoretically, in which the upper bound for the highest order of stable filters is given. Then the minimum-order stable linear predictor is obtained via solving an optimization problem. In this paper, the popular genetic algorithm approach is adopted since it is a heuristic probabilistic optimization technique and has been widely used in engineering designs. Finally, an illustrative example is sued to show the effectiveness of the proposed algorithm.

Visualization of learning in multilayer perceptron networks using principal component analysis

This paper is concerned with the use of scientific visualization methods for the analysis of feedforward neural networks (NNs). Inevitably, the kinds of data associated with the design and implementation of neural networks are of very high dimensionality, presenting a major challenge for visualization. A method is described using the well-known statistical technique of principal component analysis (PCA). This is found to be an effective and useful method of visualizing the learning trajectories of many learning algorithms such as back-propagation and can also be used to provide insight into the learning process and the nature of the error surface.