Determination of sulfa antibiotic residues in river and particulate matter by field-amplified sample injection-capillary zone electrophoresis

In the present research, field-amplified sample injection–CZE (FASI–CZE) coupled with a diode array detector was established to determine trace level sulfa antibiotic. Sulfathiazole, sulfadiazine, sulfamethazine, sulfadimethoxine, sulfamethoxazole, and sulfisoxazole were selected as analytes for the experiments. The background electrolyte solution consisted of 70.0 mmol/L borax and 60.0 mmol/L boric acid (including 10% methanol, pH 9.1). The plug was 2.5 mmol/L borax, which was injected into the capillary at a pressure of 0.5 psi for 5 s. Then the sample was injected into the capillary at an injection voltage of –10 kV for 20 s. The electrophoretic separation was carried out under a voltage of +19 kV. The capillary temperature was maintained at 20˚C throughout the analysis, and six sulfonamides were completely separated within 35 min. Compared with pressure injection-CZE, the sensitivity of FASI-CZE was increased by 6.25–10.0 times, and the LODs were reduced from 0.2–0.5 to 0.02–0.05 μg/mL. The method was applied to the determination of sulfonamides in river water and particulate matter samples. The recoveries were 78.59–106.59%. The intraday and interday precisions were 2.89–7.35% and 2.77–7.09%, respectively. This provides a simpler and faster method for the analysis of sulfa antibiotic residues in environmental samples.     

Concurrent multiresponse non-linear screening: Robust profiling of webpage performance

Profiling engineered data with robust mining methods continues attracting attention in knowledge engineering systems. The purpose of this article is to propose a simple technique that deals with non-linear multi-factorial multi-characteristic screening suitable for knowledge discovery studies. The method is designed to proactively seek and quantify significant information content in engineered mini-datasets. This is achieved by deploying replicated fractional-factorial sampling schemes. Compiled multi-response data are converted to a single master-response effectuated by a series of distribution-free transformations and multi-compressed data fusions. The resulting amalgamated master response is deciphered by non-linear multi-factorial stealth stochastics intended for saturated schemes. The stealth properties of our method target processing datasets which might be overwhelmed by a lack of knowledge about the nature of reference distributions at play. Stealth features are triggered to overcome restrictions regarding the data normality conformance, the effect sparsity assumption and the inherent collapse of the ‘unexplainable error’ connotation in saturated arrays. The technique is showcased by profiling four ordinary controlling factors that influence webpage content performance by collecting data from a commercial browser monitoring service on a large scale web host. The examined effects are: (1) the number of Cascading Style Sheets files, (2) the number of JavaScript files, (3) the number of Image files, and (4) the Domain Name System Aliasing. The webpage performance level was screened against three popular characteristics: (1) the time to first visual, (2) the total loading time, and (3) the customer satisfaction. Our robust multi-response data mining technique is elucidated for a ten-replicate run study dictated by an L₉(3⁴) orthogonal array scheme where any uncontrolled noise embedded contribution has not been necessarily excluded.     

基于Kronecker型替换的黑盒多项式稀疏插值

本文基于新的Kronecker型替换,给出两个由黑盒表示的稀疏多项式的新确定性插值算法.令f∈R[x1,……,xn]是一个稀疏黑盒多项式,其次数上界为D.当R是C或者是有限域时,相对于已有算法,新算法具有更好的计算复杂度或者关于D的复杂度更低.特别地,对于一般黑盒模型,D是复杂度中的主要因素,而在所有的确定性算法中,本文的第二个算法的复杂度关于D是最低的.     

Spectral estimates for saddle point matrices arising in weak constraint four‐dimensional variational data assimilation

We consider the large sparse symmetric linear systems of equations that arise in the solution of weak constraint four‐dimensional variational data assimilation, a method of high interest for numerical weather prediction. These systems can be written as saddle point systems with a 3 × 3 block structure but block eliminations can be performed to reduce them to saddle point systems with a 2 × 2 block structure, or further to symmetric positive definite systems. In this article, we analyse how sensitive the spectra of these matrices are to the number of observations of the underlying dynamical system. We also obtain bounds on the eigenvalues of the matrices. Numerical experiments are used to confirm the theoretical analysis and bounds.     

Approximate inverse computation using Frobenius inner product

Parallel preconditioners are presented for the solution of general linear systems of equations. The computation of these preconditioners is achieved by orthogonal projections related to the Frobenius inner product. So, min_M∈??∥AM?I∥ _F and matrix M₀∈?? corresponding to this minimum (?? being any vectorial subspace of ??_n(?)) are explicitly computed using accumulative formulae in order to reduce computational cost when subspace ?? is extended to another one containing it. Every step, the computation is carried out taking advantage of the previous one, what considerably reduces the amount of work. These general results are illustrated with the subspace of matrices M such that AM is symmetric. The main application is developed for the subspace of matrices with a given sparsity pattern which may be constructed iteratively by augmenting the set of non‐zero entries in each column. Finally, the effectiveness of the sparse preconditioners is illustrated with some numerical experiments. Copyright © 2002 John Wiley & Sons, Ltd.     

Products of mixed covering arrays of strength two

A covering array CA(N;t,k, v is an N × k array such that every N × t subarray contains all t‐tuples from v symbols at least once, where t is the strength of the array. Covering arrays are used to generate software test suites to cover all t‐sets of component interactions. The particular case when t = 2 (pairwise coverage) has been extensively studied, both to develop combinatorial constructions and to provide effective algorithmic search techniques. In this paper, a simple “cut‐and‐paste” construction is extended to covering arrays in which different columns (factors) admit different numbers of symbols (values); in the process an improved recursive construction for covering arrays with t = 2 is derived. © 2005 Wiley Periodicals, Inc. J Combin Designs 14: 124–138, 2006     

Approximate Inverse Preconditioners for Some Large Dense Random Electrostatic Interaction Matrices

A sparse mesh-neighbour based approximate inverse preconditioner is proposed for a type of dense matrices whose entries come from the evaluation of a slowly decaying free space Green’s function at randomly placed points in a unit cell. By approximating distant potential fields originating at closely spaced sources in a certain way, the preconditioner is given properties similar to, or better than, those of a standard least squares approximate inverse preconditioner while its setup cost is only that of a diagonal block approximate inverse preconditioner. Numerical experiments on iterative solutions of linear systems with up to four million unknowns illustrate how the new preconditioner drastically outperforms standard approximate inverse preconditioners of otherwise similar construction, and especially so when the preconditioners are very sparse. AMS subject classification (2000) 65F10, 65R20, 65F35, 78A30     

Analysis on Shack–Hartmann wave-front sensor with Fourier optics

In Shack–Hartmann wavefront sensor (SHWS), the behavior of the irradiance pattern produced by the micro-lens array is important for an accurate centroid estimation. In this paper, the behavior of a micro-lens array in SHWS is analyzed using Fourier optics, and reveals that in addition to the main, expected spots, secondary spots with smaller intensities also appeared as a result of diffraction by the small dimensions of the micro-lens and interference from the different micro-lenses. This result is confirmed by comparing with a irradiance pattern taken from an actual SHWS. The additional error in centroid estimation caused by these secondary spots is discussed and relationship to the parameters of the micro-lens of SHWS is analyzed.     

A generalized quasi-sum relations for oscillator strengths in transition arrays: theoretical study of the opacity of Ge plasmas

We present a simplified relativistic configuration interaction method (SRCI), by which all the energy levels and oscillator strengths in each transition array can be calculated. There exist generalized quasi-sum relations for the calculated oscillator strengths in the relevant transition arrays by the SRCI and by an unresolved transition array model (UTA). Based on UTA and the detailed configuration accounting (DCA), with a fully relativistic treatment incorporated with the quantum defect theory, the X-ray absorption spectra for any middle- and high-Z plasmas or composite plasmas can be calculated with much less computational efforts. The gross features of calculated spectra by DCA-UTA are in agreement with the relevant experimental measurements, except some detailed structures in some narrow spectral ranges. Such detailed structures can be calculated by SRCI incorporated with DCA-UTA. As an illustrative example, the absorption spectra of Ge plasmas are calculated by DCA-UTA-SRCI and are in agreement with the experimental opacity data. Therefore, the theoretical method (DCA-UTA-SRCI) verified by experimental measurements will not only be a basic tool to provide “precision” opacity data for the inertial confinement fusion research (ICF) and studies in stellar physics but also can be used to analyze the relevant diagnostic measurements for ICF plasmas.     

Prime divisors of sparse integers

We obtain a lower bound on the number of prime divisors of integers whose g-ary expansion contains a fixed number of nonzero digits. This revised version was published online in August 2006 with corrections to the Cover Date.