Level of nodes in increasing trees revisited

Simply generated families of trees are described by the equation T(z) = ϕ(T(z)) for their generating function. If a tree has n nodes, we say that it is increasing if each node has a label ∈ { 1,…,n}, no label occurs twice, and whenever we proceed from the root to a leaf, the labels are increasing. This leads to the concept of simple families of increasing trees. Three such families are especially important: recursive trees, heap ordered trees, and binary increasing trees. They belong to the subclass of very simple families of increasing trees, which can be characterized in 3 different ways. This paper contains results about these families as well as about polynomial families (the function ϕ(u) is just a polynomial). The random variable of interest is the level of the node (labelled) j, in random trees of size n ≥ j. For very simple families, this is independent of n, and the limiting distribution is Gaussian. For polynomial families, we can prove this as well for j,n → ∞ such that n − j is fixed. Additional results are also given. These results follow from the study of certain trivariate generating functions and Hwang's quasi power theorem. They unify and extend earlier results by Devroye, Mahmoud, and others. © 2007 Wiley Periodicals, Inc. Random Struct. Alg., 2007     

DUAL RECIPROCITY HYBRID BOUNDARY NODE METHOD FOR THREE-DIMENSIONAL ELASTICITY WITH BODY FORCE

Combining Dual Reciprocity Method （DRM） with Hybrid Boundary Node Method （HBNM）, the Dual Reciprocity Hybrid Boundary Node Method （DRHBNM） is developed for three-dimensional linear elasticity problems with body force. This method can be used to solve the elasticity problems with body force without domain integral, which is inevitable by HBNM. To demonstrate the versatility and the fast convergence of this method, some numerical examples of 3-D elasticity problems with body forces are examined. The computational results show that the present method is effective and can be widely applied in solving practical engineering problems.     

有限元节点编号优化

从分析最简单最优的矩形单元节点编号着手，分析其特点，得出各个节点的相邻单元节点编号总和除以该节点相邻单元数所得的节点商以及相邻单元最小最大节点编号和都为升序排列。总结出一种新型的有限元节点重编号方法，并举例说明该算法能减少有限元的带宽。     

Dynamic analysis and regulation of the flexible pipe conveying fluid with a hard-magnetic soft segment

Applied Mathematics and Mechanics - The recently developed hard-magnetic soft (HMS) materials can play a significant role in the actuation and control of medical devices, soft robots, flexible...     

Computational modelling of multi-material energetic materials and systems

ABSTRACT

In this paper, we present a systematic roadmap for developing a robust and parallel multi-material reactive hydrodynamic solver that integrates historically stable algorithms with new and current modern methods to solve explosive system design problems. The Ghost Fluid Method and Riemann solvers were used to enforce appropriate interface boundary conditions. Improved performance in terms of computational work and convergence properties was achieved by modifying a local node sorting strategy that decouples ghost nodes, allowing us to set material boundary conditions via an explicit procedure, removing the need to solve a coupled system of equations numerically. The locality and explicit nature of the node sorting concept allows for greater levels of parallelism and lower computational cost when populating ghost nodes. Non-linear numerical issues endemic to the use of real Equations of State in hydro-codes were resolved by using more thermodynamically consistent forms allowing us to accurately resolve large density gradients associated with high energy detonation problems at material interfaces. Pre-computed volume tables were implemented adding to the robustness of the solver base.     

Identification of mechanisms of toxic action for skin sensitisation using a SMARTS pattern based approach

Skin sensitisation is a key endpoint under REACH as it is costly and its assessment currently has a high dependency on animal testing. In order to reduce both the cost and the numbers of animals tested, it is likely that (quantitative) structure–activity relationships ((Q)SAR) and read-across methods will be utilised as part of intelligent testing strategies. The majority of skin sensitisers elicit their effect via covalent bond formation with skin proteins. These reactions have been understood in terms of well defined nucleophilic–electrophilic reaction chemistry. Thus, a first step in (Q)SAR analysis is the assignment of a chemical's potential mechanism of action enabling it to be placed in an appropriate reactivity domain. The aim of this study was to design a series of SMARTS patterns capable of defining these reactivity domains. This was carried out using a large database of local lymph node assay (LLNA) results that had had potential mechanisms of action assigned to them using expert knowledge. A simple algorithm was written enabling the SMARTS patterns to be used to screen a database of SMILES strings. The SMARTS patterns were then evaluated using a second, smaller, test set of LLNA results which had also had potential mechanisms of action assigned by experts. The results showed that the SMARTS patterns provided an excellent method of identifying potential electrophilic mechanisms. The findings are supported, in part, by molecular orbital calculations which confirm assignment of reactive mechanism of action. The ability to define a chemical's potential reaction mechanism is likely to be of significant benefit to regulators and risk assessors as it enables category formation and subsequent read-across to be performed.     

一种基于STM32的NAND flash的块分配框架设计

STM32对大容量数据文件存储与管理问题可通过NAND flash来解决。而NAND flash的高效管理需要文件系统参与。NAND flash有特殊的块读写及擦除机制,一般的嵌入式文件系统组织结构并不完全兼容NAND flash。针对NAND flash的特点兼顾STM32的资源承受力要提出新的NAND flash块分配框架,框架通过块分配槽这种数据结构,在不使用块分配表与垃圾表的情况下,实现了NAND flash均衡负载与垃圾块的回收;同时通过节点分配栈与文件节点表的配合来提高STM32对文件的读写速度,空间利用率和系统性能。仿真实验和计算结果表明该块分配框架可有效提高NAND flash块的均衡负载与节省RAM空间。     

基于质心迭代估计的无线传感器网络节点定位算法

针对无线传感器网络非测距定位方法的应用,提出了基于质心迭代估计的节点定位算法.该算法首先计算当前连通信标节点所围成的平面质心的坐标及其与未知节点间的接收信号强度,然后用计算所得质心节点替代距离未知节点最远的连通信标节点,缩小连通信标节点所围成的平面,并通过多次迭代的方法提高节点定位精度.仿真实验结果表明,该算法的各项指标均为良好,适用于无线传感器网络的节点定位.     

基于联合分步APIT定位算法的改进

本文研究了无线传感网络( Wireless Sensor Network,WSNs)的节点定位问题,并针对APIT由于锚节点在低密度环境下的节点误判和节点失效等问题给出了改进,在APICT定位算法的基础提出了联合分步定位算法UNION-APICT(Union Approximate Point-In-Circumcircle Test),该算法是结合连通性的测距技术,RSSI测距技术以及质心定位和APICT等技术,来联合解决对未知节点定位问题。通过仿真实验结果表明,改进后的UNION-APICT在APICT算法的基础之上平均定位误差减少了10%-25%,定位性能有了明显的提升;随着通信半径R和最大探测距离rmax的增加,定位误差也在逐渐减小,该算法较APIT和APICT定位算法在锚节点密度、节点覆盖率和定位精度上都有所提高。