@article{53218, author = {{Tavana, Madjid and Soltanifar, Mehdi and Santos-Arteaga, Francisco J. and Sharafi, Hamid}}, issn = {{0957-4174}}, journal = {{Expert Systems with Applications}}, keywords = {{Artificial Intelligence, Computer Science Applications, General Engineering}}, publisher = {{Elsevier BV}}, title = {{{Analytic hierarchy process and data envelopment analysis: A match made in heaven}}}, doi = {{10.1016/j.eswa.2023.119902}}, volume = {{223}}, year = {{2023}}, } @article{53225, author = {{Hilbert, Markus and Dellnitz, Andreas and Kleine, Andreas and Tavana, Madjid}}, issn = {{0360-8352}}, journal = {{Computers & Industrial Engineering}}, keywords = {{General Engineering, General Computer Science}}, publisher = {{Elsevier BV}}, title = {{{A novel indicator for sustainability in production planning using Center of Gravity-based assessment of Pareto fronts}}}, doi = {{10.1016/j.cie.2023.109618}}, volume = {{185}}, year = {{2023}}, } @article{53541, author = {{Robles-González, Antonio and Arias Cabarcos, Patricia and Parra-Arnau, Javier}}, issn = {{0167-4048}}, journal = {{Computers & Security}}, keywords = {{Law, General Computer Science}}, publisher = {{Elsevier BV}}, title = {{{Privacy-centered authentication: A new framework and analysis}}}, doi = {{10.1016/j.cose.2023.103353}}, volume = {{132}}, year = {{2023}}, } @article{47085, author = {{Schubatzky, Thomas and Burde, Jan-Philipp and Große-Heilmann, Rike Isabel and Haagen-Schützenhöfer, Claudia and Riese, Josef and Weiler, David}}, issn = {{0360-1315}}, journal = {{Computers & Education}}, keywords = {{Education, General Computer Science}}, publisher = {{Elsevier BV}}, title = {{{Predicting the development of digital media PCK/TPACK: The role of PCK, motivation to use digital media, interest in and previous experience with digital media}}}, doi = {{10.1016/j.compedu.2023.104900}}, volume = {{206}}, year = {{2023}}, } @article{53356, author = {{Terhörst, Philipp and Huber, Marco and Damer, Naser and Kirchbuchner, Florian and Raja, Kiran and Kuijper, Arjan}}, issn = {{2637-6407}}, journal = {{IEEE Transactions on Biometrics, Behavior, and Identity Science}}, keywords = {{Artificial Intelligence, Computer Science Applications, Computer Vision and Pattern Recognition, Instrumentation}}, number = {{2}}, pages = {{288--297}}, publisher = {{Institute of Electrical and Electronics Engineers (IEEE)}}, title = {{{Pixel-Level Face Image Quality Assessment for Explainable Face Recognition}}}, doi = {{10.1109/tbiom.2023.3263186}}, volume = {{5}}, year = {{2023}}, } @article{33947, author = {{Castenow, Jannik and Harbig, Jonas and Jung, Daniel and Knollmann, Till and Meyer auf der Heide, Friedhelm}}, issn = {{0304-3975}}, journal = {{Theoretical Computer Science}}, keywords = {{General Computer Science, Theoretical Computer Science}}, pages = {{261--291}}, publisher = {{Elsevier BV}}, title = {{{Gathering a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms for Chain-Formation}}}, doi = {{10.1016/j.tcs.2022.10.031}}, volume = {{939}}, year = {{2023}}, } @article{44857, abstract = {{Ancestral reconstruction is a classic task in comparative genomics. Here, we study the genome median problem, a related computational problem which, given a set of three or more genomes, asks to find a new genome that minimizes the sum of pairwise distances between it and the given genomes. The distance stands for the amount of evolution observed at the genome level, for which we determine the minimum number of rearrangement operations necessary to transform one genome into the other. For almost all rearrangement operations the median problem is NP-hard, with the exception of the breakpoint median that can be constructed efficiently for multichromosomal circular and mixed genomes. In this work, we study the median problem under a restricted rearrangement measure called c4-distance, which is closely related to the breakpoint and the DCJ distance. We identify tight bounds and decomposers of the c4-median and develop algorithms for its construction, one exact ILP-based and three combinatorial heuristics. Subsequently, we perform experiments on simulated data sets. Our results suggest that the c4-distance is useful for the study the genome median problem, from theoretical and practical perspectives.}}, author = {{Silva, Helmuth O.M. and Rubert, Diego P. and Araujo, Eloi and Steffen, Eckhard and Doerr, Daniel and Martinez, Fábio V.}}, issn = {{0399-0559}}, journal = {{RAIRO - Operations Research}}, keywords = {{Management Science and Operations Research, Computer Science Applications, Theoretical Computer Science}}, number = {{3}}, pages = {{1045--1058}}, publisher = {{EDP Sciences}}, title = {{{Algorithms for the genome median under a restricted measure of rearrangement}}}, doi = {{10.1051/ro/2023052}}, volume = {{57}}, year = {{2023}}, } @article{44078, author = {{Andreiev, Anatolii and Hoyer, Kay-Peter and Hengsbach, Florian and Haase, Michael and Tasche, Lennart and Duschik, Kristina and Schaper, Mirko}}, issn = {{0924-0136}}, journal = {{Journal of Materials Processing Technology}}, keywords = {{Industrial and Manufacturing Engineering, Metals and Alloys, Computer Science Applications, Modeling and Simulation, Ceramics and Composites}}, publisher = {{Elsevier BV}}, title = {{{Powder bed fusion of soft-magnetic iron-based alloys with high silicon content}}}, doi = {{10.1016/j.jmatprotec.2023.117991}}, volume = {{317}}, year = {{2023}}, } @article{45484, abstract = {{AbstractGraffiti is an urban phenomenon that is increasingly attracting the interest of the sciences. To the best of our knowledge, no suitable data corpora are available for systematic research until now. The Information System Graffiti in Germany project (Ingrid) closes this gap by dealing with graffiti image collections that have been made available to the project for public use. Within Ingrid, the graffiti images are collected, digitized and annotated. With this work, we aim to support the rapid access to a comprehensive data source on Ingrid targeted especially by researchers. In particular, we present IngridKG, an RDF knowledge graph of annotated graffiti, abides by the Linked Data and FAIR principles. We weekly update IngridKG by augmenting the new annotated graffiti to our knowledge graph. Our generation pipeline applies RDF data conversion, link discovery and data fusion approaches to the original data. The current version of IngridKG contains 460,640,154 triples and is linked to 3 other knowledge graphs by over 200,000 links. In our use case studies, we demonstrate the usefulness of our knowledge graph for different applications.}}, author = {{Sherif, Mohamed Ahmed and da Silva, Ana Alexandra Morim and Pestryakova, Svetlana and Ahmed, Abdullah Fathi and Niemann, Sven and Ngomo, Axel-Cyrille Ngonga}}, issn = {{2052-4463}}, journal = {{Scientific Data}}, keywords = {{Library and Information Sciences, Statistics, Probability and Uncertainty, Computer Science Applications, Education, Information Systems, Statistics and Probability}}, number = {{1}}, publisher = {{Springer Science and Business Media LLC}}, title = {{{IngridKG: A FAIR Knowledge Graph of Graffiti}}}, doi = {{10.1038/s41597-023-02199-8}}, volume = {{10}}, year = {{2023}}, } @article{38041, abstract = {{While FPGA accelerator boards and their respective high-level design tools are maturing, there is still a lack of multi-FPGA applications, libraries, and not least, benchmarks and reference implementations towards sustained HPC usage of these devices. As in the early days of GPUs in HPC, for workloads that can reasonably be decoupled into loosely coupled working sets, multi-accelerator support can be achieved by using standard communication interfaces like MPI on the host side. However, for performance and productivity, some applications can profit from a tighter coupling of the accelerators. FPGAs offer unique opportunities here when extending the dataflow characteristics to their communication interfaces. In this work, we extend the HPCC FPGA benchmark suite by multi-FPGA support and three missing benchmarks that particularly characterize or stress inter-device communication: b_eff, PTRANS, and LINPACK. With all benchmarks implemented for current boards with Intel and Xilinx FPGAs, we established a baseline for multi-FPGA performance. Additionally, for the communication-centric benchmarks, we explored the potential of direct FPGA-to-FPGA communication with a circuit-switched inter-FPGA network that is currently only available for one of the boards. The evaluation with parallel execution on up to 26 FPGA boards makes use of one of the largest academic FPGA installations.}}, author = {{Meyer, Marius and Kenter, Tobias and Plessl, Christian}}, issn = {{1936-7406}}, journal = {{ACM Transactions on Reconfigurable Technology and Systems}}, keywords = {{General Computer Science}}, publisher = {{Association for Computing Machinery (ACM)}}, title = {{{Multi-FPGA Designs and Scaling of HPC Challenge Benchmarks via MPI and Circuit-Switched Inter-FPGA Networks}}}, doi = {{10.1145/3576200}}, year = {{2023}}, } @article{46213, author = {{Weber, Daniel and Schenke, Maximilian and Wallscheid, Oliver}}, issn = {{2169-3536}}, journal = {{IEEE Access}}, keywords = {{General Engineering, General Materials Science, General Computer Science, Electrical and Electronic Engineering}}, pages = {{76524--76536}}, publisher = {{Institute of Electrical and Electronics Engineers (IEEE)}}, title = {{{Steady-State Error Compensation for Reinforcement Learning-Based Control of Power Electronic Systems}}}, doi = {{10.1109/access.2023.3297274}}, volume = {{11}}, year = {{2023}}, } @article{45361, abstract = {{ The non-orthogonal local submatrix method applied to electronic structure–based molecular dynamics simulations is shown to exceed 1.1 EFLOP/s in FP16/FP32-mixed floating-point arithmetic when using 4400 NVIDIA A100 GPUs of the Perlmutter system. This is enabled by a modification of the original method that pushes the sustained fraction of the peak performance to about 80%. Example calculations are performed for SARS-CoV-2 spike proteins with up to 83 million atoms. }}, author = {{Schade, Robert and Kenter, Tobias and Elgabarty, Hossam and Lass, Michael and Kühne, Thomas and Plessl, Christian}}, issn = {{1094-3420}}, journal = {{The International Journal of High Performance Computing Applications}}, keywords = {{Hardware and Architecture, Theoretical Computer Science, Software}}, publisher = {{SAGE Publications}}, title = {{{Breaking the exascale barrier for the electronic structure problem in ab-initio molecular dynamics}}}, doi = {{10.1177/10943420231177631}}, year = {{2023}}, } @article{46517, author = {{Ahmed, Abdullah Fathi and Sherif, Mohamed Ahmed and Ngomo, Axel-Cyrille Ngonga}}, issn = {{2169-3536}}, journal = {{IEEE Access}}, keywords = {{General Engineering, General Materials Science, General Computer Science, Electrical and Electronic Engineering}}, pages = {{1--1}}, publisher = {{Institute of Electrical and Electronics Engineers (IEEE)}}, title = {{{NELLIE: Never-Ending Linking for Linked Open Data}}}, doi = {{10.1109/access.2023.3300694}}, year = {{2023}}, } @article{46543, abstract = {{The influence of nanoscale surface topography on protein adsorption is highly important for numerous applications in medicine and technology. Herein, ferritin adsorption at flat and nanofaceted, single-crystalline Al2O3 surfaces is investigated using atomic force microscopy and X-ray photoelectron spectroscopy. The nanofaceted surfaces are generated by the thermal annealing of Al2O3 wafers at temperatures above 1000 °C, which leads to the formation of faceted saw-tooth-like surface topographies with periodicities of about 160 nm and amplitudes of about 15 nm. Ferritin adsorption at these nanofaceted surfaces is notably suppressed compared to the flat surface at a concentration of 10 mg/mL, which is attributed to lower adsorption affinities of the newly formed facets. Consequently, adsorption is restricted mostly to the pattern grooves, where the proteins can maximize their contact area with the surface. However, this effect depends on the protein concentration, with an inverse trend being observed at 30 mg/mL. Furthermore, different ferritin adsorption behavior is observed at topographically similar nanofacet patterns fabricated at different annealing temperatures and attributed to different step and kink densities. These results demonstrate that while protein adsorption at solid surfaces can be notably affected by nanofacet patterns, fine-tuning protein adsorption in this way requires the precise control of facet properties.}}, author = {{Pothineni, Bhanu K. and Kollmann, Sabrina and Li, Xinyang and Grundmeier, Guido and Erb, Denise J. and Keller, Adrian}}, issn = {{1422-0067}}, journal = {{International Journal of Molecular Sciences}}, keywords = {{Inorganic Chemistry, Organic Chemistry, Physical and Theoretical Chemistry, Computer Science Applications, Spectroscopy, Molecular Biology, General Medicine, Catalysis}}, number = {{16}}, publisher = {{MDPI AG}}, title = {{{Adsorption of Ferritin at Nanofaceted Al2O3 Surfaces}}}, doi = {{10.3390/ijms241612808}}, volume = {{24}}, year = {{2023}}, } @article{44312, abstract = {{Zusammenfassung Aufgrund aktueller Transformationsprozesse kommt der automatisierten und ressourceneffizienten Fertigung hochfester Leichtbauteile eine steigende Bedeutung zu, beispielsweise im Flugzeug- und Fahrzeugbau. Für kleine Losgrößen bietet sich hier insbesondere das Fertigungsverfahren des Drückwalzens an. Der konventionelle, industriell genutzte Drückwalzprozess stößt allerdings aufgrund der Prozesskomplexität hinsichtlich der Reproduzierbarkeit an seine Grenzen. Dies wird in der Praxis teilweise durch personengebundenes Erfahrungswissen kompensiert. Auch ist es nicht möglich, Bauteileigenschaften definiert einzustellen. Aus diesem Grund bietet der Einsatz einer neuartigen Eigenschaftsregelung Chancen zur Weiterentwicklung des Fertigungsprozesses und die Möglichkeit zur Prozessautomatisierung. Hier werden die Werkzeugbahnen abhängig einer Online-Eigenschaftsmessung über eine zusätzliche Reglerkaskade manipuliert. Die Entwicklung einer solchen Eigenschaftsregelung erfordert den Einsatz geeigneter, modellbasierter Entwurfsmethoden. In diesem Beitrag wird daher ein regelungstechnisches Systemmodell für das Drückwalzen metastabiler austenitischer Edelstähle vorgestellt. Das Simulationsmodell weist aufgrund seiner Echtzeitfähigkeit neben dem Einsatz als reines Entwurfsmodell weitere Nutzungsmöglichkeiten z.B. in Beobachtern auf und grenzt sich somit von domänenspezifischen Simulationstools wie der FEM ab.}}, author = {{Kersting, Lukas and Arian, Bahman and Rozo Vasquez, Julian and Trächtler, Ansgar and Homberg, Werner and Walther, Frank}}, issn = {{0178-2312}}, journal = {{at - Automatisierungstechnik}}, keywords = {{Electrical and Electronic Engineering, Computer Science Applications, Control and Systems Engineering}}, number = {{1}}, pages = {{68--81}}, publisher = {{Walter de Gruyter GmbH}}, title = {{{Echtzeitfähige Modellierung eines innovativen Drückwalzprozesses für die eigenschaftsgeregelte Bauteilfertigung}}}, doi = {{10.1515/auto-2022-0106}}, volume = {{71}}, year = {{2023}}, } @article{48678, abstract = {{Explanation has been identified as an important capability for AI-based systems, but research on systematic strategies for achieving understanding in interaction with such systems is still sparse. Negation is a linguistic strategy that is often used in explanations. It creates a contrast space between the affirmed and the negated item that enriches explaining processes with additional contextual information. While negation in human speech has been shown to lead to higher processing costs and worse task performance in terms of recall or action execution when used in isolation, it can decrease processing costs when used in context. So far, it has not been considered as a guiding strategy for explanations in human-robot interaction. We conducted an empirical study to investigate the use of negation as a guiding strategy in explanatory human-robot dialogue, in which a virtual robot explains tasks and possible actions to a human explainee to solve them in terms of gestures on a touchscreen. Our results show that negation vs. affirmation 1) increases processing costs measured as reaction time and 2) increases several aspects of task performance. While there was no significant effect of negation on the number of initially correctly executed gestures, we found a significantly lower number of attempts—measured as breaks in the finger movement data before the correct gesture was carried out—when being instructed through a negation. We further found that the gestures significantly resembled the presented prototype gesture more following an instruction with a negation as opposed to an affirmation. Also, the participants rated the benefit of contrastive vs. affirmative explanations significantly higher. Repeating the instructions decreased the effects of negation, yielding similar processing costs and task performance measures for negation and affirmation after several iterations. We discuss our results with respect to possible effects of negation on linguistic processing of explanations and limitations of our study.}}, author = {{Groß, André and Singh, Amit and Banh, Ngoc Chi and Richter, Birte and Scharlau, Ingrid and Rohlfing, Katharina J. and Wrede, Britta}}, issn = {{2296-9144}}, journal = {{Frontiers in Robotics and AI}}, keywords = {{Artificial Intelligence, Computer Science Applications}}, publisher = {{Frontiers Media SA}}, title = {{{Scaffolding the human partner by contrastive guidance in an explanatory human-robot dialogue}}}, doi = {{10.3389/frobt.2023.1236184}}, volume = {{10}}, year = {{2023}}, } @article{44081, author = {{Serino, Laura and Gil López, Jano and Stefszky, Michael and Ricken, Raimund and Eigner, Christof and Brecht, Benjamin and Silberhorn, Christine}}, issn = {{2691-3399}}, journal = {{PRX Quantum}}, keywords = {{General Physics and Astronomy, Mathematical Physics, Applied Mathematics, Electronic, Optical and Magnetic Materials, Electrical and Electronic Engineering, General Computer Science}}, number = {{2}}, publisher = {{American Physical Society (APS)}}, title = {{{Realization of a Multi-Output Quantum Pulse Gate for Decoding High-Dimensional Temporal Modes of Single-Photon States}}}, doi = {{10.1103/prxquantum.4.020306}}, volume = {{4}}, year = {{2023}}, } @article{47151, abstract = {{When it comes to mastering the digital world, the education system is more and more facing the task of making students competent and self-determined agents when interacting with digital artefacts. This task often falls to computing education. In the traditional fields of computing education, a plethora of models, guidelines, and principles exist, which help scholars and teachers identify what the relevant aspects are and which of them one should cover in the classroom. When it comes to explaining the world of digital artefacts, however, there is hardly any such guiding model. The ARIadne model introduced in this paper provides a means of explanation and exploration of digital artefacts which help teachers and students to do a subject analysis of digital artefacts by scrutinizing them from several perspectives. Instead of artificially separating aspects which target the same phenomena within different areas of education (like computing, ICT or media education), the model integrates technological aspects of digital artefacts and the relevant societal discourses of their usage, their impacts and the reasons behind their development into a coherent explanation model.}}, author = {{Winkelnkemper, Felix and Höper, Lukas and Schulte, Carsten}}, issn = {{1648-5831}}, journal = {{Informatics in Education}}, keywords = {{Computer Science Applications, Communication, Education, General Engineering}}, publisher = {{Vilnius University Press}}, title = {{{ARIadne – An Explanation Model for Digital Artefacts}}}, doi = {{10.15388/infedu.2024.09}}, year = {{2023}}, } @article{48689, author = {{Niederhaus, Constanze and Prikoszovits, Matthias}}, issn = {{2198-2430}}, journal = {{Deutsch als Fremdsprache}}, keywords = {{Computer Science Applications, History, Education}}, number = {{2}}, publisher = {{Erich Schmidt Verlag GmbH & Co. KG}}, title = {{{DaF und DaZ im Kontext Deutsch für den Beruf: Schnittstellen und Divergenzen}}}, doi = {{10.37307/j.2198-2430.2023.02.02}}, year = {{2023}}, } @article{50271, author = {{Gharibian, Sevag and Le Gall, François}}, issn = {{0097-5397}}, journal = {{SIAM Journal on Computing}}, keywords = {{General Mathematics, General Computer Science}}, number = {{4}}, pages = {{1009--1038}}, publisher = {{Society for Industrial & Applied Mathematics (SIAM)}}, title = {{{Dequantizing the Quantum Singular Value Transformation: Hardness and Applications to Quantum Chemistry and the Quantum PCP Conjecture}}}, doi = {{10.1137/22m1513721}}, volume = {{52}}, year = {{2023}}, }