Telepresence and the Role of the Senses

The telepresence experience can be evoked in a number of ways. A well-known example is a player of videogames who reports about a telepresence experience, a subjective experience of being in one place or environment, even when physically situated in another place. In this paper we set the phenomenon of telepresence into a theoretical framework. As people react subjectively to stimuli from telepresence, empirical studies can give more evidence about the phenomenon. Thus, our contribution is to bridge the theoretical with the empirical. We discuss theories of perception with an emphasis on Heidegger, Merleau-Ponty and Gibson, the role of the senses and the Spinozian belief procedure. The aim is to contribute to our understanding of this phenomenon. A telepresence-study that included the affordance concept is used to empirically study how players report sense-reactions to virtual sightseeing in two cities. We investigate and explore the interplay of the philosophical and the empirical. The findings indicate that it is not only the visual sense that plays a role in this experience, but all senses

Lifting and restricting recollement data

We study the problem of lifting and restricting TTF triples (equivalently, recollement data) for a certain wide type of triangulated categories. This, together with the parametrizations of TTF triples given in "Parametrizing recollement data", allows us to show that many well-known recollements of right bounded derived categories of algebras are restrictions of recollements in the unbounded level, and leads to criteria to detect recollements of general right bounded derived categories. In particular, we give in Theorem 1 necessary and sufficient conditions for a 'right bounded' derived category of a differential graded(=dg) category to be a recollement of 'right bounded' derived categories of dg categories. In Theorem 2 we consider the particular case in which those dg categories are just ordinary algebras.Comment: 29 page

On Chemical Reaction Network Design by a Nested Evolution Algorithm

International audienceOne goal of synthetic biology is to implement useful functions with biochemical reactions, either by reprogramming living cells or programming artificial vesicles. In this perspective, we consider Chemical Reaction Networks (CRN) as a programming language, and investigate the CRN program synthesis problem. Recent work has shown that CRN interpreted by differential equations are Turing-complete and can be seen as analog computers where the molecular concentrations play the role of information carriers. Any real function that is computable by a Turing machine in arbitrary precision can thus be computed by a CRN over a finite set of molecular species. The proof of this result gives a numerical method to generate a finite CRN for implementing a real function presented as the solution of a Polynomial Initial Values Problem (PIVP). In this paper, we study an alternative method based on artificial evolution to build a CRN that approximates a real function given on finite sets of input values. We present a nested search algorithm that evolves the structure of the CRN and optimizes the kinetic parameters at each generation. We evaluate this algorithm on the Heaviside and Cosine functions both as functions of time and functions of input molecular species. We then compare the CRN obtained by artificial evolution both to the CRN generated by the numerical method from a PIVP definition of the function, and to the natural CRN found in the BioModels repository for switches and oscillators

Pan-cancer analysis of whole genomes

Cancer is driven by genetic change, and the advent of massively parallel sequencing has enabled systematic documentation of this variation at the whole-genome scale(1-3). Here we report the integrative analysis of 2,658 whole-cancer genomes and their matching normal tissues across 38 tumour types from the Pan-Cancer Analysis of Whole Genomes (PCAWG) Consortium of the International Cancer Genome Consortium (ICGC) and The Cancer Genome Atlas (TCGA). We describe the generation of the PCAWG resource, facilitated by international data sharing using compute clouds. On average, cancer genomes contained 4-5 driver mutations when combining coding and non-coding genomic elements; however, in around 5% of cases no drivers were identified, suggesting that cancer driver discovery is not yet complete. Chromothripsis, in which many clustered structural variants arise in a single catastrophic event, is frequently an early event in tumour evolution; in acral melanoma, for example, these events precede most somatic point mutations and affect several cancer-associated genes simultaneously. Cancers with abnormal telomere maintenance often originate from tissues with low replicative activity and show several mechanisms of preventing telomere attrition to critical levels. Common and rare germline variants affect patterns of somatic mutation, including point mutations, structural variants and somatic retrotransposition. A collection of papers from the PCAWG Consortium describes non-coding mutations that drive cancer beyond those in the TERT promoter(4); identifies new signatures of mutational processes that cause base substitutions, small insertions and deletions and structural variation(5,6); analyses timings and patterns of tumour evolution(7); describes the diverse transcriptional consequences of somatic mutation on splicing, expression levels, fusion genes and promoter activity(8,9); and evaluates a range of more-specialized features of cancer genomes(8,10-18).Peer reviewe