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.     

Multibody dynamics of aircraft occupants seated behind interior walls

To improve aircraft crash safety, conditions critical to occupants survival during a crash must be known. In view of the importance of this problem, studies of post-crash dynamic behavior of victims are necessary in order to reduce severe injuries. In this study, crash dynamics program SOM-LA/TA, incorporating a dynamic model of the human body with a finite element model of the seat structure was used. Modifications were performed in the program for reconstruction of an occupant's head impact with the interior walls or bulkhead. A viscoelastic-type contact force model was used to represent the compliance characteristics of the bulkhead. Correlated studies of analytical simulations with impact sled test results were accomplished. A parametric study of the coefficients in the contact force model was then performed in order to obtain the correlations between the coefficients and the Head Injury Criteria. A measure of optimal values for the bulkhead compliance and displacement requirements was thus achieved in order to keep the possibility of a head injury as little as possible. This information could in turn be used in the selection of suitable materials for the bulkhead, instrument panel, or interior walls of an aircraft.     

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

首先将无线传感器网络的路由问题转化成求解最小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.     

小球与均质自由杆的碰撞

讨论了小球与自由杆碰撞过程中所遵从的物理规律,明确了完全非弹性碰撞过程的能量特征,指出完全非弹性碰撞后两物体不一定粘在一起共同运动的事实.     

Features of the total disintegration events of heavyemulsion targets caused by 4.5A GeV/c16O

Total disintegration events produced by 4.5\,A GeV/c $^{16}$O--AgBr interactions are analysed to investigate the characteristics of secondary charged particles produced in such collisions. The multiplicity distributions of grey, black, and relativistic charged particles can be well represented by Gaussian distribution. The average multiplicity of grey particles is found to increase with the mass of projectile increasing, while that of black particles is found to decrease with the mass of projectile increasing. This result is in good agreement with the prediction of fireball model. Finally, the linear dependence between grey and black particles is observed, but there is no distinct dependence between the production of relativistic charged particles and the target excitation.     

Rb（5PJ）＋Rb（5PJ）→Rb（5JS）＋Rb（nl=5D，7S）碰撞能量合并

研究了Rb(5PJ)+Rb(5PJ)→Rb(nlJ')+Rb(5S)碰撞能量合并过程,利用单模半导体激光器分别共振激发Rb原子的5P1/2或5P3/2态,利用另一与泵浦激光束反向平行的单模激光束作为吸收线探测激发态原子密度及其空间分布,吸收线分别调至5P1/2→5D3/2和5P3/2→7S1/2跃迁.由激发态原子密度和谱线荧光比得到碰撞能量合并过程的截面,对5P3/2激发,碰撞转移得到5D5/2,5D3/2和7S1/2的截面分别是(1.32士0.59)×10-14,(1.18士0.53)×10-14和(3.21士1.44)×10-15cm2;对5P1/2激发,碰撞转移到5D5/2和5D3/2的截面分别是(6.57士2.96)×10-15和(5.90士2.66)×10-15cm2.与其他的实验结果进行了比较.