Polynomial Quantization on Rank One Para-Hermitian Symmetric Spaces

We construct the polynomial quantization on the space G/H where G=SL(n,R),H=GL(n–1,R). It is a variant of quantization in the spirit of Berezin. In our case covariant and contravariant symbols are polynomials on G/H. We introduce a multiplication of covariant symbols, establish the correspondence principle, study transformations of symbols (the Berezin transform) and of operators. We write a full asymptotic decomposition of the Berezin transform.     

Explicit 2-Factorisations of the Odd Graph

In this note we show how 1-factors in the middle two layers of the discrete cube can be used to construct 2-factors in the Odd graph (the Kneser graph of (k − 1)-sets from a (2k − 1)-set). In particular, we use the lexical matchings of Kierstead and Trotter, and the modular matchings of Duffus, Kierstead and Snevily, to give explicit constructions of two different 2-factorisations of the Odd graph. This revised version was published online in September 2006 with corrections to the Cover Date.     

An approach to deciding the observational equivalence of Algol-like languages

We prove that the observational equivalence of third-order finitary (i.e. recursion-free) Idealized Algol (IA) is decidable using Game Semantics. By modelling the state explicitly in our games, we show that the denotation of a term M of this fragment of IA is a compactly innocent strategy-with-state, i.e. the strategy is generated by a finite view function f_M. Given any such f_M, we construct a real-time deterministic pushdown automaton (DPDA) that recognizes the complete plays of the knowing-strategy denotation of M. Since such plays characterize observational equivalence, and there is an algorithm for deciding whether any two DPDAs recognize the same language, we obtain a procedure for deciding the observational equivalence of third-order finitary IA. Restricted to second-order terms, the DPDA representation cuts down to a deterministic finite automaton; thus our approach gives a new proof of Ghica and McCusker’s regular-expression characterization for this fragment. Our algorithmic representation of program meanings, which is compositional, provides a foundation for model-checking a wide range of behavioural properties of IA and other cognate programming languages. Another result concerns second-order IA with full recursion: we show that observational equivalence for this fragment is undecidable.     

Analysis of end point vibrations of a two-link manipulator by integrated CAD/CAE procedures

In this work, the effect of flexibility on the trajectory of a planar two-link manipulator is studied using integrated computer-aided design/analysis (CAD/CAE) procedures. The solid models and finite element models of the parts of the manipulator are created by using the CAD/CAE software I-DEAS. The assembly is defined, and knowing the payload and the end point trajectory, the velocities and accelerations of the parts, joint forces and driving torques are calculated using the rigid body dynamics. All the time dependent nodal forces acting on the parts including distributed gravity and inertia forces are created in files with the I-DEAS program file format. The finite element vibration analysis of the parts is performed by I-DEAS. The end point vibrations and the deviations from the rigid-body trajectory are analyzed for different types of end point acceleration curves. A circular trajectory is considered as an example. It is observed that the precision of the manipulator can be increased by testing different end point acceleration curves without changing the trajectory and the duration of the end point work. The procedure explained in this work can be used for this purpose successfully.     

Some non‐standard problems in viscous flow

Energy bounds are derived for Dirichlet type boundary value problems for the Navier–Stokes and Stokes equations when a combination of the solution values initially and at a later time is prescribed. The bounds are obtained by means of a differential inequality and imply uniqueness and continuous data dependence of the solutions for a range of values of the parameter in the non‐standard auxiliary condition. Copyright © 2004 John Wiley & Sons, Ltd.     

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     

Addition of Bromotrichloromethane and Tetrachloromethane to cis-Cyclooctene,Cyclohexene, and Norbornadiene in the Presence of Palladium(II) Complexes

Addition of bromotrichloromethane and tetrachloromethane to alkenes in the presence of palladium(II) complexes begins with single-electron transfer from the palladium atom to polyhalomethane molecule, followed by fragmentation of the radical anion thus formed and generation of trichloromethyl radical. Halogen transfer to a carbon-centered radical arising from addition of trichloromethyl radical at the double bond occurs both from the polyhalomethane molecule and from halide palladium complex.     

Synthesis and Structure of Mixed Phosphonium-iodonium Ylide

A mixed phosphonium-iodonium ylide, phenyliodoniumethoxycarbonylmethylenetriphenylphosphorane borofluoride, was synthesized. Its structure was established by means of X-ray diffraction analysis. Temperature dependence of ¹H, ¹³C, and ³¹P spectra of the ylide synthesized was investigated. A dynamic equilibrium between Z and E-isomers was observed.