模拟裂纹的弯曲弹簧模型比较

合适的裂纹模型模拟能够真实反映梁裂纹的力学机理.首先分析了4种模拟裂纹的弯曲弹簧模型,然后以自由梁为例计算了4种弯曲弹簧模型下的固有频率值,并与实验结果进行对比.分析了4种弯曲弹簧模型模拟裂纹损伤的相对误差,结果表明,4种裂纹模型均可靠,能很好地模拟梁的裂纹损伤.弯曲弹簧模型III模拟裂纹的相对误差最小,建议采用此弹簧模型模拟裂纹损伤.     

锅炉模型简化及烟管受力计算

探讨和论述了DZW4．2-0．7／95／70-AⅡ型热水锅炉在利用有限元计算时模型的简化与分析，并利用弹塑性结构分析程序，对该型号锅炉进行了有限元弹塑性分析，给出了管板上各烟管的受力分析，并提出了改进意见，为该型号锅炉结构的合理设计提供了较为可靠的理论依据．     

盾构隧道装配式管片接头三维有限元分析

根据Saenz公式将混凝土本构模型简化为双折线线性强化弹塑性模型，推导了混凝土弹塑性参数的计算公式．应用大型结构分析有限元软件Alogr对装配式管片接头进行三维线弹性和弹塑性有限元分析，得到了混凝土应变、接头位移、接缝转角、螺栓拉力等计算结果，并将有限元计算结果与接头荷载试验测试结果进行了对比．研究表明，有限元计算值与试验值两者的变化规律是一致的，计算结果在反映结构应力／应变分布规律方面有重要参考作用．     

金钟面板堆石坝应力变形三维弹塑性有限元分析

对金钟水利枢纽面板堆石坝进行了三维弹塑性有限元分析,模拟了坝体材料分区、填筑及蓄水过程和面板的分缝,采用双屈服面模型模拟堆石体的变形特征.根据数值分析的结果,对竣工期和蓄水期坝体堆石和面板的应力变形规律进行了讨论.     

考虑锻件塑性变形的锻造系统动力学建模

提出了一种改进的锻造系统动力学建模方法,采用能够考虑锻件塑性变形的弹塑性离散弹簧模型模拟锻砧和锻件之间的接触行为.结合有限元法和拉格朗日方程建立了锻造系统在锻压过程中的动力学控制方程.通过与商业软件LS-DYNA显式有限元模型的仿真结果以及其他的结果的比较,验证了所提出模型的有效性和优越性,研究表明接触边界条件对锻造系统的动力学响应影响明显,在精确的响应计算中锻件的塑性变形效应不可忽略.     

柔性体碰撞阻尼模型的适用性分析

用理论和实验相结合的方法研究柔性梁和刚性球正碰撞过程中2种碰撞阻尼模型的适用性.基于Euler Bernoulli假设,考虑几何非线性,用绝对节点坐标法建立了平面柔性梁的动力学模型.用非线性弹簧阻尼模型建立了柔性多体系统的碰撞动力学方程;在考虑局部残余变形的前提下,用弹塑性模型建立了柔性多体系统的碰撞动力学方程,将碰撞过程分3个阶段（弹性碰撞,弹塑性碰撞,弹性恢复）进行分析.设计了柔性梁和刚性球的碰撞实验,将仿真计算与实验数据对比.结果表明,弹塑性模型更适用于碰撞分析.
     

无缝钢管局部径向模具塑性成形数值模拟研究

采用大变形弹塑性有限元理论，用DYNA3D(研究版)有限元软件对无缝钢管局部径向模具塑性成形过程进行了数值模拟研究，得出了钢管成形时内部应力应变的变化规律，并与物理模拟结果进行了比较，有限元法的计算结果和物理模拟结果吻合很好，说明采用大变形弹塑性有限元理论的计算方法是正确的。     

用耦合的有限元边界元法解地下结构弹粘塑性问题

讨论了用有限元与边界元耦合方法求解地下结构的弹粘塑性问题；对临界状态模型推导了用于隐式计算格式的　Ｈ矩阵的显式表达式。文中最后计算了两个应用实例，并与弹塑性分析结果进行了比较。     

锅炉模型简化及烟管受力计算

探讨和论述了D4.20.7/95/70AⅡ型热水锅炉在利用有限元计算时模型的简化与分析,并利用弹塑性结构分析程序,对该型号锅炉进行了有限元弹塑性分析,给出了管板上各烟管的受力分析,并提出了改进意见,为该型号锅炉结构的合理设计提供了较为可靠的理论依据.     

联肢剪力墙的弹塑性有限元分析

联肢剪力墙在地震作用下的非线性分析具有重要的研究意义,根据高层建筑结构联肢剪力墙的特点,将两元件墙单元与多弹簧连梁单元组合,对钢筋混凝土联肢剪力墙作弹塑性有限元分析.采用应变硬化的弹塑性应力应变关系描述钢筋,引入约束影响系数以考虑连梁箍筋对混凝土应力应变关系的影响,提出一种可以反映连梁弹塑性剪切变形的计算模型.验证了同济大学一组联肢剪力墙试验,计算结果与试验结果相符证明了模型的有效性.但滞回模型的骨架曲线有待进一步改进,以考虑下降段的影响.     

Characterization of Ordovician carbonate reservoirs, southeastern Saskatchewan, Canada

The discovery of the prolific Ordovician Red River reservoirs in 1995 in southeastern Saskatchewan was the catalyst for extensive exploration activity which resulted in the discovery of more than 15 new Red River pools. The best yields of Red River production to date have been from dolomite reservoirs. Understanding the processes of dolomitization is, therefore, crucial for the prediction of the connectivity, spatial distribution and heterogeneity of dolomite reservoirs.The Red River reservoirs in the Midale area consist of 3～4 thin dolomitized zones, with a total thickness of about 20 m, which occur at the top of the Yeoman Formation. Two types of replacement dolomite were recognized in the Red River reservoir: dolomitized burrow infills and dolomitized host matrix. The spatial distribution of dolomite suggests that burrowing organisms played an important role in facilitating the fluid flow in the backfilled sediments. This resulted in penecontemporaneous dolomitization of burrow infills by normal seawater. The dolomite in the host matrix is interpreted as having occurred at shallow burial by evaporitic seawater during precipitation of Lake Almar anhydrite that immediately overlies the Yeoman Formation. However, the low δ18O values of dolomited burrow infills (-5.9‰～ -7.8‰, PDB) and matrix dolomites (-6.6‰～ -8.1‰, avg. -7.4‰ PDB) compared to the estimated values for the late Ordovician marine dolomite could be attributed to modification and alteration of dolomite at higher temperatures during deeper burial, which could also be responsible for its 87Sr/86Sr ratios (0.7084～0.7088) that are higher than suggested for the late Ordovician seawaters (0.7078～0.7080). The trace amounts of saddle dolomite cement in the Red River carbonates are probably related to "cannibalization" of earlier replacement dolomite during the chemical compaction.     

An Index mechanism for multi-scale view in spatial databases

There are numerous geometric objects stored in the spatial databases. An importance function in a spatial database is that users can browse the geometric objects as a map efficiently. Thus the spatial database should display the geometric objects users concern about swiftly onto the display window. This process includes two operations:retrieve data from database and then draw them onto screen. Accordingly, to improve the efficiency, we should try to reduce time of both retrieving object and displaying them. The former can be achieved with the aid of spatial index such as R-tree, the latter require to simplify the objects. Simplification means that objects are shown with sufficient but not with unnecessary detail which depend on the scale of browse. So the major problem is how to retrieve data at different detail level efficiently. This paper introduces the implementation of a multi-scale index in the spatial database SISP (Spatial Information Shared Platform) which is generalized from R-tree. The difference between the generalization and the R-tree lies on two facets: One is that every node and geometric object in the generalization is assigned with a importance value which denote the importance of them, and every vertex in the objects are assigned with a importance value,too. The importance value can be use to decide which data should be retrieve from disk in a query. The other difference is that geometric objects in the generalization are divided into one or more sub-blocks, and vertexes are total ordered by their importance value. With the help of the generalized R-tree, one can easily retrieve data at different detail levels.Some experiments are performed on real-life data to evaluate the performance of solutions that separately use normal spatial index and multi-scale spatial index. The results show that the solution using multi-scale index in SISP is satisfying.     

A computer generator for randomly layered structures

AcomputergeneratorforrandomlylayeredstructuresYUJia shun1,2,HEZhen hua2(1.TheInstituteofGeologicalandNuclearSciences,NewZealand;2.StateKeyLaboratoryofOilandGasReservoirGeologyandExploitation,ChengduUniversityofTechnology,China)Abstract:Analgorithmisintrod…     

海南岛地体及其毗邻陆缘晚中生代—新生代古地磁研究和构造演化

本文叙述了对海南岛及其毗邻大陆边缘白垩纪到第四纪地层岩石进行古地磁研究的全部工作过程。通过分析岩石中剩余磁矢量的磁偏角及磁倾角的变化,提出海南岛白垩纪以来经历的构造演化模式如下:早期伴随顺时针旋转而向南迁移,后期伴随逆时针转动并向北运移。联系该地区及邻区的地质、地球物理资料,对海南岛上述的构造地体运动提出以下认识:北部湾内早期有一拉张作用,主要是该作用使湾内地壳显著伸长减薄,形成北部湾盆地。从而导致了海南岛的早期构造运动,而海南岛后期的构造运动则主要是受南海海底扩张的影响。海南地体运动规律的阐明对于了解北部湾油气盆地的形成演化有重要的理论和实际意义。     

Exciton Seebeck in Molecular Systems

Various applications relevant to the exciton dynamics,such as the organic solar cell,the large-area organic light-emitting diodes and the thermoelectricity,are operating under temperature gradient.The potential abnormal behavior of the exicton dynamics driven by the temperature difference may affect the efficiency and performance of the corresponding devices.In the above situations,the exciton dynamics under temperature difference is mixed with     

Achieving Unusual States of Matter Under High Pressure

The elongation method,originally proposed by Imamura was further developed for many years in our group.As a method towards O(N)with high efficiency and high accuracy for any dimensional systems.This treatment designed for one-dimensional(ID)polymers is now available for three-dimensional(3D)systems,but geometry optimization is now possible only for 1D-systems.As an approach toward post-Hartree-Fock,it was also extended to     

《Chinese Science Bulletin》SUBJECT INDEX TO VOLUME 59(2014)

正~~     

An on-line scaling method for improving scalability of a database cluster

The explosive growth of the Internet and database applications has driven database to be more scalable and available, and able to support on-line scaling without interrupting service. To support more client's queries without downtime and degrading the response time, more nodes have to be scaled up while the database is running. This paper presents the overview of scalable and available database that satisfies the above characteristics. And we propose a novel on-line scaling method. Our method improves the existing on-line scaling method for fast response time and higher throughputs. Our proposed method reduces unnecessary network use, i.e. , we decrease the number of data copy by reusing the backup data. Also, our on-line scaling operation can be processed parallel by selecting adequate nodes as new node. Our performance study shows that our method results in significant reduction in data copy time.     

An improved R-tree based on childnode''s probability

R-Tree is a good structure for spatial searching. But in this indexing structure,either the sequence of nodes in the same level or sequence of traveling these nodes when queries are made is random. Since the possibility that the object appears in different MBR which have the same parents node is different, if we make the subnode who has the most possibility be traveled first, the time cost will be decreased in most of the cases. In some case, the possibility of a point belong to a rectangle will shows direct proportion with the size of the rectangle. But this conclusion is based on an assumption that the objects are symmetrically distributing in the area and this assumption is not always coming into existence. Now we found a more direct parameter to scale the possibility and made a little change on the structure of R-tree, to increase the possibility of founding the satisfying answer in the front sub trees. We names this structure probability based arranged R-tree (PBAR-tree).     

Wuhan University Journal of Natural Sciences TOTAL CONTENTS

<正>~~