Formation of porous polymer morphology by microsyneresis during divinylbenzene polymerization

This article describes the investigation of the importance of various reaction conditions on microsyneretic pore formation during polymerization of divinylbenzene (DVB) under so‐called “solvothermal” conditions. To induce microsyneretic pore formation, the most important parameter is an unusually high dilution of monomers with a “good” porogen solvating the polymer chains. High dilution and solvation of the growing poly(DVB) chains promote the prolongation of the polymer chains rather than their interconnection by crosslinking. Consequently, when the polymer gel density reaches the point where syneresis starts, the polymer network is geometrically too extensive to be broken up into precipitating entities and, instead, porogen droplets are formed within the continuous polymer gel. The pore geometry created by microsyneresis offers high surface area in wide mesopores and hence, high capacity for supporting functional groups or reactions with much better accessibility than narrow pores between polymer microspheres produced by macrosyneresis in conventional styrenic polymer supports. © 2015 Wiley Periodicals, Inc. J. Polym. Sci., Part B: Polym. Phys. 2015 , 53, 774–781     

On I-fuzzy topologies derived from a decreasing family of I-topologies

The aim of this paper is to study I-fuzzy topologies (fuzzy topologies in ostak's sense) derived from decreasing families of I-topologies (fuzzy topologies in Chang's sense), defined on a set X.     

A characterization of cardinalsκ such that 2λ = 2κ wheneverκ ≦λ < 2κ

We characterize cardinalsκ such that 2^λ = 2^κ wheneverκ ≦λ < 2^κ using ideals in small algebras of sets satisfying certain completeness and saturation conditions. Research of this author was supported by an NSF Grant.     

How to work with one-dimensional quadratic maps

We analyse some identifiers which can univocally identify hyperbolic components and Misiurewicz points of one-dimensional quadratic maps. After seeing the equivalence among the different identifiers and how to go from one to another, we show which are the best for some specific tasks. Likewise, we present the analytic expressions, some of them shown for the first time in this paper, to calculate these identifiers. Some experimental considerations are taken into account.     

Determination of iphosphamide and seven metabolites in blood plasma,as stable trifluoroacetyl derivatives,by electron capture chemical ionization GC-MS

A method is described for the determination of the antitumor agent iphosphamide and seven of its metabolites in the plasma of cancer patients by multiple ion monitoring (MIM) GC-MS, mainly using the electron capture chemical ionization mode, of stable methyl and/or trifluoroacetyl derivatives. The metabolites determined were 2- and 3-dechloroethyliphosphamide, 4-ketoiphosphamide, carboxyiphosphamide, iphosphamide mustard, and two previously undetected metabolites, chloroethylamine and 1,3-oxazolidine-2-one. The isolation of the acidic and neutral metabolites was performed by solid phase extraction on to C₁₈ adsorbent at pH 4. The weakly acidic iphosphamide mustard, isolated under these conditions with a yield of ca 50%, was measured as a stable methyltrifluoroacetyl derivative, in contrast to the corresponding phosphoramide mustard of the isomer cyclophosphamide which decomposes during derivatization. Chloroethylamine and 1,3-oxazolidine-2-one were isolated with high yield by liquid extraction with ethyl acetate at pH 10. Selective measurement of several metabolite derivatives with similar retention times was performed by multiple ion monitoring MS of specific ion masses, using a methyl phenyl siloxane capillary column previously employed in the study of cyclophosphamide metabolites. Quantitation of metabolites in patient plasma samples could be performed in the concentration range 3 ng to 20 μg per ml of original plasma.     

Branch and win: OR tree search algorithms for solving combinatorial optimisation problems

Currently, most combinatorial optimisation problems have to be solved, if the optimum solution is sought, using general techniques to explore the space of feasible solutions and, more specifically, through exploratory enumerative procedures in trees and search graphs. We propose Branch and Win, a general formulation for understanding and synthesising the different tree search procedures that have been presented in the literature of operations research as well as in that of artificial intelligence. Several general ideas are also presented, whose application allows designing new hybrid search algorithms, in order to implement the procedure.