A gradient descent algorithm for minimizing amino acid coupling reactions when synthesizing cyclic-peptide libraries

Combinatorial chemistry has become an invaluable tool in medicinal chemistry for the identification of new drug leads. For example, libraries of predetermined sequences and head-to-tail cyclized peptides are routinely synthesized in our laboratory using the IRORI approach. Such libraries are used as molecular toolkits that enable the development of pharmacophores that define activity and specificity at receptor targets. These libraries can be quite large and difficult to handle, due to physical and chemical constraints imposed by their size. Therefore, smaller sub-libraries are often targeted for synthesis. The number of coupling reactions required can be greatly reduced if the peptides having common amino acids are grouped into the same sub-library (batching). This paper describes a schedule optimizer to minimize the number of coupling reactions by rotating and aligning sequences while simultaneously batching. The gradient descent method thereby reduces the number of coupling reactions required for synthesizing cyclic peptide libraries. We show that the algorithm results in a 75% reduction in the number of coupling reactions for a typical cyclic peptide library.

Population-based continuous optimization, probabilistic modelling and mean shift

Evolutionary algorithms perform optimization using a population of sample solution points. An interesting development has been to view population-based optimization as the process of evolving an explicit, probabilistic model of the search space. This paper investigates a formal basis for continuous, population-based optimization in terms of a stochastic gradient descent on the Kullback-Leibler divergence between the model probability density and the objective function, represented as an unknown density of assumed form. This leads to an update rule that is related and compared with previous theoretical work, a continuous version of the population-based incremental learning algorithm, and the generalized mean shift clustering framework. Experimental results are presented that demonstrate the dynamics of the new algorithm on a set of simple test problems.

Estimation of concentration-dependent diffusion coefficient in drying process from the space-averaged concentration versus time with experimental data

The estimation of a concentration-dependent diffusion coefficient in a drying process is known as an inverse coefficient problem. The solution is sought wherein the space-average concentration is known as function of time (mass loss monitoring). The problem is stated as the minimization of a functional and gradient-based algorithms are used to solve it. Many numerical and experimental examples that demonstrate the effectiveness of the proposed approach are presented. Thin slab drying was carried out in an isothermal drying chamber built in our laboratory. The diffusion coefficients of fructose obtained with the present method are compared with existing literature results.

Algorithms for sequence analysis via mutagenesis

Despite many successes of conventional DNA sequencing methods, some DNAs remain difficult or impossible to sequence. Unsequenceable regions occur in the genomes of many biologically important organisms, including the human genome. Such regions range in length from tens to millions of bases, and may contain valuable information such as the sequences of important genes. The authors have recently developed a technique that renders a wide range of problematic DNAs amenable to sequencing. The technique is known as sequence analysis via mutagenesis (SAM). This paper presents a number of algorithms for analysing and interpreting data generated by this technique.

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.

A study of the stability of subcycling algorithms in structural dynamics

Algorithms for explicit integration of structural dynamics problems with multiple time steps (subcycling) are investigated. Only one such algorithm, due to Smolinski and Sleith has proved to be stable in a classical sense. A simplified version of this algorithm that retains its stability is presented. However, as with the original version, it can be shown to sacrifice accuracy to achieve stability. Another algorithm in use is shown to be only statistically stable, in that a probability of stability can be assigned if appropriate time step limits are observed. This probability improves rapidly with the number of degrees of freedom in a finite element model. The stability problems are shown to be a property of the central difference method itself, which is modified to give the subcycling algorithm. A related problem is shown to arise when a constraint equation in time is introduced into a time-continuous space-time finite element model. (C) 1998 Elsevier Science S.A.

A simple design methodology for elliptical cross-section, transverse, asymmetric, head gradient coils for MRI

A simple design process for the design of elliptical cross-section, transverse gradient coils for use in magnetic resonance imaging (MRI) is presented. This process is based on a flexible stochastic optimization method and results in designs of high linearity and efficiency with low switching times. A design study of a shielded, transverse asymmetric elliptical coil set for use in neural imaging is presented and includes the minimization of the torques experienced by the gradient set.

A sponge/dinoflagellate association in the haplosclerid sponge Haliclona sp.: cellular origin of cytotoxic alkaloids by Percoll density gradient fractionation

Light-microscopic and electron-microscopic studies of the tropical marine sponge Haliclona sp. (Or der: Haplosclerida Family: Haliclonidae) from Heron Island, Great Barrier Reef, have revealed that this sponge is characterized by the presence of dinoflagellates and by nematocysts. The dinoflagellates are 7-10 mu m in size, intracellular, and contain a pyrenoid with a single stalk, whereas the single chloroplast is branched, curved, and lacks grana. Mitochondria are present, and the nucleus is oval and has distinct chromosomal structure. The dinoflagellates are morphologically similar to Symbiodinium microadriaticum, the common intracellular symbiont of corals, although more detailed biochemical and molecular studies are required to provide a precise taxonomic assignment. The major sponge cell types found in Haliclona sp, are spongocytes, choanocytes, and archaeocytes; groups of dinoflagellates are enclosed within large vacuoles in the archaeocytes. The occurrence of dinoflagellates in marine sponges has previously been thought to be restricted to a small group of sponges including the excavating hadromerid sponges; the dinoflagellates in these sponges are usually referred to as symbionts. The role of the dinoflagellates present in Haliclona sp. as a genuine symbiotic partner requires experimental investigation. The sponge grows on coral substrates, from which it may acquire the nematocysts, and shows features, such as mucus production, which are typical of some excavating sponges. The cytotoxic alkaloids, haliclonacyclamines A and B, associated with Haliclona sp. are shown by Percoll density gradient fractionation to be localized within the sponge cells rather than the dinoflagellates. The ability to synthesize bioactive compounds such as the haliclonacyclamines may help Haliclona sp. to preserve its remarkable ecological niche.

Analysis of pore-fluid pressure gradient and effective vertical-stress gradient distribution in layered hydrodynamic systems

A theoretical analysis is carried out to investigate the pore-fluid pressure gradient and effective vertical-stress gradient distribution in fluid saturated porous rock masses in layered hydrodynamic systems. Three important concepts, namely the critical porosity of a porous medium, the intrinsic Fore-fluid pressure and the intrinsic effective vertical stress of the solid matrix, are presented and discussed. Using some basic scientific principles, we derive analytical solutions and explore the conditions under which either the intrinsic pore-fluid pressure gradient or the intrinsic effective vertical-stress gradient can be maintained at the value of the lithostatic pressure gradient. Even though the intrinsic pore-fluid pressure gradient can be maintained at the value of the lithostatic pressure gradient in a single layer, it is impossible to maintain it at this value in all layers in a layered hydrodynamic system, unless all layers have the same permeability and porosity simultaneously. However, the intrinsic effective vertical-stress gradient of the solid matrix can be maintained at a value close to the lithostatic pressure gradient in all layers in any layered hydrodynamic system within the scope of this study.

Extended GCD and Hermite normal form algorithms via lattice basis reduction

Extended gcd calculation has a long history and plays an important role in computational number theory and linear algebra. Recent results have shown that finding optimal multipliers in extended gcd calculations is difficult. We present an algorithm which uses lattice basis reduction to produce small integer multipliers x(1), ..., x(m) for the equation s = gcd (s(1), ..., s(m)) = x(1)s(1) + ... + x(m)s(m), where s1, ... , s(m) are given integers. The method generalises to produce small unimodular transformation matrices for computing the Hermite normal form of an integer matrix.

Finite element modelling of temperature gradient driven rock alteration and mineralization in porous rock masses

We present finite element simulations of temperature gradient driven rock alteration and mineralization in fluid saturated porous rock masses. In particular, we explore the significance of production/annihilation terms in the mass balance equations and the dependence of the spatial patterns of rock alteration upon the ratio of the roll over time of large scale convection cells to the relaxation time of the chemical reactions. Special concepts such as the gradient reaction criterion or rock alteration index (RAI) are discussed in light of the present, more general theory. In order to validate the finite element simulation, we derive an analytical solution for the rock alteration index of a benchmark problem on a two-dimensional rectangular domain. Since the geometry and boundary conditions of the benchmark problem can be easily and exactly modelled, the analytical solution is also useful for validating other numerical methods, such as the finite difference method and the boundary element method, when they are used to dear with this kind of problem. Finally, the potential of the theory is illustrated by means of finite element studies related to coupled flow problems in materially homogeneous and inhomogeneous porous rock masses. (C) 1998 Elsevier Science S.A. All rights reserved.

A relative gradient theory for layered materials

It is possible to remedy certain difficulties with the description of short wave length phenomena and interfacial slip in standard models of a laminated material by considering the bending stiffness of the layers. If the couple or moment stresses are assumed to be proportional to the relative deformation gradient, then the bending effect disappears for vanishing interface slip, and the model correctly reduces to an isotropic standard continuum. In earlier Cosserat-type models this was not the case. Laminated materials of the kind considered here occur naturally as layered rock, or at a different scale, in synthetic layered materials and composites. Similarities to the situation in regular dislocation structures with couple stresses, also make these ideas relevant to single slip in crystalline materials. Application of the theory to a one-dimensional model for layered beams demonstrates agreement with exact results at the extremes of zero and infinite interface stiffness. Moreover, comparison with finite element calculations confirm the accuracy of the prediction for intermediate interfacial stiffness.

Effects of data characteristics on the results of reserve selection algorithms

We tested the effects of four data characteristics on the results of reserve selection algorithms. The data characteristics were nestedness of features (land types in this case), rarity of features, size variation of sites (potential reserves) and size of data sets (numbers of sites and features). We manipulated data sets to produce three levels, with replication, of each of these data characteristics while holding the other three characteristics constant. We then used an optimizing algorithm and three heuristic algorithms to select sites to solve several reservation problems. We measured efficiency as the number or total area of selected sites, indicating the relative cost of a reserve system. Higher nestedness increased the efficiency of all algorithms (reduced the total cost of new reserves). Higher rarity reduced the efficiency of all algorithms (increased the total cost of new reserves). More variation in site size increased the efficiency of all algorithms expressed in terms of total area of selected sites. We measured the suboptimality of heuristic algorithms as the percentage increase of their results over optimal (minimum possible) results. Suboptimality is a measure of the reliability of heuristics as indicative costing analyses. Higher rarity reduced the suboptimality of heuristics (increased their reliability) and there is some evidence that more size variation did the same for the total area of selected sites. We discuss the implications of these results for the use of reserve selection algorithms as indicative and real-world planning tools.

An "openable," high-strength gradient set for orthopedic MRI

A novel three-axis gradient set and RF resonator for orthopedic MRT has been designed and constructed. The set is openable and may be wrapped around injured joints. The design methodology used was the minimization of magnetic field spherical harmonics by simulated annealing. Splitting of the longitudinal coil presents the major design challenge to a fully openable gradient set and in order to efficiently design such coils, we have developed a new fast algorithm for determining the magnetic field spherical harmonics generated by an are of multiturn wire. The algorithm allows a realistic impression of the effect of split longitudinal designs. A prototype set was constructed based on the new designs and tested in a 2-T clinical research system. The set generated 12 mT/m/A with a linear region of 12 cm and a switching time of 100 mu s, conforming closely with theoretical predictions. Preliminary images from the set are presented. (C) 1999 Academic Press.