乙酰化羟丙基淀粉制备工艺的优化研究

以羟丙基淀粉为原料,对其进行乙酰化处理,制备乙酰化羟丙基复合改性淀粉.研究了乙酰化及羟丙基化反应程度控制、反应温度、反应时间、pH和淀粉乳体积分数对复合改性淀粉取代度的影响.采用中心组合实验设计确立了乙酰化羟丙基淀粉制备的数学模型,通过响应面法优化及预测乙酰化羟丙基淀粉的制备条件.结果表明,最佳工艺条件为羟丙基淀粉的取代度为0.15,淀粉乳体积分数40%,醋酸酐添加量6.65%,pH值为8.30,反应温度25℃,反应时间30 min.     

交联和羟丙基改性对玉米淀粉糊稳定性的影响

采用Brabender连续黏度测定仪,系统研究了三偏磷酸钠交联、环氧丙烷羟丙基化以及羟丙基、交联复合改性对玉米淀粉糊稳定性的影响.结果表明:玉米淀粉经交联改性后,起糊温度下降,糊的黏度稳定性得到改善,但冻融稳定性变化不明显;羟丙基改性降低了玉米淀粉的起糊温度,改善了淀粉的冻融稳定性,但黏度稳定性变化不大;采用羟丙基和交联复合改性能显著提高淀粉糊的黏度稳定性和冻融稳定性,其中,先交联后羟丙基改性对淀粉糊的稳定性改善更为明显.     

木薯淀粉制备羟丙基淀粉研究

以木薯淀粉为原料,乙醇/水为溶剂,考察了活化催化剂用量、反应温度、加料速度、环氧丙烷用量,反应时间等因素对合成羟丙基淀粉取代度的影响.在选定的实验条件下,产品的摩尔取代度(MS)为0.086.     

酯化交联淀粉反应及其性质的研究——淀粉颗粒糊化温度的变化

研究变性淀粉颗粒的糊化温度随反应pH值、时间和三氯氧磷用量的变化规律，以及其DSC的糊化特性，结果发现酯化交联淀粉的糊化完成温度比原淀粉高，随反应pH值、时间和三氯氧磷用量的增加而升高，当反应pH值为8.0和9.0时，变性淀粉的糊化开始温度比原淀粉低，随反间时间、三氯氧磷用量的增加而降低；当反应pH值为10.0和11.0时，变性淀粉的糊化开始温度的变化则随反应时间、三氯氧磷用量的增加而升高，其值从比原淀粉低上升到比原淀粉高，这些变化规律同酯化交联淀粉的反应历程密切相关。     

次氯酸钠氧化淀粉的制备工艺研究

以木薯淀粉为原料,用次氯酸钠作氧化剂制备粉状氧化淀粉,研究了pH值、氧化剂用量、反应温度、反应时间对产品羧基含量的影响.实验条件下,最佳工艺条件的pH值为9.0、氧化剂用量为25%、反应温度为45℃、反应时间为3小时.     

季胺型阳离子木薯淀粉制备研究

本文以3-氯-2-羟丙基三甲基氯化胺为醚化剂对木薯淀粉进行醚化制得季胺型阳离子淀粉。以互甲胺盐酸盐、环氧氯丙烷为原料，制备了醚化剂3-氯-2-羟丙基三甲基氯化胺，醚化剂制备适宜温度为20℃，二者物质的量之比1．00：1．05，反应时间3—4h．真空蒸馏3—4次提纯。采用湿法制备阳离子淀粉，反应浆液浓度30％-40%，反应温度40℃，反应体系pH值11—12，氢氧化钠与醚化剂物质的量之比2-8：1，淀粉与醚化剂物质的量之比1：0．15。取代度为0.07-0．12。67     

次氯酸钠氧化淀粉的制备工艺研究

以木薯淀粉为原料，用次氯酸钠作氧化剂制备粉状氧化淀粉，研究了pH值、氧化剂用量、反应温度、反应时间对产品羧基含量的影响．实验条件下，最佳工艺条件的pH值为9．0、氧化剂用量为25％、反应温度为45℃、反应时间为3小时．     

辛烯基琥珀酸淀粉酯浆料的制备研究

通过正交试验,探讨了反应温度、体系pH值、反应时间和淀粉乳浓度对取代度的影响,得出辛烯基琥珀酸淀粉酯制备的最佳工艺条件为:反应温度35℃、体系pH值8.5、反应时间3h、淀粉乳浓度40%.且辛烯基琥珀酸淀粉酯的红外光谱图显示在1 570.06cm-1和1 726.34cm-1处出现RCOO-和C=O的特征吸收峰,表明淀粉分子上引入了酯基和羧酸基.     

酶法制备微孔淀粉的工艺研究

使用α-淀粉酶与糖化酶复合制备多孔淀粉,探讨反应温度、反应时间、pH值和酶用量等条件的影响,并且通过正交实验得出最佳工艺条件,当反应温度为50℃,pH值为6.0,反应时间为12h,酶用量为1.0%时,吸附率与得率的综合评定最高.     

机械活化玉米淀粉制备磷酸酯淀粉及其结构表征

利用自制的搅拌球磨机将普通玉米淀粉进行机械活化预处理,正磷酸盐为酯化剂,尿素为催化剂,干法制备淀粉磷酸酯.探讨了活化时间、磷酸盐用量、pH值、反应温度、反应时间和尿素用量对取代度(DS)和反应效率(RE)的影响,确定了最佳反应条件:活化时间1.5 h,磷酸盐用量12%,pH5.0,反应温度150℃,反应时间2 h,尿素用量3%,并对机械活化淀粉结构进行表征.研究结果表明:机械活化破坏了淀粉的结晶结构,有效地提高淀粉的化学反应活性,使合成的磷酸酯淀粉的DS和RE显著提高.     

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.