改进的模糊层次分析法

目的 改进传统的层次分析法。方法 将互反型判断矩阵改为模糊一致性判断矩阵，并把和行归一法或方根法与特征向量法结合使用，提出了改进的模糊层次分析法。结果 指出传统的层次分析法往往会导致判断矩阵不满足一致性条件，需要检验和修正，而且计算精度不高。改进后的模糊层次分析法既解决了判断矩阵的一致性问题，又解决了解的收敛速度及精度问题，以此求得与实际相符的排序向量。结论 改进传统的层次分析法较传统的层次分析法更加完善和行之有效，并符合人们的思维逻辑，形式简单，准确，且易建立。另外，由优先判断矩阵改造而成的模糊一致性矩阵满足一致性条件，无需再进行一致性检验，同时也可大大减少叠代次数，提高收敛速度，满足计算精度的要求．从而为多目标决策提供了较为可靠的决策方法。     

改进层次分析法对提金工艺风险权重系统确定

为了解决传统层次分析法在矩阵解的精度上存在的欠缺,获得更优越权重系统,采用改进层次分析法,提出新的指数标度.所需判断信息简单、直观,易为专家和决策者接受与掌握, 计算分析后所得的判断矩阵自然满足一致性要求,不需要进行一致性检验.与传统层次分析法进行结果比较,证明该方法更能得出可靠的权重排序值,具有较大的适用性.     

基于改进的Vague群决策的工程绿色施工风险评价研究

绿色施工风险评价对建筑业可持续发展具有重要作用.首先结合绿色建筑与绿色施工评价体系,建立了绿色施工风险评价指标.其次改进了Vague群决策方法,建立了绿色施工风险评价模型,运用层次分析法确定二级指标权重,根据二级指标权重和相应Vague值确定各专家的一级指标Vague值;对专家权重进行了改进,同时考虑专家主观权重和专家的评价意见及评价矩阵的一致性,避免了专家权重确定的主观性.最后利用Vague集计分函数对风险因素排序,根据得分和专家评价意见的集结得出绿色施工风险等级,克服了层次分析法权重确定的主观性和传统模糊集易损失中间值的不足.实例结果表明该方法能够更好地解决工程绿色施工风险评价问题.     

层次分析法的改进方法在煤矿安全评价中的应用

针对研究煤矿安全评价中层次分析法判断矩阵一致性及排序权值的求解问题.基于煤矿环境的特殊性及系统的复杂性,为能够全面评价煤矿的安全状况,采用层次分析法对煤矿进行安全评价.判断矩阵的一致性保证、权重的求解是层次分析法的主要环节,如何求得元素的权重并确保判断矩阵满足一致性是层次分析法的主要研究方向.采用遗传算法求解判断矩阵排序权值,并运用模糊综合评价法对煤矿系统安全进行综合评价.     

机油泵新产品投入风险模糊层次分析评价模型

为减少机油泵新产品开发投入风险,采用清晰集构造模糊集方法构造模糊一致性判断矩阵和采用层次分析法计算指标权重,提出了机油泵新产品开发投入风险模糊层次分析(fuzzy AHP)评价模型.对机油泵新产品开发投入项目风险量化实例结果表明,该分析评价模型可实现机油泵新产品开发投入风险因素的重要度排序,具有较好的合理性和可用性.     

层次分析法改进及其在橡胶林种植对流域输沙影响评价中的应用

层次分析法广泛应用于指标权重计算和决策,但在判断矩阵构造和一致性检验中存在局限性.针对传统层次分析法及其现有改进方法所存在的数值标度和一致性检验两个关键问题,提出通过无限制标度建立与专家判断初衷更为吻合的因素间相对重要程度数值标度方法,并通过传递的方式构造完全一致性矩阵,对不满足一致性的原判断矩阵根据最大差异项进行调整.云南橡胶林种植对流域输沙影响评价指标权重确定应用实例表明,该改造方法降低了专家对判断矩阵数值标度的难度,并在解决判断矩阵不满足一致性问题的同时最大程度保留了原判断矩阵的信息.     

采用模糊层次分析法的PFMEA方法改进及应用

为解决因各专家判断矩阵过于均一化而导致的风险排序与实际发生偏差的问题,在传统的基于模糊层次分析法的过程失效模式与分析(PFMEA)方法基础上做进一步的改进.从专家的个体区别和职业类别两方面考虑,分析专家判断矩阵变化程度对专家分组及评估各组别对专家权重的影响,进而合理设定专家权重.通过该改进方法在汽车空调冷凝器制造过程中的实际应用,验证方法的有效性.研究结果表明:改进的基于模糊层次分析法的PFMEA方法能更准确地对产品失效风险进行排序.     

基于模糊层次分析法的长输管道风险分析

利用三角模糊数表征专家判断信息,对其判断结果用层次分析法进行处理.运用模糊层次分析法对长输管道进行风险量化分析,构造模糊判断矩阵,并对其进行相容性和一致性检验,在层次单排序的基础上进行层次总排序,确定长输管道的风险因素,从而为其运行、维护和检验等提供指导.     

利用粒子群算法计算AHP判断矩阵排序权重

根据判断矩阵的基本性质,可以将判断矩阵的排序权重计算归结为一个最小化一致性指标的最小优化问题。针对这个最优化问题,提出一种利用改进的粒子群算法计算排序权重的算法。首先对判断矩阵排序权重计算及一致性检验、改进的粒子群算法进行了介绍,然后对排序权重计算进行了描述,最后给出仿真实验数据及其分析。实验结果验证了此算法的有效性,并显示该算法具有很高的精度和稳定性。     

基于FZZY-AHP评估模型的地铁车站施工风险分析

在地铁施工风险分析中,对参与专家意见的权重引入动态赋权方法,利用群策判断矩阵的相似性和差异性对专家权重进行动态赋权.区别于常规的根据专家威望和职称进行赋权的方法,合理有效地降低了主观印象及专业局限对评价结果的影响,使专家的评价更加具有客观性和可靠性.以兰州某地铁车站为算例,采用以动态赋权为基础的专家经验法并结合模糊层次评估模型,对车站基坑施工过程中存在的风险因素及其风险概率和风险损失进行量化分析,并根据量化结果对各风险进行大小排序,最后由风险评估矩阵确定其风险等级.评估结果表明,该地铁基坑存在较大的工程风险,且周边环境的风险要比基坑本身的风险略高.     

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.