基于忆阻器的鉴相电路设计与分析

分析忆阻器的基本理论,推导忆阻器阻值与电量、时间的函数关系,使用Simulink建立忆阻器模型,并验证该模型在正弦信号激励下,电流和电压具有滞回特性.设计基于忆阻器的鉴相电路,将相位差测量转化成对脉冲宽度的测量,对方法进行理论分析,并通过仿真实验验证了电路的功能.通过仿真、计算,得到忆阻器在边界非线性效应的影响下,非线性误差为9.82%.     

有源荷控忆阻器在非线性电路中的应用

根据理论分析,搭建了一种新的二端口有源忆阻器.该有源荷控忆阻器不使用光敏电阻和数字电位器,理论上比较精确,并且容易在实验中实现.仿真和实验证明了这种有源忆阻器和真正的无源忆阻器具有相同的电路特性.此外还将该有源忆阻器加入到蔡氏混沌电路中,在非线性电路中成功实现混沌现象,证明了它可以等效于一个二端口元件接入其它电路工作,为忆阻器的应用打下了基础.     

基于Simulink的忆阻器模型

为了使忆阻器具有与其他器件相结合的能力,本文在惠普实验室提出的忆阻器物理模型电路关系的基础上,在Simulink中用二种方法对忆阻器进行了双端口建模,方便准确的实现了对于忆阻器的仿真。与编写M文件、构建图形用户界面和搭建输入输出模型的建模方法相比,基于Simulink的双端口模型不仅能够方便准确的观察忆阻器的输入输出特性,而且具有更广阔的应用范围,对于忆阻器的研究有一定的指导作用。     

基于改进忆阻器的混沌电路研究

忆阻器是一种具有记忆和连续输出特点的非线性电阻器,针对窗函数忆阻器模型的不足,提出了一种改进的窗函数,它通过添加一个参数来关联忆阻器的线性与非线性特性。为了对该窗函数进行验证,运用了数值分析与模拟电路分析的方法,仿真得出了忆阻器的伏安特性曲线,结果表明,使用改进窗函数的忆阻器模型更加接近实际物理状态。同时,为了进一步研究该模型的电路特性,将该模型应用于蔡氏混沌电路,通过MATLAB仿真得出其相图,并分析它的李雅普诺夫指数谱,数据表明该电路能产生混沌现象,因此,该忆阻器模型是一个能被应用的非线性模型。     

基于忆阻器的多路复用器设计与实现

结合忆阻器蕴含逻辑和非蕴含逻辑的运算特点,设计2-1和4-1多路复用器电路并提出其实现方法.利用蕴含逻辑和非蕴含逻辑自带"或"和"与"运算的特性,对多路复用器的逻辑表达式进行等价变换,运用2种逻辑的迭代运算实现2-1和4-1多路复用器.同时,通过调整逻辑执行的顺序提高忆阻器单元的复用率和精简操作流程.HSPICE仿真实验验证了该方法是可行的,且在减少忆阻器开销的同时能降低时延.     

基于磁控忆阻器的混沌振荡器研究

本文提出了磁控忆阻器的一种等效电路,该电路和理论上的忆阻器具有相同的电路特性.此外,本文还使用该磁控忆阻器和一个负电导代替蔡氏混沌振荡器中的蔡氏二极管,并产生双涡卷混沌吸引子.仿真和实验验证了该方法的可行性.     

一种忆阻扫描触发器设计

基于惠普公司的忆阻器模型,提出一种可支持断电模式的选择扫描触发器电路.数据可以从主从触发器中被传输存储到忆阻器中,在触发器被断电期间,忆阻器一直保持该数据.当扫描触发器处于唤醒时刻,忆阻器所保持的数据可以被控制回传到主从触发器中.采用惠普公司提供的忆阻器模拟电路仿真模型进行仿真验证,仿真数据及波形表明,该电路可以满足集成电路的低功耗扫描测试需求.     

忆阻时滞神经网络的全局指数镇定性

为研究时滞忆阻神经网络的全局指数镇定性,并克服忆阻突触连接权矩阵突然跳变所带来的困难,借助非光滑分析和微分包含理论给出了系统Filippov解的定义.根据Lyapunov稳定性理论,通过设计时滞依赖的反馈控制律,实现了所考虑忆阻网络模型的指数镇定.所设计的反馈控制律,使用于多数已存在的忆阻网络模型的镇定性控制.所设计的镇定性算法简单,容易实现,结论描述了忆阻器件的基本电力学规律.     

参数扰动下时滞忆阻神经网络的Lagrange稳定性

根据忆阻器物理特性,建立了一类荷控忆阻神经网络模型,模型中忆阻器的记忆特性被保留.针对实际忆阻器阻值与理想模型存在差异造成忆阻神经网络中参数不确定的问题,研究参数扰动下时滞忆阻神经网络的Lagrange稳定性.将模型重构为双重扰动形式以处理忆阻器忆阻值变化造成的模型中的参数变化.通过构造Lyapunov函数和应用线性矩阵不等式方法,以线性矩阵不等式形式给出了网络Lagrange稳定的充分条件,并给出了相应的全局指数吸引集的估计.最后,通过与现有模型的仿真结果对比,展示了所建立模型的优势.利用数值算例展示了参数扰动造成忆阻神经网络周期解的偏移,说明了研究参数扰动对忆阻神经网络稳定性影响的必要性,并验证了理论所得稳定性判据的可行性.     

一种含有磁控忆阻器的四阶混沌电路的特征分析

该文提出了一种简单的磁控忆阻器模型,并利用它设计了一个混沌电路。通过数值模拟计算得到了一个三维带状混沌吸引子,且此时忆阻器的伏安特性曲线不是传统的"8"字形。通过计算系统的相图、分岔图和Lyapunov指数谱,发现调节电容参数或忆阻器初始状态可以实现电路系统在混沌态和各周期态之间的转变,发现调节磁通能使系统出现二周期到四周期再回到二周期的奇特分岔现象。该研究工作对利用忆阻器设计混沌电路并应用于密码通信具有积极的参考价值。     

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.