Dear Editor,This letter deals with the set stabilization of stochastic Boolean control networks(SBCNs)by the pinning control strategy,which is to realize the full control for systems by imposing control inputs on a fr...Dear Editor,This letter deals with the set stabilization of stochastic Boolean control networks(SBCNs)by the pinning control strategy,which is to realize the full control for systems by imposing control inputs on a fraction of agents.展开更多
Set stabilization is one of the essential problems in engineering systems, and self-triggered control(STC) can save the storage space for interactive information, and can be successfully applied in networked control s...Set stabilization is one of the essential problems in engineering systems, and self-triggered control(STC) can save the storage space for interactive information, and can be successfully applied in networked control systems with limited communication resources. In this study, the set stabilization problem and STC design of Boolean control networks are investigated via the semi-tensor product technique. On the one hand, the largest control invariant subset is calculated in terms of the strongly connected components of the state transition graph, by which a graph-theoretical condition for set stabilization is derived. On the other hand, a characteristic function is exploited to determine the triggering mechanism and feasible controls. Based on this, the minimum-time and minimum-triggering open-loop, state-feedback and output-feedback STCs for set stabilization are designed,respectively. As classic applications of self-triggered set stabilization, self-triggered synchronization, self-triggered output tracking and self-triggered output regulation are discussed as well. Additionally, several practical examples are given to illustrate the effectiveness of theoretical results.展开更多
A 2-dimension linguistic lattice implication algebra(2DL-LIA)can build a bridge between logical algebra and 2-dimension fuzzy linguistic information.In this paper,the notion of a Boolean element is proposed in a 2DL-L...A 2-dimension linguistic lattice implication algebra(2DL-LIA)can build a bridge between logical algebra and 2-dimension fuzzy linguistic information.In this paper,the notion of a Boolean element is proposed in a 2DL-LIA and some properties of Boolean elements are discussed.Then derivations on 2DL-LIAs are introduced and the related properties of derivations are investigated.Moreover,it proves that the derivations on 2DL-LIAs can be constructed by Boolean elements.展开更多
This survey article illustrates many important current trends and perspectives for the field and their applications, of interest to researchers in modern algebra, mathematical logic and discrete mathematics. It covers...This survey article illustrates many important current trends and perspectives for the field and their applications, of interest to researchers in modern algebra, mathematical logic and discrete mathematics. It covers a number of directions, including completeness theorem and compactness theorem for hyperidentities;the characterizations of the Boolean algebra of n-ary Boolean functions and the bounded distributive lattice of n-ary monotone Boolean functions;the functional representations of finitely-generated free algebras of various varieties of lattices via generalized Boolean functions, etc.展开更多
This study introduces the representation of natural number sets as row vectors and pretends to offer a new perspective on the strong Goldbach conjecture. The natural numbers are restructured and expanded with the incl...This study introduces the representation of natural number sets as row vectors and pretends to offer a new perspective on the strong Goldbach conjecture. The natural numbers are restructured and expanded with the inclusion of the zero element as the source of a strong Goldbach conjecture reformulation. A prime Boolean vector is defined, pinpointing the positions of prime numbers within the odd number sequence. The natural unit primality is discussed in this context and transformed into a source of quantum-like indetermination. This approach allows for rephrasing the strong Goldbach conjecture, framed within a Boolean scalar product between the prime Boolean vector and its reverse. Throughout the discussion, other intriguing topics emerge and are thoroughly analyzed. A final description of two empirical algorithms is provided to prove the strong Goldbach conjecture.展开更多
基金supported by the National Key Research and Development Project of China(2020YFA0714301)the National Natural Science Foundation of China(61833005)。
文摘Dear Editor,This letter deals with the set stabilization of stochastic Boolean control networks(SBCNs)by the pinning control strategy,which is to realize the full control for systems by imposing control inputs on a fraction of agents.
基金supported by the National Natural Science Foundation of China (62273201,62173209,72134004,62303170)the Research Fund for the Taishan Scholar Project of Shandong Province of China (TSTP20221103)。
文摘Set stabilization is one of the essential problems in engineering systems, and self-triggered control(STC) can save the storage space for interactive information, and can be successfully applied in networked control systems with limited communication resources. In this study, the set stabilization problem and STC design of Boolean control networks are investigated via the semi-tensor product technique. On the one hand, the largest control invariant subset is calculated in terms of the strongly connected components of the state transition graph, by which a graph-theoretical condition for set stabilization is derived. On the other hand, a characteristic function is exploited to determine the triggering mechanism and feasible controls. Based on this, the minimum-time and minimum-triggering open-loop, state-feedback and output-feedback STCs for set stabilization are designed,respectively. As classic applications of self-triggered set stabilization, self-triggered synchronization, self-triggered output tracking and self-triggered output regulation are discussed as well. Additionally, several practical examples are given to illustrate the effectiveness of theoretical results.
基金Supported by the National Natural Science Foundation of China(11501523,61673320)。
文摘A 2-dimension linguistic lattice implication algebra(2DL-LIA)can build a bridge between logical algebra and 2-dimension fuzzy linguistic information.In this paper,the notion of a Boolean element is proposed in a 2DL-LIA and some properties of Boolean elements are discussed.Then derivations on 2DL-LIAs are introduced and the related properties of derivations are investigated.Moreover,it proves that the derivations on 2DL-LIAs can be constructed by Boolean elements.
文摘This survey article illustrates many important current trends and perspectives for the field and their applications, of interest to researchers in modern algebra, mathematical logic and discrete mathematics. It covers a number of directions, including completeness theorem and compactness theorem for hyperidentities;the characterizations of the Boolean algebra of n-ary Boolean functions and the bounded distributive lattice of n-ary monotone Boolean functions;the functional representations of finitely-generated free algebras of various varieties of lattices via generalized Boolean functions, etc.
文摘This study introduces the representation of natural number sets as row vectors and pretends to offer a new perspective on the strong Goldbach conjecture. The natural numbers are restructured and expanded with the inclusion of the zero element as the source of a strong Goldbach conjecture reformulation. A prime Boolean vector is defined, pinpointing the positions of prime numbers within the odd number sequence. The natural unit primality is discussed in this context and transformed into a source of quantum-like indetermination. This approach allows for rephrasing the strong Goldbach conjecture, framed within a Boolean scalar product between the prime Boolean vector and its reverse. Throughout the discussion, other intriguing topics emerge and are thoroughly analyzed. A final description of two empirical algorithms is provided to prove the strong Goldbach conjecture.
