One of the ultimate goals future wireless networks is to maximize data rates accommodate bandwidth-hungry services and applications. Thus, extracting maximum amount information bits for given spatial constraints when designing systems will be great importance. In this paper, we present antenna array topologies that communication channel capacity number elements while occupying minimum space. Ca...

A bstract We propose entropic order parameters that capture the physics of generalized symmetries and phases in QFT’s. do it through an analysis simple properties (additivity Haag duality) net operator algebras attached to space-time regions. observe different types are associated with breaking these regions non-trivial topologies. When such topologies connected, we show non locally generated o...

It has been conjectured that MWS-α scheduling policies with α going to zero are heavy-traffic optimal for scheduling in a generalized switch when the objective is to minimize the number of backlogged packets in the system. We examine this conjecture by first deriving optimal or heavy-traffic optimal policies for small switches and then comparing them to MWS-α policies. Our conclusion is that th...

Abstract— We consider the problem of minimizing the resources used for network coding while achieving the desired throughput in a multicast scenario. Since this problem is NPhard, we seek a method for quickly finding sufficiently good solutions. To this end, we take an evolutionary approach based on a genetic algorithm that works in an algebraic framework, combined with randomized polynomial id...

We study robust consensus of linear Multi-Agent Systems (MAS) with heterogeneous delays. We provide a very accurate set-valued condition that guarantees consensus for arbitrary bounded delays and arbitrary connected topologies. This condition is proven using the generalized Nyquist criterion. From the set-valued condition, an explicit analytical formula is derived for single integrator MAS. In ...