Exact theory of sedimentation equilibrium made useful

The exact description of the thermodynamics of solutions has been used to describe, without approximation, the distribution of all the components of an incompressible solution in a centrifuge cell at sedimentation equilibrium. Thermodynamic parameters describing the interactions between solute components of known molar mass can be obtained by direct analysis of the experimental data. Interpretation of the measured thermodynamic parameters in terms of molecular interactions requires that an arbitrary distinction be made between nonassociative forces, like hard-sphere volume-exclusion and mean-field electrostatic repulsion or attraction, and specific short-range forces of association that give rise to the formation of molecular aggregates. Provided the former can be accounted for adequately, the effects of the latter can be elucidated in the form of good estimates of the equilibrium constants for the reactions of aggregation.

A monolithic smoothing-gap algorithm for contact-impact based on the signed distance function

A new algorithm has been developed for smoothing the surfaces in finite element formulations of contact-impact. A key feature of this method is that the smoothing is done implicitly by constructing smooth signed distance functions for the bodies. These functions are then employed for the computation of the gap and other variables needed for implementation of contact-impact. The smoothed signed distance functions are constructed by a moving least-squares approximation with a polynomial basis. Results show that when nodes are placed on a surface, the surface can be reproduced with an error of about one per cent or less with either a quadratic or a linear basis. With a quadratic basis, the method exactly reproduces a circle or a sphere even for coarse meshes. Results are presented for contact problems involving the contact of circular bodies. Copyright (C) 2002 John Wiley Sons, Ltd.

A subset-oriented algorithm for minimizing the number of steps required for synthesis of cyclic-peptide libraries

Libraries of cyclic peptides are being synthesized using combinatorial chemistry for high throughput screening in the drug discovery process. This paper describes the min_syn_steps.cpp program (available at http://www.imb.uq.edu.au/groups/smythe/tran), which after inputting a list of cyclic peptides to be synthesized, removes cyclic redundant sequences and calculates synthetic strategies which minimize the synthetic steps as well as the reagent requirements. The synthetic steps and reagent requirements could be minimized by finding common subsets within the sequences for block synthesis. Since a brute-force approach to search for optimum synthetic strategies is impractically large, a subset-orientated approach is utilized here to limit the size of the search. (C) 2002 Elsevier Science Ltd. All rights reserved.

More on exact bicoverings of 12 points

The minimum number of incomplete blocks required to cover, exactly lambda times, all t-element subsets from a set V of cardinality v (v > t) is denoted by y(lambda, t; v). The value of g(2, 2; v) is known for v = 3, 4,..., 11. It was previously known that 14 less than or equal to g(2, 2; 12) less than or equal to 16. We prove that g(2, 2; 12) greater than or equal to 15.

An augmented Lanczos algorithm for the efficient computation of a dot-product of a function of a large sparse symmetric matrix

The Lanczos algorithm is appreciated in many situations due to its speed. and economy of storage. However, the advantage that the Lanczos basis vectors need not be kept is lost when the algorithm is used to compute the action of a matrix function on a vector. Either the basis vectors need to be kept, or the Lanczos process needs to be applied twice. In this study we describe an augmented Lanczos algorithm to compute a dot product relative to a function of a large sparse symmetric matrix, without keeping the basis vectors.

The tree cut and merge algorithm for estimation of network reliability

This article presents Monte Carlo techniques for estimating network reliability. For highly reliable networks, techniques based on graph evolution models provide very good performance. However, they are known to have significant simulation cost. An existing hybrid scheme (based on partitioning the time space) is available to speed up the simulations; however, there are difficulties with optimizing the important parameter associated with this scheme. To overcome these difficulties, a new hybrid scheme (based on partitioning the edge set) is proposed in this article. The proposed scheme shows orders of magnitude improvement of performance over the existing techniques in certain classes of network. It also provides reliability bounds with little overhead.

Exact results for a tunnel-coupled pair of trapped Bose-Einstein condensates

A model describing coherent quantum tunnelling between two trapped Bose-Einstein condensates is discussed. It is not well known that the model admits an exact solution, obtained some time ago, with the energy spectrum derived through the algebraic Bethe ansatz. An asymptotic analysis of the Bethe ansatz equations leads us to explicit expressions for the energies of the ground and the first excited states in the limit of weak tunnelling and all energies for strong tunnelling. The results are used to extract the asymptotic limits of the quantum fluctuations of the boson number difference between the two Bose-Einstein condensates and to characterize the degree of coherence in the system.

A genetic algorithm/method of moments approach to the optimization of an RF coil for MRI applications - Theoretical considerations - Abstract

A Combined Genetic Algorithm and Method of Moments design methods is presented for the design of unusual near-field antennas for use in Magnetic Resonance Imaging systems. The method is successfully applied to the design of an asymmetric coil structure for use at 190MHz and demonstrates excellent radiofrequency field homogeneity.

Wall mediated transport in confined spaces: Exact theory for low density

We present a theory for the transport of molecules adsorbed in slit and cylindrical nanopores at low density, considering the axial momentum gain of molecules oscillating between diffuse wall reflections. Good agreement with molecular dynamics simulations is obtained over a wide range of pore sizes, including the regime of single-file diffusion where fluid-fluid interactions are shown to have a negligible effect on the collective transport coefficient. We show that dispersive fluid-wall interactions considerably attenuate transport compared to classical hard sphere theory.

Automated traffic route identification through the shared nearest neighbour algorithm

Many organisations need to extract useful information from huge amounts of movement data. One example is found in maritime transportation, where the automated identification of a diverse range of traffic routes is a key management issue for improving the maintenance of ports and ocean routes, and accelerating ship traffic. This paper addresses, in a first stage, the research challenge of developing an approach for the automated identification of traffic routes based on clustering motion vectors rather than reconstructed trajectories. The immediate benefit of the proposed approach is to avoid the reconstruction of trajectories in terms of their geometric shape of the path, their position in space, their life span, and changes of speed, direction and other attributes over time. For clustering the moving objects, an adapted version of the Shared Nearest Neighbour algorithm is used. The motion vectors, with a position and a direction, are analysed in order to identify clusters of vectors that are moving towards the same direction. These clusters represent traffic routes and the preliminary results have shown to be promising for the automated identification of traffic routes with different shapes and densities, as well as for handling noise data.

Multi-centre validation of an automatic algorithm for fast 4D myocardial segmentation in cine CMR datasets

Quantitative analysis of cine cardiac magnetic resonance (CMR) images for the assessment of global left ventricular morphology and function remains a routine task in clinical cardiology practice. To date, this process requires user interaction and therefore prolongs the examination (i.e. cost) and introduces observer variability. In this study, we sought to validate the feasibility, accuracy, and time efficiency of a novel framework for automatic quantification of left ventricular global function in a clinical setting.

Self-interacting scalar field cosmologies: unified exact solutions and symmetries

We investigate a mechanism that generates exact solutions of scalar field cosmologies in a unified way. The procedure investigated here permits to recover almost all known solutions, and allows one to derive new solutions as well. In particular, we derive and discuss one novel solution defined in terms of the Lambert function. The solutions are organised in a classification which depends on the choice of a generating function which we have denoted by x(phi) that reflects the underlying thermodynamics of the model. We also analyse and discuss the existence of form-invariance dualities between solutions. A general way of defining the latter in an appropriate fashion for scalar fields is put forward.

Lanczos algorithm on the grassmann manifold

5th. European Congress on Computational Methods in Applied Sciences and Engineering (ECCOMAS 2008) 8th. World Congress on Computational Mechanics (WCCM8)