新型马鞍形索杆张力结构研究

提出一种基于马鞍面的新型索杆张力结构拓扑,结构整体形态更加稳定.进一步对形态分析中的迭代找力方法进行优化改进,在保证计算精度的前提下提高计算效率.应用改进的迭代找力方法对提出的新型马鞍形索杆张力结构进行了预应力设计.对跨度为36 m的马鞍形索杆张力结构进行静动力性能分析,计算结果显示结构在0.8 kg/m2面荷载作用下...     

刚塑性有限元求解板带轧制过程的初速度场

用可压缩刚塑性有限元法,通过自行开发的计算程序对板带轧制过程进行了二维非线性求解.在保证计算精度的情况下,以缩短计算时间为目标,研究了初等方法、G函数法和改进细化网格法设定初速度场对计算时间和计算结果的影响.结果表明:轧制力计算结果和实测值吻合良好,满足精度要求;初等方法、G函数法和改进细化网格法的计算结果相对误差不超过3%,初速度场设定对轧制力求解影响较小;G函数法和改进细化网格法相对初等方法迭代步数较少,由于需要求解方程组,G函数法设定初速度场计算时间最长;改进细化网格法在保证计算精度情况下,减少了迭代步数,缩短了计算时间,提高了计算效率和求解稳定性.     

弦支穹顶结构形态分析与施工控制

为了解决多索预应力结构在找力与找形分析中需多次迭代而导致效率低下的问题,进一步改进该类结构的分析方法,采用理论推导与数值计算相结合的方法,对弦支穹顶结构找力分析过程中的迭代格式进行改进,提出改进的找力分析方法.并以此为基础更新找力加找形分析方法,给出完整的计算流程,得到弦支穹顶结构的零状态几何、拉索下料长度以及与之相对应的初始应变.基于ANSYS软件中的APDL语言编制计算模块,通过两个算例,验证本文计算方法的正确性与精确性.本文方法亦可用于预应力结构施工全过程的模拟计算.     

张弦梁结构形态分析方法的改进

作为一种半刚性大跨空间结构,张弦梁结构的找形分析非常重要.改进的逆迭代法是找形分析中的一种比较有效的方法,通过引入初应变,能够在不破坏结构完整性的前提下,得到张弦梁结构的零状态几何和初状态预应力分布.但改进的逆迭代法在迭代过程中,由于找形和找力分开进行,影响了迭代效率.为此,基于改进的逆迭代法存在的问题,对其迭代过程进行了修正.通过在每次迭代中,将节点几何坐标和单元内力的精度要求同时作为收敛判据,并调整节点坐标和单元初应变,即使得体系的找形和找力过程同时进行;在迭代过程中分别引入节点坐标调整系数和初应变调整系数,并深入研究了这两个调整系数的不同取值对收敛速度的影响.算例结果表明:修正后的改进逆迭代法可显著减少迭代次数,提高了计算效率;研究发现两个调整系数对收敛速度有一定的影响,其中初应变调整系数的影响较节点坐标调整系数的影响大.在分析中选择合适的调整系数,可使找形分析的收敛速度更快.     

大跨度桥梁颤振时域的直接分析法

文章采用三维空间内单位脉冲响应函数描述自激力的方法,改进传递函数最小二乘法的拟合方法,从自激力时域描述公式中分离出气动质量,使得公式中的时间历程与当前时间无关,消除了迭代计算中由自激力时域公式引起的荷载非线性,提高了计算速度和计算精度;通过ANSYS实现颤振时程分析,以具有理想平板截面的简支梁和马鞍山长江大桥右汊桥为例...     

分析高层钢刚架弹塑性稳定的改进PΔ法

本文对PΔ法加以改进,保留了只用弹性刚度矩阵,引入虚拟水平力以及迭代计算等特点,抛弃了计算虚拟水平力的经验放大系数,改进了虚拟水平力算式,并引进了虚拟的竖向力和弯矩,提出了改进的PΔ法。经与试验结果和采用二阶协调分析法计算结果比较,本法具有良好的精度。采用本法计算不必繁冗地确定塑铰分布情况,计算过程单调重复,内存少,计算速度快,一般在微机上就可计算,易于使用。     

Turbo码译码的动态停止迭代准则的改进

提出了一种改进的动态停止迭代译码准则和方法,即CRC-MOR(cyclic redundancycheck-measurement of reliability)迭代停止准则,解决了在Turbc码译码时进行多次迭代,造成较大的译码延时。对所提出的CRC-MOR迭代停止判决准则进行的仿真,以及仿真结果与CRC和MOR译码迭代停止判决方法相比较,验证了所提出的改进迭代停止准则在译码性能没有降低的情况下,可以明显地降低平均迭代次数,减小译码延时。     

主成分计算的改进自然幂迭代方法

提供快速估计与跟踪一个向量序列的主特征向量的改进自然幂迭代方法．它是自然幂迭代方法的一个延伸,不仅跟踪主子空间,而且得到了主特征向量．与一些基于幂迭代的方法(例如Oja,PAST与NIC)相比,改进自然幂迭代方法具有最快的收敛速度,且能容易地以每步迭代O(np)的计算量加以实现,这里n为所考虑向量序列的维数,p为所要跟踪的主子空间的维数(或主特征向量的个数)．与某些非幂迭代的方法(例如MALASE与OPERA)相比,改进自然幂迭代方法保证了全局指数收敛．     

迭代滤波的自适应符号检测方法

在现有研究结果的基础上,对传统迭代结构进行改进,提出了一种适用于快衰落信道的改进迭代算法．通过递归计算给出更加逼近实际信道的迭代初始值并自适应调整迭代的收敛步长,减少了迭代次数提高了估计精度．仿真结果表明：和传统迭代算法相比,在适当增加复杂度的条件下,该方法有效的减少了迭代次数、提高了估计精度并改善了系统误码性能．     

牛顿切线法的一种改进及其应用

牛顿切线法是教学、科研以及工程技术中常用的数值方法,是求解非线性方程(组)的一种经典方法.因为它不仅有几何直观,而且具有二阶收敛性。本文对牛顿切线法迭代公式进行了改进:采用近似程度更高的二阶泰勒展开式的迭代公式.并对改进的迭代公式都通过例子与牛顿迭代公式进行了比较,显示其优越性.     

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.