基于发现驱动方法的数据立方体在校园用电安全中的应用研究

随着电控智能管理手段在高校学生公寓管理中的广泛应用,同时结合校园一卡通进行计费扣费功能,高校已经积累了大量学生用电行为数据.本文对学生用电行为数据进行数据立方体化,并采用发现驱动方法对数据进行处理,对用户用电的行为进行分析,从而评估校园用电中的异常,及早发现用电中的安全问题.     

并行H-mine算法在智慧校园学生行为分析中的应用

基于智慧校园中的学生数据,在Spark平台建立了并行H-mine算法,以此用于数据频繁项集的挖掘以及学生数据中学生行为的分析.研究结果显示,相比于MRH-mine算法,数据量无论是10568条还是5284000条,随着数据量的增加,在运行时间上并行H-mine算法总是低于MRH-mine算法,优化效果更为显著,性能较为优良.同时当最小支持度为0.1时,利用此次算法中的频繁项集对学生行为加以分析,由此并行H-mine算法应用在动态的校园学生数据处理上具有有效性与可行性.     

基于聚类和随机矩阵理论的用电行为刻画方法

针对配网大数据应用背景下难以建立用户用电行为刻画模型的问题,提出一种基于聚类和随机矩阵理论的电力用户用电行为刻画方法.首先利用K-means聚类法对海量用户用电特征数据进行分析,根据不同用电模式对用户进行群体划分.然后基于随机矩阵理论建立用户用电行为分析模型,利用各用户群体的经济数据、气候数据及电力价格数据等辨识与用户群体用电量相关联的因素,实现对电力用户用电行为的刻画.最后通过甘肃省武威市电网实际用电数据验证所提方法的有效性和准确性,为电力精准营销和制定电力需求侧响应策略提供数据支撑.     

基于大数据的电力用户群体识别与分析方法研究

随着能源互联网及智能用电技术的发展,深入了解电力用户群体特征,并提供精准电力服务,成为"互联网+"智慧能源的重要研究内容.通过对售电体积累的用户社会属性、用电行为等大数据进行分析,构建用户间相似度权重模型,提出基于"用户-标签"二元网络的相似群体识别方法,并通过群体分析获取群属性和典型负荷特征,预测新入网用户的用电行为.该方法通过对标签数据的分析,便于发现群体中的重要用户,为互联网售电体实施个性化用电服务和增值服务推荐提供支撑,进而提升电力服务质量.     

校园网格中信息服务的研究与实现

为消除校园网中的信息孤岛, 提出构建一个基于数据网格技术的校园网格框架, 进行信息整合, 实现资源共享. 重点对校园网格中的信息服务进行研究设计, 对其涉及的服务注册、 服务查看和服务发现关键技术作了详细的说明.     

校园网格中信息服务的研究与实现

为消除校园网中的信息孤岛,提出构建一个基于数据网格技术的校园网格框架,进行信息整合,实现资源共享.重点对校园网格中的信息服务进行研究设计,对其涉及的服务注册、服务查看和服务发现关键技术作了详细的说明.     

学生校园伤害行为的成因分析

近年来,由于学生校园伤害行为增多,学生在校园内的安全受到越来越广泛的关注.本文就此问题进行了讨论,由于该问题涉及面广,笔者主要就发生在高中生之间的校园伤害行为的成因进行了阐述,希望藉此引起对学生校园伤害问题的关注,依靠社会、学校、家庭、个人的共同努力,保障学生的校园安全.     

基于逻辑回归的增量式异常用电行为检测方法

用户异常用电行为的检测是电力公司需要重点解决的问题。目前异常用电检测通常采用数据分析的方法,主要包括聚类和分类两种,在处理固定数据集时校测准确率和效率均较高。但是此类方法在处理增量数据时,每次数据增量更新时均需要将增量数据与原始数据合并后重新建模才能获得新的检测模型,而用户的用电数据是频繁更新的且最新的数据更能体现出用户的用电习惯,因此在异常用电行为检测时必须考虑增量数据,而现有检测方法在进行增量式异常用电行为检测时效率很低。为解决数据增量式更新的情况下异常用电行为检测方法性能低下的问题,提出了一种基于逻辑回归的增量式异常用电行为检测方法,仅需对增量数据进行建模即可得到面向全局数据集的检测模型,无需对全局数据进行重新建模,提高检测算法的执行效率。当用户电量数据产生增量时,仅需对增量数据构建检测模型,再与原始数据的检测模型相结合,即可得到基于全部数据的检测模型。实验结果表明,该方法在保证检测结果准确性的同时,极大地提高了算法执行效率,且对计算和存储资源的需求较低。     

基于EMD的异常用电检测方法

异常用电行为的时频特性往往具有强随机不确定性,而固定参数相关的分析方法无法有效处理此类数据.为此,本文提出了一种基于经验模式分解(EMD)的异常用电检测方法.首先,针对用电数据的不同特点进行初步筛选,进而采用EMD方法对用户用电量和线损电量序列进行自适应分解,提取EMD分解所得高频分量,通过对其变化趋势和相关性进行分析...     

基于时序偏移双残差网络的窃电行为检测

针对窃电量小、窃电发生时间随机的窃电行为,提出一种基于时序偏移双残差网络(TS-Bi-ResNet)的窃电行为检测模型.将基础残差网络模型改进为双残差网络(bi-residual network,Bi-ResNet)模型,考虑到窃电行为发生时间的随机性,利用时序偏移(timing shift,TS)算法对用电数据预处理,使模型能够学习用电数据的时间因素特征,构成TS-Bi-ResNet模型.根据真实用电数据和窃电特征生成含有伪窃电数据的混合用电数据集,利用TS-Bi-ResNet模型学习其浅层特征和深层特征,进而执行窃电行为检测.仿真和实际运行结果表明,TS-Bi-ResNet模型可以有效检测窃电量小且窃电发生时间随机的窃电行为,其检测精度优于LSTM模型与残差网络(ResNet)模型.     

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.