Conformational properties of hybrid peptides containing alpha and omega-amino acids

This review briefly surveys the conformational properties of guest omega-amino acid residues when incorporated into host alpha-peptide sequences. The results presented focus primarily on the use of beta- and gamma-residues in alphaomega sequences. The insertion of additional methylene groups into peptide backbones enhances the range of accessible conformations, introducing additional torsional variables. A nomenclature system, which permits ready comparisons between alpha-peptides and hybrid sequences, is defined. Crystal structure determination of hybrid peptides, which adopt helical and beta-hairpin conformations permits the characterization of backbone conformational parameters for beta- and gamma-residues inserted into regular alpha-polypeptide structures. Substituted beta- and gamma-residues are more limited in the range of accessible conformation than their unsubstituted counterparts. The achiral beta,beta-disubstituted gamma-amino acid, gabapentin, is an example of a stereochemically constrained residue in which the torsion angles about the C-beta-C-gamma (theta(1)) and C-alpha-C-beta (theta(2)) bonds are restricted to the gauche conformation. Hybrid sequences permit the design of novel hydrogen bonded rings in peptide structures.

MNDO study of coupled strained hydrocarbons: Additivity of exocyclic C---C bond contraction induced by different ring systems

MNDO geometry optimizations were carried out on a series of symmetrically and unsymmetrically coupled strained ring hydrocarbons, R1-R1 and R1–R2 (R1=methyl, cyclopropyl, 1-bicyclo[1.1.0]butyl, 1-bicyclo[1.1.1]pentyl, prismyl, cubyl, 6-tricyclo [3.1.1.03,6]heptyl, and tetrahedryl groups; R2=methyl and cyclopropyl). The remarkable contraction of the C---C bond connecting the strained rings found experimentally in a few cases was reproduced correctly by the calculations. A linear correlation was found between the bond length shortening and the bond angle widening at the corresponding carbon atoms for all the structures considered. The reduction in C---C bond lengths due to various ring systems is additive. The additivity indicates that inter-ring interactions which effect the central bond length are absent and confirms the common electronic origin of bond contraction in these systems, viz. enhanced s-character in the exocyclic bonds of strained rings.

Computational Methods for Studies of Quantum Dots and Boson Condensates

This thesis presents ab initio studies of two kinds of physical systems, quantum dots and bosons, using two program packages of which the bosonic one has mainly been developed by the author. The implemented models, \emph{i.e.}, configuration interaction (CI) and coupled cluster (CC) take the correlated motion of the particles into account, and provide a hierarchy of computational schemes, on top of which the exact solution, within the limit of the single-particle basis set, is obtained. The theory underlying the models is presented in some detail, in order to provide insight into the approximations made and the circumstances under which they hold. Some of the computational methods are also highlighted. In the final sections the results are summarized. The CI and CC calculations on multiexciton complexes in self-assembled semiconductor quantum dots are presented and compared, along with radiative and non-radiative transition rates. Full CI calculations on quantum rings and double quantum rings are also presented. In the latter case, experimental and theoretical results from the literature are re-examined and an alternative explanation for the reported photoluminescence spectra is found. The boson program is first applied on a fictitious model system consisting of bosonic electrons in a central Coulomb field for which CI at the singles and doubles level is found to account for almost all of the correlation energy. Finally, the boson program is employed to study Bose-Einstein condensates confined in different anisotropic trap potentials. The effects of the anisotropy on the relative correlation energy is examined, as well as the effect of varying the interaction potential.}

Optimisation problems in wireless sensor networks

This thesis studies optimisation problems related to modern large-scale distributed systems, such as wireless sensor networks and wireless ad-hoc networks. The concrete tasks that we use as motivating examples are the following: (i) maximising the lifetime of a battery-powered wireless sensor network, (ii) maximising the capacity of a wireless communication network, and (iii) minimising the number of sensors in a surveillance application. A sensor node consumes energy both when it is transmitting or forwarding data, and when it is performing measurements. Hence task (i), lifetime maximisation, can be approached from two different perspectives. First, we can seek for optimal data flows that make the most out of the energy resources available in the network; such optimisation problems are examples of so-called max-min linear programs. Second, we can conserve energy by putting redundant sensors into sleep mode; we arrive at the sleep scheduling problem, in which the objective is to find an optimal schedule that determines when each sensor node is asleep and when it is awake. In a wireless network simultaneous radio transmissions may interfere with each other. Task (ii), capacity maximisation, therefore gives rise to another scheduling problem, the activity scheduling problem, in which the objective is to find a minimum-length conflict-free schedule that satisfies the data transmission requirements of all wireless communication links. Task (iii), minimising the number of sensors, is related to the classical graph problem of finding a minimum dominating set. However, if we are not only interested in detecting an intruder but also locating the intruder, it is not sufficient to solve the dominating set problem; formulations such as minimum-size identifying codes and locating–dominating codes are more appropriate. This thesis presents approximation algorithms for each of these optimisation problems, i.e., for max-min linear programs, sleep scheduling, activity scheduling, identifying codes, and locating–dominating codes. Two complementary approaches are taken. The main focus is on local algorithms, which are constant-time distributed algorithms. The contributions include local approximation algorithms for max-min linear programs, sleep scheduling, and activity scheduling. In the case of max-min linear programs, tight upper and lower bounds are proved for the best possible approximation ratio that can be achieved by any local algorithm. The second approach is the study of centralised polynomial-time algorithms in local graphs – these are geometric graphs whose structure exhibits spatial locality. Among other contributions, it is shown that while identifying codes and locating–dominating codes are hard to approximate in general graphs, they admit a polynomial-time approximation scheme in local graphs.

A Smooth Finite Element Method Based on Reproducing Kernel DMS-Splines

The element-based piecewise smooth functional approximation in the conventional finite element method (FEM) results in discontinuous first and higher order derivatives across element boundaries Despite the significant advantages of the FEM in modelling complicated geometries, a motivation in developing mesh-free methods has been the ease with which higher order globally smooth shape functions can be derived via the reproduction of polynomials There is thus a case for combining these advantages in a so-called hybrid scheme or a `smooth FEM' that, whilst retaining the popular mesh-based discretization, obtains shape functions with uniform C-p (p >= 1) continuity One such recent attempt, a NURBS based parametric bridging method (Shaw et al 2008b), uses polynomial reproducing, tensor-product non-uniform rational B-splines (NURBS) over a typical FE mesh and relies upon a (possibly piecewise) bijective geometric map between the physical domain and a rectangular (cuboidal) parametric domain The present work aims at a significant extension and improvement of this concept by replacing NURBS with DMS-splines (say, of degree n > 0) that are defined over triangles and provide Cn-1 continuity across the triangle edges This relieves the need for a geometric map that could precipitate ill-conditioning of the discretized equations Delaunay triangulation is used to discretize the physical domain and shape functions are constructed via the polynomial reproduction condition, which quite remarkably relieves the solution of its sensitive dependence on the selected knotsets Derivatives of shape functions are also constructed based on the principle of reproduction of derivatives of polynomials (Shaw and Roy 2008a) Within the present scheme, the triangles also serve as background integration cells in weak formulations thereby overcoming non-conformability issues Numerical examples involving the evaluation of derivatives of targeted functions up to the fourth order and applications of the method to a few boundary value problems of general interest in solid mechanics over (non-simply connected) bounded domains in 2D are presented towards the end of the paper

Protein Hydration and Water Structure: X-ray Analysis of a Closely Packed Protein Crystal with Very Low Solvent Content

Low-humidity monoclinic lysozyme, resulting from a water-mediated transformation, has one of the lowest solvent contents (22% by volume) observed in a protein crystal. Its structure has been solved by the molecular replacement method and refined to an R value of 0.175 for 7684 observed reflections in the 10–1.75 Å resolution shell. 90% of the solvent in the well ordered crystals could be located. Favourable sites of hydration on the protein surface include side chains with multiple hydrogen-bonding centres, and regions between short hydrophilic side chains and the main-chain CO or NH groups of the same or nearby residues. Major secondary structural features are not disrupted by hydration. However, the free CO groups at the C terminii and, to a lesser extent, the NH groups at the N terminii of helices provide favourable sites for water interactions, as do reverse turns and regions which connect β-structure and helices. The hydration shell consists of discontinuous networks of water molecules, the maximum number of molecules in a network being ten. The substrate-binding cleft is heavily hydrated, as is the main loop region which is stabilized by water interactions. The protein molecules are close packed in the crystals with a molecular coordination number of 14. Arginyl residues are extensively involved in intermolecular hydrogen bonds and water bridges. The water molecules in the crystal are organized into discrete clusters. A distinctive feature of the clusters is the frequent occurrence of three-membered rings. The protein molecules undergo substantial rearrangement during the transformation from the native to the low-humidity form. The main-chain conformations in the two forms are nearly the same, but differences exist in the side-chain conformation. The differences are particularly pronounced in relation to Trp 62 and Trp 63. The shift in Trp 62 is especially interesting as it is also known to move during inhibitor binding.

A homotopy approach for stabilizing single-input systems with control structure constraints

A linear state feedback gain vector used in the control of a single input dynamical system may be constrained because of the way feedback is realized. Some examples of feedback realizations which impose constraints on the gain vector are: static output feedback, constant gain feedback for several operating points of a system, and two-controller feedback. We consider a general class of problems of stabilization of single input dynamical systems with such structural constraints and give a numerical method to solve them. Each of these problems is cast into a problem of solving a system of equalities and inequalities. In this formulation, the coefficients of the quadratic and linear factors of the closed-loop characteristic polynomial are the variables. To solve the system of equalities and inequalities, a continuous realization of the gradient projection method and a barrier method are used under the homotopy framework. Our method is illustrated with an example for each class of control structure constraint.

An Algebraic Implicitization and Specialization of Minimum KL-Divergence Models

In this paper we study representation of KL-divergence minimization, in the cases where integer sufficient statistics exists, using tools from polynomial algebra. We show that the estimation of parametric statistical models in this case can be transformed to solving a system of polynomial equations. In particular, we also study the case of Kullback-Csiszar iteration scheme. We present implicit descriptions of these models and show that implicitization preserves specialization of prior distribution. This result leads us to a Grobner bases method to compute an implicit representation of minimum KL-divergence models.

A porphyrin bearing tetrahydrothiophene pickets; co-ordination behaviour and electron transfer

A novel ‘picket-fence’ porphyrin, 5,10,15,20-tetrakis[o-(tetrahydro-2-thenoylamino)phenyl]porphyrin (H2L) with ligating tetrahydrothiophene rings disposed perpendicular to the porphyrin plane has been synthesised. Its zinc(II) derivative, [ZnL], binds two silver(I) ions co-operatively with a dissociation constant of 4.8 × 10–8 dm3 mol–1. Time-resolved fluorescence lifetime measurements reveal the presence of intramolecular photoexcited electron transfer in this donor–acceptor system.

A Circuit-Based Proof of Toda′s Theorem

We present a simple proof of Toda′s result (Toda (1989), in "Proceedings, 30th Annual IEEE Symposium on Foundations of Computer Science," pp. 514-519), which states that circled plus P is hard for the Polynomial Hierarchy under randomized reductions. Our approach is circuit-based in the sense that we start with uniform circuit definitions of the Polynomial Hierarchy and apply the Valiant-Vazirani lemma on these circuits (Valiant and Vazirani (1986), Thoeret. Comput. Sci.47, 85-93).

A note on resolving infeasibility in linear programs by constraint relaxation

We study the problem of finding a set of constraints of minimum cardinality which when relaxed in an infeasible linear program, make it feasible. We show the problem is NP-hard even when the constraint matrix is totally unimodular and prove polynomial-time solvability when the constraint matrix and the right-hand-side together form a totally unimodular matrix.

Can equipartition fields produce the tilts of bipolar magnetic regions?

The effect of turbulence on the nonaxisymmetric flux rings of equipartition field strength in bipolar magnetic regions is studied on the basis of the small-scale momentum exchange mechanism and the giant cell drag combined with the Kelvin-Helmholtz drag mechanism. It is shown that the giant cell drag and small-scale momentum exchange mechanism can make equipartition flux loops emerge at low latitudes, in addition to making them exhibit the observed tilts. However, the sizes of the flux tubes have to be restricted to a couple of hundred kilometers. An ad hoc constraint on the footpoints of the flux loops is introduced by not letting them move in the phi direction, and it is found that equipartition fields of any size can be made to emerge at sunspot latitudes with the observed tilts by suitably adjusting the footpoint separations.

Minimizing total completion time on a batch processing machine with job families

We consider the problem of minimizing the total completion time on a single batch processing machine. The set of jobs to be scheduled can be partitioned into a number of families, where all jobs in the same family have the same processing time. The machine can process at most B jobs simultaneously as a batch, and the processing time of a batch is equal to the processing time of the longest job in the batch. We analyze that properties of an optimal schedule and develop a dynamic programming algorithm of polynomial time complexity when the number of job families is fixed. The research is motivated by the problem of scheduling burn-in ovens in the semiconductor industry

Molecular structure of Lantadene-B&C, triterpenoids ofantana camara, red variety: Lantadene-B, 22β-angeloyloxy-3-oxoolean-12-en-28-oic acid; Lantadene-C, 22 β-(S)-2′-methyl butanoyloxy-3-oxoolean-12-en-28-oic acid

(I)Lantadene-B: C35H52O5,M r =552.80, MonoclinicC2,a=25.65(1),b=6.819(9),c=18.75(1) Å,beta=100.61(9),V=3223(5) Å3,Z=4,D x =1.14 g cm–3 CuKagr (lambda=1.5418A),mgr=5.5 cm–1,F(000)=1208,R=0.118,wR=0.132 for 1527 observed reflections withF o ge2sgr(F o ). (II)Lantadene-C: C35H54O5·CH3OH,Mr=586.85, Monoclinic,P21,a=9.822(3),b=10.909(3),c=16.120(8)Å,beta=99.82(4),V=1702(1)Å3,Z=2,D x =1.145 g cm–3, MoKagr (lambda=0.7107Å), mgr=0.708 cm–1 F(000)=644,R=0.098, wR=0.094 for 1073 observed reflections. The rings A, B, C, D, and E aretrans, trans, trans, cis fused and are in chair, chair, sofa, half-chair, chair conformations, respectively, in both the structures. In the unit cell the molecules are stabilized by O-HctdotO hydrogen bonds in both the structures, however an additional C-HctdotO interaction is observed in the case of Lantadene-C.

Raman spectral studies of borate glasses

Raman spectroscopic measurements in borate glasses have been reviewe. The review shows that the technique is useful in identifying the structural groups present in the borate on the basis of the Krogh-Moe hypothesis. Vitreous B2O3 and alkali borates are extensvvely studied and a satisfactory assignment of bands is possible by a careful consideration of the literature. A cation effect on the borate netwoork is observed. Availaable measurements on binary borates other than alkali borates and on ternary borates are limited and more work is required to identify the structural modifications that take place with composition. Mixed alkali effect is reported only lithium-caesium borade and shows the formation of non-bridging oxygens, destroying the six-membered rings when Li2O is replaced by Cs2O. Fast ionic glasses (alkali borates containing alkali halides) yield the same Raman spectra as the alkali borates, except when the alkali is a fluoride.