L~ρC-正则半群

利用被推广的半群上的ρ-G reen关系,研究LρC-正则半群,得到LρC-正则半群的等价刻画,证明了半群为LρC正-则半群当且仅当它为L-左可消幺半群的强半格。     

L~ρC-正则半群

利用被推广的半群上的ρ-G reen关系,研究LρC-正则半群,得到LρC-正则半群的等价刻画,证明了半群为LρC正-则半群当且仅当它为L-左可消幺半群的强半格。     

关于完备格上T-型L-关系方程

利用完备格L上的无限∨-分配t-模T,研究了T-型L-关系方程AoTXoTB=C的解,给出了该方程可解的充要条件,并且在可解时给出了该方程最大解的一个计算公式.     

伪t-模与蕴涵算子:L-关系方程

文章研究Sup-T型L-关系方程和Inf-αr型L-关系方程解的结构，其中L是完备Brouwer格，T是L上无穷并分配伪t-模，αr是L上由T诱导的无穷交分配蕴涵。     

BCK（BCI）—代数中的L—fuzzy 理想

研究BCK（BCI）－代数中的L-fuzzy理想,其中L为至少含有两个元素的格,研究了BCK（BCI）－代数中的L－fuzzy理想及其相应的截理想之间的关系,对BCI－代数,引入了L－fuzzy闭理想,L-fuzzy正则理想,在任一p-半单PCI－代数中,L-fuzzy闭理想一定是L－fuzzy正则理想,对BCK－代数,引入了L－fuzzy关联理想的概念,得到了它的一些等价特性,并用L－fuzzy关联理想刻划了关联BCI－代数。     

L-半格的正则性

将格作用在半格上得到L-半格的概念,研究了具有最大元的格作用在半格上得到L-半格的正则性。同时,得到了正则性、投射性、忠实性之间的关系。     

半群上的L－Fuzzy同余关系

先引入半群Ｓ上的Ｌ－Ｆｕｚｚｙ同余关系的概念，进而讨论Ｌ－Ｆｕｚｚｙ同余关系的几个基本性质，然后证明半群Ｓ上的所有Ｌ－Ｆｕｚｚｙ同余关系作成一个格，同时证明群Ｇ上所有Ｌ－Ｆｕｚｚｙ同余关系作成一个模格．     

正则半群上的L-Fuzzy同余关系与格林关系

探讨了正则半群上的Ｌ－Ｆｕｚｙ同余关系与格林关系的联系．主要证明对于正则半群Ｓ上的任意Ｌ－Ｆｕｚｙ同余关系，若商半群Ｓ／ρ中的两个元［ａ］ρ与［ｂ］ρ具有Ｌ（或Ｒ，Ｄ）—等价关系，那么在Ｓ中必定存在两个元ｐ与ｑ，使得［ｐ］ρ＝［ａ］ρ，［ｑ］ρ＝［ｂ］ρ，且ｐ与ｑ在Ｓ中也具有相应的等价关系     

Ω同态,T同余L关系和Ω-TL子群

利用完备Brouwer格L上的无穷V 分配t 模T,引入并讨论Ω群上T同余L关系概念,然后在其基础上研究Ω群上T同余L关系的同态性质,最后讨论Ω群上T同余L关系与正规Ω TL子群的一些关系.     

一类正则矩阵的广义逆

设(L,∧,∨)(简记为L)是全序格。本文利用矩阵的可行性分块定理讨论了L上一类正则矩阵的广义逆问题。     

关于2个Green L-关系交的研究

给出幂等元半环S满足2个Green L-关系的交的充要条件;对2个Green L-关系的交是S上的同余作了进一步刻划。     

L-关系方程T（a，x）=b与方程I（a，x）=b有解的充要条件

进一步讨论方程T(a，x)=b与方程I(a，x)=b的解的结构，得到了它们的解集，且得到了它们有解的充分必要条件，并利用方程T(a，x)=b与方程I(a，x)=b的解集研究方程丁((a1，a2)，(x1，x2))=(b1，b2)以及方程I((a1，a2)，(x1，x2))=(b1，b2)的解结构与与解集．还指出文献[1]中一个基本定理的错误．其中L为完备Brouwer格，T为无穷V一分配伪t=模，I是无穷∧一分配蕴涵算子．     

伪T模的直积与L-关系方程解集

利用方程T(a,x)=b与方程I(a,x)=b的解集研究方程T((a1,a2),(x1,x2))=(b1,b2)以及方程I((a1,a2),(x1,x2))=(b1,b2)的解结构.     

L-关系方程T(a,x)=b,I(a,x)=b的解集

讨论方程T（a,x)=b,I(a,x)=b的解集，其中L为完备Brouwer格，T为无穷∨-分配伪t-模，I是无穷∧-分配蕴涵算子，且I=I（T）。     

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.     

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…