Enantiomeric Cyclic Peptides with Different Caco‐2 Permeability Suggest Carrier‐Mediated Transport

Recently, oral absorption of cyclic hexapeptides was improved by N‐methylation of their backbone amides. However, the number and position of N‐methylations or of solvent exposed NHs did not correlate to intestinal permeability, measured in a Caco‐2 model. In this study, we investigate enantiomeric pairs of three polar and two lipophilic peptides to demonstrate the participation of carrier‐mediated transporters. As expected, all the enantiomeric peptides exhibited identical lipophilicity (logD_7.4) and passive transcellular permeability determined by the parallel artificial membrane permeability assay (PAMPA). However, the enantiomeric polar peptides exhibited different Caco‐2 permeability (P_app) in both directions a–b and b–a. The same trend was observed for one of the lipophilic peptide, whereas the second lipophilic enantiomer pair showed identical Caco‐2 permeability (within the errors). These findings provide the first evidence for the involvement of carrier‐mediated transport for peptides, especially for those of polar nature.     

Amphiphilic block copolymer self‐assemblies of poly(NVP)‐b‐poly(MDO‐co‐vinyl esters): Tunable dimensions and functionalities

Functional, degradable polymers were synthesized via the copolymerization of vinyl acetate (VAc) and 2‐methylene‐1,3‐dioxepane (MDO) using a macro‐xanthate CTA, poly(N‐vinylpyrrolidone), resulting in the formation of amphiphilic block copolymers of poly(NVP)‐b‐poly(MDO‐co‐VAc). The behavior of the block copolymers in water was investigated and resulted in the formation of self‐assembled nanoparticles containing a hydrophobic core and a hydrophilic corona. The size of the resultant nanoparticles was able to be tuned with variation of the hydrophilic and hydrophobic segments of the core and corona by changing the incorporation of the macro‐CTA as well as the monomer composition in the copolymers, as observed by Dynamic Light Scattering, Static Light Scattering, and Transmission Electron Microscopy analyses. The concept was further applied to a VAc derivative monomer, vinyl bromobutanoate, to incorporate further functionalities such as fluorescent dithiomaleimide groups throughout the polymer backbone using azidation and “click” chemistry as postpolymerization tools to create fluorescently labeled nanoparticles. © 2015 Wiley Periodicals, Inc. J. Polym. Sci., Part A: Polym. Chem. 2015 , 53, 2699–2710     

Beyond Stereoselectivity,Switchable Catalysis: Some of the Last Frontier Challenges in Ring‐Opening Polymerization of Cyclic Esters

Metal‐based catalysts and initiators have played a pivotal role in the ring‐opening polymerization (ROP) of cyclic esters, thanks to their high activity and remarkable ability to control precisely the architectures of the resulting polyesters in terms of molar mass, dispersity, microstructure, or tacticity. Today, after two decades of extensive research, the field is slowly reaching maturity. However, several challenges remain, while original concepts have emerged around new types or new applications of catalysis. This Review is not intended to comprehensively cover all of these aspects. Rather, it provides a personal overview of the very recent progress achieved in some selected, important aspects of ROP catalysis—stereocontrol and switchable catalysis. Hence, the first part addresses the development of new metal‐based catalysts for the isoselective ROP of racemic lactide towards stereoblock copolymers, and the use of syndioselective ROP metal catalysts to control the monomer sequence in copolymers. A second part covers the development of ROP catalysts—primarily metal‐based catalysts, but also organocatalysts—that can be externally regulated by the use of chemical or photo stimuli to switch them between two states with different catalytic abilities. Current challenges and opportunities are highlighted.     

A new strategy for synthesis of branched cyclic peptide by Asn side-chain hydrazide ligation

Here, we report a new strategy for rapid synthesis of branched peptide by side-chain hydrazide ligation at Asn. The hydrazide was converted to thioester at Asn side chain by NaNO₂ and thiol reagent, and sequential ligation with an N-terminus Cys-peptide efficiently afforded the branched peptide. A branched cyclic peptide was successfully synthesized by side-chain ligation with a two-Cys-peptide and formation of a disulfide bond. This approach provides a new way for expeditious synthesis of branched peptides and facilitates the design of neopeptides as functional bio-mimics.     

Rank 2 Ample Vector Bundles on Some Smooth Rational Surfaces

Several classification results for ample vector bundles of rank 2 on Hirzebruch surfaces, and on Del Pezzo surfaces, are obtained. In particular, we classify rank 2 ample vector bundles with _c2 less than seven on Hirzebruch surfaces, and with _c2 less than four on Del Pezzo surfaces.     

Cycle and circle tests of balance in gain graphs: Forbidden minors and their groups

We examine two criteria for balance of a gain graph, one based on binary cycles and one on circles. The graphs for which each criterion is valid depend on the set of allowed gain groups. The binary cycle test is invalid, except for forests, if any possible gain group has an element of odd order. Assuming all groups are allowed, or all abelian groups, or merely the cyclic group of order 3, we characterize, both constructively and by forbidden minors, the graphs for which the circle test is valid. It turns out that these three classes of groups have the same set of forbidden minors. The exact reason for the importance of the ternary cyclic group is not clear. © 2005 Wiley Periodicals, Inc. J Graph Theory     

An Improved Gradient Projection-based Decomposition Technique for Support Vector Machines

In this paper we propose some improvements to a recent decomposition technique for the large quadratic program arising in training support vector machines. As standard decomposition approaches, the technique we consider is based on the idea to optimize, at each iteration, a subset of the variables through the solution of a quadratic programming subproblem. The innovative features of this approach consist in using a very effective gradient projection method for the inner subproblems and a special rule for selecting the variables to be optimized at each step. These features allow to obtain promising performance by decomposing the problem into few large subproblems instead of many small subproblems as usually done by other decomposition schemes. We improve this technique by introducing a new inner solver and a simple strategy for reducing the computational cost of each iteration. We evaluate the effectiveness of these improvements by solving large-scale benchmark problems and by comparison with a widely used decomposition package.     

Multicriteria decision making under uncertainty

Formalization for problems of multicriteria decision making under uncertainty is constructed in terms of guaranteed and weak estimates. A relevant definition of the vector maximinimax value is given. Parameterization and approximation of maximum, minimax, and maximinimax values based on the inverse logical convolution are suggested. An application for multicommodity networks is considered. Received: December 13, 2000 / Accepted: August 21, 2001?Published online May 8, 2002