Association and Shape of Molecules Using Free Length Theory

Abstract

Traditionally workers engaged in calculation of the ultrasonic velocity in liquid mixtures using Jacobson's Free Length Theory (FLT) arrive at the conclusion that the predictions of FLT produce large deviations when compared with experimental velocities. Such workers seemed to have ignored the necessity of incorporating two parameters in FLT as originally suggested by Jacobson himself: one, to account for the association, and the other, for the shape of the component molecules in the mixture. By introducing the association factor and deriving explicit expressions for different shapes of the molecules, the present work has demonstrated that FLT might be made to predict ultrasonic velocities in the mixtures better. Also this approach can very well be used to account for molecular associations and shapes.     

Design and synthesis of novel indoline-(thio)urea hybrids

Abstract

A series of novel indoline-(thio)urea were designed and prepared using indoline(s) as a new platform and tested as organocatalysts in the Michael and Morita–Baylis–Hillman reactions. Most of the compounds were found to be very active catalysts although they did not promote the enantioselectivity. As agents for the conversion of thiocarbonyl compounds into carbonyl compounds, potentials of PIFA and DDQ were also displayed. Furthermore, DFT calculations rationalized the experimentally observed non-enantioselectivity of the catalysts.     

Tuning the sugar‐response of boronic acid block copolymers

A detailed study of the pH‐ and sugar‐responsive behavior of poly(3‐acrylamidophenylboronic acid pinacol ester)‐b‐poly(N,N‐dimethylacrylamide) (PAPBAE‐b‐PDMA) block copolymers is presented. Reversible addition‐fragmentation chain transfer (RAFT) polymerization of the pinacol ester of 3‐acrylamidophenylboronic acid resulted in homopolymers with molecular weights between 12,000 and 37,000 g/mol. The resulting homopolymers were employed as macro‐chain transfer agents during the polymerization of N,N‐dimethylacrylamide (DMA). Successful chain extension and removal of the pinacol protecting groups to yield poly(3‐acrylamidophenylboronic acid)‐b‐PDMA (PAPBA‐b‐PDMA) with free boronic acid moieties resulted in pH‐ and sugar‐responsive block copolymers that were subsequently investigated for their behavior in aqueous solution. The PAPBA‐b‐PDMA block copolymers were capable of solution self‐assembly due to the PAPBA block being water‐insoluble below its pK_a. The resulting aggregates were demonstrated to solubilize and release model hydrophobic compounds, as demonstrated by fluorescence studies. Dissociation of the aggregates was induced by raising the pH above the pK_a of the boronic acid residues or by adding sugars capable of forming boronate esters. Aggregate size, dissociation kinetics, and the effect of various sugars were considered. The critical sugar concentration needed to induce aggregate dissociation was tuned by incorporation of hydrophilic DMA units within the PAPBA responsive segment to yield PDMA‐b‐poly(3‐acrylamidophenylboronic acid‐co‐DMA) block copolymers. © 2012 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem, 2012     

FOURIER-TRANSFORM RAMAN AND INFRARED SPECTRA AND VIBRATIONAL ASSIGNMENT FOR SOLID GLUTARIMIDE

Abstract

The FT-Raman and FT-IR spectra of crystalline glutarimide and its N-deuterated derivative have been recorded in the range 4000-100 cm^?1. A complete vibrational assignment is given for all internal modes and is supported by normal coordinate analysis based on a general valence force field. The calculated frequencies are in very good agreement with experiment. A close similarity is found for frequencies of the corresponding vibrations of glutarimide and uracils in the solid state. It is concluded that the strength of hydrogen bonding in glutarimide is very similar to that in crystalline pyrimidine nucleic bases.     

Chip-Firing Games on Directed Graphs

We consider the following (solitary) game: each node of a directed graph contains a pile of chips. A move consists of selecting a node with at least as many chips as its outdegree, and sending one chip along each outgoing edge to its neighbors. We extend to directed graphs several results on the undirected version obtained earlier by the authors, P. Shor, and G. Tardos, and we discuss some new topics such as periodicity, reachability, and probabilistic aspects.Among the new results specifically concerning digraphs, we relate the length of the shortest period of an infinite game to the length of the longest terminating game, and also to the access time of random walks on the same graph. These questions involve a study of the Laplace operator for directed graphs. We show that for many graphs, in particular for undirected graphs, the problem whether a given position of the chips can be reached from the initial position is polynomial time solvable.Finally, we show how the basic properties of the probabilistic abacus can be derived from our results.