Related papers: Computation of maximal reachability submodules
Given a dynamical system with constrained outputs, the maximal admissible set (MAS) is defined as the set of all initial conditions such that the output constraints are satisfied for all time. It has been previously shown that for…
In this paper, we address the problem of computing the maximal admissible robust positive invariant (MARPI) set for discrete-time linear time-varying systems with parametric uncertainties and additive disturbances. The system state and…
In this article we introduce a solution method for a special class of nonlinear initial-value problems using set-based propagation techniques. The novelty of the approach is that we employ a particular embedding (Carleman linearization) to…
We study a stochastic variant of monotone submodular maximization problem as follows. We are given a monotone submodular function as an objective function and a feasible domain defined on a finite set, and our goal is to find a feasible…
We classify certain resolving subcategories of finitely generated modules over a commutative noetherian ring R by using integer-valued functions on Spec R. As an application we give a complete classification of resolving subcategories when…
Understanding how systems built out of modular components can be jointly optimized is an important problem in biology, engineering, and machine learning. The backpropagation algorithm is one such solution and has been instrumental in the…
In this paper, the output reachable estimation and safety verification problems for multi-layer perceptron neural networks are addressed. First, a conception called maximum sensitivity in introduced and, for a class of multi-layer…
The submodular knapsack problem (SKP), which seeks to maximize a submodular set function by selecting a subset of elements within a given budget, is an important discrete optimization problem. The majority of existing approaches to solving…
The high-performance scalable parallel algorithm for rigorous calculation of partition function of lattice systems with finite number Ising spins was developed. The parallel calculations run by C++ code with using of Message Passing…
In this paper we consider parallelization for applications whose objective can be expressed as maximizing a non-monotone submodular function under a cardinality constraint. Our main result is an algorithm whose approximation is arbitrarily…
This paper studies reachability and null-controllability for difference inclusions involving convex processes. Such difference inclusions arise, for instance, in the study of linear discrete-time systems whose inputs and/or states are…
In the scope of discrete finite-state models of interacting components, we present a novel algorithm for identifying sets of local states of components whose activity is necessary for the reachability of a given local state. If all the…
Mean field inference in probabilistic models is generally a highly nonconvex problem. Existing optimization methods, e.g., coordinate ascent algorithms, can only generate local optima. In this work we propose provable mean filed methods for…
For a given smooth manifold, we consider the moduli space of Riemannian metrics up to isometry and scaling. One can define a preorder on the moduli space by the size of isometry groups. We call a Riemannian metric that attains a maximal…
The safety region of operation of a system is the subset of allowed outputs for which no undesirable outcome would occur. Knowing if a system would ever leave its safety regions of operation is important information for the planning and…
We consider the path approximation of Bessel processes and develop a new and efficient algorithm. This study is based on a recent work by the authors, on the path approximation of the Brownian motion, and on the construction of specific own…
A depiction of a nonnoetherian integral domain $R$ is a special coordinate ring that provides a framework for describing the geometry of $R$. We show that if $R$ is noetherian in codimension 1, then $R$ has a unique maximal depiction $T$.…
This work provides performance guarantees for the greedy solution of experimental design problems. In particular, it focuses on A- and E-optimal designs, for which typical guarantees do not apply since the mean-square error and the maximum…
We give the first algorithm for testing the feasibility of a system of sporadic real-time tasks on a set of identical processors, solving one major open problem in the area of multiprocessor real-time scheduling [S.K. Baruah and K. Pruhs,…
A multiple knapsack constraint over a set of items is defined by a set of bins of arbitrary capacities, and a weight for each of the items. An assignment for the constraint is an allocation of subsets of items to the bins which adheres to…