Related papers: Chaotic Observer-based Synchronization Under Infor…
We address the multi-satellite scheduling problem with limited observation capacities that arises from the need to observe a set of targets on the Earth's surface using imaging resources installed on a set of satellites. We define and…
We examine synchronization of identical chaotic systems coupled in a drive/response manner. A rigorous criterion is presented which, if satisfied, guarantees that synchronization to the driving trajectory is linearly stable to…
Through numerical simulations we analyze the synchronization time and the Lyapunov dimension of a coupled map lattice consisting of a chain of chaotic logistic maps exhibiting power law interactions. From the observed behaviors we find a…
We consider spatially coupled code ensembles over a multiple access channel. Convolutional LDPC ensembles are one instance of spatially coupled codes. It was shown recently that, for transmission over the binary erasure channel, this…
We study the spatio-temporal behavior of simple coupled map lattices with periodic boundary conditions. The local dynamics is governed by two maps, namely, the sine circle map and the logistic map respectively. It is found that even though…
Large language models hallucinate in predictable ways: attention routing fails by over-concentrating on a narrow set of positions, or by spreading so diffusely that relevance is diluted, and the shape of the failure carries diagnostic…
We study a network of coupled logistic maps whose interactions occur with a certain distribution of delay times. The local dynamics is chaotic in the absence of coupling and thus the network is a paradigm of a complex system. There are two…
The problem of distributed testing against independence with variable-length coding is considered when the \emph{average} and not the \emph{maximum} communication load is constrained as in previous works. The paper characterizes the optimum…
This paper develops an optimal relative output-feedback based solution to the containment control problem of linear heterogeneous multi-agent systems. A distributed optimal control protocol is presented for the followers to not only assure…
The synchronization of coupled chaotic systems represents a fundamental example of self organization and collective behavior. This well-studied phenomenon is classically characterized in terms of macroscopic parameters, such as Lyapunov…
The upper bound on the capacity of a 3-node discrete memoryless relay channel is considered, where a source X wants to send information to destination Y with the help of a relay Z. Y and Z are independent given X, and the link from Z to Y…
This paper studies a network of observers for a distributed estimation problem, where each observer assesses a portion of output of a given LTI system. The goal of each observer is to compute a state estimate that asymptotically converges…
We consider optimal control of decentralized LQG problems for plants controlled by two players having asymmetric information sharing patterns between them. In one scenario, players are assumed to have a bidirectional error-free, unlimited…
A linear output feedback control scheme is developed for a coupled map lattice system. H-infinity control theory is used to make the scheme local: both the collection of information and the feedback are implemented through an array of…
Load balancing across parallel servers is an important class of congestion control problems that arises in service systems. An effective load balancer relies heavily on accurate, real-time congestion information to make routing decisions.…
A fundamental problem in traffic networks is driving under safety and limited physical space constraints. In this paper, we design longitudinal vehicle controllers and study the dynamics of a system of homogeneous vehicles on a single-lane…
The problem of computing a linear combination of sources over a multiple access channel is studied. Inner and outer bounds on the optimal tradeoff between the communication rates are established when encoding is restricted to random…
The capacity of time-varying channels with periodic feedback at the transmitter is evaluated. It is assumed that the channel state information is perfectly known at the receiver and is fed back to the transmitter at the regular…
We study the computational phase transition in a multi-frequency group synchronization problem, where pairwise relative measurements of group elements are observed across multiple frequency channels and corrupted by Gaussian noise. Using…
We derive an information-theoretic lower bound for sample complexity in sparse recovery problems where inputs can be chosen sequentially and adaptively. This lower bound is in terms of a simple mutual information expression and unifies many…