生物农药固态发酵条件的研究

探讨了以麸皮为主要原料进行固态发酵生产生物农药的方法,研究了不同培养基成分及培养条件对苏云金杆菌毒力效价的影响．试验结果表明,最适发酵培养基为：麸皮1000g,玉米粉20g．豆粕150g,KH2PO4 2g;最佳发酵条件为：原料含水量为60％,发酵温度30℃、pH为7．5,培养时间48h．结果分析表明,苏云金杆菌的毒力效价达5400IU／mg。     

发酵啤酒糟生产饲料蛋白的研究

利用热带假丝酵母（Ｃａｎｄｉａｔｒｏｐｉｃａｌｉｓ）、绿色木霉（Ｔｒｉｃｈｏｄｒｍａｌｉｇｎｏｒｕｍ），白地霉（ＧｒｉｅｏｔｒｉｃｈｕｍｃａｎｄｉｄｕｍＬｉｎｋ）、黑曲霉（ＡｓｐｅｒｇｉｌｌｕｓＮｉｇｅｒ）、米曲霉（Ａｓｐｅｇｉｌｌｕｓｏｒｙｚａｌ）等五株菌混合发酵啤酒糟生产饲料蛋白，提高饲料的利用价值，并改善了啤酒糟的适口性。通过五种菌株的协同作用使啤酒糟中的非氮物质转化为蛋白质，没被利用的多糖物质和如纤维素，半纤维素及部分淀粉转化为被消化吸收的低聚糖、双糖和单糖。在同一条件下，同一时间内各种菌株相互间协调，各自完成发酵的功能。培养基为啤酒糟８５％、玉米面１０％、麦麸５％。培养温度２８－３０℃，培养周期４８ｈ。分析结果表明：粗蛋白含量高达３２．８６％以上，氨基酸齐备，粗纤维降低到９．９％，具有较高的蛋白酶，果     

酸性蛋白酶饲料固态发酵条件的研究

探讨了以啤酒糟为主要原料进行固态发酵生产酸性蛋白酶饲料的方法,研究了不同发酵基质配比及发酵条件对酸性蛋白酶活力的影响.试验结果表明,最适的发酵基质配比为m(啤酒糟)∶m(豆粕)∶m(玉米淀粉)∶m(KH2PO4)=100∶9∶2∶0.2;最适发酵条件为:原料含水量为58%,发酵温度31℃,初始pH为5.5,发酵时间84 h.在上述条件下,酸性蛋白酶活力达7 800 U/g.     

利用啤酒糟液体深层培养风尾菇产木聚糖酶的初步研究

研究了风尾菇（Pleurotus ostreatus）利用啤酒糟作为原料进行液态发酵产木聚糖酶的可行性.通过正交试验得出最佳的培养基配方.同时对不同发酵时间还原糖的减少和木聚糖酶活性的进行测定.培养基最佳配方：啤酒糟6 g,黄豆粉0.32 g,玉米粉2 g,糖10 g,pH值5.0.发酵的最佳时间为72 h,此时木聚糖酶的活性最大,为9.2 U/mL.     

苏云金杆菌NU-1之6种培养基发酵的对比

目的提高苏云金杆菌NU-1制剂的毒力。方法通过苏云金杆菌NU-1在6种培养基中发酵,研究其菌体生长、pH值变化、芽孢形成、伴孢晶体率、发酵周期等。并对其晶体蛋白进行了提纯和测定。结果5号培养基产量最高,30℃发酵40h时菌数可达80.4×108个/mL,伴孢晶体率大于90%,晶体蛋白浓度达6.312mg/mL。结论用5号培养基作的制剂毒力最强。     

苏云金杆菌中国品系Bt ken—Ag 10t罐发酵研究

苏云金杆菌Btken-Ag在10t发酵罐中,以豆饼粉和玉米淀粉为底物发酵30h,发酵液毒力效价平均达2096IU／μL。粉剂产品回收率为84．5％,其性能指标分别达到：毒力效价为17000IU／mg,活孢子数在3×1010个／g以上,细度为95％通过300目标准筛,悬浮率在85％以上,含水量在5％以内,润湿性在15s以下。     

苏云金芽孢杆菌MS7培养条件的优化

通过单因子试验对苏云金芽孢杆菌MS7菌株的培养条件进行优化．研究表明,该菌株的最佳培养基组成和发酵条件为：蔗糖10．0g／L、牛肉膏10．0g／L、K2HPO42．0g／L,初始发酵pH7．0,装液量25mL,培养温度35℃,培养时间36h,优化后细菌总数可达1．2×10^8CFU／mL．     

利用味精废水生产苏云金芽孢杆菌生物农药Ⅱ：苏云金芽孢杆菌的菌种筛选及发酵优化

利用味精废水生产苏云金芽孢杆菌生物农药。首先将废水作为筛选培养基,对18株苏云金芽孢杆菌进行初筛和复筛后,确定菌株WB5为适合该废水生长的菌株。在此基础上,通过正交实验,确定了添加到废水中的营养物组分（％）：玉米淀粉3,蛋白胨1,豆粕3。发酵条件优化结果表明：培养基初始pH为8．0,发酵温度30℃、200rpm摇床培养50h。     

酶化苏云金芽孢杆菌固态发酵培养基研究

在生物农药生产过程中，粉碎能耗占据了生产成本的10％以上。采用纤维素酶对苏云金芽孢杆菌固体发酵的培养基进行前处理，得到一种易粉碎的培养基，用该培养基发酵所得产品后处理能耗明显降低，且和原培养基发酵产品的效价相当，证明纤维素酶的加入没有影响菌种的生长。     

苏云金芽孢杆菌发酵技术研究进展

苏云金芽孢杆菌（Bacillus thuringiensis简称Bt）是目前产销量最大的生物农药，其发酵过程是工业生产的关键步骤，本文对培养基成份，pH值、氧气、温度、发酵时间等发酵条件进行了综述，参考文献28篇。     

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.