Some new concepts of effective incidence matrix,ascending order adjacency matrix andend-result vertex are introduced,and some improvements of the maximum weight matchingalgorithm are made.With this method a computer p...Some new concepts of effective incidence matrix,ascending order adjacency matrix andend-result vertex are introduced,and some improvements of the maximum weight matchingalgorithm are made.With this method a computer program in FORTRAN language is realized onthe computers FELIX C-512 and IBM-PC.Good results are obtained in practical operations.展开更多
对于环境中存在的各种类型能量源,其往往具有不同的阻抗特性以及输出功率范围。为了提高能量收集系统的能量萃取能力,合理的接口电路设计是关键。基于此,通过对环境中光伏(Photovoltaic,PV)能量源微弱直流特性以及高效率收集和转化的研...对于环境中存在的各种类型能量源,其往往具有不同的阻抗特性以及输出功率范围。为了提高能量收集系统的能量萃取能力,合理的接口电路设计是关键。基于此,通过对环境中光伏(Photovoltaic,PV)能量源微弱直流特性以及高效率收集和转化的研究,在传统开路电压法(Open-Circuit Voltage,OCV)的基础上,结合输入电压纹波控制,提出了一种可实时最大功率点追踪(Maximum Power Point Tracking,MPPT)的预估算法。该预估算法根据能量源的输出特性,采用了分数开路电压法(Fractional Open-Circuit Voltage,FOCV),并根据纹波大小动态调节变换器的工作模式,实现阻抗匹配。为了尽可能减小因采样带来的能量损失,采用可片上全集成的较小的采样电容,并逐周期的进行开路电压采样和计算,实现了对源功率变化的高精度追踪。仿真结果表明,所提出的追踪算法能够实时监测能量源的状态,具有高的追踪速度和追踪精度,且采样时间仅需100 ns。能量源功率在1μW~10 mW范围内变化时,最短的追踪时间仅需4.37μs,追踪精度可达99.7%。展开更多
Let G be a simple graph with 2n vertices and a perfect matching.The forcing number f(G,M) of a perfect matching M of G is the smallest cardinality of a subset of M that is contained in no other perfect matching of G.A...Let G be a simple graph with 2n vertices and a perfect matching.The forcing number f(G,M) of a perfect matching M of G is the smallest cardinality of a subset of M that is contained in no other perfect matching of G.Among all perfect matchings M of G,the minimum and maximum values of f(G,M) are called the minimum and maximum forcing numbers of G,denoted by f(G) and F(G),respectively.Then f(G)≤F(G) ≤n-1.Che and Chen(2011) proposed an open problem:how to characterize the graphs G with f(G)=n-1.Later they showed that for a bipartite graph G,f(G)=n-1 if and only if G is complete bipartite graph K_(n,n).In this paper,we completely solve the problem of Che and Chen,and show that f(G)=n-1 if and only if G is a complete multipartite graph or a graph obtained from complete bipartite graph K_(n,n) by adding arbitrary edges in one partite set.For all graphs G with F(G)=n-1,we prove that the forcing spectrum of each such graph G forms an integer interval by matching 2-switches and the minimum forcing numbers of all such graphs G form an integer interval from [n/2] to n-1.展开更多
文摘Some new concepts of effective incidence matrix,ascending order adjacency matrix andend-result vertex are introduced,and some improvements of the maximum weight matchingalgorithm are made.With this method a computer program in FORTRAN language is realized onthe computers FELIX C-512 and IBM-PC.Good results are obtained in practical operations.
文摘对于环境中存在的各种类型能量源,其往往具有不同的阻抗特性以及输出功率范围。为了提高能量收集系统的能量萃取能力,合理的接口电路设计是关键。基于此,通过对环境中光伏(Photovoltaic,PV)能量源微弱直流特性以及高效率收集和转化的研究,在传统开路电压法(Open-Circuit Voltage,OCV)的基础上,结合输入电压纹波控制,提出了一种可实时最大功率点追踪(Maximum Power Point Tracking,MPPT)的预估算法。该预估算法根据能量源的输出特性,采用了分数开路电压法(Fractional Open-Circuit Voltage,FOCV),并根据纹波大小动态调节变换器的工作模式,实现阻抗匹配。为了尽可能减小因采样带来的能量损失,采用可片上全集成的较小的采样电容,并逐周期的进行开路电压采样和计算,实现了对源功率变化的高精度追踪。仿真结果表明,所提出的追踪算法能够实时监测能量源的状态,具有高的追踪速度和追踪精度,且采样时间仅需100 ns。能量源功率在1μW~10 mW范围内变化时,最短的追踪时间仅需4.37μs,追踪精度可达99.7%。
基金Supported by National Natural Science Foundation of China (Grant No. 12271229)Gansu Provincial Department of Education:Youth Doctoral fund project (Grant No. 2021QB-090)。
文摘Let G be a simple graph with 2n vertices and a perfect matching.The forcing number f(G,M) of a perfect matching M of G is the smallest cardinality of a subset of M that is contained in no other perfect matching of G.Among all perfect matchings M of G,the minimum and maximum values of f(G,M) are called the minimum and maximum forcing numbers of G,denoted by f(G) and F(G),respectively.Then f(G)≤F(G) ≤n-1.Che and Chen(2011) proposed an open problem:how to characterize the graphs G with f(G)=n-1.Later they showed that for a bipartite graph G,f(G)=n-1 if and only if G is complete bipartite graph K_(n,n).In this paper,we completely solve the problem of Che and Chen,and show that f(G)=n-1 if and only if G is a complete multipartite graph or a graph obtained from complete bipartite graph K_(n,n) by adding arbitrary edges in one partite set.For all graphs G with F(G)=n-1,we prove that the forcing spectrum of each such graph G forms an integer interval by matching 2-switches and the minimum forcing numbers of all such graphs G form an integer interval from [n/2] to n-1.
