Sandwich panels with Kagome lattice cores reinforced by carbon fibers

Stretching dominated Kagome lattices reinforced by carbon fibers were designed and manufactured. The sandwich panels were assembled with bonded laminate skins. The mechanical behaviors of the sandwich panels were tested by out-of-plane compression, in-plane compression and three-point bending. Different failure modes of the sandwich structures were revealed. The experimental results showed that the carbon fiber reinforced lattice grids are much stiffer and stronger than foams and honeycombs. It was found that buckling and debonding dominate the mechanical behavior of the sandwich structures, and that more complaint skin sheets might further improve the overall mechanical performance of the sandwich panels.     

实用钢筋混凝土梁板结构优化设计

本文比较全面地考虑了钢筋混凝土梁板结构实际设计时的全部必要约束,给出了一套(单跨矩形和T形梁、单向板、按弹性理论计算的双向板和矩形等截面连续梁)简单实用的近优化设计的解析公式,为编制其优化设计的实用程序和图表提供了根据.     

Modelling and analysis of 3-D arrangements of particles by point processes with examples of application to biological data obtained by confocal scanning light microscopy

Within the concept of point processes, a review is presented of quantities which can be used in studies of three-dimensional (3-D) aggregates of particles. Suitable characteristics and estimators are given for both unmarked and marked point processes. To demonstrate the feasibility of such quantitative approaches, an application in histology, dealing with 3-D arrangements of cell nuclei in rat liver, is described. Using a confocal scanning light microscope, 3-D images are recorded and image analysis used to obtain the coordinates of the centroid, together with the volume and DNA content, of each cell nucleus. Examples of results are given, using both unmarked and marked point processes. In the latter case, cell type, nuclear volume and ploidy group are suitable marks.     

Mesh data structure selection for mesh generation and FEA applications

The data structure representing a mesh and the operators to create and query such a database play a crucial role in the performance of mesh generation and FE analysis applications. The design of such a database must balance the conflicting requirements of compactness and computational efficiency. In this article, 10 different mesh representations are reviewed for linear tetrahedral and hexahedral meshes. A methodology for calculating the storage and computational costs of mesh representations is presented and the 10 data structures are analysed. Also, a system for ranking different data structures based on their computational and storage costs is devised and the various mesh representations are ranked according to this measure. Copyright © 2002 John Wiley & Sons, Ltd.     

压电类智能层合结构的力学和计算模型综述

综述了压电类智能层合结构的力学和计算模型。基于大量国内外有关压电类智能层合结构的文献 ,根据各自采用的运动学假设、场变量的近似、压电层的表达法以及曲率和温度的影响 ,对压电层合结构的力学和计算模型进行了分类 ,阐述了各种理论的特点及一般形式。     

Optimal Solutions for the Temporal Precedence Problem

Abstract. In this paper we refer to the Temporal Precedence Problem on Pure Pointer Machines . This problem asks for the design of a data structure, maintaining a set of stored elements and supporting the following two operations: insert and precedes . The operation insert (a) introduces a new element a in the structure, while the operation precedes (a,b) returns true iff element a was inserted before element b temporally. In [11] a solution was provided to the problem with worst-case time complexity O (log log n ) per operation and O(n log log n) space, where n is the number of elements inserted. It was also demonstrated that the precedes operation has a lower bound of Ω (log log n ) for the Pure Pointer Machine model of computation. In this paper we present two simple solutions with linear space and worst-case constant insertion time. In addition, we describe two algorithms that can handle the precedes (a,b) operation in O (log log d ) time, where d is the temporal distance between the elements a and b .