基于残缺矩阵下多目标AHP的排序向量研究

对残缺矩阵下多目标AHP的排序向量,提出了可接受的残缺判断矩阵和不可接受的残缺判断矩阵的排序向量问题,通过特征根法的一致性检验的排序法和最小二乘原理的排序法的研究,解决了对残缺矩阵的AHP的排序问题。     

改进逼近理想解排序法的供应商评价和优选

为了对竞标者进行科学有效的评价,进而做出正确的供应商选择,基于改进的逼近理想解排序法建立了该决策问题的数学模型,提出了相应的评价流程。通过一个实例,分别用传统的逼近理想解排序法和改进后的逼近理想解排序法对备选供应商进行了评价和优选,从而验证了改进后的逼近理想解排序法较传统的逼近理想解排序法更适用、更有效。     

模糊排序在矿井设计方案综合评价中的应用

本文对模糊相对比排序法用于解决在多因素条件下确定矿井最优设计方案问题进行了探讨。在多方案多目标的决策中,采用了模糊相对比排序法将定性指标数量化,进而将方案排序。同时提出了利用模糊相对比排序法确定决策的权数分配。     

一种改进的行和归一化排序方法

提出了一种改进的行和归一化排序方法(INRAM), 从保序性、置换不变性、相容性和累积优势度等方面对该方法的合理性进行了研究, 并且利用互补判断矩阵和互反判断矩阵之间的转换公式, 给出了相应的求解互补判断矩阵排序向量的算法, 从而丰富和发展了互反和互补判断矩阵的排序理论. 最后,通过算例将NRAM法和INRAM法与特征根排序方法(EM)及对数最小二乘法(LLSM)作了对比分析. 数值结果表明: INRAM法不仅简洁易行, 而且与EM 法的排序结果完全一致, 故能较好地揭示方案的真实排序.     

区间数排序的粗糙集方法

针对模糊多属性决策中属性值为区间数情况下区间数排序问题,应用粗糙集理论和模糊集理论得到了一种区间数的排序方法:区间数上近似集排序法;区间数下近似集排序法;区间数上(下)近似集折中排序方法.给出了区间数的粗糙集表示,区间数的粗糙集排序方法及其良好性质.详细论证了其与经典的区间数排序的可能度方法相比的诸多优势.同时给出了具体实例并进行了这种方法的应用与验证,以便能更好地理解这种粗糙集排序方法.     

基于分治策略的排序方法的比较研究

讨论了运用分治策略的思想实现快速排序、归并排序和堆排序三种排序算法,从分、解、合三方面剖析排序,从而得出分割方式是影响排序效率的关键,并将分治法扩展应用到更多排序方法中.     

一种改进的基于编号的选择排序方法

排序是计算机程序设计中的一种重要操作,在现有的排序方法中,多数情况都是对数据原始排列顺序的一种破坏,一旦进行了排序,数据原始存储顺序就发生了改变,若想再基于数据原始排列顺序进行其他操作也就困难了.排序只是对数据的一种分析手段,对数据记录并不需要一定将其排列有序,只需要对它做好排序准备,在需要排序时再进行排序操作.文中基于应用对选择法排序做了改进,同时,在选择法一次只能选一个的基础上,提高成一次可以确定两个记录,这样也提高了排序效率.     

TOPSIS中不同规范化方法的研究

针对不同规模、不同属性值数据范围和类型的多属性决策问题,采用排序一致性指标(RCI)定量地衡量了向量规范化法、极差变换法、线性比例变换法、比重变换法和指数变换法这5种规范化方法对TOPSIS排序一致性的影响.排序一致性指标越大,对应的规范化方法越好.研究结果表明,向量规范化方法能有效处理不同规模、不同属性值数据范围和类型的多属性决策问题,是TOPSIS排序中一种有效的规范化方法.     

Fuzzy排序向量的最小二乘算法

本文讨论了在Ｆｕｚｚｙ环境中应用最小二乘排序法，由Ｆｕｚｚｙ判断矩阵导出方案的Ｆｕｚｚｙ排序向量的问题。通过用λ截集距离的积分定义的Ｆｕｚｚｙ判断空间中的距离，给出了最小二乘排序法在Ｆｕｚｚｙ环境中的表示形式，将Ｆｕｚｚｙ环境中的最小二乘排序问题转化为泛函的极值问题。在讨论了对应于泛函的Ｅｕｌｅｒ方程组的性质之后，得到了方案排序向量的计算公式。本文将层次分析法中只能处理精确判断的最小二乘排序法拓广     

基于AHP—TOPSIS的小型水库除险加固优化排序方法

根据层次分析(AHP)法和理想点(TOPSIS)法,建立了小型水库除险加固优化排序数学模型.模型采用专家意见法确定排序决策指标,先通过AHP确定各指标权重,再用TOPSIS进行化优排序,最后以实例阐述模型的计算步骤.验证模型的可行性.在实际应用中,不同地区宜根据当地小型水库的特点,修正排序决策指标及权重.     

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.