Recently added

DSpace/Manakin Repository

Utrecht University Repository: Recent submissions

  • Structural variation and introgression from wild populations in East Asian cattle genomes confer adaptation to local environment 
    Xia, Xiaoting; Zhang, Fengwei; Li, Shuang; Luo, Xiaoyu; Peng, Lixin; Dong, Zheng; Pausch, Hubert; Leonard, Alexander S; Crysnanto, Danang; Wang, Shikang; Tong, Bin; Lenstra, Johannes A; Han, Jianlin; Li, Fuyong; Xu, Tieshan; Gu, Lihong; Jin, Liangliang; Dang, Ruihua; Huang, Yongzhen; Lan, Xianyong; Ren, Gang; Wang, Yu; Gao, Yuanpeng; Ma, Zhijie; Cheng, Haijian; Ma, Yun; Chen, Hong; Pang, Weijun; Lei, Chuzhao; Chen, Ningbo (BioMed Central, 2023-12)
    BACKGROUND: Structural variations (SVs) in individual genomes are major determinants of complex traits, including adaptability to environmental variables. The Mongolian and Hainan cattle breeds in East Asia are of taurine ...
  • Online Performance of Civic Participation:: What Bot-like Activity in the Persian Language Twittersphere Reveals About Political Manipulation Mechanisms 
    Honari, Ali; Alinejad, Donya (SAGE Publications Inc., 2022-12)
    In this paper, we reveal the understudied transnational dimensions of politically manipulative activity on social media. Specifically, we identify and investigate a bot-like Twitter network associated with the controversial ...
  • Enumeration of Minimal Tropical Connected Sets 
    Bliznets, Ivan; Sagunov, Danil; Tagin, Eugene (2023-04-25)
    A subset of vertices in a vertex-colored graph is called tropical if R subset. This paper is dedicated to the enumeration of all minimal tropical connected sets in various classes of graphs. We show that all minimal tropical ...
  • LSC'23 Chairs' Welcome 
    Gurrin, Cathal; Jonsson, Bjorn Por; Nguyen, Duc Tien Dang; Healy, Graham; Lokoc, Jakub; Zhou, Liting; Rossetto, Luca; Tran, Minh Triet; Hurst, Wolfgang; Bailer, Werner; Schoeffmann, Klaus (Association for Computing Machinery (ACM), 2023-06-12)
  • Improved Algorithms for Maximum Satisfiability and Its Special Cases 
    Brilliantov, Kirill; Alferov, Vasily; Bliznets, Ivan (2023)
    The Maximum Satisfiability (MAXSAT) problem is an optimization version of the Satisfiability problem (SAT) in which one is given a CNF formula with n variables and needs to find the maximum number of simultaneously satisfiable ...
  • Identifying Cluttering Edges in Near-Planar Graphs 
    van Wageningen, Simon; Mchedlidze, Tamara; Telea, Alex (The Eurographics Association, 2023)
    Planar drawings of graphs tend to be favored over non-planar drawings. Testing planarity and creating a planar layout of a planar graph can be done in linear time. However, creating readable drawings of nearly planar graphs ...
  • From User Stories to Domain Models: Recommending Relationships between Entities 
    Bragilosvki, Maxim; Dalpiaz, Fabiano; Sturm, Arnon (CEUR Workshop Proceedings, 2023)
    User stories are a common notation for expressing requirements, especially in agile development projects. While user stories provide a detailed account of the functional requirements, they fail to deliver a holistic view ...
  • A Structural Complexity Analysis of Synchronous Dynamical Systems 
    Hamm, Thekla; Eiben, Eduard; Ganian, Robert; Korchemna, Viktoriia (2023-06-27)
    Synchronous dynamic systems are well-established models that have been used to capture a range of phenomena in networks, including opinion diffusion, spread of disease and product adoption. We study the three most notable ...
  • Exploring the Potential of Large Language Models to Generate Formative Programming Feedback 
    Kiesler, Natalie; Lohr, Dominic; Keuning, Hieke (arXiv, 2023-08-31)
    Ever since the emergence of large language models (LLMs) and related applications, such as ChatGPT, its performance and error analysis for programming tasks have been subject to research. In this work-in-progress paper, ...
  • Effect Graph: Effect Relation Extraction for Explanation Generation 
    Karnstedt-Hulpus, Ioana; Kobbe, Jonathan; Stuckenschmidt, Heiner (Association for Computational Linguistics (ACL), 2023-06-13)
    Argumentation is an important means of communication. For describing especially arguments about consequences, the notion of effect relations has been introduced recently. We propose a method to extract effect relations ...
  • Effects of the spiral of silence on minority groups in recommender systems 
    Khan, Shah Noor; Herder, Eelco (Association for Computing Machinery (ACM), 2023-09-05)
    Recommender systems play a critical role in today’s data-rich landscape, where the abundance of information necessitates their ability to present the most relevant choices for individual users. However, it has been noted ...
  • Developing and Evaluating a Musical Attention Control Training Game Application 
    Volk, Anja; Hakvoort, Laurien; Schaefer, Rebecca S.; Chalkiadakis, Ermis; Bakkes, Sander (2023)
    Musical attention control training (MACT) is a Neurologic Music Therapy (NMT) technique to strengthen attention skills for people who may have attention defi-cits, for instance related to ADHD or Parkinson Disease (PD), ...
  • Accessible Algorithms for Applied Argumentation 
    Odekerken, Daphne; Borg, AnneMarie; Berthold, Matti (2023)
    Computational argumentation is a promising research area, yet there is a gap between theoretical contributions and practical applications. Bridging this gap could potentially raise interest in this topic even more. We argue ...
  • Group Responsibility for Exceeding Risk Threshold 
    Gladyshev, Maksim; Alechina, Natasha; Dastani, Mehdi; Doder, Dragan (2023)
    The need for tools and techniques to formally analyze and trace the responsibility for unsafe outcomes to decision-making actors is urgent. Existing formal approaches assume that the unsafe outcomes for which actors can ...
  • Complexity Framework for Forbidden Subgraphs {III:}: When Problems Are Tractable on Subcubic Graphs 
    Johnson, Matthew; Martin, Barnaby; Pandey, Sukanya; Paulusma, Daniël; Smith, Siani; van Leeuwen, Erik Jan (Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, 2023-08-21)
    For any finite set H = {H1, . . ., Hp} of graphs, a graph is H-subgraph-free if it does not contain any of H1, . . ., Hp as a subgraph. In recent work, meta-classifications have been studied: these show that if graph ...
  • Complexity Framework for Forbidden Subgraphs {III:}: When Problems are Tractable on Subcubic Graphs 
    Johnson, Matthew; Martin, Barnaby; Pandey, Sukanya; Paulusma, Daniël; Smith, Siani; van Leeuwen, Erik Jan (arXiv, 2023-05)
    For any finite set H={H1,…,Hp} of graphs, a graph is H-subgraph-free if it does not contain any of H1,…,Hp as a subgraph. In recent work, meta-classifications have been studied: these show that if graph problems satisfy ...
  • Complexity Framework for Forbidden Subgraphs IV: The Steiner Forest Problem 
    Bodlaender, Hans L.; Johnson, Matthew; Martin, Barnaby; Oostveen, Jelle; Pandey, Sukanya; Paulusma, Daniël; Smith, Siani; van Leeuwen, Erik Jan (arXiv, 2023-05-02)
    We study Steiner Forest on H-subgraph-free graphs, that is, graphs that do not contain some fixed graph H as a (not necessarily induced) subgraph. We are motivated by a recent framework that completely characterizes the ...
  • A Logic of East and West 
    Du, Heshan; Alechina, Natasha; Farjudian, Amin; Logan, Brian; Zhou, Can; Cohn, Anthony G. (Morgan Kaufmann Publishers, Inc., 2023)
    We propose a logic of east and west (LEW ) for points in 1D Euclidean space. It formalises primitive direction relations: east (E), west (W) and indeterminate east/west (Iew). It has a parameter τ ∈ N>1, which is referred ...
  • Probabilistic Temporal Logic for Reasoning about Bounded Policies 
    Motamed, Nima; Alechina, Natasha; Dastani, Mehdi; Doder, Dragan; Logan, Brian (IJCAI Organization, 2023)
    To build a theory of intention revision for agents operating in stochastic environments, we need a logic in which we can explicitly reason about their decision-making policies and those policies' uncertain outcomes. Toward ...
  • Multi-Agent Intention Recognition and Progression 
    Dann, Michael; Yao, Yuan; Alechina, Natasha; Logan, Brian; Meneguzzi, Felipe; Thangarajah, John (IJCAI Organization, 2023)
    For an agent in a multi-agent environment, it is often beneficial to be able to predict what other agents will do next when deciding how to act. Previous work in multi-agent intention scheduling assumes a priori knowledge ...