基于粒度分层的布局设计模型

研究了问题求解的粒度理论在布局建模中的应用。综合相邻图、规范约束图以及层次约束图模型为不同粒度的组成部分,提出了基于粒度分层的布局模型和粒度投影规则方法。该模型能够克服单一粒度模型难以充分表达约束、求解时搜索最大等不足。     

一种基于粒计算的知识隐藏方法

对数据中蕴涵的敏感知识的隐藏与保护是私有保护数据挖掘中重要一个研究课题。粒计算具有在不同的粒度层次上进行问题求解的能力。本文讨论了基于粗糙集粒计算模型的数据中知识隐藏与保护方法。首先,介绍了不完备信息系统下的相容关系、相容信息粒和信息粒度;其次,提出基于粒计算的知识隐藏与保护方法;最后,通过具体实例和在真实数据集上的测试表明了所提出方法的可行性。     

基于相容粒度空间模型的图像纹理识别

信息粒广泛存在于现实世界中,是对现实的抽象。信息粒化旨在建立基于外部世界的有效的并以用户为中心的概念,同时简化人们对物理世界和虚拟世界的认识。使用信息粒进行计算是粒度计算的基本思想,在问题描述和求解中都具有重要的意义。主要研究一种新的粒度计算模型—相容粒度空间模型在图像纹理识别中的应用。该模型基于这样的思想,即人类具有根据具体的任务特性把相关数据和知识泛化或者特化成不同程度、不同大小的粒的能力,并进一步根据这些粒和粒之间的关系进行问题求解的能力。通过在多个数据集上和10种其他图像纹理识别算法的比较实验表明,该方法在图像纹理识别上具有良好的应用效果。     

基于相容粒度空间模型的图像纹理识别

信息粒广泛存在于现实世界中,是对现实的抽象.信息粒化旨在建立基于外部世界的有效的并以用户为中心的概念,同时简化人们对物理世界和虚拟世界的认识.使用信息粒进行计算是粒度计算的基本思想,在问题描述和求解中都具有重要的意义.主要研究一种新的粒度计算模型-相容粒度空间模型在图像纹理识别中的应用.该模型基于这样的思想,即人类具有根据具体的任务特性把相关数据和知识泛化或者特化成不同程度、不同大小的粒的能力,并进一步根据这些粒和粒之间的关系进行问题求解的能力.通过在多个数据集上和10种其他图像纹理识别算法的比较实验表明,该方法在图像纹理识别上具有良好的应用效果.     

基于约束网络的汽车整车配置过程冲突消解

针对汽车整车配置过程的冲突,提出基于约束网络的冲突消解方法,将数学模型、客户需求、知识作为配置指标,建立基于约束的冲突消解模型,针对约束模型中约束等级,提出冲突影响权值,用扩展配置指标求解最优配置变量消解冲突,并通过新车型配置验证上述方法的有效性.结果表明,采用冲突消解方法,可以在保证配置约束网络一致性的基础上,配置出一款最大限度满足客户需求的产品.     

基于权值加密的隐私安全分布式约束满足问题求解

隐私安全的分布式约束满足问题(distributed constraint satisfaction problem,DisCSP)求解算法可以很好地满足信息敏感的分布式组合求解问题的需要,为了获得更好的求解效率,提出了一种基于权值加密的隐私安全DisCSP的求解算法,对DisCSP问题中的约束基于不同的隐私权值进行加密求解;不需要增加额外的agent进行隐私约束的一致性检查,实现分布式的安全求解策略;对于可能出现的推理信息,用随机选择策略来避免信息泄漏.试验表明,该算法可以减少信息的传递量和计算的复杂性,因而具有更好的求解效率.     

基于分布式约束满足的产品配置研究

针对分布式网络化产品配置的特点,将产品配置问题抽象为约束满足问题进行研究.为解决配置知识共享及配置知识的语义表达问题,采用本体驱动的面向对象的思想构建产品配置约束网络结构模型,将该模型转化为分布式约束满足问题(Distributed Constraint Satisfaction Problem,DCSP)求解模型,从而可以准确、完全地描述产品零部件的结构及设计知识,并采用异步弱授权回溯算法进行约束求解,大大提高了求解的搜索效率和准确性.最后给出模型在水泵产品配置设计过程中的实际应用.     

基于约束网络的产品进化设计

为解决约束条件下的产品设计问题,以复杂网络理论及图论为指导,建立了基于约束网络的产品创新设计模型.该模型从设计约束库中筛选相关要素作为约束变量,构建设计约束网络;利用对偶图计算约束网络中心性指标,实现节点重要度排序,进而归纳出设计约束问题并进行求解;最后建立一套基于约束的产品进化设计系统. 以夜光杯为对象进行实例研究,构建相关设计约束网络;分析得到其关键节点,归纳出具体的设计约束问题,并应用动力学模拟、控制点区间约束等方法对其进行求解;开发夜光杯进化设计系统,选取具有代表性的传统夜光杯样本进行形态进化,生成一系列满足约束条件的夜光杯设计方案.结果表明:该模型有效实现了约束网络指导下的产品设计.     

多粒度决策系统的局部最优粒度选择

粒计算是知识表示与数据挖掘的一种重要方法.它模拟人类思考模式,以粒为基本计算单位,以处理大规模复杂数据和信息等建立有效的计算模型为目标.在粒计算看来,一个粒是由多个比较小的颗粒组成更大的一个单元.在许多场合下,由于不同标记尺度对数据有不同的分割,会得到不同层次的信息粒度.在面对具体问题时,自然而然地考虑选择一个合适的粒度层次来解决问题.针对具有多层粒度决策系统的粒度选择与规则获取问题,首先介绍了多粒度决策系统的概念,并在多粒度决策系统中定义了局部最优粒度,然后介绍了多粒度决策系统中基于局部最优粒度的属性约简.最后,给出了基于局部最优粒度的规则获取方法,并结合具体实例给出了规则获取的一个算法.     

基于分布式产品模型的并行设计过程的研究

研究了产品并行设计过程,提出了基于分布式产品模型的并行设计分布式约束满足机制,该机制利用产品模型控制和指导设计过程,通过Agent之间的相互协作,使得设计约束不断得到满足,通过产品模型的分布表达及基于产品模型的并行设计分布式约束满足机制,分布,协作,并发的并行产品设计过程能够得到很好的支持,满足并行设计Top-down设计,约束设计和再设计的要求,在此基础上,开发了一个原型系统,给出了设计实例。     

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.