scholarly journals On Robust Synchronization of Drive-Response Boolean Control Networks with Disturbances

2018 ◽  
Vol 2018 ◽  
pp. 1-9 ◽  
Author(s):  
Yuanyuan Li ◽  
Jie Zhong ◽  
Jianquan Lu ◽  
Zhen Wang ◽  
Fuad E. Alssadi
Keyword(s):  
State Feedback ◽  
Space Representation ◽  
Control Networks ◽  
State Space Representation ◽  
Robust Synchronization ◽  
Necessary And Sufficient Criteria ◽  
Definition Of ◽  
Necessary And Sufficient ◽  
Product Of Matrices ◽  
Theoretical Results

This paper investigates the robust synchronization of drive-response Boolean control networks (BCNs) with disturbances via semi-tensor product of matrices. Firstly, the definition of robust synchronization is presented for the drive-response BCNs with disturbances. Then, based on the algebraic state space representation of drive-response BCNs, the robustly reachable states/sets are presented to investigate robust synchronization of disturbed BCNs. According to the set of robustly reachable states, some necessary and sufficient criteria are obtained for robust synchronization of drive-response BCNs with disturbances under a given state feedback controller. Finally, an illustrative example is presented to demonstrate the obtained theoretical results.

scholarly journals Interacting Fock spaces and subproduct systems

2020 ◽  
Vol 23 (03) ◽  
pp. 2050017
Author(s):  
Malte Gerhold ◽  
Michael Skeide
Keyword(s):  
Selfadjoint Operator ◽  
Operator Algebras ◽  
Fock Space ◽  
Fock Spaces ◽  
Full Generality ◽  
Necessary And Sufficient Criteria ◽  
Definition Of ◽  
Interacting Fock Space ◽  
Necessary And Sufficient

We present a new more flexible definition of interacting Fock space that allows to resolve in full generality the problem of embeddability. We show that the same is not possible for regularity. We apply embeddability to classify interacting Fock spaces by squeezings. We give necessary and sufficient criteria for when an interacting Fock space has only bounded creators, giving thus rise to new classes of non-selfadjoint and selfadjoint operator algebras.

Sampled-Data State Feedback Stabilization of Boolean Control Networks

2016 ◽  
Vol 28 (4) ◽  
pp. 778-799 ◽  
Author(s):  
Yang Liu ◽  
Jinde Cao ◽  
Liangjie Sun ◽  
Jianquan Lu
Keyword(s):  
State Feedback ◽  
Sufficient Conditions ◽  
Feedback Stabilization ◽  
Necessary And Sufficient Conditions ◽  
State Feedback Control ◽  
Global Stabilization ◽  
Sampled Data ◽  
Control Networks ◽  
Piecewise Constant Control ◽  
Necessary And Sufficient

In this letter, we investigate the sampled-data state feedback control (SDSFC) problem of Boolean control networks (BCNs). Some necessary and sufficient conditions are obtained for the global stabilization of BCNs by SDSFC. Different from conventional state feedback controls, new phenomena observed the study of SDSFC. Based on the controllability matrix, we derive some necessary and sufficient conditions under which the trajectories of BCNs can be stabilized to a fixed point by piecewise constant control (PCC). It is proved that the global stabilization of BCNs under SDSFC is equivalent to that by PCC. Moreover, algorithms are given to construct the sampled-data state feedback controllers. Numerical examples are given to illustrate the efficiency of the obtained results.

A LEARNING ALGORITHM FOR OPTIMAL REPRESENTATION OF EXPERIMENTAL DATA

1994 ◽  
Vol 04 (02) ◽  
pp. 311-326 ◽  
Author(s):  
JOSEPH L. BREEDEN ◽  
NORMAN H. PACKARD
Keyword(s):  
Experimental Data ◽  
Time Delays ◽  
Optimality Criterion ◽  
Learning Algorithm ◽  
Space Representation ◽  
Coordinate Systems ◽  
State Space Representation ◽  
Optimal Representation ◽  
Definition Of ◽  
General Tool

We have developed a procedure for finding optimal representations of experimental data. Criteria for optimality vary according to context; an optimal state space representation will be one that best suits one’s stated goal for reconstruction. We consider an ∞-dimensional set of possible reconstruction coordinate systems that include time delays, derivatives, and many other possible coordinates; and any optimality criterion is specified as a real valued functional on this space. We present a method for finding the optima using a learning algorithm based upon the genetic algorithm and evolutionary programming. The learning algorithm machinery for finding optimal representations is independent of the definition of optimality, and thus provides a general tool useful in a wide variety of contexts.

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.

SYNCHRONIZATION CRITERIA FOR TWO BOOLEAN NETWORKS BASED ON LOGICAL CONTROL

2013 ◽  
Vol 23 (11) ◽  
pp. 1350178 ◽  
Author(s):  
HONGWEI CHEN ◽  
YANG LIU ◽  
JIANQUAN LU
Keyword(s):  
Sufficient Conditions ◽  
Open Loop ◽  
Boolean Networks ◽  
Space Representation ◽  
Complete Synchronization ◽  
Loop Control ◽  
State Space Representation ◽  
Logic Control ◽  
Logical Control ◽  
Necessary And Sufficient

This paper investigates the complete synchronization of two Boolean networks via logic control. Both feedback control and open-loop control are proposed to make the slave network completely synchronized with the master Boolean network. Using the algebraic state-space representation of Boolean networks, we derive several necessary and sufficient conditions for complete synchronization between two Boolean networks. Two examples are given to illustrate the obtained results.

Synchronization of switched Boolean networks with impulsive effects

2018 ◽  
Vol 11 (06) ◽  
pp. 1850080 ◽  
Author(s):  
Xiaojing Xu ◽  
Yansheng Liu ◽  
Haitao Li ◽  
Fuad E. Alsaadi
Keyword(s):  
Sufficient Conditions ◽  
Boolean Networks ◽  
The State ◽  
Impulsive Effects ◽  
Space Representation ◽  
Algebraic Form ◽  
State Space Representation ◽  
Switching Signal ◽  
Output Synchronization ◽  
Necessary And Sufficient

This paper studies the state/output synchronization of switched Boolean networks (SBNs) with impulsive effects via the algebraic state space representation (ASSR) approach. First, an algebraic form is established for SBNs with impulsive effects via ASSR. Second, based on the algebraic form, some necessary and sufficient conditions are presented for the state/output synchronization of SBNs with impulsive effects under arbitrary switching signals. Third, two special kinds of switching signals, that is, free switching signal and feedback switching signal, are considered for the state synchronization of SBNs with impulsive effects. Finally, two illustrative examples are worked out to show the effectiveness of the obtained results.

A STATE SPACE CANONICAL FORM FOR UNIT ROOT PROCESSES

2012 ◽  
Vol 28 (6) ◽  
pp. 1313-1349 ◽  
Author(s):  
Dietmar Bauer ◽  
Martin Wagner
Keyword(s):  
State Space ◽  
Unit Root ◽  
Cointegration Analysis ◽  
Space Representation ◽  
Major Purpose ◽  
State Space Representation ◽  
State Process ◽  
Canonical State ◽  
Polynomial Cointegration ◽  
Definition Of

In this paper we develop a canonical state space representation of autoregressive moving average (ARMA) processes with unit roots with integer integration orders at arbitrary unit root frequencies. The developed representation utilizes a state process with a particularly simple dynamic structure, which in turn renders this representation highly suitable for unit root, cointegration, and polynomial cointegration analysis. We also propose a new definition of polynomial cointegration that overcomes limitations of existing definitions and extends the definition of multicointegration for I(2) processes of Granger and Lee (1989a, Journal of Applied Econometrics4, 145–159). A major purpose of the canonical representation for statistical analysis is the development of parameterizations of the sets of all state space systems of a given system order with specified unit root frequencies and integration orders. This is, e.g., useful for pseudo maximum likelihood estimation. In this respect an advantage of the state space representation, compared to ARMA representations, is that it easily allows one to put in place restrictions on the (co)integration properties. The results of the paper are exemplified for the cases of largest interest in applied work.

The Construct Validity Of Creativity : Empirical Arguments in Favor of Novelty as the Basis for Creativity

2020 ◽  
Author(s):  
Nicolas Pichot ◽  
Eric Bonetto ◽  
Jean-Baptiste Pavani ◽  
Thomas Arciszewski ◽  
Nathalie Bonnardel ◽  
...  
Keyword(s):  
Construct Validity ◽  
Semantic Analysis ◽  
Scientific Research ◽  
Logical Analysis ◽  
Standard Definition ◽  
Single Criterion ◽  
Considerable Debate ◽  
Necessary And Sufficient Criteria ◽  
Definition Of ◽  
Necessary And Sufficient

In scientific research on creativity, there has been considerable debate concerning the criteria by which a production can be judged more or less creative, that is, about the definition of creativity. The most frequent definition – the standard definition – incorporates the criteria of novelty and value. However, other definitions, based on a single criterion or on more than two criteria, have also been proposed. Much of the discussion of this issue has been based on semantic analysis, a logical analysis of the concepts involved and the usefulness of the various proposed criteria. In this article, question of the necessary and sufficient criteria for defining creativity is approached from an empirical (i.e., psychometric) perspective. The studies that are examined here converge on the idea that the standard definition is not internally consistent, because its two proposed criteria (i.e., novelty and value) are largely independent. Moreover, judgments of the creativity of an object seem to be explained mainly by its novelty, which suggests the possible sufficiency of that criterion. These results are consistent with the intentional novelty definition proposed recently by Weisberg (2015, 2018).

scholarly journals A Note on the Observability of Temporal Boolean Control Network

2013 ◽  
Vol 2013 ◽  
pp. 1-9 ◽  
Author(s):  
Wenping Shi ◽  
Bo Wu ◽  
Jing Han
Keyword(s):  
Boolean Network ◽  
Sufficient Conditions ◽  
Boolean Networks ◽  
Control Networks ◽  
Linear Dynamic Systems ◽  
Regulatory Interactions ◽  
Boolean Control Network ◽  
Boolean Network Model ◽  
Necessary And Sufficient ◽  
Product Of Matrices

Temporal Boolean network is a generalization of the Boolean network model that takes into account the time series nature of the data and tries to incorporate into the model the possible existence of delayed regulatory interactions among genes. This paper investigates the observability problem of temporal Boolean control networks. Using the semi tensor product of matrices, the temporal Boolean networks can be converted into discrete time linear dynamic systems with time delays. Then, necessary and sufficient conditions on the observability via two kinds of inputs are obtained. An example is given to illustrate the effectiveness of the obtained results.

scholarly journals Structural Controllability of Boolean Control Networks under Partial Information

Complexity ◽  
2021 ◽  
Vol 2021 ◽  
pp. 1-9
Author(s):  
Qinyao Pan ◽  
Jie Zhong ◽  
Shalin Tong ◽  
Bowen Li ◽  
Xiaoxu Liu
Keyword(s):  
Boolean Functions ◽  
Partial Information ◽  
Sufficient Conditions ◽  
Vital Role ◽  
Boolean Networks ◽  
Lactose Operon ◽  
Control Networks ◽  
Structural Controllability ◽  
Necessary And Sufficient ◽  
Theoretical Results

It is worth noting that both nodes’ coupling connections and logical updating functions play a vital role in state evolutions of Boolean networks (BNs). In this paper, a new concept named structural controllability (SC) about Boolean control networks (BCNs) with known partial information on nodes’ connections is studied. Then, by referring to semi-tensor product (STP) techniques, several types of SC are presented according to different issues of Boolean functions. Thereafter, several necessary and sufficient conditions are derived for SC of BCNs. Finally, a biological model of the lactose operon in Escherichia coli is simulated to show the effectiveness of the main theoretical results.

Sign in / Sign up

Export Citation Format

Share Document