环保意识调查问卷的Logistic模型

本文应用多元统计分析中的方差分析 ,logistic模型等方法对环保意识调查问卷反馈的信息进行统计分析 ,建立被调查企业对环境保护意识的logistic模型 ,进而可对企业家的环境保护意识的好坏进行判断。     

Clifford Analysis Techniques for Spherical PDE

For a ? R\alpha \in \mathbf{R}, the class of a-\alpha -order spherical harmonic functions in an open set W í\Omega \subseteq S^n-1\mathbf{S}^{n-1}, H^a(W)H^{\alpha }(\Omega ) is defined as the C²-C^{2}-solutions of D_au=0\Delta _{\alpha }u=0; where D_a=D_s+a(n+a-2)\Delta _{\alpha }=\Delta _{s}+\alpha (n+\alpha -2) is the spherical Laplace--Beltrami operator of order a\alpha and D_s\Delta _{s} is the radially independent part of the Laplace operator. We obtain a Green's integral formula for the functions in H^a(W)H^{\alpha }(\Omega ) with kernel expressed as a Gegenbauer function. As generalizations, higher order spherical iterated Dirac operators are defined in a polynomial form. Integral representations of the null solutions to these operators and an intertwining formula relating these operators on the sphere and their analogues in Euclidean space are presented.     

自制金割效应物理摆的研究性实验

金割效应物理摆是将数学中的优选法与物理实验中的复摆结合起来并用计算机处理数据的自制教学仪器.把金割效应物理摆作为研究性实验进行开设,更有利于培养学生的开拓精神和创新能力.     

高阶Schr(O)dinger方程的加权估计

本文主要研究的是相函数为齐次椭圆多项式的自由高阶Schrodinger方程.通过相函数等值面的几何性质,得到了解算子的Strichartz加权估计和极大算子加权估计.     

轴流风扇叶片端导叶作用的研究

本文采用数值方法研究了叶片端导叶对轴流风扇性能的影响。通过与普通开式轴流风扇比较,分析了叶片端导叶对内部流动作用的机理.数值计算结果表明:叶片端导叶的安装位置将影响轴流风扇气动效率,安装叶片端导叶不能提高风扇静压升,但是在压力面安装时能有效地减小风扇叶顶泄漏流与主流的掺混损失;在设计流量下,压力面安装叶片端导叶使泄漏涡的作用范围较小,涡核更靠近吸力面;吸力面安装叶片端导叶弱化了泄漏涡的强度但没有减小泄漏涡的作用范围。     

Synthesis of 2-substituted indoles by palladium-catalyzed heteroannulation with Pd-NaY zeolite catalysts

Various 2-substituted indoles were prepared by heteroannulation of o-iodoanilines and terminal alkynes in a one-pot reaction with a Pd(II)-NaY zeolite catalyst. The product formation largely depended on the solvent, base, and reaction temperature. The recycled catalyst showed good reusability in the heteroannulation reaction.     

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