@article{51357, author = {{Steffen, Eckhard and Wolf, Isaak Hieronymus}}, issn = {{0012-365X}}, journal = {{Discrete Mathematics}}, keywords = {{Discrete Mathematics and Combinatorics, Theoretical Computer Science}}, publisher = {{Elsevier BV}}, title = {{{Rotation r-graphs}}}, doi = {{10.1016/j.disc.2023.113457}}, year = {{2023}}, } @article{51371, abstract = {{In this paper, we investigate the effect of distractions and hesitations as a scaffolding strategy. Recent research points to the potential beneficial effects of a speaker’s hesitations on the listeners’ comprehension of utterances, although results from studies on this issue indicate that humans do not make strategic use of them. The role of hesitations and their communicative function in human-human interaction is a much-discussed topic in current research. To better understand the underlying cognitive processes, we developed a human–robot interaction (HRI) setup that allows the measurement of the electroencephalogram (EEG) signals of a human participant while interacting with a robot. We thereby address the research question of whether we find effects on single-trial EEG based on the distraction and the corresponding robot’s hesitation scaffolding strategy. To carry out the experiments, we leverage our LabLinking method, which enables interdisciplinary joint research between remote labs. This study could not have been conducted without LabLinking, as the two involved labs needed to combine their individual expertise and equipment to achieve the goal together. The results of our study indicate that the EEG correlates in the distracted condition are different from the baseline condition without distractions. Furthermore, we could differentiate the EEG correlates of distraction with and without a hesitation scaffolding strategy. This proof-of-concept study shows that LabLinking makes it possible to conduct collaborative HRI studies in remote laboratories and lays the first foundation for more in-depth research into robotic scaffolding strategies.}}, author = {{Richter, Birte and Putze, Felix and Ivucic, Gabriel and Brandt, Mara and Schütze, Christian and Reisenhofer, Rafael and Wrede, Britta and Schultz, Tanja}}, issn = {{2414-4088}}, journal = {{Multimodal Technologies and Interaction}}, keywords = {{Computer Networks and Communications, Computer Science Applications, Human-Computer Interaction, Neuroscience (miscellaneous)}}, number = {{4}}, publisher = {{MDPI AG}}, title = {{{EEG Correlates of Distractions and Hesitations in Human–Robot Interaction: A LabLinking Pilot Study}}}, doi = {{10.3390/mti7040037}}, volume = {{7}}, year = {{2023}}, } @article{51770, abstract = {{AbstractWorkarounds are goal‐driven deviations from the standard operating procedures performed to overcome obstacles constraining day‐to‐day work. Despite starting as temporary fixes, they can become established across an organisation and trigger the innovation of processes and IT artefacts that can resolve misfits permanently. Although prior research has elicited antecedents and types of workarounds, it is not known how workarounds diffuse in an organisation and, thereby, innovating co‐workers' activities, IT artefacts, and organisational structures. The results of our multiple two‐year case study provide unique empirical insights into the diffusion of workarounds and how they can act as generative mechanisms for bottom‐up process innovation.}}, author = {{Bartelheimer, Christian and Wolf, Verena and Beverungen, Daniel}}, issn = {{1350-1917}}, journal = {{Information Systems Journal}}, keywords = {{Computer Networks and Communications, Information Systems, Software}}, number = {{5}}, pages = {{1085--1150}}, publisher = {{Wiley}}, title = {{{Workarounds as generative mechanisms for bottom‐up process innovation—Insights from a multiple case study}}}, doi = {{10.1111/isj.12435}}, volume = {{33}}, year = {{2023}}, } @article{47551, author = {{Hochhaus, Thorben and Bruns, Bastian and Grünewald, Marcus and Riese, Julia}}, issn = {{0098-1354}}, journal = {{Computers & Chemical Engineering}}, keywords = {{Computer Science Applications, General Chemical Engineering}}, publisher = {{Elsevier BV}}, title = {{{Optimal scheduling of a large-scale power-to-ammonia process: Effects of parameter optimization on the indirect demand response potential}}}, doi = {{10.1016/j.compchemeng.2023.108132}}, volume = {{170}}, year = {{2023}}, } @article{43437, abstract = {{In virtual reality (VR), participants may not always have hands, bodies, eyes, or even voices—using VR helmets and two controllers, participants control an avatar through virtual worlds that do not necessarily obey familiar laws of physics; moreover, the avatar’s bodily characteristics may not neatly match our bodies in the physical world. Despite these limitations and specificities, humans get things done through collaboration and the creative use of the environment. While multiuser interactive VR is attracting greater numbers of participants, there are currently few attempts to analyze the in situ interaction systematically. This paper proposes a video-analytic detail-oriented methodological framework for studying virtual reality interaction. Using multimodal conversation analysis, the paper investigates a nonverbal, embodied, two-person interaction: two players in a survival game strive to gesturally resolve a misunderstanding regarding an in-game mechanic—however, both of their microphones are turned off for the duration of play. The players’ inability to resort to complex language to resolve this issue results in a dense sequence of back-and-forth activity involving gestures, object manipulation, gaze, and body work. Most crucially, timing and modified repetitions of previously produced actions turn out to be the key to overcome both technical and communicative challenges. The paper analyzes these action sequences, demonstrates how they generate intended outcomes, and proposes a vocabulary to speak about these types of interaction more generally. The findings demonstrate the viability of multimodal analysis of VR interaction, shed light on unique challenges of analyzing interaction in virtual reality, and generate broader methodological insights about the study of nonverbal action.}}, author = {{Klowait, Nils}}, issn = {{2578-1863}}, journal = {{Human Behavior and Emerging Technologies}}, keywords = {{Human-Computer Interaction, General Social Sciences, Social Psychology, Virtual Reality : Multimodality, Nonverbal Interaction, Search Sequence, Gesture, Co-Operative Action, Goodwin, Ethnomethodology}}, pages = {{1--15}}, publisher = {{Hindawi Limited}}, title = {{{On the Multimodal Resolution of a Search Sequence in Virtual Reality}}}, doi = {{10.1155/2023/8417012}}, volume = {{2023}}, year = {{2023}}, } @article{53261, author = {{Soleymani, Mohammad and Santamaria, Ignacio and Jorswieck, Eduard and Clerckx, Bruno}}, issn = {{1536-1276}}, journal = {{IEEE Transactions on Wireless Communications}}, keywords = {{Applied Mathematics, Electrical and Electronic Engineering, Computer Science Applications}}, pages = {{1--1}}, publisher = {{Institute of Electrical and Electronics Engineers (IEEE)}}, title = {{{Optimization of Rate-Splitting Multiple Access in Beyond Diagonal RIS-assisted URLLC Systems}}}, doi = {{10.1109/twc.2023.3324190}}, year = {{2023}}, } @article{53263, author = {{Soleymani, Mohammad and Santamaria, Ignacio and Jorswieck, Eduard A.}}, issn = {{2169-3536}}, journal = {{IEEE Access}}, keywords = {{General Engineering, General Materials Science, General Computer Science, Electrical and Electronic Engineering}}, pages = {{70833--70852}}, publisher = {{Institute of Electrical and Electronics Engineers (IEEE)}}, title = {{{Spectral and Energy Efficiency Maximization of MISO STAR-RIS-Assisted URLLC Systems}}}, doi = {{10.1109/access.2023.3294092}}, volume = {{11}}, year = {{2023}}, } @article{53301, author = {{Vieluf, Solveig and Hasija, Tanuj and Kuschel, Maurice and Reinsberger, Claus and Loddenkemper, Tobias}}, issn = {{0957-4174}}, journal = {{Expert Systems with Applications}}, keywords = {{Artificial Intelligence, Computer Science Applications, General Engineering}}, publisher = {{Elsevier BV}}, title = {{{Developing a deep canonical correlation-based technique for seizure prediction}}}, doi = {{10.1016/j.eswa.2023.120986}}, volume = {{234}}, year = {{2023}}, } @article{53220, author = {{Tavana, Madjid and Khalili Nasr, Arash and Ahmadabadi, Alireza Barati and Amiri, Alireza Shamekhi and Mina, Hassan}}, issn = {{2542-6605}}, journal = {{Internet of Things}}, keywords = {{Management of Technology and Innovation, Artificial Intelligence, Computer Science Applications, Hardware and Architecture, Engineering (miscellaneous), Information Systems, Computer Science (miscellaneous), Software}}, publisher = {{Elsevier BV}}, title = {{{An interval multi-criteria decision-making model for evaluating blockchain-IoT technology in supply chain networks}}}, doi = {{10.1016/j.iot.2023.100786}}, volume = {{22}}, year = {{2023}}, } @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{44382, abstract = {{The success of engineering complex technical systems is determined by meeting customer requirements and institutional regulations. One example relevant to the automobile industry is the United Nations Economic Commission of Europe (UN ECE), which specifies the homologation of automobile series and requires proof of traceability. The required traceability can be achieved by modeling system artifacts and their relations in a consistent, seamless model—an effect-chain model. Currently, no in-depth methodology exists to support engineers in developing certification-compliant effect-chain models. For this purpose, a new methodology for certification-compliant effect-chain modeling was developed, which includes extensions of an existing method, suitable models, and tools to support engineers in the modeling process. For evaluation purposes, applicability is proven based on the experience of more than 300 workshops at an automotive OEM and an automotive supplier. The following case example is chosen to demonstrate applicability: the development of a window lifter that has to meet the demands of UN ECE Regulations R156 and R21. Results indicate multiple benefits in supporting engineers with the certification-compliant modeling of effect chains. Three benefits are goal-oriented modeling to reduce the necessary modeling capacity, increasing model quality by applying information quality criteria, and the potential to reduce costs through automatable effect-chain analyses for technical changes. Further, companies in the automotive and other industries will benefit from increased modeling capabilities that can be used for architecture modeling and to comply with other regulations such as ASPICE or ISO 26262.}}, author = {{Gräßler, Iris and Wiechel, Dominik and Koch, Anna-Sophie and Sturm, Tim and Markfelder, Thomas}}, issn = {{2079-8954}}, journal = {{Systems}}, keywords = {{Information Systems and Management, Computer Networks and Communications, Modeling and Simulation, Control and Systems Engineering, Software}}, number = {{3}}, publisher = {{MDPI AG}}, title = {{{Methodology for Certification-Compliant Effect-Chain Modeling}}}, doi = {{10.3390/systems11030154}}, volume = {{11}}, 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}}, }