Determination of moxifloxacin in tablets and human urine by square-wave adsorptive voltammetry

This work presents an electroanalytical methodology developed for square-wave voltammetry based in the electrochemical reduction in hanging mercury drop electrode (HMDE), which is simple, fast, reliable and sensitive for determination of moxifloxacin (MOXI) in tablets and spiked urine human samples. The support electrolyte that provided a more defined and intense peak current for MOXI determination was the phosphate buffer 0.04 mol l^{− 1} pH 8.0. In the best-optimized conditions the drug presented an only peak of reduction at − 1.38 V vs. Ag/AgCl, using an E_acc. of − 0.30 V. An LOD of 0.44 and 3.20 ng ml^{− 1} and an LOQ of 1.46 and 10.60 ng ml^{− 1} were found for the pure standard of moxifloxacin and in the presence of matrix, respectively. A good recovery was obtained for assay spiked urine samples and a good quantification of MOXI was achieved in a commercial formulation. The methodology proposed was more sensitive than the spectrofluorimetric and spectrophotometric method with precision and accuracy equivalent.     

Large cycles in random generalized Johnson graphs

This paper studies thresholds in random generalized Johnson graphs for containing large cycles, i.e. cycles of variable length growing with the size of the graph. Thresholds are obtained for different growth rates.     

带有随机初值的复值Ginzburg-Landau方程的弱平均动力学*

本文研究了无界域上的带有随机初值的复值Ginzburg-Landau方程.首先, 基于解过程的全局适定性, 建立了带有随机初值的Ginzburg-Landau方程的平均随机动力系统.然后, 证明了弱拉回平均随机吸引子的存在唯一性以及随机吸引子的周期性,并将其进一步推广到加权空间L²(?, L²_σ(R)).     

Immanant positivity for Catalan-Stieltjes matrices

We give some sufficient conditions for the nonnegativity of immanants of square submatrices of Catalan-Stieltjes matrices and their corresponding Hankel matrices. To obtain these sufficient conditions, we construct new planar networks with a recursive nature for Catalan-Stieltjes matrices. As applications, we provide a unified way to produce inequalities for many combinatorial polynomials, such as the Eulerian polynomials, Schröder polynomials, and Narayana polynomials.     

Exact SOR convergence regions for a general class ofp-cyclic matrices

Linear systems whose associated block Jacobi iteration matrixB is weakly cyclic generated by the cyclic permutation = (₁,₂,..., _p ) in the spirit of Li and Varga are considered. Regions of convergence for the corresponding blockp-cyclic SOR method are derived and the exact convergence domains for real spectra, (B ^p ), of the same sign are obtained. Moreover, analytical expressions for two special cases forp = 5 are given and numerical results are presented confirming the theory developed. The tools used for this work are mainly from complex analysis and extensive use of (asteroidal) hypocycloids in the complex plane is made to produce our results.This work was supported in part by AFOSR grant F49620-92-J-0069 and NSF grant 9202536-CCR.     

Spectra of graphs and fractal dimensions II

This paper continues the study of exponentsd(x), d (x), d _R (x) andd (x) for graphG; and the nearest neighbor random walk {X _n } _nN onG, if the starting pointX ₀=x is fixed. These exponents are responsible for the geometric, resistance, diffusion and spectral properties of the graph. The main concern of this paper is the relation of these exponents to the spectral density of the transition matrix. A series of new exponentse, e ,e _R ,e are introduced by allowingx to vary along the vertices. The results suggest that the geometric and resistance properties of the graph are responsible for the diffusion speed on the graph.     

Dynamic structure factor in a random diffusion model

Let {X _t:0} denote random walk in the random waiting time model, i.e., simple random walk with jump ratew ^–1(X _t), where {w(x):x^d} is an i.i.d. random field. We show that (under some mild conditions) theintermediate scattering function F(q,t)=E ₀ (q^d) is completely monotonic int (E ₀ denotes double expectation w.r.t. walk and field). We also show that thedynamic structure factor S(q, w)=2 ₀ cos(t)F(q, t) exists for 0 and is strictly positive. Ind=1, 2 it diverges as 1/||^1/2, resp. –ln(||), in the limit 0; ind3 its limit value is strictly larger than expected from hydrodynamics. This and further results support the conclusion that the hydrodynamic region is limited to smallq and small such that ||D |q|², whereD is the diffusion constant.     

On three conjectures by K. E. Shuler

Some fifteen years ago, Shuler formulated three conjectures relating to the large-time asymptotic properties of a nearest-neighbor random walk on ² that is allowed to make horizontal steps everywhere but vertical steps only on a random fraction of the columns. We give a proof of his conjectures for the situation where the column distribution is stationary and satisfies a certain mixing codition. We also prove a strong form of scaling to anisotropic Brownian motion as well as a local limit theorem. The main ingredient of the proofs is a large-deviation estimate for the number of visits to a random set made by a simple random walk on . We briefly discuss extensions to higher dimension and to other types of random walk.Dedicated to Prof. K. E. Shuler on the occasion of his 70th birthday, celebrated at a Symposium in his honor on July 13, 1992, at the University of California at San Diego, La Jolla, California.     

Structural aspects of antibody-antigen interaction revealed through small random peptide libraries

Summary Two small random peptide libraries, one composed of 4550 dodecapeptides and one of 8000 tripeptides, were synthesized in newly developed credit-card format miniPEPSCAN cards (miniPEPSCAN libraries). Each peptide was synthesized in a discrete well (455 peptides/card). The two miniPEPSCAN libraries were screened with three different monoclonal antibodies (Mabs). Two other random peptide libraries, expressed on the wall of bacteria (recombinant libraries) and composed of 10⁷ hexa- and octapeptides, were screened with the same three Mabs. The aim of this study was to compare the amino acid sequence of peptides selected from small and large pools of random peptides and, in this way, investigate the potential of small random peptide libraries. The screening of the two miniPEPSCAN libraries resulted in the identification of a surprisingly large number of antibody-binding peptides, while the screening of the large recombinant libraries, using the same Mabs, resulted in the identification of only a small number of peptides. The large number of peptides derived from the small random peptide libraries allowed the determination of consensus sequences. These consensus sequences could be related to small linear and nonlinear parts of the respective epitopes. The small number of peptides derived from the large random peptide libraries could only be related to linear epitopes that were previously mapped using small libraries of overlapping peptides covering the antigenic protein. Thus, with respect to the cost and speed of identifying peptides that resemble linear and nonlinear parts of epitopes, small diversity libraries based on synthetic peptides appear to be superior to large diversity libraries based on expression systems.Abbreviations ABTS 2,2-azino-di-3-ethylbenzthiazoline sulfonate - EGF epidermal growth factor - Mab monoclonal antibody - OD_ccd optical density obtained using CCD camera - RAMPO rabbit-antimouse peroxidase - SDS sodium dodecylsulfate - TGEV transmissible gastroenteritis virus     

On the extreme spectral properties of Toeplitz matrices generated byL 1 functions with several minima/maxima

In this paper we are concerned with the asymptotic behavior of the smallest eigenvalue ₁ ⁽ⁿ⁾ of symmetric (Hermitian)n ×n Toeplitz matricesT _n (f) generated by an integrable functionf defined in [–, ]. In [7, 8, 11] it is shown that ₁ ⁽ⁿ⁾ tends to essinff =m _f in the following way: ₁ ⁽ⁿ⁾ –m _f 1/n ^2k . These authors use three assumptions:A1)f –m _f has a zero inx =x ₀ of order 2k.A2)f is continuous and at leastC ^2k in a neighborhood ofx ₀.A3)x =x ₀ is the unique global minimum off in [–, ]. In [10] we have proved that the hypothesis of smoothnessA2 is not necessary and that the same result holds under the weaker assumption thatf L ¹[–, ]. In this paper we further extend this theory to the case of a functionf L ¹[–, ] having several global minima by suppressing the hypothesisA3 and by showing that the maximal order 2k of the zeros off –m _f is the only parameter which characterizes the rate of convergence of ₁ ⁽ⁿ⁾ tom _f .