The Heisenberg antiferromagnet on an anisotropic triangular lattice: linear spin-wave theory

We consider the effect of quantum spin fluctuations on the ground-state properties of the Heisenberg antiferromagnet on an anisotropic triangular lattice using linear spin-wave (LSW) theory. This model should describe the magnetic properties of the insulating phase of the kappa-(BEDT-TTF)(2)X family of superconducting molecular crystals. The ground-state energy, the staggered magnetization, magnon excitation spectra, and spin-wave velocities are computed as functions of the ratio of the antiferromagnetic exchange between the second and first neighbours, J(2)/J(1). We find that near J(2)/J(1) = 0.5, i.e., in the region where the classical spin configuration changes from a Neel-ordered phase to a spiral phase, the staggered magnetization vanishes, suggesting the possibility of a quantum disordered state. in this region, the quantum correction to the magnetization is large but finite. This is in contrast to the case for the frustrated Heisenberg model on a square lattice, for which the quantum correction diverges logarithmically at the transition from the Neel to the collinear phase. For large J(2)/J(1), the model becomes a set of chains with frustrated interchain coupling. For J(2) > 4J(1), the quantum correction to the magnetization, within LSW theory, becomes comparable to the classical magnetization, suggesting the possibility of a quantum disordered state. We show that, in this regime, the quantum fluctuations are much larger than for a set of weakly coupled chains with non-frustrated interchain coupling.

Phase diagram for a class of spin-1/2 Heisenberg models interpolating between the square-lattice, the triangular-lattice, and the linear-chain limits

We study the spin-1/2 Heisenberg models on an anisotropic two-dimensional lattice which interpolates between the square lattice at one end, a set of decoupled spin chains on the other end, and the triangular-lattice Heisenberg model in between. By series expansions around two different dimer ground states and around various commensurate and incommensurate magnetically ordered states, we establish the phase diagram for this model of a frustrated antiferromagnet. We find a particularly rich phase diagram due to the interplay of magnetic frustration, quantum fluctuations, and varying dimensionality. There is a large region of the usual two-sublattice Neel phase, a three-sublattice phase for the triangular-lattice model, a region of incommensurate magnetic order around the triangular-lattice model, and regions in parameter space where there is no magnetic order. We find that the incommensurate ordering wave vector is in general altered from its classical value by quantum fluctuations. The regime of weakly coupled chains is particularly interesting and appears to be nearly critical. [S0163-1829(99)10421-1].

Designs for an asymmetric gradient set and a compact superconducting magnet for neural magnetic resonance imaging

Imaging of the head and neck is the most commonly performed clinical magnetic resonance imaging (MRI) examination [R. G. Evans and J. R. G. Evans, AJR 157, 603 (1991)]. This is usually undertaken in a generalist MRI instrument containing superconducting magnet system capable of imaging all organs. These generalist instruments are large, typically having a bore of 0.9-1.0 m and a length of 1.7-2.5 m and therefore are expensive to site, somewhat claustrophobic to the patient, and offer little access by attending physicians. In this article, we present the design of a compact, superconducting MRI magnet for head and neck imaging that is less than 0.8 m in length and discuss in detail the design of an asymmetric gradient coil set, tailored to the magnet profile. In particular, the introduction of a radio-frequency FM modulation scheme in concert with a gradient sequence allows the epoch of the linear region of the gradient set to be much closer to the end of the gradient structure than was previously possible. Images from a prototype gradient set demonstrate the effectiveness of the designs. (C) 1999 American Institute of Physics. [S0034-6748(99)04910-2].

Asymmetric MRI magnet design using a hybrid numerical method

This paper describes a hybrid numerical method for the design of asymmetric magnetic resonance imaging magnet systems. The problem is formulated as a field synthesis and the desired current density on the surface of a cylinder is first calculated by solving a Fredholm equation of the first kind. Nonlinear optimization methods are then invoked to fit practical magnet coils to the desired current density. The field calculations are performed using a semi-analytical method. A new type of asymmetric magnet is proposed in this work. The asymmetric MRI magnet allows the diameter spherical imaging volume to be positioned close to one end of the magnet. The main advantages of making the magnet asymmetric include the potential to reduce the perception of claustrophobia for the patient, better access to the patient by attending physicians, and the potential for reduced peripheral nerve stimulation due to the gradient coil configuration. The results highlight that the method can be used to obtain an asymmetric MRI magnet structure and a very homogeneous magnetic field over the central imaging volume in clinical systems of approximately 1.2 m in length. Unshielded designs are the focus of this work. This method is flexible and may be applied to magnets of other geometries. (C) 1999 Academic Press.

A hybrid, inverse approach to the design of magnetic resonance imaging magnets

This paper describes a hybrid numerical method of an inverse approach to the design of compact magnetic resonance imaging magnets. The problem is formulated as a field synthesis and the desired current density on the surface of a cylinder is first calculated by solving a Fredholm equation of the first, kind. Nonlinear optimization methods are then invoked to fit practical magnet coils to the desired current density. The field calculations are performed using a semi-analytical method. The emphasis of this work is on the optimal design of short MRI magnets. Details of the hybrid numerical model are presented, and the model is used to investigate compact, symmetric MRI magnets as well as asymmetric magnets. The results highlight that the method can be used to obtain a compact MRI magnet structure and a very homogeneous magnetic field over the central imaging volume in clinical systems of approximately 1 m in length, significantly shorter than current designs. Viable asymmetric magnet designs, in which the edge of the homogeneous region is very close to one end of the magnet system are also presented. Unshielded designs are the focus of this work. This method is flexible and may be applied to magnets of other geometries. (C) 2000 American Association of Physicists in Medicine. [S0094-2405(00)00303-5].

Kinematic and non-linear analysis of foldable barrel vaults

Kinematic analysis is conducted to derive the geometric constraints for the geometric design of foldable barrel vaults (FBV) composed of polar or angulated scissor units. Non-linear structural analysis is followed to determine the structural response of FBVs in the fully deployed configuration under static loading. Two load cases are considered: cross wind and longitudinal wind. The effect of varying member sizes, depth-to-span ratio and geometric imperfections is examined. (C) 2000 Elsevier Science Ltd. All rights reserved.

Minimum-order stable recursive filter design via the genetic algorithm approach

In this paper, the minimum-order stable recursive filter design problem is proposed and investigated. This problem is playing an important role in pipeline implementation sin signal processing. Here, the existence of a high-order stable recursive filter is proved theoretically, in which the upper bound for the highest order of stable filters is given. Then the minimum-order stable linear predictor is obtained via solving an optimization problem. In this paper, the popular genetic algorithm approach is adopted since it is a heuristic probabilistic optimization technique and has been widely used in engineering designs. Finally, an illustrative example is sued to show the effectiveness of the proposed algorithm.

Analytical solution for tidal propagation in a coupled semi-confined/phreatic coastal aquifer

An analytical solution is derived for tidal fluctuations in a coupled coastal aquifer system consisting of a semi-confined aquifer, a thin semi-permeable layer and a phreatic aquifer. Based on the solution, we study the interactions (via leakage) between the confined and unconfined aquifers in response to tides. The results show that, under certain conditions, leakage from the confined aquifer can affect considerably the tidal water table fluctuation in the phreatic aquifer and vice versa. Ignoring these effects could lead to errors in estimating aquifer properties based on tidal signals. (C) 2002 Elsevier Science Ltd. All rights reserved.

Utilizing encoding in scalable linear optics quantum computing

We present a scheme which offers a significant reduction in the resources required to implement linear optics quantum computing. The scheme is a variation of the proposal of Knill, Laflamme and Milburn, and makes use of an incremental approach to the error encoding to boost probability of success.

A family of perfect hashing methods

Minimal perfect hash functions are used for memory efficient storage and fast retrieval of items from static sets. We present an infinite family of efficient and practical algorithms for generating order preserving minimal perfect hash functions. We show that almost all members of the family construct space and time optimal order preserving minimal perfect hash functions, and we identify the one with minimum constants. Members of the family generate a hash function in two steps. First a special kind of function into an r-graph is computed probabilistically. Then this function is refined deterministically to a minimal perfect hash function. We give strong theoretical evidence that the first step uses linear random time. The second step runs in linear deterministic time. The family not only has theoretical importance, but also offers the fastest known method for generating perfect hash functions.

High-breakdown linear discriminant analysis

The classification rules of linear discriminant analysis are defined by the true mean vectors and the common covariance matrix of the populations from which the data come. Because these true parameters are generally unknown, they are commonly estimated by the sample mean vector and covariance matrix of the data in a training sample randomly drawn from each population. However, these sample statistics are notoriously susceptible to contamination by outliers, a problem compounded by the fact that the outliers may be invisible to conventional diagnostics. High-breakdown estimation is a procedure designed to remove this cause for concern by producing estimates that are immune to serious distortion by a minority of outliers, regardless of their severity. In this article we motivate and develop a high-breakdown criterion for linear discriminant analysis and give an algorithm for its implementation. The procedure is intended to supplement rather than replace the usual sample-moment methodology of discriminant analysis either by providing indications that the dataset is not seriously affected by outliers (supporting the usual analysis) or by identifying apparently aberrant points and giving resistant estimators that are not affected by them.

Applying linear time-varying constraints to econometric models: With an application to demand systems

When linear equality constraints are invariant through time they can be incorporated into estimation by restricted least squares. If, however, the constraints are time-varying, this standard methodology cannot be applied. In this paper we show how to incorporate linear time-varying constraints into the estimation of econometric models. The method involves the augmentation of the observation equation of a state-space model prior to estimation by the Kalman filter. Numerical optimisation routines are used for the estimation. A simple example drawn from demand analysis is used to illustrate the method and its application.