87 research outputs found

    LIPIcs, Volume 261, ICALP 2023, Complete Volume

    Get PDF
    LIPIcs, Volume 261, ICALP 2023, Complete Volum

    Empires of Knowledge: Chinese Students’ higher education experience at X University, UK

    Get PDF
    I discuss the difficulties Chinese international students (CIS) met in their UK higher education and how far their understanding of knowledge has been transformed by such experience from field research conducted at X University, UK, from 2017 to 2020. First, I flesh out the theoretical framework for the thesis: a view of power and knowledge influenced by Foucault and the interpretation of Chinese and western cultures in Sino-Hellenic studies. Second, I review the anthropological work on education, knowledge, and CIS to situate the basis and goals of the thesis. Third, I explore how legacies of thought in ancient and modern China and the transformation of higher education in the UK have influenced CIS’ overseas study. Fourth, I explore CIS’ life and social networking at X University, UK. Fifth, I explore CIS’ classroom learning experiences. I argue that students’ different reactions and attitudes toward the perceived confusion in classroom learning represent a collision between two ways of knowing: the traditional Chinese “sage style” and the Western “post-modern critical style”. Sixth, I explore research CIS’ study experience and demonstrate that the British and Chinese ways of PhD training suit students based on the specific experience of individuals. CIS still favour the “master’s family” tradition in Chinese research degree training after they studied in the UK. Seventh, I explore CIS’ academic writing practice in the UK. I illustrate that the difficulties they experience in UK academic writing could be explained by the different patterns of thought and ways of communication or persuasion in the two cultures. I also present the third way of knowing which CIS are exposed: the “objectivistic” Western natural science style. I conclude that though modern Western natural science’s way of knowing is the dominant knowledge style today in China and the UK, it also has its limitations. A hegemonic “empire of knowledge” deserves to be reflected on, criticised, and replaced by “exchanges and mutual learning” to inject fresh impetus into the development of human knowledge

    LIPIcs, Volume 274, ESA 2023, Complete Volume

    Get PDF
    LIPIcs, Volume 274, ESA 2023, Complete Volum

    Decidability and universality of quasiminimal subshifts

    Get PDF
    We introduce quasiminimal subshifts, subshifts having only finitely many subsystems. With N-actions, their theory essentially reduces to the theory of minimal systems, but with Z-actions, the class is much larger. We show many examples of such subshifts, and in particular construct a universal system with only a single proper subsystem, refuting a conjecture of [3]. (C) 2017 Elsevier Inc. All rights reserved

    Conjunctive Queries for Logic-Based Information Extraction

    Full text link
    This thesis offers two logic-based approaches to conjunctive queries in the context of information extraction. The first and main approach is the introduction of conjunctive query fragments of the logics FC and FC[REG], denoted as FC-CQ and FC[REG]-CQ respectively. FC is a first-order logic based on word equations, where the semantics are defined by limiting the universe to the factors of some finite input word. FC[REG] is FC extended with regular constraints. The second approach is to consider the dynamic complexity of FC.Comment: Based on the author's PhD thesis and contains work from two conference publications (arXiv:2104.04758, arXiv:1909.10869) which are joint work with Dominik D. Freydenberge

    Software Engineering with Incomplete Information

    Get PDF
    Information may be the common currency of the universe, the stuff of creation. As the physicist John Wheeler claimed, we get ``it from bit''. Measuring information, however, is a hard problem. Knowing the meaning of information is a hard problem. Directing the movement of information is a hard problem. This hardness comes when our information about information is incomplete. Yet we need to offer decision making guidance, to the computer or developer, when facing this incompleteness. This work addresses this insufficiency within the universe of software engineering. This thesis addresses the first problem by demonstrating that obtaining the relative magnitude of information flow is computationally less expensive than an exact measurement. We propose ranked information flow, or RIF, where different flows are ordered according to their FlowForward, a new measure designed for ease of ordering. To demonstrate the utility of FlowForward, we introduce information contour maps: heatmapped callgraphs of information flow within software. These maps serve multiple engineering uses, such as security and refactoring. By mixing a type system with RIF, we address the problem of meaning. Information security is a common concern in software engineering. We present OaST, the world's first gradual security type system that replaces dynamic monitoring with information theoretic risk assessment. OaST now contextualises FlowForward within a formally verified framework: secure program components communicate over insecure channels ranked by how much information flows through them. This context helps the developer interpret the flows and enables security policy discovery, adaptation and refactoring. Finally, we introduce safestrings, a type-based system for controlling how the information embedded within a string moves through a program. This takes a structural approach, whereby a string subtype is a more precise, information limited, subset of string, ie a string that contains an email address, rather than anything else

    Low-Latency Sliding Window Algorithms for Formal Languages

    Get PDF
    Low-latency sliding window algorithms for regular and context-free languages are studied, where latency refers to the worst-case time spent for a single window update or query. For every regular language LL it is shown that there exists a constant-latency solution that supports adding and removing symbols independently on both ends of the window (the so-called two-way variable-size model). We prove that this result extends to all visibly pushdown languages. For deterministic 1-counter languages we present a O(log⁥n)\mathcal{O}(\log n) latency sliding window algorithm for the two-way variable-size model where nn refers to the window size. We complement these results with a conditional lower bound: there exists a fixed real-time deterministic context-free language LL such that, assuming the OMV (online matrix vector multiplication) conjecture, there is no sliding window algorithm for LL with latency n1/2−ϔn^{1/2-\epsilon} for any Ï”>0\epsilon>0, even in the most restricted sliding window model (one-way fixed-size model). The above mentioned results all refer to the unit-cost RAM model with logarithmic word size. For regular languages we also present a refined picture using word sizes O(1)\mathcal{O}(1), O(log⁥log⁥n)\mathcal{O}(\log\log n), and O(log⁥n)\mathcal{O}(\log n).Comment: A short version will be presented at the conference FSTTCS 202

    Low-Latency Sliding Window Algorithms for Formal Languages

    Get PDF
    Low-latency sliding window algorithms for regular and context-free languages are studied, where latency refers to the worst-case time spent for a single window update or query. For every regular language L it is shown that there exists a constant-latency solution that supports adding and removing symbols independently on both ends of the window (the so-called two-way variable-size model). We prove that this result extends to all visibly pushdown languages. For deterministic 1-counter languages we present a ?(log n) latency sliding window algorithm for the two-way variable-size model where n refers to the window size. We complement these results with a conditional lower bound: there exists a fixed real-time deterministic context-free language L such that, assuming the OMV (online matrix vector multiplication) conjecture, there is no sliding window algorithm for L with latency n^(1/2-?) for any ? > 0, even in the most restricted sliding window model (one-way fixed-size model). The above mentioned results all refer to the unit-cost RAM model with logarithmic word size. For regular languages we also present a refined picture using word sizes ?(1), ?(log log n), and ?(log n)

    LIPIcs, Volume 248, ISAAC 2022, Complete Volume

    Get PDF
    LIPIcs, Volume 248, ISAAC 2022, Complete Volum
    • 

    corecore