Dirk Leichsenring

dblp:225/9975 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
2since 2021 · last 2025
0009-0008-6354-0019ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 2 · 2 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021
YearPublicationVenuePosition
2025 TrADS: A Trust-Aware Decentralized Social Network
abstract
In today’s data-driven world, people are increasingly prioritising data privacy and control. This awareness has sparked an initiative for a decentralized web, where web applications no longer rely on centralized data storage. Solid, a prominent approach for a decentralized web, allows users to store their data in decentralized pods of their control. However, the integration of data from various and potentially untrusted sources can lead to malicious or harmful results and impair user experience. To solve this problem for social networks, we propose a trust-aware and decentralized web application called TrADS. It utilises the MVC pattern to integrate external data from Solid pods based on trust evaluations. In this article, we extend our first paper on TrADS with further details on related work assessment, concept and implementation. We are also extending our evaluation to a second international user study with another 64 participants. We measure the user experience instead of pure usability and form two separate groups of participants, one of which experiences the trust awareness of TrADS and one of which does not. The results do not yet show significant improvement in the user experience but show that after using trust awareness in a social network, users favour a network with such features.
Valentin Siegert, Dirk Leichsenring, Alejandro Wurts Santos, Martin Gaedke
J. Web Eng.2
2024 Trusting Decentralized Web Data in a Solid-Based Social Network
Valentin Siegert, Dirk Leichsenring, Martin Gaedke
ICWE2
2018 A Hybrid CPU/GPU Implementation of Computationally Intensive Particle Simulations Using OpenCL
abstract
Particle simulations are popular methods in computational science in areas, such as biology, chemistry, or astrophysics, in which the interaction of particles plays a major role. Efficient implementations of particle simulations often exploit a separation of computations by a cutoff radius. The pairwise interactions between particles are then computed only within the cutoff radius while interactions beyond the cutoff radius might be neglected or computed approximately. Thus, the efficient implementation of the calculations within the cutoff radius can be crucial for an overall efficiency. In this article, we study these computationally intensive inner cutoff radius calculations and propose a portable parallel implementation on a hybrid CPU/GPU architecture. Especially, we have chosen particle methods from the ScaFaCoS library and have implemented a parallel version of the cutoff-based algorithm in OpenCL. Performance results are shown for two different solvers of the ScaFaCoS library. The influences of the particle distribution and the utilized hardware are investigated.
Michael Hofmann 0002, Robert Kiesel, Dirk Leichsenring, Gudula Rünger
ISPDC3