Partitioning series-parallel multigraphs into υ*-excluding edge covers

We prove that, for any given vertex υ* in a series-parallel graph G, its edge set can be partitioned into k = min{κ'(G) + 1,δ(G)} subsets such that each subset covers all the vertices of G possibly except for υ*, where δ(G) is the minimum degree of G and κ'(G) is the edge-connectivity of G. In addition, we show that the results in this paper are best possible and a polynomial time algorithm can be obtained for actually finding such a partition by our proof.     

Planar graphs without 4,6,8-cycles are 3-colorable

In this paper we prove that every planar graph without 4,6 and 8-cycles is 3-colorable.     

烟雾全遮蔽能力检测系统的设计

基于辐照度测量法和以人眼视觉对比度阈值为基准,研制了烟雾全遮蔽能力检测系统。该系统由数字照度计、旋转编码器、烟箱、步进电机、电磁离合器等部分组成,可以实现对TOP的全过程自动化测量。在温度为26℃,相对湿度为80%,光程调整范围为1~6m,光程调整精度为±2mm的条件下,对黄磷的TOP进行了检测,测试结果与经验值相比误差小于4%。     

Sum List Coloring Graphs

Let G=(V,E) be a graph with n vertices and e edges. The sum choice number of G is the smallest integer p such that there exist list sizes (f(v):v ∈ V) whose sum is p for which G has a proper coloring no matter which color lists of size f(v) are assigned to the vertices v. The sum choice number is bounded above by n+e. If the sum choice number of G equals n+e, then G is sum choice greedy. Complete graphs K_n are sum choice greedy as are trees. Based on a simple, but powerful, lemma we show that a graph each of whose blocks is sum choice greedy is also sum choice greedy. We also determine the sum choice number of K_2,n, and we show that every tree on n vertices can be obtained from K_n by consecutively deleting single edges where all intermediate graphs are sc-greedy.     

高精度参数估计问题

对高精度参数的估计问题进行了研究.在观测数据无误差的情况下,将微分方程组转化为线性方程组,利用矩阵的奇异值分解给出了参数的最优解.在有观测数据误差的情况下,采用高斯-牛顿迭代法进行求解,给出了改进的高斯-牛顿法和阻尼最小二乘算法;通过灰色估计法给出了模型的初始解,通过微分方程数值解法计算模型迭代过程中误差和偏导数.最后,通过对迭代过程中的状态变量引入误差项,导出了基于总体最小二乘的高斯-牛顿迭代法,从系统的角度解决了观测时间有误差下的参数估计问题.     

New Lower Bounds on the Multicolor Ramsey Numbers R r (C 2 m )

The multicolor Ramsey number R_r(H) is defined to be the smallest integer n=n(r) with the property that any r-coloring of the edges of the complete graph K_n must result in a monochromatic subgraph of K_n isomorphic to H. It is well known that 2^rm<R_r(C_2m+1)<2(r+2)!m and R_r(C_2m)≥(r−1)(m−1)+1. In this paper, we prove that R_r(C_2m)≥2(r−1)(m−1)+2. This research is supported by NSFC(60373096, 60573022) and SRFDP(20030141003)     

RP(j)×CP(k)上向量丛的全Stiefel-Whitney类

本文利用Steenrod上同调运算及吴公式决定了RP(j)×CP(k)上的向量丛的全Stiefel-Whitney类的可能的形状．     

部分服务台同步多重休假的M/M/c/k排队及其优化

利用有限状态拟生灭过程和全概率分解的方法,首次研究了只允许部分服务台同步多重休假的M/M/e/k排队系统,得到了稳态队长和等待时间分布,并且讨论了系统的优化问题.     

微热与微功不是全微分的独立自变量选择

从数学和物理两个方面说明“微热与微功不是全微分”这一结论的确切意义     

实现边缘照明全息术的新途径

报道了实现抗干扰能力特别高的边缘照明全息术的新途径。采用这一途径可以得到再现时不受经光环境干扰的全息片，并实现了白光再现，作出了与再现光源平面一体化的边缘白光再现全息片。这一技术可望在工业和日常生活中得到广泛应用。