Gel-phase 19F NMR spectral quality for resins commonly used in solid-phase organic synthesis; a study of peptide solid-phase glycosylations

The spectroscopic properties for seven different commercial resins used in solid-phase synthesis were investigated with (19)F NMR spectroscopy. A fluorine-labeled dipeptide was synthesized on each resin, and the resolution of the (19)F resonances in CDCl(3), DMSO-d(6), benzene-d(6) and CD(3)OD were measured with a conventional NMR spectrometer, i.e. without using magic angle spinning. In general, resins containing poly(ethylene glycol) chains (ArgoGel, TentaGel and PEGA) were found to be favorable for the (19)F NMR spectral quality. Three serine containing tri-, penta-, and heptapeptides were then prepared on an ArgoGel resin functionalized with a fluorine-labeled linker. The resin bound peptides were glycosylated utilizing a thiogalactoside glycosyl donor carrying fluorine-labeled protective groups. Monitoring of the glycosylations with gel-phase (19)F NMR spectroscopy allowed each glycopeptide to be formed in similar 80% yield, using a minimal amount of glycosyl donor (3 x 2 equivalents). In addition, it was found that the glycosylation yields were independent of peptide length.     

Comparative studies of reactions of commercial polymers with molecular oxygen,singlet oxygen,atomic oxygen and ozone—II. Reactions with 1,2-polybutadiene

The oxidations of 1,2-polybutadiene by molecular oxygen, singlet oxygen, atomic oxygen and ozone have been studied using u.v. and i.r. spectroscopic methods. Some possible implications of the results of oxidation in the presence of singlet oxygen (parallel free radical oxidation) and atomic oxygen (formation of NO₂ and its reaction with polymer) are discussed. Crosslinking was observed during all types of oxidation. A new mechanism involving formation of free radicals has been considered in detail. During ozonization of 1,2-polybutadiene, formation of formaldehyde and formic acid were detected. An ozonization mechanism has been proposed.     

Development of combinatorial chemistry methods for coatings: high-throughput adhesion evaluation and scale-up of combinatorial leads

Coupling of combinatorial chemistry methods with high-throughput (HT) performance testing and measurements of resulting properties has provided a powerful set of tools for the 10-fold accelerated discovery of new high-performance coating materials for automotive applications. Our approach replaces labor-intensive steps with automated systems for evaluation of adhesion of 8 x 6 arrays of coating elements that are discretely deposited on a single 9 x 12 cm plastic substrate. Performance of coatings is evaluated with respect to their resistance to adhesion loss, because this parameter is one of the primary considerations in end-use automotive applications. Our HT adhesion evaluation provides previously unavailable capabilities of high speed and reproducibility of testing by using a robotic automation, an expanded range of types of tested coatings by using the coating tagging strategy, and an improved quantitation by using high signal-to-noise automatic imaging. Upon testing, the coatings undergo changes that are impossible to quantitatively predict using existing knowledge. Using our HT methodology, we have developed several coatings leads. These HT screening results for the best coating compositions have been validated on the traditional scales of coating formulation and adhesion loss testing. These validation results have confirmed the superb performance of combinatorially developed coatings over conventional coatings on the traditional scale.     

A Heuristic Decomposition Algorithm for Scheduling Problems on Mixed Graphs

We consider a scheduling problem where a set of n jobs has to be processed on a set of m machines and arbitrary precedence constraints between operations are given. Moreover, for any two operations i and j values a _ij >0 and a _ji >0 may be given where a _ij is the minimal difference between the starting times of operations i and j when operation i is processed first. Often, the objective is to minimize the makespan but we consider also arbitrary regular criteria. Even the special cases of the classical job shop problem J//C_max belong to the set of NP-hard problems. Therefore, approximation or heuristic algorithms are necessary to handle large-dimension problems. Based on the mixed graph model we give a heuristic decomposition algorithm for such a problem, i.e. the initial problem is partitioned into subproblems that can be solved exactly or approximately with a small error bound. These subproblems are obtained by a relaxation of a subset of the set of undirected edges of the mixed graph. The subproblems are successively solved and a proportion of the results obtained for one subproblem is kept for further subproblem definitions. Numerical results of the algorithm presented here are given.