We describe a model for polarization in multi-agent systems based on Esteban and Ray's standard family of polarization measures from economics. Agents evolve by updating their beliefs (opinions) based on an underlying influence graph, as in the standard DeGroot model for social learning, but under a confirmation bias; i.e., a discounting of opinion...
We present Pactole, a formal framework to design and prove the correctness of protocols (or the impossibility of their existence) that target mobile robotic swarms. Unlike previous approaches, our methodology unifies in a single formalism the execution model, the problem specification, the protocol, and its proof of correctness. The Pactole framewo...
The existing analysis of asynchronous stochastic gradient descent (SGD) degrades dramatically when any delay is large, giving the impression that performance depends primarily on the delay. On the contrary, we prove much better guarantees for the same asynchronous SGD algorithm regardless of the delays in the gradients, depending instead just on th...
Connected Square Network Graphs (CSN G) in the study of Selcuk and Tankul [17,18] is reconsidered in this paper. Although (CSN G) is a 2-dimensional mesh structure, the most important feature of this graph is that it is a hypercube variant. For this reason, the focus of this work is to develop algorithms that find solutions to various problems for ...
For $N \geq 2$, an $N$-qubit doily is a doily living in the $N$-qubit symplectic polar space. These doilies are related to operator-based proofs of quantum contextuality. Following and extending the strategy of Saniga et al. (Mathematics 9 (2021) 2272) that focused exclusively on three-qubit doilies, we first bring forth several formulas giving the...
This document introduces the programming interface exposed by the StarPU task-based parallel runtime system for performance monitoring tools to collect performance-related metrics on the execution of StarPU applications. It defines the entry point, the callback methods, the performance counters available. It also presents the usage of the mechanism...
Mass production of data is increasingly explored, particularly for extracting value from real-time data. With this, there is a need for continuity and quality of services in latency-sensitive applications. Fog computing delivers low-latency communication and attends to the requirements of these emerging applications. However, mobility presents a ch...
Coupling regular topologies with optimized routing algorithms is key in pushing the performance of interconnection networks of HPC systems. In this paper we present Dmodc, a fast deterministic routing algorithm for Parallel Generalized Fat-Trees (PGFTs) which minimizes congestion risk even under massive topology degradation caused by equipment fail...
High-Performance Computing (HPC) clusters are made up of a variety of node types (usually compute, I/O, service, and GPGPU nodes) and applications don't use nodes of a different type the same way. Resulting communication patterns reflect organization of groups of nodes, and current optimal routing algorithms for all-to-all patterns will not always ...
Abstract We consider the problem of constructing a maximum independent set with mobile myopic luminous robots on a grid network whose size is finite but unknown to the robots. In this setting, the robots enter the grid network one by one from a corner of the grid, and they eventually have to be disseminated on the grid nodes so that the occupied po...
