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.     

Minimal Ellipsoid Circumscribing a Polytope Defined by a System of Linear Inequalities

In this paper, we will propose algorithms for calculating a minimal ellipsoid circumscribing a polytope defined by a system of linear inequalities. If we know all vertices of the polytope and its cardinality is not very large, we can solve the problem in an efficient manner by a number of existent algorithms. However, when the polytope is defined by linear inequalities, these algorithms may not work since the cardinality of vertices may be huge. Based on a fact that vertices determining an ellipsoid are only a fraction of these vertices, we propose algorithms which iteratively calculate an ellipsoid which covers a subset of vertices. Numerical experiment shows that these algorithms perform well for polytopes of dimension up to seven.     

INTERSECTION OF PRIME SUBMODULES AND DIMENSION OF MODULES

The aim of this paper is to study the conditions by which a P-prime submodule can be expressed as a finite intersection or union of P-prime submodules. Also corresponding to dimension and rank of modules, some equivalent conditions for a ring to be a Dedekind domain are given.     

Pseudorandom properties of prime factors

In this paper we study some pseudo-random properties related to the prime factors of integers. We prove some results concerning the well distribution of the greatest prime factor modulo 4, and give some computational insight on the correlations, which seem to be beyond reach of proof.     

A characterization of adding machine maps

Let f :X→X be a continuous map of a compact metric space to itself. We prove that f is topologically conjugate to an adding machine map if and only if X is an infinite minimal set for f and each point of X is regularly recurrent. Moreover, if X is an infinite minimal set for f and one point of X is regularly recurrent, then f is semiconjugate to an adding machine map.     

Weak Multiplication Modules

In this paper we characterize weak multiplication modules.     

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.     

非线性控制系统的最小实现

对于那些由代数微分方程描述的具有输入输出关系的非线性控制系统，本文采用两种方法讨论了其最小实现问题：一种方法是直接计算系统的特征列；另一种方法则采用了本原元定理．两种方法给出的最小实现所需的状态变量最小数目是相等的．文中的大量代数与微分运算则可利用数学机械化来完成     

The set of toric minimal log discrepancies

We describe the set of minimal log discrepancies of toric log varieties, and study its accumulation points. This work is supported by a 21st Century COE Kyoto Mathematics Fellowship, and a JSPS Grant-in-Aid No 17740011.     

Orlicz范数下的Hardy-Hilbert不等式

给出了Orlicz范数下的Hardy-Hilbert不等式的一种形式,建立了当N-函数M(u)及其余N-函数N(u)均满足Δ′条件时Orlicz范数下的积分型及双级数型Hardy-Hilbert不等式.