Sensitive chemically amplified electrochemical detection of ruthenium tris-(2,2′-bipyridine) on tin-doped indium oxide electrode

Optimized combination of chemical agents was selected for sensitive electrochemical detection of dissolved ruthenium tris-(2,2′-bipyridine) (Ru-bipy). The detection was based on the chemical amplification mechanism, in which the anodic current of a redox-active analyte was amplified by a sacrificial electron donor in solution. On indium-doped tin oxide (ITO) electrodes, electrochemical reaction of the analyte was reversible, but that of the electron donor was greatly suppressed. Several transition metal complexes, such as ferrocene and tris-(2,2′-bipyridine) complexes of osmium, iron and ruthenium, were evaluated as model analyte. A correlation between the amplified current and the standard potential of the complex was observed, and Ru-bipy generated the largest current. A variety of organic bases, acids and zwitterions were assessed as potential electron donor. Sodium oxalate was found to produce the largest amplification factor. With Ru-bipy as the model analyte and oxalate as the electron donor, the analyte concentration curve was linear up to 50 μM, with a lower detection limit of approximately 50 nM. Preliminary work was presented in which a Ru-bipy derivative was attached to bovine serum albumin and detected electrochemically. Although the combination of Ru-bipy, oxalate and ITO electrode has been used before for electrochemiluminescent detection of Ru-bipy and oxalate, as well as electrochemical detection of oxalate, its utility in amplified voltammetric detection of Ru-bipy as a potential electrochemical label has not been reported previously.     

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.     

ON THE CONVERGENCE OF MULTIPLICATIVE ITERATIVE ALGORITHMS WITH INEXACT LINE SEARCH

1.IntroductionIntillspaperweanalyzetheconvergenceonmultiplicativeiterativealgorithmsfortheIninimizationofadiffcrentiablefunctiondefinedonthepositiveorthantofR".ThealgorithmissllggestedbyEggermolltl'],andisrelatedtotheEM[2](Expextation--Maximization)algoritllnlforPositronemissiontonlography[']andimagereconstructi..14].Wecollsidertheproblenl"linf(x)s.t.x20.Themultiplicativeiterativealgorithmshavethel'orlniforj=l,2,',n,withAhdeterminedthroughalinesearch.Whilelusem[5]establishedanelegantconv…     

Double Michael Additions of Lithium Enolate of 1,4-Dioxaspiro[4.5]dec-6-en-8-One to Acrylates

Double Michael additions of lithium enolaie of 1,4-dioxaspiro[4.5]dec-6-en-8-one to four acrylates afforded bicyclo[2.2.2]octan-2-ones with high regio- and stereoselectivities in moderate yields.     

Numerical integration of ordinary differential equations on manifolds

Summary This paper is concerned with the problem of developing numerical integration algorithms for differential equations that, when viewed as equations in some Euclidean space, naturally evolve on some embedded submanifold. It is desired to construct algorithms whose iterates also evolve on the same manifold. These algorithms can therefore be viewed as integrating ordinary differential equations on manifolds. The basic method “decouples” the computation of flows on the submanifold from the numerical integration process. It is shown that two classes of single-step and multistep algorithms can be posed and analyzed theoretically, using the concept of “freezing” the coefficients of differential operators obtained from the defining vector field. Explicit third-order algorithms are derived, with additional equations augmenting those of their classical counterparts, obtained from “obstructions” defined by nonvanishing Lie brackets.     

Local and Parallel Finite Element Algorithms for Eigenvalue Problems

Abstract Some new local and parallel finite element algorithms are proposed and analyzed in this paper foreigenvalue problems.With these algorithms, the solution of an eigenvalue problem on a fine grid is reduced tothe solution of an eigenvalue problem on a relatively coarse grid together with solutions of some linear algebraicsystems on fine grid by using some local and parallel procedure.A theoretical tool for analyzing these algorithmsis some local error estimate that is also obtained in this paper for finite element approximations of eigenvectorson general shape-regular grids.     

Generalization of Murty's direct algorithm to linear and convex quadratic programming

Murty's algorithm for the linear complementarity problem is generalized to solve the optimality conditions for linear and convex quadratic programming problems with both equality and inequality constraints. An implementation is suggested which provides both efficiency and tight error control. Numerical experiments as well as field tests in various applications show favorable results.The author thanks K. G. Murty for his encouragement and helpful comments.     

纳米级精度分光路双频干涉度量系统的设计

为完成快速、精确的外观轮廓度量,设计了一种新型纳米级精度分光路双频干涉度量系统。系统由低频差双频激光干涉度量模块和微探头及二维工作台两部分组成。微探针以轻敲式接近样品至几十纳米时,受原子力作用发生偏转,利用双频干涉模块度量其纵向偏转量,并对样品进行梳状式度量得到外观形貌。根据双频激光的实际光源,对原有双频干涉度量理论进行了改进提高。进行了系统组建和实验验证。结果表明:系统具有纳米级精度,可用于超精样品外观轮廓度量。     

Affine-scaling for linear programs with free variables

The affine-scaling modification of Karmarkar's algorithm is extended to solve problems with free variables. This extended primal algorithm is used to prove two important results. First the geometrically elegant feasibility algorithm proposed by Chandru and Kochar is the same algorithm as the one obtained by appending a single column of residuals to the constraint matrix. Second the dual algorithm as first described by Adler et al., is the same as the extended primal algorithm applied to the dual.     

Kalman filtering of a space-time Markov random field

In this paper, finite-dimensional recursive filters for space-time Markov random fields are derived. These filters can be used with the expectation maximization (EM) algorithm to yield maximum likelihood estimates of the parameters of the model.