关于自共轭四元数矩阵

设Ｑ为实四元数体，讨论了Ｑ上自共轭四元数矩阵的特征值问题，并且在自共轭四元数矩阵之间引进了一种偏序关系，给出了两个半正定自共轭四元数矩阵可比的充要条件。     

四元数体上矩阵相似的一个判定方法

运用四阶矩阵表示四元数，建立了四元数体上矩阵与一类实矩阵的同构性，由此得到体上矩阵相似的一个判定条件．     

四元数体上斜自共轭矩阵的几个定理

四元数是爱尔兰数学家哈密顿在1843年发现的.实四元数矩阵研究的主要难点是四元数乘法的不可交换性.四元数在众多的应用问题中存在广泛的联系,如四元数在量子力学,刚体力学方面的应用,在计算机图形图像处理和识别方面的应用,在空间定位方面的应用等.四元数体上矩阵的研究是四元数代数理论中的一个重要方面,本文研究实四元数体上斜自共轭矩阵的性质, 给出实四元数体上斜自共轭矩阵的定义.借助四元数体上的Schur三角分解定理和体上矩阵的运算,得到了斜自共轭矩阵的一些性质及判定准则,获得了斜自共轭矩阵的实表示、相似分解以及特征值的几个定理.     

四元数体上矩阵的酉性与矩阵分解

给出了四元数酉阵右特征向量集的一个数值特征，剖析了四元数部分酉阵的本质结构． 利用四元数部分酉阵建立了四元数长方阵的等核极分解的存在惟一性定理， 进而得到了四元数正规阵的一个新的等价描述， 并给出了四元数方阵有惟一极分解的特征刻画． 最后， 就文中建立的四元数长方阵的等核极分解， 给出了实现它的一个具体方法．     

四元数体上矩阵的右特征值

讨论实四元数体上方阵的右特征值，并将域上矩阵的一些相应结果推广到实四元数体上。     

四元数实表示的代数应用

在四元数和四元数向量、矩阵空间上引入并交替使用三种不同的实数表示方式，将四元数体上的李雅普诺夫矩阵方程和二次型转换为实数域上的等价方程组和等价二次型，并在此基础上把四元数自共轭矩阵特征值、四元数向量和矩阵的常用范数、四元数矩阵的数值半径等运算问题一律转换为实数域上的等价运算问题．     

四元数可中心化矩阵秩的下界的注记

本文改进了四元数体上可中心化矩阵秩的下界，将近期四元数自共轭矩阵的有关结果推广到四元数中心封闭矩阵上。参４。     

四元数矩阵的复表示与四元数矩阵之迹

引入四元数矩阵的复表示，讨论了它的性质，并且证明了Bellman不等式在四元数体上的修正结果，事实上四元数矩阵之迹的有关结果都是这一表示及复矩阵相应结果的简单推论。     

四元数矩阵广义逆的计算方法

由于四元数的乘法不满足交换律,阻碍了对四元数矩阵的研究。将复数域上矩阵的广义逆的计算方法推广到四元数体上,得到了在四元数体上计算矩阵广义逆的两种计算方法,分别是利用行左初等变换计算四元数矩阵的{1}-逆和{1,2}-逆,利用四元数矩阵的满秩分解求广义逆矩阵,并且给出了计算的实例。     

四元数矩阵到复矩阵的相似变换

给出四元数体上λ多项式的线性因式分解定理和四元数体上方阵的特征矩阵主法式的存在唯一性定理。用之导出四元数方阵所相似的Jordan形主矩阵的唯一性,四元数矩阵相似于对角形矩阵的一个充要条件及四元数方阵的最小实系数零化多项式的形式。     

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.