正态分布连续体结构可靠性拓扑优化设计

对具有随机参数的连续体结构进行了拓扑优化设计,并考虑了随机参数满足正态分布的可靠性约束,获得优化结构的同时保证了结构的可靠度.根据可靠性理论的一次二阶矩方法,利用随机有限元求解了连续体结构的可靠度,将隐式的可靠度约束转化为等价的常规约束.将模式识别技术的K邻近(KNN)方法引入到连续体结构拓扑优化设计领域,对连续体结构进行了拓扑优化设计.根据该设计方法给出了计算示例,结果表明该设计计算方法是可行的,为工程设计提供了理论依据.     

基于可靠性的柔顺微夹持机构几何非线性拓扑优化

为减少因制造过程中的不确定性因素而导致的机构性能下降现象,文中给出了一种基于可靠性的柔顺机构几何非线性拓扑优化设计方法.首先,建立增量形式的平衡方程,采用Total-Lagrange描述方法和Newton-Raphson载荷增量求解技术获得几何非线性的结构响应.其次,考虑几何尺寸及作用荷载大小的不确定性,建立柔顺机构多目标拓扑优化数学模型.目标函数以平均柔度最小和几何增益最大来满足机构的刚度和柔度需求;可靠度的概率约束采用一次可靠度方法计算;目标函数灵敏度分析采用伴随求解技术;拓扑优化采用固体各向同性材料插值方法,并用移动渐近方法进行迭代求解.最后,以柔顺微夹钳的可靠性拓扑优化为例进行研究,发现基于可靠性的拓扑优化所得机构比确定性拓扑优化所得机构更合理,说明文中所提方法是正确和有效的.     

基于可靠性的柔顺机构几何非线性拓扑优化设计的研究

给出了一种基于可靠性柔顺机构几何非线性拓扑优化设计的新方法。其目的是将可靠性分析集成到几何非线性拓扑优化中。首先,建立增量形式平衡方程,采用Total-Lagrange描述方法和Newton-Raphson载荷增量求解技术求解几何非线性的结构响应。其次,考虑几何尺寸及作用荷载大小的不确定性,建立柔顺机构多目标拓扑优化数学模型。目标函数以平均柔度最小和几何增益最大来满足机构的刚度和柔度需求。可靠度的概率约束采用一次可靠度方法计算。目标函数敏度分析采用伴随求解技术,拓扑优化采用SIMP材料插值方法,并用移动渐近方法进行迭代求解。最后以柔顺微夹钳的可靠性拓扑优化为例,说明本文所提方法的正确性和有效性,研究结果表明基于可靠性拓扑优化所得机构比确定性拓扑优化所得机构更合理。     

基于SIMP方法微电容加速度计结构固有频率拓扑优化

基于连续体结构拓扑优化的SIMP材料插值模型,以叉指式微电容加速度计弹性梁和质量块的一阶固有频率最大化为目标函数,以体积比作为约束条件,建立了弹性梁和质量块的拓扑优化模型。采用优化准则算法进行迭代求解计算。获得了满足不同体积约束并使一阶固有频率最大的微电容加速度计弹性梁和质量块的多种拓扑优化结构,其中28%体积比约束下的拓扑优化结构与其初始结构相比,一阶固有频率提高了3 330 Hz,提高比例达46.4%。计算结果表明通过构建的拓扑优化模型及优化求解方法可以较好地解决微加速度计频响范围过窄的问题。     

多工况及动态连续体结构拓扑优化中的工程约束技术

在对经典算例研究的基础上,引入一种工程约束技术来改善多工况和动态连续体结构拓扑优化结果的合理性,该方法是在半径过滤法的基础上增加工程约束条件. 数值结果表明,利用工程约束控制技术能很好地解决拓扑优化中结果的合理性及可设计性问题,拓扑优化下的结构材料分布具有明显的一致性特征.      

一种新的考虑柔顺度要求的结构拓扑优化方法

为了解决拓扑优化分析计算量大和材料分布等问题,提出一种不影响算法收敛性的设计空间调整手段.针对体积约束和柔顺度最小的结构拓扑优化问题,采用变体积约束限的方法控制柔顺度变化的步长,然后,根据优化准则法,提出一种新的考虑柔顺度要求的结构拓扑优化方法.研究结果表明:该方法具有较高的求解效率,同时能够获得较好0～1分布特征的优化拓扑.     

基于区间不确定性的多学科可靠性设计

针对随机可靠性设计和多学科设计直接结合中存在的随机可靠性无法解决不确定性信息量较少及直接结合的嵌套结构计算效率较低的问题,采用区间描述有限信息的不确定性,以非概率可靠性指标衡量多学科系统的可靠性,建立了基于区间不确定性的多学科可靠性设计模型.同时,为了提高计算效率,采用性能测量法来减少可靠性分析的计算量,并引入序列优化与可靠性评估方法将三层嵌套的多学科可靠性设计结构解耦为顺序执行的确定性多学科设计优化和多学科可靠性分析过程,降低了计算复杂性.通过一个算例验证了该方法的可行性和有效性.结果表明,相比多学科可行法,单学科可行法的计算效率较高.     

考虑增材制造填充结构强度的拓扑优化方法

提出了一种针对给定薄壁外形的内填充结构拓扑优化方法,用于设计具有优化结构强度、满足增材制造几何要求的轻量化多孔填充结构.基于p范数函数计算结构最大应力近似值,并以最小化该值为优化目标,以提升填充结构强度.通过在优化模型中考虑局部体积约束,获得多孔填充构型,并进一步提出局部体积上限动态调整策略,提升优化过程稳定性,避免优化过程约束过强导致结构构型和应力响应突变甚至优化失败.此外,考虑了自支撑约束,保证优化所得填充结构自支撑,且支撑给定薄壁外形的悬空区域.引入了基于两场公式的优化模型,确保优化所得填充结构满足增材制造最小尺寸要求.数值算例表明,所提方法优化结果与以最小化柔度为目标的填充结构拓扑优化结果相比,在相同质量下结构强度得到了显著提升.在此基础上,在优化模型中考虑了柔度约束,讨论了填充结构刚度、强度的相互影响规律.     

基于Chebyshev零点多项式区间不确定的可靠性拓扑优化设计

传统的结构拓扑优化分析和设计都是基于特定参数确定性的物理模型。然而,在实际的结构设计中存在着广泛的不确定性,这种不确定性严重影响结构的物理性能。文中基于多椭球凸模型的非概率可靠性来量化结构参数的变化,研究存在不确定但有界的参数的连续体结构的拓扑优化问题。首先,建立变量具区间不确定性的可靠性拓扑优化模型,以结构设计区域质量最小为目标函数;然后,根据可靠性指标的几何意义,应用非概率模型寻求满足目标可靠性指标约束的设计点;在此基础上,应用区间Chebyshev零点多项式逼近归一化随机变量的真实极限状态函数,并利用单环可靠性算法计算相应目标可靠性指标下的最佳设计点值,从而使得非概率可靠性优化问题可以转化为确定性优化问题。两个数值例子说明了方法的有效性。结果表明,与确定性的结构拓扑优化设计相比,考虑变量随机性的可靠性拓扑优化能够获得更加可靠的拓扑结构。     

不确定结构的区间可靠性优化设计

对不确定结构的区间可靠性进行了研究，建立了基于区间可靠性的优化设计模型.采用结合嵌套遗传算法和径向基函数神经网络的模型，进行区间的直接优化，解决了基于区间可靠性的优化设计求解问题，避免了间接模型的复杂转换过程.充分考虑了实际工程中设计向量存在扰动的情况，提出了该情况下目标函数波动的约束，使目标函数和约束函数在扰动下依然满足可靠性要求.通过数值算例验证了模型的有效性和优越性.将所提出的模型用于具有区间不确定参数的行车平板优化，结果表明了所提方法的可行性和工程有效性.     

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.     

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).     

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.     

Integrating GIS Web services based on mediating architecture

The geographic information service is enabled by the advancements in general Web service technology and the focused efforts of the OGC in defining XML-based Web GIS service. Based on these models, this paper addresses the issue of services chaining,the process of combining or pipelining results from several interoperable GIS Web Services to create a customized solution. This paper presents a mediated chaining architecture in which a specific service takes responsibility for performing the process that describes a service chain. We designed the Spatial Information Process Language (SIPL) for dynamic modeling and describing the service chain, also a prototype of the Spatial Information Process Execution Engine (SIPEE) is implemented for executing processes written in SIPL. Discussion of measures to improve the functionality and performance of such system will be included.