不完备序区间值决策系统中所有可信规则的获取

研究了含区间值的不完备复杂信息系统,其不仅包含遗漏型未知属性值,而且属性值域为全序集.根据区间值特点给出其遗漏型和填充式区间值概念,并定义了不完备序区间值决策系统;然后,提出了区间段值概念和基于区间段值的序决策系统,其中引入灰的白化方法以将填充式区间值转换为区间段值;接着,提出基于区间段值的优势和弱势描述子,用以获取序区间段值决策系统中的所有可信规则并给出具体算法步骤;最后,用实例进行了验证.试验分析的结果表明了该方法的有效性.     

基于灰色决策系统中的知识获取

现实世界中的信息决策系统是非常复杂的,许多信息表中的记录不仅是离散值,还可能为区间值。本文以包含区间值的灰色粗糙集为研究对象,使用基于区间一致关系和区间包含关系取代经典粗集模型中的等价关系和不可分别关系,给出了从含区间值灰色决策系统中获取知识新的理论基础与操作手段。     

基于α-β优势关系的区间值信息系统属性约简方法

区间值信息系统是单值信息系统的一种扩充,如何对其进行属性约简是区间值多属性决策中的一个重要的问题.在已有的优势关系基础上,定义了α-β优势关系,得到基于新的优势关系的可辨识矩阵,进而对区间值信息系统进行属性约简,给出了约简算法.最后通过一个算例验证了新方法的可行性,并与已有方法进行了比较,结果表明所提出的方法更为简单有效.     

基于α-β优势关系的区间值信息系统属性约简方法

区间值信息系统是单值信息系统的一种扩充,如何对其进行属性约简是区间值多属性决策中的一个重要的问题.在已有的优势关系基础上,定义了α-β优势关系,得到基于新的优势关系的可辨识矩阵,进而对区间值信息系统进行属性约简,给出了约简算法.最后通过一个算例验证了新方法的可行性,并与已有方法进行了比较,结果表明所提出的方法更为简单有效.     

多标记序决策系统中基于局部最优粒度的规则获取

多粒度是当前粒计算研究的一个重要方面.在实践中,人们往往选择比较合适的粒度层次来解决问题.作为信息系统的一种特殊情况,多粒度决策系统是经常使用数据表示形式.在这样的系统中,对象可以在属性的不同粒度层次上取不同的观测值.实际使用时,常常遇到在数据属性上需要比较大小,即属性带有序关系.序关系分析是多指标决策的重要内容,而粗糙集是一种处理序关系有效方法.围绕多标记序决策系统的知识获取问题来开展研究,首先,介绍了多标记序决策系统的概念;然后,在协调的多标记序决策系统中定义了最优粒度和局部最优粒度,并介绍了基于局部最优粒度的属性约简和规则获取方法;最后,在不协调的多标记序决策系统中引入了广义决策,定义了广义最优粒度和广义局部最优粒度,并给出了基于广义局部最优粒度的属性约简和规则获取方法.     

随机信息中系统参数的灰色贝叶斯区间估计研究

在贝叶斯可信区间估计理论基础上,借助于灰色理论研究随机信息下贝叶斯灰色可信区间的估计问题,较传统的方法能够获取更多的有效信息.     

基于多粒度理论的不完备决策规则获取

将多粒度理论引入不完备决策系统中,针对其不完备性,结合非对称相似关系提出基于相似关系的不完备多粒度粗糙集模型,并讨论该模型的性质。随后重点讨论基于相似关系的不完备多粒度粗糙集模型中属性约简和决策规则获取的问题,将多粒度理论和近似分布约简相结合,提出了不完备多粒度近似分布约简,获得所有的最简确定决策规则和最简可能决策规则。最后通过实例分析,发现使用多粒度近似分布约简与规则获取方法比原有的单粒度近似分布约简与决策获取方法更合理有效。     

一种基于容差关系的辨识矩阵属性约简法

为有效处理灰色信息系统的属性约简问题,将粗糙集理论中有关属性约简的方法运用到灰色信息系统中,提出了一种基于容差关系的辨识矩阵属性约简法.这种方法并不对灰数进行白化,而是直接利用灰数的区间覆盖性定义一个基于贴近度的容差关系,并根据这个容差关系建立一个辨识矩阵对属性进行约简,避免了当灰数的取值分布信息缺乏时对灰数进行白化的主观性,是一种较为客观有效的灰色信息系统的属性约简法.     

基于决策技术和粗糙集理论的诊断知识库构建研究

针对目前诊断推理中知识库构建存在知识获取困难,提出了一种基于粗糙集和决策理论的诊断知识库构建模型.该模型引入决策技术和粗糙集理论,对源数据进行预处理,构建决策表,通过属性约简和属性值约简获取故障诊断的最小约简属性集和诊断规则,并建立诊断规则知识库.实例证明在保持故障诊断分类结果的情况下,该方法可以提取出最能反映故障的特征知识,并能有效地解决诊断知识库构建中规则获取的知识冗余或缺失问题,显著提高故障诊断的精度和效率.     

一类灰色区间聚类决策方法

以灰色决策分析理论为基础,探讨了经典灰色聚类决策方法的优势和不足.提出了基于理想方案的灰色区间聚类方法及其相关概念,建立了灰色区间关联系数公式和灰色区间相对关联系数公式.运用分析技巧,构建了灰色区间聚类决策算法.灰色区间关联系数公式是经典灰色关联系数公式的推广,而灰色区间聚类决策是经典灰色聚类决策方法的拓展.实例说明了所提出的灰色聚类决策方法的合理性及其算法的有效性.     

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.