基于遗传算法的二阶段结构损伤探测方法

为了有效地进行工程结构的损伤识别,提出了一种基于遗传算法的二阶段损伤探测方法.首先利用基于频率的多损伤定位准则和基于位移模态的多损伤定位准则分别计算出有关损伤的初步决策,然后利用信息融合技术中的证据理论方法,将两者的初步决策进行融合,从而获得较为精确的损伤位置估计,最后在已识别出的可能损伤单元的基础上,利用改进的遗传算法进行更精确的损伤位置和程度估计.数值仿真结果表明,采用证据理论进行融合可以获得较为精确的损伤位置估计,比单纯的多损伤定位准则识别效果更好,而采用改进的遗传算法则可以更为精确地判定损伤的程度,优于简单的遗传算法.     

基于影响线多源信息融合的悬索桥损伤识别

为了精确识别悬索桥结构构件的损伤位置及程度,建立悬索桥空间结构有限元模型,通过模拟准静态加载提取并分析结构的位移、应力影响线,并构建了影响线曲率差指标,通过提取结构振型与频率,构建悬索桥结构柔度矩阵,并构造柔度曲率差变化率指标,用于悬索桥结构构件损伤识别。基于Dempster- Shafer证据理论融合影响线与柔度指标,对模型中纵向下弦杆、纵向斜腹杆和吊杆的不同位置与程度损伤进行识别敏感性研究。研究表明,柔度曲率差变化率损伤识别指标比影响线损伤识别指标对悬索桥构件损伤更为敏感,信息融合指标比单一损伤识别指标损伤定位精度更高,且具有较好的噪声鲁棒性。     

基于数据融合的大型输电铁塔结构损伤识别

对输电铁塔进行损伤识别研究,可以提高其可靠性与安全性,避免重大事故的发生.将模态柔度差和模态柔度改变率引入到输电铁塔的损伤识别研究中,在单损伤和多损伤情况下,完成了某500kV输电铁塔的损伤位置识别.为了提高结构损伤识别的准确性,在铁塔损伤识别中引入多传感器数据融合技术,提出了基于数据融合的铁塔结构损伤识别方法,将模态柔度差、模态柔度改变率和模态曲率差3种损伤指标进行数据融合处理,融合后的铁塔损伤识别结果可以克服柔度指标在多损伤工况特征不明显和误判的情况,识别效果较单一指标得到了很大的改善.     

基于遗传优化神经网络算法的桥梁结构损伤识别

当前越来越多的大型桥梁结构安装了健康监测系统,作为桥梁健康监测系统的核心,结构损伤识别技术成为研究热点.基于人工神经网络和遗传算法的优点,提出了一种新的方法——遗传优化和神经网络混合算法(用遗传算法优化神经网络的初始权重,)实现桥梁结构损伤的位置和程度的识别.与传统的人工神经网络算法相比,该方法克服了其易于陷入局部最优的缺点.对工程实例梁的试验数据进行分析和结构损伤状况识别,结果表明,该算法的可行性和可靠性,可以应用于类似结构损伤的识别与评价.     

基于分级遗传算法的结构损伤识别方法

提出了一种基于遗传算法的利用不完整振动数据识别结构损伤的新方法，该方法首先扩展不完整的振型并利用单元能量熵差比确定结构损伤的大致位置，然后采用二级搜索策略，借助遗传算法确定结构损伤的程度，数值计算结果表明，当可能的损伤区域较大时，本方法较直接搜索策略更能有效地确定结构损伤的程度。     

基于小波分析和遗传算法的结构损伤诊断

提出了小波-遗传算法的概念,建立了一种既能识别结构损伤位置、又能确定损伤程度的小波-遗传算法。首先,以有限元分析求解损伤结构振型模态为基础,用db1小波做连续小波变换,由小波系数模极大值识别损伤的位置。然后,以单元刚度的折减系数为遗传算法的优化变量,用振型和频率的误差函数加权来构造目标函数,并通过损伤位置的确定来简化目标函数的变量,再用遗传算法对目标函数进行优化,从而确定结构的损伤程度。通过对一简支梁进行数值模拟分析,计算结果表明,提出的方法不仅能够有效识别损伤的位置,而且能够准确识别损伤程度。     

基于卷积神经网络和迁移学习的结构损伤识别

针对传统基于机器学习损伤识别方法手工提取特征适应性差、识别能力弱等问题,提出一种基于卷积神经网络和迁移学习的新颖、快速结构损伤识别方法.首先根据损伤特征向量特点,提出原始信号的分帧处理流程;其次考虑多传感器数据融合要求,建立多通道一维卷积神经网络结构损伤识别模型,给出模型的整体流程和网络参数;然后采集不同通道和不同噪声水平下,模拟不同位置程度损伤的15层框架数值模型加速度数据,进行损伤识别;最后将网络模型进行迁移学习,对7层框架模型试验进行损伤识别,并验证所提方法的可行性、准确性和计算复杂性.结果表明,该方法实现了特征自适应提取、损伤位置和损伤程度的精准识别,具有突出的计算效率.     

结构初始损伤识别的随机弹性模量

为进一步借助环境激励条件识别结构损伤,导出了求解未损伤结构与损伤结构随机弹性模量的方程.该方法从特征值问题出发,视泊松比参数、弹性模量参数分别为常量与随机变量,并结合结构的有限单元模型以及实测数据.通过引入结构单元损伤因子,对结构的初始损伤进行识别.该方法既可精确评价结构的初始损伤程度,也可初步估计初始损伤的位置,为结构损伤自动识别技术的实际工程应用提供了理论基础.     

表情识别中的粒子群检测与分割方法

结合粒子群优化算法,提出了一种对人脸进行精确检测与分割的方法,以提高表情识别的准确率。通过肤色分割得到大致的人脸轮廓;通过粒子群优化检测到人脸的精确位置。利用精确的人脸进行PCA降维和特征提取后可进行表情识别。实验结果表明,此方法很好的排除了干扰因素,提高了表情识别的准确率,尤其对于某些单表情效果极佳。     

染色体长度自适应调整的遗传算法在损伤位置识别中的应用

研究了改进的遗传算法在结构损伤位置识别中的应用。首先介绍了遗传算法在结构损伤模式识别中的应用,然后由染色体中局部区段损伤值缺损的特性,对遗传算法提出了对应的改进原理,通过对遗传算法的损伤模式搜索过程中染色体长度的自适应调整,缩小损伤位置的搜索范围,减少计算量。四边固支板结构损伤诊断位置的搜索过程验证了该改进的算法是有效的。     

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.