Harmonic Analysis on the Compact Homogeneous Spaces──about Fourier Multiplier ofH~P（M） Space

ＨａｒｍｏｎｉｃＡｎａｌｙｓｉｓｏｎｔｈｅＣｏｍｐａｃｔＨｏｍｏｇｅｎｅｏｕｓＳｐａｃｅｓ──ａｂｏｕｔＦｏｕｒｉｅｒＭｕｌｔｉｐｌｉｅｒｏｆＨ~Ｐ（Ｍ）Ｓｐａｃｅ￥ＤｏｎｇＤａｏｚｈｅｎ；ＺｈｅｎｇＸｕｅａｎ（ＨｅｎａｎＵｎｉｖｅｒｓｉｔｙ，Ｋａｉ?..     

Corrections of proofs for Hansen and Mélot's two theorems

The Randi? index R(G) of a (chemical) graph G is also called connectivity index. Hansen and Mélot [Variable neighborhood search for extremal graphs 6: analyzing bounds for the connectivity index, J. Chem. Inf. Comput. Sci. 43 (2003) 1-14] in their paper, characterized the chemical trees of given order and number of pendent vertices which have the minimum and maximum Randi? index, respectively. In this note, we point out the mistakes in the proofs of their results Theorems 8 and 10, while we still believe that the two theorems are true, and then we give their corrected proofs.     

几乎齐次函数的刻划定理

给出了几乎齐次函数的一个新的刻划定理，这一刻划是齐次函数欧拉定理的拓广。     

Backlund transformation and variable separation solutions for the generalized Nozhnik—Novikov—Veselov equation

Using the extended homogeneous balance method, the B?cklund transformation for a (2+1)-dimensional integrable model, the generalized Nizhnik－Novikov－Veselov (GNNV) equation, is first obtained. Also, making use of the B?cklund transformation, the GNNV equation is changed into three equations: linear, bilinear and trilinear form equations. Starting from these three equations, a rather general variable separation solution of the model is constructed. The abundant localized coherent structures of the model can be induced by the entrance of two variable-separated arbitrary functions.     

最小树的一般算法

本文根据设计并行算法的基本原则,给出了最小树的两个对偶定理.在此基础上,建立了两种对偶的同步并行算法的雏型.这两种算法恰恰在对偶的意义下,概括了以往的最小树算法.     

带有边集限制的最均匀支撑树问题

本在无向网络中，建立了带有边集限制的最均匀支撑树问题的网络模型．中首先解决最均匀支撑树问题，并给出求无向网络中最均匀支撑树的多项式时间算法；然后，给出了求无向网络中带有边集限制的最小树多项式时间算法；最后，在已解决的两个问题的基础上解决了带有边集限制的最均匀支撑树问题．     

On the Spectral Radius of Trees with the Given Diameter d

Let T denote a tree with the diameter d(d≥2) and order n. Let P^*d,r,n-d-1denote the tree obtained by identifying the rth vertex of path Pd l and the center of starKl,K1,n-d-1, where r = r(d) is the integer part about d 2/2. Then p(T)≤ p(P^*d,r,n-d-1), andequality holds if and only if T≌P^*d,r,n-d-1     

复合广义齐次Poisson过程的多险种破产概率

本文推广了经典的复合泊松风险模型，建立了两类复合广义齐次poisson过程的多险种破产模型．对于新模型，我们得到了初始资本为u的破产概率φ(u)的精确表达式以及特殊情况下φ(0)的表达式，并且导出了调节系数方程和调节系数R的上下界．     

The Computable Dimension of I-Trees of Infinite Height

We study computable trees with distinguished initial subtree (briefly, I-trees). It is proved that all I-trees of infinite height are computably categorical, and moreover, they all have effectively infinite computable dimension.     

Identifying phylogenetic trees

A central problem that arises in evolutionary biology is that of displaying partitions of subsets of a finite set X on a tree whose vertices are partially labelled with the elements of X. Such a tree is called an X-tree and, for a collection of partitions of subsets of X, characterisations for the existence and uniqueness of an X-tree that displays have been previously given in terms of chordal graphs. In this paper, we obtain two closely related characterisations also in terms of chordal graphs. The first describes when identifies an X-tree, and the second describes when a compatible subset of is of maximum size.