分块矩阵广义逆的几种表达式

受分块矩阵的逆矩阵形式的启发，给出了分块矩阵A=（A11 A12 A21 A22）的广义逆A^（1，3），A^（2），A^＋，Ad和Ag可以表示为X=（S1^α-A11^αA12S2^α -A11^αA21S1^α S2^α）的条件；然后运用这些结果，得到分块矩阵A的M—P逆的几个表达式；最后给出一个求分块矩阵M—P逆的例子．     

对集不交的循环赛图K11^（i）与对集的算法

给出了边矩阵和循环赛图的定义。提出了求解完全图K（2n＋1）的△（G）＋1个对集最的算法，以及对集互交的循环赛图K11^（1），K11^（2），…，K11^（i）的构造方法。讨论任意对集Ei及循环图K（2n＋1）^＊的个数问题。介绍了14个对集不交的循环赛图K11^（1），K11^（2），…，K11^（14）的构造过程。     

关于半正定矩阵等和完全对称函数的一些不等式

对于n阶半正定矩阵A,B的初等和完全对称函数,得到如下的不等式,Er[(AB)^m]≤Er(A^mB^m),hr[(AB)^m]≤(A^mB^m),Er[A^aB^1-a]≤[Er(A]^a[Er(B)]^1-A,HR[A^aB^1-a]≤[hr(A)]^a[hr(B)]^1-a.其中,m是任意正整数,0≤a≤1,Er(A),hr(A)分别为半下定矩阵A的r阶初等和完全对称函数。当A,B都是正定矩阵时,有E^2r(A#B)≤Er(A)Er(B),h^2r(A#B)≤hr(A)hr(B),其中,A＃B＝A^1/2BA^-1/2)^1/2A^1/2称为A与B的几何平均矩阵。     

ZnWO4：Cr^3＋的基态精细光谱的研究

本文假定ZnWO4:Cr^3 具有变形的八面体结构，属于D2^*群。采用D^h点群表象简化准时角型强场方案，导出了d^3-D2^*强场能量矩阵。与实验资料拟合，算出了^4F态的精细光谱，得到了13条谱线，理论结果与实验吻合。     

一类矩阵族的特征值问题

对一类矩阵族A＋λB μC的特征值问题作了一般性讨论，用构造扩大方程组的方法求λ＝λ^*,μ=μ^*，使得A＋λ^*B μ^*C的秩为n-2。     

一类二阶整数矩阵方程的解

为解决与毕达哥拉斯方程x2+y2=z2相关的整数矩阵方程问题, 利用矩阵的基本运算把整数矩阵方程问题转化成不定方程求解的问题, 从特殊情形逐步推广到一般情形, 研究了与毕达哥拉斯方程相关的一类二阶整数矩阵方程${\mathit{\boldsymbol{X}}^2} + {\mathit{\boldsymbol{Y}}^2} = \lambda \mathit{\boldsymbol{I}} $ ($\lambda \in \mathbb{Z}, \boldsymbol{I} $为单位矩阵), 并得到其全部解( X , Y ), 类似可得二阶整数矩阵方程${\mathit{\boldsymbol{X}}^2} - {\mathit{\boldsymbol{Y}}^2} = \lambda \mathit{\boldsymbol{I}} $的全部解.     

D波介子中K（^1D2）和K（^3D2）的混合

在π2（1 670）,η2（1 870）和η2（1 645）属于1^1D2介子九重态的前提下,利用质量矩阵、非相对论组分夸克模型以及其他的唯象方法,自洽地给出同位旋二重态K（^1D2）的质量,取其平均值约为1762．75±8．40MeV．在此基础上,进而估算出D波介子中K（^1D2）与K（^3D2）间的混合角约为零度．     

H矩阵的判定条件

本文考察并得到了H矩阵的新的判定条件,所得结果推广了文^[2]和[3] 中的主要结果。     

一类非谐振子的相干态描述

利用相干态和正规乘积对一类微扰项为^↑H^1=λ^↑X^1的非谐振子进行了讨论，得到了^↑H^1矩阵元的精确解和^↑H^1对非谐振了能级的一级修正值，为处理非谐振子的微扰问题提供了一种新的方法。     

线性回归模型估计的一种简便方法

应用矩阵QR分解，通过引入H矩阵，给出了线性回归模型Y^=Xβ^ U估计的新方法，此法比文[1]中的方法和普通最小二乘法OLS都简捷。     

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.     

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.     

大肠杆菌pheA与tyrB基因的克隆与串联表达

为探讨用基因工程的手段改良苯丙氨酸的发酵菌株，采用聚合酶链反应（ＰＣＲ）的方法，从大肠杆菌总ＤＮＡ中克隆得到了编码苯丙氨酸合成途中的两个关键酶基因－即分枝酸变位酶（ＣＭ）／预苯酸脱水酶（ＰＤ）基因ｐｈｅＡ与苯丙氨酸转氨酶（ＰＡＴ）基因ｔｙｒＢ，在大肠杆菌中进行了这两个基因的单个和串联表达。ｐｈｅＡ和ｔｙｒＢ基因分别都能在λ噬菌体的ＰＲ启动子之后得到较大量的表达，在ＳＤＳ－ＰＡＧＥ上出现清晰的条带，     

Man Is Unable to Change the Miserable Life——Analysis of the Arrangement of Four Characters in The Glass Menagerie

Tennessee Williams is considered as one of the most important American playwrights since World War II.The Glass Menagerie is his first successful drama,which describes a tragic situation of family and means to say that Man is unable to change the miserable life,no matter whatever means he try,This essay focuses on the analysis of the arrangement of the four main characters:Laura.Amanda,Jim and Tom to reveal the theme.Laura is fragile.Amanda is brave.Jim is vital.Tom is sensible.And all of them develop and try the different means to struggle against life,but fail tragically.With the evidence,the paper comes to conclusion naturally that Man is unable to change the miserable life,and he dooms to fail.     

狗脑抗吗啡镇痛肽“60a”的分离纯化及部分一级结构

本实验室从正常狗脑中又分离获得一个暂称这为“６０ａ”的肽。冻干粉经ＳｅｐｈａｄｅｒＧ－５０和羧甲基纤维素ＣＭ２２柱层析，再经反相高效液相层析纯化得最后样品，经ＳＤＳ电泳和等电聚焦电泳鉴定均为一条带，分子量约８０００，等电点在ｐＨ７．８左右；Ｎ－末端氨基酸为Ｍｅｔ；自Ｎ－末端的部分氨基酸序列为：Ｈ２Ｎ－Ｎｅｔ－Ｌｅｕ－Ｓｅｒ－Ｐｒｏ－Ａｌｓ－Ａｓｐ－Ｌｅｕ－Ｔｈｒ－Ａｓｐ－Ｉｌｅ－Ｌｅｕ－Ｐｈｅ－Ｔ     

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.     

四川溲疏属的分类研究 （Ⅱ）：种的简介及新分类群

介绍了四川溲疏属植物20种,5变种及1栽培变型,每种均有文献考证、学名订正、特征集要及产地和生境,新分类群D.leiboeneie P.He et L.C.Hu, D.piloea var.longiloba P.He et L.C.Hu,D.jinyangensis P.He eL L.C.Hu及D.longifolia var.deneitomentosa P.He et L.C.Hu均有详细拉丁文描述并附模式标本照片,还记录了两个四川省新分布种:D.bodiaieri Rehd.,D.rehderiana C.K.Schn.,对伞花亚组Subsect Cymosae Rehd.中建立的新系(Ser.Multiradiatae P.He,Ser.Pauciradiatae P.He)作了拉丁文补充描述。     

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     

Lie map for the nonlinear transport of continuous intense beams in the axial-symmetric electrostatic fields

Nonlinear transport of intense continuous beam in the axial-symmetric electrostatic fields is analyzed with the Lie algebraic method. The K-V particle distribution is adopted in the analysis. The results obtained can be used in the calculations of the intense continuous beam dynamics in the beam optical systems consisting of drift spaces, electrostatic lenses, and DC electrostatic accelerating tubes. A computer code has been designed for practical simulations. To meet the needs of accurate calculation, all the elements are divided into many small segments, the electric fields in each segment are regarded as uniform fields, and the dividing points are treated as thin lenses. Iteration procedures are adopted in the code to obtain self-consistent solutions. The code can be used to design low energy dc beam transport systems, electrostatic accelerators, and ion implantation machines.     

Scale-based spatial data model for GIS

Being the primary media of geographical information and the elementary objects manipulated, almost all of maps adopt the layer-based model to represent geographic information in the existent GIS. However, it is difficult to extend the map represented in layer-based model. Furthermore, in Web-Based GIS, It is slow to transmit the spatial data for map viewing. In this paper, for solving the questions above, we have proposed a new method for representing the spatial data. That is scale-based model. In this model we represent maps in three levels: scale-view, block, and spatial object, and organize the maps in a set of map layers, named Scale-View, which associates some given scales.Lastly, a prototype Web-Based GIS using the proposed spatial data representation is described briefly.