关于模糊逻辑函数计数的一些结果

模糊逻辑函数的计数至今仍是一个未解决问题，本文利用模糊逻辑函数析取范式的存在唯一性，引进基本片语集合，Ａｊ，Ｇ（ａ）及Ｇ（ａ１，…Ｇｋ），推导出Ｇ（ａ），Ｇ（ａ１，…，ａｋ）Ｇ（ａ）∩Ａｊ以及Ｇ（ａ１，…，ａｋ）∩Ａｊ的计数公式，并给出了ｎ元模糊逻辑函数的一个计数公式。     

几族循环图的支撑树数

设Ｃｎ〈ａ１，ａ２，…，ａｋ〉是个循环图，ｔ（Ｇ）是图Ｇ的支撑树数。本文利用第二类Ｃｈｅｂｙｓｈｅｖ多项式给出了ｔ（Ｃｎ〈１，３〉，ｔ（Ｃｎ〈２，３〉），ｔ（Ｃｎ〈１，２，３〉），ｔ（Ｃｎ〈１，５〉），ｔ（Ｃｎ〈３，５〉），ｔ（Ｃ２ｎ〈１，２，ｎ〉）的公式。一个具体的例子表明，利用Ｃｈｅｂｙｓｈｅｖ多项式的性质，即使ｎ很大，这些公式的值是不难得到的。     

应变超晶格(InxGa1-xAs)n/(GaAs)n(001)的电子结构和光学性质

用半经验的紧束缚方法ｓｐ３ｓ＊计算了薄层应变超晶格（ＩｎｘＧａ１－ｘＡｓ）ｎ／（ＧａＡｓ）ｎ（００１）的电子结构．给出了组份Ｘ为０．５３的超晶格（ＩｎｘＧａ１－ｘＡｓ）ｎ／（ＧａＡｓ）ｎ的带隙值随层厚ｎ的变化关系,以及超晶格（ＩｎｘＧａ１－ｘＡｓ）１２／（ＧａＡｓ）１２的带隙值随组份Ｘ的变化关系．在得到超晶格能量本征值和本征函数的基础上,计算了该超晶格系统的光学介电函数虚部,并与体材料ＧａＡｓ和体合金ＩｎｘＧａ１－ｘＡｓ的光学性质作了比较．计算结果表明,应变超晶格在较宽的能量范围有较好的光谱响应．     

n个图的逻辑积的色数和边色数

证明了图的逻辑积的色数公式ｘ（Ｇ１∧Ｇ２∧…∧Ｇｎ）≤ｍｉｎ｛ｘ（Ｇ１），ｘ（Ｇ２），…，ｘ（Ｇｎ）｝，边色数有并作如下猜想：ｘ（Ｇ１∧Ｇ２∧…∧Ｇｎ）＝ｍｉｎ｛ｘ（Ｇ１），ｘ（Ｇ２），…，ｘ（Ｇｎ）｝．     

关于一个组合型Bernstein多项式的逼近阶

以Ｊａｃｏｂｉ多项式的零点作为插值的节点,构造了一个组合型的Ｂｅｒｎｓｔｅｉｎ多项式算子Ｃｎ（ｆ,ｘ）．若ｆ（ｘ）∈Ｃｊ［－１,１］,０≤ｊ≤５,则Ｃｎ（ｆ,ｘ）对ｆ（ｘ）的逼近程度均达到最佳。即｜Ｃｎ（ｆ,ｘ）－ｆ（ｘ）｜＝Ｏ１ｎｊ＋１＋１ｎｊωｆ（ｊ）,１ｎ,（０≤ｊ≤５）．     

应变超晶格（InxGa1—xAs）n／（GaAs）n（001）的电子结构和光？…

用半经验的紧束缚方法ｓｐ＾３ｓ＾＊计算了薄层应变超晶格（ＩｎｘＧａ１－ｘＡｓ）ｎ／（ＧａＡｓ）ｎ（００１）的电子结构。给出了组份Ｘ为０．５３的超晶格（ＩｎｘＧａ１－ｘＡｓ）ｎ／（ＧａＡｓ）ｎ的带隙值随层厚ｎ的变化关系,以及超晶格（ＩｎｘＧａ１－ｘＡｓ）１２／（ＧａＡｓ）１２的带隙值随组份Ｘ的变化关系。在得到超昌格能量本征值和本征函数的基础上,计算了该晶格系统的光学介电函数虚部,并与体材料ＧａＡｓ和     

一道数学竞赛题的推广

记Ｂ是由１，２，…，ｎ的循环排列组成的集合，Ａ＿３（ｎ）＝ｍａｘｍｉｎ（ａ＿（ｉ＋１）＋ａ＿（ｉ＋２）＋ａ＿（ｉ＋３）），其中ｉ＝０，１，２，…．ｎ－１，ａ＿（ｎ＋１）＝ａ＿１，ａ＿（ｎ＋２）＝ａ＿２；ａｉ取１．２，…，ｎ中的任意值，ｉ＝１，２，…，ｎ．本文讨论了Ａ＿３（ｎ）的上界：除ｎ＝３，５．６外，当３｜ｎ－１时，Ａ３（ｎ）≤　；当３｜ｎ时，Ａ３（ｎ）≤　；当３｜ｎ＋１时．Ａ＿３（ｎ）≤．     

关于一种修正的Jacobi多项式

以修正的Ｊａｃｏｂｉ多项式算子的零点作为插值的节点,构造了一个“１／１６”平均插值过程Ｃｎ（ｆ,ｘ）．若ｆ（ｘ）∈Ｃｊ［－１,１］,０≤ｊ≤３,则Ｃｎ（ｆ,ｘ）对ｆ（ｘ）的逼近程度达到最佳,结论为｜Ｃｎ（ｆ,ｘ）－ｆ（ｘ）｜＝Ｏ１ｎｊ＋１＋１ｎｊωｆ（ｊ）,１ｎ（０≤ｊ≤３）｜Ｃｎ（ｆ,ｘ）－ｆ（ｘ）｜＝Ｏωφλｆ,１ｎδｎ（ｘ）１－λ（０≤λ≤１）     

关于图G—v,G—e和W2n＋1的星色数

讨论了图Ｇ－ｖ与Ｇ－ｅ的星色数的一些基本性质，得到了一些不等式和等式，给出等式ｘ（Ｇ）＝Ｘ（Ｇ）成立的图Ｇ的一个特征，并进一步证明了Ｘ（Ｗ２ｎ＋１）＝Ｘ（Ｗ２ｎ＋ｊ１）＝４从而回答了Ａ．Ｖｉｎｃｅ提出的某些问题。     

邻域并和[A,B]—覆盖图

设ａ≤ｂ是整数，Ｇ＝（Ｖ（Ｇ），Ｅ（Ｇ）是一个图。Ｇ的一个支撑子图Ｆ称为Ｇ的一个［ａ，ｂ］－因子，若对任意的υ∈Ｖ（Ｇ）有ａ≤ｄＦ（υ）≤ｂ，图Ｇ称为是［ａ，ｂ］－覆盖图，若对Ｇ的每一条边，存在Ｇ的一个［ａ，ｂ］－因子包含它。本文给出了一个图的［ａ，ｂ］－覆盖图的关于领域并的充分条件，得到了下列结果：设１≤ａ〈ｂ是整数，Ｇ是一个阶为ｎ的图，最小度δ（Ｇ）≥α且ｎ≥２（ａ＋ｂ）（ａ＋ｂ－１）１／ｂ如     

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.