Integrable impurity spin ladder systems

Two different types of integrable impurities in a spin ladder system are proposed. The impurities are introduced in such a way that the integrability of the models is not violated. The models are solved exactly with the Bethe ansatz equations as well as the energy eigenvalues obtained. We show for both models that a phase transition between gapped and gapless spin excitations occurs at a critical value of the rung coupling J. In addition, the dependence of the impurities on this phase transition is determined explicitly. In one of the models the spin gap decreases by increasing the impurity strength A. Moreover, for a fixed A, a reduction in the spin gap by increasing the impurity concentration is also observed.

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.

Decompositions of complete graphs into theta graphs with fewer than ten edges

A theta graph is a graph consisting of three pairwise internally disjoint paths with common end points. Methods for decomposing the complete graph K-nu into theta graphs with fewer than ten edges are given.

Large amplitude vibration of thermo-electro-mechanically stressed FGM laminated plates

This paper presents a large amplitude vibration analysis of pre-stressed functionally graded material (FGM) laminated plates that are composed of a shear deformable functionally graded layer and two surface-mounted piezoelectric actuator layers. Nonlinear governing equations of motion are derived within the context of Reddy's higher-order shear deformation plate theory to account for transverse shear strain and rotary inertia. Due to the bending and stretching coupling effect, a nonlinear static problem is solved first to determine the initial stress state and pre-vibration deformations of the plate that is subjected to uniform temperature change, in-plane forces and applied actuator voltage. By adding an incremental dynamic state to the pre-vibration state, the differential equations that govern the nonlinear vibration behavior of pre-stressed FGM laminated plates are derived. A semi-analytical method that is based on one-dimensional differential quadrature and Galerkin technique is proposed to predict the large amplitude vibration behavior of the laminated rectangular plates with two opposite clamped edges. Linear vibration frequencies and nonlinear normalized frequencies are presented in both tabular and graphical forms, showing that the normalized frequency of the FGM laminated plate is very sensitive to vibration amplitude, out-of-plane boundary support, temperature change, in-plane compression and the side-to-thickness ratio. The CSCF and CFCF plates even change the inherent hard-spring characteristic to soft-spring behavior at large vibration amplitudes. (C) 2003 Elsevier B.V. All rights reserved.

Large sets of large sets of Steiner triple systems of order 9

We describe a direct method of partitioning the 840 Steiner triple systems of order 9 into 120 large sets. The method produces partitions in which all of the large sets are isomorphic and we apply the method to each of the two non-isomorphic large sets of STS(9).

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.

Dendritic branching of pyramidal cells in the visual cortex of the nocturnal owl monkey: A fractal analysis

The branching structure of neurones is thought to influence patterns of connectivity and how inputs are integrated within the arbor. Recent studies have revealed a remarkable degree of variation in the branching structure of pyramidal cells in the cerebral cortex of diurnal primates, suggesting regional specialization in neuronal function. Such specialization in pyramidal cell structure may be important for various aspects of visual function, such as object recognition and color processing. To better understand the functional role of regional variation in the pyramidal cell phenotype in visual processing, we determined the complexity of the dendritic branching pattern of pyramidal cells in visual cortex of the nocturnal New World owl monkey. We used the fractal dilation method to quantify the branching structure of pyramidal cells in the primary visual area (V1), the second visual area (V2) and the caudal and rostral subdivisions of inferotemporal cortex (ITc and ITr, respectively), which are often associated with color processing. We found that, as in diurnal monkeys, there was a trend for cells of increasing fractal dimension with progression through these cortical areas. The increasing complexity paralleled a trend for increasing symmetry. That we found a similar trend in both diurnal and nocturnal monkeys suggests that it was a feature of a common anthropoid ancestor.

Pseudo-randomness of round-off errors in discretized linear maps on the plane

We analyze the sequences of round-off errors of the orbits of a discretized planar rotation, from a probabilistic angle. It was shown [Bosio & Vivaldi, 2000] that for a dense set of parameters, the discretized map can be embedded into an expanding p-adic dynamical system, which serves as a source of deterministic randomness. For each parameter value, these systems can generate infinitely many distinct pseudo-random sequences over a finite alphabet, whose average period is conjectured to grow exponentially with the bit-length of the initial condition (the seed). We study some properties of these symbolic sequences, deriving a central limit theorem for the deviations between round-off and exact orbits, and obtain bounds concerning repetitions of words. We also explore some asymptotic problems computationally, verifying, among other things, that the occurrence of words of a given length is consistent with that of an abstract Bernoulli sequence.