Related papers: A rigorous evaluation of the intermittence in the …
Today, data analysts largely rely on intuition to determine whether missing or withheld rows of a dataset significantly affect their analyses. We propose a framework that can produce automatic contingency analysis, i.e., the range of values…
Suboptimal methods in optimal control arise due to a limited computational budget, unknown system dynamics, or a short prediction window among other reasons. Although these methods are ubiquitous, their transient performance remains…
The possibility to study intermittency in a single event of high multiplicity is investigated in the framework of the $\alpha-$model. It is found that, for cascade long enough, the dispersion of intermittency exponents obtained from…
Two-stage methods addressing continuous shortest path problems start local minimization from discrete shortest paths in a spatial graph. The convergence of such hybrid methods to global minimizers hinges on the discretization error induced…
Real-world evaluation of perception-based planning models for robotic systems, such as autonomous vehicles, can be safely and inexpensively conducted offline, i.e. by computing model prediction error over a pre-collected validation dataset…
We study a random logistic map $x_{t+1} = a_{t} x_{t}[1-x_{t}]$ where $a_t$ are bounded ($q_1 \leq a_t \leq q_2$), random variables independently drawn from a distribution. $x_t$ does not show any regular behaviour in time. We find that…
In this work we use intersection of different pseudo-orbits obtained by interval extensions to reduce the bounds of the exact solution provided by the toolbox Intlab. The method is applied on the logistic map.
We study the problem of system identification for stochastic continuous-time dynamics, based on a single finite-length state trajectory. We present a method for estimating the possibly unstable open-loop matrix by employing properly…
For interdependent networks with identity dependency map, percolation is exactly the same with that on a single network and follows a second-order phase transition, while for random dependency, percolation follows a first-order phase…
A key trait of stochastic optimizers is that multiple runs of the same optimizer in attempting to solve the same problem can produce different results. As a result, their performance is evaluated over several repeats, or runs, on the…
A proper discretization of the logistic differential equation, which is preserving these two distinct equilibrium solutions and their unstability and stability, suggest that we need to examine the time delay of the logistic map. According…
Critical intermittency stands for a type of intermittent dynamics in iterated function systems, caused by an interplay of a superstable fixed point and a repelling fixed point. We consider critical intermittency for iterated function…
In this paper, we study the problem of continuous-time state observation over lossy communication networks. We consider the situation in which the samplers for measuring the output of the plant are spatially distributed and their…
The full family of discrete logistic maps has been widely studied both as a canonical example of the period-doubling route to chaos, and as a model of natural processes. In this paper we present a study of the stochastic process described…
Intermodal logistics typically include the successive stages of intermodal shipment and last-mile delivery. We investigate this problem under a novel Logic-Based Benders Decomposition, which exploits the staged nature of the problem to…
We study the phenomenon of intermittency in inhomogeneous lattices of coupled map where inhomogeneity appears in the form of different values of map parameters at adjacent sites.The system exhibits spatiotemporal intermittency in various…
We introduce an effective algorithmic method for the computation of a lower bound for uniform expansion in one-dimensional dynamics. The approach employs interval arithmetic and thus provides a rigorous numerical result (computer-assisted…
This paper focuses on the analysis of real-time non preemptive multiprocessor scheduling with precedence and several latency constraints. It aims to specify a schedulability condition which enables a designer to check a priori -without…
Control schemes for autonomous systems are often designed in a way that anticipates the worst case in any situation. At runtime, however, there could exist opportunities to leverage the characteristics of specific environment and operation…
In many applications of optimal transport (OT), the object of primary interest is the optimal transport map. This map rearranges mass from one probability distribution to another in the most efficient way possible by minimizing a specified…