Synthesis and Aggregation Behavior of Pluronic F87/Poly(acrylic acid) Block Copolymer with Doxorubicin

Poly(acrylic acid) (PAA) was grafted onto both termini of Pluronic F87 (PEO₆₇-PPO₃₉-PEO₆₇) via atom transfer radical polymerization to produce a novel muco-adhesive block copolymer PAA₈₀-b-F₈₇-b-PAA₈₀. It was observed that PAA₈₀-F₈₇-PAA₈₀ forms stable complexes with weakly basic anti-cancer drug, Doxorubicin. Thermodynamic changes due to the drug binding to the copolymer were assessed at different pH by isothermal titration calorimetry (ITC). The formation of the polymer/drug complexes was studied by turbidimetric titration and dynamic light scattering. Doxorubicin and PAA-b-F87-b-PAA block copolymer are found to interact strongly in aqueous solution via non-covalent interactions over a wide pH range. At pH>4.35, drug binding is due to electrostatic interactions. Hydrogen-bond also plays a role in the stabilization of the PAA₈₀-F₈₇-PAA₈₀/DOX complex. At pH 7.4 (α=0.8), the size and stability of polymer/drug complex depend strongly on the doxorubicin concentration. When CDOX <0.13mM, the PAA₈₀-F₈₇-PAA₈₀ copolymer forms stable inter-chain complexes with DOX (110 ~ 150 nm). When CDOX >0.13mM, as suggested by the light scattering result, the reorganization of the polymer/drug complex is believed to occur. With further addition of DOX (CDOX >0.34mM), sharp increase in the turbidity indicates the formation of large aggregates, followed by phase separation. The onset of a sharp enthalpy increase corresponds to the formation of a stoichiometric complex.

Triangulation by Continuous Embedding

When triangulating a belief network we aim to obtain a junction tree of minimum state space. Searching for the optimal triangulation can be cast as a search over all the permutations of the network's vaeriables. Our approach is to embed the discrete set of permutations in a convex continuous domain D. By suitably extending the cost function over D and solving the continous nonlinear optimization task we hope to obtain a good triangulation with respect to the aformentioned cost. In this paper we introduce an upper bound to the total junction tree weight as the cost function. The appropriatedness of this choice is discussed and explored by simulations. Then we present two ways of embedding the new objective function into continuous domains and show that they perform well compared to the best known heuristic.