On lattices embeddable into subsemigroup lattices. V. Trees

We prove that the class of finite lattices embeddable into the subsemilattice lattices of semilattices which are (n-ary) trees can be axiomatized by identities within the class of finite lattices, whence it forms a pseudovariety.     

Notes on Sublattice-Lattices

We prove that directly reducible lattices and selfdual subdirectly irreducible lattices of locally finite length are determined by their sublattice-lattices. As a corollary we obtain that splitting varieties are closed under the isomorphism of sublattice-lattices iff they are selfdual. A class of selfdual non-closed varieties is given too.     

Separation of screw-sensed particles in a homogeneous shear field

The Stokes motions of three-dimensional screw-sensed slender particles in a homogeneous shear field are investigated, including the effects of buoyancy. Conclusions are drawn about the possibility of achieving a separation of mixtures of right- and left-handed particles. The linearity of the Stokes equations allows complex flows to be solved by adding the effects of the several terms which describe the flow in which the particle is immersed. The homogeneous shear flow considered here consists of three such terms; solutions for a series of 12 unit motions are sufficient to determine the hydrodynamic resistance tensors. The forces and torques experienced by screw-sensed particles are calculated from these 51 resistance tensors, using slender-filament theory. The results allow an estimate of the range of buoyancy parameters for which gravitational sedimentation can be neglected. The fundamental component of the particle motion is a rotation, at approximately the same angular velocity as that of the fluid. Superimposed on this are variations, of large period, in the particle orientation. A phase plane analysis is used to find the terminal orientations. Very long calculation times are required for the phase portrait. An approximate method based on azimuthally-averaged equations is developed to avoid the requirements for long time integration.     

求解无线传感器网络路由问题的蚁群最优化算法及其收敛性

首先将无线传感器网络的路由问题转化成求解最小Steiner树问题,然后给出了求解无线传感器网络路由的蚁群优化算法,并对算法的收敛性进行了证明．最后对找到最优解后信息素值的变化进行了分析．即在限制信息素取值的条件下,当迭代次数充分大时,该算法能以任意接近于1的概率找到最优解,并且当最优解找到后,最优树边上的信息素单调增加,而最优解以外边上的信息素在有限步达到最小值．     

求解最小Steiner树的蚁群优化算法及其收敛性

最小Steiner树问题是NP难问题,它在通信网络等许多实际问题中有着广泛的应用．蚁群优化算法是最近提出的求解复杂组合优化问题的启发式算法．本文以无线传感器网络中的核心问题之一,路由问题为例,给出了求解最小Steiner树的蚁群优化算法的框架．把算法的迭代过程看作是离散时间的马尔科夫过程,证明了在一定的条件下,该算法所产生的解能以任意接近于1的概率收敛到路由问题的最优解．     

Runge–Kutta Methods for Itô Stochastic Differential Equations with Scalar Noise

A general class of stochastic Runge–Kutta methods for Itô stochastic differential equation systems w.r.t. a one-dimensional Wiener process is introduced. The colored rooted tree analysis is applied to derive conditions for the coefficients of the stochastic Runge–Kutta method assuring convergence in the weak sense with a prescribed order. Some coefficients for new stochastic Runge–Kutta schemes of order two are calculated explicitly and a simulation study reveals their good performance.     

Second order Runge–Kutta methods for Stratonovich stochastic differential equations

The weak approximation of the solution of a system of Stratonovich stochastic differential equations with a m–dimensional Wiener process is studied. Therefore, a new class of stochastic Runge–Kutta methods is introduced. As the main novelty, the number of stages does not depend on the dimension m of the driving Wiener process which reduces the computational effort significantly. The colored rooted tree analysis due to the author is applied to determine order conditions for the new stochastic Runge–Kutta methods assuring convergence with order two in the weak sense. Further, some coefficients for second order stochastic Runge–Kutta schemes are calculated explicitly. AMS subject classification (2000)  65C30, 65L06, 60H35, 60H10     

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个点群的“家谱”).该“家谱”以最大子群链的图解形式直观地给出了每个点群的最小母群和最大子群. 关键词： 准晶体 晶体 点群 最大子群 最小母群 群链     

Explicit formula of holomorphic automorphism group on complex homogeneous bounded domains

We known that the maximal connected holomorphic automorphism group Aut (D)(0) is a semi-direct product of the triangle group T(D) and the maximal connected isotropic subgroup Iso(D)(0) of a fixed point in the complex homogeneous bounded domain D and any complex homogeneous bounded domain is holomorphic isomorphic to a normal Siegel domain D(VN,F). In this paper, we give the explicit formula of any holomorphic automorphism in T(D(VN, F)) and Iso(D(VN,F))(0), where G(0) is the unit connected component of the Lie group G.