Results of the maximum genus of graphs

In this paper,we provide a new class of up-embeddable graphs,and obtain a tight lower bound on the maximum genus of a class of 2-connected pseudographs of diameter 2 and of a class of diameter 4 multi-graphs.This extends a result of Skoviera.     

Covalent functionalization of multi-walled carbon nanotubes by lipase

Lipase from Candida rugosa was covalently anchored onto acid-treated multi-walled carbon nanotubes (MWNTs) through a self-catalytic mechanism. A variety of characterization techniques including FTIR, Raman spectroscopy, and XPS were employed to demonstrate the formation of the ester linkage between lipase and MWNTs. The MWNTs-lipase biocomposites showed significantly increased solubility in some common-used organic solvents, such as THF, DMF and chloroform. This study may offer a novel and facile route for covalent modification of carbon nanotubes, and expand the potential utilization of both lipases and MWNTs in the fields of biocatalyst and biosensor.     

A Nonconforming Arbitrary Quadrilateral Finite Element Method for Approximating Maxwell's Equations

The main aim of this paper is to provide convergence analysis of Quasi-Wilson nonconforming finite element to Maxwell's equations under arbitrary quadrilateral meshes.The error estimates are derived,which are the same as those for conforming elements under conventional regular meshes.     

A study of ion exchange selectivity coefficient by cyclic voltammetric measurement

An equation to express ion exchange selectivity coefficient was derived and used for calculating that of PPY film with the results obtained by cyclic voltammetric measurement. PPY film was synthesized by electrochemical method in aqueous solution using K₄Fe(CN)₆ as supporting electrolyte, and the anions were doped into the film. Ion exchange behaviour of doped Fe (CN)₆^3-/4- in the PPY film with Cl^?, NO₃^? or F^? ions in solution has been studied, and the corresponding ion exchange selectivity coefficients were determined.     

Validation of a method for predicting the precision, limit of detection and range of quantitation in competitive ELISA.

The mathematical model for predicting the precision, limit of detection (LOD) and range of quantitation (ROQ) in a competitive enzyme-linked immunosorbent assay (ELISA) proposed by Hayashi et al. (Anal. Chem., 2004, 76, 1295) was validated. The model describes the relative standard deviation (RSD) of concentration estimates by the RSDs of pipetting volumes of analyte, enzyme-conjugated antigen, antibody and substrate solutions, and the standard deviation (SD) of inherent absorbances between the wells in an ELISA plate. For 6 kinds of direct competitive ELISA kits, the LOD and ROQ predicted by the model agreed well with those obtained by experiments with real samples. It was also confirmed that the model is applicable to the prediction of uncertainty that depends on the pipetting error of the viscous antiserum solution. The model was demonstrated to be useful for estimating the LOD and ROQ of competitive ELISA.     

On the Bounded Complex of an Affine Oriented Matroid

We prove that the bounded complex of an affine oriented matroid is pure and collapsible. We also generalize Zaslavsky's central decomposition theorem for hyperplane arrangements to affine oriented matroids.     

Integrability of det▽u and Evolutionary Wente''s Problem Associated to Heat Operator

In this note, the authors resolve an evolutionary Wente's problem associated to heat equation, where the special integrability of det▽u for u ∈ H1(R2,R2) is used.     

变加速动力学与舒适性问题

用变加速动力学的急动度(加加速度)概念,分析了车辆、电梯的乘座舒适性与高层钢结构建筑的风振舒适性问题.     

Harmonic Analysis on the Compact Homogeneous Spaces──about Fourier Multiplier ofH~P（M） Space

ＨａｒｍｏｎｉｃＡｎａｌｙｓｉｓｏｎｔｈｅＣｏｍｐａｃｔＨｏｍｏｇｅｎｅｏｕｓＳｐａｃｅｓ──ａｂｏｕｔＦｏｕｒｉｅｒＭｕｌｔｉｐｌｉｅｒｏｆＨ~Ｐ（Ｍ）Ｓｐａｃｅ￥ＤｏｎｇＤａｏｚｈｅｎ；ＺｈｅｎｇＸｕｅａｎ（ＨｅｎａｎＵｎｉｖｅｒｓｉｔｙ，Ｋａｉ?..     

The vertex-cover polynomial of a graph

In this paper we define the vertex-cover polynomial Ψ(G,τ) for a graph G. The coefficient of τ^r in this polynomial is the number of vertex covers V′ of G with |V′|=r. We develop a method to calculate Ψ(G,τ). Motivated by a problem in biological systematics, we also consider the mappings f from {1, 2,…,m} into the vertex set V(G) of a graph G, subject to f⁻¹(x)f⁻¹(y)≠ for every edge xy in G. Let F(G,m) be the number of such mappings f. We show that F(G,m) can be determined from Ψ(G,τ).