328,123 research outputs found

    THE TRANSLATION ANALYSIS OF PUN IN THE FILM ENTITLED MADAGASCAR

    Full text link
    This study is focused the analysis on the types of pun, the analysis of translation techniques in translating pun, and the analysis of the accuracy. The purposes of this study were to describe the types of pun found in the movie and to discover translation techniques employed by the translator and the quality of the translation in terms of accuracy in translating pun . This study was a descriptive qualitative research where the researcher only described all the facts on the existed data. The data were taken from the film entitled Madagascar by means of purposive sampling. There were 21 data applied in this research. In order to obtain reliable result on the quality of translation, questionnaires were distributed to the three raters to define the accuracy of the translation . The translation techniques employed in the translation are three (3). They are: pun is translated into non pun (16 data), pun in the ST is copied into TT (2 data), and pun is rendered with other rhetorical device (1 datum). The results of the study shows that there are 15.79 % of the data are accurate translation and there are 84.21 % of the data are less accurate translation. The figure shows that the translations are mostly not so accurate. The researcher recommended the translator to enhance his/her knowledge on wordplay in order to produce a quality translation. Since the focus of this study is at the level of accuracy, the researcher expected that other students or researchers would like to enhance the study on the related topic such as the readability and acceptability

    Fair Termination for Resource-Aware Active Objects

    No full text
    Active object systems are a model of distributed computation that has been adopted for modelling distributed systems and business process workflows. This field of modelling is, in essence, concurrent and resource-aware, motivating the development of resource-aware formalisations on the active object model. The contributions of this work are the development of a core calculus for resource-aware active objects together with a type system ensuring that well-typed programs are fairly terminating, i.e., they can always eventually terminate. To achieve this, we combine techniques from graded semantics and type systems, which are quite well understood for sequential programs, with those for fair termination, which have been developed for synchronous~sessions

    A software framework for adaptive and interoperable internet-delivered psychological treatments

    Full text link
    Articles II and V are © 2020 IEEE. Reprinted, with permission. In reference to IEEE copyrighted material which is used with permission in this thesis, the IEEE does not endorse any of Western Norway University of Applied Sciences’s products or services. Internal or personal use of this material is permitted. If interested in reprinting/republishing IEEE copyrighted material for advertising or promotional purposes or for creating new collective works for resale or redistribution, please go to http://www.ieee.org/publications_standards/publications/rights/rights_link.html to learn how to obtain a License from RightsLink.BACKGROUND Statistics unveil the predominance of mental and neurological disorders globally. Handling these mental and neurological disorders is economically, physically and emotionally challenging. Proper healthcare treatments would have been an ideal solution for these people suffering from these disorders. However, provided limited healthcare resources, an alternative solution is to use the Internet to provide psychological treatments. The use of Internet-Delivered Psychological Treatments (IDPT) can accelerate treatments for people globally at a lower cost. While such IDPT systems have been practised at volume, user adherence is low with high dropout rates. Low adherence in treatments is primarily due to the IDPT system’s inability to adapt treatments according to user needs, context and preferences. OBJECTIVE This study is accomplished in collaboration with a large interdisciplinary project entitled as INTROMAT. INTROMAT brings together ICT researchers, ICT industries, health researchers, patients, clinicians, and patients next of kin to reach its vision. The project’s vision is to improve public mental health through innovative technologies. The main objective of this thesis, inclined to fulfil this vision, is to design, develop and evaluate an adaptive IDPT framework. METHODS Based on the INTROMAT project’s problem domain and goals, we started with the study of state-of-the-art works, including systematic literature review, evaluation of available systems, analysis of the previous studies on the problem domain, and evaluation of past case studies. Based on these studies, we identified two primary gaps in the current IDPT systems, lack of adaptiveness and limited interoperability. Then, we used MDE and Domain-Driven Design (DDD) techniques to address these two gaps. RESULTS We proposed a software framework for developing adaptive, reusable, and interoperable Internet-Delivered Psychological Treatments (IDPT), referred hereto as OpenIDPT Framework. The OpenIDPT Framework includes a) a Reference Model (RM), b) a Reference Architecture (RA), c) an Information Architecture (IA), and d) an open-source implementation of an adaptive IDPT system.The reference model reveals the adaptive elements (what to adapt), adaptive dimensions (on what basis to adapt), information architecture (how to structure content), and strategies (how to adapt) of an adaptive IDPT system. The Reference Architecture unveils the technical architecture of an adaptive IDPT system. The information architecture guides how to structure and organize the content for better discoverability and comprehensibility. To evaluate the proposed RA of adaptive IDPT systems, we implemented a prototype as an Open-Source Software. We refer to it as Open-Source Adaptive IDPT System (OSAIS). We used Design Science Research (DSR) evaluation methods to assess the efficacy of the proposed artefacts and their ability to address identified research gaps. Our preliminary results demonstrate that the proposed artefacts exhibit capabilities to use comprehensive user profiling techniques to adapt interventions using different rule-based engines, recommendation systems, and artificial intelligence (AI) based algorithms. As a Proof-of-Concept of AI-based algorithms, we present an adaptive strategy based on Natural Language Processing (NLP) techniques that analyze patientauthored text data and extract depression symptoms corresponding to a clinically established psychometric assessment questionnaire PHQ-9. The strategy utilizes the proposed novel Word Embedding (Depression2Vec) to extract depression symptoms from patient-authored text and adapts psychological treatments based on the absence or presence of depression symptoms. Furthermore, to obtain interoperability in the OpenIDPT Framework, we created an open-source Resource Server (RS) based on GraphQL. An RS is a web application that can read, write, update, and delete (CRUD) HL7 FHIR resources. HL7 FHIR is an open healthcare IT standard (analogous to data structure) for healthcare data exchange. GraphQL is a data query and manipulation language for Web-Service communications. CONCLUSION This study demonstrates the feasibility of using an adaptive system to enhance user adherence. With the ubiquity of ambient intelligence and predictive algorithms, further study on how to combine these IoT technologies with the adaptive system is prudent and exciting.publishedVersionParts of this dissertation are © IEEE, and will not be available

    Système d'archivage et de recherche de filigranes

    No full text
    Rauber Christian, Tschudin Peter F., Pun Thierry. Système d'archivage et de recherche de filigranes. In: Gazette du livre médiéval, n°31. Automne 1997. pp. 31-40

    Every Pun Intended

    Full text link
    When it comes to wordplay, I’m the pun and only. Or I had been for the past decade

    Open Data for Bankers example

    No full text
    &lt;p&gt;LICENSE&lt;br&gt; This content has been generated via the EU H2020 RIA project COEMS - Continuous Observation of Embedded Multicore Systems&lt;br&gt; https://www.coems.eu&lt;/p&gt; &lt;p&gt;This work is licensed under a Creative Commons Attribution 4.0 International License, see https://creativecommons.org/licenses/by/4.0/.&lt;/p&gt; &lt;p&gt;The COEMS project is funded through the European Horizon 2020 program under grant agreement no. 732016.&lt;/p&gt; &lt;p&gt;OVERVIEW&lt;br&gt; This folder contains Open Data for the &quot;bank_lock&quot; case of study for the HAVELUND 65 paper.&lt;br&gt; The data is generated in the context of the COEMS EU H2020 project, which provides a novel platform for online monitoring of multicore systems.&lt;br&gt; For the case of study, we collect these data: the source code, the compiled instrumented binary file, the execution traces, the result of analyzing those execution traces using Tessla specifications [1], and the Tessla specifications.&lt;br&gt; The experiment consists of a &#39;default&#39; version, that shows the ideal implementation and execution of a multicore code with no errors; and a &#39;race&#39; version which include a potential data race error.&lt;br&gt; The evaluation of Tessla specifications over the execution traces should point out potential problems in the code.&lt;br&gt; The content of this folder is organised in several subfolders depending on the selected configuration (i.e., &#39;default&#39; or &#39;race&#39;).&lt;br&gt; In particular, the folder hierarchy is:&lt;br&gt; Root:&lt;br&gt; |_&gt; case_study_name:&lt;br&gt; &nbsp; &nbsp; |_&gt; src/&lt;br&gt; &nbsp; &nbsp; |_&gt; bin/&lt;br&gt; &nbsp; &nbsp; |_&gt; spec/&lt;br&gt; &nbsp; &nbsp; |_&gt; traces/&lt;br&gt; &nbsp; &nbsp; &nbsp; &nbsp; |_&gt; default&lt;br&gt; &nbsp; &nbsp; &nbsp; &nbsp; |_&gt; race&lt;br&gt; &nbsp; &nbsp; |_&gt; result/&lt;br&gt; &nbsp; &nbsp; &nbsp; &nbsp; |_&gt; default&lt;br&gt; &nbsp; &nbsp; &nbsp; &nbsp; |_&gt; race&lt;/p&gt; &lt;p&gt;The src/ folder contains a flattened version of the original C code, which is shrunk into a single file in the case of several source files.&lt;br&gt; The bin/ folder contains the compilation and instrumentation of the C file into an ARM binary executable.&nbsp;&lt;br&gt; The spec/ folder contains the Tessla specifications.&lt;br&gt; The traces/ folder contains the result of processing the hw.tessla specification by the COEMS box.&lt;br&gt; The result/ folder contains the result of evaluating the sw.tessla specification on the COEMS box output traces with the Tessla interpreter.&lt;br&gt; The intermediate traces and Tessla reports are classified in several subfolders depending on the target configuration (i.e., &#39;default&#39; or &#39;race&#39;).&lt;/p&gt; &lt;p&gt;[1] https://www.tessla.io/&lt;/p&gt; &lt;p&gt;SPECIFIC CONFIGURATION&lt;/p&gt; &lt;p&gt;This README file and the rest of the data in this folder have been automatically created.&lt;br&gt; The first part of the experiments (hw.tessla) are executed on the COEMS specific hardware in order to efficiently run the online monitoring and filtering.&lt;br&gt; The output of the COEMS box is saved into the traces/ folder.&lt;br&gt; In order to complete the analysis for race checking, a Personal Computer must run the second part of the Tessla specification (sw.tessla) over the output of the COEMS box.&lt;br&gt; Data race reports are precomputed in the result/ folder.&lt;/p&gt; &lt;p&gt;&lt;br&gt; COMMAND LINE&lt;/p&gt; &lt;p&gt;&lt;br&gt; Generated traces&lt;br&gt; -------------------------&lt;br&gt; The execution of the ARM binary will automatically emit the traces to the COEMS box, which will filter the first part of the events using the hw.tessla specification.&lt;br&gt; The COEMS box then emits preprocessed traces that can be analyzed by the Tessla interpreter using the sw.tessla specification.&lt;/p&gt; &lt;p&gt;COEMS box output traces (i.e., for the hw.tessla spec):&lt;br&gt; banker_lock/traces/default/coems_output_trace.log&lt;br&gt; banker_lock/traces/race/coems_output_trace.log&lt;/p&gt; &lt;p&gt;Tessla interpreter data race report (i.e., for the sw.tessla spec):&lt;br&gt; banker_lock/result/default/data_race_report.txt&lt;br&gt; banker_lock/result/race/data_race_report.txt&lt;/p&gt; &lt;p&gt;&lt;br&gt; Analyze the traces using Tessla specs&lt;br&gt; -------------------------------------&lt;br&gt; The following software is required in order to analyze the traces obtained in the previous step:&lt;br&gt; 1) The TeSSLa interpreter (tessla.jar), which will run the sw.tessla stage.&lt;/p&gt; &lt;p&gt;We use the next alias:&lt;/p&gt; &lt;p&gt;alias tessla=&quot;java -jar tessla.jar&quot;&lt;/p&gt; &lt;p&gt;&lt;br&gt; TeSSLa report for the HW trace&lt;br&gt; ````&lt;br&gt; tessla banker_lock/spec/sw.tessla banker_lock/traces/default/coems_output_trace.log > banker_lock/result/default/data_race_report.txt<br> tessla banker_lock/spec/sw.tessla banker_lock/traces/race/coems_output_trace.log &gt; banker_lock/result/race/data_race_report.txt&lt;br&gt; ````&lt;/p&gt; &lt;p&gt;In the &#39;default&#39; scenario, the TeSSLa interpreter should report potential issues in the default/data_race_report.txt.&lt;br&gt; Because of the eraser algorithm, it shows false positives (i.e., data races that happen after pthread_join).&lt;br&gt; E.g.,&lt;br&gt; 105993503535: error_0_in_line = 96&lt;/p&gt; &lt;p&gt;In the &#39;race&#39; scenario, the TeSSLa interpreter should report potential issues in the race/data_race_report.txt.&lt;br&gt; E.g.:&lt;br&gt; 105847960743: error_0_in_line = 52.&lt;/p&gt

    Implementation Correctness for Replicated Data Types, Categorically

    No full text
    Replicated Data Types (rdts) have been introduced as an abstraction for dealing with weakly consistent data stores, which may (temporarily) expose multiple, inconsistent views of their state. In the literature, rdts are usually presented in set-theoretical terms: Only recently different specification flavours have been proposed, among them a denotational formalism that inter alia captures specification refinement. So far, however, no abstract model has been proposed for the implementations and their correctness with respect to specifications. This paper fills the gap: We first give categorical constructions for distilling an operational model from a specification, as well as its implementations, and then we define a notion of implementation correctness via simulation
    corecore