Non-protein amino acids in peptide design

An overview of the use of non-protein amino acids in the design of conformationally well-defined peptides, based on work from the author’s laboratory, is discussed. The crystal structures of several designed oligopeptides illustrate the useα-aminoisobutyric acid (Aib) in the construction of helices, D-amino acids in the design of helix termination segments and^DPro-Xxx segments for nucleating ofβ-hairpin structures.β- andγ-amino acid residues have been used to expand the range of designed polypeptide structures. Dedicated to Professor C N R Rao on his 70th birthday     

Uniformity in Computable Structure Theory

We investigate the effects of adding uniformity requirements to concepts in computable structure theory such as computable categoricity (of a structure) and intrinsic computability (of a relation on a computable structure). We consider and compare two different notions of uniformity, previously studied by Kudinov and by Ventsov. We discuss some of their results and establish new ones, while also exploring the connections with the relative computable structure theory of Ash, Knight, Manasse, and Slaman and Chisholm and with previous work of Ash, Knight, and Slaman on uniformity in a general computable structure-theoretical setting.     

Invariant ideals of twisted crossed products

We will prove a result concerning the inclusion of non-trivial invariant ideals inside non-trivial ideals of a twisted crossed product. We will also give results concerning the primeness and simplicity of crossed products of twisted actions of locally compact groups on -algebras. Received: 25 January 2002; in final form: 22 May 2002/Published online: 2 December 2002 This work is partially supported by Hong Kong RGC Direct Grant.     

Two-Frequency Autowave Processes in the Complex Ginzburg–Landau Equation

We study the complex Ginzburg–Landau equation with zero Neumann boundary conditions on a finite interval and establish that this boundary problem (with suitably chosen parameters) has countably many stable two-dimensional self-similar tori. The case of periodic boundary conditions is also investigated.     

The evolution of a truncated gaussian probability density through time—modelling animal liveweights after selection

The form of the probability density derived from the evolution in time of a previously truncated frequency distribution of animal Liveweights is of interest in animal husbandry. Truncated frequency distributions arise when the heavier animals are sold for slaughter and the lighter animals retained. The demands of modern quality assurance schemes require that, given information on animal growth, the farmer is able to estimate the number of animals that would meet the specifications at some time in the future after truncation. Assuming that animal growth can be described by a linear stochastic differential equation, we derive an explicit expression for the probability density of animal Liveweights at any time after the truncation of an initial Gaussian density. It is shown that this probability density converges rapidly to a Gaussian density, so that after about 20 days of typical growth rates for lambs, the resulting density is practically indistinguishable from Gaussian.     

Fold‐2‐covering triangular embeddings

For a graph G and a positive integer m, G_(m) is the graph obtained from G by replacing every vertex by an independent set of size m and every edge by m² edges joining all possible new pairs of ends. If G triangulates a surface, then it is easy to see from Euler's formula that G_(m) can, in principle, triangulate a surface. For m prime and at least 7, it has previously been shown that in fact G_(m) does triangulate a surface, and in fact does so as a “covering with folds” of the original triangulation. For m = 5, this would be a consequence of Tutte's 5‐Flow Conjecture. In this work, we investigate the case m = 2 and describe simple classes of triangulations G for which G₍₂₎ does have a triangulation that covers G “with folds,” as well as providing a simple infinite class of triangulations G of the sphere for which G₍₂₎ does not triangulate any surface. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 79–92, 2003