This paper explores the existence of heteroclinic cycles and corresponding chaotic dynamics in a class of 3-dimensional two-zone piecewise affine systems. Moreover, the heteroclinic cycles connect two saddle foci and ...This paper explores the existence of heteroclinic cycles and corresponding chaotic dynamics in a class of 3-dimensional two-zone piecewise affine systems. Moreover, the heteroclinic cycles connect two saddle foci and intersect the switching manifold at two points and the switching manifold is composed of two perpendicular planes.展开更多
G. C. Ying, Y. Y. Meng, B. E. Sagan, and V. R. Vatter [1] found the maximum number of maximal independent sets in connected graphs which contain at most two cycles. In this paper, we give an alternative proof to deter...G. C. Ying, Y. Y. Meng, B. E. Sagan, and V. R. Vatter [1] found the maximum number of maximal independent sets in connected graphs which contain at most two cycles. In this paper, we give an alternative proof to determine the largest number of maximal independent sets among all connected graphs of order n ≥ 12, which contain at most two cycles. We also characterize the extremal graph achieving this maximum value.展开更多
On May 1st, China National Nuclear Corporation(CNNC) announced in Beijing that unit 1 and unit 2 ofTianwan Nuclear Power Plant cooperatively constructedby China and Russia have completed in succession thefirst fuel cy...On May 1st, China National Nuclear Corporation(CNNC) announced in Beijing that unit 1 and unit 2 ofTianwan Nuclear Power Plant cooperatively constructedby China and Russia have completed in succession thefirst fuel cycle operation continuously and safely. It is展开更多
Let G =（V, E） be a connected simple graph. A labeling f ： V → Z2 induces an edge labeling f＊ ： E → Z2 defined by f＊（xy） = f（x） ＋f（y） for each xy ∈ E. For i ∈ Z2, let vf（i） = ｜f^-1（i）｜ and ef（i...Let G =（V, E） be a connected simple graph. A labeling f ： V → Z2 induces an edge labeling f＊ ： E → Z2 defined by f＊（xy） = f（x） ＋f（y） for each xy ∈ E. For i ∈ Z2, let vf（i） = ｜f^-1（i）｜ and ef（i） = ｜f＊^-1（i）｜. A labeling f is called friendly if ｜vf（1） - vf（0）｜ ≤ 1. For a friendly labeling f of a graph G, we define the friendly index of G under f by if（G） = e（1） - el（0）. The set [if（G） ｜ f is a friendly labeling of G} is called the full friendly index set of G, denoted by FFI（G）. In this paper, we will determine the full friendly index set of every Cartesian product of two cycles.展开更多
A k-cycle system of order v with index A, denoted by CS（v, k, λ）, is a collection A of k-cycles （blocks） of Kv such that each edge in Kv appears in exactly λ blocks of A. A large set of CS（v, k, λ）s is a part...A k-cycle system of order v with index A, denoted by CS（v, k, λ）, is a collection A of k-cycles （blocks） of Kv such that each edge in Kv appears in exactly λ blocks of A. A large set of CS（v, k, λ）s is a partition of the set of all k-cycles of Kv into CS（v, k, λ）s, and is denoted by LCS（v, k, λ）. A （v - 1）-cycle in K, is called almost Hamilton. The completion of the existence problem for LCS（v, v- 1,λ） depends only on one case： all v ≥ 4 for λ=2. In this paper, it is shown that there exists an LCS（v,v - 1,2） for all v ≡ 2 （mod 4）, v ≥ 6.展开更多
Cycle sets were introduced to reduce non-degenerate unitary Yang-Baxter maps to an algebraic system with a single binary operation. Every finite cycle set extends uniquely to a finite cycle set with a compatible abeli...Cycle sets were introduced to reduce non-degenerate unitary Yang-Baxter maps to an algebraic system with a single binary operation. Every finite cycle set extends uniquely to a finite cycle set with a compatible abelian group structure. Etingof et al. introduced affine Yang-Baxter maps. These are equivalent to cycle sets with a specific abelian group structure. Abelian group structures have also been essential to get partial results for the still unsolved retraction problem. We introduce two new classes of cycle sets with an underlying abelian group structure and show that they can be transformed into each other while keeping the group structure fixed. This leads to a proper extension of the retractibility conjecture and new evidence for its truth.展开更多
In this paper, an approach to optimize set points is proposed for controlled Organic Rankine Cycle(ORC)systems. Owing to both disturbances and variations of operating point existing in ORC systems, it is necessary to ...In this paper, an approach to optimize set points is proposed for controlled Organic Rankine Cycle(ORC)systems. Owing to both disturbances and variations of operating point existing in ORC systems, it is necessary to optimize the set points for controlled ORC systems so as to improve the energy conversion efficiency. At first, the optimal set points of controlled ORC systems are investigated by revisiting performance analysis and optimization of ORC systems. The expected set points of the evaporating pressure and the temperature at evaporator outlet are then determined by combining genetic algorithm with least squares support vector machine(GA-LSSVM). Simulation results show that the predicted results by GA-LSSVM can be regarded as the optimal set points of controlled ORC systems with varying operating conditions.展开更多
文摘This paper explores the existence of heteroclinic cycles and corresponding chaotic dynamics in a class of 3-dimensional two-zone piecewise affine systems. Moreover, the heteroclinic cycles connect two saddle foci and intersect the switching manifold at two points and the switching manifold is composed of two perpendicular planes.
文摘G. C. Ying, Y. Y. Meng, B. E. Sagan, and V. R. Vatter [1] found the maximum number of maximal independent sets in connected graphs which contain at most two cycles. In this paper, we give an alternative proof to determine the largest number of maximal independent sets among all connected graphs of order n ≥ 12, which contain at most two cycles. We also characterize the extremal graph achieving this maximum value.
文摘On May 1st, China National Nuclear Corporation(CNNC) announced in Beijing that unit 1 and unit 2 ofTianwan Nuclear Power Plant cooperatively constructedby China and Russia have completed in succession thefirst fuel cycle operation continuously and safely. It is
基金Supported by FRG/07-08/II-08 Hong Kong Baptist University
文摘Let G =（V, E） be a connected simple graph. A labeling f ： V → Z2 induces an edge labeling f＊ ： E → Z2 defined by f＊（xy） = f（x） ＋f（y） for each xy ∈ E. For i ∈ Z2, let vf（i） = ｜f^-1（i）｜ and ef（i） = ｜f＊^-1（i）｜. A labeling f is called friendly if ｜vf（1） - vf（0）｜ ≤ 1. For a friendly labeling f of a graph G, we define the friendly index of G under f by if（G） = e（1） - el（0）. The set [if（G） ｜ f is a friendly labeling of G} is called the full friendly index set of G, denoted by FFI（G）. In this paper, we will determine the full friendly index set of every Cartesian product of two cycles.
基金Supported in part by the National Natural Science Foundation of China(No.10901051,11201143)the Fundamental Research Funds for the Central Universities(No.2016MS66)the Co-construction Project of Bejing Municipal Commission of Education
文摘A k-cycle system of order v with index A, denoted by CS（v, k, λ）, is a collection A of k-cycles （blocks） of Kv such that each edge in Kv appears in exactly λ blocks of A. A large set of CS（v, k, λ）s is a partition of the set of all k-cycles of Kv into CS（v, k, λ）s, and is denoted by LCS（v, k, λ）. A （v - 1）-cycle in K, is called almost Hamilton. The completion of the existence problem for LCS（v, v- 1,λ） depends only on one case： all v ≥ 4 for λ=2. In this paper, it is shown that there exists an LCS（v,v - 1,2） for all v ≡ 2 （mod 4）, v ≥ 6.
文摘Cycle sets were introduced to reduce non-degenerate unitary Yang-Baxter maps to an algebraic system with a single binary operation. Every finite cycle set extends uniquely to a finite cycle set with a compatible abelian group structure. Etingof et al. introduced affine Yang-Baxter maps. These are equivalent to cycle sets with a specific abelian group structure. Abelian group structures have also been essential to get partial results for the still unsolved retraction problem. We introduce two new classes of cycle sets with an underlying abelian group structure and show that they can be transformed into each other while keeping the group structure fixed. This leads to a proper extension of the retractibility conjecture and new evidence for its truth.
基金supported by the National Basic Research Program of China(2011CB710706)the National Natural Science Foundation of China(51210011,61374025)
文摘In this paper, an approach to optimize set points is proposed for controlled Organic Rankine Cycle(ORC)systems. Owing to both disturbances and variations of operating point existing in ORC systems, it is necessary to optimize the set points for controlled ORC systems so as to improve the energy conversion efficiency. At first, the optimal set points of controlled ORC systems are investigated by revisiting performance analysis and optimization of ORC systems. The expected set points of the evaporating pressure and the temperature at evaporator outlet are then determined by combining genetic algorithm with least squares support vector machine(GA-LSSVM). Simulation results show that the predicted results by GA-LSSVM can be regarded as the optimal set points of controlled ORC systems with varying operating conditions.
