混合范数空间中函数的Taylor系数

本文研究了混合范数空间Ｈ（ｐ，ｑ，ａ）中解析函数ｆ的Ｔａｙｌｏｒ系数，对０＜ｐ≤２，０＜ｑ＜∞，ａ＞０和２≤ｐ＜∞，０＜ｑ＜∞，ａ＞０两种情形，分别给出了ｆ属于Ｈ（ｐ，ｑ，ａ）的必要条件和充分条件。用上述结果我们还得到了几个关于混合范数空间的乘子定理，这些结果也推广了Ｈａｒｄｙ和Ｌｉｔｔｌｅｗｏｏｄ关于Ｈ＾ｐ空间的相应结论。     

快度中心区强子物质输运系数和粘滞流体演化

用Chapman-Enskog方法计算了相对论性重离子碰撞快度中心区产生的π介子物质的输运系数,并建立了相应的粘滞流体力学方程,进而讨论了粘滞对π介子物质演化过程的影响.结果表明,粘滞将减缓快度中心区π介子物质的冷却速度.     

Sodium hexadecanoate micellar aggregation number

The diffusion coefficient of sodium hexadecanoate micelles was studied by polarography at 63°C, and the size and aggregation number of the micelles was computed. At concentrations above 0.01 mol·L^–1 rodlike micelles exist, which become flexible at 0.040 mol·L^–1 and entangle at 0.043 mol·L^–1     

Interior Layers for Second-Order Singular Equations

Our aim in this article is to study singularly perturbed problems which display boundary layers in the interior of the domain. These interior boundary layers which supplement the usual boundary layers at the boundary, are generated by discontinuities in the data. Second-order linear elliptic one-dimensional and multi-dimensional problems are considered in this article.     

Capacitance and potential coefficients at large distances

The design of capacitive sensors and devices for new and emerging applications would benefit from simple and reliable methods to estimate the capacitance between conductors in terms of the capacitance of the isolated bodies and of the distance between them. The coefficients of potential and capacitance of a pair of conductor are approximated with the first terms of an expansion formula in the inverse of their distance. The form given applies to conductors of generic shapes and position in space. A comparison with the exact value for two spheres shows agreement even for rather small distances.     

基于小波分解系数的贝叶斯人脸识别方法

本文给出了贝叶斯人脸识别方法中匹配准则的多个近似表达式及一种实用的快速计算方法.在此基础上,利用反对称双正交小波变换的微分算子功能,提出了一种利用两幅人脸图象的小波变换系数差作为模式矢量的贝叶斯人脸识别方法,并利用AR人脸图象库进行了实验.实验结果表明本文方法与基于图象灰度的类似方法相比,识别率提高8%左右.此外本文方法也提供了一条在图象压缩数据域中实现人脸识别的可能途径.     

Schur Orthogonality Relations for the Finitary Infinite Symmetric Group

Let S f be the finitary infinite symmetric group. For a certain class of irreducible unitary representations of S f , a version of Schur orthogonality relations is proved. That is, we construct an invariant inner product on the matrix coefficient space of each representation and show that matrix coefficients for distinct representations are orthogonal with respect to these norms.     

Several improved asymptotic normality criteria and their applications to graph polynomials

As widely regarded, one of the most classical and remarkable tools to measure the asymptotic normality of combinatorial statistics is due to Harper's real-rooted method proposed in 1967. However, this classical theorem exists some obvious shortcomings, for example, it requests all the roots of the corresponding generating function, which is impossible in general.Aiming to overcome this shortcoming in some extent, in this paper we present an improved asymptotic normality criterion, along with several variant versions, which usually just ask for one coefficient of the generating function, without knowing any roots. In virtue of these new criteria, the asymptotic normality of some usual combinatorial statistics can be revealed and extended. Among which, we introduce the applications to matching numbers and Laplacian coefficients in detail. Some relevant conjectures, proposed by Godsil (Combinatorica, 1981) and Wang et al. (J. Math. Anal. Appl., 2017), are generalized and verified as corollaries.