三维扭曲叶片贴体网格生成的多网格—强隐式方法

采用直接求解偏微分方程组的方法生成具有复杂扭曲规律的三元离心叶轮贴体网格坐标.在数值求解中采用了三维强隐式方法和多网格技术,大大提高了数值计算的收敛速度.用本方法生成的三维贴体网格,具有网格线光滑性好,并可较方便地控制网格曲线的分布规律等优点,可用于三维粘性流场和跨音流场计算网格的生成.     

用PDE方法生成船体周围流场网格

在船体表面精确表达的基础上，采用船体表面的贴体坐标，求解Ｐｏｉｓｓｏｎ－ｔｙｐｅ ＰＤＥ方程得到船体周围三维流场网格，通过改变控制函数，能可视化地，交互地产生不同疏密和走向的网络。这种方法较适合于具有任意曲面内外边界条件下的三维流场网格生成。     

高速双体船兴波阻力的数值计算

本文以理想流体的势流理论为基础，建立高速双体船的模型，由于双体船每一片体长宽比Ｌ／Ｂ很大，兴波接近于线性理论，计算时在船体表面及自由表面布置Ｒａｎｋｉｎｅ源，采用线性自由表面条件，对片体方尾后自由表面作特殊边界处理，从理论上预报了高速双体船在不同Ｆｒｏｕｄｅ数，不同片体间距船宽比时，船体周围的流场分布，船体内、外侧表面的波形、压力分布以及兴波阻力系数。     

三体船升沉和纵倾计算及其对兴波阻力的影响

基于三维Rankine源方法迭代计算三体船静水航行时的兴波阻力、升沉和纵倾.计算过程中采用NURBS曲面表达船体,根据迭代计算得到的升沉和纵倾确定船体平均浸湿表面,并用铺砌法对其进行全四边形网格划分,计算三体船及其中体的兴波阻力、升沉和纵倾.计算结果与试验结果比较表明,所提方法能够较准确地预报三体船静水航行升沉和纵倾,且考虑升沉和纵倾后,三体船兴波阻力数值计算精度有明显改进.     

典型标准水面船型阻力和黏性流场的计算

本文通过采用PISO(Pressure Implicit with Splitting of Operators)算法求解不可压缩RANS方程,对两类典型标准水面船型阻力和黏性流场问题进行数值计算验证.其中自由面的模拟采用单相Level set方法,湍流模式选取SST k-ω模型.首先以标准数学船型Wigley船为例,进行网格收敛性验证,讨论分析时间步长的选取和壁面网格参数的确定对计算结果的影响,为复杂问题的求解提供经验参考;然后在合适的网格及时间步长下计算不同Froude数(Fr)时Wigley船体受到的总阻力系数、摩擦阻力系数、船体表面波高图等,并分别与模型试验结果和经验公式估算结果对比,结果吻合很好,从而验证了该算法的可靠性.此外,还模拟计算了第二类标准船型DTMB5415的阻力系数和黏性流场,总阻力计算结果与实验结果吻合很好,船体波高图与实验结果相比稍有误差.数值计算结果和分析充分证明本文算法和计算程序的可靠性.     

斜流式喷水推进器内部三维紊流流动的数值模拟与性能分析

应用数值模拟方法研究斜流式喷水推进器内部紊流流场,基于紊流流场计算分析了其特性.采用三维贴体坐标网格对计算区域进行剖分离散,选择k-ε双方程紊流模型,应用SIMPLEC数值方法计算内流场各流动参数,进而根据流场的计算结果预测了该推进器内部泵在不同工况下的性能.计算结果与实验结果进行了对比,二者有较好的一致性.     

三维船体自由面贴体网格的数值生成

本文开发了一种用于任意船型的可讨论自由面对船体粘性流场影响的三维船体贴体网格的自动生成程序。文中所采用的三维船体贴体坐标系将不固定在随时间运动的自由表面上，以预估的最大波高来限制自由面网格的区域，通过内插或外插来满足自由面上的边界条件。该模块的特点是网格生成的计算量相当小，尤其能极方便地控制自由面在船面附近的网格密度以及船面附近的网格间距，以Ｓｅｒｉｅｓ６０船模作为计算算例，其网格生成的质量是相当     

喷水推进船模旋转叶轮流场的数值分析

为建立喷水推进船的自航试验模型,采用虚拟盘模型和重叠网格模型对装船后喷水推进器内的旋转叶轮进行数值计算,探讨了2种数值计算模型所得喷水推进船模船体的外流场及推进器流道内的轴向速度分布,并分析了喷水推进船模的流场特性.结果表明:2种模型的船体外流场计算结果基本一致,但两者的推进器内流场计算结果存在明显差别,且重叠网格模型的计算结果更接近真实叶轮状态;2种模型都能够模拟喷水推进船模内、外的流场特性,且对局部压力分布和船尾射流造成的兴波干扰效果的模拟结果均具有一致性.     

船舶CFD结构化网格自动生成技术的开发

为提高船舶黏性流场计算流体动力学(CFD)数值计算的效率,开发了带自由面三维船舶黏性流场CFD计算用网格自动生成软件.该软件可实现三维船体曲面模型导入、计算区域划分、结构化网格生成及边界条件设置等操作的自动化完成和参数化控制.以某集装箱船模校验程序,并在阻力性能和自由表面波高分布等多方面将数值计算结果与试验结果作对比.结果表明,该软件所生成网格在保证船舶阻力性能预报足够精确的同时,生成效率得到极大提高.     

船舶操纵粘性流求解器的开发与应用

介绍了基于求解雷诺平均纳维-斯托克斯(RANS)方程的分区网格船舶操纵粘性流求解器,以及应用该求解器计算船舶操纵相关的粘性流动与水动力的研究工作.计算了舵的粘性流场和水动力,所预报的舵升力曲线和阻力曲线在舵角未达到失速角前,与现有的试验和计算结果符合良好,所预报的舵失速角稍偏小.还计算了6∶1椭球体和Wigley船体做大角度定常斜航运动时的3维粘性流场及水动力,正确地模拟这种以层流/湍流分离流为主的复杂粘性流动,从而检验和验证了该求解器精确模拟粘性分离流动和计算水动力的能力.     

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.