GIS中多层多连形叠置的误差分析

多边形叠置法ＧＩＳ技术近年来研究的特点，它的成熟与完善将有效推动多要素地学分析实现系统化与自动化。多边形叠置法所产生误差的研究对目前各种技术方法所产生误差的机理进行了分析，并对如果控制误差发生及减少误差数量的原理与方法作了系统研究。     

空间叠置分析算法的改进研究

叠置分析是GIS空间分析中一个重要的研究内容,包括点、线和多边形分别与多边形叠加三种类型。本文在叠置分析Weiler-Atherton算法和Sutherland-Hodgeman算法基础上,提出一种既适用于简单多边形叠加,也适用于复杂多边形叠加的改进算法,简化了多边形叠加的流程。     

GIS中基于拓扑信息的矢量图形叠置方法

针对GIS系统中实现无拓扑信息多边形叠置过程复杂的问题,提出了一种新的快速多边形叠置方法.通过在无拓扑矢量数据中局部引入拓扑关系,对同一结点连接的弧段,采用二叉树方法进行排序,构建最小多边形,完成无拓扑信息的矢量图形的重组,并对新算法与已有算法的结构进行了对比.研究结果表明,这种新的叠置算法实现过程简单,速度快,避免了全局构建拓扑关系数据量大、空间和时间关系复杂、维护和更新困难等问题.     

GIS面数据批量更新技术方法研究

针对地理信息系统(GIS)面数据批量更新缺乏技术方法问题,利用坐标参考不统一的点位坐标数据及存在多边形重叠的面数据,研究坐标参考转换、叠置分析及多边形创建原理,采用数据库技术、GIS二次开发及叠加分析算法改进相结合的方法,研究并实现了GIS面数据的批量更新技术方法。应用该技术更新矿产调查数据,更新结果表明,该方法可以高效完成矿产调查数据的批量更新;为GIS面数据更新提供一种技术方法。     

井眼轨迹测斜计算方法误差分析

通过数值方法构造了用于井眼轨迹测斜计算方法对比分析的参考曲线，获得了测斜计算误差分析的参考条件。在此基础上对常用的平均角法、校正平均角法、平衡正切法、最小曲率法、弦步法以及它们的平均井眼位置的误差进行了对比分析。结果表明，无论哪种测斜计算方法，所表现出来的误差特性都很相似，均遵循随测深增加而线性增加的变化趋势。误差散点图表现出的分散性不强，与典型的随机误差的散点图相比，更偏向于系统误差的分布。由于井眼轨迹测斜计算方法误差对轨迹综合误差分析影响较小，因此，经过较大样本空间的分析，几种测斜计算方法所产生的误差概率密度函数均可用统一的解析式表示，通过最小二乘法拟合得到了该解析式的参数值。     

圆柱度误差虚拟测量仪的设计及OpenGL应用

介绍了虚拟测量仪技术和软件开发平台LabWindows/CVI,讨论了在设计圆柱度误差虚拟测量仪时所涉及到的采样方法、理论基础、数学模型等,采用对置两测头法误差分离技术,从而显著地降低了实际测量时对基准件的精度要求,给出了圆柱度误差虚拟测量仪的设计理念、开发实例以及OpenGL在圆柱度误差虚拟测量仪中的应用方法,所设计的虚拟测量仪的软面板可以显示圆柱度误差的三维误差图形,为分析误差产生原因,控制误差产生提供依据·     

基于线性方程的凸多边形内外点判别算法研究

多边形内外点判断算法是多个领域相关研究的基础，主要用于检测某点位于给定多边形内部或外部.针对传统射线法的奇异性问题以及角度和法、面积和法误差大、精度要求高等缺点，提出一种基于线性方程的多边形内外点判别新算法.该算法借助求解线性方程的思想，将点与多边形的位置关系判别问题转换为点与直线的位置关系判别问题.经过实验仿真，证明该算法能够正确判别点与凸多边形的位置关系，且能正确处理高精度的地理坐标数据.     

两步法圆度误差分离的原理及参数选择

讨论了圆度仪中用两步法分离被测工件圆度误差与圆度仪主轴误差的原理，分析了误差分离中产生失真的原因，并提出了适当选择参数以克服失真的两种方法，所提出的方法已在圆度仪数据处理系统中采用，并取得了很好的效果．     

两步法圆度误差分离的原理及参数选择

讨论了圆度仪中用两步法分离被测圆度误差与圆度仪主轴误差的原理，分析了误差分离中产生失真的原因，并提出了适当选择参数以克服失真的两种方法，所提出的方法已在圆度仪数数据处理系统中采用，并取得了很好的效果。     

基于截面线的隐式曲面多边形化

提出了基于截面线的隐式曲面多边形化方法,用一系列平行平面去截隐式曲面,根据正负法产生截面线,再对截面线进行拓扑重构和几何重构,实现了隐式曲面的多边形化,与传统的隐式曲面绘制方法相比,所提出的方法具有效率高,适合于交互设计等特点。     

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.