Algebraic Bethe ansatz method for the exact calculation of energy spectra and form factors: applications to models of Bose-Einstein condensates and metallic nanograins

In this review we demonstrate how the algebraic Bethe ansatz is used for the calculation of the-energy spectra and form factors (operator matrix elements in the basis of Hamiltonian eigenstates) in exactly solvable quantum systems. As examples we apply the theory to several models of current interest in the study of Bose-Einstein condensates, which have been successfully created using ultracold dilute atomic gases. The first model we introduce describes Josephson tunnelling between two coupled Bose-Einstein condensates. It can be used not only for the study of tunnelling between condensates of atomic gases, but for solid state Josephson junctions and coupled Cooper pair boxes. The theory is also applicable to models of atomic-molecular Bose-Einstein condensates, with two examples given and analysed. Additionally, these same two models are relevant to studies in quantum optics; Finally, we discuss the model of Bardeen, Cooper and Schrieffer in this framework, which is appropriate for systems of ultracold fermionic atomic gases, as well as being applicable for the description of superconducting correlations in metallic grains with nanoscale dimensions.; In applying all the above models to. physical situations, the need for an exact analysis of small-scale systems is established due to large quantum fluctuations which render mean-field approaches inaccurate.

Special issue on advances in data mining and its applications

Data mining is the process to identify valid, implicit, previously unknown, potentially useful and understandable information from large databases. It is an important step in the process of knowledge discovery in databases, (Olaru & Wehenkel, 1999). In a data mining process, input data can be structured, seme-structured, or unstructured. Data can be in text, categorical or numerical values. One of the important characteristics of data mining is its ability to deal data with large volume, distributed, time variant, noisy, and high dimensionality. A large number of data mining algorithms have been developed for different applications. For example, association rules mining can be useful for market basket problems, clustering algorithms can be used to discover trends in unsupervised learning problems, classification algorithms can be applied in decision-making problems, and sequential and time series mining algorithms can be used in predicting events, fault detection, and other supervised learning problems (Vapnik, 1999). Classification is among the most important tasks in the data mining, particularly for data mining applications into engineering fields. Together with regression, classification is mainly for predictive modelling. So far, there have been a number of classification algorithms in practice. According to (Sebastiani, 2002), the main classification algorithms can be categorized as: decision tree and rule based approach such as C4.5 (Quinlan, 1996); probability methods such as Bayesian classifier (Lewis, 1998); on-line methods such as Winnow (Littlestone, 1988) and CVFDT (Hulten 2001), neural networks methods (Rumelhart, Hinton & Wiliams, 1986); example-based methods such as k-nearest neighbors (Duda & Hart, 1973), and SVM (Cortes & Vapnik, 1995). Other important techniques for classification tasks include Associative Classification (Liu et al, 1998) and Ensemble Classification (Tumer, 1996).

Comparison of BR and QR Eigenvalue Algorithms for Power System Small Signal Stability Analysis

The BR algorithm is a novel and efficient method to find all eigenvalues of upper Hessenberg matrices and has never been applied to eigenanalysis for power system small signal stability. This paper analyzes differences between the BR and the QR algorithms with performance comparison in terms of CPU time based on stopping criteria and storage requirement. The BR algorithm utilizes accelerating strategies to improve its performance when computing eigenvalues of narrowly banded, nearly tridiagonal upper Hessenberg matrices. These strategies significantly reduce the computation time at a reasonable level of precision. Compared with the QR algorithm, the BR algorithm requires fewer iteration steps and less storage space without depriving of appropriate precision in solving eigenvalue problems of large-scale power systems. Numerical examples demonstrate the efficiency of the BR algorithm in pursuing eigenanalysis tasks of 39-, 68-, 115-, 300-, and 600-bus systems. Experiment results suggest that the BR algorithm is a more efficient algorithm for large-scale power system small signal stability eigenanalysis.

Measurement and state preparation via ion trap quantum computing

We investigate in detail the effects of a QND vibrational number measurement made on single ions in a recently proposed measurement scheme for the vibrational state of a register of ions in a linear rf trap [C. D'HELON and G. J. MILBURN, Phys Rev. A 54, 5141 (1996)]. The performance of a measurement shows some interesting patterns which are closely related to searching.

Calculating current densities and fields due to shielded bi-planar radio-frequency coils

A method for the accurate computation of the current densities produced in a wide-runged bi-planar radio-frequency coil is presented. The device has applications in magnetic resonance imaging. There is a set of opposing primary rungs, symmetrically placed on parallel planes and a similar arrangement of rungs on two parallel planes surrounding the primary serves as a shield. Current densities induced in these primary and shielding rungs are calculated to a high degree of accuracy using an integral-equation approach, combined with the inverse finite Hilbert transform. Once these densities are known, accurate electrical and magnetic fields are then computed without difficulty. Some test results are shown. The method is so rapid that it can be incorporated into optimization software. Some preliminary fields produced from optimized coils are presented.

Finite element analysis of heat transfer and mineralization in layered hydrothermal systems with upward throughflow

We use the finite element method to solve the coupled problem between convective pore-fluid flow, heat transfer and mineralization in layered hydrothermal systems with upward throughflow. In particular, we present the improved rock alteration index (IRAI) concept for predicting the most probable precipitation and dissolution regions of gold (Au) minerals in the systems. To validate the numerical method used in the computation, analytical solutions to a benchmark problem have been derived. After the numerical method is validated, it is used to investigate the pattern of pore-fluid Aom, the distribution of temperature and the mineralization pattern of gold minerals in a layered hydrothermal system with upward throughflow. The related numerical results have demonstrated that the present concept of IRAI is useful and applicable for predicting the most probable precipitation and dissolution regions of gold (Au) minerals in hydrothermal systems. (C) 2000 Elsevier Science S.A. All rights reserved.

Context-free and context-sensitive dynamics in recurrent neural networks

Continuous-valued recurrent neural networks can learn mechanisms for processing context-free languages. The dynamics of such networks is usually based on damped oscillation around fixed points in state space and requires that the dynamical components are arranged in certain ways. It is shown that qualitatively similar dynamics with similar constraints hold for a(n)b(n)c(n), a context-sensitive language. The additional difficulty with a(n)b(n)c(n), compared with the context-free language a(n)b(n), consists of 'counting up' and 'counting down' letters simultaneously. The network solution is to oscillate in two principal dimensions, one for counting up and one for counting down. This study focuses on the dynamics employed by the sequential cascaded network, in contrast to the simple recurrent network, and the use of backpropagation through time. Found solutions generalize well beyond training data, however, learning is not reliable. The contribution of this study lies in demonstrating how the dynamics in recurrent neural networks that process context-free languages can also be employed in processing some context-sensitive languages (traditionally thought of as requiring additional computation resources). This continuity of mechanism between language classes contributes to our understanding of neural networks in modelling language learning and processing.

The Qu-Prolog unification algorithm: Formalisation and correctness

Qu-Prolog is an extension of Prolog which performs meta-level computations over object languages, such as predicate calculi and lambda-calculi, which have object-level variables, and quantifier or binding symbols creating local scopes for those variables. As in Prolog, the instantiable (meta-level) variables of Qu-Prolog range over object-level terms, and in addition other Qu-Prolog syntax denotes the various components of the object-level syntax, including object-level variables. Further, the meta-level operation of substitution into object-level terms is directly represented by appropriate Qu-Prolog syntax. Again as in Prolog, the driving mechanism in Qu-Prolog computation is a form of unification, but this is substantially more complex than for Prolog because of Qu-Prolog's greater generality, and especially because substitution operations are evaluated during unification. In this paper, the Qu-Prolog unification algorithm is specified, formalised and proved correct. Further, the analysis of the algorithm is carried out in a frame-work which straightforwardly allows the 'completeness' of the algorithm to be proved: though fully explicit answers to unification problems are not always provided, no information is lost in the unification process.

Data grid for the management, reconstruction, analysis and visualisation of archaeological data

In 2007 Associate Professor Jay Hall retires from the University of Queensland after more than 30 years of service to the Australian archaeological community. Celebrated as a gifted teacher and a pioneer of Queensland archaeology, Jay leaves a rich legacy of scholarship and achievement across a wide range of archaeological endeavours. An Archæological Life brings together past and present students, colleagues and friends to celebrate Jay’s contributions, influences and interests.

Analytical solution and numerical model for the interface in a stratified long wave system

For a two layered long wave propagation, linearized governing equations, which were derived earlier from the Euler equations of mass and momentum assuming negligible friction and interfacial mixing are solved analytically using Fourier transform. For the solution, variations of upper layer water level is assumed to be sinosoidal having known amplitude and variations of interface level is solved. As the governing equations are too complex to solve it analytically, density of upper layer fluid is assumed as very close to the density of lower layer fluid to simplify the lower layer equation. A numerical model is developed using the staggered leap-forg scheme for computation of water level and discharge in one dimensional propagation having known amplitude for the variations of upper layer water level and interface level to be solved. For the numerical model, water levels (upper layer and interface) at both the boundaries are assumed to be known from analytical solution. Results of numerical model are verified by comparing with the analytical solutions for different time period. Good agreements between analytical solution and numerical model are found for the stated boundary condition. The reliability of the developed numerical model is discussed, using it for different a (ratio of density of fluid in the upper layer to that in the lower layer) and p (ratio of water depth in the lower layer to that in the upper layer) values. It is found that as ‘CX’ increases amplification of interface also increases for same upper layer amplitude. Again for a constant lower layer depth, as ‘p’ increases amplification of interface. also increases for same upper layer amplitude.

Diffusion modeling of percutaneous absorption kinetics: 2. Finite vehicle volume and solvent deposited solids

The diffusion model for percutaneous absorption is developed for the specific case of delivery to the skin being limited by the application of a finite amount of solute. Two cases are considered; in the first, there is an application of a finite donor (vehicle) volume, and in the second, there are solvent-deposited solids and a thin vehicle with a high partition coefficient. In both cases, the potential effect of an interfacial resistance at the stratum corneum surface is also considered. As in the previous paper, which was concerned with the application of a constant donor concentration, clearance limitations due to the viable eqidermis, the in vitro sampling rate, or perfusion rate in vivo are included. Numerical inversion of the Laplace domain solutions was used for simulations of solute flux and cumulative amount absorbed and to model specific examples of percutaneous absorption of solvent-deposited solids. It was concluded that numerical inversions of the Laplace domain solutions for a diffusion model of the percutaneous absorption, using standard scientific software (such as SCIENTIST, MicroMath Scientific software) on modern personal computers, is a practical alternative to computation of infinite series solutions. Limits of the Laplace domain solutions were used to define the moments of the flux-time profiles for finite donor volumes and the slope of the terminal log flux-time profile. The mean transit time could be related to the diffusion time through stratum corneum, viable epidermal, and donor diffusion layer resistances and clearance from the receptor phase. Approximate expressions for the time to reach maximum flux (peak time) and maximum flux were also derived. The model was then validated using reported amount-time and flux-time profiles for finite doses applied to the skin. It was concluded that for very small donor phase volume or for very large stratum corneum-vehicle partitioning coefficients (e.g., for solvent deposited solids), the flux and amount of solute absorbed are affected by receptor conditions to a lesser extent than is obvious for a constant donor constant donor concentrations. (C) 2001 Wiley-Liss, Inc. and the American Pharmaceutical Association J Pharm Sci 90:504-520, 2001.

Prediction of absolute rate coefficients and product branching ratios for the C(P-3) plus allene reaction system

Complex chemical reactions in the gas phase can be decomposed into a network of elementary (e.g., unimolecular and bimolecular) steps which may involve multiple reactant channels, multiple intermediates, and multiple products. The modeling of such reactions involves describing the molecular species and their transformation by reaction at a detailed level. Here we focus on a detailed modeling of the C(P-3)+allene (C3H4) reaction, for which molecular beam experiments and theoretical calculations have previously been performed. In our previous calculations, product branching ratios for a nonrotating isomerizing unimolecular system were predicted. We extend the previous calculations to predict absolute unimolecular rate coefficients and branching ratios using microcanonical variational transition state theory (mu-VTST) with full energy and angular momentum resolution. Our calculation of the initial capture rate is facilitated by systematic ab initio potential energy surface calculations that describe the interaction potential between carbon and allene as a function of the angle of attack. Furthermore, the chemical kinetic scheme is enhanced to explicitly treat the entrance channels in terms of a predicted overall input flux and also to allow for the possibility of redissociation via the entrance channels. Thus, the computation of total bimolecular reaction rates and partial capture rates is now possible. (C) 2002 American Institute of Physics.

ROM-based computation: Quantum versus classical

We introduce a model of computation based on read only memory (ROM), which allows us to compare the space-efficiency of reversible, error-free classical computation with reversible, error-free quantum computation. We show that a ROM-based quantum computer with one writable qubit is universal, whilst two writable bits are required for a universal classical ROM-based computer. We also comment on the time-efficiency advantages of quantum computation within this model.

Biased EPR entanglement and its application to teleportation

We consider pure continuous variable entanglement with non-equal correlations between orthogonal quadratures. We introduce a simple protocol which equates these correlations and in the process transforms the entanglement onto a state with the minimum allowed number of photons. As an example we show that our protocol transforms, through unitary local operations, a single squeezed beam split on a beam splitter into the same entanglement that is produced when two squeezed beams are mixed orthogonally. We demonstrate that this technique can in principle facilitate perfect teleportation utilizing only one squeezed beam.

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.