一种保留二次项的快速潮流计算方法

提出了一种保留潮流方程泰勒展开式二次项的快速潮流计算方法,采用因子表解法和重叠原理求解修正方程,作为节点功率同型异变量的二次项可直接由修正方程式的常数项决定。     

基于保留二阶项潮流模型的支路开断模拟方法

提出了一种将补偿法与保留泰勒展开式二次项的快速潮流模型相结合的支路开断模拟算法,用以进行预想事故分析．采用因子表解法和重叠原理求解修正方程,对ＰＶ节点的处理比较简单,且便于引入补偿法进行支路开断模拟计算,提高预想事故分析的计算速度与精度．对ＩＥＥＥ１４和ＩＥＥＥ３０节点系统的开断模拟计算验证了该方法的快速有效性     

电力系统潮流二次齐次方程中Ji矩阵的特征性质

推导了电力系统潮流二次齐次方程表达式中Ｊｉ矩阵的特征值和特征向量。发现特征值和特征向量可以不受网络规模的限制，能用一具有固定结构的公式和向量表示，并能用特征值表示节点有功、无功注入的范围；节点注入功率的线性组合仍然是一个实系数的二次齐次方程。获得了基于Ｊｉ矩阵特征值和特征向量的计算节点有功、无功注入的新的表示方式和新的计算途径，完善了潮流方程理论。     

负荷以恒定阻抗模型表示的电力系统潮流计算方法

在传统的电力系统潮流计算数学模型中,都是假定负荷节点的有功功率P、无功功率Q保持不变,这与电力系统实际运行情况并不完全相符．据此,提出了负荷以恒定阻抗模型表示的电力系统潮流计算方法,给出了相应的节点功率误差方程,推导了雅可比矩阵中相应的元素．用Fortran语言编制了负荷以恒定阻抗模型表示的电力系统潮流计算程序,用5节点系统进行了对比计算．研究结果表明,电炉、电镀和电解等纯电阻性或近似电阻性负荷以恒定阻抗模型表示,潮流计算结果更加符合电力系统实际运行情况．     

电力系统潮流计算的计算机算法

主要针对大电网,多节点,复杂电力系统的潮流计算,采用迭代法,通过建立矩阵的修正方程来依次迭代,逐步逼近真值来计算出电力网的电压,功率分布。     

基于节点不平衡功率的病态潮流算法

提出了基于节点不平衡功率的病态潮流算法，将潮流方程转换为非线性规划的形式，与普通的潮流计算相比较，计算量增加不大；对于由潮流计算初值不合理、潮流方程无可行解等因素引起的潮流病态现象有很好的收敛性．经过IEEE-30节点系统在几种情况下的计算比较，证明该算法是非常有效的．     

基于ward等值的分布式潮流计算

为了解决数据资源广域分布一体化潮流仿真分析问题，提出了一种基于ward等值的分布式潮流算法．该算法采用主从分区原理，将互联系统中的各子区域划分为主区域和从区域，并确定联络节点在不同区域的节点类型，使用ward等值原理，求出各分区边界节点的等值注入功率和阻抗的基础上，由主区域到各相邻从区域，依次采用牛顿法进行区域潮流计算，由此修正边界节点的电压和等值注入功率．如此反复迭代。直到一体化潮流收敛．该算法充分利用了ward等值对相邻区域的功率、电压和结构信息的全面反映，使一体化潮流计算具有更好的收敛性与收敛精度．通过IEEE30节点和实际系统181节点的仿真计算，验证了该方法在收敛性和收敛精度方面具有明显优势．     

基于保留二阶项潮流模型的支路开断模拟方法

提出了一种将补偿法与保留泰勒展开式二次项的快速潮流模型相结合的支路开断模拟算法,用以进行预想事故分析。采用因子表解法和重叠原理求解修正方程,对ＰＶ节点的处理比较简单,且便于引入补偿法进行支路开断模拟计算,提高预想事故分析的计算程度与精度。对ＩＥＥＥ１４和ＩＥＥＥ３０节点系统的开断模拟计算验证了该方法的快速有效性。     

计及发电机励磁调节器静态特性的电力系统潮流计算方法

提出了在电力系统潮流计算数学模型中计及发电机励磁调节器静态特性的方法,给出了相应的节点功率误差方程,推导了雅可比矩阵中相应的元素,用FORTRAN语言编制了计及发电机励磁调节器静态特性的电力系统潮流计算程序,用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.     

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.     

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).     

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.