Related papers: Partial-realization theory and algorithms for line…
We present a method that connects a well-established nonlinear (bilinear) identification method from time-domain data with neural network (NNs) advantages. The main challenge for fitting bilinear systems is the accurate recovery of the…
Electronics has changed greatly during recent decades, and some its basic concepts should be revisited. Starting from the sampling procedure, we consider some mathematical, physical and engineering aspects related to singular, mainly…
Interconnected dynamic systems are a pervasive component of our modern infrastructures. The complexity of such systems can be staggering, which motivates simplified representations for their manipulation and analysis. This work introduces…
This paper deals with reduction of non-homogeneous linear systems of first order operator equations with constant coefficients. An equivalent reduced system, consisting of higher order linear operator equations having only one variable and…
Motivated by the fact that transfer functions do not contain structural information about networks, dynamical structure functions were introduced to capture causal relationships between measured nodes in networks. From the dynamical…
This paper deals with learning stability of partially observed switched linear systems under arbitrary switching. Such systems are widely used to describe cyber-physical systems which arise by combining physical systems with digital…
We consider the transfer functions describing the input-output relation for a class of linear open quantum systems involving feedback with nonzero time delays. We show how such transfer functions can be factorized into a product of terms…
Linearizability is the commonly accepted notion of correctness for concurrent data structures. It requires that any execution of the data structure is justified by a linearization --- a linear order on operations satisfying the data…
The issue of realization of the transfer functions of Linear Quantum Stochastic Systems (LQSSs) is of fundamental importance for the practical applications of such systems, especially as coherent controllers for other quantum systems. So…
Partial incorrectness logic (partial reverse Hoare logic) has recently been introduced as a new Hoare-style logic that over-approximates the weakest pre-conditions of a program and a post-condition. It is expected to verify systems where…
We describe a physical implementation of a quantum finite automaton recognizing a well known family of periodic languages. The realization exploits the polarization degree of freedom of single photons and their manipulation through linear…
$\ell_1$ optimization is a well known heuristic often employed for solving various forms of sparse linear problems. In this paper we look at its a variant that we refer to as the \emph{partial} $\ell_1$ and discuss its mathematical…
This study is concerned with the problem of partial state estimation for linear time-invariant (LTI) distributed state-space systems. A necessary and sufficient condition is established in terms of a simple rank criterion involving the…
We propose a new quantifier elimination algorithm for the theory of linear real arithmetic. This algorithm uses as subroutine satisfiability modulo this theory, a problem for which there are several implementations available. The quantifier…
This paper proposes a tractable framework to determine key characteristics of non-linear dynamic systems by converting physics-informed neural networks to a mixed integer linear program. Our focus is on power system applications.…
We consider partial and total reduction of a nonhomogeneous linear system of the operator equations with the system matrix in the same particular form as in paper [N. Shayanfar, M. Hadizadeh 2013]. Here we present two different concepts.…
A fundamental concept in control theory is that of controllability, where any system state can be reached through an appropriate choice of control inputs. Indeed, a large body of classical and modern approaches are designed for controllable…
Tensor completion is a natural higher-order generalization of matrix completion where the goal is to recover a low-rank tensor from sparse observations of its entries. Existing algorithms are either heuristic without provable guarantees,…
This paper proposes a finitely terminating algorithm to solve reach-and-stay control problems for nonlinear systems. The algorithm is guaranteed to return a control strategy if the specification is robustly realizable. Such a feature is…
This paper presents a quantum algorithm for efficiently computing partial sums and specific weighted partial sums of quantum state amplitudes. Computation of partial sums has important applications, including numerical integration,…