Related papers: A note on the state-space realizations equivalence
We settle the equivalence between the problem of hitting a polyhedral set by the orbit of a linear map and the intersection of a regular language and a language of permutations of binary words (the permutation filter realizability problem).…
In the past few years, the research on sober spaces and well-filtered spaces has got some breakthrough progress. In this paper, we shall present a brief summarising survey on some of such development. Furthermore, we shall pose and…
We derive sufficient conditions for the solvability of the state estimation problem for a class of nonlinear control time-varying systems which includes those, whose dynamics have triangular structure. The state estimation is exhibited by…
We here characterize the minimality of realization of arbitrary linear time-invariant dynamical systems through (i) intersection of the spectra of the realization matrix and of the corresponding state submatrix and (ii) moving the poles by…
We analyze the trade-off between the amounts of information obtainable on complementary properties of a qubit state by simultaneous measurements. We consider a "state discrimination" scenario wherein the same measurements are repeated, but…
This article presents an equivalent formulation of the implicit complementarity problem. We demonstrate that solution of the equivalent formulation is equivalent to the solution of the implicit complementarity problem. Moreover, we provide…
We establish Rezk completion functors for $\Theta_n$-spaces with respect to each and all of the completeness conditions. As a consequence, we obtain a characterization completeness of Segal $\Theta_n$-spaces as locality with respect to…
We propose a solution to a time-varying variant of Markov Decision Processes which can be used to address decision-theoretic planning problems for autonomous systems operating in unstructured outdoor environments. We explore the time…
This paper introduces factored conditional filters, new filtering algorithms for simultaneously tracking states and estimating parameters in high-dimensional state spaces. The conditional nature of the algorithms is used to estimate…
Matrix factorization from a small number of observed entries has recently garnered much attention as the key ingredient of successful recommendation systems. One unresolved problem in this area is how to adapt current methods to handle…
In this note, we uncover three connections between the metric distortion problem and voting methods and axioms from the social choice literature.
We present the conditions under which probabilistic error-free discrimination of mixed states is possible, and provide upper and lower bounds on the maximum probability of success for the case of two mixed states. We solve certain special…
The problem of quantum state filtering consists of determining whether an unknown quantum state, which is chosen from a known set of states, is either a particular, specified state, or not. We consider this problem for the case that the…
A connection between the state estimation problem and the separability problem is noticed and exploited to find efficient numerical algorithms to solve the first one. Based on these ideas, we also derive a systematic method to obtain upper…
This is a short note with some (very elementary) remarks concerning realization theory and the choice of inputs for identifying systems. Its goal is to bring some of these facts to the attention of the systems biology community.
A symplectic realization and some symmetries of a Rikitake type system are presented.
Probabilistic quantum state transformations can be characterized by the degree of state separation they provide. This, in turn, sets limits on the success rate of these transformations. We consider optimum state separation of two known pure…
We study completeness of a topological vector space with respect to different filters on the set N of all naturals. In the metrizable case all these kinds of completeness are the same, but in non-metrizable case the situation changes. For…
The task of artificial intelligence is to provide representation techniques for describing problems, as well as search algorithms that can be used to answer our questions. A widespread and elaborated model is state-space representation,…
In this letter, by regarding finite-time stability as an inverse problem, we reveal the essence of finite-time stability and fixed-time stability. Some necessary and sufficient conditions are given. As application, we give a new approach…