基于J2EE和XML的数据集成技术研究

本文提出了一种基于J2EE和XML的数据集成模型,采用了中间件系统模式的集成方式,使用XML Schema作为异构数据源的公共数据模型,以全局模式的数据视图呈现给应用层或用户,从而屏蔽后台,实现用户对异构数据源的透明访问。在查询处理上采用了XQuery作为全局查询语言,为应用层或用户提供统一的查询接口。此模型利用J2EE企业平台的优势和XML数据与结构相分离的特点,为J2EE和XML的集成模型提供了较强的跨平台性、可移植性和可扩展性。     

基于CORBA的多数据库系统中互操作性研究

对Panorama多数据库进行了概述。介绍Panorama中为实现不同DBMS之间互操作性而设计的全局查询语言PanoSQL,然后以Oracle为例,讨论如何将不同的DBMSs注册到Panorama中以获得系统的互操作性。     

基于CORBA的数据集成中间件的设计与实现

在研究了国内外异构数据源集成技术的基础上，给出了适合多种异构数据库数据集成的基于CORBA的体系结构、模式集成方法、查询分解算法以及查询优化方法，设计并实现了一个数据集成中间件系统Panorama．Panorama提供了一种研究异构数据集成的实践途径，是一种有效的数据集成工具．     

基于XML的异构数据库信息集成模型研究

本文在对传统的异构数据集成方案进行广泛的调查总结分析的基础上,提出了一种集成异构数据库信息的共享框架,该框架包括翻译器、集成器和转换器;翻译器将关系数据发布为XML文档,集成器和转换器来提供异构关系数据库的XML全局视图,允许外部用户直接访问或使用XML查询语言查询这些视图。     

基于XML的异构数据库信息集成模型研究

本文在对传统的异构数据集成方案进行广泛的调查总结分析的基础上,提出了一种集成异构数据库信息的共享框架,该框架包括翻译器、集成器和转换器;翻译器将关系数据发布为XML文档,集成器和转换器来提供异质关系数据库的XML全局视图,允许外部用户直接访问或使用XML查询语言查询这些视图。框架遵循定义的映射规范将关系数据库翻译为XML。     

一种基于数据服务匹配的数据集成方法研究

提出一种基于数据服务匹配的数据集成方法.该方法主要基于数据服务发布、注册和检索的方式工作,能更好地利用数据形式语义进行数据集成,并增强与语义web和描述逻辑推理等智能技术的融合.在介绍该方法的概念、思想和工作机制后,给出了基于数据服务匹配的集成查询检索算法,作为实现数据集成系统查询处理引擎的基础.实验结果表明,该算法能有效、可靠地工作.与传统数据集成方法相比,该方法的数据集成查询处理更为直接和灵活,具有良好的性能和可伸缩性,也不需要维护公共数据模式.     

基于本体的多源异构XML数据近似查询方法

提出了一种基于本体的面向多源异构可扩展置标语言（XML）的近似查询方法．该方法将传统的基于查询模式树松弛的近似查询策略与基于本体的XML数据集成思想相融合，首先建立文档类型定义结构与全局模式的映射模型（PTO），再将PTO与近似查询领域的松弛操作、打分机制相结合，提出了一种新的XML近似查询算法——OAXQ．这样，用户在全局模式下的查询语言不再是Xpath查询表达式，而是对象查询语言的一个简单子集，松弛的产生不再依靠查询模式树的变换，而是通过一系列映射规则转化而成．汽车外型的智能设计实验表明，OAXQ算法的查询速度比单纯基于查询模式树松弛策略的静态有序选择算法平均提高了20倍，查询准确度提高了2％～24％．     

基于领域知识的不确定关系模式集成

为了解决关系数据库中关系模式集成中的不确定问题,提出了一个基于领域知识的不确定关系模式集成模型。该模型运用领域知识、语义集成方法和证据组合方法处理模式集成各个阶段的不确定性,并给出了各阶段不确定度的表示和计算方法。文中给出了不确定匹配关系和不确定模式集成的全新定义,提出了一种全局集成模式可信度的计算方法。实例分析证明该模型是可行的,与已知方法相比具有较高的执行效率和较低的时间复杂度。     

MDBS中基于模式映射树的查询分解和优化

提出了一种多数据库系统的模式映射方法，并对水平映射、垂直映射、混合映射、相关映射和局部映射给出了一种统一的形式化描述．使用模式映射树存储和表达用于查询分解的全局模式以及全局模式到输出模式及局部模式的映射信息，使用查询树来表示多数据库查询的内部结构．通过合并全局查询树与模式映射树，给出了将全局查询转化为中间查询的全局查询分解方法．利用模式映射信息中的相关映射性质，给出了多数据库查询中全局连接的优化处理策略．     

基于XML的一种多Agent异构数据查询模型设计

提出一种基于XML的多Agent模型,用来解决分布式异构数据环境中的数据查询.模型包括用户个性化Agent、查询处理Agent、动态数据字典Agent、数据集成Agent和模式转换ANent.在模型中各个Agent既能独立完成各自的功能又可以相互合作,以XML语言为信息处理和交互的载体共同实现目标.     

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.