相关论文: Connections between Linear Systems and Convolution…

A linear constraint loop is specified by a system of linear inequalities that define the relation between the values of the program variables before and after a single execution of the loop body. In this paper we consider the problem of…

We consider controllability for divergence-free systems that have a conserved quantity and satisfy a H\"ormander condition. It is shown that such systems are controllable, provided that the conserved quantity is a proper function. The proof…

The Turing machine is one of the simple abstract computational devices that can be used to investigate the limits of computability. In this paper, they are considered from several points of view that emphasize the importance and the…

Linear code with complementary dual($LCD$) are those codes which meet their duals trivially. In this paper we will give rather alternative proof of Massey's theorem\cite{Massey2}, which is one of the most important characterization of $LCD$…

This article is dedicated to improve the controllability results obtained by Cerpa et al. in Commun. Contemp. Math 13 (2011) and by Micu et al. in Commun. Contemp. Math 11 (5) (2009) for a nonlinear coupled system of two Korteweg-de Vries…

In this paper we consider a class of linear time invariant systems with infinitely many unstable modes. By using the parameterization of all stabilizing controllers, we show that H-infinity controllers for such systems can be computed using…

The control of bilinear systems has attracted considerable attention in the field of systems and control for decades, owing to their prevalence in diverse applications across science and engineering disciplines. Although much work has been…

Converse optimality theory addresses an optimal control problem conversely where the system is unknown and the value function is chosen. Previous work treated this problem both in continuous and discrete time and non-extensively considered…

It is known that maximum distance separable and maximum distance profile convolutional codes exist over large enough finite fields of any characteristic for all parameters $(n,k,\delta)$. It has been conjectured that the same is true for…

First-order temporal logics are notorious for their bad computational behaviour. It is known that even the two-variable monadic fragment is highly undecidable over various linear timelines, and over branching time even one-variable…

We consider the problem of finite-horizon optimal control design under uncertainty for imperfectly observed discrete-time systems with convex costs and constraints. It is known that this problem can be cast as an infinite-dimensional convex…

In this paper, we introduce the concept of observability of targeted state variables for systems that may not be fully observable. For their estimation, we introduce and exemplify a deep filter, which is a neural network specifically…

Finding separable certificates of stability is important for tractability of analysis methods for large-scale networked systems. In this paper we consider the question of when a nonlinear system which is contracting, i.e. all solutions are…

The analysis and proper documentation of the properties of closed-loop control software presents many distinct aspects from the analysis of the same software running open-loop. Issues of physical system representations arise, and it is…

Subexponential logic is a variant of linear logic with a family of exponential connectives--called subexponentials--that are indexed and arranged in a pre-order. Each subexponential has or lacks associated structural properties of weakening…

We identify a decidable synthesis problem for a class of programs of unbounded size with conditionals and iteration that work over infinite data domains. The programs in our class use uninterpreted functions and relations, and abide by a…

Is undecidability a requirement for open-ended evolution (OEE)? Using methods derived from algorithmic complexity theory, we propose robust computational definitions of open-ended evolution and the adaptability of computable dynamical…

In this paper, we explore a connection between binary hierarchical models, their marginal polytopes and codeword polytopes, the convex hulls of linear codes. The class of linear codes that are realizable by hierarchical models is…

We construct meta-intransitive systems of independent random variables of any finite order from basic tuple of random variables which generalize intransitive dice. Under this construction, the equality of some linear functional is…

We present an extension of Willems' Fundamental Lemma to the class of multi-input multi-output discrete-time feedback linearizable nonlinear systems, thus providing a data-based representation of their input-output trajectories. Two sources…