@inproceedings{62703, abstract = {{We introduce a novel embedding method diverging from conventional approaches by operating within function spaces of finite dimension rather than finite vector space, thus departing significantly from standard knowledge graph embedding techniques. Initially employing polynomial functions to compute embeddings, we progress to more intricate representations using neural networks with varying layer complexities. We argue that employing functions for embedding computation enhances expressiveness and allows for more degrees of freedom, enabling operations such as composition, derivatives and primitive of entities representation. Additionally, we meticulously outline the step-by-step construction of our approach and provide code for reproducibility, thereby facilitating further exploration and application in the field.}}, author = {{Kamdem Teyou, Louis Mozart and Demir, Caglar and Ngonga Ngomo, Axel-Cyrille}}, booktitle = {{Proceedings of the 33rd ACM International Conference on Information and Knowledge Management}}, location = {{Boise}}, publisher = {{ACM}}, title = {{{Embedding Knowledge Graphs in Function Spaces}}}, doi = {{10.1145/3627673.3679819}}, year = {{2024}}, } @inproceedings{66834, author = {{Schott, Stefan and Fischer, Wolfram and Ponta, Serena Elisa and Klauke, Jonas and Bodden, Eric}}, booktitle = {{2024 IEEE International Conference on Software Maintenance and Evolution (ICSME)}}, publisher = {{IEEE}}, title = {{{Compilation of Commit Changes Within Java Source Code Repositories}}}, doi = {{10.1109/icsme58944.2024.00038}}, year = {{2024}}, } @inproceedings{57816, abstract = {{TLS-Attacker is an open-source framework for analyzing Transport Layer Security (TLS) implementations. The framework allows users to specify custom protocol flows and provides modification hooks to manipulate message contents. Since its initial publication in 2016 by Juraj Somorovsky, TLS-Attacker has been used in numerous studies published at well-established conferences and helped to identify vulnerabilities in well-known open-source TLS libraries. To enable automated analyses, TLS-Attacker has grown into a suite of projects, each designed as a building block that can be applied to facilitate various analysis methodologies. The framework still undergoes continuous improvements with feature extensions, such as DTLS 1.3 or the addition of new dialects such as QUIC, to continue its effectiveness and relevancy as a security analysis framework.}}, author = {{Bäumer, Fabian and Brinkmann, Marcus and Erinola, Nurullah and Hebrok, Sven Niclas and Heitmann, Nico and Lange, Felix and Maehren, Marcel and Merget, Robert and Niere, Niklas and Radoy, Maximilian Manfred and Schmidt, Conrad and Schwenk, Jörg and Somorovsky, Juraj}}, booktitle = {{Proceedings of Cybersecurity Artifacts Competition and Impact Award (ACSAC ’24)}}, keywords = {{SSL, TLS, DTLS, Protocol State Fuzzing, Planning Based}}, location = {{Hawaii}}, title = {{{TLS-Attacker: A Dynamic Framework for Analyzing TLS Implementations}}}, year = {{2024}}, } @inproceedings{55137, abstract = {{Many countries limit their residents' access to various websites. As a substantial number of these websites do not support TLS encryption, censorship of unencrypted HTTP requests remains prevalent. Accordingly, circumvention techniques can and have been found for the HTTP protocol. In this paper, we infer novel circumvention techniques on the HTTP layer from a web security vulnerability by utilizing HTTP request smuggling (HRS). To demonstrate the viability of our techniques, we collected various test vectors from previous work about HRS and evaluated them on popular web servers and censors in China, Russia, and Iran. Our findings show that HRS can be successfully employed as a censorship circumvention technique against multiple censors and web servers. We also discover a standard-compliant circumvention technique in Russia, unusually inconsistent censorship in China, and an implementation bug in Iran. The results of this work imply that censorship circumvention techniques can successfully be constructed from existing vulnerabilities. We conjecture that this implication provides insights to the censorship circumvention community beyond the viability of specific techniques presented in this work.}}, author = {{Müller, Philipp and Niere, Niklas and Lange, Felix and Somorovsky, Juraj}}, booktitle = {{Proceedings on Privacy Enhancing Technologies}}, keywords = {{censorship, censorship circumvention, http, http request smuggling}}, location = {{Bristol}}, title = {{{Turning Attacks into Advantages: Evading HTTP Censorship with HTTP Request Smuggling}}}, year = {{2024}}, } @article{21199, abstract = {{As in almost every other branch of science, the major advances in data science and machine learning have also resulted in significant improvements regarding the modeling and simulation of nonlinear dynamical systems. It is nowadays possible to make accurate medium to long-term predictions of highly complex systems such as the weather, the dynamics within a nuclear fusion reactor, of disease models or the stock market in a very efficient manner. In many cases, predictive methods are advertised to ultimately be useful for control, as the control of high-dimensional nonlinear systems is an engineering grand challenge with huge potential in areas such as clean and efficient energy production, or the development of advanced medical devices. However, the question of how to use a predictive model for control is often left unanswered due to the associated challenges, namely a significantly higher system complexity, the requirement of much larger data sets and an increased and often problem-specific modeling effort. To solve these issues, we present a universal framework (which we call QuaSiModO: Quantization-Simulation-Modeling-Optimization) to transform arbitrary predictive models into control systems and use them for feedback control. The advantages of our approach are a linear increase in data requirements with respect to the control dimension, performance guarantees that rely exclusively on the accuracy of the predictive model, and only little prior knowledge requirements in control theory to solve complex control problems. In particular the latter point is of key importance to enable a large number of researchers and practitioners to exploit the ever increasing capabilities of predictive models for control in a straight-forward and systematic fashion.}}, author = {{Peitz, Sebastian and Bieker, Katharina}}, journal = {{Automatica}}, publisher = {{Elsevier}}, title = {{{On the Universal Transformation of Data-Driven Models to Control Systems}}}, doi = {{10.1016/j.automatica.2022.110840}}, volume = {{149}}, year = {{2023}}, } @book{47547, editor = {{Kalenborn, Axel and Fazal-Baqaie, Masud and Linssen, Oliver and Volland, Alexander and Yigitbas, Enes and Engstler, Martin and Bertram, Martin}}, publisher = {{Gesellschaft für Informatik e.V}}, title = {{{Projektmanagement Und Vorgehensmodelle 2023 - Nachhaltige IT-Projekte}}}, volume = {{Vol. P340}}, year = {{2023}}, } @article{47800, abstract = {{The introduction of Systems Engineering is an approach for dealing with the increasing complexity of products and their associated product development. Several introduction strategies are available in the literature; nevertheless, the introduction of Systems Engineering into practice still poses a great challenge to companies. Many companies have already gained experience in the introduction of Systems Engineering. Therefore, as part of the SE4OWL research project, the need to conduct a study including expert interviews and to collect the experiences of experts was identified. A total of 78 hypotheses were identified from 13 expert interviews concerning the lessons learned. Using exclusion criteria, 52 hypotheses were validated in a subsequent quantitative survey with 112 participants. Of these 52 hypotheses, 40 could be confirmed based on the survey results. Only four hypotheses were rejected, and eight could neither be confirmed nor rejected. Through this research, guidance is provided to companies to leverage best practices for the introduction of their own Systems Engineering and to avoid the poor practices of other companies.}}, author = {{Wilke, Daria and Grothe, Robin and Bretz, Lukas and Anacker, Harald and Dumitrescu, Roman}}, 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 = {{{Lessons Learned from the Introduction of Systems Engineering}}}, doi = {{10.3390/systems11030119}}, volume = {{11}}, year = {{2023}}, } @article{47798, abstract = {{Abstract In diesem Beitrag wird die soziotechnische Gestaltung einer Intelligenten Personaleinsatzplanung beim Unternehmen Miele & Cie. KG im Rahmen des Leuchtturmprojekts „InTime“ im Kompetenzzentrum Arbeitswelt.Plus beschrieben. Hierzu werden die Durchführung und Auswertung einer Interviewreihe sowie das daraus erarbeitete Soll-Konzept vorgestellt.}}, author = {{Gabriel, Stefan and Bentler, Dominik and Bansmann, Michael and Andrew Latos, Benedikt and Kühn, Arno and Dumitrescu, Roman}}, issn = {{2511-0896}}, journal = {{Zeitschrift für wirtschaftlichen Fabrikbetrieb}}, keywords = {{Management Science and Operations Research, Strategy and Management, General Engineering}}, number = {{1-2}}, pages = {{64--68}}, publisher = {{Walter de Gruyter GmbH}}, title = {{{Soziotechnische Gestaltung einer intelligenten Personaleinsatzplanung}}}, doi = {{10.1515/zwf-2023-1009}}, volume = {{118}}, year = {{2023}}, } @inbook{47797, author = {{Menzefricke, Jörn Steffen and Gabriel, Stefan and Gundlach, Thomas and Hobscheidt, Daniela and Kürpick, Christian and Schnasse, Felix and Scholtysik, Michel and Seif, Heiko and Koldewey, Christian and Dumitrescu, Roman}}, booktitle = {{Schwerpunkt Business Model Innovation}}, isbn = {{9783658366339}}, issn = {{2569-2348}}, publisher = {{Springer Fachmedien Wiesbaden}}, title = {{{Soziotechnisches Risikomanagement als Erfolgsfaktor für die Digitale Transformation}}}, doi = {{10.1007/978-3-658-36634-6_14}}, year = {{2023}}, } @inproceedings{47799, author = {{Bentler, Dominik and Gabriel, Stefan and Latos, Benedikt A. and Dietrich, Oliver and Dumitrescu, Roman and Maier, Günter W.}}, booktitle = {{GfA-Frühjahrskongress 2023}}, publisher = {{GfA, Sankt Augustin}}, title = {{{Partizipatives Gestaltungsvorgehen bei der Einführung künstlicher Intelligenz in produzierenden Unternehmen}}}, year = {{2023}}, } @article{47827, author = {{Weller, Julian and Roesmann, Daniel and Eggert, Sönke and von Enzberg, Sebastian and Gräßler, Iris and Dumitrescu, Roman}}, issn = {{2212-8271}}, journal = {{Procedia CIRP}}, keywords = {{General Medicine}}, pages = {{514--520}}, publisher = {{Elsevier BV}}, title = {{{Identification and prediction of standard times in machining for precision steel tubes through the usage of data analytics}}}, doi = {{10.1016/j.procir.2023.01.011}}, volume = {{119}}, year = {{2023}}, } @article{47822, author = {{Machon, Fabian and Gabriel, Stefan and Latos, Benedikt and Holtkötter, Christoph and Lütkehoff, Ben and Asmar, Laban and Kühn, Arno and Dumitrescu, Roman}}, issn = {{2212-8271}}, journal = {{Procedia CIRP}}, keywords = {{General Medicine}}, pages = {{1017--1022}}, publisher = {{Elsevier BV}}, title = {{{Design of individual simulation games in manufacturing companies for game-based learning}}}, doi = {{10.1016/j.procir.2023.03.145}}, volume = {{119}}, year = {{2023}}, } @article{47824, author = {{Brock, Jonathan and von Enzberg, Sebastian and Kühn, Arno and Dumitrescu, Roman}}, issn = {{2212-8271}}, journal = {{Procedia CIRP}}, keywords = {{General Medicine}}, pages = {{602--607}}, publisher = {{Elsevier BV}}, title = {{{Process Mining Data Canvas: A method to identify data and process knowledge for data collection and preparation in process mining projects}}}, doi = {{10.1016/j.procir.2023.03.114}}, volume = {{119}}, year = {{2023}}, } @article{47826, author = {{Wilke, Daria and Schierbaum, Anja and Anacker, Harald and Dumitrescu, Roman}}, issn = {{2212-8271}}, journal = {{Procedia CIRP}}, keywords = {{General Medicine}}, pages = {{788--793}}, publisher = {{Elsevier BV}}, title = {{{Targeted-oriented selection of engineering methods}}}, doi = {{10.1016/j.procir.2023.02.166}}, volume = {{119}}, year = {{2023}}, } @phdthesis{47833, author = {{König, Jürgen}}, title = {{{On the Membership and Correctness Problem for State Serializability and Value Opacity}}}, year = {{2023}}, } @phdthesis{47837, author = {{Hansmeier, Tim}}, title = {{{XCS for Self-awareness in Autonomous Computing Systems}}}, year = {{2023}}, } @inproceedings{32407, abstract = {{Estimating the ground state energy of a local Hamiltonian is a central problem in quantum chemistry. In order to further investigate its complexity and the potential of quantum algorithms for quantum chemistry, Gharibian and Le Gall (STOC 2022) recently introduced the guided local Hamiltonian problem (GLH), which is a variant of the local Hamiltonian problem where an approximation of a ground state is given as an additional input. Gharibian and Le Gall showed quantum advantage (more precisely, BQP-completeness) for GLH with $6$-local Hamiltonians when the guiding vector has overlap (inverse-polynomially) close to 1/2 with a ground state. In this paper, we optimally improve both the locality and the overlap parameters: we show that this quantum advantage (BQP-completeness) persists even with 2-local Hamiltonians, and even when the guiding vector has overlap (inverse-polynomially) close to 1 with a ground state. Moreover, we show that the quantum advantage also holds for 2-local physically motivated Hamiltonians on a 2D square lattice. This makes a further step towards establishing practical quantum advantage in quantum chemistry.}}, author = {{Gharibian, Sevag and Hayakawa, Ryu and Gall, François Le and Morimae, Tomoyuki}}, booktitle = {{Proceedings of the 50th EATCS International Colloquium on Automata, Languages and Programming (ICALP)}}, number = {{32}}, pages = {{1--19}}, title = {{{Improved Hardness Results for the Guided Local Hamiltonian Problem}}}, doi = {{10.4230/LIPIcs.ICALP.2023.32}}, volume = {{261}}, year = {{2023}}, } @article{48051, author = {{Humpert, Lynn and Wäschle, Moritz and Horstmeyer, Sarah and Anacker, Harald and Dumitrescu, Roman and Albers, Albert}}, issn = {{2212-8271}}, journal = {{Procedia CIRP}}, keywords = {{General Medicine}}, pages = {{693--698}}, publisher = {{Elsevier BV}}, title = {{{Stakeholder-oriented Elaboration of Artificial Intelligence use cases using the example of Special-Purpose engineering}}}, doi = {{10.1016/j.procir.2023.02.160}}, volume = {{119}}, year = {{2023}}, } @inproceedings{47522, abstract = {{Artificial benchmark functions are commonly used in optimization research because of their ability to rapidly evaluate potential solutions, making them a preferred substitute for real-world problems. However, these benchmark functions have faced criticism for their limited resemblance to real-world problems. In response, recent research has focused on automatically generating new benchmark functions for areas where established test suites are inadequate. These approaches have limitations, such as the difficulty of generating new benchmark functions that exhibit exploratory landscape analysis (ELA) features beyond those of existing benchmarks.The objective of this work is to develop a method for generating benchmark functions for single-objective continuous optimization with user-specified structural properties. Specifically, we aim to demonstrate a proof of concept for a method that uses an ELA feature vector to specify these properties in advance. To achieve this, we begin by generating a random sample of decision space variables and objective values. We then adjust the objective values using CMA-ES until the corresponding features of our new problem match the predefined ELA features within a specified threshold. By iteratively transforming the landscape in this way, we ensure that the resulting function exhibits the desired properties. To create the final function, we use the resulting point cloud as training data for a simple neural network that produces a function exhibiting the target ELA features. We demonstrate the effectiveness of this approach by replicating the existing functions of the well-known BBOB suite and creating new functions with ELA feature values that are not present in BBOB.}}, author = {{Prager, Raphael Patrick and Dietrich, Konstantin and Schneider, Lennart and Schäpermeier, Lennart and Bischl, Bernd and Kerschke, Pascal and Trautmann, Heike and Mersmann, Olaf}}, booktitle = {{Proceedings of the 17th ACM/SIGEVO Conference on Foundations of Genetic Algorithms}}, isbn = {{9798400702020}}, keywords = {{Benchmarking, Instance Generator, Black-Box Continuous Optimization, Exploratory Landscape Analysis, Neural Networks}}, pages = {{129–139}}, publisher = {{Association for Computing Machinery}}, title = {{{Neural Networks as Black-Box Benchmark Functions Optimized for Exploratory Landscape Features}}}, doi = {{10.1145/3594805.3607136}}, year = {{2023}}, } @inproceedings{46297, abstract = {{Exploratory landscape analysis (ELA) in single-objective black-box optimization relies on a comprehensive and large set of numerical features characterizing problem instances. Those foster problem understanding and serve as basis for constructing automated algorithm selection models choosing the best suited algorithm for a problem at hand based on the aforementioned features computed prior to optimization. This work specifically points to the sensitivity of a substantial proportion of these features to absolute objective values, i.e., we observe a lack of shift and scale invariance. We show that this unfortunately induces bias within automated algorithm selection models, an overfitting to specific benchmark problem sets used for training and thereby hinders generalization capabilities to unseen problems. We tackle these issues by presenting an appropriate objective normalization to be used prior to ELA feature computation and empirically illustrate the respective effectiveness focusing on the BBOB benchmark set.}}, author = {{Prager, Raphael Patrick and Trautmann, Heike}}, booktitle = {{Applications of Evolutionary Computation}}, editor = {{Correia, João and Smith, Stephen and Qaddoura, Raneem}}, isbn = {{978-3-031-30229-9}}, pages = {{411–425}}, publisher = {{Springer Nature Switzerland}}, title = {{{Nullifying the Inherent Bias of Non-invariant Exploratory Landscape Analysis Features}}}, year = {{2023}}, }