Integrable generalized spin ladder models based on the SU(1|3) and SU(3|1) algebras

We present two integrable spin ladder models which possess a general free parameter besides the rung coupling J. The models are exactly solvable by means of the Bethe ansatz method and we present the Bethe ansatz equations. We analyze the elementary excitations of the models which reveal the existence of a gap for both models that depends on the free parameter. (C) 2003 American Institute of Physics.

Are Ichthyosporea animals or fungi? Bayesian phylogenetic analysis of elongation factor 1α of Ichthyophonus irregularis

Ichthyosporea is a recently recognized group of morphologically simple eukaryotes, many of which cause disease in aquatic organisms. Ribosomal RNA sequence analyses place Ichthyosporea near the divergence of the animal and fungal lineages, but do not allow resolution of its exact phylogenetic position. Some of the best evidence for a specific grouping of animals and fungi (Opisthokonta) has come from elongation factor 1alpha, not only phylogenetic analysis of sequences but also the presence or absence of short insertions and deletions. We sequenced the EF-1alpha gene from the ichthyosporean parasite Ichthyophonus irregularis and determined its phylogenetic position using neighbor-joining, parsimony and Bayesian methods. We also sequenced EF-1alpha genes from four chytrids to provide broader representation within fungi. Sequence analyses and the presence of a characteristic 12 amino acid insertion strongly indicate that I. irregularis is a member of Opisthokonta, but do not resolve whether I. irregularis is a specific relative of animals or of fungi. However, the EF-1alpha of I. irregularis exhibits a two amino acid deletion heretofore reported only among fungi. (C) 2003 Elsevier Science (USA). All rights reserved.

An approach to verifying and debugging simulation models governed by ordinary differential equations: Part 1. Methodology for residual generation

For dynamic simulations to be credible, verification of the computer code must be an integral part of the modelling process. This two-part paper describes a novel approach to verification through program testing and debugging. In Part 1, a methodology is presented for detecting and isolating coding errors using back-to-back testing. Residuals are generated by comparing the output of two independent implementations, in response to identical inputs. The key feature of the methodology is that a specially modified observer is created using one of the implementations, so as to impose an error-dependent structure on these residuals. Each error can be associated with a fixed and known subspace, permitting errors to be isolated to specific equations in the code. It is shown that the geometric properties extend to multiple errors in either one of the two implementations. Copyright (C) 2003 John Wiley Sons, Ltd.

An approach to verifying and debugging simulation models governed by ordinary differential equations: Part 2. Residuals analysis and a case study

In Part 1 of this paper a methodology for back-to-back testing of simulation software was described. Residuals with error-dependent geometric properties were generated. A set of potential coding errors was enumerated, along with a corresponding set of feature matrices, which describe the geometric properties imposed on the residuals by each of the errors. In this part of the paper, an algorithm is developed to isolate the coding errors present by analysing the residuals. A set of errors is isolated when the subspace spanned by their combined feature matrices corresponds to that of the residuals. Individual feature matrices are compared to the residuals and classified as 'definite', 'possible' or 'impossible'. The status of 'possible' errors is resolved using a dynamic subset testing algorithm. To demonstrate and validate the testing methodology presented in Part 1 and the isolation algorithm presented in Part 2, a case study is presented using a model for biological wastewater treatment. Both single and simultaneous errors that are deliberately introduced into the simulation code are correctly detected and isolated. Copyright (C) 2003 John Wiley Sons, Ltd.

Mapping the royal road and other hierarchical functions

In this paper we present a technique for visualising hierarchical and symmetric, multimodal fitness functions that have been investigated in the evolutionary computation literature. The focus of this technique is on landscapes in moderate-dimensional, binary spaces (i.e., fitness functions defined over {0, 1}(n), for n less than or equal to 16). The visualisation approach involves an unfolding of the hyperspace into a two-dimensional graph, whose layout represents the topology of the space using a recursive relationship, and whose shading defines the shape of the cost surface defined on the space. Using this technique we present case-study explorations of three fitness functions: royal road, hierarchical-if-and-only-if (H-IFF), and hierarchically decomposable functions (HDF). The visualisation approach provides an insight into the properties of these functions, particularly with respect to the size and shape of the basins of attraction around each of the local optima.