The feedback vertex set (FVS) problem is to find the set of vertices of minimum cardinality whose removal renders the graph acyclic. The FVS problem has applications in several areas such as combinatorial circuit desi...The feedback vertex set (FVS) problem is to find the set of vertices of minimum cardinality whose removal renders the graph acyclic. The FVS problem has applications in several areas such as combinatorial circuit design, synchronous systems, computer systems, and very-large-scale integration (VLSI) circuits. The FVS problem is known to be NP-hard for simple graphs, but polynomi-al-time algorithms have been found for special classes of graphs. The intersection graph of a collection of arcs on a circle is called a circular-arc graph. A normal Helly circular-arc graph is a proper subclass of the set of circular-arc graphs. In this paper, we present an algorithm that takes time to solve the FVS problem in a normal Helly circular-arc graph with n vertices and m edges.展开更多
为提高短期电力负荷预测精度,本文提出了一种基于快照反馈机制改进的变分模态分解技术VMDSF(variational mode decomposition with a snapshot of feedback)和带有循环滑窗策略优化的长短时记忆网络CSLSTM(long short-term memory with ...为提高短期电力负荷预测精度,本文提出了一种基于快照反馈机制改进的变分模态分解技术VMDSF(variational mode decomposition with a snapshot of feedback)和带有循环滑窗策略优化的长短时记忆网络CSLSTM(long short-term memory with circular sliding window)的组合预测方法 VMDSF-CSLSTM。为降低原始序列的不稳定性及复杂性,本文首先使用VMDSF将原始电力负荷序列分解成多个子序列。然后结合网格搜索法对CSLSTM进行最优参数寻找,得到含有最优模型参数的电力负荷短期预测模型。最后,使用2013年澳大利亚4个区域的电力负荷数据集,对本文方法进行算例测试,测试结果表明了本组合模型的有效性。展开更多
文摘The feedback vertex set (FVS) problem is to find the set of vertices of minimum cardinality whose removal renders the graph acyclic. The FVS problem has applications in several areas such as combinatorial circuit design, synchronous systems, computer systems, and very-large-scale integration (VLSI) circuits. The FVS problem is known to be NP-hard for simple graphs, but polynomi-al-time algorithms have been found for special classes of graphs. The intersection graph of a collection of arcs on a circle is called a circular-arc graph. A normal Helly circular-arc graph is a proper subclass of the set of circular-arc graphs. In this paper, we present an algorithm that takes time to solve the FVS problem in a normal Helly circular-arc graph with n vertices and m edges.
文摘为提高短期电力负荷预测精度,本文提出了一种基于快照反馈机制改进的变分模态分解技术VMDSF(variational mode decomposition with a snapshot of feedback)和带有循环滑窗策略优化的长短时记忆网络CSLSTM(long short-term memory with circular sliding window)的组合预测方法 VMDSF-CSLSTM。为降低原始序列的不稳定性及复杂性,本文首先使用VMDSF将原始电力负荷序列分解成多个子序列。然后结合网格搜索法对CSLSTM进行最优参数寻找,得到含有最优模型参数的电力负荷短期预测模型。最后,使用2013年澳大利亚4个区域的电力负荷数据集,对本文方法进行算例测试,测试结果表明了本组合模型的有效性。