@article{60355,
  abstract     = {{<jats:p>We present a method for the generation of higher-order tetrahedral meshes. In contrast to previous methods, the curved tetrahedral elements are guaranteed to be free of degeneracies and inversions while conforming exactly to prescribed piecewise polynomial surfaces, such as domain boundaries or material interfaces. Arbitrary polynomial order is supported. Algorithmically, the polynomial input surfaces are first covered by a single layer of carefully constructed curved elements using a recursive refinement procedure that provably avoids degeneracies and inversions. These tetrahedral elements are designed such that the remaining space is bounded piecewise linearly. In this way, our method effectively reduces the curved meshing problem to the classical problem of linear mesh generation (for the remaining space).</jats:p>}},
  author       = {{Khanteimouri, Payam and Campen, Marcel}},
  issn         = {{0730-0301}},
  journal      = {{ACM Transactions on Graphics}},
  number       = {{6}},
  pages        = {{1--19}},
  publisher    = {{Association for Computing Machinery (ACM)}},
  title        = {{{3D Bézier Guarding: Boundary-Conforming Curved Tetrahedral Meshing}}},
  doi          = {{10.1145/3618332}},
  volume       = {{42}},
  year         = {{2023}},
}

@article{60354,
  abstract     = {{<jats:p>We present a set of operators to perform modifications, in particular collapses and splits, in volumetric cell complexes which are discretely embedded in a background mesh. Topological integrity and geometric embedding validity are carefully maintained. We apply these operators strategically to volumetric block decompositions, so-called T-meshes or base complexes, in the context of hexahedral mesh generation. This allows circumventing the expensive and unreliable global volumetric remapping step in the versatile meshing pipeline based on 3D integer-grid maps. In essence, we reduce this step to simpler local cube mapping problems, for which reliable solutions are available. As a consequence, the robustness of the mesh generation process is increased, especially when targeting coarse or block-structured hexahedral meshes. We furthermore extend this pipeline to support feature alignment constraints, and systematically respect these throughout, enabling the generation of meshes that align to points, curves, and surfaces of special interest, whether on the boundary or in the interior of the domain.</jats:p>}},
  author       = {{Brückler, Hendrik and Campen, Marcel}},
  issn         = {{0730-0301}},
  journal      = {{ACM Transactions on Graphics}},
  number       = {{6}},
  pages        = {{1--24}},
  publisher    = {{Association for Computing Machinery (ACM)}},
  title        = {{{Collapsing Embedded Cell Complexes for Safer Hexahedral Meshing}}},
  doi          = {{10.1145/3618384}},
  volume       = {{42}},
  year         = {{2023}},
}

@article{60335,
  abstract     = {{<jats:p>A method is presented to compute volumetric maps and parametrizations of objects over 3D domains. As a key feature, continuity and bijectivity are ensured by construction. Arbitrary objects of ball topology, represented as tetrahedral meshes, are supported. Arbitrary convex as well as star-shaped domains are supported. Full control over the boundary mapping is provided. The method is based on the technique of simplicial foliations, generalized to a broader class of domain shapes and applied adaptively in a novel localized manner. This increases flexibility as well as efficiency over the state of the art, while maintaining reliability in guaranteeing map bijectivity.</jats:p>}},
  author       = {{Hinderink, Steffen and Campen, Marcel}},
  issn         = {{0730-0301}},
  journal      = {{ACM Transactions on Graphics}},
  number       = {{4}},
  pages        = {{1--16}},
  publisher    = {{Association for Computing Machinery (ACM)}},
  title        = {{{Galaxy Maps: Localized Foliations for Bijective Volumetric Mapping}}},
  doi          = {{10.1145/3592410}},
  volume       = {{42}},
  year         = {{2023}},
}

@inproceedings{48012,
  abstract     = {{3D printing is a well-established technology with rapidly increasing usage scenarios both in the industry and consumer context. The growing popularity of 3D printing has also attracted security researchers, who have analyzed possibilities for weakening 3D models or stealing intellectual property from 3D models. We extend these important aspects and provide the first comprehensive security analysis of 3D printing data formats. We performed our systematic study on the example of the 3D Manufacturing Format (3MF), which offers a large variety of features that could lead to critical attacks. Based on 3MF’s features, we systematized three attack goals: Data Exfiltration (dex), Denial of Service, and UI Spoofing (uis). We achieve these goals by exploiting the complexity of 3MF, which is based on the Open Packaging Conventions (OPC) format and uses XML to define 3D models. In total, our analysis led to 352 tests. To create and run these tests automatically, we implemented an open-source tool named 3MF Analyzer (tool), which helped us evaluate 20 applications.}},
  author       = {{Rossel, Jost and Mladenov, Vladislav and Somorovsky, Juraj}},
  booktitle    = {{Proceedings of the 26th International Symposium on Research in Attacks, Intrusions and Defenses}},
  keywords     = {{Data Format Security, 3D Manufacturing Format, 3D Printing, Additive Manufacturing}},
  location     = {{Hongkong}},
  publisher    = {{ACM}},
  title        = {{{Security Analysis of the 3MF Data Format}}},
  doi          = {{10.1145/3607199.3607216}},
  year         = {{2023}},
}

@inbook{45360,
  author       = {{Haase, Michael and Bieber, Maximilian and Tasche, Frederik and Schaper, Mirko and Hoyer, Kay-Peter and Ponik, Bernd and Magyar, Balázs}},
  booktitle    = {{Proceedings of the 19th Rapid.Tech 3D Conference Erfurt, Germany, 9–11 May 2023}},
  editor       = {{Kynast, Michael and Eichmann, Michael and Witt, Gerd}},
  isbn         = {{978-3-446-47941-8}},
  publisher    = {{Carl Hanser Verlag GmbH & Co. KG}},
  title        = {{{Umsetzung einer optimierten Oberflächenschlitzung zur Wirbelstromverlustreduktion auf der Oberfläche eines additiv gefertigten Permanentmagnet-Rotors}}},
  doi          = {{https://doi.org/10.3139/9783446479425.001 }},
  year         = {{2023}},
}

@inproceedings{52865,
  abstract     = {{This paper addresses new challenges of detecting campaigns in social media, which emerged with the rise of Large Language Models (LLMs). LLMs particularly challenge algorithms focused on the temporal analysis of topical clusters. Simple similarity measures can no longer capture and map campaigns that were previously broadly similar in content. Herein, we analyze whether the classification of messages over time can be profitably used to rediscover poorly detectable campaigns at the content level. Thus, we evaluate classical classifiers and a new method based on siamese neural networks. Our results show that campaigns can be detected despite the limited reliability of the classifiers as long as they are based on a large amount of simultaneously spread artificial content.}},
  author       = {{Grimme, Britta and Pohl, Janina and Winkelmann, Hendrik and Stampe, Lucas and Grimme, Christian}},
  booktitle    = {{Disinformation in Open Online Media: 5th Multidisciplinary International Symposium, MISDOOM 2023, Amsterdam, The Netherlands, November 21–22, 2023, Proceedings}},
  isbn         = {{978-3-031-47895-6}},
  keywords     = {{Social Media, Campaign Detection, Large Language Models, Siamese Neural Networks}},
  pages        = {{72–87}},
  publisher    = {{Springer-Verlag}},
  title        = {{{Lost in Transformation: Rediscovering LLM-Generated Campaigns in Social Media}}},
  doi          = {{10.1007/978-3-031-47896-3_6}},
  year         = {{2023}},
}

@inproceedings{43090,
  abstract     = {{The application of the mechanical joining process clinching allows the assembly of different sheet metal materials with a wide range of material thickness configurations, which is of interest for lightweight multi-material structures. In order to be able to predict the clinched joint properties as a function of the individual manufacturing steps, current studies focus on numerical modeling of the entire clinching process chain. It is essential to be able to take into account the influence of the joining process-induced damage on the load-bearing capacity of the joint during the loading phase. This study presents a numerical damage accumulation in the clinching process based on an implemented Hosford-Coulomb failure model using a 3D clinching process model applied on the aluminum alloy EN AW-6014 in temper T4. A correspondence of the experimentally determined failure location with the element of the highest numerically determined damage accumulation is shown. Moreover, the experimentally determined failure behavior is predicted to be in agreement in the numerical loading simulation with transferred pre-damage from the process simulation. }},
  author       = {{Bielak, Christian Roman and Böhnke, Max and Friedlein, Johannes and Bobbert, Mathias and Mergheim, Julia and Steinmann, Paul and Meschut, Gerson}},
  booktitle    = {{Materials Research Proceedings}},
  issn         = {{2474-395X}},
  publisher    = {{Materials Research Forum LLC}},
  title        = {{{Numerical analysis of failure modeling in clinching process chain simulation}}},
  doi          = {{10.21741/9781644902417-33}},
  year         = {{2023}},
}

@inproceedings{29852,
  author       = {{Beule, Felix and Teutenberg, Dominik and Meschut, Gerson and Aubel, Tobias and Matzenmiller, Anton}},
  booktitle    = {{22. Kolloquium: Gemeinsame Forschung in der Klebtechnik}},
  title        = {{{Methodenentwicklung zur Versagensanalyse aufgrund der Aushärtung vorgeschädigter Klebverbindungen in stahlintensiven Mischbaustrukturen}}},
  year         = {{2022}},
}

@inproceedings{29855,
  author       = {{Carillo Beber, Vinicius and Nagel, Christof and Mayer, Bernd and Köster, Christian and Matzenmiller, Anton and Hecht, Matthias and Baumgartner, Jörg and Melz, Tobias and Tews, Karina and Çavdar, Serkan and Meschut, Gerson}},
  booktitle    = {{22. Kolloquium: Gemeinsame Forschung in der Klebtechnik}},
  title        = {{{Lebensdauerprognose für Stahlklebverbindungen bei multiaxialer Belastung mit Phasenverschiebung, veränderlicher Mittelspannung und variablen Amplituden}}},
  year         = {{2022}},
}

@inproceedings{29344,
  author       = {{Kowatz, Jannik and Teutenberg, Dominik and Meschut, Gerson}},
  booktitle    = {{22. Kolloquium Gemeinsame Forschung in der Klebtechnik}},
  location     = {{Online}},
  title        = {{{Weiterentwicklung der induktiven Schnellhärtung von Klebverbindungen für robuste Fertigungsprozesse unter Berücksichtigung von serienrelevanten Einflussfaktoren}}},
  year         = {{2022}},
}

@inproceedings{30003,
  author       = {{Chudalla, Nick and Meschut, Gerson and Bartley, Aurélie and Wibbeke, Tim Michael}},
  booktitle    = {{22. Kolloquium: Gemeinsame Forschung in der Klebtechnik}},
  title        = {{{Analyse des Versagensverhaltens geklebter Stahl-Verbindungen beim werkstoffschonenden Entfügen in der Karosserieinstandsetzung}}},
  year         = {{2022}},
}

@inproceedings{30222,
  author       = {{Striewe, Marius and Meschut, Gerson and Schmelzle, Lars and Mergheim, Julia and Possart, Gunnar and Steinmann, Paul}},
  booktitle    = {{22. Kolloquium: Gemeinsame Forschung in der Klebtechnik}},
  title        = {{{Experimentelle und numerische Untersuchung des Einflusses variabler Betriebstemperaturen auf das Trag- und Versagensverhalten struktureller Klebverbindungen unter Crashbelastung}}},
  year         = {{2022}},
}

@inproceedings{30347,
  author       = {{Schafmeister, Frank}},
  booktitle    = {{International Conference on Electric & Electronic in Hybrid and Electric Vehicles and Electric Energy Management (EEHE),}},
  location     = {{Bamberg, Germany}},
  title        = {{{Compensation of LF Common-Mode Noise by the internal DC/DC-Stage for transformerless On-Board Chargers at Three- and Single-Phase Operation}}},
  year         = {{2022}},
}

@inproceedings{30349,
  author       = {{Förster, Nikolas and Rehlaender, Philipp and Wallscheid, Oliver and Schafmeister, Frank and Böcker, Joachim}},
  booktitle    = {{Proc. 37th IEEE Applied Power Electronics Conference (APEC)}},
  location     = {{Houston, TX, USA}},
  publisher    = {{IEEE}},
  title        = {{{An Open-Source Transistor Database and Toolbox as an Unified Software Engineering Tool for Managing and Evaluating Power Transistors}}},
  year         = {{2022}},
}

@inproceedings{30350,
  author       = {{Keuck, Lukas and Schafmeister, Frank and Böcker, Joachim}},
  booktitle    = {{Proc. IEEE International Exhibition and Conference for Power Electronics, Intelligent Motion, Renewable Energy and Energy Management (PCIM)}},
  location     = {{Nuremberg, Germany}},
  publisher    = {{IEEE}},
  title        = {{{Robust Hysteresis Control for LLC Resonant Converters Using a Fully Isolated Measurement Scheme}}},
  year         = {{2022}},
}

@inproceedings{30004,
  author       = {{Chudalla, Nick and Teutenberg, Dominik and Meschut, Gerson and Schneider, Miriam and Smart, Dominik}},
  booktitle    = {{22. Kolloquium: Gemeinsame Forschung in der Klebtechnik}},
  title        = {{{Systematisierung einer rechnergestützten Auswertemethode zur Versagensanalyse geklebter Verbindungen }}},
  year         = {{2022}},
}

@article{32234,
  author       = {{Wojciechowski, M}},
  issn         = {{2352-3409}},
  journal      = {{Data Brief}},
  pages        = {{108318}},
  title        = {{{Dataset for random uniform distributions of 2D circles and 3D spheres.}}},
  volume       = {{43}},
  year         = {{2022}},
}

@article{32087,
  abstract     = {{<jats:p> Agility, a key component of team ball sports, describes an athlete´s ability to move fast in response to changing environments. While agility requires basic cognitive functions like processing speed, it also requires more complex cognitive processes like working memory and inhibition. Yet, most agility tests restrict an assessment of cognitive processes to simple reactive times that lack ecological validity. Our aim in this study was to assess agility performance by means of total time on two agility tests with matched motor demands but with both low and high cognitive demands. We tested 22 female team athletes on SpeedCourt, using a simple agility test (SAT) that measured only processing speed and a complex agility test (CAT) that required working memory and inhibition. We found excellent to good reliability for both our SAT (ICC = .79) and CAT (ICC =.70). Lower agility performance on the CAT was associated with increased agility total time and split times ( p &lt; .05). These results demonstrated that agility performance depends on the complexity of cognitive demands. There may be interference-effects between motor and cognitive performances, reducing speed when environmental information becomes more complex. Future studies should consider agility training models that implement complex cognitive stimuli to challenge athletes according to competitive demands. This will also allow scientists and practitioners to tailor tests to talent identification, performance development and injury rehabilitation. </jats:p>}},
  author       = {{Büchel, Daniel and Gokeler, Alli and Heuvelmans, Pieter and Baumeister, Jochen}},
  issn         = {{0031-5125}},
  journal      = {{Perceptual and Motor Skills}},
  keywords     = {{Sensory Systems, Experimental and Cognitive Psychology}},
  publisher    = {{SAGE Publications}},
  title        = {{{Increased Cognitive Demands Affect Agility Performance in Female Athletes - Implications for Testing and Training of Agility in Team Ball Sports}}},
  doi          = {{10.1177/00315125221108698}},
  year         = {{2022}},
}

@inproceedings{31806,
  abstract     = {{The creation of an RDF knowledge graph for a particular application commonly involves a pipeline of tools that transform a set ofinput data sources into an RDF knowledge graph in a process called dataset augmentation. The components of such augmentation pipelines often require extensive configuration to lead to satisfactory results. Thus, non-experts are often unable to use them. Wepresent an efficient supervised algorithm based on genetic programming for learning knowledge graph augmentation pipelines of arbitrary length. Our approach uses multi-expression learning to learn augmentation pipelines able to achieve a high F-measure on the training data. Our evaluation suggests that our approach can efficiently learn a larger class of RDF dataset augmentation tasks than the state of the art while using only a single training example. Even on the most complex augmentation problem we posed, our approach consistently achieves an average F1-measure of 99% in under 500 iterations with an average runtime of 16 seconds}},
  author       = {{Dreßler, Kevin and Sherif, Mohamed and Ngonga Ngomo, Axel-Cyrille}},
  booktitle    = {{Proceedings of the 33rd ACM Conference on Hypertext and Hypermedia}},
  keywords     = {{2022 RAKI SFB901 deer dice kevin knowgraphs limes ngonga sherif simba}},
  location     = {{Barcelona (Spain)}},
  title        = {{{ADAGIO - Automated Data Augmentation of Knowledge Graphs Using Multi-expression Learning}}},
  doi          = {{10.1145/3511095.3531287}},
  year         = {{2022}},
}

@inproceedings{33253,
  author       = {{Hansmeier, Tim and Brede, Mathis and Platzner, Marco}},
  booktitle    = {{GECCO '22: Proceedings of the Genetic and Evolutionary Computation Conference Companion}},
  location     = {{Boston, MA, USA}},
  pages        = {{2071--2079}},
  publisher    = {{Association for Computing Machinery (ACM)}},
  title        = {{{XCS on Embedded Systems: An Analysis of Execution Profiles and Accelerated Classifier Deletion}}},
  doi          = {{10.1145/3520304.3533977}},
  year         = {{2022}},
}