This paper introduces the general process of the search algorithm Structure through the knight problem. According to the characteristics of the problem, we detailed discuss the DFS（Depth First Search） algorithm and ...This paper introduces the general process of the search algorithm Structure through the knight problem. According to the characteristics of the problem, we detailed discuss the DFS（Depth First Search） algorithm and BFS（Breadth First Search） algorithm, and combine the two algorithms together to solve the knights coverage problem. This article has a good reference for the mixed-use scenarios which requires a variety of search algorithms.展开更多
首先分析潮流转移的原因及伴随的现象。其次讨论潮流转移区域以及区域界定,对传统广度优先遍历(breadth first search,BFS)算法进行改进,提出潮流转移影响区域的界定方法。对安全评估工作的理论基础——3个基本概念(模型量化、平均功率...首先分析潮流转移的原因及伴随的现象。其次讨论潮流转移区域以及区域界定,对传统广度优先遍历(breadth first search,BFS)算法进行改进,提出潮流转移影响区域的界定方法。对安全评估工作的理论基础——3个基本概念(模型量化、平均功率角和潮流转移灵敏度)分别进行定义。提出潮流转移模型及其灵敏度的表达式。提出安全评估的评估方法,建立安全评估的数学模型,最终得到安全评估的综合指标,并阐述了指标的使用。开发潮流转移灵敏度及安全评估程序,利用该程序对真实电网算例进行仿真验证。展开更多
For decades,engineers have utilized Petri nets to develop automated systems with specific functional requirements or characteristics.Nonetheless,the ex-isting formalism prevents the use of classic traversal techniques...For decades,engineers have utilized Petri nets to develop automated systems with specific functional requirements or characteristics.Nonetheless,the ex-isting formalism prevents the use of classic traversal techniques to examine and analyze a system’s functional behavior.This paper provides a novel tech-nique to represent Petri nets as directed Euler graphs.It enables design engi-neers to examine and traverse the various states of a system utilizing the vari-ous methodologies and traversal processes applicable to Euler graphs.In this study,we present an iterative approach for determining an optimal path in terms of the least number of edges(vertices)required to cover and contain the system’s states,which are represented as Petri nets.The goal is to leave one vertex and return to the same vertex of the graph in a finite number of steps.This is a new method for determining the attribute of the system’s reset,which is represented by Petri nets and allows the system to return to its starting state,the resting state.The goal is to broaden the ontological basis of Petri nets by displaying linkages or relationships between Petri nets that are akin to directed Euler graphs.展开更多
文摘This paper introduces the general process of the search algorithm Structure through the knight problem. According to the characteristics of the problem, we detailed discuss the DFS（Depth First Search） algorithm and BFS（Breadth First Search） algorithm, and combine the two algorithms together to solve the knights coverage problem. This article has a good reference for the mixed-use scenarios which requires a variety of search algorithms.
文摘首先分析潮流转移的原因及伴随的现象。其次讨论潮流转移区域以及区域界定,对传统广度优先遍历(breadth first search,BFS)算法进行改进,提出潮流转移影响区域的界定方法。对安全评估工作的理论基础——3个基本概念(模型量化、平均功率角和潮流转移灵敏度)分别进行定义。提出潮流转移模型及其灵敏度的表达式。提出安全评估的评估方法,建立安全评估的数学模型,最终得到安全评估的综合指标,并阐述了指标的使用。开发潮流转移灵敏度及安全评估程序,利用该程序对真实电网算例进行仿真验证。
文摘For decades,engineers have utilized Petri nets to develop automated systems with specific functional requirements or characteristics.Nonetheless,the ex-isting formalism prevents the use of classic traversal techniques to examine and analyze a system’s functional behavior.This paper provides a novel tech-nique to represent Petri nets as directed Euler graphs.It enables design engi-neers to examine and traverse the various states of a system utilizing the vari-ous methodologies and traversal processes applicable to Euler graphs.In this study,we present an iterative approach for determining an optimal path in terms of the least number of edges(vertices)required to cover and contain the system’s states,which are represented as Petri nets.The goal is to leave one vertex and return to the same vertex of the graph in a finite number of steps.This is a new method for determining the attribute of the system’s reset,which is represented by Petri nets and allows the system to return to its starting state,the resting state.The goal is to broaden the ontological basis of Petri nets by displaying linkages or relationships between Petri nets that are akin to directed Euler graphs.
