Development and validation of a reversed‐phase HPLC method for CYP1A2 phenotyping by use of a caffeine metabolite ratio in saliva

CYP1A2 is important for metabolizing various clinically used drugs. Phenotyping of CYP1A2 may prove helpful for drug individualization therapy. Several HPLC methods have been developed for quantification of caffeine metabolites in plasma and urine. Aim of the present study was to develop a valid and simple HPLC method for evaluating CYP1A2 activity during exposure in xenobiotics by the use of human saliva. Caffeine and paraxanthine were isolated from saliva by liquid‐liquid extraction (chlorophorm/isopropanol 85/15v/v). Extracts were analyzed by reversed‐phase HPLC on a C₁₈ column with mobile phase 0.1% acetic acid/methanol/acetonitrile (80/20/2 v/v) and detected at 273nm. Caffeine and paraxanthine elution times were <13min with no interferences from impurities or caffeine metabolites. Detector response was linear (0.10–8.00µg/ml, R²>0.99), recovery was >93% and bias <4.47%. Intra‐ and inter‐day precision was <5.14% (n=6). The limit of quantitation was 0.10µg/ml and the limit of detection was 0.018±0.002µg/mL for paraxanthine and 0.032±0.002µg/ml for caffeine. Paraxanthine/caffeine ratio of 34 healthy volunteers was significantly higher in smokers (p<0.001). Saliva paraxanthine/caffeine ratios and urine metabolite ratios were highly correlated (r=0.85, p<0.001). The method can be used for the monitoring of CYP1A2 activity in clinical practice and in studies relevant to exposure to environmental and pharmacological xenobiotics. Copyright © 2015 John Wiley & Sons, Ltd.     

Wavelet Collocation Methods for a First Kind Boundary Integral Equation in Acoustic Scattering

In this paper we consider a wavelet algorithm for the piecewise constant collocation method applied to the boundary element solution of a first kind integral equation arising in acoustic scattering. The conventional stiffness matrix is transformed into the corresponding matrix with respect to wavelet bases, and it is approximated by a compressed matrix. Finally, the stiffness matrix is multiplied by diagonal preconditioners such that the resulting matrix of the system of linear equations is well conditioned and sparse. Using this matrix, the boundary integral equation can be solved effectively.     

Influence of the sulfonate countercation on the thermal stability of nafion perfluorosulfonate membranes

We report a strong dependence of the thermal stability of Nafion® perfluorosulfonate ionomer on the nature of the counterion associated with the fixed sulfonate site. These results were obtained using thermal gravimetric analysis on a series of alkali metal and alkyl ammonium cation-exchanged Nafion films. We have found that the temperature of decomposition of Nafion is inversely dependent on the size of the exchanged cation; i.e., Nafion films show improved thermal stability as the size of the counter cation decreases. We attribute this inverse relationship of thermal stability with counterion size to an initial decomposition reaction which is strongly influenced by the strength of the sulfonate-coun-terion interaction. © 1993 John Wiley & Sons, Inc.     

On the Moments of Overflow and Freed Carried Traffic for the GI/M/C/0 System

In circuit-switched networks call streams are characterized by their mean and peakedness (two-moment method). The GI/M/C/0 system is used to model a single link, where the GI-stream is determined by fitting moments appropriately. For the moments of the overflow traffic of a GI/M/C/0 system there are efficient numerical algorithms available. However, for the moments of the freed carried traffic, defined as the moments of a virtual link of infinite capacity to which the process of calls accepted by the link (carried arrival process) is virtually directed and where the virtual calls get fresh exponential i.i.d. holding times, only complex numerical algorithms are available. This is the reason why the concept of the freed carried traffic is not used. The main result of this paper is a numerically stable and efficient algorithm for computing the moments of freed carried traffic, in particular an explicit formula for its peakedness. This result offers a unified handling of both overflow and carried traffics in networks. Furthermore, some refined characteristics for the overflow and freed carried streams are derived.     

Randomized greedy matching

We consider a randomized version of the greedy algorithm for finding a large matching in a graph. We assume that the next edge is always randomly chosen from those remaining. We analyze the performance of this algorithm when the input graph is fixed. We show that there are graphs for which this Randomized Greedy Algorithm (RGA) usually only obtains a matching close in size to that guaranteed by worst-case analysis (i.e., half the size of the maximum). For some classes of sparse graphs (e.g., planar graphs and forests) we show that the RGA performs significantly better than the worst-case. Our main theorem concerns forests. We prove that the ratio to maximum here is at least 0.7690…, and that this bound is tight.     

Analytic calculation of scaling dimensions: Tricritical hard squares and critical hard hexagons

The finite-size corrections, central chargesc, and scaling dimensionsx of tricritical hard squares and critical hard hexagons are calculated analytically. This is achieved by solving the special functional equation or inversion identity satisfied by the commuting row transfer matrices of these lattice models at criticality. The results are expressed in terms of Rogers dilogarithms. For tricritical hard squares we obtainc=7/10,x=3/40, 1/5, 7/8, 6/5 and for hard hexagons we obtainc=4/5,x=2/15, 4/5, 17/15, 4/3, 9/5, in accord with the predictions of conformal and modular invariance.