Synchronization in mutual-coupled temporal Boolean networks

2017 ◽  
Vol 40 (7) ◽  
pp. 2211-2216 ◽  
Author(s):  
Qiang Wei ◽  
Cheng-jun Xie
Keyword(s):  
Theoretical Analysis ◽  
Tensor Product ◽  
Sufficient Conditions ◽  
Boolean Networks ◽  
Necessary And Sufficient Conditions ◽  
Complete Synchronization ◽  
Logical Relationship ◽  
Algebraic Form ◽  
Algebraic Forms ◽  
Necessary And Sufficient

In this paper, we first propose a mutual-coupled temporal Boolean networks model and then investigate complete synchronization in mutual-coupled temporal Boolean networks. The mutual-coupled temporal Boolean networks model with logical relationship is converted into an algebraic form based on a semi-tensor product. Necessary and sufficient conditions are derived to realize synchronization based on the algebraic forms. An example illustrates the effectiveness of the theoretical analysis.

scholarly journals (r,p)-absolutely summing operators on the spaceC (T,X)and applications

2001 ◽  
Vol 6 (5) ◽  
pp. 309-315 ◽  
Author(s):  
Dumitru Popa
Keyword(s):  
Integral Operator ◽  
Tensor Product ◽  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Summing Operator ◽  
Absolutely Summing Operators ◽  
Injective Tensor Product ◽  
Absolutely Summing Operator ◽  
Necessary And Sufficient

We give necessary and sufficient conditions for an operator on the spaceC (T,X)to be(r,p)-absolutely summing. Also we prove that the injective tensor product of an integral operator and an(r,p)-absolutely summing operator is an(r,p)-absolutely summing operator.

Generalized WG inverse

2020 ◽  
pp. 2150072
Author(s):  
Sanzhang Xu ◽  
Hongxing Wang ◽  
Jianlong Chen ◽  
Xiaofeng Chen ◽  
Tiwei Zhao
Keyword(s):  
Generalized Inverse ◽  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Algebraic Form ◽  
Necessary And Sufficient

In this paper, we introduce a generalized inverse of a matrix, namely, the generalized WG inverse, which a generalization of the WG inverse. Several necessary and sufficient conditions such that a matrix to be generalized WG invertible are obtained. Moreover, the formulae of generalized WG inverse of a matrix are given. Finally, we give a algebraic form of the generalized WG inverse.

A Family of Non-weight Modules over the Virasoro Algebra

2020 ◽  
Vol 27 (04) ◽  
pp. 807-820
Author(s):  
Guobo Chen
Keyword(s):  
Tensor Product ◽  
Sufficient Conditions ◽  
Virasoro Algebra ◽  
Necessary And Sufficient Conditions ◽  
Weight Module ◽  
Highest Weight Module ◽  
Isomorphism Classes ◽  
Highest Weight ◽  
Necessary And Sufficient ◽  
Weight Modules

In this paper, we consider the tensor product modules of a class of non-weight modules and highest weight modules over the Virasoro algebra. We determine the necessary and sufficient conditions for such modules to be simple and the isomorphism classes among all these modules. Finally, we prove that these simple non-weight modules are new if the highest weight module over the Virasoro algebra is non-trivial.

scholarly journals Robust Output Controllability Analysis and Control Design for Incomplete Boolean Networks with Disturbance Inputs

2018 ◽  
Vol 2018 ◽  
pp. 1-9
Author(s):  
Lei Deng ◽  
Shihua Fu ◽  
Ying Li ◽  
Peiyong Zhu
Keyword(s):  
Sufficient Conditions ◽  
Boolean Networks ◽  
Algebraic Form ◽  
Output Control ◽  
Optimal Output ◽  
Product Technique ◽  
Output Controllability ◽  
The Cost ◽  
Necessary And Sufficient ◽  
And Control

This paper addresses the problems of robust-output-controllability and robust optimal output control for incomplete Boolean control networks with disturbance inputs. First, by resorting to the semi-tensor product technique, the system is expressed as an algebraic form, based on which several necessary and sufficient conditions for the robust output controllability are presented. Second, the Mayer-type robust optimal output control issue is studied and an algorithm is established to find a control scheme which can minimize the cost functional regardless of the effect of disturbance inputs. Finally, a numerical example is given to demonstrate the effectiveness of the obtained new results.

scholarly journals Controllability, Reachability, and Stabilizability of Finite Automata: A Controllability Matrix Method

2018 ◽  
Vol 2018 ◽  
pp. 1-6 ◽  
Author(s):  
Yalu Li ◽  
Wenhui Dou ◽  
Haitao Li ◽  
Xin Liu
Keyword(s):  
Matrix Method ◽  
Finite Automata ◽  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Algebraic Form ◽  
Controllability Matrix ◽  
Necessary And Sufficient ◽  
Semitensor Product Of Matrices ◽  
Product Of Matrices ◽  
Inputs And Outputs

This paper investigates the controllability, reachability, and stabilizability of finite automata by using the semitensor product of matrices. Firstly, by expressing the states, inputs, and outputs as vector forms, an algebraic form is obtained for finite automata. Secondly, based on the algebraic form, a controllability matrix is constructed for finite automata. Thirdly, some necessary and sufficient conditions are presented for the controllability, reachability, and stabilizability of finite automata by using the controllability matrix. Finally, an illustrative example is given to support the obtained new results.

Composition results for strongly summing and dominated multilinear operators

2014 ◽  
Vol 12 (10) ◽  
Author(s):  
Dumitru Popa
Keyword(s):  
Tensor Product ◽  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Bilinear Operator ◽  
Multilinear Operators ◽  
Weakly Compact ◽  
Necessary And Sufficient ◽  
Composition Theorem

AbstractIn this paper we prove some composition results for strongly summing and dominated operators. As an application we give necessary and sufficient conditions for a multilinear tensor product of multilinear operators to be strongly summing or dominated. Moreover, we show the failure of some possible n-linear versions of Grothendieck’s composition theorem in the case n ≥ 2 and give a new example of a 1-dominated, hence strongly 1-summing bilinear operator which is not weakly compact.

scholarly journals Property (Bb) and Tensor product

Filomat ◽  
2013 ◽  
Vol 27 (7) ◽  
pp. 1297-1303
Author(s):  
M.H.M. Rashid ◽  
T. Prasad
Keyword(s):  
Banach Space ◽  
Tensor Product ◽  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Space Operator ◽  
Weyl Spectrum ◽  
Riesz Operators ◽  
Necessary And Sufficient ◽  
Banach Space Operators ◽  
Satisfy Property

In this paper, we find necessary and sufficient conditions for Banach Space operator to satisfy the property (Bb). Then we obtain, if Banach Space operators A ? B(X)and B ? B(Y) satisfy property (Bb) implies A x B satisfies property (Bb) if and only if the B-Weyl spectrum identity ?BW(A x B) = ?BW(A)?(B) U ?BW(B)?(A) holds. Perturbations by Riesz operators are considered.

scholarly journals Robust set stabilization of Boolean control networks with impulsive effects

2018 ◽  
Vol 23 (4) ◽  
pp. 553-567 ◽  
Author(s):  
Xiaojing Xu ◽  
Yansheng Liu ◽  
Haitao Li ◽  
Fuad E. Alsaadi
Keyword(s):  
Feedback Control ◽  
State Feedback ◽  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
State Feedback Control ◽  
Impulsive Effects ◽  
Algebraic Form ◽  
Control Networks ◽  
Set Stabilization ◽  
Necessary And Sufficient

This paper addresses the robust set stabilization problem of Boolean control networks (BCNs) with impulsive effects via the semi-tensor product method. Firstly, the closed-loop system consisting of a BCN with impulsive effects and a given state feedback control is converted into an algebraic form. Secondly, based on the algebraic form, some necessary and sufficient conditions are presented for the robust set stabilization of BCNs with impulsive effects under a given state feedback control and a free-form control sequence, respectively. Thirdly, as applications, some necessary and sufficient conditions are presented for robust partial stabilization and robust output tracking of BCNs with impulsive effects, respectively. The study of two illustrative examples shows that the obtained new results are effective.

Sign in / Sign up

Export Citation Format

Share Document