The classical algorithm of finding association rules generated by a frequent itemset has to generate all non-empty subsets of the frequent itemset as candidate set of consequents. Xiongfei Li aimed at this and propose...The classical algorithm of finding association rules generated by a frequent itemset has to generate all non-empty subsets of the frequent itemset as candidate set of consequents. Xiongfei Li aimed at this and proposed an improved algorithm. The algorithm finds all consequents layer by layer, so it is breadth-first. In this paper, we propose a new algorithm Generate Rules by using Set-Enumeration Tree (GRSET) which uses the structure of Set-Enumeration Tree and depth-first method to find all consequents of the association rules one by one and get all association rules correspond to the consequents. Experiments show GRSET algorithm to be practicable and efficient.展开更多
针对城市信息模型(city information modeling,CIM)平台中Docker容器依赖顺序难以确定以及现有启动机制无法确保所有容器顺利运行的问题,提出了一种Docker容器编排优化方法,创新的应用于CIM平台。该方法通过引入基于深度优先搜索的拓扑...针对城市信息模型(city information modeling,CIM)平台中Docker容器依赖顺序难以确定以及现有启动机制无法确保所有容器顺利运行的问题,提出了一种Docker容器编排优化方法,创新的应用于CIM平台。该方法通过引入基于深度优先搜索的拓扑排序,并定制启发式比较器,实现了对容器的精确排序。同时,结合Docker Compose和端口扫描技术进行容器编排,解决了因容器未初始化导致的启动失败问题。在沣西新城CIM平台的应用表明,引入此方案后容器顺序合理,系统成功运行率超过93%,比传统方法提高了约20%。该方法增强了CIM平台容器编排的健壮性,为复杂系统的容器管理提供了参考依据。展开更多
With the increasing complexity of distribution network structures originating from the high penetration of renewable energy and responsive loads,fast and accurate fault location technology for distribution networks is...With the increasing complexity of distribution network structures originating from the high penetration of renewable energy and responsive loads,fast and accurate fault location technology for distribution networks is a prerequisite for rapid isolation of faults and restoration of the power supply.In this paper,a fault location method based on community graph depth-first traversal is proposed for fast location of single-phase ground faults in distribution networks.First,this paper defines the fault graph weight of the vertices in the distribution network graph model,which can be used to reflect the topology of the vertices and fault points as well as the fluctuation of the vertices’currents.Then,the vertices on the graph model are clustered by using an improved parallel louvain method(IPLM).Finally,the community formed by IPLM is used as the smallest unit for depth-first traversal to achieve fast and accurate location of the fault section.The paper develops a distribution network graph model of IEEE 33-bus system on the graph database for testing.And three other methods are selected for comparison with IPLMDF.The test results show that IPLMDF can achieve fast and accurate fault location when half of the nodes in the distribution network are equipped with D-PMUs.When some of the D-PMUs lose time synchronization,it is still possible to locate the fault section,and at the same time,the locating results can be avoided by falling into local optimal solutions.展开更多
基金Supported by the National Natural Science Foundation of China (No.60474022) the Natural Science Foundation of Henan Province(No. G2002026,200510475028)
文摘The classical algorithm of finding association rules generated by a frequent itemset has to generate all non-empty subsets of the frequent itemset as candidate set of consequents. Xiongfei Li aimed at this and proposed an improved algorithm. The algorithm finds all consequents layer by layer, so it is breadth-first. In this paper, we propose a new algorithm Generate Rules by using Set-Enumeration Tree (GRSET) which uses the structure of Set-Enumeration Tree and depth-first method to find all consequents of the association rules one by one and get all association rules correspond to the consequents. Experiments show GRSET algorithm to be practicable and efficient.
文摘针对城市信息模型(city information modeling,CIM)平台中Docker容器依赖顺序难以确定以及现有启动机制无法确保所有容器顺利运行的问题,提出了一种Docker容器编排优化方法,创新的应用于CIM平台。该方法通过引入基于深度优先搜索的拓扑排序,并定制启发式比较器,实现了对容器的精确排序。同时,结合Docker Compose和端口扫描技术进行容器编排,解决了因容器未初始化导致的启动失败问题。在沣西新城CIM平台的应用表明,引入此方案后容器顺序合理,系统成功运行率超过93%,比传统方法提高了约20%。该方法增强了CIM平台容器编排的健壮性,为复杂系统的容器管理提供了参考依据。
基金supported by the National Natural Science Foundation of China (Grant Nos.52009106,51779206)the National Key R&D Program of China (No.2018YFB1500800)the Natural Science Fund Youth Project of Shaanxi Province (2019J-130).
文摘With the increasing complexity of distribution network structures originating from the high penetration of renewable energy and responsive loads,fast and accurate fault location technology for distribution networks is a prerequisite for rapid isolation of faults and restoration of the power supply.In this paper,a fault location method based on community graph depth-first traversal is proposed for fast location of single-phase ground faults in distribution networks.First,this paper defines the fault graph weight of the vertices in the distribution network graph model,which can be used to reflect the topology of the vertices and fault points as well as the fluctuation of the vertices’currents.Then,the vertices on the graph model are clustered by using an improved parallel louvain method(IPLM).Finally,the community formed by IPLM is used as the smallest unit for depth-first traversal to achieve fast and accurate location of the fault section.The paper develops a distribution network graph model of IEEE 33-bus system on the graph database for testing.And three other methods are selected for comparison with IPLMDF.The test results show that IPLMDF can achieve fast and accurate fault location when half of the nodes in the distribution network are equipped with D-PMUs.When some of the D-PMUs lose time synchronization,it is still possible to locate the fault section,and at the same time,the locating results can be avoided by falling into local optimal solutions.
