Biology helps you to win a game

We present a game of interacting agents which mimics the complex dynamics found in many natural and social systems. These agents modify their strategies periodically, depending on their performances using genetic crossover mechanisms, inspired by biology. We study the performances of the agents under different conditions, and how they adapt themselves. In addition the dynamics of the game is investigated.Comment: 4 pages including 6 figures. Uses REVTeX4. Submitted for Conference Proceedings of the "Unconventional Applications of Statistical Physics", Kolkat

Modeling and Analysis of Content Caching in Wireless Small Cell Networks

Network densification with small cell base stations is a promising solution to satisfy future data traffic demands. However, increasing small cell base station density alone does not ensure better users quality-of-experience and incurs high operational expenditures. Therefore, content caching on different network elements has been proposed as a mean of offloading he backhaul by caching strategic contents at the network edge, thereby reducing latency. In this paper, we investigate cache-enabled small cells in which we model and characterize the outage probability, defined as the probability of not satisfying users requests over a given coverage area. We analytically derive a closed form expression of the outage probability as a function of signal-to-interference ratio, cache size, small cell base station density and threshold distance. By assuming the distribution of base stations as a Poisson point process, we derive the probability of finding a specific content within a threshold distance and the optimal small cell base station density that achieves a given target cache hit probability. Furthermore, simulation results are performed to validate the analytical model.Comment: accepted for publication, IEEE ISWCS 201

An automata characterisation for multiple context-free languages

We introduce tree stack automata as a new class of automata with storage and identify a restricted form of tree stack automata that recognises exactly the multiple context-free languages.Comment: This is an extended version of a paper with the same title accepted at the 20th International Conference on Developments in Language Theory (DLT 2016