点可迁图的限制边连通性

3限制边割是连通图的一个边割, 它将此图分离成阶不小于3的连通分支. 图G的最小3限制边割所含的边数称为此图的3限制边连通度, 记作λ\-3(G). 它以图G的3阶连通点导出 子图的余边界的最小基数ξ_3(G)为上界. 如果λ_3(G)=ξ_3(G), 则称图G是极大3限制边连通的 . 已知在某种程度上,3限制边连通度较大的网络有较好的可靠性. 作者在文中证明: 如果k正则连通点可迁图的 围长至少是5, 那么它是是极大3限制边连通的.     

带约束条件和多余参数的线性模型的比较

对于带约束条件和多余参数的两个线性模型ｅ１＝Ｌ（Ｘ１β＋Ｚ１γ，Ｖ１，Ｌ１）和ｄ２＝Ｌ（Ｘ２β＋Ｚ２δ，Ｖ２，Ｌ２），其中Ｖ１和Ｖ２是已知对称的正定矩阵，γ和δ是多余参数，Ｌ１和Ｌ２是已知的约束矩阵，文中给出了一种新的比较准则，并得到了几个充要条件。     

Cycle embedding in star graphs with more conditional faulty edges

The star graph is one of the most attractive interconnection networks. The cycle embedding problem is widely discussed in many networks, and edge fault tolerance is an important issue for networks since edge failures may occur when a network is put into use. In this paper, we investigate the cycle embedding problem in star graphs with conditional faulty edges. We show that there exist fault-free cycles of all even lengths from 6 to n! in any n-dimensional star graph S_n (n ? 4) with ?3n − 10 faulty edges in which each node is incident with at least two fault-free edges. Our result not only improves the previously best known result where the number of tolerable faulty edges is up to 2n − 7, but also extends the result that there exists a fault-free Hamiltonian cycle under the same condition.     

Smooth and path connected Banach submanifold Σ r of B(E,F) and a dimension formula in B(ℝ n ,ℝ m )

Given two Banach spaces E,F, let B(E,F) be the set of all bounded linear operators from E into F, Σ _r the set of all operators of finite rank r in B(E,F), and Σ _r ^# the number of path connected components of Σ _r . It is known that Σ _r is a smooth Banach submanifold in B(E,F) with given expression of its tangent space at each A ∈ Σ _r . In this paper,the equality Σ _r ^# = 1 is proved. Consequently, the following theorem is obtained: for any nonnegative integer r, Σ _r is a smooth and path connected Banach submanifold in B(E,F) with the tangent space T _A Σ _r = {B ∈ B(E,F): BN(A) ⊂ R(A)} at each A ∈ Σ _r if dim F = ∞. Note that the routine method can hardly be applied here. So in addition to the nice topological and geometric property of Σ _r the method presented in this paper is also interesting. As an application of this result, it is proved that if E = ℝ ⁿ and F = ℝ ^m , then Σ _r is a smooth and path connected submanifold of B(ℝ ⁿ , ℝ ^m ) and its dimension is dimΣ _r = (m+n)r−r ² for each r, 0 <- r < min {n,m}. Supported by the National Science Foundation of China (Grant No.10671049 and 10771101).     

迭代反褶积算法

本文利用条件期望的性质，导出了迭代反褶积算法模型，并给出参数λ的极大似然估计，算例表明该算法是有效的。     

广义笛卡尔积图的连通度

本文定义了图G_1、G_2的广义笛卡尔积图G=G_1∫G_2,并且证明了它们的连通度具有关系k(G)≥k(G_1)+k(G_2)。这一结果是对文[1]中关于G_1与G_2直积的结果的推广。此外,本文还讨论了G=G_1∫G_2的直径及Hamilton性。最后,利用G=G_1∫G_2的结果对循环图的连通度进行了讨论。     

非齐次Toda晶格的对称,精确解和可积性

研究非齐次Toda晶格，即一类非齐次非线性微分差分方程的对称与可积性。给出了这一类方程的Lie点对称，条件对称和精确解。给出这类方程与Toda晶格之间的可逆点变换，从而表明这一类方程是可积的。     

0－1多面体图连通度猜想的一个反例

本文给出０－１多面体图连通度猜想的一个反侧．由此说明０－１多面体图的连通度未必等于最小度．     

带时滞观测线性离散系统的递推滤波

本文讨论带时滞观测线性离散系统的滤波问题,提出利用联合分布函数,得到滤波递推格式.这种方法还适用于一般的带有状态时滞的线性离散系统.