Growth of Lévy trees

We construct random locally compact real trees called Lévy trees that are the genealogical trees associated with continuous-state branching processes. More precisely, we define a growing family of discrete Galton–Watson trees with i.i.d. exponential branch lengths that is consistent under Bernoulli percolation on leaves; we define the Lévy tree as the limit of this growing family with respect to the Gromov–Hausdorff topology on metric spaces. This elementary approach notably includes supercritical trees and does not make use of the height process introduced by Le Gall and Le Jan to code the genealogy of (sub)critical continuous-state branching processes. We construct the mass measure of Lévy trees and we give a decomposition along the ancestral subtree of a Poisson sampling directed by the mass measure. T. Duquesne is supported by NSF Grants DMS-0203066 and DMS-0405779. M. Winkel is supported by Aon and the Institute of Actuaries, EPSRC Grant GR/T26368/01, le département de mathématique de l’Université d’Orsay and NSF Grant DMS-0405779.     

晶体学与准晶体学点群的母子群关系

依据群论，得出了准晶体学点群的直积或半直积推导算式；依据结晶学理论，绘出了五角、八角、十角和十二角晶系各点群的极赤投影图.据此推导出了每一个准晶体学点群的全部最大子群，从而推导并绘制出了三维晶体学和准晶体学点群之间的母子群关系(60个点群的“家谱”).该“家谱”以最大子群链的图解形式直观地给出了每个点群的最小母群和最大子群. 关键词： 准晶体 晶体 点群 最大子群 最小母群 群链     

中高分辨力遥感图像中飞机目标自动识别算法研究

提出了一种中高分辨力的航空航天遥感图像中飞机目标快速自动识别的新算法。在分割和分类过程中充分利用飞机目标的先验知识,提出了一种改进区域分割方法,并应用树分类器对飞机目标进行自动识别。所提出的改进区域分割方法较好地实现了区域分割中阈值的准确自动选取,克服了复杂背景图像中小目标的全局阈值自动分割的失效问题。采用二叉树分类器,通过提取简单的目标几何特征,分层进行种类识别,提高了识别速度,降低了漏检率和虚警率。运用该方法进行了实验。结果表明,识别率达到了100%。     

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.     

最小树的一般算法

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

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

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

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     

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.     

ROBUSTNESS OF AN UPWIND FINITE DIFFERENCE SCHEME FOR SEMILINEAR CONVECTION-DIFFUSION PROBLEMS WITH BOUNDARY TURNING POINTS

We consider a singularly perturbed semilinear convection-diffusion problem with a boundary layer of attractive turning-point type. It is shown that its solution can be decomposed into a regular solution component and a layer component. This decomposi-tion is used to analyse the convergence of an upwinded finite difference scheme on Shishkin meshes.