The unit graph of a ring is the simple graph whose vertices are the elements of the ring and where two distinct vertices are adjacent if and only if their sum is a unit of the ring.A simple graph is said to be planar ...The unit graph of a ring is the simple graph whose vertices are the elements of the ring and where two distinct vertices are adjacent if and only if their sum is a unit of the ring.A simple graph is said to be planar if it can be drawn on the plane in such a way that its edges intersect only at their endpoints.In this note,we completely characterize the semipotent rings whose unit graphs are planar.As a consequence,we list all semilocal rings with planar unit graphs.展开更多
Let R be a ring with non-zero identity.The unit graph of R,denoted by G(R),is an undirected graph with all the elements of R as vertices and where distinct vertices x,y are adjacent if and only if x+y is a unit of R.I...Let R be a ring with non-zero identity.The unit graph of R,denoted by G(R),is an undirected graph with all the elements of R as vertices and where distinct vertices x,y are adjacent if and only if x+y is a unit of R.In this paper,we investigate the Wiener index and hyper-Wiener index of G(R)and explicitly determine their values.展开更多
This paper shows that, for every unit interval graph, there is a labelling which is simultaneously optimal for the following seven graph labelling problems: bandwidth, cyclic bandwidth, profile, fill-in, cutwidth, mod...This paper shows that, for every unit interval graph, there is a labelling which is simultaneously optimal for the following seven graph labelling problems: bandwidth, cyclic bandwidth, profile, fill-in, cutwidth, modified cutwidth, and bandwidth sum(linear arrangement).展开更多
The connected dominating set (CDS) problem, which consists of finding a smallest connected dominating set for graphs is an NP-hard problem in the unit disk graphs (UDGs). This paper focuses on the CDS problem in w...The connected dominating set (CDS) problem, which consists of finding a smallest connected dominating set for graphs is an NP-hard problem in the unit disk graphs (UDGs). This paper focuses on the CDS problem in wireless networks. Investigation of some properties of independent set (IS) in UDGs shows that geometric features of nodes distribution like angle and area can be used to design efficient heuristics for the approximation algorithms. Several constant factor approximation algorithms are presented for the CDS problem in UDGs. Simulation results show that the proposed algorithms perform better than some known ones.展开更多
电力现货市场优化出清模型的难点是考虑安全约束的机组组合(security constrained unit commitment,SCUC)模型。构建一个好的SCUC模型以提升求解速度是长期以来的研究热点。随着省电力系统规模的不断发展,以及国内省间电力现货市场的运...电力现货市场优化出清模型的难点是考虑安全约束的机组组合(security constrained unit commitment,SCUC)模型。构建一个好的SCUC模型以提升求解速度是长期以来的研究热点。随着省电力系统规模的不断发展,以及国内省间电力现货市场的运行,现货市场对于出清模型的求解效率需求更为突出。该文对机组组合模型的研究历程进行详细综述,总结提出机组运行出力约束、出力上限约束、爬坡约束强化建模的机组运行模型;基于图论在线性最优潮流计算中的应用,构建输电网的环流潮流计算模型并引入SCUC模型,最终构建了一套可进一步提升求解效率的电力现货市场出清模型。最后通过多个大规模算例的计算分析表明,所提模型在保证不损失求解精度的同时,可有效提升求解效率,且对于阻塞频发的电力系统,优越性更为明显。展开更多
高渗透率新能源波动下系统动态频率预测是实现受端网络频率安全态势感知的基础。该文提出一种基于混合量测和物理状态方程联合驱动的新能源电力系统双向树状长短期记忆网络(combined equation-of-state-driven and data-driven bi-direc...高渗透率新能源波动下系统动态频率预测是实现受端网络频率安全态势感知的基础。该文提出一种基于混合量测和物理状态方程联合驱动的新能源电力系统双向树状长短期记忆网络(combined equation-of-state-driven and data-driven bi-directional tree-struct long short term memory,CEOSD-BITREE-LSTM)动态频率预测方法。首先,引入双层多头注意力图神经网络,提出考虑同步相量测量单元(synchronous phasor measurement unit,PMU)和数据采集与监视控制系统装置(supervisory control and data acquisition,SCADA)量测差异性和时序同步性的混合量测融合策略;其次,依据PMU密集采样特性,建立计及源网荷物理联系的线性时变状态方程,刻画物理-数据空间的频率特征交互关系;然后,考虑新能源出力、负荷波动等不确定因素,结合以PMU并行搜索调频资源形成的拓扑结构,构建CEOSD-BITREE-LSTM动态频率预测模型,实现系统频率态势的高精度预测。最后,以改进新英格兰10机39节点、三区互联系统为算例,验证该文所提方法的可行性和有效性。展开更多
基金supported by the National Natural Science Foundation of China(11661013,11661014,11961050)Guangxi Natural Science Foundation(2016GXNSFCA380014,2016GXNSFDA380017).
文摘The unit graph of a ring is the simple graph whose vertices are the elements of the ring and where two distinct vertices are adjacent if and only if their sum is a unit of the ring.A simple graph is said to be planar if it can be drawn on the plane in such a way that its edges intersect only at their endpoints.In this note,we completely characterize the semipotent rings whose unit graphs are planar.As a consequence,we list all semilocal rings with planar unit graphs.
基金supported in part by a grant from Science and Engineering Research Board,India(Ref.MTR/2017/000830)supported by the National Natural Science Foundation of China(Ref.11961050)the Guangxi Natural Sciences Foundation(Ref.2021GXNSFAA220043).
文摘Let R be a ring with non-zero identity.The unit graph of R,denoted by G(R),is an undirected graph with all the elements of R as vertices and where distinct vertices x,y are adjacent if and only if x+y is a unit of R.In this paper,we investigate the Wiener index and hyper-Wiener index of G(R)and explicitly determine their values.
文摘This paper shows that, for every unit interval graph, there is a labelling which is simultaneously optimal for the following seven graph labelling problems: bandwidth, cyclic bandwidth, profile, fill-in, cutwidth, modified cutwidth, and bandwidth sum(linear arrangement).
基金supported by the National Natural Science Foundation of China under Grant No 60473090the National "11th Five-Year-Supporting-Plan" of China under Grant No 2006BAH02A0407
文摘The connected dominating set (CDS) problem, which consists of finding a smallest connected dominating set for graphs is an NP-hard problem in the unit disk graphs (UDGs). This paper focuses on the CDS problem in wireless networks. Investigation of some properties of independent set (IS) in UDGs shows that geometric features of nodes distribution like angle and area can be used to design efficient heuristics for the approximation algorithms. Several constant factor approximation algorithms are presented for the CDS problem in UDGs. Simulation results show that the proposed algorithms perform better than some known ones.
文摘电力现货市场优化出清模型的难点是考虑安全约束的机组组合(security constrained unit commitment,SCUC)模型。构建一个好的SCUC模型以提升求解速度是长期以来的研究热点。随着省电力系统规模的不断发展,以及国内省间电力现货市场的运行,现货市场对于出清模型的求解效率需求更为突出。该文对机组组合模型的研究历程进行详细综述,总结提出机组运行出力约束、出力上限约束、爬坡约束强化建模的机组运行模型;基于图论在线性最优潮流计算中的应用,构建输电网的环流潮流计算模型并引入SCUC模型,最终构建了一套可进一步提升求解效率的电力现货市场出清模型。最后通过多个大规模算例的计算分析表明,所提模型在保证不损失求解精度的同时,可有效提升求解效率,且对于阻塞频发的电力系统,优越性更为明显。
文摘高渗透率新能源波动下系统动态频率预测是实现受端网络频率安全态势感知的基础。该文提出一种基于混合量测和物理状态方程联合驱动的新能源电力系统双向树状长短期记忆网络(combined equation-of-state-driven and data-driven bi-directional tree-struct long short term memory,CEOSD-BITREE-LSTM)动态频率预测方法。首先,引入双层多头注意力图神经网络,提出考虑同步相量测量单元(synchronous phasor measurement unit,PMU)和数据采集与监视控制系统装置(supervisory control and data acquisition,SCADA)量测差异性和时序同步性的混合量测融合策略;其次,依据PMU密集采样特性,建立计及源网荷物理联系的线性时变状态方程,刻画物理-数据空间的频率特征交互关系;然后,考虑新能源出力、负荷波动等不确定因素,结合以PMU并行搜索调频资源形成的拓扑结构,构建CEOSD-BITREE-LSTM动态频率预测模型,实现系统频率态势的高精度预测。最后,以改进新英格兰10机39节点、三区互联系统为算例,验证该文所提方法的可行性和有效性。