We give an explicit description of the non-flat parallel even Clifford structures of rank 8, 6, 5 on some real, complex and quaternionic Grassmannians, and discuss the rôle of the octonions in them, in particular for some low dimensional examples.
We propose a highly parallel and distributed multiset computing model having as its underlying structure an undirected graph whose nodes are processors, each endowed with a polarity and with a set of rules all of the same kind, one of increment, decrement or substitution. Processors communicate with each other via a protocol based on the compatibility between their polarization and the polarization of the data, as computed by a valuation mapping. We show that this model can simulate any multiset Turing machine.
Multi-armed bandit (MAB) models are a viable approach to describe the problem of best wireless network selection by a multi-Radio Access Technology (multi-RAT) device, with the goal of maximizing the quality perceived by the final user. The classical MAB model does not allow, however, to properly describe the problem of wireless network selection by a multi-RAT device, in which a device typically performs a set of measurements in order to collect information on available networks, before a selection takes place.
© Università degli Studi di Roma "La Sapienza" - Piazzale Aldo Moro 5, 00185 Roma
