D[X2m]的下界估计与X2m矩阵的快速构造

本文利用有向图理论研究了Xn矩阵的特性，给出了X2m矩阵类的快速构造方法，证明了拉丁方矩阵D[X2m]数目的下界估计是：2m(2m)! ∑^mi=2[(2m)!]^2/П^ij=1Kj!П^rj=1bj!。     

大胆猜想 巧用放缩

在不等式的证明、数列的求和、求函数的最值等数学问题中，放缩往往是最直接、最有力同时也是最巧妙的方法，而放缩的使用，常常又伴随着想象，我们就来分析一道例题，看一看想象与放缩的神奇作用!     

具有离散时滞和分布时滞的中立型时滞系统的鲁棒稳定性

本文研究了具有离散时滞和分布时滞的不确定中立型系统的鲁棒稳定性的问题,考查了可能随时间变化的具有范数有界的不确定性.在对Lyapunov-Krasovskii泛函求导数时,不进行放大估计,而通过引入恰当的零项,构造线性矩阵不等式,从而获得基于LMI的时滞相关稳定的新判据.最后的数值例子说明了所得的结论有效性.     

中考压轴题“平面几何最值问题”赏析

笔者认为数学解题教学一般分为三个层次：怎样做、为什么这样做和同一类型怎么做．遗憾的是，无论是教师的教，还是学生的学，往往过于重视“怎样做”，对于“为什么这样做”和“同一类型怎样做”却关注甚少，缺少深层次的分析和反思归纳，不利于分析问题能力和“以题会类”迁移能力的有效培养．笔者以各地中考平面几何最值问题为例，对习题教学的三个层次作一简要分析．     

对一道函数最值问题的深入研究

1 问题展示 例 已知f（x）=｜x-1 ｜＋｜x-2｜,求f（x）的最小值. 分析：对x的取值范围分类讨论：f（x）=｛ 3-2x,x≤11,1＜x＜2,2x-3,x≥2 x≤1时,f（x）的最小值为f（1）=1; 1＜x＜2时,f（x）=1;     

General admissibility for linear estimators in a general multivariate linear model under balanced loss function

A generalization of Zellner’s balanced loss function is proposed. General admissibility in a general multivariate linear model is investigated under the generalized balanced loss function. And the sufficient and necessary conditions for linear estimators to be generally admissible in classes of homogeneous and nonhomogeneous linear estimators are given, respectively.     

Cooling-induced increase of methane cluster size investigated under a Coulomb explosion scheme

In this letter, we discuss the increase in the average cluster size by lowering the stagnation temperature of the methane （CH4） gas. The Coulomb explosion experiments are conducted to estimate the cluster size and the size distribution. The average CH4 cluster sizes Nay of 6 230 and 6 580 are acquired with the source conditions of 30 bars at 240 K and 60 bars at 296 K, respectively. Empirical estimation suggests a five-fold increase in the average size of the CH4 clusters at 240 K compared with that at room temperature under a backing pressure of 30 bars. A strong nonlinear Hagena parameter relation （Г^＊∝ T0^-3.3） for the CH4 clusters is revealed. The results may be favorable for the production of large-sized clusters by using gases at low temperature and high back pressures.     

(V_s,V_t)平面双流网络中的最小费用最大双流

本文利用（υ_ｓ，υ_ｔ）平面双流网络的平面性，找出并证明了该网络中最小费用双流的充要条件，最后给出了一个算法并估计了复杂性．