Generation of eigenstates using the phase-estimation algorithm

The phase estimation algorithm is so named because it allows an estimation of the eigenvalues associated with an operator. However, it has been proposed that the algorithm can also be used to generate eigenstates. Here we extend this proposal for small quantum systems, identifying the conditions under which the phase-estimation algorithm can successfully generate eigenstates. We then propose an implementation scheme based on an ion trap quantum computer. This scheme allows us to illustrate two simple examples, one in which the algorithm effectively generates eigenstates, and one in which it does not.

Lexical decision in Parkinson's disease: A reply to Brown, McDonald, and Spicer (1999)

Recent semantic priming investigations in Parkinsons disease (PD) employed variants of Neelys (1977) lexical decision paradigm to dissociate the automatic and attentional aspects of semantic activation (McDonald, Brown, Gorell, 1996; Spicer, Brown, Gorell, 1994). In our earlier review, we claimed that the results of Spicer, McDonald and colleagues normal control participants violated the two-process model of information processing (Posner Snyder, 1975) upon which their experimental paradigm had been based (Arnott Chenery, 1999). We argued that, even at the shortest SOA employed, key design modifications to Neelys original experiments biased the tasks employed by Spicer et al. and McDonald et al. towards being assessments of attention-dependent processes. Accordingly, we contended that experimental procedures did not speak to issues of automaticity and, therefore, Spicer, McDonald and colleagues claims of robust automatic semantic activation in PD must be treated with caution.

The Napster decision : implications for copyright law in the digital age

Challenges posed to copyright law in the digital age is most evident in A and M Records Inc v Napster Inc - the various court rulings indicate that Napster is likely to be held responsible for massive copyright infringement should the case come to a full trial - implications for Australian copyright law, the recording industry and individual artists - globalisation may hinder the ability of the recording industry to prevent mass copyright infringement.

A decision support process to compare Riparian revegetation options in Scheu Creek catchment in North Queensland

While riparian vegetation can play a major role in protecting land, water and natural habitat in catchments, there are high costs associated with tree planting and establishment and in diverting land from cropping. The distribution of costs and benefits of riparian revegetation creates conflicts in the objectives of various stakeholder groups. Multicriteria analysis provides an appropriate tool to evaluate alternative riparian revegetation options, and to accommodate the conflicting views of various stakeholder groups. This paper discusses an application of multicriteria analysis in an evaluation of riparian revegetation policy options for Scheu Creek, a small sub-catchment in the Johnstone River catchment in north Queensland, Australia. Clear differences are found in the rankings of revegetation options for different stakeholder groups with respect to environmental, social and economic impacts. Implementation of a revegetation option will involve considerable cost for landholders for the benefits of society. Queensland legislation does not provide a means to require farmers to implement riparian revegetation, hence the need for subsidies, tau incentives and moral suasion. (C) 2001 Academic Press.

An algorithm to predict 3 ' intron splice sites in Plasmodium falciparum genomic sequences

A new algorithm, PfAGSS, for predicting 3' splice sites in Plasmodium falciparum genomic sequences is described. Application of this program to the published P. falciparum chromosome 2 and 3 data suggests that existing programs result in a high error rate in assigning 3' intron boundaries. (C) 2001 Elsevier Science B.V. All rights reserved.

A simulated annealing algorithm for finding consensus sequences

Motivation: A consensus sequence for a family of related sequences is, as the name suggests, a sequence that captures the features common to most members of the family. Consensus sequences are important in various DNA sequencing applications and are a convenient way to characterize a family of molecules. Results: This paper describes a new algorithm for finding a consensus sequence, using the popular optimization method known as simulated annealing. Unlike the conventional approach of finding a consensus sequence by first forming a multiple sequence alignment, this algorithm searches for a sequence that minimises the sum of pairwise distances to each of the input sequences. The resulting consensus sequence can then be used to induce a multiple sequence alignment. The time required by the algorithm scales linearly with the number of input sequences and quadratically with the length of the consensus sequence. We present results demonstrating the high quality of the consensus sequences and alignments produced by the new algorithm. For comparison, we also present similar results obtained using ClustalW. The new algorithm outperforms ClustalW in many cases.