对位酚类衍生物作为化学发光分析的增强剂研究

在化学发光分析中，常常要用到碱性条件下鲁米诺与过氧化氢的反应系统，通过催化剂辣根过氧化物酶使反应顺利进行。如果再加入适当的增强剂，则灵敏度提高且发光时间延长，可改善测定的重现性。实验证明，对位酚类衍生物，如：对叔丁基苯酚，对甲苯酚的发光增强作用明显，其发光效率可上升几十倍，发光时间也获得有效延长。     

Syntactic characterization of closure under connected limits

Summary We give a syntactic characterization of (finitary) theories whose categories of models are closed under the formation of connected limits (respectively the formation of pullbacks and substructures) in the category of all structures. They are also those theories whose consistent extensions by new atomic facts admit in each component an initial structure (respectively an initial term structure), and also thoseT for whichM(T) is locally finitely multi-presentable in a canonical way. We also show that these two properties of theories are nonuniform.     

Nielsen realization for 3-manifolds containing two-sided projective planes

For compact irreducible sufficiently large 3-manifolds containing 2-sided projective planes, we consider the following Realization Problem: Given a finite subgroup of the outer automorphism group of the fundamental group, is there a finite group of homeomorphisms, which induces this subgroup? Received: 16 November 1999; in final form: 18 January 2001 / Published online: 8 November 2002     

Large set of P3‐decompositions

Let G=(V(G),E(G)) be a graph. A (n,G, λ)‐GD is a partition of the edges of λK_n into subgraphs (G‐blocks), each of which is isomorphic to G. The (n,G,λ)‐GD is named as graph design for G or G‐decomposition. The large set of (n,G,λ)‐GD is denoted by (n,G,λ)‐LGD. In this work, we obtain the existence spectrum of (n,P₃,λ)‐LGD. © 2002 Wiley Periodicals, Inc. J Combin Designs 10: 151–159, 2002; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10008     

Rehabilitation of the Gauss-Jordan algorithm

Summary In this paper a Gauss-Jordan algorithm with column interchanges is presented and analysed. We show that, in contrast with Gaussian elimination, the Gauss-Jordan algorithm has essentially differing properties when using column interchanges instead of row interchanges for improving the numerical stability. For solutions obtained by Gauss-Jordan with column interchanges, a more satisfactory bound for the residual norm can be given. The analysis gives theoretical evidence that the algorithm yields numerical solutions as good as those obtained by Gaussian elimination and that, in most practical situations, the residuals are equally small. This is confirmed by numerical experiments. Moreover, timing experiments on a Cyber 205 vector computer show that the algorithm presented has good vectorisation properties.     

Fibrations of bigroupoids

Using Brown's construction (J. Algebra 15 (1970) 103) of an exact 6-term sequence for a fibration of groupoids we show how an exact 9-term sequence can be associated to a fibration of bigroupoids. Applications to topology and algebra are given.     

一种新型可调谐锁模光纤激光器

利用法布里-珀罗腔的激光二极管作为调制器件，实现环形腔光纤激光器的主动锁模。并利用法布里-珀罗腔的激光二极管的多纵模特性，把激光二极管当作一梳状滤波器，通过偏振控制器来调整入射到激光二极管内光的偏振态，同时均衡腔内增益，得到波长大范围可调谐的锁模激光，其脉冲宽度约为48ps，脉冲重复速率2GHz。     

A triangular map with homoclinic orbits and no infinite ω-limit set containing periodic points

Recently, Forti, Paganoni and Smítal constructed an example of a triangular map of the unite square, F(x,y)=(f(x),g(x,y)), possessing periodic orbits of all periods and such that no infinite ω-limit set of F contains a periodic point. In this note we show that the above quoted map F has a homoclinic orbit. As a consequence, we answer in the negative the problem presented by A.N. Sharkovsky in the eighties whether, for a triangular map of the square, existence of a homoclinic orbit implies the existence of an infinite ω-limit set containing a periodic point. It is well known that, for a continuous map of the interval, the answer is positive.     

Pentadiagonal Oscillatory Matrices with Two Spectrum in Common

We denote the spectrum of an square matrix A by σ(A), and that of the matrix obtained by deleting the first i rows and columns of A by σ_i(A). It is known that a symmetric pentadiagonal oscillatory (SPO) matrix may be constructed from σ, σ₁ and σ₂. The pairs σ, σ₁ and σ₁, σ₂ must interlace; the construction is not unique; and the conditions on the data which ensure that A is oscillatory are extremely complicated. Given one SPO matrix A, the paper shows that operations may be applied to A to construct a family of such matrices with σ and σ₁ in common. Moreover, given one totally positive (TP) matrix A, we construct a family of TP matrices with σ, σ₁ and σ₂ in common.