TaBooN -- Boolean Network Synthesis Based on Tabu Search

Recent developments in Omics-technologies revolutionized the investigation of biology by producing molecular data in multiple dimensions and scale. This breakthrough in biology raises the crucial issue of their interpretation based on modelling. In this undertaking, network provides a suitable framework for modelling the interactions between molecules. Basically a Biological network is composed of nodes referring to the components such as genes or proteins, and the edges/arcs formalizing interactions between them. The evolution of the interactions is then modelled by the definition of a dynamical system. Among the different categories of network, the Boolean network offers a reliable qualitative framework for the modelling. Automatically synthesizing a Boolean network from experimental data therefore remains a necessary but challenging issue. In this study, we present taboon, an original work-flow for synthesizing Boolean Networks from biological data. The methodology uses the data in the form of Boolean profiles for inferring all the potential local formula inference. They combine to form the model space from which the most truthful model with regards to biological knowledge and experiments must be found. In the taboon work-flow the selection of the fittest model is achieved by a Tabu-search algorithm. taboon is an automated method for Boolean Network inference from experimental data that can also assist to evaluate and optimize the dynamic behaviour of the biological networks providing a reliable platform for further modelling and predictions

On resilient control of dynamical flow networks

Resilience has become a key aspect in the design of contemporary infrastructure networks. This comes as a result of ever-increasing loads, limited physical capacity, and fast-growing levels of interconnectedness and complexity due to the recent technological advancements. The problem has motivated a considerable amount of research within the last few years, particularly focused on the dynamical aspects of network flows, complementing more classical static network flow optimization approaches.In this tutorial paper, a class of single-commodity first-order models of dynamical flow networks is considered. A few results recently appeared in the literature and dealing with stability and robustness of dynamical flow networks are gathered and originally presented in a unified framework. In particular, (differential) stability properties of monotone dynamical flow networks are treated in some detail, and the notion of margin of resilience is introduced as a quantitative measure of their robustness. While emphasizing methodological aspects -including structural properties, such as monotonicity, that enable tractability and scalability- over the specific applications, connections to well-established road traffic flow models are made

Asynchronous switching control for fuzzy Markov jump systems with periodically varying delay and its application to electronic circuits

This article focuses on addressing the issue of asynchronous H∞ control for Takagi-Sugeno (T-S) fuzzy Markov jump systems with generally incomplete transition probabilities (TPs). The delay is assumed to vary periodically, resulting in one monotonically increasing interval and one monotonically decreasing interval during each period. Meanwhile, a new Lyapunov-Krasovskii functional (LKF) is devised, which depends on membership functions (MFs) and two looped functions formulated for the monotonic intervals. Since the modes and TPs of the original system are assumed to be unavailable, an asynchronous switching fuzzy controller on the basis of hidden Markov model is proposed to stabilize the fuzzy Markov jump systems (FMJSs) with generally incomplete TPs. Consequently, a stability criterion with improved practicality and reduced conservatism is derived, ensuring the stochastic stability and H∞ performance of the closed-loop system. Finally, this technique is employed to the tunnel diode circuit system, and a comparison example is given, which verifies the practicality and superiority of the method

Structure-Preserving Model Reduction of Physical Network Systems

This paper considers physical network systems where the energy storage is naturally associated to the nodes of the graph, while the edges of the graph correspond to static couplings. The first sections deal with the linear case, covering examples such as mass-damper and hydraulic systems, which have a structure that is similar to symmetric consensus dynamics. The last section is concerned with a specific class of nonlinear physical network systems; namely detailed-balanced chemical reaction networks governed by mass action kinetics. In both cases, linear and nonlinear, the structure of the dynamics is similar, and is based on a weighted Laplacian matrix, together with an energy function capturing the energy storage at the nodes. We discuss two methods for structure-preserving model reduction. The first one is clustering; aggregating the nodes of the underlying graph to obtain a reduced graph. The second approach is based on neglecting the energy storage at some of the nodes, and subsequently eliminating those nodes (called Kron reduction).</p