<Emphasis Type="Italic">k</Emphasis>-factors in regular graphs

Plesnik in 1972 proved that an （m - 1）-edge connected m-regular graph of even order has a 1-factor containing any given edge and has another 1-factor excluding any given m - 1 edges. Alder et al. in 1999 showed that if G is a regular （2n ＋ 1）-edge-connected bipartite graph, then G has a 1-factor containing any given edge and excluding any given matching of size n. In this paper we obtain some sufficient conditions related to the edge-connectivity for an n-regular graph to have a k-factor containing a set of edges and （or） excluding a set of edges, where 1 ≤ k ≤n/2. In particular, we generalize Plesnik＇s result and the results obtained by Liu et al. in 1998, and improve Katerinis＇ result obtained 1993. Furthermore, we show that the results in this paper are the best possible.     

Invariant Core Theorems for Double Sequences

The definition for the convergence of a double sequence was presented by A. Pringsheim [9]. Recently, the definitions of limit inferior, limit superior, and the core of a double sequence are presented. By using these definitions and the notion of regularity for four-dimensional matrices, an invariant core theorem for double sequences is presented.AMS Subject Classification (2000) primary 40B05 secondary 40C05     

宽带内容平台技术基础

本文首先分析了当今支撑宽带应用和内容的两大技术：流媒体技术和内容分发网络（CDN）技术，结合上海电信的宽带信息源建设项目，介绍邓电信的IP城域网架构上建设1 4的CDN和流媒体融合的平台。通过CDN和流媒体的技术方案，希望为宽带的发展提供一定的技术参考。     

General Regular Variation of n-th Order and the 2nd Order Edgeworth Expansion of the Extreme Value Distribution （Ⅰ）

In Part Ⅰ the concept of the general regular variation of n-th order is proposed and its construction is discussed. The uniqueness of the standard expression and the higher order regularity of the auxiliary functions are proved.     

Wavelet method for solving the unsteady porous-medium flow problem with discontinuous coefficients

A method is proposed for constructing stable approximate wavelet decompositions of weak solutions to boundary value problems for the unsteady porous-medium flow equation with discontinuous coefficients and inexact data. The method is based on the general scheme for finite-dimensional approximation in Tikhonov regularization and on multiresolution analysis with basis functions defined as the product of one-dimensional Daubechies wavelets.     

A note on 3‐factorizations of K10*

In this note, we enumerate all nonisomorphic 3‐factorizations of K₁₀. © 2001 John Wiley & Sons, Inc. J Combin Designs 9: 379–383, 2001     

Propagation of perturbations in a two-layer stratified fluid with an interface excited by moving sources

Propagation of small perturbations in a two-layer inviscid stratified fluid is studied. It is assumed that the higher density fluid occupies the lower unbounded half-space, while the lower density fluid occupies the upper unbounded half-space. The source of the excitation is a plane wave traveling along the interface of the fluids. An explicit analytical solution to the problem is constructed, and its existence and uniqueness are proved. The long-time wave pattern developing in the fluids is analyzed.     

正多边形的最优分割问题

记平面边长为1的正m边形为S_m,将S_m剖分成n块:S_(m1),S_(m2),…,S_(mn),这样的剖分称S_m的n剖分,并以T(m,n)表示.以d_(mi)表示区域S_(mi)(i=1,2,…,n)的直径(即区域S_(mi)任意两点之间距离的最大者).记D(m,n)=max{d_(m1),d_(m2),…,d_(mn)}及Ψ(m,n)=■{D(m,n)}.本文将估计Ψ(m,n)的上下界.证明Ψ(6,3)=3/2,Ψ(6,4)=3-3~(1/2),Ψ(6.6)=1,Ψ(6,7)=3/2,估计Ψ(6,n)的渐进性.提出几个猜想.     

一种PSI滤波器设计中的并行CRC算法

提出一种用于HDTV信源解码SoC芯片中的CRC并行算法,完成对输入传输流数据中PSI信息的CRC校验.     

About noncommuting graphs

The noncommuting graph ?(G) of a nonabelian finite group G is defined as follows: The vertices of ?(G) are represented by the noncentral elements of G, and two distinct vertices x and y are joined by an edge if xy ≠ yx. In [1], the following was conjectured: Let G and H be two nonabelian finite groups such that ?(G) ? ?(H); then ¦G¦ = ¦H¦. Here we give some counterexamples to this conjecture.