一种可能的简并谱NNS分布

利用随机矩阵理论,通过对一特殊情形的简并谱展开研究,得到了简并谱一种可能的最小相邻间距NNS分布函数．研究表明,由于简并的存在,简并谱不仅可分解成随机谱和规则谱两个子谱,同时还影响其规则谱,使规则谱的能级斥力减少．     

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)     

A Modified Quasi-Newton Method for Structured Optimization with Partial Information on the Hessian

This paper develops a modified quasi-Newton method for structured unconstrained optimization with partial information on the Hessian, based on a better approximation to the Hessian in current search direction. The new approximation is decided by both function values and gradients at the last two iterations unlike the original one which only uses the gradients at the last two iterations. The modified method owns local and superlinear convergence. Numerical experiments show that the proposed method is encouraging comparing with the methods proposed in [4] for structured unconstrained optimization Presented at the 6th International Conference on Optimization: Techniques and Applications, Ballarat, Australia, December 9–11, 2004     

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.     

Rate constants for the gas‐phase reaction of CF3CF2CF2CF2CF2CHF2 with OH radicals at 250–430 K

The rate constants k₁ for the reaction of CF₃CF₂CF₂CF₂CF₂CHF₂ with OH radicals were determined by using both absolute and relative rate methods. The absolute rate constants were measured at 250–430 K using the flash photolysis–laser‐induced fluorescence (FP‐LIF) technique and the laser photolysis–laser‐induced fluorescence (LP‐LIF) technique to monitor the OH radical concentration. The relative rate constants were measured at 253–328 K in an 11.5‐dm³ reaction chamber with either CHF₂Cl or CH₂FCF₃ as a reference compound. OH radicals were produced by UV photolysis of an O₃–H₂O–He mixture at an initial pressure of 200 Torr. Ozone was continuously introduced into the reaction chamber during the UV irradiation. The k₁ (298 K) values determined by the absolute method were (1.69 ± 0.07) × 10^?15 cm³ molecule^?1 s^?1 (FP‐LIF method) and (1.72 ± 0.07) × 10^?15 cm³ molecule^?1 s^?1 (LP‐LIF method), whereas the K₁ (298 K) values determined by the relative method were (1.87 ± 0.11) × 10^?15 cm³ molecule^?1 s^?1 (CHF₂Cl reference) and (2.12 ± 0.11) × 10^?15 cm³ molecule^?1 s^?1 (CH₂FCF₃ reference). These data are in agreement with each other within the estimated experimental uncertainties. The Arrhenius rate constant determined from the kinetic data was K₁ = (4.71 ± 0.94) × 10^?13 exp[?(1630 ± 80)/T] cm³ molecule^?1 s^?1. Using kinetic data for the reaction of tropospheric CH₃CCl₃ with OH radicals [k₁ (272 K) = 6.0 × 10^?15 cm³ molecule^?1 s^?1, tropospheric lifetime of CH₃CCl₃ = 6.0 years], we estimated the tropospheric lifetime of CF₃CF₂CF₂CF₂CF₂CHF₂ through reaction with OH radicals to be 31 years. © 2003 Wiley Periodicals, Inc. Int J Chem Kinet 36: 26–33, 2004     

The semi‐iterative method applied to the hyper‐power iteration

The semi‐iterative method (SIM) is applied to the hyper‐power (HP) iteration, and necessary and sufficient conditions are given for the convergence of the semi‐iterative–hyper‐power (SIM–HP) iteration. The root convergence rate is computed for both the HP and SIM–HP methods, and the quotient convergence rate is given for the HP iteration. Copyright © 2005 John Wiley & Sons, Ltd.     

加权二次有理Bézier插值曲线

在本文中,给定一组有序空间数据点列及每个数据点的切矢向量,利用加权二次有理Bézier曲线对数据点作插值曲线,使该曲线具有C1连续性,并且权因子只是对相应顶点曲线附近产生影响,同调整两个相邻的权因子可以调整这两个相邻顶点之间的曲线和它的控制多边形.     

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     

A representation of acoustic waves in unbounded domains

Compact, time‐harmonic, acoustic sources produce waves that decay too slowly to be square‐integrable on a line away from the sources. We introduce an inner product, arising directly from Green's second theorem, to form a Hilbert space of these waves and present examples of its computation.¹ © 2005 Wiley Periodicals, Inc.