Pool deck, C House, Coorparoo, Brisbane

View back towards house from deck. with Iwan (right) and filter room (left).

Pool deck, C House, Coorparoo, Brisbane

View towards house from pool deck. Iwan on right and stone clad filter room on left.

Pool deck, C House, Coorparoo, Brisbane

View of pool and deck with Iwan (left) and filter room (right).

Stone wall, C House, Coorparoo, Brisbane

Stone clad wall to filter room beside pool deck.

Fault-tolerant quantum computation with cluster states

The one-way quantum computing model introduced by Raussendorf and Briegel [Phys. Rev. Lett. 86, 5188 (2001)] shows that it is possible to quantum compute using only a fixed entangled resource known as a cluster state, and adaptive single-qubit measurements. This model is the basis for several practical proposals for quantum computation, including a promising proposal for optical quantum computation based on cluster states [M. A. Nielsen, Phys. Rev. Lett. (to be published), quant-ph/0402005]. A significant open question is whether such proposals are scalable in the presence of physically realistic noise. In this paper we prove two threshold theorems which show that scalable fault-tolerant quantum computation may be achieved in implementations based on cluster states, provided the noise in the implementations is below some constant threshold value. Our first threshold theorem applies to a class of implementations in which entangling gates are applied deterministically, but with a small amount of noise. We expect this threshold to be applicable in a wide variety of physical systems. Our second threshold theorem is specifically adapted to proposals such as the optical cluster-state proposal, in which nondeterministic entangling gates are used. A critical technical component of our proofs is two powerful theorems which relate the properties of noisy unitary operations restricted to act on a subspace of state space to extensions of those operations acting on the entire state space. We expect these theorems to have a variety of applications in other areas of quantum-information science.

XSophe-Sophe-XeprView (R). A computer simulation software suite (v. 1.1.3) for the analysis of continuous wave EPR spectra

The XSophe-Sophe-XeprView((R)) computer simulation software suite enables scientists to easily determine spin Hamiltonian parameters from isotropic, randomly oriented and single crystal continuous wave electron paramagnetic resonance (CW EPR) spectra from radicals and isolated paramagnetic metal ion centers or clusters found in metalloproteins, chemical systems and materials science. XSophe provides an X-windows graphical user interface to the Sophe programme and allows: creation of multiple input files, local and remote execution of Sophe, the display of sophelog (output from Sophe) and input parameters/files. Sophe is a sophisticated computer simulation software programme employing a number of innovative technologies including; the Sydney OPera HousE (SOPHE) partition and interpolation schemes, a field segmentation algorithm, the mosaic misorientation linewidth model, parallelization and spectral optimisation. In conjunction with the SOPHE partition scheme and the field segmentation algorithm, the SOPHE interpolation scheme and the mosaic misorientation linewidth model greatly increase the speed of simulations for most spin systems. Employing brute force matrix diagonalization in the simulation of an EPR spectrum from a high spin Cr(III) complex with the spin Hamiltonian parameters g(e) = 2.00, D = 0.10 cm(-1), E/D = 0.25, A(x) = 120.0, A(y) = 120.0, A(z) = 240.0 x 10(-4) cm(-1) requires a SOPHE grid size of N = 400 (to produce a good signal to noise ratio) and takes 229.47 s. In contrast the use of either the SOPHE interpolation scheme or the mosaic misorientation linewidth model requires a SOPHE grid size of only N = 18 and takes 44.08 and 0.79 s, respectively. Results from Sophe are transferred via the Common Object Request Broker Architecture (CORBA) to XSophe and subsequently to XeprView((R)) where the simulated CW EPR spectra (1D and 2D) can be compared to the experimental spectra. Energy level diagrams, transition roadmaps and transition surfaces aid the interpretation of complicated randomly oriented CW EPR spectra and can be viewed with a web browser and an OpenInventor scene graph viewer.

Multicomponent reversible reactions inside a porous catalyst pellet

This work deals with a solution method to handle multicomponents reversible reactions occurring inside a porous catalyst pellet. The complexity of this problem arises from the fact that the effective diffusivities and Biot number, which characterizes the external mass transfer, are different for each chemical species. In mathematical terms, this means that each chemical species has its own subspace and, therefore, when the technique of finite integral transform is applied to solve this multicomponent problem, each chemical species is associated with its own integral transform kernel. The analytical solutions obtained for this problem are compact and simple for any further manipulation. Application of this result to the catalytic reforming of C7 hydrocarbon system is shown in this paper.

Data partitioning for parallel spatial join processing

The cost of spatial join processing can be very high because of the large sizes of spatial objects and the computation-intensive spatial operations. While parallel processing seems a natural solution to this problem, it is not clear how spatial data can be partitioned for this purpose. Various spatial data partitioning methods are examined in this paper. A framework combining the data-partitioning techniques used by most parallel join algorithms in relational databases and the filter-and-refine strategy for spatial operation processing is proposed for parallel spatial join processing. Object duplication caused by multi-assignment in spatial data partitioning can result in extra CPU cost as well as extra communication cost. We find that the key to overcome this problem is to preserve spatial locality in task decomposition. We show in this paper that a near-optimal speedup can be achieved for parallel spatial join processing using our new algorithms.

Expokit: A software package for computing matrix exponentials

Expokit provides a set of routines aimed at computing matrix exponentials. More precisely, it computes either a small matrix exponential in full, the action of a large sparse matrix exponential on an operand vector, or the solution of a system of linear ODEs with constant inhomogeneity. The backbone of the sparse routines consists of matrix-free Krylov subspace projection methods (Arnoldi and Lanczos processes), and that is why the toolkit is capable of coping with sparse matrices of large dimension. The software handles real and complex matrices and provides specific routines for symmetric and Hermitian matrices. The computation of matrix exponentials is a numerical issue of critical importance in the area of Markov chains and furthermore, the computed solution is subject to probabilistic constraints. In addition to addressing general matrix exponentials, a distinct attention is assigned to the computation of transient states of Markov chains.

A numerical study of large sparse matrix exponentials arising in Markov chains

Krylov subspace techniques have been shown to yield robust methods for the numerical computation of large sparse matrix exponentials and especially the transient solutions of Markov Chains. The attractiveness of these methods results from the fact that they allow us to compute the action of a matrix exponential operator on an operand vector without having to compute, explicitly, the matrix exponential in isolation. In this paper we compare a Krylov-based method with some of the current approaches used for computing transient solutions of Markov chains. After a brief synthesis of the features of the methods used, wide-ranging numerical comparisons are performed on a power challenge array supercomputer on three different models. (C) 1999 Elsevier Science B.V. All rights reserved.AMS Classification: 65F99; 65L05; 65U05.

Role of chemical cues from cotton in mediating host selection and oviposition behaviour in Helicoverpa armigera (Hubner) (Lepidoptera : Noctuidae)

We investigated the role of chemoreception in the host selection and oviposition behaviour of Helicoverpa armigera in the laboratory using five cotton genotypes and synthetic volatile terpenes. Female moths oviposited on substrates treated with methanol, ethanol, acetone and pentane extracts of leaves, squares and flowers of the cotton genotypes. Phytochemicals soluble in pentane were the most efficient in eliciting oviposition behaviour. In a two-way bioassay, pentane extracts of leaves or squares of a Multiple Host-plant Resistance genotype (MHR11), Deltapine commercial (DP90), and Smith Red Leaf (SRL) received significantly more eggs than solvent-treated controls. Extracts of squares of the native genotype Gossypium nelsonii did not receive more eggs. Females preferred DP90 and MHR11 to SRL and G. nelsonii. Female moths also laid more eggs on pentane extracts of MHR11 flowers than MHR11 leaves from preflowering, early flowering and peak-flowering plants. In a flight chamber, female moths used olfactory cues at short range to mediate oviposition and discrimination between host plants. Egg-laying, mated females were attracted at a distance (1.5 m) to volatile compounds released by whole plants and odours emanating from filter papers treated with synthetic volatile terpenes. Individually, the terpenes did not stimulate any significant oviposition response. However, there was a significant oviposition response to a mixture of equal volumes of the terpenes (trans-beta-caryophyllene, alpha-pinene, beta-pinene, myrcene, beta-bisabolol, and alpha-humulene). Conversely, antennectomised (moths with transected antennae), egg-laying, mated females did not stimulate any significant oviposition response. The significance of these findings in relation to H. armigera hostplant selection are discussed.

A protocol for the fluorometric quantification of mGFP5-ER and sGFP(S65T) in transgenic plants

The Green Fluorescent Protein (GFP) from Aequorea victor-in has begun to be used as a reporter protein in plants. It is particularly useful as GFP fluorescence can be detected in a non-destructive manner, whereas detection of enzyme-based reporters often requires destruction of the plant tissue. The use of GFP as a reporter enables transgenic plant tissues to be screened in vivo at any growth stage. Quantification of GFP in transgenic plant extracts will increase the utility of GFP as a reporter protein. We report herein the quantification of a mGFP5-ER Variant in tobacco leaf extracts by UV excitation and a sGFP(S65T) variant in sugarcane leaf and callus extracts by blue light excitation using the BioRad VersaFluor(TM) Fluorometer System or the Labsystems Fluoroskan Ascent FL equipped with a narrow band emission filter (510 +/- 5 nm). The GFP concentration in transgenic plant extracts was determined from a GFP-standard series prepared in untransformed plant extract with concentrations ranging from 0.1 to 4 mu g/ml of purified rGFP. Levels of sgfp(S65T) expression, driven by the maize ubiquitin promoter, in sugarcane calli and leaves ranged up to 0.525 mu g and 2.11 mu g sGFP(S65T) per mg of extractable protein respectively. In tobacco leaves the expression of mgfPS-ER, driven by the cauliflower mosaic virus (CaMV) 35S promoter, ranged up to 7.05 mu g mGFP5-ER per mg extractable protein.

The advantages of theft over toil: The design inference and arguing from ignorance

Intelligent design theorist William Dembski has proposed an explanatory filter for distinguishing between events due to chance, lawful regularity or design. We show that if Dembski's filter were adopted as a scientific heuristic, some classical developments in science would not be rational, and that Dembski's assertion that the filter reliably identifies rarefied design requires ignoring the state of background knowledge. If background information changes even slightly, the filter's conclusion will vary wildly. Dembski fails to overcome Hume's objections to arguments from design.

Model for gas-liquid flow through wet porous medium

A method involving bubbling of air through a fibrous filter immersed in water has recently been investigated (Agranovski et al. [1]). Experimental results showed that the removal efficiency for ultra-fine aerosols by such filters was greatly increased compared to dry filters. Nuclear Magnetic Resonance (NMR) imaging was used to examine the wet filter and to determine the nature of the gas flow inside the filter (Agranovski et al. [2]). It was found that tortuous preferential pathways (or flow tubes) develop within the filter through which the air flows and the distribution of air and water inside the porous medium has been investigated. The aim of this paper is to investigate the geometry of the pathways and to make estimates of the flow velocities and particle removal efficiency in such pathways. A mathematical model of the flow of air along the preferred pathways has been developed and verified experimentally. Even for the highest realistic gas velocity the flow field was essentially laminar (Re approximate to 250). We solved Laplace's equation for stream function to map trajectories of particles and gas molecules to investigate the possibility of their removal from the carrier.

The q-deformed supersymmetric t-J model with a boundary

The q-deformed supersymmetric t-J model on a semi-infinite lattice is diagonalized by using the level-one vertex operators of the quantum affine superalgebra U-q[sl(2\1)]. We. give the bosonization of the boundary states. We give an integral expression for the correlation functions of the boundary model, and derive the difference equations which they satisfy.