基于椭球等高分布混合模型的聚类方法

为解决有限混合分布模型的聚类分析中分量密度函数选择问题,通过研究广义多元分析理论,提出了基于椭球等高分布混合模型的聚类算法.首先,利用与正态分布有许多相似性质的椭球等高分布族来构造混合分布模型,并引入标签变量,将基于椭球等高分布混合模型的聚类转化为模型参数估计问题;然后,通过极大似然估计法和EM算法进行模型一般变量参数...     

带隐变量贝叶斯网学习方法：研究综述

带隐变量贝叶斯网是一种重要的概率图模型，通过引入隐变量，对数据中的隐含知识进行定性和定量描述，从而实现不确定性知识的表示和推理.近年来，带隐变量贝叶斯网的学习，成为了不确定人工智能和知识发现领域中的重要研究方向.文章分析总结了目前带隐变量贝叶斯网学习研究面临的挑战，针对所涉及的确定隐变量的势和个数、参数学习及结构学习这3个方面的工作，介绍确定隐变量势和个数的基本思想，对学界广泛关注的参数学习和结构学习的代表性成果进行了综述，给出相关方法的适用场景、基本思想和主要步骤，也给出相应的对比分析.确定隐变量的势及个数方面，阐述了基于聚类的方法和基于团的方法；参数学习方面，阐述了包括插补、梯度上升、EM算法在内的方法，以及基于EM算法的改进方法；结构学习方面，阐述了基于评分搜索方法和基于条件独立方法的基本思想，以及基于评分搜索算法的改进方法.此外，基于对现有研究成果的分析总结，指出了带隐变量贝叶斯网学习进一步研究的问题及重点.     

一种基于蚁群聚类的径向基神经网络

提出了一种基于蚁群聚类算法的径向基神经网络．利用蚁群算法的并行寻优特征和挥发系数方法的自适应更改信息量的能力，并以球面聚类的方式确定了径向基神经网络中基函数的位置，同时通过比较隐层神经元的相似性、合并相似性较为接近的2个神经元来约简隐含层的神经元，以达到简化径向基神经网络结构的目的．实验比较了几种不同聚类算法的径向基神经网络，结果表明，所提神经网络的整体训练时间至少可缩短40％，学习的准确率可提高1%以上，而且网络结构更加精简．     

改进的EM算法及其在防洪决策中应用

在给定贝叶斯网络结构情况下,利用EM算法及改进的EM算法对防洪决策贝叶斯网络进行参数学习,改进的EM算法通过定义祖先集及计算该祖先集中变量的条件概率,降低期望计算的计算量．应用两种算法对防洪决策贝叶斯网络进行了性能比较,结果表明,改进的EM算法用于贝叶斯网络参数学习和决策支持具有较高的计算速度和精确度．     

基于高斯混合模型的视频对象分割算法

针对应用高斯混合模型（GMM）进行视频建模与分割时的模型选择及参数估计初值选择的难点，提出了一种基于GMM的视频对象分割算法．首先进行特征提取，在特征矢量中引入加权运动信息，可根据不同需要选择合理的加权系数，然后通过分割投影进行模型选择及期望最大化（EM）算法的参数初始化并估计参数，这种初值选择方案使得EM算法的初值和真实值较接近，加快了迭代运算的收敛速度，从而提高了视频对象的分割速度，最后对特征矢量进行聚类分割．仿真实验表明，在保持良好分割效果的同时，所提算法的运算速度约为常规方案的76％，并且具有良好的稳定性．     

鲁棒的模糊方向相似性聚类算法

鉴于文本数据具有方向性数据的特征,可利用方向数据的知识完成对文本数据聚类,提出了模糊方向相似性聚类算法FDSC,继而从竞争学习角度,通过引入隶属度约束函数,并根据拉格朗日优化理论推导出鲁棒的模糊方向相似性聚类算法RFDSC．实验结果表明RFDSC算法能够快速有效地对文本数据集进行聚类．     

广义线性模型中不完全数据的参数估计

讨论了广义线性模型类中离散协变量和离散响应变量数据不完全时,参数极大似然估计的EM算法,文中给出了参数估计的具体表达式和估计的渐进协方差.最后,通过随机模拟说明EM算法的优良性.     

RBFN神经网络和蚁群算法在企业知识聚类中的对比分析

文中设计了一个3层径向基神经网络（RBFN）用于对企业的5项评价指标进行聚类分析，并与蚁群算法做了比较分析。RBFN由输入层到隐含层采用传统的K-均值算法，隐含层到输出层通过“模2递减”学习速率的BP学习；蚁群算法根据信息素的分配能够自动调整收索路径，从而达到数据自动聚类的目的。结果表明，与蚁群算法相比，改进RBFN具有快速收敛、自动识别奇异样本的优点，而蚁群算法无须教师学习，并能够达到全局最优。     

基于模糊聚类方法的T-S模糊系统建模

提出了用一个聚类验证准则设计模糊C均值聚类算法，这个聚类验证准则是用来确定模糊C均值算法中合适的聚类数．针对T—S模糊模型，由模糊c均值聚类算法确定其逻辑前件参数，进而采用最小二乘算法确定模糊推理规则的后件参数．最后，应用本文建模方法对一个非线性实例进行仿真计算，并与其它方法进行了比较，结果表明本文方法是有效的．     

基于Chameleon算法和谱平分法的聚类新方法

在分析传统的聚类算法优越性和存在不足的基础上,基于Chameleon算法和谱平分法的思想提出了一种新的聚类方法。相比传统聚类算法而言此算法克服了如k—means算法、EM算法等传统聚类算法在聚类不为凸的样本空间时容易陷入局部最优的缺点,能在任意形状的样本空间上聚类,且收敛于全局最优解,并且可以降低噪声和离群点的影响,提高了算法的有效性。在UCI数据集和5个特殊的二维数据点组成的数据集上进行了实验,证明了本方法的有效性。     

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…     

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.     

海南岛地体及其毗邻陆缘晚中生代—新生代古地磁研究和构造演化

本文叙述了对海南岛及其毗邻大陆边缘白垩纪到第四纪地层岩石进行古地磁研究的全部工作过程。通过分析岩石中剩余磁矢量的磁偏角及磁倾角的变化,提出海南岛白垩纪以来经历的构造演化模式如下:早期伴随顺时针旋转而向南迁移,后期伴随逆时针转动并向北运移。联系该地区及邻区的地质、地球物理资料,对海南岛上述的构造地体运动提出以下认识:北部湾内早期有一拉张作用,主要是该作用使湾内地壳显著伸长减薄,形成北部湾盆地。从而导致了海南岛的早期构造运动,而海南岛后期的构造运动则主要是受南海海底扩张的影响。海南地体运动规律的阐明对于了解北部湾油气盆地的形成演化有重要的理论和实际意义。     

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).     

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.