基于改进粒子群算法的微电网优化运行

为提高含分布式发电的微电网运行水平,应用基于混沌-模拟退火思想的粒子群算法对微电网的运行进行优化。针对微电网中各分布式电源特性,建立微电网的数学模型,建立了以运行成本和环境效益等运行指标最优为微电网优化运行的目标函数,并应用基于混沌算法结合模拟退火思想的改进粒子群优化算法对微电网多目标优化运行问题进行求解,得到微电网的最优运行方式。采用改进粒子群优化算法对某微电网进行24 h优化运行算例分析,结果表明该方法具有更好的寻优能力和更快的收敛速度。     

分档电价和碳配额激励的含电动汽车微电网优化调度策略

在含电动汽车（Electric Vehicle,EV）微电网的调峰调度中,实施分时电价或实时电价引导EV参与调峰,会导致EV过度响应或响应疲惫现象。为此,本文提出了分档电价协同碳配额激励机制下的含电动汽车微电网博弈优化调度策略。建立了微电网与电动汽车的主从博弈优化调度模型,微电网主体以运行成本最小和极小化负荷均方差为优化目标,考虑新能源发电完全消纳,针对等效净负荷水平制定分档电价并和碳配额协同激励,引导电动汽车在新能源发电余缺时充放电的适度响应;电动汽车用户从体响应微电网激励优化电动汽车充放电行为使其成本最小。采用粒子群算法(particle swarm optimization, PSO)求解优化模型纳什均衡点,获得微电网侧最优分档电价和电动汽车调度策略的集合。通过仿真算例验证了所提方法的有效性。     

分时电价下考虑需求响应的微电网经济调度方法

为了实现微电网发电侧和用户侧双赢,提出一种考虑需求响应的孤岛微电网多目标经济调度模型。该模型在分时电价机制下引入需求响应,构建含用电效用和用电成本的负荷侧效益目标函数,同时,建立微电网发电侧成本最小目标函数。基于上述目标函数,通过调整使得微型燃气轮机的增量成本一致,实现微电网发电总成本最小。同时,根据分时电价调节可调负载的最优接入量,使得用户侧总收益在每个时段达到最大。为了验证模型的有效性,建立孤岛微电网仿真平台对需求响应的效果进行测试。仿真结果表明:所提出的经济调度模型能够在实现发电侧成本最小化的同时,实现负荷侧效益的最大化;在分时电价机制下引入需求响应后,用户侧效益提高了104%。     

考虑负荷聚合商的源荷双侧合作协同运行策略

为应对可再生能源出力间歇性对电能供需实时平衡带来的挑战,利用供给侧与需求侧相互配合的运营模式,进而提出考虑负荷聚合商参与的源荷合作博弈优化模型。首先,构建考虑负荷聚合商的源荷合作运行基本框架,以解决源侧可再生能源出力波动性带来的电能供需供应难题。其次,计及源侧发电成本、弃风成本,荷侧需求响应成本,构建源荷双侧支付函数模型;并以源荷合作运行总成本最低为目标函数,以保证各参与主体的运行经济性。再次,基于Shapley值分配法,提出合作运行联盟内源荷双侧的成本分配策略,从而保证合作运行联盟的稳定性。最后利用算例仿真验证所提源荷合作运行策略的可行性与有效性。结果表明：所提策略可减小负荷峰谷差、减少火电机组出力、提高可再生能源消纳量、降低源荷双侧运行成本,对系统的经济环境效益具有积极作用。     

基于削峰填谷的微电网并网运行的优化调度

基于微电网中的光伏和风力等可再生能源发电占主导地位,而其具有很强的随机性和波动性,不遵循人工调度,而传统电网的调度模型不能直接应用到微电网等问题,借鉴大电网的调度经验,针对微电网本身特点,建立最小发电成本和最少污染物排放的2个目标函数。针对大电网存在较大的峰谷负荷差等问题,通过控制蓄电池充放电时段和功率、大电网交互功率和时段,以实现大电网的削峰填谷的目的。针对微电网优化调度是一个多目标、非线性、多约束条件的模型,提出杂交粒子群算法对模型进行求解,针对粒子群算法中可能存在的局部收敛和收敛速度慢等问题,随机搜索取值代替失去进化的粒子和选择杂交过程。仿真结果验证了微电网优化调度模型的正确性和有效性,以及杂交粒子群算法的收敛性。     

孤岛运行模式下微电网有功负荷优化分配

研究了微电网在孤岛运行模式下的有功负荷优化分配问题.针对柴油发电机、微型燃气轮机、等效光伏电源(包含蓄电池)和风力发电机组成的微电网在孤岛模式下的负荷优化分配问题进行了研究,建立了优化数学模型,采用粒子群优化算法和混沌算法相结合的混沌粒子群优化算法,实现了有功负荷的优化分配.在优化过程中不但计及了电源功率充足情况下的负荷优化分配,而且考虑了电源功率不足情况下的负荷优化分配.给出的计算精度,使得优化结果更切合实际.仿真计算结果表明了该方法的正确性和有效性.     

含蓄电池的孤立微电网系统运行优化研究

针对微电网系统在孤立运行方式下的优化问题,提出了一种含蓄电池的微电网多目标运行优化方法.求解方法分为2步:储能单元运行方式的确定及可控型微电源的优化调度.微电网储能单元的运行方式根据当前调度时刻的负荷需求、可再生能源发电期望、储能单元的荷电状态等因素,采用功率差控制策略对储能单元进行管理.可控型微电源的出力分配,在考虑系统功率平衡、微电源出力限值和爬坡约束等条件下,以经济成本和环境成本为目标,利用改进的遗传算法进行求解.该方法不仅发挥了蓄电池削峰填谷的作用,提高了储能单元的经济价值,而且实现了孤立微电网的经济、环保优化运行.以典型微电网系统的日优化调度为算例,验证了所提方法的可行性和有效性.     

计及需求响应的主动配电系统优化调度研究

针对主动配电系统中负荷的动态变化性,将需求侧响应融入到该系统的优化调度中.考虑到分布式能源的碳排放特性,以配电网运行成本及二氧化碳排放成本最低为目标函数,引入可中断负荷等相关约束,建立了日前低碳经济调度模型.采用基于差分演化的果蝇优化算法求解模型.算例结果表明优化结果能够兼顾运行成本及排放成本,在调度中引入需求响应可以引导负荷转移,削峰填谷,具有显著的节能减排效益.     

考虑重构和分布式电源无功特性的主动配电网多目标日前调度

主动配电网的优化调度方案是配电网经济运行的核心,本文提出一种考虑配电网拓扑重构和分布式电源无功特性的主动配电网日前调度方案,建立配电网经济运行成本最小和系统网络损耗最小的多目标优化模型.该方案在资源优化配置时,考虑拓扑结构的改变对资源调度结果的影响,并且充分利用分布式电源的无功特性,尤其是常被忽视的风机和光伏的无功支持能力.通过该优化调度方案可确定配电网一天内各时段分布式电源的最优有功和无功出力、可中断负荷的参与量以及对应的各时段最优拓扑结构.该优化模型为非线性优化问题,采用万有引力搜索算法进行求解,最后通过修改的PG&E－69节点系统进行仿真验证.     

基于预测控制的冷、热、电联产型微电网能量管理

由于可再生能源出力特性和微电网运行约束等限制,如何进一步提高微电网中可再生能源消纳量已成为研究热点。本文在冷、热、电联产型微电网中引入用于提高可再生能源消纳量并承担部分热、冷负荷的电锅炉、吸收式制冷机和压缩式电制冷机装置,提出了基于预测控制的微电网能量管理方法。综合考虑网内各单元的工作特性,建立满足实际运行约束的冷、热、电联产型微电网能量管理模型。在孤网运行模式下,兼顾储能装置容量期望以及各单元运行特性,构建微电网能量管理优化目标。利用预测控制滚动优化策略以及可再生能源输出和冷、热、电负荷需求的预测结果,建立带有逻辑变量的有限时域优化问题,实现基于预测控制的微电网最优能量管理。仿真结果表明:引入电锅炉、吸收式制冷机和压缩式电制冷机装置可以达到提高微电网中可再生能源的消纳量、减少燃料消耗、降低运行成本的目的,预测控制中的滚动优化策略能够有效消除可再生能源输出的不确定性和冷、热、电负荷需求波动性带来的影响。     

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.