Time evolution in the unimolecular master equation at low temperatures: full spectral solution with scalable iterative methods and high precision

A new method is presented to determine an accurate eigendecomposition of difficult low temperature unimolecular master equation problems. Based on a generalisation of the Nesbet method, the new method is capable of achieving complete spectral resolution of the master equation matrix with relative accuracy in the eigenvectors. The method is applied to a test case of the decomposition of ethane at 300 K from a microcanonical initial population with energy transfer modelled by both Ergodic Collision Theory and the exponential-down model. The fact that quadruple precision (16-byte) arithmetic is required irrespective of the eigensolution method used is demonstrated. (C) 2001 Elsevier Science B.V. All rights reserved.

Lanczos subspace filter diagonalization: Homogeneous recursive filtering and a low-storage method for the calculation of matrix elements

We develop a new iterative filter diagonalization (FD) scheme based on Lanczos subspaces and demonstrate its application to the calculation of bound-state and resonance eigenvalues. The new scheme combines the Lanczos three-term vector recursion for the generation of a tridiagonal representation of the Hamiltonian with a three-term scalar recursion to generate filtered states within the Lanczos representation. Eigenstates in the energy windows of interest can then be obtained by solving a small generalized eigenvalue problem in the subspace spanned by the filtered states. The scalar filtering recursion is based on the homogeneous eigenvalue equation of the tridiagonal representation of the Hamiltonian, and is simpler and more efficient than our previous quasi-minimum-residual filter diagonalization (QMRFD) scheme (H. G. Yu and S. C. Smith, Chem. Phys. Lett., 1998, 283, 69), which was based on solving for the action of the Green operator via an inhomogeneous equation. A low-storage method for the construction of Hamiltonian and overlap matrix elements in the filtered-basis representation is devised, in which contributions to the matrix elements are computed simultaneously as the recursion proceeds, allowing coefficients of the filtered states to be discarded once their contribution has been evaluated. Application to the HO2 system shows that the new scheme is highly efficient and can generate eigenvalues with the same numerical accuracy as the basic Lanczos algorithm.

The point-of-referral barrier - a factor in the success of telehealth

A feasibility study was carried out to test the hypothesis that, for an effective telehealth service, a full-time coordinator is required to act as a single point of contact for consultation requests. By shifting the responsibility for telepaediatrics from the referrer to the provider, the telehealth process becomes equally (or more) attractive as the conventional alternative. Preliminary results showed that, within six months, telepaediatric activity increased to an average of 8 h per month. Not only did certain health services become more accessible to children and their families in remote areas of Queensland, but significant savings were also made. At least 12 patient transfers were avoided to and from the tertiary facility, with an estimated minimum saving of $18,000 to the health-care provider.

Resolution of natural groups using iterative assignment tests: an example from two species of Australian native rats (Rattus)

Sympatric individuals of Rattus fuscipes and Rattus leucopus, two Australian native rats from the tropical wet forests of north Queensland, are difficult to distinguish morphologically and are often confused in the field. When we started a study on fine-scale movements of these species, using microsatellite markers, we found that the species as identified in the field did not form coherent genetic groups. In this study, we examined the potential of an iterative process of genetic assignment to separate specimens from distinct (e.g. species, populations) natural groups. Five loci with extensive overlap in allele distributions between species were used for the iterative process. Samples were randomly distributed into two starting groups of equal size and then subjected to the test. At each iteration, misassigned samples switched groups, and the output groups from a given round of assignment formed the input groups for the next round. All samples were assigned correctly on the 10th iteration, in which two genetic groups were clearly separated. Mitochondrial DNA sequences were obtained from samples from each genetic group identified by assignment, together with those of museum voucher specimens, to assess which species corresponded to which genetic group. The iterative procedure was also used to resolve groups within species, adequately separating the genetically identified R. leucopus from our two sampling sites. These results show that the iterative assignment process can correctly differentiate samples into their appropriate natural groups when diagnostic genetic markers are not available, which allowed us to resolve accurately the two R. leucopus and R. fuscipes species. Our approach provides an analytical tool that may be applicable to a broad variety of situations where genetic groups need to be resolved.

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.

Impact of point source pollution on nitrogen isotope signatures (delta N-15) of vegetation in SE Brazil

This study presents novel evidence that N-15 natural abundance can be used as a robust indicator to detect pollutant nitrogen in natural plant communities. Vegetation from the heavily polluted industrial area of Cubatao in Sao Paulo State, SE Brazil, was strongly N-15 depleted compared to plants at remote sites. Historic herbarium samples from Cubatao were significantly less N-15 depleted than extant plants, indicating that N-15 depletion of vegetation is associated with present-day nitrogen pollution in Cubatao. The heavy load of nitrogenous atmospheric pollutants in Cubatao provides a nitrogen source for plants, and strongly N-15 depleted air NH3 is likely to contribute to plant and soil N-15 depletion. Epiphytic plants from Cubatao were extremely N-15 depleted (average -10.9parts per thousand) contrasting with epiphytes at remote sites (averages -1.0parts per thousand and -3.0parts per thousand). Nitrogen isotope composition of vegetation provides a tool to determine input of pollutant nitrogen into plant communities. The strong isotopic change of epiphytes suggests that epiphytes are particularly sensitive biomonitors for atmospheric pollutant nitrogen.

A hedging point strategy - balancing effluent quality, economy and robustness in the control of wastewater treatment plants

An operational space map is an efficient tool to compare a large number of operational strategies to find an optimal choice of setpoints based on a multicriterion. Typically, such a multicriterion includes a weighted sum of cost of operation and effluent quality. Due to the relative high cost of aeration such a definition of optimality result in a relatively high fraction of the effluent total nitrogen in the form of ammonium. Such a strategy may however introduce a risk into operation because a low degree of ammonium removal leads to a low amount of nitrifiers. This in turn leads to a reduced ability to reject event disturbances, such as large variations in the ammonium load, drop in temperature, the presence of toxic/inhibitory compounds in the influent etc. Hedging is a risk minimisation tool, with the aim to "reduce one's risk of loss on a bet or speculation by compensating transactions on the other side" (The Concise Oxford Dictionary (1995)). In wastewater treatment plant operation hedging can be applied by choosing a higher level of ammonium removal to increase the amount of nitrifiers. This is a sensible way to introduce disturbance rejection ability into the multi criterion. In practice, this is done by deciding upon an internal effluent ammonium criterion. In some countries such as Germany, a separate criterion already applies to the level of ammonium in the effluent. However, in most countries the effluent criterion applies to total nitrogen only. In these cases, an internal effluent ammonium criterion should be selected in order to secure proper disturbance rejection ability.

Fixed point theorems of upper semicontinuous multivalued mappings with applications in hyperconvex metric spaces

In the present paper, we establish two fixed point theorems for upper semicontinuous multivalued mappings in hyperconvex metric spaces and apply these to study coincidence point problems and minimax problems. (C) 2002 Elsevier Science (USA). All rights reserved.

A monolithic smoothing-gap algorithm for contact-impact based on the signed distance function

A new algorithm has been developed for smoothing the surfaces in finite element formulations of contact-impact. A key feature of this method is that the smoothing is done implicitly by constructing smooth signed distance functions for the bodies. These functions are then employed for the computation of the gap and other variables needed for implementation of contact-impact. The smoothed signed distance functions are constructed by a moving least-squares approximation with a polynomial basis. Results show that when nodes are placed on a surface, the surface can be reproduced with an error of about one per cent or less with either a quadratic or a linear basis. With a quadratic basis, the method exactly reproduces a circle or a sphere even for coarse meshes. Results are presented for contact problems involving the contact of circular bodies. Copyright (C) 2002 John Wiley Sons, Ltd.