葛根总黄酮的两种不同提取方法比较

对超声波和回流法两种不同提取葛根中总黄酮方法进行了探讨,测定了葛根中总黄酮的质量百分含量.试验结果表明,超声波提取方法较回流法提取率高,乙醇做溶剂提取效果好.超声波提取总黄酮的最佳操作条件是95%乙醇,时间25 min,温度5 ℃,3次.     

葛根总黄酮的两种不同提取方法比较

对超声波和回流法两种不同提取葛根中总黄酮方法进行了探讨 ,测定了葛根中总黄酮的质量百分含量 .试验结果表明 ,超声波提取方法较回流法提取率高 ,乙醇做溶剂提取效果好 .超声波提取总黄酮的最佳操作条件是 95 %乙醇 ,时间 2 5min ,温度 5℃ ,3次 .     

枸杞黄酮提取方法的比较研究

以宁夏枸杞总黄酮提取率为指标，利用正交设计优化实验条件，比较研究了微波提取与常用提取方法（回流提取法、超声波提取法）所得枸杞总黄酮的提取率，优选了枸杞总黄酮的提取方法．与回流法相比，超声波和微波提取法都能明显缩短提取时间，有效提高枸杞黄酮的提取率，特别是微波提取能显著提高枸杞黄酮的提取效率．微波提取的最佳实验条件为温度100℃，固液比1：30，火力3，提取时间20min．结果表明，用微波提取法提取宁夏枸杞总黄酮具有高效、省时的特点，值得在中药提取中推广应用．     

延安地区马齿苋中总黄酮的提取与含量测定

采用超声波细胞破碎法和索氏提取法提取马齿苋中的总黄酮,用比色法测定总黄酮含量,通过正交试验确定超声波细胞破碎法的最佳提取条件。结果表明,超声波细胞破碎法提取的影响因素顺序为:料液比>乙醇浓度>提取时间;用超声波细胞破碎法提取马齿苋中总黄酮的最佳条件为:料液比为1 g∶20 mL、乙醇体积分数为90%、提取时间40 min。测得马齿苋中总黄酮含量为5.63%。     

超声法提取萹蓄总黄酮的正交试验研究

采用正交试验法优化篇蓄总黄酮的超声波提取工艺,系统考察了乙醇体积分数、料液比、超声温度、超声时间对总黄酮提取量的影响.篇蓄总黄酮的最佳提取工艺如下:料液比为1∶25,超声温度为45℃,超声萃取时间为25 min,乙醇体积分数为90％.此条件下总黄酮得率为12.012 mg/g.     

超声波辅助提取枇杷叶中黄酮类化合物的工艺研究

研究了超声波辅助乙醇浸提法从枇杷叶中提取总黄酮的工艺.通过单因素试验确定了影响总黄酮的主要因素及较优水平.用正交设计试验优化提取工艺条件.结果表明,最佳工艺为:超声波功率为135w,乙醇体积分数40%,提取温度80℃,提取时间30min,料液比1:20.最佳条件下总黄酮得率7.23%.     

Box-Behnken法优化葛根总黄酮的微波提取条件

采用响应面法中Box-Behnken优化微波提取葛根总黄酮的最佳条件.根据试验设计,研究了微波功率、提取时间、液固比等条件对总黄酮得率的影响.建立了总黄酮得率与因素变量的二次回归模型方程,模型极其显著.优化最佳提取条件为:以80%的乙醇为提取溶剂,微波功率417 W,提取时间10 min,液固比40∶1 mL·g-1,...     

黄芪茎中有效成分提取方法的研究

研究膜荚黄芪茎中有效成分的最佳提取方法．采用索氏回流提取与超声波提取进行提取，紫外-可见分光光度法测定总黄酮，总皂苷和多糖的含量．研究结果表明，总黄酮和多糖以超声波提取率最高，总皂甙以回流提取率最高．     

超声波辅助提取狭叶薰衣草总黄酮的研究

以伊犁产狭叶薰衣草干花为原料,利用超声波辅助提取总黄酮．通过单因素试验和正交试验法L9（34）,确定了提取薰衣草干花总黄酮的最佳工艺条件：体积分数60％乙醇溶液,料液比1：25,超声温度70℃,超声时间35min,超声功率400W．在该提取条件下,薰衣草干花总黄酮提取率最高,其值为12．24％．     

双水相法和微波法提取假酸浆中总黄酮及纯化

采用超声波辅助双水相萃取法和超声波微波法等两种方法提取假酸浆中的总黄酮,并进行分离纯化.通过单因素与正交试验确定了两种方法各自提取假酸浆中总黄酮的最佳条件.结果表明,当醇水比为0.4,硫酸铵质量浓度为0.25 g/mL,超声时间为30 min,料液比为0.047时提取率为3.79%.以50%的乙醇为提取溶剂,微波辐射功率中火、微波辐射时间60 s、固液比1∶25、超声提取温度55℃、超声提取时间20 min,总黄酮的提取率为1.01%.分析了不同树脂对黄酮的吸附和解吸附特性,对比出HPD500树脂对总黄酮的纯化具有较好的效果.     

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.