@inproceedings{63706,
  author       = {{Schmidbauer, Marcus and Opris, Andre and Bossek, Jakob and Neumann, Frank and Sudholt, Dirk}},
  booktitle    = {{Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2024, Melbourne, VIC, Australia, July 14-18, 2024}},
  editor       = {{Li, Xiaodong and Handl, Julia}},
  publisher    = {{ACM}},
  title        = {{{Guiding Quality Diversity on Monotone Submodular Functions: Customising the Feature Space by Adding Boolean Conjunctions}}},
  doi          = {{10.1145/3638529.3654160}},
  year         = {{2024}},
}

@inproceedings{63708,
  author       = {{Klüttermann, Simon and Rutinowski, Jérôme and Polachowski, Frederik and Nguyen, Anh and Grimme, Britta and Roidl, Moritz and Müller, Emmanuel}},
  booktitle    = {{International Conference on Machine Learning and Applications, ICMLA 2024, Miami, FL, USA, December 18-20, 2024}},
  editor       = {{Wani, M. Arif and Angelov, Plamen and Luo, Feng and Ogihara, Mitsunori and Wu, Xintao and Precup, Radu-Emil and Ramezani, Ramin and Gu, Xiaowei}},
  pages        = {{1705–1711}},
  publisher    = {{IEEE}},
  title        = {{{On the Effectiveness of Heterogeneous Ensemble Methods for Re-Identification}}},
  doi          = {{10.1109/ICMLA61862.2024.00263}},
  year         = {{2024}},
}

@inproceedings{63705,
  author       = {{Bossek, Jakob and Grimme, Christian}},
  booktitle    = {{Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2024, Melbourne, VIC, Australia, July 14-18, 2024}},
  editor       = {{Li, Xiaodong and Handl, Julia}},
  publisher    = {{ACM}},
  title        = {{{Generalised Kruskal Mutation for the Multi-Objective Minimum Spanning Tree Problem}}},
  doi          = {{10.1145/3638529.3654165}},
  year         = {{2024}},
}

@inproceedings{64104,
  author       = {{Scheideler, Christian and Hinnenthal , Kristian  and Liedtke, David Jan}},
  title        = {{{Efficient Shape Formation by 3D Hybrid Programmable Matter: An Algorithm for Low Diameter Intermediate Structures. SAND 2024: 15:1-15:20}}},
  year         = {{2024}},
}

@inproceedings{64103,
  author       = {{Scheideler, Christian and Padalkin, Andreas}},
  pages        = {{65 -- 75}},
  title        = {{{Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter. }}},
  year         = {{2024}},
}

@inproceedings{64106,
  author       = {{Scheideler, Christian and Kostitsyna, Irina  and Liedtke, David Jan}},
  title        = {{{Universal Coating by 3D Hybrid Programmable Matter.}}},
  year         = {{2024}},
}

@article{64100,
  author       = {{Scheideler, Christian and Padalkin, Andreas and Warner, Daniel}},
  journal      = {{The structural power of reconfigurable circuits in the amoebot model. Nat. Comput. 23(4): 603-625 (2024)}},
  pages        = {{603 -- 625}},
  title        = {{{The structural power of reconfigurable circuits in the amoebot model. }}},
  year         = {{2024}},
}

@article{64101,
  author       = {{Scheideler, Christian and Coy, Sam  and Czumaj, Arthur  and Schneider, Philipp  and Werthmann, Julian}},
  journal      = {{Routing schemes for hybrid communication networks. Theor. Comput. Sci. 985: 114352 (2024)}},
  title        = {{{Routing schemes for hybrid communication networks. }}},
  year         = {{2024}},
}

@inproceedings{64102,
  author       = {{Scheideler, Christian and Dou, Jinfeng}},
  publisher    = {{ApPLIED@PODC 2024}},
  title        = {{{Invited Paper: Blockchains made Lightweight: A Median Rule for State Machine Replication. }}},
  year         = {{2024}},
}

@inproceedings{64105,
  author       = {{Scheideler, Christian and Padalkin, Andreas and Kumar , Manish }},
  title        = {{{Reconfiguration and Locomotion with Joint Movements in the Amoebot Model. }}},
  year         = {{2024}},
}

@inproceedings{52235,
  abstract     = {{Android applications collecting data from users must protect it according to the current legal frameworks. Such data protection has become even more important since the European Union rolled out the General Data Protection Regulation (GDPR). Since app developers are not legal experts, they find it difficult to write privacy-aware source code. Moreover, they have limited tool support to reason about data protection throughout their app development process.
This paper motivates the need for a static analysis approach to diagnose and explain data protection in Android apps. The analysis will recognize personal data sources in the source code, and aims to further examine the data flow originating from these sources. App developers can then address key questions about data manipulation, derived data, and the presence of technical measures. Despite challenges, we explore to what extent one can realize this analysis through static taint analysis, a common method for identifying security vulnerabilities. This is a first step towards designing a tool-based approach that aids app developers and assessors in ensuring data protection in Android apps, based on automated static program analysis. }},
  author       = {{Khedkar, Mugdha and Bodden, Eric}},
  booktitle    = {{Proceedings of the IEEE/ACM 11th International Conference on Mobile Software Engineering and Systems (MOBILESoft '24). Association for Computing Machinery, New York, NY, USA, 65–68.}},
  keywords     = {{static program analysis, data protection and privacy, GDPR compliance}},
  location     = {{Lisbon, Portugal}},
  title        = {{{Toward an Android Static Analysis Approach for Data Protection}}},
  doi          = {{10.1145/3647632.3651389}},
  year         = {{2024}},
}

@inbook{61210,
  abstract     = {{Knowledge graphs (KGs) differ significantly over multiple different versions of the same data source. They also often contain blank nodes that do not have a constant identifier over all versions. Linking such blank nodes from different versions is a challenging task. Previous works propose different approaches to create signatures for all blank nodes based on named nodes in their neighborhood to match blank nodes with similar signatures. However, these works struggle to find a good mapping when the difference between the KGs’ versions grows too large. In this work, we propose Blink, an embedding-based approach for blank node linking. Blink merges two KGs’ versions and embeds the merged graph into a latent vector space based on translational embeddings and subsequently matches the closest pairs of blank nodes from different graphs. We evaluate our approach using real-world datasets against state-of-the-art approaches by computing the blank node matching for isomorphic graphs and graphs that contain triple changes (i.e., added or removed triples). The results indicate that Blink achieves perfect accuracy for isomorphic graphs. For graph versions that contain changes, such as having up to 20% of triples removed in one version, Blink still produces a mapping with an Optimal Mapping Deviation Ratio of under 1%. These results show that Blink leads to a better linking of KGs over different versions and similar graphs adhering to the linked data guidelines.}},
  author       = {{Becker, Alexander and Sherif, Mohamed and Ngonga Ngomo, Axel-Cyrille}},
  booktitle    = {{Lecture Notes in Computer Science}},
  isbn         = {{9783031778438}},
  issn         = {{0302-9743}},
  location     = {{Baltimore, USA}},
  publisher    = {{Springer Nature Switzerland}},
  title        = {{{Blink: Blank Node Matching Using Embeddings}}},
  doi          = {{10.1007/978-3-031-77844-5_12}},
  year         = {{2024}},
}

@inproceedings{54084,
  author       = {{Karalis, Nikolaos and Bigerl, Alexander and Heidrich, Liss and Sherif, Mohamed and Ngonga Ngomo, Axel-Cyrille}},
  booktitle    = {{ESWC}},
  keywords     = {{bigerl dice enexa heidrich karalis ngonga sail sherif}},
  title        = {{{Efficient Evaluation of Conjunctive Regular Path Queries Using Multi-way Joins}}},
  year         = {{2024}},
}

@inproceedings{61219,
  author       = {{Kumar, Ajay and Naumann, Marius and Henne, Kevin and Sherif, Mohamed}},
  booktitle    = {{Joint Proceedings of Posters, Demos, Workshops, and Tutorials of the 20th International Conference on Semantic Systems co-located with 20th International Conference on Semantic Systems (SEMANTiCS 2024), Amsterdam, The Netherlands, September 17-19, 2024}},
  editor       = {{Garijo, Daniel and Gentile, Anna Lisa and Kurteva, Anelia and Mannocci, Andrea and Osborne, Francesco and Vahdati, Sahar}},
  keywords     = {{kumar sherif enexa climatebowl ingrid simba dice whale}},
  location     = {{ Amsterdam,The Netherlands}},
  publisher    = {{CEUR-WS.org}},
  title        = {{{PCFWebUI: Data-driven WebUI for holistic decarbonization based on PCF-Tracking}}},
  volume       = {{3759}},
  year         = {{2024}},
}

@inproceedings{55094,
  author       = {{Zahera, Hamada Mohamed Abdelsamee and Manzoor, Ali and Sherif, Mohamed and Moussallem, Diego and Ngonga Ngomo, Axel-Cyrille}},
  booktitle    = {{SEMANTiCS}},
  keywords     = {{TRR318 climatebowl colide dice enexa kiam manzoor moussallem ngonga sailproject sherif simba zahera}},
  title        = {{{Generating SPARQL from Natural Language Using Chain-of-Thoughts Prompting}}},
  year         = {{2024}},
}

@inproceedings{58722,
  abstract     = {{Dialects introduce syntactic and lexical variations in language that occur in regional or social groups. Most NLP methods are not sensitive to such variations. This may lead to unfair behavior of the methods, conveying negative bias towards dialect speakers. While previous work has studied dialect-related fairness for aspects like hate speech, other aspects of biased language, such as lewdness, remain fully unexplored. To fill this gap, we investigate performance disparities between dialects in the detection of five aspects of biased language and how to mitigate them. To alleviate bias, we present a multitask learning approach that models dialect language as an auxiliary task to incorporate syntactic and lexical variations. In our experiments with African-American English dialect, we provide empirical evidence that complementing common learning approaches with dialect modeling improves their fairness. Furthermore, the results suggest that multitask learning achieves state-of-the-art performance and helps to detect properties of biased language more reliably.}},
  author       = {{Spliethöver, Maximilian and Menon, Sai Nikhil and Wachsmuth, Henning}},
  booktitle    = {{Findings of the Association for Computational Linguistics: ACL 2024}},
  editor       = {{Ku, Lun-Wei and Martins, Andre and Srikumar, Vivek}},
  pages        = {{9294–9313}},
  publisher    = {{Association for Computational Linguistics}},
  title        = {{{Disentangling Dialect from Social Bias via Multitask Learning to Improve Fairness}}},
  doi          = {{10.18653/v1/2024.findings-acl.553}},
  year         = {{2024}},
}

@inbook{62067,
  abstract     = {{Most FPGA boards in the HPC domain are well-suited for parallel scaling because of the direct integration of versatile and high-throughput network ports. However, the utilization of their network capabilities is often challenging and error-prone because the whole network stack and communication patterns have to be implemented and managed on the FPGAs. Also, this approach conceptually involves a trade-off between the performance potential of improved communication and the impact of resource consumption for communication infrastructure, since the utilized resources on the FPGAs could otherwise be used for computations. In this work, we investigate this trade-off, firstly, by using synthetic benchmarks to evaluate the different configuration options of the communication framework ACCL and their impact on communication latency and throughput. Finally, we use our findings to implement a shallow water simulation whose scalability heavily depends on low-latency communication. With a suitable configuration of ACCL, good scaling behavior can be shown to all 48 FPGAs installed in the system. Overall, the results show that the availability of inter-FPGA communication frameworks as well as the configurability of framework and network stack are crucial to achieve the best application performance with low latency communication.}},
  author       = {{Meyer, Marius and Kenter, Tobias and Petrica, Lucian and O’Brien, Kenneth and Blott, Michaela and Plessl, Christian}},
  booktitle    = {{Lecture Notes in Computer Science}},
  isbn         = {{9783031697654}},
  issn         = {{0302-9743}},
  publisher    = {{Springer Nature Switzerland}},
  title        = {{{Optimizing Communication for Latency Sensitive HPC Applications on up to 48 FPGAs Using ACCL}}},
  doi          = {{10.1007/978-3-031-69766-1_9}},
  year         = {{2024}},
}

@article{56604,
  abstract     = {{This manuscript makes the claim of having computed the 9th Dedekind number, D(9). This was done by accelerating the core operation of the process with an efficient FPGA design that outperforms an optimized 64-core CPU reference by 95x. The FPGA execution was parallelized on the Noctua 2 supercomputer at Paderborn University. The resulting value for D(9) is 286386577668298411128469151667598498812366. This value can be verified in two steps. We have made the data file containing the 490 M results available, each of which can be verified separately on CPU, and the whole file sums to our proposed value. The paper explains the mathematical approach in the first part, before putting the focus on a deep dive into the FPGA accelerator implementation followed by a performance analysis. The FPGA implementation was done in Register-Transfer Level using a dual-clock architecture and shows how we achieved an impressive FMax of 450 MHz on the targeted Stratix 10 GX 2,800 FPGAs. The total compute time used was 47,000 FPGA hours.}},
  author       = {{Van Hirtum, Lennart and De Causmaecker, Patrick and Goemaere, Jens and Kenter, Tobias and Riebler, Heinrich and Lass, Michael and Plessl, Christian}},
  issn         = {{1936-7406}},
  journal      = {{ACM Transactions on Reconfigurable Technology and Systems}},
  number       = {{3}},
  pages        = {{1--28}},
  publisher    = {{Association for Computing Machinery (ACM)}},
  title        = {{{A Computation of the Ninth Dedekind Number Using FPGA Supercomputing}}},
  doi          = {{10.1145/3674147}},
  volume       = {{17}},
  year         = {{2024}},
}

@inproceedings{53503,
  author       = {{Olgu, Kaan and Kenter, Tobias and Nunez-Yanez, Jose and Mcintosh-Smith, Simon}},
  booktitle    = {{Proceedings of the 12th International Workshop on OpenCL and SYCL}},
  publisher    = {{ACM}},
  title        = {{{Optimisation and Evaluation of Breadth First Search with oneAPI/SYCL on Intel FPGAs: from Describing Algorithms to Describing Architectures}}},
  doi          = {{10.1145/3648115.3648134}},
  year         = {{2024}},
}

@inbook{53942,
  abstract     = {{<jats:title>Abstract</jats:title><jats:p>Since its inception two decades ago, <jats:sc>Soot</jats:sc> has become one of the most widely used open-source static analysis frameworks. Over time it has been extended with the contributions of countless researchers. Yet, at the same time, the requirements for <jats:sc>Soot</jats:sc> have changed over the years and become increasingly at odds with some of the major design decisions that underlie it. In this work, we thus present <jats:sc>SootUp</jats:sc>, a complete reimplementation of <jats:sc>Soot</jats:sc> that seeks to fulfill these requirements with a novel design, while at the same time keeping elements that <jats:sc>Soot</jats:sc> users have grown accustomed to.</jats:p>}},
  author       = {{Karakaya, Kadiray and Schott, Stefan and Klauke, Jonas and Bodden, Eric and Schmidt, Markus and Luo, Linghui and He, Dongjie}},
  booktitle    = {{Tools and Algorithms for the Construction and Analysis of Systems}},
  isbn         = {{9783031572456}},
  issn         = {{0302-9743}},
  publisher    = {{Springer Nature Switzerland}},
  title        = {{{SootUp: A Redesign of the Soot Static Analysis Framework}}},
  doi          = {{10.1007/978-3-031-57246-3_13}},
  year         = {{2024}},
}