二维FDTD算法的网络并行运算实现

提出了在由微机互连构成的机群(COW)并行计算系统上应用基于消息传递(Message Passing)的方式实现二维FDTD并行算法.通过区域分割,各个子区域在边界处与其相邻的子区域进行场值的数据传递,从而实现FDTD并行计算.文中还仔细分析了与FDTD相关的外围边界的并行化处理.我们采用MPI并行编程工具来实现并行FDTD算法.文中以二维金属方柱算例验证了算法的正确性和有效性,为运用FDTD方法进行电大尺寸复杂电磁问题数值模拟计算提供了一条有效途径.     

高效率FDTD网络并行计算研究

在一套Beowulf型网络并行计算机系统上,对FDTD并行化处理中的区域分割、邻近子区域之间的边界数据交换、数组操作和进程同步等关键步骤进行了研究和优化,提出了采用MPI并行函数的FDTD并行计算方案.通过三维FDTD并行计算举例,验证了并行计算的正确性,通过测试得到了较高的并行效率.     

MPI环境下FDTD高效率网络并行计算研究

FDTD(FiniteDifferenceTimeDomain)计算复杂电磁场问题存在计算时间长和内存耗用大的难题,并行计算可以减少单机处理量,是解决该难题的有效途径.本文针对网络并行系统特点结合FDTD算法,提出了有效的优化步骤,采用MPI并行函数库实现高效率FDTD并行计算.在一套16台微机组成的网络并行计算机系统上完成了三维FDTD并行计算举例.计算结果证明了该方案的正确性,并且得到了较高的并行效率.     

噪声边界的平滑处理

本文研究计算机图像处理中的噪声边界平滑技术，包括色块边界跟踪，边界曲线光滑，区域填充，区域收缩四个部分。文中提出联合边界的概念，从而减少了运算量；对传统的填充算法－－奇偶校验法进行改进，设计了简洁可靠的判断方法；把二维表（填充数据）改为一维表，则大大节约了存储空间。     

整体最小二乘参数估计的并行算法

基于递推最小二乘的逆ＱＲ分解方法,给出一种整体最小二乘参数估计的递推算法,并利用已获得的并行实现方法进行并行实现,最后给出了仿真结果．文中给出的并行计算方法使得在实际中应用整体最小二乘进行参数估计变得可行．     

三维快速多极边界元高性能并行计算

该文实现了快速多极边界元法的一种高性能并行计算。其并行求解器基于自适应新版本快速多极边界元算法,采用三维二次等参元和等精度积分格式,并通过实测的任务量进行分布式并行环境下的合理负载划分。数值算例表明,该求解器在保持高次边界元高精度优点的基础上,对于几何形状不规则的结构仍能保持较好的并行效率,和传统边界元法相比使解题规模有了数量级的提高。这种并行计算为边界元法在大规模复杂工程问题中的应用提供了有效方案。     

基于机群的并行分子动力学裂纹模拟

在探讨并行分子动力学算法的基础上,介绍机群并行分子动力学计算环境的构建.详细说明了在机群并行计算环境下,并行分子动力学计算的编程过程和实现方法.最后以并行分子动力学程序Lammps为例,介绍其在自强3000机群并行计算环境下的安装和使用,并以二维LJ裂纹扩展模拟的实例进行验证,得到一些初步的结果.     

基于多核的并行混合交通微观仿真系统

为了提高混合交通微观仿真的运行速度,基于多核并行计算技术构建了一个混合交通微观仿真平台.文中首先从平台功能结构、并行混合交通微观仿真流程设计与实现两个方面对平台进行介绍;其次,设计并实现了该仿真平台的关键并行算法,包括初始路网分割算法、车辆穿越边界算法及动态负载平衡算法;最后,通过仿真实验验证了多核并行计算技术能够大大提高混合交通微观仿真的运行效率.     

注射模冷却过程模拟的并行算法

根据边界元方法形成的系数矩阵的形态特点和计算机多核技术,提出了利用异步IO线程实现的矩阵并行生成算法和基于处理器时滞的线性稠密阵的并行SOR迭代解法,实现了注射模冷却过程模拟的并行计算,解决了该过程中所采用的边界元方法不适应并行计算的难题.数值结果表明,该算法在双核计算机上缩短了注射模冷却过程模拟1/3的计算时间.     

复杂电大平台天线EMC问题的并行FDTD分析

为了对复杂电大平台天线EMC（electronic—magnetic compacity,电磁兼容）问题进行分析,提出基于MPI编程环境的并行FDTD算法．通过区域分割技术将计算区域分成子区域进行计算,实现了计算资源的扩展和计算时间的缩减．天线隔离度的分析中,FDTD作为时域方法,通过傅里叶变换可快速求解,避免了扫频计算的复杂性．数值结果表明,这种方法可以对复杂电大平台天线方向图和隔离度进行准确、快速地计算．     

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

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.