对象-关系超媒体数据模型的组织方法与存贮模型

为实现对象-关系超媒体数据模型,必须解决多媒体数据的组织和管理问题.为此借助于面向对象的方法和层次模型的思想以及关系数据库的有关理论,设计了对象-节点模型和对象链模型,实现了对象-关系超媒体数据模型的组织策略,同时还设计了层次型节点-对象关系模型,实现了对象-关系超媒体数据模型的存储定义,并给出了对象-关系超媒体数据模型中媒体对象或节点的存储结构和定义方法,最后结合实例给出了该模型的具体应用,表明该模型具有较好的实用性和可操作性.     

R-偏序集上的不动点定理

研究对象是带有偏序逼近族的偏序集(poaets with families of approximating partial orders,简称R.偏序集),目的在于探索R-偏序集这一数学结构能否为语义域的研究提供一个较好的数学框架.Luis Monteiro在带有等价关系的集合(sets with families of equivalences,简称sfe)上重建了基于度量空间的语义域研究的部分理论.R-偏序集是较sfe更具普适性的结构.本文仿照Luis Monteiro在sfe上的结论及M.W.Mislove dcpo(directedly complete partial ordem)上Tarski不动点定理的证明,在R-偏序集上建立了逼近映射的不动点定理;同时构造了一个新的范畴R-POSET (即以R-偏序集为对象,R-单凋映射为态射的范畴),建立了范畴R-POSET与范畴GUMS(即以广义超度量空间为对象,非扩展映射为态射的范畴)之间的一个伴随,为从广义超度量空间角度研究R-偏序集提供了思路.     

一致连续偏序集的特征和浓度

利用连续格理论讨论了一致连续偏序集的特征和浓度,证明了一致连续偏序集的特征和浓度与一致连续偏序集带上Scott拓扑时的拓扑空间的特征和浓度相等,它们分别小于一致连续偏序集带上Law-son拓扑时拓扑空间的特征和浓度.     

关于度量空间的formal balls构成的偏序集

formal ball构成的偏序集为度量空间理论和domain理论提供了联系.作者考察了Ω-范畴的tensor完备化,证明了当度量空间被视为Ω-范畴时,其formal ball构成的偏序集正好是它的tensor完备化.     

关于度量空间的formal balls构成的偏序集

ball构成的偏序集为度量空间理论和domain理论之间提供了联系.作者考察了Ω-范畴 的tensor完备化.当度量空间被视为Ω-范畴时，其formal ball构成的偏序集正好是它的tensor完备化.     

基于Geodatabase的公路空间数据库设计

公路空间数据是公路信息建设中的重要内容,Geodatabase数据模型是建立在数据库管理系统DBMS之上的统一的、智能化的空间数据库.在分析探讨Geodatabase数据模型的数据组织存储及模型建立的技术方法基础上,进行了公路空间数据库的逻辑设计和详细设计.     

基于几何元素的具有影像纹理的三维空间数据模型

基于对城市三维地理信息系统中复杂对象进行描述 ,以及三维空间查询和影像纹理真实化表达的需要 ,将空间现象抽象为点对象、线对象、面对象、体对象、数字地面模型和栅格影像 6类。基于点、直线段和面片 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.     

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.