Playful laboratories: the significance of games for knowledge production in the digital age

Presented at DiGRA 2015 Diversity of Play, Leuphana University, Lüneburg, Germany, on the 15th of May 2015.

Hoyle's games : illustrated edition. Embracing all the most modern modes of play, and the rules practised at the present time, in billiards, whist, draughts, cribbage, backgammon, and all other fashionable games; together with sixteen games adapted to the new Yankee-notion cards. Also the whole of Frer̀e's chess hand-book. Containing, besides elementary instruction and the laws of chess, about fifty select games by the first players, endings of games, and the defeat of the muzio gambit. Also, thirty-six of the choicest chess problems, and a description of, and rules for, four-handed chess /

Classified for chess; Frère's chess hand-book, p. 229-324.

The Role of B5G UAV-Aided Mobile Networks

With the advent of 5G, several novel network paradigms and technologies have been proposed to fulfil the key requirements imposed. Flexibility, efficiency and scalability, along with sustainability and convenience for expenditure have to be addressed in targeting these brand new needs. Among novel paradigms introduced in the scientific literature in recent years, a constant and increasing interest lies in the use of unmanned aerial vehicles (UAVs) as network nodes supporting the legacy terrestrial network for service provision. Their inherent features of moving nodes make them able to be deployed on-demand in real-time. Which, in practical terms, means having them acting as a base station (BS) when and where there is the highest need. This thesis investigates then the potential role of UAV-aided mobile radio networks, in order to validate the concept of adding an aerial network component and assess the system performance, from early to later stages of its deployment. This study is intended for 5G and beyond systems, to allow time for the technology to mature. Since advantages can be manyfold, the aerial network component is considered at the network layer under several aspects, from connectivity to radio resource management. A particular emphasis is given to trajectory design, because of the efficiency and flexibility it potentially adds to the infrastructure. Two different frameworks have been proposed, to take into account both a re-adaptable heuristic and an optimal solution. Moreover, diverse use cases are taken under analysis, from mobile broadband to machine and vehicular communications. The thesis aim is thus to discuss the potential and advantages of UAV-aided systems from a broad perspective. Results demonstrate that the technology has good prospects for diverse scenarios with a few arrangements.

Towards a logical foundation of randomized computation

This dissertation investigates the relations between logic and TCS in the probabilistic setting. It is motivated by two main considerations. On the one hand, since their appearance in the 1960s-1970s, probabilistic models have become increasingly pervasive in several fast-growing areas of CS. On the other, the study and development of (deterministic) computational models has considerably benefitted from the mutual interchanges between logic and CS. Nevertheless, probabilistic computation was only marginally touched by such fruitful interactions. The goal of this thesis is precisely to (start) bring(ing) this gap, by developing logical systems corresponding to specific aspects of randomized computation and, therefore, by generalizing standard achievements to the probabilistic realm. To do so, our key ingredient is the introduction of new, measure-sensitive quantifiers associated with quantitative interpretations. The dissertation is tripartite. In the first part, we focus on the relation between logic and counting complexity classes. We show that, due to our classical counting propositional logic, it is possible to generalize to counting classes, the standard results by Cook and Meyer and Stockmeyer linking propositional logic and the polynomial hierarchy. Indeed, we show that the validity problem for counting-quantified formulae captures the corresponding level in Wagner's hierarchy. In the second part, we consider programming language theory. Type systems for randomized \lambda-calculi, also guaranteeing various forms of termination properties, were introduced in the last decades, but these are not "logically oriented" and no Curry-Howard correspondence is known for them. Following intuitions coming from counting logics, we define the first probabilistic version of the correspondence. Finally, we consider the relationship between arithmetic and computation. We present a quantitative extension of the language of arithmetic able to formalize basic results from probability theory. This language is also our starting point to define randomized bounded theories and, so, to generalize canonical results by Buss.

Distinctively variable sequence-based nuclear DNA markers for multilocus phylogeography of the soybean- and rice-infecting fungal pathogen Rhizoctonia solani AG-1 IA

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Detection of HIV-1 RNA by nucleic acid sequence-based amplification combined with fluorescence correlation spectroscopy

Nucleic acid sequence-based amplification (NASBA) has proved to be an ultrasensitive method for HIV-1 diagnosis in plasma even in the primary HIV infection stage. This technique was combined with fluorescence correlation spectroscopy (FCS) which enables online detection of the HIV-1 RNA molecules amplified by NASBA. A fluorescently labeled DNA probe at nanomolar concentration was introduced into the NASBA reaction mixture and hybridizing to a distinct sequence of the amplified RNA molecule. The specific hybridization and extension of this probe during amplification reaction, resulting in an increase of its diffusion time, was monitored online by FCS. As a consequence, after having reached a critical concentration of 0.1–1 nM (threshold for unaided FCS detection), the number of amplified RNA molecules in the further course of reaction could be determined. Evaluation of the hybridization/extension kinetics allowed an estimation of the initial HIV-1 RNA concentration that was present at the beginning of amplification. The value of initial HIV-1 RNA number enables discrimination between positive and false-positive samples (caused for instance by carryover contamination)—this possibility of discrimination is an essential necessity for all diagnostic methods using amplification systems (PCR as well as NASBA). Quantitation of HIV-1 RNA in plasma by combination of NASBA with FCS may also be useful in assessing the efficacy of anti-HIV agents, especially in the early infection stage when standard ELISA antibody tests often display negative results.

Essential features of serious games design in higher education:linking learning attributes to game mechanics

This paper consolidates evidence and material from a range of specialist and disciplinary fields to provide an evidence-based review and synthesis on the design and use of serious games in higher education. Search terms identified 165 papers reporting conceptual and empirical evidence on how learning attributes and game mechanics may be planned, designed and implemented by university teachers interested in using games, which are integrated into lesson plans and orchestrated as part of a learning sequence at any scale. The findings outline the potential of classifying the links between learning attributes and game mechanics as a means to scaffold teachers’ understanding of how to perpetuate learning in optimal ways while enhancing the in-game learning experience. The findings of this paper provide a foundation for describing methods, frames and discourse around experiences of design and use of serious games, linked to methodological limitations and recommendations for further research in this area.

SOME PROPERTIES OF THE MULTIPLICITY SEQUENCE FOR ARBITRARY IDEALS

In this work we prove that the Achilles-Manaresi multiplicity sequence, like the classical Hilbert-Samuel multiplicity, is additive with respect to the exact sequence of modules. We also prove the associativity formula for his mulitplicity sequence. As a consequence, we give new proofs for two results already known. First, the Achilles-Manaresi multiplicity sequence is an invariant up to reduction, a result first proved by Ciuperca. Second, I subset of J is a reduction of (J,M) if and only if c(0)(I(p), M(p)) = c(0)(J(p), M(p)) for all p is an element of Spec(A), a result first proved by Flenner and Manaresi.

Role of price and enforcement in water allocation: Insights from Game Theory

As many countries are moving toward water sector reforms, practical issues of how water management institutions can better effect allocation, regulation, and enforcement of water rights have emerged. The problem of nonavailability of water to tailenders on an irrigation system in developing countries, due to unlicensed upstream diversions is well documented. The reliability of access or equivalently the uncertainty associated with water availability at their diversion point becomes a parameter that is likely to influence the application by users for water licenses, as well as their willingness to pay for licensed use. The ability of a water agency to reduce this uncertainty through effective water rights enforcement is related to the fiscal ability of the agency to monitor and enforce licensed use. In this paper, this interplay across the users and the agency is explored, considering the hydraulic structure or sequence of water use and parameters that define the users and the agency`s economics. The potential for free rider behavior by the users, as well as their proposals for licensed use are derived conditional on this setting. The analyses presented are developed in the framework of the theory of ""Law and Economics,`` with user interactions modeled as a game theoretic enterprise. The state of Ceara, Brazil, is used loosely as an example setting, with parameter values for the experiments indexed to be approximately those relevant for current decisions. The potential for using the ideas in participatory decision making is discussed. This paper is an initial attempt to develop a conceptual framework for analyzing such situations but with a focus on the reservoir-canal system water rights enforcement.

Adaptive Game Design Study of a fully adaptive framework

Adventure! The Paladin Order foi um projecto ambicioso que começou por ser desenvolvido como um video jogo completo. Tinha como objéctivo implementar uma ferramenta diferente que permitisse tornar o jogo completamente adaptativo às decisões do jogador tanto nas interacções e no diálogo com outras personagens, assim como no combate contra os variados inímigos do jogo. Devido à inexperiência do autor uma grande parte do tempo foi passado a estudar e a pesquisar várias possíveis soluções que permitissem criar um ambiente que fosse adaptativo de uma forma simples e interessante, não só para os programadores mas também para qualquer pessoa que fosse responsável por editar o diálogo e a história do jogo. Os resultados foram bastante interessantes, revelando um sistema que depende simultaneamente dos ficheiros de onde é retirado o diálogo, e de um sistema de personalidades que permite definir qual será o comportamento de qualquer objecto do jogo ou, pelo menos, como as outras personagens irão reagir. O produto final é uma ferramenta de bases sólidas que permite uma implementação relativamente simples de um sistema abrangente e adaptativo, com poucas falhas e apenas algumas questões de simplicidade de código.

PERFORMANCE OF CONVENTIONAL PCRs BASED ON PRIMERS DIRECTED TO NUCLEAR AND MITOCHONDRIAL GENES FOR THE DETECTION AND IDENTIFICATION OF Leishmania spp.

In visceral leishmaniasis, the detection of the agent is of paramount importance to identify reservoirs of infection. Here, we evaluated the diagnostic attributes of PCRs based on primers directed to cytochrome-B (cytB), cytochrome-oxidase-subunit II (coxII), cytochrome-C (cytC), and the minicircle-kDNA. Although PCRs directed to cytB, coxII, cytC were able to detect different species of Leishmania, and the nucleotide sequence of their amplicons allowed the unequivocal differentiation of species, the analytical and diagnostic sensitivity of these PCRs were much lower than the analytical and diagnostic sensitivity of the kDNA-PCR. Among the 73 seropositive animals, the asymptomatic dogs had spleen and bone marrow samples collected and tested; only two animals were positive by PCRs based on cytB, coxII, and cytC, whereas 18 were positive by the kDNA-PCR. Considering the kDNA-PCR results, six dogs had positive spleen and bone marrow samples, eight dogs had positive bone marrow results but negative results in spleen samples and, in four dogs, the reverse situation occurred. We concluded that PCRs based on cytB, coxII, and cytC can be useful tools to identify Leishmania species when used in combination with automated sequencing. The discordance between the results of the kDNA-PCR in bone marrow and spleen samples may indicate that conventional PCR lacks sensitivity for the detection of infected dogs. Thus, primers based on the kDNA should be preferred for the screening of infected dogs.

Interactive Epistemology and Reasoning: On the Foundations of Game Theory

Game theory describes and analyzes strategic interaction. It is usually distinguished between static games, which are strategic situations in which the players choose only once as well as simultaneously, and dynamic games, which are strategic situations involving sequential choices. In addition, dynamic games can be further classified according to perfect and imperfect information. Indeed, a dynamic game is said to exhibit perfect information, whenever at any point of the game every player has full informational access to all choices that have been conducted so far. However, in the case of imperfect information some players are not fully informed about some choices. Game-theoretic analysis proceeds in two steps. Firstly, games are modelled by so-called form structures which extract and formalize the significant parts of the underlying strategic interaction. The basic and most commonly used models of games are the normal form, which rather sparsely describes a game merely in terms of the players' strategy sets and utilities, and the extensive form, which models a game in a more detailed way as a tree. In fact, it is standard to formalize static games with the normal form and dynamic games with the extensive form. Secondly, solution concepts are developed to solve models of games in the sense of identifying the choices that should be taken by rational players. Indeed, the ultimate objective of the classical approach to game theory, which is of normative character, is the development of a solution concept that is capable of identifying a unique choice for every player in an arbitrary game. However, given the large variety of games, it is not at all certain whether it is possible to device a solution concept with such universal capability. Alternatively, interactive epistemology provides an epistemic approach to game theory of descriptive character. This rather recent discipline analyzes the relation between knowledge, belief and choice of game-playing agents in an epistemic framework. The description of the players' choices in a given game relative to various epistemic assumptions constitutes the fundamental problem addressed by an epistemic approach to game theory. In a general sense, the objective of interactive epistemology consists in characterizing existing game-theoretic solution concepts in terms of epistemic assumptions as well as in proposing novel solution concepts by studying the game-theoretic implications of refined or new epistemic hypotheses. Intuitively, an epistemic model of a game can be interpreted as representing the reasoning of the players. Indeed, before making a decision in a game, the players reason about the game and their respective opponents, given their knowledge and beliefs. Precisely these epistemic mental states on which players base their decisions are explicitly expressible in an epistemic framework. In this PhD thesis, we consider an epistemic approach to game theory from a foundational point of view. In Chapter 1, basic game-theoretic notions as well as Aumann's epistemic framework for games are expounded and illustrated. Also, Aumann's sufficient conditions for backward induction are presented and his conceptual views discussed. In Chapter 2, Aumann's interactive epistemology is conceptually analyzed. In Chapter 3, which is based on joint work with Conrad Heilmann, a three-stage account for dynamic games is introduced and a type-based epistemic model is extended with a notion of agent connectedness. Then, sufficient conditions for backward induction are derived. In Chapter 4, which is based on joint work with Jérémie Cabessa, a topological approach to interactive epistemology is initiated. In particular, the epistemic-topological operator limit knowledge is defined and some implications for games considered. In Chapter 5, which is based on joint work with Jérémie Cabessa and Andrés Perea, Aumann's impossibility theorem on agreeing to disagree is revisited and weakened in the sense that possible contexts are provided in which agents can indeed agree to disagree.

On Cooperative solutions of a generalized assignment game: limit theorems to the set of competitive equilibria

We study two cooperative solutions of a market with indivisible goods modeled as a generalized assignment game: Set-wise stability and Core. We first establish that the Set-wise stable set is contained in the Core and it contains the non-empty set of competitive equilibrium payoffs. We then state and prove three limit results for replicated markets. First, the sequence of Cores of replicated markets converges to the set of competitive equilibrium payoffs when the number of replicas tends to infinity. Second, the Set-wise stable set of a two-fold replicated market already coincides with the set of competitive equilibrium payoffs. Third, for any number of replicas there is a market with a Core payoff that is not a competitive equilibrium payoff.