基于Lukasiewicz蕴涵算子的Vague集相似度量

分析了Vague集存在未知度,表明了存在不确定性的原因。指出了现有Vague集相似度量方法存在的不足。在充分考虑了Vague集不确定性和对Lukasiewicz蕴涵算子进行研究后,提出了一个基于Lukasiewicz蕴涵算子的Vague集相似度量新方法;并证明该方法满足相似度量基本准则。通过与现有相似度量方法的比较,说明新的相似度量方法克服了现有相似度量方法的不足,考虑了未知度因素对相似度量的影响,能够有效合理地区分数据。     

一种Vague集相似度量新方法及其应用

分析了影响Vague集相似度量的因素,并充分考虑了未知度对Vague集相似度量的影响,提出了一个新的Vague集相似度量方法,证明该方法满足相似度量的基本准则,通过分析影响相似度量的因素,探讨了现有Vague集相似度量方法存在不足之处,与现有相似度量方法比较证明新的相似度量方法能够有效和合理的区分数据,具有一定的优越性,最后在模式识别的应用实例中,给出了该相似度量方法的模式识别应用过程,实验结果表明了该方法的实用性。     

Vague集间新距离的分析和定义

Vague集的相似度量是Vague集在各个应用领域中的关键技术．根据相似工程学原理,指出一个相似度量必须满足的约束条件,提出一种改进的Vague集相似度量公理化定义,然后引入一种新的Vague集相似度量方法,并证明它满足这些公理化条件,最后,用实例说明其应用以及该方法的有效性和直观性．     

Vague集之间的相似度量分析

Vague集的相似度量是Vague集在各个应用领域中的关键技术．本文根据相似工程学原理，指出一个相似度量必须满足的约束条件，提出一种改进的Vague集相似度量公理化定义，然后引入一种新的Vague集相似度量方法，并证明它满足这些公理化条件，最后，用实例说明其应用以及该方法的有效性和直观性.     

基于不同度量方法的Vague集的相似度量比较

基于海明距离函数,给出了Vague集2种新的相似度量方法.根据不确定信息处理的实际背景,利用Vague集的相似度量应该遵循的5项准则,对常见的几种相似度量性质进行了逐一检验,并将这几种相似度量进行比较,指出了它们的不足.     

基于Vague集相似度量的水轮机故障诊断的研究

针对模糊集的推广形式——Vague集,描述了Vague集的含义与相似度量,并提出一种Vague集的相似度量在水轮机故障诊断中的新方法。通过两个实例阐明Vague集之间的相似度量在故障诊断中的可行性和有效性,这种方法为水轮机故障诊断提供了新的途径。     

Vague集相似度量及其在模式识别中的应用

Vague集自提出以来,由于它在各个领域中的广泛应用而引起众多学者的注意,而相似度量是其中的关键技术．目前虽有多种相似度量的方法被提出,但还没有一个相应的相似度量约束条件标准．在Li(2003)的相关工作之上提出一种改进的Vague集相似度量公理化定义,指出一个相似度量必须满足的约束条件．然后引入两种新Vague集相似度量方法,并证明它们满足这些公理化条件,最后给出一个它们在模式识别的应用实例．     

双枝模糊集与Vague集的关系

研究了双枝模糊集与Vague集的关系,指出对于给定的双枝模糊集,可以求得它的伴随Vague集;给出了双枝模糊集与它的α-伴随Vague集的关系定理;研究表明:可以利用Vague集的一些成熟的理论来研究和拓展双枝模糊集理论,以相似度量为例,基于Vague集现有的相似度量方法,利用双枝模糊集的α-伴随Vague集的相似度量作为双枝模糊集的相似度量。     

改进的Vague值间相似度量一般公式及其地标排序应用

针对现有Vague值间相似度量一般公式以常数为调节系数存在的不足,提出对其未知度子项调节系数增加与Vague值自身有关的函数的改进方法,给出了该函数应满足的条件。提出了一种包含该函数的新的Vague集间相似度量,对其性质进行讨论;并基于现有Vague集间相似度量,给出了一种该函数的选取方法。与现有相似度量比较表明,提出的相似度量明显改善度量结果的合理性和区分能力。与多准则模糊决策方法相结合,将提出的相似度量用于地标排序,表明其有效性、可行性和优越性,同时为地标排序提供了一种新方法。     

一种新的Vague集相似度量方式

在分析比较当前几种Vague集相似度量方法及其优缺点的基础上,提出一种新的Vague集相似度量方法.该方法充分考虑支持度以及真隶属度差距和假隶属度差距,并且区分隶属度差距的方向.该方法更符合实际,它为Vague集之间的相似度提供了一种更好的度量方法.     

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.