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.

Host selection and utilisation of Sonchus oleraceus (Asteraceae) by Helicoverpa armigera (Lepidoptera : Noctuidae): A genetic analysis

The cotton bollworm (Helicoverpa armigera) prefers the common sowthistle (Sonchus oleraceus L.) to cotton (Gossypium hirsutum L.), sorghum (Sorghum bicolor L.) and maize (Zea mays L.) for oviposition in the field in Australia. Using the common sowthistle and cotton as host plants, we carried out this study to evaluate genetic variation in both oviposition preference and larval growth and genetic correlation between maternal preference and larval performance. There was a significant genetic component of phenotypic variation in both characters, and the heritability of oviposition preference was estimated as 0.602. Helicoverpa armigera larvae survived slightly better and grew significantly faster on common sowthistle than on cotton, but genetic correlation between maternal preference and larval growth performance was not detectable. Instead, larval growth performance on the two hosts changed with families, which renders the interaction between family and host plant significant. As a result, the genetic correlation between mean values of larval growth across the two host species was not different from zero. These results are discussed in the context of the relationship between H. armigera and the common sowthistle and the polyphagous behaviour of this insect in general.

Host selection in phytophagous insects: a new explanation for learning in adults

Insect learning can change the preferences an egg laying female displays towards different host plant species. Current hypotheses propose that learning may be advantageous in adult host selection behaviour through improved recognition, accuracy or selectivity in foraging. In this paper, we present a hypothesis for when learning can be advantageous without such improvements in adult host foraging. Specifically, that learning can be an advantageous strategy for egg laying females when larvae must feed on more than one plant in order to complete development, if the fitness of larvae is reduced when they switch to a different host species. Here, larvae benefit from developing on the most abundant host species, which is the most likely choice of host for an adult insect which increases its preference for a host species through learning. The hypothesis is formalised with a mathematical model and we provide evidence from studies on the behavioural ecology, of a number of insect species which demonstrate that the assumptions of this hypothesis may frequently be fulfilled in nature. We discuss how multiple mechanisms may convey advantages in insect learning and that benefits to larval development, which have so far been overlooked, should be considered in explanations for the widespread occurrence of learning.

Genotype-by-management interactions for grain yield and grain protein concentration of wheat

The magnitude of genotype-by-management (G x M) interactions for grain yield and grain protein concentration was examined in a multi-environment trial (MET) involving a diverse set of 272 advanced breeding lines from the Queensland wheat breeding program. The MET was structured as a series of management-regimes imposed at 3 sites for 2 years. The management-regimes were generated at each site-year as separate trials in which planting time, N fertiliser application rate, cropping history, and irrigation were manipulated. irrigation was used to simulate different rainfall regimes. From the combined analysis of variance, the G x M interaction variance components were found to be the largest source of G x E interaction variation for both grain yield (0.117 +/- 0.005 t(2) ha(-2); 49% of total G x E 0.238 +/- 0.028 t(2) ha(-2)) and grain protein concentration (0.445 +/- 0.020%(2); 82% of total G x E 0.546 +/- 0.057%(2)), and in both cases this source of variation was larger than the genotypic variance component (grain yield 0.068 +/- 0.014 t(2) ha(-2) and grain protein 0.203 +/- 0.026%(2)). The genotypic correlation between the traits varied considerably with management-regime, ranging from -0.98 to -0.31, with an estimate of 0.0 for one trial. Pattern analysis identified advanced breeding lines with improved grain yield and grain protein concentration relative to the cultivars Hartog, Sunco and Meteor. It is likely that a large component of the previously documented G x E interactions for grain yield of wheat in the northern grains region are in part a result of G x M interactions. The implications of the strong influence of G x M interactions for the conduct of wheat breeding METs in the northern region are discussed. (C) 2001 Elsevier Science B.V. All rights reserved.

Materialized view selection under the maintenance time constraint

A data warehouse is a data repository which collects and maintains a large amount of data from multiple distributed, autonomous and possibly heterogeneous data sources. Often the data is stored in the form of materialized views in order to provide fast access to the integrated data. One of the most important decisions in designing a data warehouse is the selection of views for materialization. The objective is to select an appropriate set of views that minimizes the total query response time with the constraint that the total maintenance time for these materialized views is within a given bound. This view selection problem is totally different from the view selection problem under the disk space constraint. In this paper the view selection problem under the maintenance time constraint is investigated. Two efficient, heuristic algorithms for the problem are proposed. The key to devising the proposed algorithms is to define good heuristic functions and to reduce the problem to some well-solved optimization problems. As a result, an approximate solution of the known optimization problem will give a feasible solution of the original problem. (C) 2001 Elsevier Science B.V. All rights reserved.

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 mixture model-based approach to the clustering of microarray expression data

Motivation: This paper introduces the software EMMIX-GENE that has been developed for the specific purpose of a model-based approach to the clustering of microarray expression data, in particular, of tissue samples on a very large number of genes. The latter is a nonstandard problem in parametric cluster analysis because the dimension of the feature space (the number of genes) is typically much greater than the number of tissues. A feasible approach is provided by first selecting a subset of the genes relevant for the clustering of the tissue samples by fitting mixtures of t distributions to rank the genes in order of increasing size of the likelihood ratio statistic for the test of one versus two components in the mixture model. The imposition of a threshold on the likelihood ratio statistic used in conjunction with a threshold on the size of a cluster allows the selection of a relevant set of genes. However, even this reduced set of genes will usually be too large for a normal mixture model to be fitted directly to the tissues, and so the use of mixtures of factor analyzers is exploited to reduce effectively the dimension of the feature space of genes. Results: The usefulness of the EMMIX-GENE approach for the clustering of tissue samples is demonstrated on two well-known data sets on colon and leukaemia tissues. For both data sets, relevant subsets of the genes are able to be selected that reveal interesting clusterings of the tissues that are either consistent with the external classification of the tissues or with background and biological knowledge of these sets.

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.

A decision support system for selecting sanitation systems in developing countries

Due to the socio-economic inhomogeneity of communities in developing countries, the selection of sanitation systems is a complex task. To assist planners and communities in assessing the suitability of alternatives, the decision support system SANEX™ was developed. SANEX™ evaluates alternatives in two steps. First, Conjunctive Elimination, based on 20 mainly technical criteria, is used to screen feasible alternatives. Subsequently, a model derived from Multiattribute Utility Technique (MAUT) uses technical, socio-cultural and institutional criteria to compare the remaining alternatives with regard to their implementability and sustainability. This paper presents the SANEX™ algorithm, examples of its application in practice, and results obtained from field testing.