The prop-2-ynyloxy carbonyl function (POC): A new amino-protecting group removable from sulfur-containing peptides by ultrasonic irradiation with tetrathiomolybdate under mild and neutral conditions

The prop-2-ynyloxy carbonyl function (POC) which can be cleaved under mild and neutral conditions in the presence of benzyltriethylammonium tetrathiomolybdate has been developed as a new protecting group for amines. (C) 1999 Elsevier Science Ltd. All rights reserved.

On the achievable rates of sources having a group alphabet in a distributed source coding setting

We consider the problem of compression via homomorphic encoding of a source having a group alphabet. This is motivated by the problem of distributed function computation, where it is known that if one is only interested in computing a function of several sources, then one can at times improve upon the compression rate required by the Slepian-Wolf bound. The functions of interest are those which could be represented by the binary operation in the group. We first consider the case when the source alphabet is the cyclic Abelian group, Zpr. In this scenario, we show that the set of achievable rates provided by Krithivasan and Pradhan [1], is indeed the best possible. In addition to that, we provide a simpler proof of their achievability result. In the case of a general Abelian group, an improved achievable rate region is presented than what was obtained by Krithivasan and Pradhan. We then consider the case when the source alphabet is a non-Abelian group. We show that if all the source symbols have non-zero probability and the center of the group is trivial, then it is impossible to compress such a source if one employs a homomorphic encoder. Finally, we present certain non-homomorphic encoders, which also are suitable in the context of function computation over non-Abelian group sources and provide rate regions achieved by these encoders.

Fast-Group-Decodable STBCs via Codes over GF(4)

In this paper we construct low decoding complexity STBCs by using the Pauli matrices as linear dispersion matrices. In this case the Hurwitz-Radon orthogonality condition is shown to be easily checked by transferring the problem to $\mathbb{F}_4$ domain. The problem of constructing low decoding complexity STBCs is shown to be equivalent to finding certain codes over $\mathbb{F}_4$. It is shown that almost all known low complexity STBCs can be obtained by this approach. New codes are given that have the least known decoding complexity in particular ranges of rate.

Density-matrix renormalization-group study of low-lying excitations of polyacene within a Pariser-Parr-Pople model

We have carried out symmetrized density-matrix renormalization-group calculations to study the nature of excited states of long polyacene oligomers within a Pariser-Parr-Pople Hamiltonian. We have used the C-2 symmetry, the electron-hole symmetry, and the spin parity of the system in our calculations. We find that there is a crossover in the lowest dipole forbidden two-photon state and the lowest dipole allowed excited state with size of the oligomer. In the long system limit, the two-photon state lies below the lowest dipole allowed excited state. The triplet state lies well below the two-photon state and energetically does not correspond to its description as being made up of two triplets. These results are in agreement with the general trends in linear conjugated polymers. However, unlike in linear polyenes wherein the two-photon state is a localized excitation, we find that in polyacenes, the two-photon excitation is spread out over the system. We have doped the systems with a hole and an electron and have calculated the charge excitation gap. Using the charge gap and the optical gap, we estimate the binding energy of the 1(1)B(-) exciton to be 2.09 eV. We have also studied doubly doped polyacenes and find that the bipolaron in these systems, to be composed of two separated polarons, as indicated by the calculated charge-density profile and charge-charge correlation function. We have studied bond orders in various states in order to get an idea of the excited state geometry of the system. We find that the ground state, the triplet state, the dipole allowed state, and the polaron excitations correspond to lengthening of the rung bonds in the interior of the oligomer while the two-photon excitation corresponds to the rung bond lengths having two maxima in the system.

Effect of the sulfonic acid group on copolymers of aniline and toluidine with m-aminobenzene sulfonic acid

This article describes the results of the preparation and characterization of self-doped conducting copolymers of aniline and toluidine with m-aminobenzene sulfonic acid. The copolymers have an intrinsic acid group that is capable of doping polyaniline. Spectroscopic, morphological, and electrical conductivity studies have provided insight into the structural and electronic properties of the copolymers. The differences in the properties of polyaniline and polytoluidine due to the sulfonic acid ring substituent on the phenyl ring are discussed. The scanning electron micrographs of the copolymers reveal regions of sharp-edged, needle-shaped structures, whereas the X-ray diffraction patterns show that the copolymers are relatively more crystalline in nature. (C) 2002 Wiley Periodicals, Inc.

Propargyloxycarbonyl (Poc) amino acid chlorides as efficient coupling reagents for the synthesis of 100% diastereopure peptides and resin bound tetrathiomolybdate as an effective deblocking agent for the Poc group

Synthesis of short peptides using propargyloxycarbonyl amino acid chlorides as effective coupling reagents and polymer supported tetrathiomolybdate as an efficient deblocking agent are reported.

density matrix renormalization group study of polyacene

We study the nature of excited states of long polyacene oligomers within a Pariser-Parr-Pople (PPP) Hamiltonian using the Symmetrized Density Matrix Renormalization Group (SDMRG) technique. We find a crossover between the two-photon state and the lowest dipole allowed excited state as the system size is increased from tetracene to pentacene. The spin-gap is the smallest gap. We also study the equilibrium geome tries in the ground and excited states from bond orders and bond-bond correlation functions. We find that the Peierls instability in the ground state of polyacene is conditional both from energetics and structure factors computed froth correlation functions.

On the Compressibility of non-Abelian-Group Sources in a Distributed Source Coding Setting

We consider the problem of compression of a non-Abelian source.This is motivated by the problem of distributed function computation,where it is known that if one is only interested in computing a function of several sources, then one can often improve upon the compression rate required by the Slepian-Wolf bound. Let G be a non-Abelian group having center Z(G). We show here that it is impossible to compress a source with symbols drawn from G when Z(G) is trivial if one employs a homomorphic encoder and a typical-set decoder.We provide achievable upper bounds on the minimum rate required to compress a non-Abelian group with non-trivial center. Also, in a two source setting, we provide achievable upper bounds for compression of any non-Abelian group, using a non-homomorphic encoder.

Visualizing lone pairs in compounds containing heavier congeners of the carbon and nitrogen group elements

In this mini-review, I discuss some recent work on the stereochemistry and bonding of lone pairs of electrons in divalent compounds of the heavier carbon group elements (SnII, PbII) and in trivalent compounds of the heavier nitrogen group elements (BiIII). Recently developed methods that permit the real-space visualization of bonding patterns on the basis of density functional calculations of electronic structure, reveal details of the nature of s electron lone pairs in compounds of the heavier main group elements – their stereochemistry and their inertness (or lack thereof). An examination of tetragonal P4/nmm SnO, a-PbO and BiOF, and cubic Fm3m PbS provides a segue into perovskite phases of technological significance, including ferroelectric PbTiO3 and antiferroelectric/piezoelectric PbZrO3, in both of which the lone pairs on Pb atoms play a pivotal rôle.

Higgs Working Group Summary Report

Report of the Higgs working group for the Workshop "Physics at TeV Colliders", Les Houches, France 8-18 June 1999. It contains 6 separate sections: 1. Measuring Higgs boson couplings at the LHC. 2. Higgs boson production at hadron colliders at NLO. 3. Signatures of Heavy Charged Higgs Bosons at the LHC. 4. Light stop effects and Higgs boson searches at the LHC. 5. Double Higgs production at TeV Colliders in the MSSM. 6. Programs and Tools for Higgs Bosons.

Rhodium Carbenoid Mediated C-H Activation of a Tertiary Methyl Group: An Enantiospecific Approach to the Angular Triquinanes Norsilphiperfolane and Norcameroonanes

An enantiospecific synthesis of the angular triquinane system present in the sesquiterpenes cameroonanes and silphiperfolanes has been accomplished, starting from 5-isopropenyl-2-methylcyclopent-1-ene-1-methanol [readily available in three steps from (R)-limonene] employing an intramolecular rhodium carbenoid insertion into the C-H bond of a tertiary methyl group for the construction of the triquinane system.

On four-group ML decodable distributed space time codes for cooperative communication

A construction of a new family of distributed space time codes (DSTCs) having full diversity and low Maximum Likelihood (ML) decoding complexity is provided for the two phase based cooperative diversity protocols of Jing-Hassibi and the recently proposed Generalized Non-orthogonal Amplify and Forward (GNAF) protocol of Rajan et al. The salient feature of the proposed DSTCs is that they satisfy the extra constraints imposed by the protocols and are also four-group ML decodable which leads to significant reduction in ML decoding complexity compared to all existing DSTC constructions. Moreover these codes have uniform distribution of power among the relays as well as in time. Also, simulations results indicate that these codes perform better in comparison with the only known DSTC with the same rate and decoding complexity, namely the Coordinate Interleaved Orthogonal Design (CIOD). Furthermore, they perform very close to DSTCs from field extensions which have same rate but higher decoding complexity.

Incentive compatible mechanisms for group ticket allocation in software maintenance services

A customer reported problem (or Trouble Ticket) in software maintenance is typically solved by one or more maintenance engineers. The decision of allocating the ticket to one or more engineers is generally taken by the lead, based on customer delivery deadlines and a guided complexity assessment from each maintenance engineer. The key challenge in such a scenario is two folds, un-truthful (hiked up) elicitation of ticket complexity by each engineer to the lead and the decision of allocating the ticket to a group of engineers who will solve the ticket with in customer deadline. The decision of allocation should ensure Individual and Coalitional Rationality along with Coalitional Stability. In this paper we use game theory to examine the issue of truthful elicitation of ticket complexities by engineers for solving ticket as a group given a specific customer delivery deadline. We formulate this problem as strategic form game and propose two mechanisms, (1) Division of Labor (DOL) and (2) Extended Second Price (ESP). In the proposed mechanisms we show that truth telling by each engineer constitutes a Dominant Strategy Nash Equilibrium of the underlying game. Also we analyze the existence of Individual Rationality (IR) and Coalitional Rationality (CR) properties to motivate voluntary and group participation. We use Core, solution concept from co-operative game theory to analyze the stability of the proposed group based on the allocation and payments.

Conjugacy invariant pseudo-norms, representability and RNA secondary structures

To a reasonable approximation, a secondary structures of RNA is determined by Watson-Crick pairing without pseudo-knots in such a way as to minimise the number of unpaired bases: We show that this minimal number is determined by the maximal conjugacy-invariant pseudo-norm on the free group on two generators subject to bounds on the generators. This allows us to construct lower bounds on the minimal number of unpaired bases by constructing conjugacy invariant pseudo-norms. We show that one such construction, based on isometric actions on metric spaces, gives a sharp lower bound. A major goal here is to formulate a purely mathematical question, based on considering orthogonal representations, which we believe is of some interest independent of its biological roots.