A finite model property for RMImin

It is proved that the variety of relevant disjunction lattices has the finite embeddability property. It follows that Avron's relevance logic RMI _min has a strong form of the finite model property, so it has a solvable deducibility problem. This strengthens Avron's result that RMI _min is decidable. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Quantization of Underdamped, Critically Damped, and Overdamped Electric Circuits with a Power Source

We have investigated the quantum mechanical effect of the underdamped, critically damped, and overdamped electric circuits with a power source. The charge of the underdamped circuit oscillates while those of the critically damped and overdamped ones don't. The wave function of the system of overdamped circuit represented parabolic cylinder function while underdamped circuit was represented by well-known Hermite polynomial. The eigenvalues of underdamped circuit is discrete while those of the critically damped and overdamped ones are given as continuously.     

离子交换富集-导数火焰原子吸收法测定自来水中Cu,Fe和Zn

本文研究了用 2 0 1× 7阳离子交换树脂对自来水中的微量元素进行交换富集 ,采用微量脉冲进样 导数火焰原子吸收法测定富集后溶液中的Cu ,Fe和Zn ,该方法灵敏度分别为 0 2 9,0 5 9和 0 0 6 μg·L- 1 ,精密度分别为 4 2 8% ,1 95 %和 2 2 8% ,检测限分别为 1 2 8,5 85和 0 6 8μg·L- 1 ,回收率分别为 91 13% ,10 1 34%和99 84 % ,本方法大大减少了需样量 ,简便快速 ,灵敏度高。     

Changes in the kurtosis parameter of super-Gaussian beams passing through a spherically aberrated lens

Based on the Collins formula and irradiance moments definition, the propagation of the kurtosis parameter of super-Gaussian beams through a spherically aberrated lens is studied. Detailed numerical results are given. It is shown that, as compared with aberration-free super-Gaussian beams, the profile of spherically aberrated super-Gaussian beams can be leptokurtic, mesokurtic or platykurtic, depending on the aberration and propagation distance. The results for the spherically aberrated Gaussian beams can be dealt with as a special case treated in this paper. Finally, the advantage of our method is pointed out.     

Some new results on superimposed codes

A (w,r) cover‐free family is a family of subsets of a finite set such that no intersection of w members of the family is covered by a union of r others. A (w,r) superimposed code is the incidence matrix of such a family. Such a family also arises in cryptography as the concept of key distribution pattern. In the present paper, we give some new results on superimposed codes. First we construct superimposed codes from super‐simple designs which give us results better than superimposed codes constructed by other known methods. Next we prove the uniqueness of the (1,2) superimposed code of size 9 × 12, the (2,2) superimposed code of size 14 × 8, and the (2,3) superimposed code of size 30 × 10. Finally, we improve numerical values of upper bounds for the asymptotic rate of some (w,r) superimposed codes. © 2004 Wiley Periodicals, Inc.     

Estimating functionals of one-dimensional Gibbs states

Summary Some estimators of maximum likelihood type are constructed for estimating functionals of one-dimensional Gibbs states. We also show that those estimators are strongly consistent, asymptotically normal and asymptotically efficient.     

Ternary univariate curvature-preserving subdivision

We present an interpolating, univariate subdivision scheme which preserves the discrete curvature and tangent direction at each step of subdivision. Since the polygon have a geometric information of some original (in some sense) curve as a discrete curvature, we can expect that the limit curve has the same curvature at each vertex as the control polygon. We estimate the curvature bound of odd vertices and give an error estimate for restoring a curve from sampled vertices on curves.     

Hamiltonian N2‐locally connected claw‐free graphs

A graph G is N₂‐locally connected if for every vertex ν in G, the edges not incident with ν but having at least one end adjacent to ν in G induce a connected graph. In 1990, Ryjá?ek conjectured that every 3‐connected N₂‐locally connected claw‐free graph is Hamiltonian. This conjecture is proved in this note. © 2004 Wiley Periodicals, Inc. J Graph Theory 48: 142–146, 2005