三种植物的核型研究

报道了三种植物的染色体数目及核型。紫花地丁染色体数目为２ｎ＝２４,型公式Ｋ（３ｎ）＝２４＝２４ｍ,核型“１Ａ”型,酸模叶蓼染色体数目为２ｎ＝２２,核型公式Ｋ（２ｎ）＝２２＝１２ｍ＋１０ｓｍ,核型“２Ａ”型;射干。染色体数目为２ｎ＝３２,核型公式Ｋ（２ｎ）＝３２＝１６ｍ＋２ｍ（ｓａｔ）＋６ｓｍ＋４ｓｍ（ｓａｔ）＋４ｓｔ,核型“２Ａ”型。     

川北细辛和祁阳细辛的核型研究

报道了２种细辛属植物－川北细辛和祁阳细辛的染色体资料。川北细辛体细胞染色体数目２ｎ＝２２,核型公式为Ｋ（２ｎ）＝２ｘ＝４Ｍ＋１４ｍ＋４ｓｍ。祁阳细辛体细胞染色体数目２ｎ＝２４,核型公式为Ｋ（２ｎ）＝２ｘ＝２Ｍ＋２０ｍ＋２ｓｍ。     

山绿豆的染色体核型分析

对山绿豆的染色体数目及核型进行了初步研究,结果２ｎ＝２２。核型分析表明,１１对染色体中,２对为正中着丝粒染色体,８对为中部着丝粒染色体,１对为近中部着丝粒染色体,其核型公式为Ｋ２ｎ＝２ｘ＝２２＝４Ｍ＋１６ｍ＋２ｓｍ,核型类型为２Ｂ型,与栽培绿豆核型Ｋ２ｎ＝２ｘ＝２２＝１８ｍ（２ＳＡＴ）＋４ｓｍ型类型（２Ｂ）相比,二者在染色体数目及核型类型上是一致的,但染色体类型及每种类型的数量是不同的。     

山绿豆(Phaseolus minimus Roxb.)的染色体核型分析

对山绿豆（ＰｈａｓｅｏｌｕｓｍｉｎｉｍｕｓＲｏｘｂ．）的染色体数目及核型进行了初步研究,结果２ｎ＝２２．核型分析表明,１１对染色体中,２对为正中着丝粒染色体,８对为中部着丝粒染色体,１对为近中部着丝粒染色体,其核型公式为Ｋ２ｎ＝２ｘ＝２２＝４Ｍ＋１６ｍ＋２ｓｍ,核型类型为２Ｂ型,与栽培绿豆（Ｐ．ａｕｒｅｕｓＲｏｘｂ．）核型Ｋ２ｎ＝２ｘ＝２２＝１８ｍ（２ＳＡＴ）＋４ｓｍ核型类型（２Ｂ）相比,二者在染色体数目及核型类型上是一致的,但染色体类型及每种类型的数量是不同的．     

疏毛蘑芋染色体核型研究

本文首次报道了疏毛蘑芋Ａｍｏｒｐｈｏｐｈｌｌｕｓ ｓｉｎｅｎｓｉｓ Ｂｅｌｖａｌ的细胞染色体数目和核型,并与其近缘种蘑芋Ａ．ｒｉｖｉｅｒｉ Ｄｕｒｉｅｕ和白蘑芋Ａ．ａｌｂｕｓ Ｐ．Ｙ．Ｌｉｕ ｅｔ Ｊ．Ｆ． Ｃｈｅｎ的核型进行了比较。结果表明,该种的体细胞染色体数为２６,核型公式为２ｎ＝２６＝２２ｍ（２ＳＡＴ）＋４ｓｍ,属２Ａ型,其染色体相对长度组成为２ｎ＝２６＝１２Ｍ２＋１２Ｍ１＋２Ｓ。     

车前属两个种的核型报道

报道了车前属两种车前的核型。Ｐｌａｎｔｏｇｏ ｌｅｓｓｉｎｇｉｉ Ｆｉｓｃｈ．ｅｔ Ｍｅｙ为２ｎ＝１２，核型属于“２Ａ”，核型公式为Ｋ（２ｎ）＝１２＝１０ｍ＋２ｓｍ；Ｐ．ｍｉｎｕｔａ Ｐａｌｌ为２ｎ＝１２，核型仍属“２Ａ”型，核型公式Ｋ（２ｎ）＝１２＝８ｍ＋２ｓｍ＋２ｓｔ。染色体相对长度组成２ｎ＝２Ｌ＋４Ｍ２＋４Ｍ１＋２Ｓ１，２ｎ＝６Ｍ２＋６Ｍ１，染色体总长分别为３０．６０，２９．８０，由１２对染     

疏花绞股蓝的核型研究

首次提出我国特产植物疏花绞股蓝的体细胞染色体数目为２ｎ＝２２；核型公式为Ｋ（２ｎ）＝２２＝１２ｍ＋８ｓｍ＋２ｓｔ，核型属“２Ｂ”类型；染色体相对长度组成为２ｎ＝２Ｌ＋１０Ｍ２＋６Ｍ１＋４ｓ。     

扁豆的核型报道

报道了扁豆的核型,２ｎ＝１６,扁豆核型属于“２Ａ”型,Ｋ（２ｎ）＝１６＝１２ｍ＋４ｓｍ。染色体相对长度组成是：２ｎ＝２Ｌ＋２Ｍ２＋８Ｍ１＋４Ｓ１,染色体总长为１５．４２±０．４１μｍ。     

6种药用植物的染色体研究

对山东４科６种药用植物进行了染色体数目和核型研究，结果表明，毛曼陀曼Ｋ（２ｎ）＝２４＝２４ｍ，“１Ａ”核型；紫花曼陀罗，Ｋ（２ｎ）＝２４＝１４ｍ＋１０ｓｍ“２Ｂ”牛龙牛儿苗，Ｋ（２ｎ）＝１４＝１２ｍ＋２ｓｍ“１Ａ”核型，鸡眼草，Ｋ（２ｎ）＝２２＝１４ｍ＋８ｓｍ，“２Ａ”核型，委陵菜，Ｋ（２ｎ）＝１４＝１４ｍ，“１Ａ”核型；地榆，Ｋ（２ｎ）＝５４＝５４ｍ，“１Ｂ”核型，其中４种为首次报道。     

东北龙胆的染色体核型分析

报道了东北龙胆的核型公式为Ｋ（２ｎ）＝２ｘ＝２６＝２Ｍ＋２４ｍ，核型为“１Ａ”型，核型不对称系数为５４．２１％，染色体相对长度组成为２ｎ＝２６＝８Ｍ２＋１４Ｍ１＋４Ｓ，染色体总长度为４４．５０μｍ。     

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.