Miguel Pinto Silva

Abstract
AbstractThe efforts to contain SARS-CoV-2 and reduce the impact of COVID-19 have been supported by Test, Trace and Isolate (TTI) systems in many settings, including the United Kingdom. The mathematical models underlying policy decisions about TTI make assumptions about behaviour in the context of a rapidly unfolding and changeable emergency. This study investigates the reported behaviours of UK citizens in July 2021, assesses them against how a set of TTI processes are conceptualised and represented in models and then interprets the findings with modellers who have been contributing evidence to TTI policy. We report on testing practices, including the uses of and trust in different types of testing, and the challenges of testing and isolating faced by different demographic groups. The study demonstrates the potential of input from members of the public to benefit the modelling process, from guiding the choice of research questions, influencing choice of model structure, informing parameter ranges and validating or challenging assumptions, to highlighting where model assumptions are reasonable or where their poor reflection of practice might lead to uninformative results. We conclude that deeper engagement with members of the public should be integrated at regular stages of public health intervention modelling.

Abstract
Computing subgraph frequencies is a fundamental task that lies at the core of several network analysis methodologies, such as network motifs and graphlet-based metrics, which have been widely used to categorize and compare networks from multiple domains. Counting subgraphs is, however, computationally very expensive, and there has been a large body of work on efficient algorithms and strategies to make subgraph counting feasible for larger subgraphs and networks. This survey aims precisely to provide a comprehensive overview of the existing methods for subgraph counting. Our main contribution is a general and structured review of existing algorithms, classifying them on a set of key characteristics, highlighting their main similarities and differences. We identify and describe the main conceptual approaches, giving insight on their advantages and limitations, and we provide pointers to existing implementations. We initially focus on exact sequential algorithms, but we also do a thorough survey on approximate methodologies (with a trade-off between accuracy and execution time) and parallel strategies (that need to deal with an unbalanced search space).

Abstract

Abstract
In order to detect network motifs we need to evaluate the exceptionality of subgraphs in a given network. This is usually done by comparing subgraph frequencies on both the original and an ensemble of random networks keeping certain structural properties. The classical null model implies preserving the degree sequence. In this paper our focus is on a richer model that approximately fixes the frequency of subgraphs of size K - 1 to compute motifs of size K. We propose a method for generating random graphs under this model, and we provide algorithms for its efficient computation. We show empirical results of our proposed methodology on neurobiological networks, showcasing its efficiency and its differences when comparing to the traditional null model. © Springer International Publishing AG 2017.

Abstract
Concurrent C0 is an imperative programming language in the C family with session-typed messagepassing concurrency. The previously proposed semantics implements asynchronous (non-blocking) output; we extend it here with non-blocking input. A key idea is to postpone message reception as much as possible by interpreting receive commands as a request for a message. We implemented our ideas as a translation from a blocking intermediate language to a non-blocking language. Finally, we evaluated our techniques with several benchmark programs and show the results obtained. While the abstract measure of span always decreases (or remains unchanged), only a few of the examples reap a practical benefit.