Related papers: Fault detection and isolation for linear structure…
This paper addresses the design of input signals for the purpose of discriminating among a finite set of models dynamic systems within a given finite time interval. A motivating application is fault detection and isolation. We propose…
Consider that a linear time-invariant (LTI) plant is given and that we wish to design a stabilizing controller for it. Admissible controllers are LTI and must comply with a pre-selected sparsity pattern. The sparsity pattern is assumed to…
This paper proposes a novel distributed interval observer design for linear time-invariant (LTI) discrete-time systems subject to bounded disturbances. In the proposed observer algorithm, each agent in a networked group exchanges…
The irrelevant vertex technique provides a powerful tool for the design of parameterized algorithms for a wide variety of problems on graphs. A common characteristic of these problems, permitting the application of this technique on…
In this paper, we study the nonnegative matrix factorization problem under the separability assumption (that is, there exists a cone spanned by a small subset of the columns of the input nonnegative data matrix containing all columns),…
An integer linear system (ILS) is a linear system with integer constraints. The solution graph of an ILS is defined as an undirected graph defined on the set of feasible solutions to the ILS. A pair of feasible solutions is connected by an…
This article addresses the following problems: 1) First, a nonlinearity analysis is made looking for the presence of nonlinearities in an early phase of the identification process. The level and the nature of the nonlinearities should be…
In order to improve the fault diagnosis capability of multivariate statistical methods, this article introduces a fault isolation framework based on structured sparsity modeling. The developed method relies on the reconstruction based…
Observability of an array of identical LTI systems with incommensurable output matrices is studied, where an array is called observable when identically zero relative outputs imply synchronized solutions for the individual systems. It is…
Sparse matrix factorization is the problem of approximating a matrix $\mathbf{Z}$ by a product of $J$ sparse factors $\mathbf{X}^{(J)} \mathbf{X}^{(J-1)} \ldots \mathbf{X}^{(1)}$. This paper focuses on identifiability issues that appear in…
Identifiability and sloppiness are investigated in this paper for the parameters of a descriptor system based on its frequency response samples. Two metrics are suggested respectively for measuring absolute and relative sloppiness of the…
A resolving set for a simple graph $G$ is a subset of vertex set of $G$ such that it distinguishes all vertices of $G$ using the shortest distance from this subset. This subset is a metric basis if it is the smallest set with this property.…
This paper studies the open problem of conformalized entry prediction in a row/column-exchangeable matrix. The matrix setting presents novel and unique challenges, but there exists little work on this interesting topic. We meticulously…
We give a combinatorial condition for the existence of efficient, LP-based FPT algorithms for a broad class of graph-theoretical optimisation problems. Our condition is based on the notion of biased graphs known from matroid theory.…
A representative set of fault diagnosis problems is formulated for linear time-invariant systems with additive faults. For all formulated problems, general existence conditions of their solutions are given. An overview of recent…
We analyze the problem of network identifiability with nonlinear functions associated with the edges. We consider a static model for the output of each node and by assuming a perfect identification of the function associated with the…
We consider a nonlinear non-autonomous system with time-varying delays $$ \dot{x_i}(t)=-a_i(t)x_{i}(h_i(t))+\sum_{j=1}^mF_{ij}(t,x_j(g_{ij}(t))) $$ which has a large number of applications in the theory of artificial neural networks. Via…
In structured system theory, a pattern matrix is a matrix with entries either fixed to zero or free to take arbitrary numbers. The (generic) rank of a pattern matrix is the rank of almost all its realizations. The resilience of various…
FDI (False Data Injection) attacks are critical to address as they can compromise the integrity and reliability of data in cyber-physical systems, leading to potentially severe consequences in sectors such as power systems. The feasibility…
This paper investigates the robust stability and stabilization analysis of interval fractional-order systems with time-varying delay. The stability problem of such systems is solved first, and then using the proposed results a stabilization…