检索结果-内蒙古大学图书馆

arXiv 2025年

作者： Grigoriev, Alexander Faulkner, Katherine Department of Data Analytics and Digitalisation Maastricht University Netherlands

Inspired by notorious combinatorial optimization problems on graphs, in this paper we propose a series of related problems defined using a metric space and topology determined by a graph. Particularly, we present Independent Set, Vertex Cover, Chromatic Number and Treewidth problems on, so-called, continuous graphs where every edge is represented by a unit-length continuous interval rather than by a pair of vertices. If any point of any unit-interval edge is considered as a possible member of a hitting set or a cover, the classical combinatorial problems become trickier and many open questions arise. Notably, in many real-life applications, such continuous view on a graph is more natural than the classic combinatorial definition of a *** Codes 05C99 (Primary) 05C85 (Secondary) © 2025, CC BY.

关键词： Combinatorial optimization

来源：评论

学校读者我要写书评

暂无评论

Affective Polarization Amongst Swedish Politicians

arXiv

引用

arXiv 2025年

作者： t'Serstevens, François Cerina, Roberto Peper, Gustav Department of Data Analytics and Digitalisation Maastricht University 53 Tongersetraat Maastricht6211 LM Netherlands Department of Media Studies University of Amsterdam GN Amsterdam Turfdraagsterpad 9 1090 Netherlands

This study investigates affective polarization among Swedish politicians on Twitter from 2021 to 2023, including the September 2022 parliamentary election. Analysing over 25,000 tweets and employing large language models (LLMs) for sentiment and political classification, we distinguish between positive partisanship (support for one’s own side) and negative partisanship (criticism of opponents). Our findings are contingent on the definition of the in-group. When political in-groups are defined at the ideological bloc level, negative and positive partisanship occur at similar rates. However, when the in-group is defined at the party level, negative partisanship becomes significantly more dominant and is 1.51 times more likely [1.45, 1.58]. This effect is even stronger among extreme politicians, who engage in negativity more than their moderate counterparts. Negative partisanship also proves to be a strategic choice for online visibility, attracting 3.18 more likes and 1.69 more retweets on average. By adapting methods developed for two-party systems and leveraging LLMs for Swedish-language analysis, we provide novel insights into how multiparty politics shapes polarizing discourse. Our results underscore both the strategic appeal of negativity in digital spaces and the growing potential of LLMs for large-scale, non-English political research. © 2025, CC BY.

关键词： Tweets

来源：评论

学校读者我要写书评

暂无评论

Titanium dioxide levels in food and other ingested consumer products: A systematic review

Food Chemistry Advances

引用

Food Chemistry Advances 2025年 6卷

作者： Van Den Neucker, Sophie Demaegdt, Heidi Cerina, Roberto Mast, Jan Grigoriev, Alexander De Broe, Sofie Cheyns, Karlien Sciensano Chemical and Physical Health Risks Trace Elements and Nanomaterials Brussels Belgium Maastricht University School of Business and Economics Department of Data Analytics and Digitalisation Maastricht Netherlands University of Amsterdam Institute for Logic Language and Computation Department of Media Studies Amsterdam Netherlands Sciensano Data Governance Brussels Belgium

来源：评论

学校读者我要写书评

暂无评论

From planar to annular to toroidal bracket polynomials for pseudo knots and links

arXiv

引用

arXiv 2025年

作者： Diamantis, Ioannis Lambropoulou, Sofia Mahmoudi, Sonia Department of Data Analytics and Digitalisation Maastricht University School of Business and Economics P.O.Box 616 Maastricht6200 MD Netherlands School of Applied Mathematical and Physical Sciences National Technical University of Athens Zografou Campus AthensGR-15780 Greece Aobanced Institute for Materials Research Tohoku University 2-1-1 Katahira Aobaku Sendai980-8577 Japan RIKEN ITHEMS 2-1 Hirosawa Wako Saitama351-0198 Japan

Pseudo links are equivalence classes under Reidemeister-type moves of link diagrams containing crossings with undefined over and under information. In this paper, we extend the Kauffman bracket and Jones polynomials from planar pseudo links to pseudo links in the annulus and in the torus, and their respective lifts from the three-space to the solid torus and the thickened torus. Moreover, since annular and toroidal pseudo links can be represented as mixed links in the three-sphere, we also introduce the respective Kauffman bracket and Jones polynomials for their planar mixed link diagrams. Our work provides new tools for the study of annular and toroidal pseudo *** Codes 57K10, 57K12, 57K14, 57K35 Copyright © 2025, The Authors. All rights reserved.

关键词： Polynomials

来源：评论

学校读者我要写书评

暂无评论

Recommendation fairness and where to find it: An empirical study on fairness of user recommender systems

Recommendation fairness and where to find it: An empirical s...

引用

2023 IEEE International Conference on Big data, Bigdata 2023

作者： Tommasel, Antonela Assent, Ira Aarhus University Department of Computer Science Digit Aarhus University Centre for Digitalisation Big Data and Data Analytics Denmark Isistan CONICET-UNCPBA Argentina

ISBN: (纸本)9798350324457

Recommender systems play a crucial role in how users consume information and establish new social relations. However, different factors (such as the data collection process, the designed recommendation model, or even the interpretation of findings) could make recommenders (unintendedly) prone to biases, favouring certain user groups or items, thus resulting in unfair outcomes. Recommenders also face fairness criticism for inducing filter bubbles, echo chambers, and, more generally, facilitating opinion manipulation. In this work, we study the impact of user recommender systems on fairness. To this end, we carry out a user recommendation task on a politically polarized Twitter data collection. Then, we evaluate how the different politically aligned user groups experience recommendation quality. Finally, we explore causal models to identify data and model-related features that could affect the fairness of recommender outcomes. Our study shows that political alignment is associated with the unfairness of recommenders affecting not only the relevance of recommendations, but also their diversity and the resulting interaction patterns. © 2023 IEEE.

关键词：

来源：评论

学校读者我要写书评

暂无评论

How does object fatness impact the complexity of packing in D dimensions? 30

How does object fatness impact the complexity of packing in ...

引用

30th International Symposium on Algorithms and Computation, ISAAC 2019

作者： Kisfaludi-Bak, Sándor Marx, Dániel Van Der Zanden, Tom C. Max Planck Institut für Infromatik Saarbrücken Germany Department of Data Analytics and Digitalisation Maastricht University Netherlands

ISBN: (纸本)9783959771306

Packing is a classical problem where one is given a set of subsets of Euclidean space called objects, and the goal is to find a maximum size subset of objects that are pairwise non-intersecting. The problem is also known as the Independent Set problem on the intersection graph defined by the objects. Although the problem is NP-complete, there are several subexponential algorithms in the literature. One of the key assumptions of such algorithms has been that the objects are fat, with a few exceptions in two dimensions;for example, the packing problem of a set of polygons in the plane surprisingly admits a subexponential algorithm. In this paper we give tight running time bounds for packing similarly-sized non-fat objects in higher dimensions. We propose an alternative and very weak measure of fatness called the stabbing number, and show that the packing problem in Euclidean space of constant dimension d > 3 for a family of similarly sized objects with stabbing number α can be solved in 2O(n1−1/dα) time. We prove that even in the case of axis-parallel boxes of fixed shape, there is no 2o(n1−1/dα) algorithm under ETH. This result smoothly bridges the whole range of having constant-fat objects on one extreme (α = 1) and a subexponential algorithm of the usual running time, and having very "skinny" objects on the other extreme (α = n1/d), where we cannot hope to improve upon the brute force running time of 2O(n), and thereby characterizes the impact of fatness on the complexity of packing in case of similarly sized objects. We also study the same problem when parameterized by the solution size k, and give a nO(k1−1/dα) algorithm, with an almost matching lower bound: there is no algorithm with running time of the form f(k)no(k1−1/dα/ log k) under ETH. One of our main tools in these reductions is a new wiring theorem that may be of independent interest. © Sándor Kisfaludi-Bak, Dániel Marx, and Tom C. van der Zanden;licensed under Creative Commons License CC-BY

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

THREE-DIMENSIONAL VISUALIZATION OF ENERGY CONSUMPTION data IN ADDITIVE MANUFACTURING

THREE-DIMENSIONAL VISUALIZATION OF ENERGY CONSUMPTION DATA I...

引用

ASME 2024 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference, IDETC-CIE 2024

作者： Hansen, Morten Hejlskov Vernica, Teodor Mansour, Rami Ramanujan, Devarajan Department of Mechanical and Production Engineering Aarhus University Aarhus Denmark Center for Digitalisation Big Data and Data Analytics Aarhus University Aarhus Denmark

ISBN: (纸本)9780791888346

This paper addresses the growing interest in design for sustainable manufacturing, focusing particularly on Additive Manufacturing (AM). While AM offers advantages like customized geometries and reduced material usage, there’s a need to address energy consumption in 3D printing beyond the conventional emphasis on material reduction. While previous research has explored various techniques for predicting and reducing the energy consumption of AM processes, there is limited work on guiding designers to generate more energy-efficient designs via localized geometric changes. This paper introduces a method to visualize energy consumption directly on 3D objects, aiming to guide designers in optimizing object shapes for sustainability. The methodology presented in the paper involves several steps: data collection, interpolation of positional points, classification of objects, support structures, and rapid movements. Following this, support and rapid movement energy are allocated to the printed object. Finally, the energy required for printing the object is directly visualized on a 3D model of the object using a mesh interpolation scheme. A use case demonstrating the potential application of the visualization method for reducing printing energy consumption is presented, through introducing a local shape modification to an axle bracket based on the visualization information. This modification resulted in a 7.5% energy reduction in this analyzed region compared to the original design. Thus, results showcase the ability of the proposed visualization method to support sustainability-oriented design for AM, through incorporating local shape modifications. © 2024 by ASME.

关键词： Smart manufacturing

来源：评论

学校读者我要写书评

暂无评论

Semantic grounding of LLMs using knowledge graphs for query reformulation in medical information retrieval

Semantic grounding of LLMs using knowledge graphs for query ...

引用

2024 IEEE International Conference on Big data, Bigdata 2024

作者： Tommasel, Antonela Assent, Ira Isistan CONICET-UNCPBA Argentina Aarhus University Department of Computer Science Denmark Digit Aarhus University Centre for Digitalisation Big Data and Data Analytics Denmark

ISBN: (纸本)9798350362480

The widespread adoption of electronic health records has generated a vast amount of patient-related data, mostly presented in the form of unstructured text, which could be used for document retrieval. However, querying these texts in full could present challenges due to their unstructured and lengthy nature, as they may contain noise or irrelevant terms that can interfere with the retrieval process. Recently, large language models (LLMs) have revolutionized natural language processing tasks. However, despite their promising capabilities, their use in the medical domain has raised concerns due to their lack of understanding, hallucinations, and reliance on outdated knowledge. To address these concerns, we evaluate a Retrieval Augmented Generation (RAG) approach that integrates medical knowledge graphs with LLMs to support query refinement in medical document retrieval tasks. Our initial findings from experiments using two benchmark TREC datasets demonstrate that knowledge graphs can effectively ground LLMs in the medical domain. © 2024 IEEE.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

GPU-INSCY: A GPU-parallel algorithm and tree structure for efficient density-based subspace clustering 24

GPU-INSCY: A GPU-parallel algorithm and tree structure for e...

引用

Advances in database Technology - 24th International Conference on Extending database Technology, EDBT 2021

作者： Jørgensen, Jakob Rødsgaard Scheel, Katrine Assent, Ira Department of Computer Science Aarhus University Denmark Department of Computer Science DIGIT Aarhus University Centre for Digitalisation Big Data and Data Analytics Aarhus University Denmark

ISBN: (纸本)9783893180844

Subspace clustering is the task of grouping objects based on mutual similarity in subspaces of the full-dimensional space. The INSCY algorithm extends the well-known density-based clustering algorithm DBSCAN. It finds dimensionality-unbiased non-redundant subspace clusters using a tree structure to speed up the processing of subspaces. Still, finding density-based clusters in all subspaces implies an exponential search space in the number of dimensions. Thus, the running time of INSCY is still measured in hours on even small datasets of 2000 points. For larger datasets, it becomes prohibitively expensive. To benefit from INSCY for real-world sized datasets, we propose a novel GPU-parallel approach that runs on standard graphics cards. To utilize the many cores of the GPU, we need new algorithmic strategies that fit the computational model of the GPU. While the GPU provides a large number of threads, traditional algorithms incur diverging threads and poor memory alignment, both of which lead to idle time and poor runtime performance. In INSCY, extracting subspace regions from the SCY-tree structure and the density-based clustering of regions itself are thus unfit for the GPU. Our novel GPU-friendly algorithm GPU-INSCY computes the same subspace clustering as INSCY at dramatically reduced runtimes. To achieve this, we devise a restructured SCY-tree index-structure and associated operations for the GPU, as well as a GPU-parallel density-based subspace clustering. We experimentally show that GPU-INSCY scales well with the size of the dataset and the number of dimensions, and improves the running time of INSCY by a factor of several thousand for large datasets of high dimensionality. © 2021 Copyright held by the owner/author(s).

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

Detectability of hierarchical communities in networks

引用

Physical Review E 2024年第3期110卷 034306页

作者： Leto Peel Michael T. Schaub Department of Data Analytics and Digitalisation School of Business and Economics Department of Computer Science

We study the problem of recovering a planted hierarchy of partitions in a network. The detectability of a single planted partition has previously been analyzed in detail and a phase transition has been identified below which the partition cannot be detected. Here we show that, in the hierarchical setting, there exist additional phases in which the presence of multiple consistent partitions can either help or hinder detection. Accordingly, the detectability limit for nonhierarchical partitions typically provides insufficient information about the detectability of the complete hierarchical structure, as we highlight with several constructive examples.

关键词： Community structure Complex systems Network structure Patterns in complex systems Block models data analysis

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：