Denna studie bygger på Research through Design (Frayling, 1993), d.v.s att undersökningen syftar till att generera ny kunskap genom analys av datorspel och design av en gestaltning. För att uppnå detta används ett annoterat portfolio och dess underliggande principer (Gaver, 2012; Bowers, 2012). Det annoterade portfoliot består av fyra utvalda datorspel och en egenutvecklad gestaltning. Detta portfolio analyseras för att definiera vilka gemensamma och icke-gemensamma designegenskaper som kan observeras. Efter detta presenteras argument för varför utvalda egenskaper kan göra pedagogiskt inriktade datorspel mer effektiva i syftet att utbilda kring-eller minska påverkan av mis-/desinformation i det specifika inlärningssammanhanget. Faran med mis-/desinformation i samhället illustreras genom kontexten av arbetet med den utvecklade gestaltningen, som bygger på COVID-19 mis-/desinformation och dess konsekvenser. Resultat uppnås efter analysering av samtliga designexempel har genomförts och data har genererats för att utveckla vår egna gestaltning baserat på denna information. / This case study is based on Research through Design (Frayling, 1993), i.e. the purpose of the study is to generate new knowledge through analysis and design of computer games. To achieve this an annotated portfolio and its underlying principles are used (Gaver, 2012; Bowers, 2012). The annotated portfolio consists of four selected computer games and one designed by the authors. This portfolio is analysed to define what design features are shared or not shared between the games. After this, arguments are presented as to why the specified features can make educational computer games more effective in the purpose of educating about or to reduce susceptibility to mis-/disinformation in the specific learning context. The danger of mis-/disinformation is illustrated through the context of the work with the designed computer game, which is based on COVID-19 mis-/disinformation and its consequences. Results are achieved after analysis of the four selected computer games has been carried out and data has been generated to enable the development of the authors own game.

To provide an annotated bibliography of criticism on the writings of Nathaniel Lee, Thomas Otway and Nicholas Rowe from 1900 to 1974 for students and scholars is the purpose of this study. The bibliography contains brief evaluations of each of the works, which are divided into the following categories: articles, books and chapters in books, and dissertations. An additional chapter includes those works which deal with two or more of the authors. The appendix contains a selected list of foreign language publications that concern the three playwrights.

No description available.

No description available.

In the present thesis a landscape of slow technology in the domestic home is explored to contrast the prevailing fast paced constant-on-and-connected devices of today. Through 3 technology probes (provotypes) deployed in 7 different homes, different parts of this landscape has been unfolded showing what slow technology might mean for interaction designers, from the user perspective, and what potentials it might carry. Potentials include delaying the availability of our devices, working with different layers of intrusiveness, looking into the distant future, and the introduction of small rituals, and routines in our everyday life. As a methodological contribution the novel hybrid slow provotype is proposed.

This thesis project examines social interactions in PvPvE Online Multiplayer Survival Shooters and proposes mechanics that promote connection among players, hooking rascal players who invent new ways to play the game, into the game spirit rather than engaging in toxic play. To do that, I followed a Research-through-design methodology, engaged with games, game designers, and gamers, and designed storyboards presenting examples of mechanics that promote players' connection. The results are Annotated Portfolios that frame the knowledge contribution as guides for designing mechanics for connection. The first annotation is “Helping or Asking for help” as a way to establish the purpose of communication, the second is “Temporarily teaming up” as a way to introduce a transitional state of sharing information such as knowledge and location, and the third one is “Risk and Reward” as the main aesthetic and motivation of target players.

Ce travail porte sur la construction d’un corpus étalon pour l’évaluation automatisée des extracteurs de termes. Ces programmes informatiques, conçus pour extraire automatiquement les termes contenus dans un corpus, sont utilisés dans différentes applications, telles que la terminographie, la traduction, la recherche d’information, l’indexation, etc. Ainsi, leur évaluation doit être faite en fonction d’une application précise. Une façon d’évaluer les extracteurs consiste à annoter toutes les occurrences des termes dans un corpus, ce qui nécessite un protocole de repérage et de découpage des unités terminologiques. À notre connaissance, il n’existe pas de corpus annoté bien documenté pour l’évaluation des extracteurs. Ce travail vise à construire un tel corpus et à décrire les problèmes qui doivent être abordés pour y parvenir. Le corpus étalon que nous proposons est un corpus entièrement annoté, construit en fonction d’une application précise, à savoir la compilation d’un dictionnaire spécialisé de la mécanique automobile. Ce corpus rend compte de la variété des réalisations des termes en contexte. Les termes sont sélectionnés en fonction de critères précis liés à l’application, ainsi qu’à certaines propriétés formelles, linguistiques et conceptuelles des termes et des variantes terminologiques. Pour évaluer un extracteur au moyen de ce corpus, il suffit d’extraire toutes les unités terminologiques du corpus et de comparer, au moyen de métriques, cette liste à la sortie de l’extracteur. On peut aussi créer une liste de référence sur mesure en extrayant des sous-ensembles de termes en fonction de différents critères. Ce travail permet une évaluation automatique des extracteurs qui tient compte du rôle de l’application. Cette évaluation étant reproductible, elle peut servir non seulement à mesurer la qualité d’un extracteur, mais à comparer différents extracteurs et à améliorer les techniques d’extraction. / We describe a methodology for constructing a gold standard for the automatic evaluation of term extractors. These programs, designed to automatically extract specialized terms from a corpus, are used in various settings, including terminology work, translation, information retrieval, indexing, etc. Thus, the evaluation of term extractors must be carried out in accordance with a specific application. One way of evaluating term extractors is to construct a corpus in which all term occurrences have been annotated. This involves establishing a protocol for term selection and term boundary identification. To our knowledge, no well-documented annotated corpus is available for the evaluation of term extractors. This contribution aims to build such a corpus and describe what issues must be dealt with in the process. The gold standard we propose is a fully annotated corpus, constructed in accordance with a specific terminological setting, namely the compilation of a specialized dictionary of automotive mechanics. This annotated corpus accounts for the wide variety of realizations of terms in context. Terms are selected in accordance with specific criteria pertaining to the terminological setting as well as formal, linguistic and conceptual properties of terms and term variations. To evaluate a term extractor, a list of all the terminological units in the corpus is extracted and compared to the output of the term extractor, using a set of metrics to assess its performance. Subsets of terminological units may also be extracted, providing a level of customization. This allows an automatic and application-driven evaluation of term extractors. Due to its reusability, it can serve not only to assess the performance of a particular extractor, but also to compare different extractors and fine-tune extraction techniques.

L'alignement de macromolécules biologiques comme les protéines, l'ADN ou encore l'ARN est une problématique biologique et bio-informatique qui a pour but de révéler une partie des mystères du fonctionnement des cellules, constituants des êtres vivants. Les ARN non-codant sont des macromolécules intervenant dans le métabolisme de tout être vivant et les deux problématiques majeurs les concernant sont: la prédiction de leur structure pour mieux comprendre leur fonctionnement et leur détection dans des bases de données ou des génomes. L'une des approches: l'alignement structure-séquence d'ARN, répond à ces deux problématiques. Le problème d'alignement structure-séquence consiste à aligner une structure connue d'un premier ARN avec la séquence d'un deuxième ARN.La structure est représentée sous la forme d'un graphe ou de façon équivalente sous la forme d'une séquence arc-annotées et la séquence représente la suite des nucléotides de l'ARN.Pour résoudre ce problème, nous cherchons à optimiser l'alignement selon une fonction de coût. C'est donc un problème d'optimisation, qui malheureusement se révèle NP-Difficile.En conséquence différents travaux définissent des classes d'instances réduites pour lesquelles ils proposent des algorithmes spécifiques mais à complexités polynomiales.Les travaux de ma thèse unifient et la généralisent les approches précédentes par la construction d'un algorithme à complexité paramétrée non spécifique à une classe d'instances. En utilisant cet algorithme, il est possible de résoudre le problème d'alignement structure-séquence pour toutes les instances possibles, et aussi efficacement que les précédentes approches sur leur domaine de résolution respectif. Cet algorithme utilise une technique empruntée à la théorie des graphes: la décomposition arborescente, c'est-à-dire qu'il transforme la structure donnée en une décomposition arborescente et c'est ensuite cette décomposition qui est alignée avec la séquence donnée. L'alignement entre une décomposition arborescente et une séquence se fait par programmation dynamique.Sa mise en place a nécessité une reformulation du problème ainsi qu'une modification importante de l'utilisation classique de la programmation dynamique pour les décompositions arborescentes. Au final, cela conduit à un algorithme paramétré dont le paramètre est entièrement lié à la décomposition arborescente. La construction des décompositions arborescentes pour lesquelles l'alignement s'effectuera plus le efficacement possible est malheureusement un problème lui aussi NP-Difficile. Néanmoins, nous avons créé une heuristique de construction de décompositions adaptée aux structures d'ARN.Nous avons alors défini des nouvelles classes de structures pour lesquelles notre algorithme (décomposition et alignement) possède une faible complexité. Ces classes incluent notamment toutes les autres classes précédemment définies et la complexité de notre algorithme est au moins aussi faible que celles des algorithmes spécifiques sur leurs classes de structures respectives. Ces classes de structures représentent la majorité des structures connues et contiennent de nombreux éléments importants jusqu'alors non pris en compte (tel que les motifs tertiaires d'ARN). Le problème de l'alignement structure-séquence tente de répondre aux problématiques de prédictions de structures et de recherche d'ARN. Néanmoins, la qualité des résultats obtenus par sa résolution dépendent de la fonction de coût utilisée. Durant ma thèse j'ai commencé la mise place de la construction par apprentissage d'une nouvelle fonction de coût, adaptée aux nouvelles classes de structures que nous avons défini. Enfin de par la nature de l'algorithme, le travail réalisé permet des améliorations non négligeables, en terme de qualité des résultats et de rapidité de calcul comme la recherche de solution sous-optimales ou l'utilisation de l'algorithme au sein d'heuristiques dérivées d'heuristiques classiques. / The alignment of biological macromolecules such as proteins, DNA or RNA is a biological and bio-informatics problematic which aims to reveal some of the mysteries of how cells works. The non-coding RNA are involved in the metabolism of all living beings. The two major issues concerning them are: the prediction of their structure to better understand their function and their detection in databases or genomes. One approach, the structure-sequence alignment of RNA, addresses these two issues. The work done during my thesis provides some constructive elements on this problem and led me to call the graph algorithmic for its resolution. The alignment problem is to align a structure of a first RNA with the sequence of a second RNA. The structure on the first RNA is represented as a graph or equivalently as an arc-annotated sequence and the sequence represents the nucleotide sequence of the second RNA.To solve this problem, we aim to compute a minimal cost alignment, according to a given cost function. So, this is an optimization problem, which turns out to be NP-hard.Accordingly, different works define several reduced structure classes for which they propose specific algorithms but with polynomial complexity. The work of my thesis unifies and generalizes previous approaches by the construction of a unique (not class specific) parameterized algorithm. Using this algorithm, it is possible to solve the problem of structure-sequence alignment for all possible instances, and as effectively as previous approaches in their respective field of resolution.This algorithm uses a technique from graph theory: the tree decomposition, that is to say, it transforms the given structure into a tree-decomposition and the decomposition is then aligned with the sequence. The alignment between a tree-decomposition and a sequence is done by dynamic programming. Its implementation requires a reformulation of the problem as well as a substantial modifications to the conventional use of dynamic programming for tree decompositions. This leads to an algorithm whose parameter is entirely related to the tree-decomposition.The construction of tree decompositions for which the alignment is the most effective is unfortunately a NP-Hard problem. Nevertheless, we have developed a heuristic construction of decompositions adapted to RNA structures. We then defined new structure classes which extend existing ones without degrading the complexity of the alignment but which can represent the majority of known structures containing many important elements that had not be taken into account previously (such as RNA tertiary motifs).The sequence-structure alignment problem attempts to answer the problem of prediction of structures and RNA research. However, the quality of the results obtained by its resolution depends on the cost function. During my PhD I started to define new cost functions adapted to the new structure classes by a machine learning approach. Finally, the work allows significant improvements in terms of quality of results and computation. For example the approach directly allows the search for sub-optimal solutions or its use within heuristics derived from traditional heuristic methods.

Esta dissertação de mestrado compreende o estudo e a organização dos dossiês dos manuscritos literários com exemplares de trabalho, como parcela do catálogo analítico (catalogue raisonné) da série Manuscritos do Arquivo Mário de Andrade, proposto pelo projeto temático FAPESP/ IEB-USP/ FFLCH-USP, Estudo do processo de criação de Mário de Andrade nos manuscritos de seu arquivo, em sua correspondência, em sua marginália e em suas leituras, coordenado pela Profa. Dra. Telê Ancona Lopez. Nesta parcela, os dossiês de A escrava que não é Isaura, Amar, verbo intransitivo, Belazarte/Os contos de Belazarte, Macunaíma, o herói sem nenhum caráter, Os filhos da Candinha, Poesias e Obra imatura, compostos de notas de trabalho, planos, esboços e versões em autógrafos, datiloscritos e exemplares de trabalho, isto é, versões resultantes da justaposição de rasuras autógrafas ao texto impresso (editado), são ordenados, submetidos à análise documentária e codicológica, bem como interpretados, à luz da crítica genética. / This master degree dissertation comprises the study and organization of the dossiers of literary manuscripts with authors annotated copies, as part of the analytic catalogue (catalogue raisonné) from the series Manuscripts of Mário de Andrades Archive, proposed by the thematic project FAPESP/ IEB-USP/ FFLCH-USP named Study on Mário de Andrades process of creation in manuscripts of his Archive, in his correspondence, in his marginalia and in his readings, coordinated by Dr Telê Ancona Lopez. This part of the project presents the dossiers of A escrava que não é Isaura, Amar, verbo intransitivo, Belazarte/Os contos de Belazarte, Macunaíma, o herói sem nenhum caráter, Os filhos da Candinha, Poesias and Obra imatura. These dossiers comprise notes from the author, planes, drafts and handwriting versions, authors typewriting versions and authors annotated copies (resultant versions derived from juxtapositions of handwritten erasures in the edited text), that are ordered, submitted to the documental and codicological analysis, as well as interpreted, based on genetic criticism.

Esta dissertação de mestrado compreende o estudo e a organização dos dossiês dos manuscritos literários com exemplares de trabalho, como parcela do catálogo analítico (catalogue raisonné) da série Manuscritos do Arquivo Mário de Andrade, proposto pelo projeto temático FAPESP/ IEB-USP/ FFLCH-USP, Estudo do processo de criação de Mário de Andrade nos manuscritos de seu arquivo, em sua correspondência, em sua marginália e em suas leituras, coordenado pela Profa. Dra. Telê Ancona Lopez. Nesta parcela, os dossiês de A escrava que não é Isaura, Amar, verbo intransitivo, Belazarte/Os contos de Belazarte, Macunaíma, o herói sem nenhum caráter, Os filhos da Candinha, Poesias e Obra imatura, compostos de notas de trabalho, planos, esboços e versões em autógrafos, datiloscritos e exemplares de trabalho, isto é, versões resultantes da justaposição de rasuras autógrafas ao texto impresso (editado), são ordenados, submetidos à análise documentária e codicológica, bem como interpretados, à luz da crítica genética. / This master degree dissertation comprises the study and organization of the dossiers of literary manuscripts with authors annotated copies, as part of the analytic catalogue (catalogue raisonné) from the series Manuscripts of Mário de Andrades Archive, proposed by the thematic project FAPESP/ IEB-USP/ FFLCH-USP named Study on Mário de Andrades process of creation in manuscripts of his Archive, in his correspondence, in his marginalia and in his readings, coordinated by Dr Telê Ancona Lopez. This part of the project presents the dossiers of A escrava que não é Isaura, Amar, verbo intransitivo, Belazarte/Os contos de Belazarte, Macunaíma, o herói sem nenhum caráter, Os filhos da Candinha, Poesias and Obra imatura. These dossiers comprise notes from the author, planes, drafts and handwriting versions, authors typewriting versions and authors annotated copies (resultant versions derived from juxtapositions of handwritten erasures in the edited text), that are ordered, submitted to the documental and codicological analysis, as well as interpreted, based on genetic criticism.