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.

Point source inoculation of Mesocyclops (Copepoda : Cyclopidae) gives widespread control of Ochlerotatus and Aedes (Diptera : Culicidae) immatures in service manholes and pits in North Queensland, Australia

This study details the novel application of predacious copepods, genus Mesocyclops, for control of Ochlerotatus tremulus (Theobald) group and Aedes aegypti (L.) mosquito larvae in subterranean habitats in north Queensland, Australia. During June 1997, 50 Mesocyclops sp. I were inoculated into one service manhole in South Townsville. Wet season rainfall and flooding in both 1998 and 2000 was responsible for the dispersal of copepods via the underground pipe system to 29 of 35 manholes over an area of 1.33 km(2). Significant reductions in Aedes and Ochlerotatus larvae ensued. In these habitats, Mesocyclops and Metacyclops were able to survive dry periods, when substrate moisture content ranged from 13.8 to 79.9%. At the semiarid inland towns of Hughenden and Richmond, cracking clay soil prevents drainage of water from shallow service pits where Oc. tremulus immatures numbered from 292-18,460 per pit. Introduction of Mesocyclops copepods into these sites during May 1999 resulted in 100% control of Oc. tremulus for 18 mo. One uninoculated pit subsequently became positive for Mesocyclops with resultant control of mosquito larvae.

The nonexistence of spurious solutions to discrete, two-point boundary value problems

We investigate difference equations which arise as discrete approximations to two-point boundary value problems for systems of second-order, ordinary differential equations. We formulate conditions under which all solutions to the discrete problem satisfy certain a priori bounds which axe independent of the step-size. As a result, the nonexistence of spurious solutions are guaranteed. Some existence and convergence theorems for solutions to the discrete problem are also presented. (C) 2002 Elsevier Science Ltd. All rights reserved.

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.

Explicit/implicit partitioning and a new explicit form of the generalized alpha method

Most finite element packages use the Newmark algorithm for time integration of structural dynamics. Various algorithms have been proposed to better optimize the high frequency dissipation of this algorithm. Hulbert and Chung proposed both implicit and explicit forms of the generalized alpha method. The algorithms optimize high frequency dissipation effectively, and despite recent work on algorithms that possess momentum conserving/energy dissipative properties in a non-linear context, the generalized alpha method remains an efficient way to solve many problems, especially with adaptive timestep control. However, the implicit and explicit algorithms use incompatible parameter sets and cannot be used together in a spatial partition, whereas this can be done for the Newmark algorithm, as Hughes and Liu demonstrated, and for the HHT-alpha algorithm developed from it. The present paper shows that the explicit generalized alpha method can be rewritten so that it becomes compatible with the implicit form. All four algorithmic parameters can be matched between the explicit and implicit forms. An element interface between implicit and explicit partitions can then be used, analogous to that devised by Hughes and Liu to extend the Newmark method. The stability of the explicit/implicit algorithm is examined in a linear context and found to exceed that of the explicit partition. The element partition is significantly less dissipative of intermediate frequencies than one using the HHT-alpha method. The explicit algorithm can also be rewritten so that the discrete equation of motion evaluates forces from displacements and velocities found at the predicted mid-point of a cycle. Copyright (C) 2003 John Wiley Sons, Ltd.

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.

Fast, scalable master equation solution algorithms. IV. Lanczos iteration with diffusion approximation preconditioned iterative inversion

In this paper we propose a second linearly scalable method for solving large master equations arising in the context of gas-phase reactive systems. The new method is based on the well-known shift-invert Lanczos iteration using the GMRES iteration preconditioned using the diffusion approximation to the master equation to provide the inverse of the master equation matrix. In this way we avoid the cubic scaling of traditional master equation solution methods while maintaining the speed of a partial spectral decomposition. The method is tested using a master equation modeling the formation of propargyl from the reaction of singlet methylene with acetylene, proceeding through long-lived isomerizing intermediates. (C) 2003 American Institute of Physics.

Fast, scalable master equation solution algorithms. III. Direct time propagation accelerated by a diffusion approximation preconditioned iterative solver

In this paper we propose a novel fast and linearly scalable method for solving master equations arising in the context of gas-phase reactive systems, based on an existent stiff ordinary differential equation integrator. The required solution of a linear system involving the Jacobian matrix is achieved using the GMRES iteration preconditioned using the diffusion approximation to the master equation. In this way we avoid the cubic scaling of traditional master equation solution methods and maintain the low temperature robustness of numerical integration. The method is tested using a master equation modelling the formation of propargyl from the reaction of singlet methylene with acetylene, proceeding through long lived isomerizing intermediates. (C) 2003 American Institute of Physics.

A comparison of model laws as a starting point for the development of an enforceable international consumer protection regime

This article is concerned primarily with an examination and comparison of select aspects of the model international consumer protection laws proposed by the United Nations (UN), the European Union (EU), and the Organisation for Economic Co-operation and Development (OECD), using the Trade Practices Act 1974 (Australia) as a basis for examination and comparison. As a secondary consideration, it also broadly examines the content of, and differences between, the model laws. The motive for this article is that any future enforceable international consumer protection regime (possibly in the form of an international treaty or convention) would need to take into account the UN, EU and OECD guidelines. A cross-comparison of those model laws, and a comparison of them with the consumer protection provisions of a well established national consumer protection law, should provide a useful starting point for the development of such a regime. The 'select aspects' of the model laws in question are the various provisions of those laws which could relate to situations involving the wrong delivery or non-delivery of goods.

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.

The uniqueness of solutions to discrete, victor, two-point boundary value problems

Difference equations which may arise as discrete approximations to two-point boundary value problems for systems of second-order, ordinary differential equations are investigated and conditions are formulated under which solutions to the discrete problem are unique. Some existence, uniqueness implies existence, and convergence theorems for solutions to the discrete problem are also presented.