Related papers: On the Complexity of a Matching Problem with Asymm…
Hybrid systems are characterized by having an interaction between continuous dynamics and discrete events. The contribution of this paper is to provide hybrid systems with a novel geometric formulation so that controls can be added. Using…
Understanding conformational change is crucial for programming and controlling the function of many mechanical systems such as allosteric enzymes and tunable metamaterials. Of particular interest is the relationship between the network…
Structural controllability has been proposed as an analytical framework for making predictions regarding the control of complex networks across myriad disciplines in the physical and life sciences (Liu et al., Nature:473(7346):167-173,…
In recent papers it has been suggested that human locomotion may be modeled as an inverse optimal control problem. In this paradigm, the trajectories are assumed to be solutions of an optimal control problem that has to be determined. We…
Optimization problems consist of either maximizing or minimizing an objective function. Instead of looking for a maximum solution (resp. minimum solution), one can find a minimum maximal solution (resp. maximum minimal solution). Such…
In this paper we consider an optimal control problem (OCP) for the coupled system of a nonlinear monotone Dirichlet problem with matrix- valued non-smooth controls in coefficients and a nonlinear equation of Ham- merstein type. Since…
In the recent years, several polynomial algorithms of a dynamical nature have been proposed to address the graph isomorphism problem. In this paper we propose a generalization of an approach exposed in cond-mat/0209112 and find that this…
A large-scale complex system comprising many, often spatially distributed, dynamical subsystems with partial autonomy and complex interactions are called system of systems. This paper describes an efficient algorithm for model predictive…
A matching $M$ is a $\mathscr{P}$-matching if the subgraph induced by the endpoints of the edges of $M$ satisfies property $\mathscr{P}$. As examples, for appropriate choices of $\mathscr{P}$, the problems Induced Matching, Uniquely…
We introduce a dynamic model for complexity control (CC) between systems, represented by time series characterized by different temporal complexity measures, as indicated by their respective inverse power law (IPL) indices. Given the…
Controlling continuous-time dynamical systems is generally a two step process: first, identify or model the system dynamics with differential equations, then, minimize the control objectives to achieve optimal control function and optimal…
We give a complexity dichotomy theorem for the counting Constraint Satisfaction Problem (#CSP in short) with complex weights. To this end, we give three conditions for its tractability. Let F be any finite set of complex-valued functions,…
Although the set of permutation symmetries of a complex network can be very large, few of the symmetries give rise to stable synchronous patterns. Here we present a new framework and develop techniques for controlling synchronization…
In this note, we investigate the structural controllability and observability indices of structured systems. We provide counter-examples showing that an existing graph-theoretic characterization for the structural controllability index…
The paper focuses on two problems: (i) how to orient the edges of an undirected graph in order to maximize the number of ordered vertex pairs (x,y) such that there is a directed path from x to y, and (ii) how to orient the edges so as to…
Influence diagram is a graphical representation of belief networks with uncertainty. This article studies the structural properties of a probabilistic model in an influence diagram. In particular, structural controllability theorems and…
Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. Previous efforts for exact algorithms have been unable to avoid structural problems that appear for…
This paper studies the controllability backbone problem in dynamical networks defined over graphs. The main idea of the controllability backbone is to identify a small subset of edges in a given network such that any subnetwork containing…
Symmetric spaces arise in wide variety of problems in Mathematics and Physics. They are mostly studied in Representation theory, Harmonic analysis and Differential geometry. As many physical systems have symmetric spaces as their…
The graph is one of the most widely used mathematical structures in engineering and science because of its representational power and inherent ability to demonstrate the relationship between objects. The objective of this work is to…