权重信息不完全的不确定语言多属性群决策方法

针对属性权重信息不完全、属性值信息以不确定语言形式给出的多属性群决策问题,提出了一种决策分析方法.首先,对不确定语言变量进行了描述;然后,给出了求解具有不完全信息的不确定语言多属性群决策问题的计算步骤,其核心是将专家给出的不确定语言决策矩阵集结为具有可能度信息的群决策矩阵,通过计算方案值与理想点的差异值,构建二次规划模型,得到属性权重值,进而可计算出相对接近度,从而得到所有方案的排序结果.最后给出了一个实例分析,结果表明该方法简单可行、便于应用.     

不完全信息群体多属性决策的弱序偏爱强度法

通过对决策个体提供的信息进行一致性检测,确定群体属性权重区间,从而克服了各决策者给出的属性权重信息不一致给决策带来的困难,使属性权重信息的集结过程充分体现群体的意志和意愿.构造各方案下的各个属性的群效用区间,借助弱优概念,探讨了建立在两两比较基础上的几种弱优关系的内在联系,从而为弱优关系建立的合理性奠定理论基础,最终构造了一种新的交互式的群体多属性决策偏爱强度方法.     

基于理想点的三角模糊数群体多属性决策法

针对模糊群体多属性决策问题,提出了一种新的属性权重和属性值均以三角模糊数形式给出的模糊群体多属性决策方法.该方法先假设方案在主观评价属性下的属性值采用三角模糊数的形式来表示专家评价值的模糊性和不确定性,而后假定每一主观评价属性都有一组相应的专家权重值,以反映专家在不同评价属性中的重要性程度,同时考虑到专家意见的相似度,将专家意见进行集结得到专家群体关于方案集的模糊决策矩阵.最后定义了三角模糊数正理想方案和负理想方案,计算各方案与理想方案的接近度,以此给出了三角模糊数群体多属性决策问题的理想点法.通过实例分析说明了该方法的可行性和有效性.     

基于群体理想解的供应商选择多属性决策

考虑每个属性下不同决策者权重不同的情形,提出群体理想解概念,为供应商选择建立了一种新的多属性群决策方法.首先,对每个属性,以所有决策者对所有供应商给出的最优(差)评价值作为其分量,构成群体正(负)理想解,由此计算对每个决策者而言各供应商相对该群体理想解的综合评价值;然后,对每个决策者,以其对所有供应商的最优(差)综合评价值作为相应分量,再定义群体正(负)理想解,从而得出决策群体对各供应商的最终排序结果.采用群体理想解取代群体效用,回避了群体效用归并难题.与现有方法的计算结果进行比较,证明本方法合理且高效.     

属性权重信息不完全的区间数多属性决策方法

针对属性权重信息不完全且属性值以区间数形式给出的多属性决策问题,提出了一种逼近于理想点(TOPSIS)的决策分析方法.首先对属性权重信息不完全的区间数多属性决策问题进行了描述;然后依据传统的,TOPSIS方法的基本思路,给出了解决属性权重信息不完全的区间数多属性决策问题的计算步骤,其核心是通过构建并求解二次规划模型,得到每个方案与正理想点、负理想点的差异值,进而计算出每个方案与理想点的相对接近度,即可得到所有方案的排序结果. 最后通过给出一个算例说明了该方法.     

对方案有偏好的区间粗糙数多属性决策方法

针对属性权重信息不完全且属性值和对方案的偏好值均为区间粗糙数的多属性决策问题,首先引入区间粗糙数的一些运算法则,然后给出了基于投影思想的目标规划模型来确定属性权重,基于区间粗糙数集成算子对区间粗糙信息进行集结,计算出各方案的期望效用值,从而获得各方案的排序择优.最后,实例分析说明了该方法的实用性和有效性.     

群体多属性决策的属性权重不完全信息的集结

对于不完全信息的群体多属性决策问题，研究在各决策者给出属性权重信息有冲突的情况下个体属性权重信息的集结问题．通过对决策个体提供的属性权重信息进行一致性检验，确定群体属性权重区间，使属性权重信息的集结过程充分体现群体的意志和意愿，最后给出案例分析．     

基于残缺语言区间信息的多属性群决策

针对属性权重为语言变量、评价信息为残缺语言区间信息的多属性群决策问题,提出了基于改进的模糊区间证据推理的分析方法.首先给出了残缺信息的随机变量表示方法,并根据专家在决策中的重要程度,将专家给出的决策矩阵组合成信任度矩阵,然后采用所提出的改进的模糊区间证据推理方法求得各方案的分布式评价值.计算各方案的模糊评价值,给出方案排序方法.最后给出了一个算例,证明了所提方法的有效性.     

群决策中基于不同偏好信息的相对熵集成方法

研究了基于不同形式偏好信息的群决策问题.在群决策中专家根据个人的偏好,常常对决策方案集给出4种不同形式的偏好信息,包括直接反映决策方案优劣次序的序关系值和效用值,以及2个决策方案成对比较互反判断矩阵和模糊互补判断矩阵.首先给出了序关系值、互反判断矩阵和模糊互补判断矩阵3种偏好信息均转化为效用值形式的计算公式, 然后从相对熵的概念出发,提出了一种相对熵最优化的集成模型,给出了模型的解.最后进行了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.