检索结果-南通市图书馆

graph computing Based Security Constrained Unit Commitment in Hydro-thermal Power Systems Incorporating Pumped Hydro Storage

引用

CSEE Journal of Power and Energy Systems 2021年第3期7卷 485-496页

作者： Longfei Wei Guangyi Liu Shen Yan Renchang Dai Yachen Tang Hitachi ABB Power Grids San JoseCAUSA School of Electrical Engineering Xi'an University of TechnologyXi'anChina Department of Industrial and Enterprise Systems Engineering University of Illinois at Urbana-ChampaignChampaignILUSA Puget Sound Energy BellevueWAUSA Envision Digital Inc. Redwood CityCAUSA

This paper proposes a graph computing based mixed integer programming(MIP)framework for solving the security constrained unit commitment(SCUC)problem in hydro-thermal power systems incorporating pumped hydro storage(PHS).The proposed graph computing-based MIP framework considers the economic operations of thermal units,cascade hydropower stations and PHS stations,as well as their technical impacts towards the network ***,the hydro-thermal power system data and unit information are stored in a graph structure with nodes and edges,which enables nodal and hierarchical parallel computing for the unit commitment(UC)solution calculation and network security analysis.A MIP model is then formulated to solve the SCUC problem with the mathematical models of thermal units,cascade hydropower stations and PHS *** addition,two optimization approaches including convex hull reformulation(CHR)and special ordered set(SOS)methods are introduced for speeding up the MIP calculation *** ensure the system stability under the derived UC solution,a parallelized graph power flow(PGPF)algorithm is proposed for the hydro-thermal power system network security ***,case studies of the IEEE 118-bus system and a practical 2749-bus hydro-thermal power system are introduced to demonstrate the feasibility and validity of the proposed graph computing-based MIP framework.

关键词： graph computing hydro-thermal system mixed integer programming network security unit commitment

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

graph computing and Its Application in Power Grid Analysis

引用

CSEE Journal of Power and Energy Systems 2022年第6期8卷 1550-1557页

作者： Mike Zhou Jianfeng Yan Qianhong Wu China Electric Power Research Institute Beijing 100192China

Approaches to apply graph computing to power grid analysis are systematically explained using real-world application *** exploring the nature of the power grid and the characteristics of power grid analysis,the guidelines for selecting appropriate graph computing techniques for the application to power grid analysis are outlined.A custom graph model for representing the power grid for the analysis and simulation purpose and an in-memory computing(IMC)based graph-centric approach with a shared-everything architecture are *** algorithms,including network topology processing and subgraph processing,and graph computing application scenarios,including in-memory computing,contingency analysis,and Common Information Model(CIM)model merge,are presented.

关键词： CIM model merge contingency analysis graph computing in-memory computing network topology processing power grid analysis subgraph processing

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

graph computing Based Distributed Parallel Power Flow for AC/DC Systems with Improved Initial Estimate

引用

Journal of Modern Power Systems and Clean Energy 2021年第2期9卷 253-263页

作者： Wei Feng Chen Yuan Qingxin Shi Renchang Dai Guangyi Liu Zhiwei Wang Fangxing Li the University of Tennessee 1525 Coleman Road KnoxvilleTennessee 37909USA Global Energy Interconnection Research Institute North America San JoseCalifornia 95134USA

The sequential method is easy to integrate with existing large-scale alternating current(AC)power flow solvers and is therefore a common approach for solving the power flow of AC/direct current(DC)hybrid *** this paper,a highperformance graph computing based distributed parallel implementation of the sequential method with an improved initial estimate approach for hybrid AC/DC systems is *** proposed approach is capable of speeding up the entire computation process without compromising the accuracy of ***,the AC/DC network is intuitively represented by a graph and stored in a graph database(GDB)to expedite data *** the interconnection of AC grids via high-voltage direct current(HVDC)links,the network is subsequently partitioned into independent areas which are naturally fit for distributed power flow *** each area,the fast-decoupled power flow(FDPF)is employed with node-based parallel computing(NPC)and hierarchical parallel computing(HPC)to quickly identify system ***,to reduce the alternate iterations in the sequential method,a new decoupled approach is utilized to achieve a good initial estimate for the Newton-Raphson *** the improved initial estimate,the sequential method can converge in fewer ***,the proposed approach allows for significant reduction in computing time and is able to meet the requirement of the real-time analysis platform for power *** performance is verified on standard IEEE 300-bus system,extended large-scale systems,and a practical 11119-bus system in China.

关键词： AC/DC system distributed parallel computing graph computing initial estimate power flow analysis

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Fast Cycle Structure Detection for Power Grids Based on graph computing

引用

CSEE Journal of Power and Energy Systems 2023年第6期9卷 2204-2213页

作者： Xinqiao Wang Kewen Liu Weijiang Lu Ting Zhao Baohua Zhao Xiaoming Liu the computing&Application Technology Research Division Global Energy Interconnection Research InstituteBeijing 102209China

The cycle structure in a power grid may lower the stability of the network;thus,it is of great significance to accu-rately and timely detect cycles in power grid ***,detecting possible cycles in a large-scale network can be highly time consuming and computationally *** addition,since the power grid's topology changes over time,cycles can appear and disappear,and it can be difficult to monitor them in real *** traditional computing systems,cycle detection requires considerable computational resources,making real-time cycle detection in large-scale power grids an impossible *** computing has shown excellent performance in many areas and has solved many practical graph-related problems,such as power flow calculation and state *** this article,a cycle detection method,the Paton method,is implemented and optimized on a graph computing *** cases are used to test its performance in an actual power grid topology *** results show that the graph computing-based Paton method reduces the time consumption by at least 60%compared to that of other methods.

关键词： Cycle detection graph computing power grid distribution grid

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Fraud detection on payment transaction networks via graph computing and visualization

引用

High Technology Letters 2020年第3期26卷 253-261页

作者： Sun Quan Tang Tao Zheng Jianbin Lin Jiale Zhao Jintao Liu Hongbao School of Computer Science Fudan UniversityShanghai 200433P.R.China China UnionPay Research Institute of Electronic Payment Shanghai 201201P.R.China School of Electronic Information and Electrical Engineering Shanghai Jiao Tong UniversityShanghai 200240P.R.China

With the fast development of Internet technology,more and more payments are fulfilled by mobile Apps in an electrical way which significantly saves time and efforts for *** a change has benefited a large number of individual users as well as merchants,and a few major players for payment service have emerged in *** a result,the payment service competition becomes even fierce,and various promotion activities have been launched for attracting more users by the payment service *** this paper,the problem focused on is fraud payment detection,which in fact has been a major concern for the providers who spend a significant amount of money to popularize their payment *** paper tries the graph computing-based visualization to the behavior of transactions occuring between the individual users and ***,a network analysisbased pipeline has been *** consists of the following key components:transaction network building based on daily records aggregation;transaction network filtering based on edge and node removal;transaction network decomposition by community detection;detected transaction community *** proposed approach is verified on the real-world dataset collected from the major player in the payment market in Asia and the qualitative results show the efficiency of the method.

关键词： payment fraud detection graph computing graph embedding machine learning

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Design of graph computing accelerator based on reconfigurable PE array

引用

The Journal of China Universities of Posts and Telecommunications 2024年第5期31卷 49-63,70页

作者： Deng Junyong Jia Yanting Zhang Baoxiang Kang Yuchun Lu Songtao School of Electronic Engineering Xi'an University of Posts and TelecommunicationsXi'an 710121China

Due to the diversity of graph computing applications, the power-law distribution of graph data, and the high compute-to-memory ratio, traditional architectures face significant challenges regarding poor flexibility, imbalanced workload distribution, and inefficient memory access when executing graph computing tasks. graph computing accelerator, graphApp, based on a reconfigurable processing element(PE) array was proposed to address the challenges above. graphApp utilizes 16 reconfigurable PEs for parallel computation and employs tiled data. By reasonably dividing the data into tiles, load balancing is achieved and the overall efficiency of parallel computation is enhanced. Additionally, it preprocesses graph data using the compressed sparse columns independently(CSCI) data compression format to alleviate the issue of low memory access efficiency caused by the high memory access-to-computation ratio. Lastly, graphApp is evaluated using triangle counting(TC) and depth-first search(DFS) algorithms. Performance analysis is conducted by measuring the execution time of these algorithms in graphApp against existing typical graph frameworks, Ligra, and graphBIG, using six datasets from the Stanford Network Analysis Project(SNAP) database. The results show that graphApp achieves a maximum performance improvement of 30.86% compared to Ligra and 20.43% compared to graphBIG when processing the same datasets.

关键词： graph computing reconfigurable accelerator parallel computing triangle counting(TC)algorithm depth-first search(DFS)algorithm

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Modeling and application of marketing and distribution data based on graph computing

引用

Global Energy Interconnection 2022年第4期5卷 448-460页

作者： Kai Xiao Daoxing Li Xiaohui Wang Pengtian Guo China Electric Power Research Institute Co.Ltd. Beijing 100192P.R.China

Integrating marketing and distribution businesses is crucial for improving the coordination of equipment and the efficient management of multi-energy *** energy sources are continuously being connected to distribution grids;this,however,increases the complexity of the information structure of marketing and distribution *** existing unified data model and the coordinated application of marketing and distribution suffer from various *** a solution,this paper presents a data model of"one graph of marketing and distribution"and a framework for graph computing,by analyzing the current trends of business and data in the marketing and distribution fields and using graph data ***,this work aims to determine the correlation between distribution transformers and marketing users,which is crucial for elucidating the connection between marketing and *** this manner,a novel identification algorithm is proposed based on the collected data for marketing and ***,a forecasting application is developed based on the proposed algorithm to realize the coordinated prediction and consumption of distributed photovoltaic power generation and distribution ***,an operation and maintenance(O&M)knowledge graph reasoning application is developed to improve the intelligent O&M ability of marketing and distribution equipment.

关键词： Marketing and distribution connection graph data graph computing Knowledge graph Data model

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

欢迎您,

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：