Sampling phylogenetic tree space with the generalized Gibbs sampler

The generalized Gibbs sampler (GGS) is a recently developed Markov chain Monte Carlo (MCMC) technique that enables Gibbs-like sampling of state spaces that lack a convenient representation in terms of a fixed coordinate system. This paper describes a new sampler, called the tree sampler, which uses the GGS to sample from a state space consisting of phylogenetic trees. The tree sampler is useful for a wide range of phylogenetic applications, including Bayesian, maximum likelihood, and maximum parsimony methods. A fast new algorithm to search for a maximum parsimony phylogeny is presented, using the tree sampler in the context of simulated annealing. The mathematics underlying the algorithm is explained and its time complexity is analyzed. The method is tested on two large data sets consisting of 123 sequences and 500 sequences, respectively. The new algorithm is shown to compare very favorably in terms of speed and accuracy to the program DNAPARS from the PHYLIP package.

The structure of quantum Lie algebras for the classical series, B-l, C-l and D-l

The structure constants of quantum Lie algebras depend on a quantum deformation parameter q and they reduce to the classical structure constants of a Lie algebra at q = 1. We explain the relationship between the structure constants of quantum Lie algebras and quantum Clebsch-Gordan coefficients for adjoint x adjoint --> adjoint We present a practical method for the determination of these quantum Clebsch-Gordan coefficients and are thus able to give explicit expressions for the structure constants of the quantum Lie algebras associated to the classical Lie algebras B-l, C-l and D-l. In the quantum case the structure constants of the Cartan subalgebra are non-zero and we observe that they are determined in terms of the simple quantum roots. We introduce an invariant Killing form on the quantum Lie algebras and find that it takes values which are simple q-deformations of the classical ones.

A study of the stability of subcycling algorithms in structural dynamics

Algorithms for explicit integration of structural dynamics problems with multiple time steps (subcycling) are investigated. Only one such algorithm, due to Smolinski and Sleith has proved to be stable in a classical sense. A simplified version of this algorithm that retains its stability is presented. However, as with the original version, it can be shown to sacrifice accuracy to achieve stability. Another algorithm in use is shown to be only statistically stable, in that a probability of stability can be assigned if appropriate time step limits are observed. This probability improves rapidly with the number of degrees of freedom in a finite element model. The stability problems are shown to be a property of the central difference method itself, which is modified to give the subcycling algorithm. A related problem is shown to arise when a constraint equation in time is introduced into a time-continuous space-time finite element model. (C) 1998 Elsevier Science S.A.

A consistent point-searching algorithm for solution interpolation in unstructured meshes consisting of 4-node bilinear quadrilateral elements

To translate and transfer solution data between two totally different meshes (i.e. mesh 1 and mesh 2), a consistent point-searching algorithm for solution interpolation in unstructured meshes consisting of 4-node bilinear quadrilateral elements is presented in this paper. The proposed algorithm has the following significant advantages: (1) The use of a point-searching strategy allows a point in one mesh to be accurately related to an element (containing this point) in another mesh. Thus, to translate/transfer the solution of any particular point from mesh 2 td mesh 1, only one element in mesh 2 needs to be inversely mapped. This certainly minimizes the number of elements, to which the inverse mapping is applied. In this regard, the present algorithm is very effective and efficient. (2) Analytical solutions to the local co ordinates of any point in a four-node quadrilateral element, which are derived in a rigorous mathematical manner in the context of this paper, make it possible to carry out an inverse mapping process very effectively and efficiently. (3) The use of consistent interpolation enables the interpolated solution to be compatible with an original solution and, therefore guarantees the interpolated solution of extremely high accuracy. After the mathematical formulations of the algorithm are presented, the algorithm is tested and validated through a challenging problem. The related results from the test problem have demonstrated the generality, accuracy, effectiveness, efficiency and robustness of the proposed consistent point-searching algorithm. Copyright (C) 1999 John Wiley & Sons, Ltd.

The plasma membrane calcium pump, its role and regulation: New complexities and possibilities

Significant progress has been achieved in elucidating the role of the plasma membrane Ca2+-ATPase in cellular Ca2+ homeostasis and physiology since the enzyme was first purified and physiology since the enzyme was first purified and cloned a number of years ago. The simple notion that the PM Ca2+-ATPase controls resting levels of [Ca2+](CYT) has been challenged by the complexity arising from the finding of four major isoforms and splice variants of the Ca2+ pump, and the finding that these are differentially localized in various organs and subcellular regions. Furthermore, the isoforms exhibit differential sensitivities to Ca2+, calmodulin, ATP, and kinase-mediated phosphorylation. The latter pathways of regulation can give rise to activation or inhibition of the Ca2+ pump activity, depending on the kinase and the particular Ca2+ pump isoform. Significant progress is being made in elucidating subtle and more profound roles of the PM Ca2+-ATPase in the control of cellular function. Further understanding of these roles awaits new studies in both transfected cells and intact organelles, a process that will be greatly aided by the development of new and selective Ca2+ pump inhibitors. (C) 1999 Elsevier Science Inc.

Robust Mixture Modelling Using the t Distribution

Normal mixture models are being increasingly used to model the distributions of a wide variety of random phenomena and to cluster sets of continuous multivariate data. However, for a set of data containing a group or groups of observations with longer than normal tails or atypical observations, the use of normal components may unduly affect the fit of the mixture model. In this paper, we consider a more robust approach by modelling the data by a mixture of t distributions. The use of the ECM algorithm to fit this t mixture model is described and examples of its use are given in the context of clustering multivariate data in the presence of atypical observations in the form of background noise.

Semiquantum versus semiclassical mechanics for simple nonlinear systems

Quantum mechanics has been formulated in phase space, with the Wigner function as the representative of the quantum density operator, and classical mechanics has been formulated in Hilbert space, with the Groenewold operator as the representative of the classical Liouville density function. Semiclassical approximations to the quantum evolution of the Wigner function have been defined, enabling the quantum evolution to be approached from a classical starting point. Now analogous semiquantum approximations to the classical evolution of the Groenewold operator are defined, enabling the classical evolution to be approached from a quantum starting point. Simple nonlinear systems with one degree of freedom are considered, whose Hamiltonians are polynomials in the Hamiltonian of the simple harmonic oscillator. The behavior of expectation values of simple observables and of eigenvalues of the Groenewold operator are calculated numerically and compared for the various semiclassical and semiquantum approximations.

The intersection problem for K_4-e designs

A G-design of order n is a pair (P,B) where P is the vertex set of the complete graph K-n and B is an edge-disjoint decomposition of K-n into copies of the simple graph G. Following design terminology, we call these copies ''blocks''. Here K-4 - e denotes the complete graph K-4 with one edge removed. It is well-known that a K-4 - e design of order n exists if and only if n = 0 or 1 (mod 5), n greater than or equal to 6. The intersection problem here asks for which k is it possible to find two K-4 - e designs (P,B-1) and (P,B-2) of order n, with \B-1 boolean AND B-2\ = k, that is, with precisely k common blocks. Here we completely solve this intersection problem for K-4 - e designs.

Visualising the activity of the cystine-glutamate antiporter in glial cells using antibodies to aminoadipic acid, a selectively transported substrate

The cystine-glutamate antiporter is a transport system that facilitates the uptake of cystine, concomitant with the release of glutamate. The cystine accumulated by this transporter is generally considered for use in the formation of the cysteine-containing antioxidant glutathione, which is abundant in many glial cells. This study used the simple strategy of generating an antibody to aminoadipic acid, a selective substrate for the cystine-glutamate antiporter. Stereospecific accumulation of aminoadipic acid into specific cell types in rat brain slice preparations was detected immunocytochemically. Strong accumulation was detected in astroglial cells in all brain regions studied including those in white matter tracts. Strong accumulation into radial glial cells, including the retinal Muller cells and the Bergmann glial cells was also observed. Glial accumulation was observed not only in cells within the blood brain barrier, but also outside such; anterior pituitary folliculostellate cell and intermediate lobe pituitary glial cells exhibited strong accumulation of aminoadipic acid. Interestingly, some glial cells such as the posterior pituitary glial cells (pituicytes) exhibited very little if any accumulation of aminoadipic acid. Within the brain labelling was not uniform. Particularly strong labelling was noted in some regions, such as the glial cells surrounding the CA1 pyramidal cells. By contrast, neurons never exhibited uptake of aminoadipic acid. Because cystine uptake is associated with glutamate release, it is suggested that this antiporter might contribute to release of glutamate from glial cells under some pathophysiological conditions. (C) 2001 Wiley-Liss, Inc.

Cavity QED analog of the harmonic-oscillator probability distribution function and quantum collapses

We establish a connection between the simple harmonic oscillator and a two-level atom interacting with resonant, quantized cavity and strong driving fields, which suggests an experiment to measure the harmonic-oscillator's probability distribution function. To achieve this, we calculate the Autler-Townes spectrum by coupling the system to a third level. We find that there are two different regions of the atomic dynamics depending on the ratio of the: Rabi frequency Omega (c) of the cavity field to that of the Rabi frequency Omega of the driving field. For Omega (c)

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.

Efficient simple groups

We prove that the simple group L-3(5) which has order 372000 is efficient by providing an efficient presentation for it. This leaves one simple group with order less than one million, S-4(4) which has order 979200, whose efficiency or otherwise remains to be determined.

Evaluation of various pre-treatments for the dehydration of banana and selection of suitable drying models

The thin-layer drying behaviour of bananas in a beat pump dehumidifier dryer was examined. Four pre-treatments (blanching, chilling, freezing and combined blanching and freezing) were applied to the bananas, which were dried at 50 degreesC with an air velocity of 3.1 m s(-1) and with the relative humidity of the inlet air of 10-35%. Three drying models, the simple model, the two-term exponential model and the Page model were examined. All models were evaluated using three statistical measures, correlation coefficient, root means square error, and mean absolute percent error. Moisture diffusivity was calculated based on the diffusion equation for an infinite cylindrical shape using the slope method. The rate of drying was higher for the pre-treatments involving freezing. The sample which was blanched only did not show any improvement in drying rate. In fact, a longer drying time resulted due to water absorption during blanching. There was no change in the rate for the chilled sample compared with the control. While all models closely fitted the drying data, the simple model showed greatest deviation from the experimental results. The two-term exponential model was found to be the best model for describing the drying curves of bananas because its parameters represent better the physical characteristics of the drying process. Moisture diffusivities of bananas were in the range 4.3-13.2 x 10(-10) m(2)s(-1). (C) 2002 Published by Elsevier Science Ltd.

Explicit/implicit partitioning and a new explicit form of the generalized alpha method

Most finite element packages use the Newmark algorithm for time integration of structural dynamics. Various algorithms have been proposed to better optimize the high frequency dissipation of this algorithm. Hulbert and Chung proposed both implicit and explicit forms of the generalized alpha method. The algorithms optimize high frequency dissipation effectively, and despite recent work on algorithms that possess momentum conserving/energy dissipative properties in a non-linear context, the generalized alpha method remains an efficient way to solve many problems, especially with adaptive timestep control. However, the implicit and explicit algorithms use incompatible parameter sets and cannot be used together in a spatial partition, whereas this can be done for the Newmark algorithm, as Hughes and Liu demonstrated, and for the HHT-alpha algorithm developed from it. The present paper shows that the explicit generalized alpha method can be rewritten so that it becomes compatible with the implicit form. All four algorithmic parameters can be matched between the explicit and implicit forms. An element interface between implicit and explicit partitions can then be used, analogous to that devised by Hughes and Liu to extend the Newmark method. The stability of the explicit/implicit algorithm is examined in a linear context and found to exceed that of the explicit partition. The element partition is significantly less dissipative of intermediate frequencies than one using the HHT-alpha method. The explicit algorithm can also be rewritten so that the discrete equation of motion evaluates forces from displacements and velocities found at the predicted mid-point of a cycle. Copyright (C) 2003 John Wiley Sons, Ltd.

A comparative study of iterative Chebyshev and Lanczos implementations of the boundary inhomogeneity method for quantum scattering

We have recently developed a scaleable Artificial Boundary Inhomogeneity (ABI) method [Chem. Phys. Lett.366, 390–397 (2002)] based on the utilization of the Lanczos algorithm, and in this work explore an alternative iterative implementation based on the Chebyshev algorithm. Detailed comparisons between the two iterative methods have been made in terms of efficiency as well as convergence behavior. The Lanczos subspace ABI method was also further improved by the use of a simpler three-term backward recursion algorithm to solve the subspace linear system. The two different iterative methods are tested on the model collinear H+H2 reactive state-to-state scattering.