Side Chain Structure Determines Unique Physiologic and Therapeutic Properties of norUrsodeoxycholic Acid in Mdr2(-/-) Mice

24-norursodeoxycholic acid (norUDCA), a side chain-modified ursodeoxycholic acid derivative, has dramatic therapeutic effects in experimental cholestasis and may be a promising agent for the treatment of cholestatic liver diseases. We aimed to better understand the physiologic and therapeutic properties of norUDCA and to test if they are related to its side chain length and/or relative resistance to amidation. For this purpose, Mdr2-/- mice, a model for sclerosing cholangitis, received either a standard diet or a norUDCA-, tauro norursodeoxycholic acid (tauro- norUDCA)-, or di norursodeoxycholic acid (di norUDCA)-enriched diet. Bile composition, serum biochemistry, liver histology, fibrosis, and expression of key detoxification and transport systems were investigated. Direct choleretic effects were addressed in isolated bile duct units. The role of Cftr for norUDCA-induced choleresis was explored in Cftr-/- mice. norUDCA had pharmacologic features that were not shared by its derivatives, including the increase in hepatic and serum bile acid levels and a strong stimulation of biliary HCO3- -output. norUDCA directly stimulated fluid secretion in isolated bile duct units in a HCO3- -dependent fashion to a higher extent than the other bile acids. Notably, the norUDCA significantly stimulated HCO 3- -output also in Cftr-/- mice. In Mdr2-/- mice, cholangitis and fibrosis strongly improved with norUDCA, remained unchanged with tauro- norUDCA, and worsened with di norUDCA. Expression of Mrp4, Cyp2b10, and Sult2a1 was increased by norUDCA and di norUDCA, but was unaffected by tauro- norUDCA. Conclusion:The relative resistance of norUDCA to amidation may explain its unique physiologic and pharmacologic properties. These include the ability to undergo cholehepatic shunting and to directly stimulate cholangiocyte secretion, both resulting in a HCO3- -rich hypercholeresis that protects the liver from cholestatic injury.

New approximation algorithms for minimum cycle bases of graphs

We consider the problem of computing an approximate minimum cycle basis of an undirected edge-weighted graph G with m edges and n vertices; the extension to directed graphs is also discussed. In this problem, a {0,1} incidence vector is associated with each cycle and the vector space over F-2 generated by these vectors is the cycle space of G. A set of cycles is called a cycle basis of G if it forms a basis for its cycle space. A cycle basis where the sum of the weights of the cycles is minimum is called a minimum cycle basis of G. Cycle bases of low weight are useful in a number of contexts, e.g. the analysis of electrical networks, structural engineering, chemistry, and surface reconstruction. We present two new algorithms to compute an approximate minimum cycle basis. For any integer k >= 1, we give (2k - 1)-approximation algorithms with expected running time 0(kmn(1+2/k) + mn((1+1/k)(omega-1))) and deterministic running time 0(n(3+2/k)), respectively. Here omega is the best exponent of matrix multiplication. It is presently known that omega < 2.376. Both algorithms are o(m(omega)) for dense graphs. This is the first time that any algorithm which computes sparse cycle bases with a guarantee drops below the Theta(m(omega)) bound. We also present a 2-approximation algorithm with O(m(omega) root n log n) expected running time, a linear time 2-approximation algorithm for planar graphs and an O(n(3)) time 2.42-approximation algorithm for the complete Euclidean graph in the plane.

New Approximation Algorithms for Minimum Cycle Bases of Graphs

We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed graphs is also discussed. In this problem, a {0,1} incidence vector is associated with each cycle and the vector space over F-2 generated by these vectors is the cycle space of G. A set of cycles is called a cycle basis of G if it forms a basis for its cycle space. A cycle basis where the sum of the weights of the cycles is minimum is called a minimum cycle basis of G. Cycle bases of low weight are useful in a number of contexts, e.g. the analysis of electrical networks, structural engineering, chemistry, and surface reconstruction. Although in most such applications any cycle basis can be used, a low weight cycle basis often translates to better performance and/or numerical stability. Despite the fact that the problem can be solved exactly in polynomial time, we design approximation algorithms since the performance of the exact algorithms may be too expensive for some practical applications. We present two new algorithms to compute an approximate minimum cycle basis. For any integer k >= 1, we give (2k - 1)-approximation algorithms with expected running time O(kmn(1+2/k) + mn((1+1/k)(omega-1))) and deterministic running time O(n(3+2/k) ), respectively. Here omega is the best exponent of matrix multiplication. It is presently known that omega < 2.376. Both algorithms are o(m(omega)) for dense graphs. This is the first time that any algorithm which computes sparse cycle bases with a guarantee drops below the Theta(m(omega) ) bound. We also present a 2-approximation algorithm with expected running time O(M-omega root n log n), a linear time 2-approximation algorithm for planar graphs and an O(n(3)) time 2.42-approximation algorithm for the complete Euclidean graph in the plane.

Additive Spanners and (alpha, beta)-Spanners

An (alpha, beta)-spanner of an unweighted graph G is a subgraph H that distorts distances in G up to a multiplicative factor of a and an additive term beta. It is well known that any graph contains a (multiplicative) (2k - 1, 0)-spanner of size O(n(1+1/k)) and an (additive) (1, 2)-spanner of size O(n(3/2)). However no other additive spanners are known to exist. In this article we develop a couple of new techniques for constructing (alpha, beta)-spanners. Our first result is an additive (1, 6)-spanner of size O(n(4/3)). The construction algorithm can be understood as an economical agent that assigns costs and values to paths in the graph, purchasing affordable paths and ignoring expensive ones, which are intuitively well approximated by paths already purchased. We show that this path buying algorithm can be parameterized in different ways to yield other sparseness-distortion tradeoffs. Our second result addresses the problem of which (alpha, beta)-spanners can be computed efficiently, ideally in linear time. We show that, for any k, a (k, k - 1)-spanner with size O(kn(1+1/k)) can be found in linear time, and, further, that in a distributed network the algorithm terminates in a constant number of rounds. Previous spanner constructions with similar performance had roughly twice the multiplicative distortion.

Surface morphology, optical properties and conductivity changes of poly(3,4-ethylenedioxythiophene): poly(styrenesulfonate) by using additives

The optical properties and electrical conductivity of highly conducting poly(3,4-ethylenedioxythiophene) (PEDOT) doped with poly(styrenesulfonate) (PSS) are reported as a function of the processing additive conditions. The addition of dimethyl sulfoxide (DMSO) increases the conductivity and modifies the dielectric response as observed from the ellipsometric studies. Also the surface roughness and morphology change with the composition of PEDOT: PSS: DMSO and film deposition conditions. The real part of the dielectric function becomes negative in highly conducting samples, indicating the presence of delocalized charge carriers. The real and imaginary parts of the refractive index were determined as a function of wavelength. The results are consistent with the increase in conductivity upon the addition of DMSO.

Dielectric Function of Undoped and Doped Poly2-methoxy-5-(3 `,7 `-dimethyloctyloxy)-1,4-phenylene-vinylene] by Ellipsometry in a Wide Spectral Range

Ellipsometric measurements in a wide spectral range (from 0.05 to 6.5 eV) have been carried out on the organic semiconducting polymer, poly2-methoxy-5-(3',7'-dimethyloctyloxy)-1,4-phenylene-vinylene] (MDMO-PPV), in both undoped and doped states. The real and imaginary parts of the dielectric function and the refractive index are determined accurately, provided that the layer thickness is measured independently. After doping, the optical properties show the presence of new peaks, which could be well-resolved by spectroscopic ellipsometry. Also for the doped material, the complex refractive index, with respect to the dielectric function, has been determined. The broadening of the optical transitions is due to the delocalization of polarons at higher doping level. The detailed information about the dielectric function as well as refractive index function obtained by spectroscopic ellipsometry allows not only qualitative but also quantitative description of the optical properties of the undoped/doped polymer. For the direct characterization of the optical properties of MDMO-PPV, ellipsometry turns out to be advantageous compared to conventional reflection and transmission measurements.

Anthracene-Containing Conjugated Polymer Showing Four Optical Transitions Upon Doping: A Spectroscopic Study

An anthracene-containing poly(arylene-ethynylene)-alt-poly(arylene-vinylene) (PAE-PAV) of general constitutional unit (PhCCAnthrCCPhCHCHAnthrCHCH)(n) bearing two 2-ethylhexyloxy solubilizing side chains on each phenylene (Ph) unit has been synthesized and characterized. The basic electrochemical characterization was done, showing the existence of two non-reversible oxidation and one reversible reduction peaks. The optical properties, the real and imaginary part of the dielectric function, were probed using spectroscopic ellipsometry (SE). The vibrational structure of the undoped/doped polymer was investigated using Fourier transformed infrared spectroscopy. A strong change in the polaronic absorption was observed during the doping, which after modeling revealed the existence of two separated transitions. The optical changes upon doping were additionally recorded using the SE technique. Similar to the results from FT-IR spectroscopy, two new in-the-gap absorptions were found. Moreover, the electrical conductivity as well as the mobility of positive carriers were measured. In the undoped state, the conductivity of the polymer was found to be below the detection limit (