含有非理想运放的开关电容网络的分析

本文提出了一种对含非理想运放的开关电容网络进行精确分析的方法,此法是以运放单极点模型为基础,建立 Z 域的非理想运放的两图模型,从而有效地对运放的有限直流增益及有限增益带宽的影响进行系统分析.本文方法适合对任意开关电容网络进行分析,且由于考虑了运放之间的反馈影响,能够得到比一般分析较精确的结果。文中所提出的方法已由软件(SCNAP—1)实现,其分析结果与有关文献结论一致.     

非理想开关电容网络的组元电荷状态变量分析法

针对运放的有限增益带宽乘积给SCN带来的非理想效应,引入了非理想运放的SC电路宏模型,定义了非理想运放负端组元割集,根据非理想SCN的连接特点,通过判断各SC积木块中电容支路两端节点的连接情况,在时域和频域分别推导出了非理想SCN的组元电荷状态方程,应用实例进行了仿真,两种方法的结果对比说明了本文算法的可行性.     

非理想开关电容网络的有效分析方法

针对寄生电容非灵敏SCN，定义了运放输入端组元割集，给出了用观察法形成组元电荷状态方程的运放输入端组元电荷状态变量法；提出了非理想运放的SC电路宏模型，将运放输入端组元电荷状态变量法扩展到非理想SCN，很好地解决了非理想SCN的分析问题。     

Delta Sigma调制器非理想因素建模

提出并构建了开关电容积分器Delta Sigma调制器非理想因素行为级模型,该模型基于Matlab中的Simulink工具,包含开关非线性、时钟抖动、量化器非线件和积分器非线性等调制器非理想囚素,能为电路模块的设计提供精确的设计指标.重点研究并实现一种运放非线性直流增益模型,仿真结果表明它能更有效反映奇次谐波失真.同时综合考虑调制器其他非理想因素,例如采样噪声、开关非线性电阻以及运放参数(色化噪声.增益带宽,摆率,饱和电压),仿真得到其对调制器性能的影响.     

全差分高增益运放的设计

在3．3V电源电压下采用中芯国际（SMIC）0．18μm混合信号CMOS工艺设计了一个单级全差分运算放大器．所设计的运放采用了增益提升技术,其主运放为一个带有开关电容共模反馈的全差分折叠-共源共栅运放,两个简单的连续时间共模反馈电路的运放作为辅运放用来提升主运放的开环增益．仿真结果表明,所设计的运放直流增益可达110dB,单位增益带宽为5MHz．     

应用于高性能流水线ADC运算放大器设计

随着电子技术迅猛发展,对模数转换器(ADC)在通信、图像处理等领域中的信号处理速度、精度的要求不断提升。流水线ADC作为高精度,高运行速度的模数处理模块,是影响流水线速度和精度的最关键因素。本文分析了3种传统的运放(套筒式、折叠式以及密勒补偿式运放)的基本性能,并对这3种运放做了设计和仿真结果比较;分析对单端运放和全差分运放的性能区别,在设计和仿真结果上进行对比分析;设计应用于流水线ADC的运放,即能满足性能(8 m A,90db,900 M,60o)要求的增益自举运放。     

集成运放非线性宏模型在SPICE程序的实现

采用较理想的非线性函数曲线拟合技术，对运放输入级大信号饱和非线性特性进行逼近，可较精确地实现通用电路分析程序ＳＰＩＣＥ对含运放非线性宏模型电路的模拟，编制了相应的拟合程序。分析结果说明本文方法令人满意。     

开关电容滤波器运放有限增益效应补偿

本文提出了运放增益为有限值时的SC电导和SC阻抗模型,用它们分析了运放有限增益对双二阶开关电容滤波器(SCF)性能的影响。提出了降低负反馈以补偿这些影响的原理及实现方法。该方法简明直观,不需要增加运放,可达到完全补偿,且适用于其它开关电容网络(SCN)的有限增益补偿。     

含有非理想运放SC滤波网络的计算机辅助分析

基于一种新的分析方法,本文导出了一种快速算法,实现了含非理想运算放大器的有源 SC 滤波网络的计算机辅助分析,给出了实例及结果.     

集成运放构成的4种负反馈放大电路性能分析

用方框图分析法分析了由集成运算放大器构成的4种负反馈放大器的性能，包括输入、输出电阻和增益。导出了可用工程计算和设计的一组近似公式。讨论了集成运放和电路元件参数对负反馈放大器的影响，并与理想运放分析得出的结果进行了比较。     

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.