Episciences.org
Not a member yet
6707 research outputs found
Sort by
Bayesian open games
No full textThis paper generalises the treatment of compositional game theory asintroduced by Ghani et al. in 2018, where games are modelled as morphisms of asymmetric monoidal category. From an economic modelling perspective, the notionof a game in the work by Ghani et al. is not expressive enough for manyapplications. This includes stochastic environments, stochastic choices byplayers, as well as incomplete information regarding the game being played. Thecurrent paper addresses these three issues all at once
Some Reflections on the Interface between Professional Machine Translation Literacy and Data Literacy
No full textDue to the widespread use of data-driven neural machine translation, both by professional translators and layperson users, an adequate machine translation literacy on the part of the users of this technology is becoming more and more important. At the same time, the increasing datafication of both the private and the business sphere requires an adequate data literacy in modern society. The present article takes a closer look at machine translation literacy and data literacy and investigates the interface between the two concepts. This is done to lay the preliminary theoretical foundations for a didactic project aiming to develop didactic resources for teaching data literacy in its machine translation-specific form to students of BA programmes in translation/specialised communication
To think of interdisciplinarity as intercurrence: Or, working as an interdisciplinary team to develop an ML tool to tackle online gender-based violence and hate speech
No full textThe paper reflects on the working of an interdisciplinary team consisting of researchers and activists from the field of computer science and social sciences involved in developing a user-facing, browser plug-in to detect and moderate instances of online gender-based violence, hate speech and harassment in Hindi, Indian English, and Tamil. There have been multiple calls within the field of Human-Computer Interaction (HCI) to include qualitative methods in one’s research design. These calls, while attuned to the importance of qualitative methods for HCI, ignore the intercurrent nature of different research methods, disciplines and practices. The paper borrows the concept of intercurrence from Orren & Skowronek (1996) and reorients it to explicate the practice of interdisciplinary research. It argues that intercurrence i.e. (in between, an occurrence within an occurrence) is a useful image to perceive interdisciplinarity wherein we argue that at any given point, an interdisciplinary team navigates multiple, yet simultaneously occurring temporal dimensions of differently disciplined bodies. An awareness of these multiple temporalities adds another dimension to thinking about conflicts and possibilities emerging from interdisciplinary practices and reorients interdisciplinary research towards unexpected outcomes
Coarse-grained multicomputer parallel algorithm using the four-splitting technique for the minimum cost parenthesizing problem
No full textDynamic programming is a technique widely used to solve several combinatory optimization problems. A well-known example is the minimum cost parenthesizing problem (MPP), which is usually used to represent a class of non-serial polyadic dynamic-programming problems. These problems are characterized by a strong dependency between subproblems. This paper outlines a coarse-grained multicomputer parallel solution using the four-splitting technique to solve the MPP. It is a partitioning technique consisting of subdividing the dependency graph into subgraphs (or blocks) of variable size and splitting large-size blocks into four subblocks to avoid communication overhead caused by a similar partitioning technique in the literature. Our solution consists in evaluating a block by computing and communicating each subblock of this block to reduce the latency time of processors which accounts for most of the global communication time. It requires O(n^3/p) execution time with O(k * \sqrt{p}) communication rounds. n is the input data size, p is the number of processors, and k is the number of times the size of blocks is subdivided
The Power-Set Construction for Tree Algebras
No full textWe study power-set operations on classes of trees and tree algebras. Our mainresult consists of a distributive law between the tree monad and theupwards-closed power-set monad, in the case where all trees are assumed to belinear. For non-linear ones, we prove that such a distributive law does notexist
Power structures in economics and society: Some remarks on the future of non-mainstream economics
No full textEconomic approaches that emphasize power dynamics in the political economy or rely on a non-mathematical, non-positivistic, pluralistic methodology are either almost marginalized in (heterodoxy) or excluded from (transdisciplinary non-mainstream) the field of economics. Relying on a combination of the Discursive Political Economy of Economics and a critical sociology of economic knowledge, this article gives a sociological explanation of these paradigmatic conditions and the related future prospects of non-mainstream research within economics in Germany, by incorporating social theory, discourse, and power analysis, and philosophy of science. In doing so, the article argues for a special role of economics in the political economy, which is associated with a legitimatizing and economic-knowledgeproducing function for non-epistemic issues. In a dialectic understanding of society and science, the implementation of classification rankings such as rankings and of a pyramidal hierarchy of publications is viewed as the disciplinary response to its social role. This results in an unequal distribution of power in the field of economics in Germany. The article concludes that a pluralistic change in modern economics cannot be expected, as long there is no social change in terms of the interconnection between the two demands for academic reputation and economic knowledge
Monoidal Width
No full textWe introduce monoidal width as a measure of complexity for morphisms inmonoidal categories. Inspired by well-known structural width measures forgraphs, like tree width and rank width, monoidal width is based on a notion ofsyntactic decomposition: a monoidal decomposition of a morphism is anexpression in the language of monoidal categories, where operations aremonoidal products and compositions, that specifies this morphism. Monoidalwidth penalises the composition operation along ``big'' objects, while itencourages the use of monoidal products. We show that, by choosing the correctcategorical algebra for decomposing graphs, we can capture tree width and rankwidth. For matrices, monoidal width is related to the rank. These examplessuggest monoidal width as a good measure for structural complexity of processesmodelled as morphisms in monoidal categories
Algebra of Self-Replication
No full textTypical arguments for results like Kleene's Second Recursion Theorem and theexistence of self-writing computer programs bear the fingerprints of equationalreasoning and combinatory logic. In fact, the connection of combinatory logicand computability theory is very old, and this paper extends this connection innew ways. In one direction, we counter the main trend in both computabilitytheory and combinatory logic of heading straight to undecidability. Instead,this paper proposes using several very small equational logics to examineresults in computability theory itself. These logics are decidable via termrewriting. We argue that they have something interesting to say aboutcomputability theory. They are closely related to fragments of combinatorylogic which are decidable, and so this paper contributes to the study of suchfragments. The paper has a few surprising results such as a classification ofquine programs (programs which output themselves) in two decidable fragments.The classification goes via examination of normal forms in term rewritingsystems, hence the title of the paper. The classification is an explanation ofwhy all quine programs (in any language) are "pretty much the same, except forinessential details." In addition, we study the relational structure whoseobjects are the programs with the relation "p expresses q" meaning that if theprogram p is run on nothing, then it eventually outputs the program q.Comment: Presented to the 39th Conference on the Mathematical Foundations of Programming Semantics (MFPS XXXIX). MFPS took place together at Indiana University Bloomington on June 19-23, 202
Proximal methods for point source localisation
No full textPoint source localisation is generally modelled as a Lasso-type problem onmeasures. However, optimisation methods in non-Hilbert spaces, such as thespace of Radon measures, are much less developed than in Hilbert spaces. Mostnumerical algorithms for point source localisation are based on the Frank-Wolfeconditional gradient method, for which ad hoc convergence theory is developed.We develop extensions of proximal-type methods to spaces of measures. Thisincludes forward-backward splitting, its inertial version, and primal-dualproximal splitting. Their convergence proofs follow standard patterns. Wedemonstrate their numerical efficacy
Fixpoint constructions in focused orthogonality models of linear logic
No full textOrthogonality is a notion based on the duality between programs and theirenvironments used to determine when they can be safely combined. For instance,it is a powerful tool to establish termination properties in classical formalsystems. It was given a general treatment with the concept of orthogonalitycategory, of which numerous models of linear logic are instances, by Hyland andSchalk. This paper considers the subclass of focused orthogonalities. Wedevelop a theory of fixpoint constructions in focused orthogonality categories.Central results are lifting theorems for initial algebras and final coalgebras.These crucially hinge on the insight that focused orthogonality categories arerelational fibrations. The theory provides an axiomatic categorical frameworkfor models of linear logic with least and greatest fixpoints of types. Wefurther investigate domain-theoretic settings, showing how to lift bifreealgebras, used to solve mixed-variance recursive type equations, to focusedorthogonality categories.Comment: 17 pages, MFPS 202