证据特征提取及其在证据理论改进中的应用

尽管DS证据理论可以有效地处理不确定性信息,但是在证据高度冲突情况下,经典DS证据组合规则因归一化过程往往会产生有悖常理的融合结果.为此,很多学者提出了许多不同的修改方法,可以归为两类修改组合规则和修改证据.在总结这两类修改思路的基础上,分析了几种代表性的改进方法,同时通过引入证据距离,对证据源进行特征提取,提出了相应的改进方案.理论分析和数值实验结果表明,改进后的3种方法不仅能充分体现相应的改进思想,而且可以更好地实现证据组合,较快地收敛真实目标,得到合理的融合结果.     

一种改进的证据推理组合规则

提出了一种新的证据理论组合规则，综合考虑了支持信息和冲突信息对合成结果的影响。在求出各个证据之间局部冲突之后，利用各个证据的可信度得到系统的全局冲突；以全局冲突作为参量定义了一个冲突证据有效性系数，该系数反映了冲突信息对最终融合结果的影响。算例验证结果表明，新的组合规则能够有效地处理证据中的冲突信息，得出合理的融合结果。     

基于pignistic概率距离的改进证据组合规则

针对使用传统冲突系数识别证据冲突存在的不足,采用pignistic变换后得到的概率赋值函数之间的距离,结合传统冲突量化标准,讨论了Dempster组合规则适用条件,并提出了一种改进的证据组合方法.该方法通过证据之间的pignistic概率距离表示证据之间的冲突程度,将证据间的冲突程度转化成相似程度,然后求出证据之间的支持程度,并确定权重系数,最后采用Dempster组合规则合成权重系数调整后的基本概率赋值.数值算例分析结果表明,改进的证据组合方法可以有效地处理证据冲突,且具有较快的收敛速度.     

一种基于非封闭识别框架的改进证据推理方法

在证据融合推理时,由于系统中出现未知新命题和传感器收集的证据不可靠,使得Dempster组合规则不适用于冲突证据组合.为了有效地处理冲突证据,提出一种基于非封闭识别框架的改进证据推理方法.首先在封闭识别框架内增加一个表示新命题的集合,将封闭识别框架扩展为非封闭识别框架,给出新命题基本概率指派的赋值方法,然后给出非封闭识别框架下焦元的组合规则.在非封闭识别框架下,依据冲突焦元本身基本概率指派以及证据的可信度信息,将局部冲突在涉及冲突的焦元之间分配,最后通过实例结果表明,与封闭识别框架下的 Dempster组合规则结果相比,该方法可以有效识别出新命题.非封闭识别框架下的改进证据推理方法,可以通过在非封闭识别框架下,对新命题与已知证据及已知证据之间的两类冲突信息在局部分配,使最终证据推理结果向合理方向聚焦.     

基于局部冲突分配策略的证据理论组合规则

提出了一种基于局部冲突分配策略的组合规则，冲突主要分配给产生冲突的焦元，且分配给焦元的冲突大小取决干焦元的平均信度和证据的可信度。计算结果表明，新的组合规则不仅能够解决高度冲突证据的组合问题，而且能够从证据中提取更多的信息，使组合结果更为合理。     

信度决策树中推理策略的改进

指出现有信度决策树中推理算法的不足之处,给出了一种新的基于规则的推理算法.新算法充分利用信度函数理论处理不确定信息的优势,采用折扣规则修正叶节点的输出,考虑了测试属性权重对分类结果的影响,提高了分类的精度和可靠性.针对现有证据组合规则处理冲突证据的不足,提出了一种新的证据组合规则,可以将相对可信度等信息有效融入证据组合过程.     

一种新的证据组合规则

通过对证据组合问题进行深入的理论分析,提出一种新的基于局部冲突、局部分配和一致性部分进行合取规则的证据组合方法,同时利用证据的可信度来修正证据结构.在确定证据的可信度时,给出一种通用的计算模型.与很多改进的组合方法相比,该方法不仅适用于冲突情况,而且也适用于证据间比较一致的情况.数值仿真表明,所提出方法能加快收敛速度,同时降低决策风险.     

基于证据熵多源组合规则的风力发电机组故障诊断方法

针对证据理论在风力发电机故障融合诊断中存在的高冲突问题,提出一种基于证据熵的多源融合组合规则.由风力发电机历史故障特征数据模糊化获取原始证据,根据多类传感器实时数据重要性的不同,采用信息熵原理得到各证据的重要性参数即权重,对加权修改后的证据进行Dempster融合得到最终结果,最后基于决策准则作出故障诊断.风力发电机故障诊断实例表明,本方法在一定程度上降低了证据之间的冲突性,提高了故障诊断的准确率.     

冲突的区间信念结构下基于证据推理规则的群决策方法

针对区间信念结构组合问题,考虑群决策环境下专家意见冲突的情形,提出一种冲突的区间信念结构下基于证据推理规则的群决策方法。首先,依据决策者(或专家)对备选方案的评价信息形成群体决策问题,将专家的评价信息(观点)作为证据,检查评价信息的有效性并做归一化处理;其次,依据证据支持度确定专家权重向量,并运用证据推理规则融合所有评价信息;最后,运用最小最大后悔值法选出最优方案。实例分析表明,文中所提出的方法在证据组合过程中的证据融合结果始终保持一致,组合结果合理、收敛,而且能保持证据的特异性。     

基于改进冲突系数的证据理论组合新方法

通过对D-S证据理论冲突系数和组合规则进行研究,发现导致证据组合结果与事实相悖的另一个因素,为此,提出一种新的冲突系数表示方法和证据理论组合规则。新的方法针对证据冲突系数处理和组合规则不合理的情况,用自冲突系数和互冲突系数这2种方式的加权表示新的全局冲突系数。新的组合规则根据基本概率分配原则建立,并推导得出多点集焦元证据理论的组合情况。研究结果表明:本文所提方法与传统算法相比,规则更简便,更精确,在处理证据冲突和正常证据方面更具优势。     

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.