[{"publication_status":"published","citation":{"short":"S. Lange, D. Schröder, C. Hedayat, H. Kuhn, U. Hilleringmann, in: 22nd IEEE International Conference on Industrial Technology (ICIT), IEEE,  Valencia, Spain , 2021.","bibtex":"@inproceedings{Lange_Schröder_Hedayat_Kuhn_Hilleringmann_2021, place={ Valencia, Spain }, title={Development of Methods for Coil-Based Localization by Magnetic Fields of Miniaturized Sensor Platforms in Bioprocesses}, DOI={<a href=\"https://doi.org/10.1109/icit46573.2021.9453609\">10.1109/icit46573.2021.9453609</a>}, booktitle={22nd IEEE International Conference on Industrial Technology (ICIT)}, publisher={IEEE}, author={Lange, Sven and Schröder, Dominik and Hedayat, Christian and Kuhn, Harald and Hilleringmann, Ulrich}, year={2021} }","mla":"Lange, Sven, et al. “Development of Methods for Coil-Based Localization by Magnetic Fields of Miniaturized Sensor Platforms in Bioprocesses.” <i>22nd IEEE International Conference on Industrial Technology (ICIT)</i>, IEEE, 2021, doi:<a href=\"https://doi.org/10.1109/icit46573.2021.9453609\">10.1109/icit46573.2021.9453609</a>.","ieee":"S. Lange, D. Schröder, C. Hedayat, H. Kuhn, and U. Hilleringmann, “Development of Methods for Coil-Based Localization by Magnetic Fields of Miniaturized Sensor Platforms in Bioprocesses,” in <i>22nd IEEE International Conference on Industrial Technology (ICIT)</i>, Valencia, Spain , 2021.","chicago":"Lange, Sven, Dominik Schröder, Christian Hedayat, Harald Kuhn, and Ulrich Hilleringmann. “Development of Methods for Coil-Based Localization by Magnetic Fields of Miniaturized Sensor Platforms in Bioprocesses.” In <i>22nd IEEE International Conference on Industrial Technology (ICIT)</i>.  Valencia, Spain : IEEE, 2021. <a href=\"https://doi.org/10.1109/icit46573.2021.9453609\">https://doi.org/10.1109/icit46573.2021.9453609</a>.","apa":"Lange, S., Schröder, D., Hedayat, C., Kuhn, H., &#38; Hilleringmann, U. (2021). Development of Methods for Coil-Based Localization by Magnetic Fields of Miniaturized Sensor Platforms in Bioprocesses. In <i>22nd IEEE International Conference on Industrial Technology (ICIT)</i>.  Valencia, Spain : IEEE. <a href=\"https://doi.org/10.1109/icit46573.2021.9453609\">https://doi.org/10.1109/icit46573.2021.9453609</a>","ama":"Lange S, Schröder D, Hedayat C, Kuhn H, Hilleringmann U. Development of Methods for Coil-Based Localization by Magnetic Fields of Miniaturized Sensor Platforms in Bioprocesses. In: <i>22nd IEEE International Conference on Industrial Technology (ICIT)</i>.  Valencia, Spain : IEEE; 2021. doi:<a href=\"https://doi.org/10.1109/icit46573.2021.9453609\">10.1109/icit46573.2021.9453609</a>"},"department":[{"_id":"59"},{"_id":"485"}],"author":[{"first_name":"Sven","full_name":"Lange, Sven","id":"38240","last_name":"Lange"},{"last_name":"Schröder","first_name":"Dominik","full_name":"Schröder, Dominik"},{"full_name":"Hedayat, Christian","first_name":"Christian","last_name":"Hedayat"},{"full_name":"Kuhn, Harald","first_name":"Harald","last_name":"Kuhn"},{"full_name":"Hilleringmann, Ulrich","first_name":"Ulrich","last_name":"Hilleringmann"}],"conference":{"start_date":"2021-03-10","location":"Valencia, Spain ","name":"22nd IEEE International Conference on Industrial Technology (ICIT)","end_date":"2021-03-12"},"place":" Valencia, Spain ","_id":"22480","date_updated":"2022-01-06T06:55:33Z","publisher":"IEEE","date_created":"2021-06-20T23:25:54Z","status":"public","language":[{"iso":"eng"}],"publication_identifier":{"isbn":["9781728157306"]},"year":"2021","keyword":["Location awareness","Coils","Couplings","Nonuniform electric fields","Magnetic separation","Neural networks","Training data"],"main_file_link":[{"url":"https://ieeexplore.ieee.org/document/9453609"}],"user_id":"38240","title":"Development of Methods for Coil-Based Localization by Magnetic Fields of Miniaturized Sensor Platforms in Bioprocesses","doi":"10.1109/icit46573.2021.9453609","abstract":[{"text":"In this publication important aspects for the implementation of inductive locating are explained. The miniaturized sensor platform called Sens-o-Spheres is used as an application of this locating method. The sensor platform is applied in bioreactors in order to obtain the environmental parameters, which makes a localization by magnetic fields necessary. Since the properties of magnetic fields in the localization area are very different from the wave characteristics, the principle of inductive localization is investigated in this publication and explained by using electrical equivalent circuit diagrams. Thereby, inductive localization uses the coupling or the mutual inductivities between coils, which is noticeable by an induced voltage. Therefore some properties and procedures are explained to extract the location of Sens-o-Spheres or other industrial sensor platforms from the couplings of the coils. One method calculates the location from an adapted ratio calculation and the other method uses neural networks and stochastic filters to obtain the results. In the end, these results are evaluated and compared.","lang":"eng"}],"project":[{"_id":"52","name":"Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"publication":"22nd IEEE International Conference on Industrial Technology (ICIT)","type":"conference"},{"citation":{"chicago":"Sander, Tom, Sven Lange, Ulrich Hilleringmann, Volker Geneis, Christian Hedayat, Harald Kuhn, and Franz-Barthold Gockel. “Detection of Defects on Irregular Structured Surfaces by Image Processing Methods for Feature Extraction.” In <i>22nd IEEE International Conference on Industrial Technology (ICIT)</i>. Valencia, Spain : IEEE, 2021. <a href=\"https://doi.org/10.1109/icit46573.2021.9453646\">https://doi.org/10.1109/icit46573.2021.9453646</a>.","ieee":"T. Sander <i>et al.</i>, “Detection of Defects on Irregular Structured Surfaces by Image Processing Methods for Feature Extraction,” in <i>22nd IEEE International Conference on Industrial Technology (ICIT)</i>, Valencia, Spain , 2021.","apa":"Sander, T., Lange, S., Hilleringmann, U., Geneis, V., Hedayat, C., Kuhn, H., &#38; Gockel, F.-B. (2021). Detection of Defects on Irregular Structured Surfaces by Image Processing Methods for Feature Extraction. In <i>22nd IEEE International Conference on Industrial Technology (ICIT)</i>. Valencia, Spain : IEEE. <a href=\"https://doi.org/10.1109/icit46573.2021.9453646\">https://doi.org/10.1109/icit46573.2021.9453646</a>","ama":"Sander T, Lange S, Hilleringmann U, et al. Detection of Defects on Irregular Structured Surfaces by Image Processing Methods for Feature Extraction. In: <i>22nd IEEE International Conference on Industrial Technology (ICIT)</i>. Valencia, Spain : IEEE; 2021. doi:<a href=\"https://doi.org/10.1109/icit46573.2021.9453646\">10.1109/icit46573.2021.9453646</a>","short":"T. Sander, S. Lange, U. Hilleringmann, V. Geneis, C. Hedayat, H. Kuhn, F.-B. Gockel, in: 22nd IEEE International Conference on Industrial Technology (ICIT), IEEE, Valencia, Spain , 2021.","mla":"Sander, Tom, et al. “Detection of Defects on Irregular Structured Surfaces by Image Processing Methods for Feature Extraction.” <i>22nd IEEE International Conference on Industrial Technology (ICIT)</i>, IEEE, 2021, doi:<a href=\"https://doi.org/10.1109/icit46573.2021.9453646\">10.1109/icit46573.2021.9453646</a>.","bibtex":"@inproceedings{Sander_Lange_Hilleringmann_Geneis_Hedayat_Kuhn_Gockel_2021, place={Valencia, Spain }, title={Detection of Defects on Irregular Structured Surfaces by Image Processing Methods for Feature Extraction}, DOI={<a href=\"https://doi.org/10.1109/icit46573.2021.9453646\">10.1109/icit46573.2021.9453646</a>}, booktitle={22nd IEEE International Conference on Industrial Technology (ICIT)}, publisher={IEEE}, author={Sander, Tom and Lange, Sven and Hilleringmann, Ulrich and Geneis, Volker and Hedayat, Christian and Kuhn, Harald and Gockel, Franz-Barthold}, year={2021} }"},"user_id":"38240","main_file_link":[{"url":"https://ieeexplore.ieee.org/document/9453646"}],"publication_status":"published","keyword":["Image Processing","Defect Detection","wooden surfaces","Machine Learning","Neural Networks"],"department":[{"_id":"59"},{"_id":"485"}],"conference":{"location":"Valencia, Spain ","start_date":"2021-03-10","name":"22nd IEEE International Conference on Industrial Technology (ICIT)","end_date":"2021-03-12"},"title":"Detection of Defects on Irregular Structured Surfaces by Image Processing Methods for Feature Extraction","author":[{"first_name":"Tom","full_name":"Sander, Tom","last_name":"Sander"},{"full_name":"Lange, Sven","first_name":"Sven","last_name":"Lange","id":"38240"},{"last_name":"Hilleringmann","full_name":"Hilleringmann, Ulrich","first_name":"Ulrich"},{"first_name":"Volker","full_name":"Geneis, Volker","last_name":"Geneis"},{"full_name":"Hedayat, Christian","first_name":"Christian","last_name":"Hedayat"},{"last_name":"Kuhn","full_name":"Kuhn, Harald","first_name":"Harald"},{"last_name":"Gockel","first_name":"Franz-Barthold","full_name":"Gockel, Franz-Barthold"}],"place":"Valencia, Spain ","doi":"10.1109/icit46573.2021.9453646","abstract":[{"lang":"eng","text":"During the industrial processing of materials for the manufacture of new products, surface defects can quickly occur. In order to achieve high quality without a long time delay, it makes sense to inspect the work pieces so that defective work pieces can be sorted out right at the beginning of the process. At the same time, the evaluation unit should come close the perception of the human eye regarding detection of defects in surfaces. Such defects often manifest themselves by a deviation of the existing structure. The only restriction should be that only matt surfaces should be considered here. Therefore in this work, different classification and image processing algorithms are applied to surface data to identify possible surface damages. For this purpose, the Gabor filter and the FST (Fused Structure and Texture) features generated with it, as well as the salience metric are used on the image processing side. On the classification side, however, deep neural networks, Convolutional Neural Networks (CNN), and autoencoders are used to make a decision. A distinction is also made between training using class labels and without. It turns out later that the salience metric are best performed by CNN. On the other hand, if there is no labeled training data available, a novelty classification can easily be achieved by using autoencoders as well as the salience metric and some filters."}],"_id":"22481","date_updated":"2022-01-06T06:55:33Z","publication":"22nd IEEE International Conference on Industrial Technology (ICIT)","date_created":"2021-06-20T23:32:11Z","publisher":"IEEE","type":"conference","year":"2021","publication_identifier":{"isbn":["9781728157306"]},"language":[{"iso":"eng"}],"status":"public"},{"user_id":"477","citation":{"ieee":"M. Brede, <i>Implementation and Profiling of XCS in the Context of Embedded Systems</i>. Paderborn: Paderborn University, 2021.","chicago":"Brede, Mathis. <i>Implementation and Profiling of XCS in the Context of Embedded Systems</i>. Paderborn: Paderborn University, 2021.","apa":"Brede, M. (2021). <i>Implementation and Profiling of XCS in the Context of Embedded Systems</i>. Paderborn: Paderborn University.","ama":"Brede M. <i>Implementation and Profiling of XCS in the Context of Embedded Systems</i>. Paderborn: Paderborn University; 2021.","short":"M. Brede, Implementation and Profiling of XCS in the Context of Embedded Systems, Paderborn University, Paderborn, 2021.","bibtex":"@book{Brede_2021, place={Paderborn}, title={Implementation and Profiling of XCS in the Context of Embedded Systems}, publisher={Paderborn University}, author={Brede, Mathis}, year={2021} }","mla":"Brede, Mathis. <i>Implementation and Profiling of XCS in the Context of Embedded Systems</i>. Paderborn University, 2021."},"department":[{"_id":"78"}],"extern":"1","author":[{"first_name":"Mathis","full_name":"Brede, Mathis","last_name":"Brede"}],"title":"Implementation and Profiling of XCS in the Context of Embedded Systems","abstract":[{"text":"This bachelor thesis presents a C/C++ implementation of the XCS algorithm for an embedded system and profiling results concerning the execution time of the functions. These are then analyzed in relation to the input characteristics of the examined learning environments and compared with related work. Three main conclusions can be drawn from the measured results. First, the maximum size of the population of the classifiers influences the runtime of the genetic algorithm; second, the size of the input space has a direct effect on the execution time of the matching function; and last, a larger action space results in a longer runtime generating the prediction for the possible actions. The dependencies identified here can serve to optimize the computational efficiency and make XCS more suitable for embedded systems.","lang":"eng"}],"supervisor":[{"full_name":"Platzner, Marco","first_name":"Marco","id":"398","last_name":"Platzner"},{"orcid":"0000-0003-1377-3339","id":"49992","last_name":"Hansmeier","full_name":"Hansmeier, Tim","first_name":"Tim"}],"place":"Paderborn","project":[{"_id":"14","name":"SFB 901 - Subproject C2"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901","_id":"1"}],"_id":"22483","date_updated":"2022-01-06T06:55:33Z","publisher":"Paderborn University","date_created":"2021-06-21T09:35:03Z","status":"public","language":[{"iso":"eng"}],"year":"2021","type":"bachelorsthesis"},{"date_updated":"2022-01-06T06:55:35Z","_id":"22510","publication_identifier":{"issn":["0304-3975"]},"year":"2021","language":[{"iso":"eng"}],"status":"public","date_created":"2021-06-28T09:24:15Z","department":[{"_id":"63"}],"citation":{"short":"S. Li, C. Markarian, F. Meyer auf der Heide, P. Podlipyan, Theoretical Computer Science 852 (2021) 41–60.","bibtex":"@article{Li_Markarian_Meyer auf der Heide_Podlipyan_2021, title={A continuous strategy for collisionless gathering}, volume={852}, DOI={<a href=\"https://doi.org/10.1016/j.tcs.2020.10.037\">10.1016/j.tcs.2020.10.037</a>}, journal={Theoretical Computer Science}, author={Li, Shouwei and Markarian, Christine and Meyer auf der Heide, Friedhelm and Podlipyan, Pavel}, year={2021}, pages={41–60} }","mla":"Li, Shouwei, et al. “A Continuous Strategy for Collisionless Gathering.” <i>Theoretical Computer Science</i>, vol. 852, 2021, pp. 41–60, doi:<a href=\"https://doi.org/10.1016/j.tcs.2020.10.037\">10.1016/j.tcs.2020.10.037</a>.","ieee":"S. Li, C. Markarian, F. Meyer auf der Heide, and P. Podlipyan, “A continuous strategy for collisionless gathering,” <i>Theoretical Computer Science</i>, vol. 852, pp. 41–60, 2021.","chicago":"Li, Shouwei, Christine Markarian, Friedhelm Meyer auf der Heide, and Pavel Podlipyan. “A Continuous Strategy for Collisionless Gathering.” <i>Theoretical Computer Science</i> 852 (2021): 41–60. <a href=\"https://doi.org/10.1016/j.tcs.2020.10.037\">https://doi.org/10.1016/j.tcs.2020.10.037</a>.","apa":"Li, S., Markarian, C., Meyer auf der Heide, F., &#38; Podlipyan, P. (2021). A continuous strategy for collisionless gathering. <i>Theoretical Computer Science</i>, <i>852</i>, 41–60. <a href=\"https://doi.org/10.1016/j.tcs.2020.10.037\">https://doi.org/10.1016/j.tcs.2020.10.037</a>","ama":"Li S, Markarian C, Meyer auf der Heide F, Podlipyan P. A continuous strategy for collisionless gathering. <i>Theoretical Computer Science</i>. 2021;852:41-60. doi:<a href=\"https://doi.org/10.1016/j.tcs.2020.10.037\">10.1016/j.tcs.2020.10.037</a>"},"publication_status":"published","intvolume":"       852","author":[{"full_name":"Li, Shouwei","first_name":"Shouwei","last_name":"Li"},{"last_name":"Markarian","first_name":"Christine","full_name":"Markarian, Christine"},{"last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"},{"last_name":"Podlipyan","first_name":"Pavel","full_name":"Podlipyan, Pavel"}],"page":"41-60","volume":852,"type":"journal_article","publication":"Theoretical Computer Science","user_id":"15415","keyword":["Local algorithms","Distributed algorithms","Collisionless gathering","Mobile robots","Multiagent system"],"abstract":[{"lang":"eng","text":"Over the past decades, the Gathering problem, which asks to gather a group of robots in finite time given some restrictions, has been intensively studied. In this paper, we are given a group of n autonomous, dimensionless, deterministic, and anonymous robots, with bounded viewing range. Assuming a continuous time model, the goal is to gather these robots into one point in finite time. We introduce a simple convergence criterion that defines a new class of algorithms which perform gathering in O(nd) time, where d is the diameter of the initial robot configuration. We show that some gathering algorithms in the literature belong to this class and propose two new algorithms that belong to this class and have quadratic running time, namely, Go-To-The-Relative-Center algorithm (GTRC) and Safe-Go-To-The-Relative-Center algorithm (S-GTRC). We prove that the latter can perform gathering without collision by using a slightly more complex robot model: non oblivious, chiral, and luminous (i.e. robots have observable external memory, as in [8]). We also consider a variant of the Gathering problem, the Near-Gathering problem, in which robots must get close to each other without colliding. We show that S-GTRC solves the Near-Gathering problem in quadratic time and assumes a weaker robot model than the one assumed in the current state-of-the-art."}],"doi":"10.1016/j.tcs.2020.10.037","title":"A continuous strategy for collisionless gathering"},{"year":"2021","publication_identifier":{"issn":["0304-3975"]},"language":[{"iso":"eng"}],"status":"public","date_created":"2021-06-28T09:34:45Z","date_updated":"2022-01-06T06:55:35Z","_id":"22511","intvolume":"       852","author":[{"full_name":"Li, Shouwei","first_name":"Shouwei","last_name":"Li"},{"last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"},{"full_name":"Podlipyan, Pavel","first_name":"Pavel","last_name":"Podlipyan"}],"department":[{"_id":"63"}],"citation":{"apa":"Li, S., Meyer auf der Heide, F., &#38; Podlipyan, P. (2021). The impact of the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous robots. <i>Theoretical Computer Science</i>, <i>852</i>, 29–40. <a href=\"https://doi.org/10.1016/j.tcs.2020.11.009\">https://doi.org/10.1016/j.tcs.2020.11.009</a>","ama":"Li S, Meyer auf der Heide F, Podlipyan P. The impact of the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous robots. <i>Theoretical Computer Science</i>. 2021;852:29-40. doi:<a href=\"https://doi.org/10.1016/j.tcs.2020.11.009\">10.1016/j.tcs.2020.11.009</a>","chicago":"Li, Shouwei, Friedhelm Meyer auf der Heide, and Pavel Podlipyan. “The Impact of the Gabriel Subgraph of the Visibility Graph on the Gathering of Mobile Autonomous Robots.” <i>Theoretical Computer Science</i> 852 (2021): 29–40. <a href=\"https://doi.org/10.1016/j.tcs.2020.11.009\">https://doi.org/10.1016/j.tcs.2020.11.009</a>.","ieee":"S. Li, F. Meyer auf der Heide, and P. Podlipyan, “The impact of the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous robots,” <i>Theoretical Computer Science</i>, vol. 852, pp. 29–40, 2021.","mla":"Li, Shouwei, et al. “The Impact of the Gabriel Subgraph of the Visibility Graph on the Gathering of Mobile Autonomous Robots.” <i>Theoretical Computer Science</i>, vol. 852, 2021, pp. 29–40, doi:<a href=\"https://doi.org/10.1016/j.tcs.2020.11.009\">10.1016/j.tcs.2020.11.009</a>.","bibtex":"@article{Li_Meyer auf der Heide_Podlipyan_2021, title={The impact of the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous robots}, volume={852}, DOI={<a href=\"https://doi.org/10.1016/j.tcs.2020.11.009\">10.1016/j.tcs.2020.11.009</a>}, journal={Theoretical Computer Science}, author={Li, Shouwei and Meyer auf der Heide, Friedhelm and Podlipyan, Pavel}, year={2021}, pages={29–40} }","short":"S. Li, F. Meyer auf der Heide, P. Podlipyan, Theoretical Computer Science 852 (2021) 29–40."},"publication_status":"published","type":"journal_article","publication":"Theoretical Computer Science","page":"29-40","volume":852,"abstract":[{"text":"In this paper, we reconsider the well-known discrete, round-based Go-To-The-Center algorithm due to Ando, Suzuki, and Yamashita [2] for gathering n autonomous mobile robots with limited viewing range in the plane. Remarquably, this algorithm exploits the fact that during its execution, many collisions of robots occur. Such collisions are interpreted as a success because it is assumed that such collided robots behave the same from now on. This is acceptable under the assumption that each robot is represented by a single point. Otherwise, collisions should be avoided. In this paper, we consider a continuous Go-To-The-Center algorithm in which the robots continuously observe the positions of their neighbors and adapt their speed (assuming a speed limit) and direction. Our first results are time bounds of O(n2) for gathering in two dimensions Euclidean space, and Θ(n) for the one dimension. Our main contribution is the introduction and evaluation of a continuous algorithm which performs Go-To-The-Center considering only the neighbors of a robot with respect to the Gabriel subgraph of the visibility graph, i.e. Go-To-The-Gabriel-Center algorithm. We show that this modification still correctly executes gathering in one and two dimensions, with the same time bounds as above. Simulations exhibit a severe difference of the behavior of the Go-To-The-Center and the Go-To-The-Gabriel-Center algorithms: Whereas lots of collisions occur during a run of the Go-To-The-Center algorithm, typically only one, namely the final collision occurs during a run of the Go-To-The-Gabriel-Center algorithm. We can prove this “collisionless property” of the Go-To-The-Gabriel-Center algorithm for one dimension. In two-dimensional Euclidean space, we conjecture that the “collisionless property” holds for almost every initial configuration. We support our conjecture with measurements obtained from the simulation where robots execute both continuous Go-To-The-Center and Go-To-The-Gabriel-Center algorithms.\r\n","lang":"eng"}],"doi":"10.1016/j.tcs.2020.11.009","title":"The impact of the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous robots","user_id":"15415","keyword":["Local algorithms","Distributed algorithms","Collisionless gathering","Mobile robots","Multiagent system"]},{"language":[{"iso":"eng"}],"type":"conference","year":"2021","publication_identifier":{"isbn":["9781665440929"]},"status":"public","date_created":"2021-07-05T19:31:52Z","publication":"2021 Smart Systems Integration (SSI)","publisher":"IEEE","date_updated":"2022-01-06T06:55:36Z","_id":"22532","place":"Grenoble, France","doi":"10.1109/ssi52265.2021.9466958","abstract":[{"lang":"eng","text":"In this publication, further elements of the newly developed inductive localization in the near field are presented. The advantage of inductive localization is the usage of the magnetic fields, which have a very low influence of non-metallic materials in the environment and thus follows good applications in the area of medicine and biochemistry. This allows a precise localization of sensor platforms in inhomogeneous mixtures of materials, where classical methods have major problems with inhomogeneous dielectric conductivity or density. The calculation of the localization of the searched object differs from other methods such as ultrasound or electromagnetic waves due to the source-free propagation of the magnetic field. Therefore, new mathematical evaluation methods and systematic adaptations are necessary, which are presented in this paper in circuit analysis. For this purpose, the exact circuit influences of one coil and the influence of another coil are investigated and which resonance circuit should be selected for both coils for a inductive localization with optimized signal strength."}],"title":"Adaptation and Optimization of Planar Coils for a More Accurate and Far-Reaching Magnetic Field-Based Localization in the Near Field","conference":{"end_date":"2021-04-29","location":"Grenoble, France ","start_date":"2021-04-27","name":"2021 Smart Systems Integration (SSI)"},"author":[{"full_name":"Lange, Sven","first_name":"Sven","id":"38240","last_name":"Lange"},{"first_name":"Christian","full_name":"Hedayat, Christian","last_name":"Hedayat"},{"last_name":"Kuhn","first_name":"Harald","full_name":"Kuhn, Harald"},{"first_name":"Ulrich","full_name":"Hilleringmann, Ulrich","last_name":"Hilleringmann"}],"department":[{"_id":"59"},{"_id":"485"}],"citation":{"ama":"Lange S, Hedayat C, Kuhn H, Hilleringmann U. Adaptation and Optimization of Planar Coils for a More Accurate and Far-Reaching Magnetic Field-Based Localization in the Near Field. In: <i>2021 Smart Systems Integration (SSI)</i>. Grenoble, France: IEEE; 2021. doi:<a href=\"https://doi.org/10.1109/ssi52265.2021.9466958\">10.1109/ssi52265.2021.9466958</a>","apa":"Lange, S., Hedayat, C., Kuhn, H., &#38; Hilleringmann, U. (2021). Adaptation and Optimization of Planar Coils for a More Accurate and Far-Reaching Magnetic Field-Based Localization in the Near Field. In <i>2021 Smart Systems Integration (SSI)</i>. Grenoble, France: IEEE. <a href=\"https://doi.org/10.1109/ssi52265.2021.9466958\">https://doi.org/10.1109/ssi52265.2021.9466958</a>","ieee":"S. Lange, C. Hedayat, H. Kuhn, and U. Hilleringmann, “Adaptation and Optimization of Planar Coils for a More Accurate and Far-Reaching Magnetic Field-Based Localization in the Near Field,” in <i>2021 Smart Systems Integration (SSI)</i>, Grenoble, France , 2021.","chicago":"Lange, Sven, Christian Hedayat, Harald Kuhn, and Ulrich Hilleringmann. “Adaptation and Optimization of Planar Coils for a More Accurate and Far-Reaching Magnetic Field-Based Localization in the Near Field.” In <i>2021 Smart Systems Integration (SSI)</i>. Grenoble, France: IEEE, 2021. <a href=\"https://doi.org/10.1109/ssi52265.2021.9466958\">https://doi.org/10.1109/ssi52265.2021.9466958</a>.","bibtex":"@inproceedings{Lange_Hedayat_Kuhn_Hilleringmann_2021, place={Grenoble, France}, title={Adaptation and Optimization of Planar Coils for a More Accurate and Far-Reaching Magnetic Field-Based Localization in the Near Field}, DOI={<a href=\"https://doi.org/10.1109/ssi52265.2021.9466958\">10.1109/ssi52265.2021.9466958</a>}, booktitle={2021 Smart Systems Integration (SSI)}, publisher={IEEE}, author={Lange, Sven and Hedayat, Christian and Kuhn, Harald and Hilleringmann, Ulrich}, year={2021} }","mla":"Lange, Sven, et al. “Adaptation and Optimization of Planar Coils for a More Accurate and Far-Reaching Magnetic Field-Based Localization in the Near Field.” <i>2021 Smart Systems Integration (SSI)</i>, IEEE, 2021, doi:<a href=\"https://doi.org/10.1109/ssi52265.2021.9466958\">10.1109/ssi52265.2021.9466958</a>.","short":"S. Lange, C. Hedayat, H. Kuhn, U. Hilleringmann, in: 2021 Smart Systems Integration (SSI), IEEE, Grenoble, France, 2021."},"main_file_link":[{"url":"https://ieeexplore.ieee.org/document/9466958"}],"keyword":["Electrotechnical Characteristics of Real Coils","Inductive Localization","Resonant Circuit","Mutual Inductance","Near-Field"],"publication_status":"published","user_id":"38240"},{"author":[{"last_name":"Weidmann","id":"53103","first_name":"Nils","full_name":"Weidmann, Nils"},{"first_name":"Shubhangi","full_name":"Salunkhe, Shubhangi","last_name":"Salunkhe"},{"full_name":"Anjorin, Anthony","first_name":"Anthony","last_name":"Anjorin"},{"orcid":"0000-0002-5967-833X","first_name":"Enes","full_name":"Yigitbas, Enes","id":"8447","last_name":"Yigitbas"},{"first_name":"Gregor","full_name":"Engels, Gregor","last_name":"Engels","id":"107"}],"title":"Automating Model Transformations for Railway Systems Engineering.","doi":"10.5381/jot.2021.20.3.a10","user_id":"8447","publication_status":"published","citation":{"ama":"Weidmann N, Salunkhe S, Anjorin A, Yigitbas E, Engels G. Automating Model Transformations for Railway Systems Engineering. <i>The Journal of Object Technology</i>. 2021. doi:<a href=\"https://doi.org/10.5381/jot.2021.20.3.a10\">10.5381/jot.2021.20.3.a10</a>","apa":"Weidmann, N., Salunkhe, S., Anjorin, A., Yigitbas, E., &#38; Engels, G. (2021). Automating Model Transformations for Railway Systems Engineering. <i>The Journal of Object Technology</i>. <a href=\"https://doi.org/10.5381/jot.2021.20.3.a10\">https://doi.org/10.5381/jot.2021.20.3.a10</a>","chicago":"Weidmann, Nils, Shubhangi Salunkhe, Anthony Anjorin, Enes Yigitbas, and Gregor Engels. “Automating Model Transformations for Railway Systems Engineering.” <i>The Journal of Object Technology</i>, 2021. <a href=\"https://doi.org/10.5381/jot.2021.20.3.a10\">https://doi.org/10.5381/jot.2021.20.3.a10</a>.","ieee":"N. Weidmann, S. Salunkhe, A. Anjorin, E. Yigitbas, and G. Engels, “Automating Model Transformations for Railway Systems Engineering.,” <i>The Journal of Object Technology</i>, 2021.","mla":"Weidmann, Nils, et al. “Automating Model Transformations for Railway Systems Engineering.” <i>The Journal of Object Technology</i>, 10:1, 2021, doi:<a href=\"https://doi.org/10.5381/jot.2021.20.3.a10\">10.5381/jot.2021.20.3.a10</a>.","bibtex":"@article{Weidmann_Salunkhe_Anjorin_Yigitbas_Engels_2021, title={Automating Model Transformations for Railway Systems Engineering.}, DOI={<a href=\"https://doi.org/10.5381/jot.2021.20.3.a10\">10.5381/jot.2021.20.3.a10</a>}, number={10:1}, journal={The Journal of Object Technology}, author={Weidmann, Nils and Salunkhe, Shubhangi and Anjorin, Anthony and Yigitbas, Enes and Engels, Gregor}, year={2021} }","short":"N. Weidmann, S. Salunkhe, A. Anjorin, E. Yigitbas, G. Engels, The Journal of Object Technology (2021)."},"department":[{"_id":"66"},{"_id":"534"}],"publication":"The Journal of Object Technology","date_created":"2021-07-26T13:54:55Z","status":"public","publication_identifier":{"issn":["1660-1769"]},"type":"journal_article","year":"2021","language":[{"iso":"eng"}],"_id":"22814","date_updated":"2022-01-06T06:55:42Z","article_number":"10:1"},{"doi":"10.1109/seams51251.2021.00015","title":"Enhancing Human-in-the-Loop Adaptive Systems through Digital Twins and VR Interfaces","author":[{"first_name":"Enes","full_name":"Yigitbas, Enes","id":"8447","last_name":"Yigitbas","orcid":"0000-0002-5967-833X"},{"orcid":"https://orcid.org/0000-0001-9266-2084","first_name":"Kadiray","full_name":"Karakaya, Kadiray","id":"70410","last_name":"Karakaya"},{"full_name":"Jovanovikj, Ivan","first_name":"Ivan","last_name":"Jovanovikj"},{"id":"107","last_name":"Engels","first_name":"Gregor","full_name":"Engels, Gregor"}],"department":[{"_id":"66"},{"_id":"534"}],"citation":{"bibtex":"@inproceedings{Yigitbas_Karakaya_Jovanovikj_Engels_2021, title={Enhancing Human-in-the-Loop Adaptive Systems through Digital Twins and VR Interfaces}, DOI={<a href=\"https://doi.org/10.1109/seams51251.2021.00015\">10.1109/seams51251.2021.00015</a>}, booktitle={2021 International Symposium on Software Engineering for Adaptive and Self-Managing Systems (SEAMS)}, author={Yigitbas, Enes and Karakaya, Kadiray and Jovanovikj, Ivan and Engels, Gregor}, year={2021} }","mla":"Yigitbas, Enes, et al. “Enhancing Human-in-the-Loop Adaptive Systems through Digital Twins and VR Interfaces.” <i>2021 International Symposium on Software Engineering for Adaptive and Self-Managing Systems (SEAMS)</i>, 2021, doi:<a href=\"https://doi.org/10.1109/seams51251.2021.00015\">10.1109/seams51251.2021.00015</a>.","short":"E. Yigitbas, K. Karakaya, I. Jovanovikj, G. Engels, in: 2021 International Symposium on Software Engineering for Adaptive and Self-Managing Systems (SEAMS), 2021.","ama":"Yigitbas E, Karakaya K, Jovanovikj I, Engels G. Enhancing Human-in-the-Loop Adaptive Systems through Digital Twins and VR Interfaces. In: <i>2021 International Symposium on Software Engineering for Adaptive and Self-Managing Systems (SEAMS)</i>. ; 2021. doi:<a href=\"https://doi.org/10.1109/seams51251.2021.00015\">10.1109/seams51251.2021.00015</a>","apa":"Yigitbas, E., Karakaya, K., Jovanovikj, I., &#38; Engels, G. (2021). Enhancing Human-in-the-Loop Adaptive Systems through Digital Twins and VR Interfaces. In <i>2021 International Symposium on Software Engineering for Adaptive and Self-Managing Systems (SEAMS)</i>. <a href=\"https://doi.org/10.1109/seams51251.2021.00015\">https://doi.org/10.1109/seams51251.2021.00015</a>","ieee":"E. Yigitbas, K. Karakaya, I. Jovanovikj, and G. Engels, “Enhancing Human-in-the-Loop Adaptive Systems through Digital Twins and VR Interfaces,” in <i>2021 International Symposium on Software Engineering for Adaptive and Self-Managing Systems (SEAMS)</i>, 2021.","chicago":"Yigitbas, Enes, Kadiray Karakaya, Ivan Jovanovikj, and Gregor Engels. “Enhancing Human-in-the-Loop Adaptive Systems through Digital Twins and VR Interfaces.” In <i>2021 International Symposium on Software Engineering for Adaptive and Self-Managing Systems (SEAMS)</i>, 2021. <a href=\"https://doi.org/10.1109/seams51251.2021.00015\">https://doi.org/10.1109/seams51251.2021.00015</a>."},"user_id":"8447","publication_status":"published","type":"conference","year":"2021","language":[{"iso":"eng"}],"status":"public","publication":"2021 International Symposium on Software Engineering for Adaptive and Self-Managing Systems (SEAMS)","date_created":"2021-07-27T08:34:48Z","date_updated":"2022-01-06T06:55:42Z","_id":"22819"},{"citation":{"chicago":"Hüllermeier, Eyke, Felix Mohr, Alexander Tornede, and Marcel Dominik Wever. “Automated Machine Learning, Bounded Rationality, and Rational Metareasoning,” 2021.","ieee":"E. Hüllermeier, F. Mohr, A. Tornede, and M. D. Wever, “Automated Machine Learning, Bounded Rationality, and Rational Metareasoning,” presented at the ECML/PKDD Workshop on Automating Data Science, Bilbao (Virtual), 2021.","ama":"Hüllermeier E, Mohr F, Tornede A, Wever MD. Automated Machine Learning, Bounded Rationality, and Rational Metareasoning. In: ; 2021.","apa":"Hüllermeier, E., Mohr, F., Tornede, A., &#38; Wever, M. D. (2021). <i>Automated Machine Learning, Bounded Rationality, and Rational Metareasoning</i>. ECML/PKDD Workshop on Automating Data Science, Bilbao (Virtual).","short":"E. Hüllermeier, F. Mohr, A. Tornede, M.D. Wever, in: 2021.","mla":"Hüllermeier, Eyke, et al. <i>Automated Machine Learning, Bounded Rationality, and Rational Metareasoning</i>. 2021.","bibtex":"@inproceedings{Hüllermeier_Mohr_Tornede_Wever_2021, title={Automated Machine Learning, Bounded Rationality, and Rational Metareasoning}, author={Hüllermeier, Eyke and Mohr, Felix and Tornede, Alexander and Wever, Marcel Dominik}, year={2021} }"},"user_id":"5786","department":[{"_id":"34"},{"_id":"355"},{"_id":"26"}],"conference":{"name":"ECML/PKDD Workshop on Automating Data Science","location":"Bilbao (Virtual)","start_date":"2021-09-13","end_date":"2021-09-17"},"title":"Automated Machine Learning, Bounded Rationality, and Rational Metareasoning","author":[{"last_name":"Hüllermeier","id":"48129","first_name":"Eyke","full_name":"Hüllermeier, Eyke"},{"first_name":"Felix","full_name":"Mohr, Felix","last_name":"Mohr"},{"last_name":"Tornede","id":"38209","full_name":"Tornede, Alexander","first_name":"Alexander"},{"last_name":"Wever","id":"33176","first_name":"Marcel Dominik","full_name":"Wever, Marcel Dominik","orcid":" https://orcid.org/0000-0001-9782-6818"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area B","_id":"3"},{"_id":"10","name":"SFB 901 - Subproject B2"}],"_id":"22913","date_updated":"2022-01-06T06:55:43Z","quality_controlled":"1","date_created":"2021-08-02T07:46:29Z","type":"conference","year":"2021","language":[{"iso":"eng"}],"status":"public"},{"user_id":"5786","citation":{"short":"F. Mohr, M.D. Wever, in: 2021.","mla":"Mohr, Felix, and Marcel Dominik Wever. <i>Replacing the Ex-Def Baseline in AutoML by Naive AutoML</i>. 2021.","bibtex":"@inproceedings{Mohr_Wever_2021, title={Replacing the Ex-Def Baseline in AutoML by Naive AutoML}, author={Mohr, Felix and Wever, Marcel Dominik}, year={2021} }","chicago":"Mohr, Felix, and Marcel Dominik Wever. “Replacing the Ex-Def Baseline in AutoML by Naive AutoML,” 2021.","ieee":"F. Mohr and M. D. Wever, “Replacing the Ex-Def Baseline in AutoML by Naive AutoML,” presented at the 8th ICML Workshop on Automated Machine Learning, Virtual, 2021.","apa":"Mohr, F., &#38; Wever, M. D. (2021). <i>Replacing the Ex-Def Baseline in AutoML by Naive AutoML</i>. 8th ICML Workshop on Automated Machine Learning, Virtual.","ama":"Mohr F, Wever MD. Replacing the Ex-Def Baseline in AutoML by Naive AutoML. In: ; 2021."},"department":[{"_id":"34"},{"_id":"355"},{"_id":"26"}],"author":[{"full_name":"Mohr, Felix","first_name":"Felix","last_name":"Mohr"},{"full_name":"Wever, Marcel Dominik","first_name":"Marcel Dominik","last_name":"Wever","id":"33176","orcid":" https://orcid.org/0000-0001-9782-6818"}],"conference":{"end_date":"2021-07-23","location":"Virtual","start_date":"2021-07-23","name":"8th ICML Workshop on Automated Machine Learning"},"title":"Replacing the Ex-Def Baseline in AutoML by Naive AutoML","_id":"22914","date_updated":"2022-01-06T06:55:43Z","date_created":"2021-08-02T07:48:07Z","status":"public","year":"2021","type":"conference","language":[{"iso":"eng"}]},{"title":"On Strong Observational Refinement and Forward Simulation","author":[{"last_name":"Derrick","full_name":"Derrick, John","first_name":"John"},{"first_name":"Simon","full_name":"Doherty, Simon","last_name":"Doherty"},{"full_name":"Dongol, Brijesh","first_name":"Brijesh","last_name":"Dongol"},{"last_name":"Schellhorn","full_name":"Schellhorn, Gerhard","first_name":"Gerhard"},{"full_name":"Wehrheim, Heike","first_name":"Heike","last_name":"Wehrheim","id":"573"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area B","_id":"3"},{"_id":"12","name":"SFB 901 - Subproject B4"}],"citation":{"mla":"Derrick, John, et al. “On Strong Observational Refinement and Forward Simulation.” <i>Proceedings of the 35th International Symposium on Distributed Computing (DISC)</i>, Schloß Dagstuhl.","bibtex":"@inproceedings{Derrick_Doherty_Dongol_Schellhorn_Wehrheim, series={Leibniz International Proceedings in Informatics}, title={On Strong Observational Refinement and Forward Simulation}, booktitle={Proceedings of the 35th International Symposium on Distributed Computing (DISC)}, publisher={Schloß Dagstuhl}, author={Derrick, John and Doherty, Simon and Dongol, Brijesh and Schellhorn, Gerhard and Wehrheim, Heike}, collection={Leibniz International Proceedings in Informatics} }","short":"J. Derrick, S. Doherty, B. Dongol, G. Schellhorn, H. Wehrheim, in: Proceedings of the 35th International Symposium on Distributed Computing (DISC), Schloß Dagstuhl, n.d.","apa":"Derrick, J., Doherty, S., Dongol, B., Schellhorn, G., &#38; Wehrheim, H. (n.d.). On Strong Observational Refinement and Forward Simulation. In <i>Proceedings of the 35th International Symposium on Distributed Computing (DISC)</i>. Schloß Dagstuhl.","ama":"Derrick J, Doherty S, Dongol B, Schellhorn G, Wehrheim H. On Strong Observational Refinement and Forward Simulation. In: <i>Proceedings of the 35th International Symposium on Distributed Computing (DISC)</i>. Leibniz International Proceedings in Informatics. Schloß Dagstuhl.","chicago":"Derrick, John, Simon Doherty, Brijesh Dongol, Gerhard Schellhorn, and Heike Wehrheim. “On Strong Observational Refinement and Forward Simulation.” In <i>Proceedings of the 35th International Symposium on Distributed Computing (DISC)</i>. Leibniz International Proceedings in Informatics. Schloß Dagstuhl, n.d.","ieee":"J. Derrick, S. Doherty, B. Dongol, G. Schellhorn, and H. Wehrheim, “On Strong Observational Refinement and Forward Simulation,” in <i>Proceedings of the 35th International Symposium on Distributed Computing (DISC)</i>."},"series_title":"Leibniz International Proceedings in Informatics","publication_status":"accepted","user_id":"477","department":[{"_id":"7"}],"date_created":"2021-08-03T07:38:56Z","publication":"Proceedings of the 35th International Symposium on Distributed Computing (DISC)","publisher":"Schloß Dagstuhl","language":[{"iso":"eng"}],"type":"conference","year":"2021","status":"public","_id":"22927","date_updated":"2022-01-06T06:55:43Z"},{"doi":"10.1145/3449639.3459283","author":[{"id":"53103","last_name":"Weidmann","full_name":"Weidmann, Nils","first_name":"Nils"},{"first_name":"Gregor","full_name":"Engels, Gregor","id":"107","last_name":"Engels"}],"conference":{"end_date":"2021-07-14","name":"GECCO '21: Genetic and Evolutionary Computation Conference","location":"Lille, France","start_date":"2021-07-10"},"title":"Concurrent model synchronisation with multiple objectives","department":[{"_id":"28"},{"_id":"66"}],"user_id":"53103","publication_status":"published","citation":{"short":"N. Weidmann, G. Engels, in: Proceedings of the Genetic and Evolutionary Computation Conference, 2021.","bibtex":"@inproceedings{Weidmann_Engels_2021, title={Concurrent model synchronisation with multiple objectives}, DOI={<a href=\"https://doi.org/10.1145/3449639.3459283\">10.1145/3449639.3459283</a>}, booktitle={Proceedings of the Genetic and Evolutionary Computation Conference}, author={Weidmann, Nils and Engels, Gregor}, year={2021} }","mla":"Weidmann, Nils, and Gregor Engels. “Concurrent Model Synchronisation with Multiple Objectives.” <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 2021, doi:<a href=\"https://doi.org/10.1145/3449639.3459283\">10.1145/3449639.3459283</a>.","ieee":"N. Weidmann and G. Engels, “Concurrent model synchronisation with multiple objectives,” in <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, Lille, France, 2021.","chicago":"Weidmann, Nils, and Gregor Engels. “Concurrent Model Synchronisation with Multiple Objectives.” In <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 2021. <a href=\"https://doi.org/10.1145/3449639.3459283\">https://doi.org/10.1145/3449639.3459283</a>.","apa":"Weidmann, N., &#38; Engels, G. (2021). Concurrent model synchronisation with multiple objectives. In <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>. Lille, France. <a href=\"https://doi.org/10.1145/3449639.3459283\">https://doi.org/10.1145/3449639.3459283</a>","ama":"Weidmann N, Engels G. Concurrent model synchronisation with multiple objectives. In: <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>. ; 2021. doi:<a href=\"https://doi.org/10.1145/3449639.3459283\">10.1145/3449639.3459283</a>"},"status":"public","type":"conference","year":"2021","language":[{"iso":"eng"}],"publication":"Proceedings of the Genetic and Evolutionary Computation Conference","date_created":"2021-08-07T15:18:48Z","date_updated":"2022-01-06T06:55:44Z","_id":"22959"},{"department":[{"_id":"241"},{"_id":"662"},{"_id":"76"}],"publication_status":"published","user_id":"5786","citation":{"chicago":"Kummita, Sriteja, Goran Piskachev, Johannes Spath, and Eric Bodden. “Qualitative and Quantitative Analysis of Callgraph Algorithms for Python.” In <i>2021 International Conference on Code Quality (ICCQ)</i>, 2021. <a href=\"https://doi.org/10.1109/iccq51190.2021.9392986\">https://doi.org/10.1109/iccq51190.2021.9392986</a>.","ieee":"S. Kummita, G. Piskachev, J. Spath, and E. Bodden, “Qualitative and Quantitative Analysis of Callgraph Algorithms for Python,” 2021, doi: <a href=\"https://doi.org/10.1109/iccq51190.2021.9392986\">10.1109/iccq51190.2021.9392986</a>.","apa":"Kummita, S., Piskachev, G., Spath, J., &#38; Bodden, E. (2021). Qualitative and Quantitative Analysis of Callgraph Algorithms for Python. <i>2021 International Conference on Code Quality (ICCQ)</i>. <a href=\"https://doi.org/10.1109/iccq51190.2021.9392986\">https://doi.org/10.1109/iccq51190.2021.9392986</a>","ama":"Kummita S, Piskachev G, Spath J, Bodden E. Qualitative and Quantitative Analysis of Callgraph Algorithms for Python. In: <i>2021 International Conference on Code Quality (ICCQ)</i>. ; 2021. doi:<a href=\"https://doi.org/10.1109/iccq51190.2021.9392986\">10.1109/iccq51190.2021.9392986</a>","short":"S. Kummita, G. Piskachev, J. Spath, E. Bodden, in: 2021 International Conference on Code Quality (ICCQ), 2021.","mla":"Kummita, Sriteja, et al. “Qualitative and Quantitative Analysis of Callgraph Algorithms for Python.” <i>2021 International Conference on Code Quality (ICCQ)</i>, 2021, doi:<a href=\"https://doi.org/10.1109/iccq51190.2021.9392986\">10.1109/iccq51190.2021.9392986</a>.","bibtex":"@inproceedings{Kummita_Piskachev_Spath_Bodden_2021, title={Qualitative and Quantitative Analysis of Callgraph Algorithms for Python}, DOI={<a href=\"https://doi.org/10.1109/iccq51190.2021.9392986\">10.1109/iccq51190.2021.9392986</a>}, booktitle={2021 International Conference on Code Quality (ICCQ)}, author={Kummita, Sriteja and Piskachev, Goran and Spath, Johannes and Bodden, Eric}, year={2021} }"},"doi":"10.1109/iccq51190.2021.9392986","author":[{"first_name":"Sriteja","full_name":"Kummita, Sriteja","last_name":"Kummita"},{"last_name":"Piskachev","full_name":"Piskachev, Goran","first_name":"Goran"},{"last_name":"Spath","full_name":"Spath, Johannes","first_name":"Johannes"},{"first_name":"Eric","full_name":"Bodden, Eric","last_name":"Bodden"}],"title":"Qualitative and Quantitative Analysis of Callgraph Algorithms for Python","date_updated":"2022-01-06T06:55:50Z","_id":"23374","status":"public","language":[{"iso":"eng"}],"type":"conference","year":"2021","date_created":"2021-08-09T12:01:11Z","publication":"2021 International Conference on Code Quality (ICCQ)"},{"department":[{"_id":"66"},{"_id":"534"},{"_id":"276"}],"publication_status":"accepted","keyword":["Platform Ecosystems","Platform Ecosystem Modeling Language","Platform Ecosystem Development Tool","Business Models","Design Science"],"user_id":"47208","citation":{"apa":"Vorbohle, C., &#38; Gottschalk, S. (n.d.). Towards Visualizing and Simulating Business Models in Dynamic Platform Ecosystems . In <i>Proceedings of the 29th European Conference on Information Systems (ECIS)</i>. Virtual Conference/Workshop: AIS.","ama":"Vorbohle C, Gottschalk S. Towards Visualizing and Simulating Business Models in Dynamic Platform Ecosystems . In: <i>Proceedings of the 29th European Conference on Information Systems (ECIS)</i>. AIS.","ieee":"C. Vorbohle and S. Gottschalk, “Towards Visualizing and Simulating Business Models in Dynamic Platform Ecosystems ,” in <i>Proceedings of the 29th European Conference on Information Systems (ECIS)</i>, Virtual Conference/Workshop.","chicago":"Vorbohle, Christian, and Sebastian Gottschalk. “Towards Visualizing and Simulating Business Models in Dynamic Platform Ecosystems .” In <i>Proceedings of the 29th European Conference on Information Systems (ECIS)</i>. AIS, n.d.","bibtex":"@inproceedings{Vorbohle_Gottschalk, title={Towards Visualizing and Simulating Business Models in Dynamic Platform Ecosystems }, booktitle={Proceedings of the 29th European Conference on Information Systems (ECIS)}, publisher={AIS}, author={Vorbohle, Christian and Gottschalk, Sebastian} }","mla":"Vorbohle, Christian, and Sebastian Gottschalk. “Towards Visualizing and Simulating Business Models in Dynamic Platform Ecosystems .” <i>Proceedings of the 29th European Conference on Information Systems (ECIS)</i>, AIS.","short":"C. Vorbohle, S. Gottschalk, in: Proceedings of the 29th European Conference on Information Systems (ECIS), AIS, n.d."},"abstract":[{"text":"Platform-based business models underlie the success of many of today’s largest, fastest-growing, and most disruptive companies. Despite the success of prominent examples, such as Uber and Airbnb, creating a profitable platform ecosystem presents a key challenge for many companies across all industries. Although research provides knowledge about platforms’ different value drivers (e.g., network effects), companies that seek to transform their current business model into a platform-based one lack an artifact to reduce knowledge boundaries, collaborate effectively, and cope with the complexities and dynamics of platform ecosystems. We address this challenge by developing two artifacts and combining research from variability modeling, business model dependencies, and system dynamics. This paper presents a design science research approach to develop the platform ecosystem modeling language and the platform ecosystem development tool that support researcher and practitioner by visualizing and simulating platform ecosystems. ","lang":"eng"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject C5","_id":"17"}],"author":[{"full_name":"Vorbohle, Christian","first_name":"Christian","last_name":"Vorbohle","id":"29951"},{"full_name":"Gottschalk, Sebastian","first_name":"Sebastian","last_name":"Gottschalk","id":"47208"}],"title":"Towards Visualizing and Simulating Business Models in Dynamic Platform Ecosystems ","conference":{"location":"Virtual Conference/Workshop","name":"29th European Conference on Information Systems (ECIS)"},"date_updated":"2022-01-06T06:55:12Z","_id":"21727","status":"public","language":[{"iso":"eng"}],"year":"2021","type":"conference","publisher":"AIS","date_created":"2021-04-23T13:38:54Z","publication":"Proceedings of the 29th European Conference on Information Systems (ECIS)"},{"file":[{"file_size":4172270,"file_name":"ris-accepted-version.pdf","creator":"stschn","description":"Author version of the accepted paper","date_created":"2021-04-27T08:01:26Z","content_type":"application/pdf","access_level":"open_access","file_id":"21809","date_updated":"2021-04-27T08:01:26Z","relation":"main_file"}],"title":"Self-Learning Multi-Objective Service Coordination Using Deep Reinforcement Learning","abstract":[{"text":"Modern services consist of interconnected components,e.g., microservices in a service mesh or machine learning functions in a pipeline. These services can scale and run across multiple network nodes on demand. To process incoming traffic, service components have to be instantiated and traffic assigned to these instances, taking capacities, changing demands, and Quality of Service (QoS) requirements into account. This challenge is usually solved with custom approaches designed by experts. While this typically works well for the considered scenario, the models often rely on unrealistic assumptions or on knowledge that is not available in practice (e.g., a priori knowledge).\r\n\r\nWe propose DeepCoord, a novel deep reinforcement learning approach that learns how to best coordinate services and is geared towards realistic assumptions. It interacts with the network and relies on available, possibly delayed monitoring information. Rather than defining a complex model or an algorithm on how to achieve an objective, our model-free approach adapts to various objectives and traffic patterns. An agent is trained offline without expert knowledge and then applied online with minimal overhead. Compared to a state-of-the-art heuristic, DeepCoord significantly improves flow throughput (up to 76%) and overall network utility (more than 2x) on realworld network topologies and traffic traces. It also supports optimizing multiple, possibly competing objectives, learns to respect QoS requirements, generalizes to scenarios with unseen, stochastic traffic, and scales to large real-world networks. For reproducibility and reuse, our code is publicly available.","lang":"eng"}],"doi":"10.1109/TNSM.2021.3076503","has_accepted_license":"1","project":[{"_id":"1","name":"SFB 901"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"16","name":"SFB 901 - Subproject C4"}],"oa":"1","user_id":"35343","keyword":["network management","service management","coordination","reinforcement learning","self-learning","self-adaptation","multi-objective"],"publication":"Transactions on Network and Service Management","ddc":["000"],"type":"journal_article","author":[{"orcid":"0000-0001-8210-4011","first_name":"Stefan Balthasar","full_name":"Schneider, Stefan Balthasar","id":"35343","last_name":"Schneider"},{"last_name":"Khalili","full_name":"Khalili, Ramin","first_name":"Ramin"},{"full_name":"Manzoor, Adnan","first_name":"Adnan","last_name":"Manzoor"},{"last_name":"Qarawlus","first_name":"Haydar","full_name":"Qarawlus, Haydar"},{"first_name":"Rafael","full_name":"Schellenberg, Rafael","last_name":"Schellenberg"},{"id":"126","last_name":"Karl","first_name":"Holger","full_name":"Karl, Holger"},{"last_name":"Hecker","first_name":"Artur","full_name":"Hecker, Artur"}],"article_type":"original","citation":{"short":"S.B. Schneider, R. Khalili, A. Manzoor, H. Qarawlus, R. Schellenberg, H. Karl, A. Hecker, Transactions on Network and Service Management (2021).","bibtex":"@article{Schneider_Khalili_Manzoor_Qarawlus_Schellenberg_Karl_Hecker_2021, title={Self-Learning Multi-Objective Service Coordination Using Deep Reinforcement Learning}, DOI={<a href=\"https://doi.org/10.1109/TNSM.2021.3076503\">10.1109/TNSM.2021.3076503</a>}, journal={Transactions on Network and Service Management}, publisher={IEEE}, author={Schneider, Stefan Balthasar and Khalili, Ramin and Manzoor, Adnan and Qarawlus, Haydar and Schellenberg, Rafael and Karl, Holger and Hecker, Artur}, year={2021} }","mla":"Schneider, Stefan Balthasar, et al. “Self-Learning Multi-Objective Service Coordination Using Deep Reinforcement Learning.” <i>Transactions on Network and Service Management</i>, IEEE, 2021, doi:<a href=\"https://doi.org/10.1109/TNSM.2021.3076503\">10.1109/TNSM.2021.3076503</a>.","ieee":"S. B. Schneider <i>et al.</i>, “Self-Learning Multi-Objective Service Coordination Using Deep Reinforcement Learning,” <i>Transactions on Network and Service Management</i>, 2021.","chicago":"Schneider, Stefan Balthasar, Ramin Khalili, Adnan Manzoor, Haydar Qarawlus, Rafael Schellenberg, Holger Karl, and Artur Hecker. “Self-Learning Multi-Objective Service Coordination Using Deep Reinforcement Learning.” <i>Transactions on Network and Service Management</i>, 2021. <a href=\"https://doi.org/10.1109/TNSM.2021.3076503\">https://doi.org/10.1109/TNSM.2021.3076503</a>.","ama":"Schneider SB, Khalili R, Manzoor A, et al. Self-Learning Multi-Objective Service Coordination Using Deep Reinforcement Learning. <i>Transactions on Network and Service Management</i>. 2021. doi:<a href=\"https://doi.org/10.1109/TNSM.2021.3076503\">10.1109/TNSM.2021.3076503</a>","apa":"Schneider, S. B., Khalili, R., Manzoor, A., Qarawlus, H., Schellenberg, R., Karl, H., &#38; Hecker, A. (2021). Self-Learning Multi-Objective Service Coordination Using Deep Reinforcement Learning. <i>Transactions on Network and Service Management</i>. <a href=\"https://doi.org/10.1109/TNSM.2021.3076503\">https://doi.org/10.1109/TNSM.2021.3076503</a>"},"department":[{"_id":"75"}],"publisher":"IEEE","date_created":"2021-04-27T08:04:16Z","status":"public","year":"2021","language":[{"iso":"eng"}],"_id":"21808","file_date_updated":"2021-04-27T08:01:26Z","date_updated":"2022-01-06T06:55:15Z"},{"title":"Spectral Properties of Effective Dynamics from Conditional Expectations","author":[{"orcid":"0000-0003-2444-7889","first_name":"Feliks","full_name":"Nüske, Feliks","id":"81513","last_name":"Nüske"},{"last_name":"Koltai","first_name":"Péter","full_name":"Koltai, Péter"},{"last_name":"Boninsegna","first_name":"Lorenzo","full_name":"Boninsegna, Lorenzo"},{"last_name":"Clementi","first_name":"Cecilia","full_name":"Clementi, Cecilia"}],"abstract":[{"lang":"eng","text":"<jats:p>The reduction of high-dimensional systems to effective models on a smaller set of variables is an essential task in many areas of science. For stochastic dynamics governed by diffusion processes, a general procedure to find effective equations is the conditioning approach. In this paper, we are interested in the spectrum of the generator of the resulting effective dynamics, and how it compares to the spectrum of the full generator. We prove a new relative error bound in terms of the eigenfunction approximation error for reversible systems. We also present numerical examples indicating that, if Kramers–Moyal (KM) type approximations are used to compute the spectrum of the reduced generator, it seems largely insensitive to the time window used for the KM estimators. We analyze the implications of these observations for systems driven by underdamped Langevin dynamics, and show how meaningful effective dynamics can be defined in this setting.</jats:p>"}],"doi":"10.3390/e23020134","citation":{"ama":"Nüske F, Koltai P, Boninsegna L, Clementi C. Spectral Properties of Effective Dynamics from Conditional Expectations. <i>Entropy</i>. 2021. doi:<a href=\"https://doi.org/10.3390/e23020134\">10.3390/e23020134</a>","apa":"Nüske, F., Koltai, P., Boninsegna, L., &#38; Clementi, C. (2021). Spectral Properties of Effective Dynamics from Conditional Expectations. <i>Entropy</i>. <a href=\"https://doi.org/10.3390/e23020134\">https://doi.org/10.3390/e23020134</a>","ieee":"F. Nüske, P. Koltai, L. Boninsegna, and C. Clementi, “Spectral Properties of Effective Dynamics from Conditional Expectations,” <i>Entropy</i>, 2021.","chicago":"Nüske, Feliks, Péter Koltai, Lorenzo Boninsegna, and Cecilia Clementi. “Spectral Properties of Effective Dynamics from Conditional Expectations.” <i>Entropy</i>, 2021. <a href=\"https://doi.org/10.3390/e23020134\">https://doi.org/10.3390/e23020134</a>.","bibtex":"@article{Nüske_Koltai_Boninsegna_Clementi_2021, title={Spectral Properties of Effective Dynamics from Conditional Expectations}, DOI={<a href=\"https://doi.org/10.3390/e23020134\">10.3390/e23020134</a>}, number={134}, journal={Entropy}, author={Nüske, Feliks and Koltai, Péter and Boninsegna, Lorenzo and Clementi, Cecilia}, year={2021} }","mla":"Nüske, Feliks, et al. “Spectral Properties of Effective Dynamics from Conditional Expectations.” <i>Entropy</i>, 134, 2021, doi:<a href=\"https://doi.org/10.3390/e23020134\">10.3390/e23020134</a>.","short":"F. Nüske, P. Koltai, L. Boninsegna, C. Clementi, Entropy (2021)."},"user_id":"81513","oa":"1","main_file_link":[{"url":"https://www.mdpi.com/1099-4300/23/2/134","open_access":"1"}],"publication_status":"published","department":[{"_id":"101"}],"publication":"Entropy","date_created":"2021-04-28T18:07:56Z","type":"journal_article","publication_identifier":{"issn":["1099-4300"]},"year":"2021","language":[{"iso":"eng"}],"status":"public","_id":"21820","article_number":"134","date_updated":"2022-01-06T06:55:16Z"},{"issue":"5","volume":38,"page":"1717","type":"journal_article","ddc":["530"],"publication":"Journal of the Optical Society of America B","keyword":["tet_topic_waveguides"],"oa":"1","user_id":"158","has_accepted_license":"1","doi":"10.1364/josab.422731","abstract":[{"lang":"eng","text":"Gaussian-beam-like bundles of semi-guided waves propagating in a dielectric slab can excite modes with high-order optical angular momentum supported by a circular fiber. We consider a multimode step-index fiber with a high-index coating, where the waves in the slab are evanescently coupled to the modes of the fiber. Conditions for effective resonant interaction are identified. Based on a hybrid analytical–numerical coupled mode model, our simulations predict that substantial fractions of the input power can be focused into waves with specific orbital angular momentum, of excellent purity, with a clear distinction between degenerate modes with opposite vorticity."}],"project":[{"_id":"56","name":"TRR 142 - Project Area C"},{"name":"TRR 142","_id":"53"},{"_id":"75","name":"TRR 142 - Subproject C5"}],"file":[{"file_size":1963211,"file_name":"oamex.pdf","creator":"fossie","date_created":"2021-04-30T11:57:14Z","content_type":"application/pdf","access_level":"open_access","file_id":"21933","relation":"main_file","date_updated":"2021-04-30T11:57:14Z"},{"file_id":"21934","content_type":"application/pdf","date_created":"2021-04-30T11:59:16Z","embargo_to":"open_access","embargo":"2022-05-01","file_name":"2021-04 Hammer - JOSA B - Resonant evanescent excitation of guides waves with high-order angular momentum.pdf","relation":"main_file","date_updated":"2021-04-30T11:59:16Z","access_level":"local","creator":"fossie","file_size":7750006}],"title":"Resonant evanescent excitation of guided waves with high-order optical angular momentum","date_updated":"2022-01-06T06:55:20Z","_id":"21932","file_date_updated":"2021-04-30T11:59:16Z","status":"public","language":[{"iso":"eng"}],"year":"2021","publication_identifier":{"issn":["0740-3224","1520-8540"]},"date_created":"2021-04-30T11:54:03Z","department":[{"_id":"61"},{"_id":"230"}],"publication_status":"published","citation":{"bibtex":"@article{Hammer_Ebers_Förstner_2021, title={Resonant evanescent excitation of guided waves with high-order optical angular momentum}, volume={38}, DOI={<a href=\"https://doi.org/10.1364/josab.422731\">10.1364/josab.422731</a>}, number={5}, journal={Journal of the Optical Society of America B}, author={Hammer, Manfred and Ebers, Lena and Förstner, Jens}, year={2021}, pages={1717} }","mla":"Hammer, Manfred, et al. “Resonant Evanescent Excitation of Guided Waves with High-Order Optical Angular Momentum.” <i>Journal of the Optical Society of America B</i>, vol. 38, no. 5, 2021, p. 1717, doi:<a href=\"https://doi.org/10.1364/josab.422731\">10.1364/josab.422731</a>.","short":"M. Hammer, L. Ebers, J. Förstner, Journal of the Optical Society of America B 38 (2021) 1717.","apa":"Hammer, M., Ebers, L., &#38; Förstner, J. (2021). Resonant evanescent excitation of guided waves with high-order optical angular momentum. <i>Journal of the Optical Society of America B</i>, <i>38</i>(5), 1717. <a href=\"https://doi.org/10.1364/josab.422731\">https://doi.org/10.1364/josab.422731</a>","ama":"Hammer M, Ebers L, Förstner J. Resonant evanescent excitation of guided waves with high-order optical angular momentum. <i>Journal of the Optical Society of America B</i>. 2021;38(5):1717. doi:<a href=\"https://doi.org/10.1364/josab.422731\">10.1364/josab.422731</a>","ieee":"M. Hammer, L. Ebers, and J. Förstner, “Resonant evanescent excitation of guided waves with high-order optical angular momentum,” <i>Journal of the Optical Society of America B</i>, vol. 38, no. 5, p. 1717, 2021.","chicago":"Hammer, Manfred, Lena Ebers, and Jens Förstner. “Resonant Evanescent Excitation of Guided Waves with High-Order Optical Angular Momentum.” <i>Journal of the Optical Society of America B</i> 38, no. 5 (2021): 1717. <a href=\"https://doi.org/10.1364/josab.422731\">https://doi.org/10.1364/josab.422731</a>."},"intvolume":"        38","author":[{"last_name":"Hammer","id":"48077","first_name":"Manfred","full_name":"Hammer, Manfred","orcid":"0000-0002-6331-9348"},{"full_name":"Ebers, Lena","first_name":"Lena","last_name":"Ebers","id":"40428"},{"orcid":"0000-0001-7059-9862","full_name":"Förstner, Jens","first_name":"Jens","last_name":"Förstner","id":"158"}]},{"date_updated":"2022-01-06T06:55:22Z","_id":"22013","page":"91 - 92","language":[{"iso":"eng"}],"type":"conference","year":"2021","status":"public","date_created":"2021-05-07T07:33:54Z","department":[{"_id":"49"}],"citation":{"short":"H. Zeipert, L. Claes, S. Johannesmann, M. Webersen, Y. Lugovtsova, J. Prager, B. Henning, in: 2021, pp. 91–92.","mla":"Zeipert, Henning, et al. <i>Measurement and Simulation of Lamb Waves in Adhesive-Bonded Multilayer Systems</i>. 2021, pp. 91–92, doi:<a href=\"https://doi.org/10.5162/SMSI2021/A8.2\">10.5162/SMSI2021/A8.2</a>.","bibtex":"@inproceedings{Zeipert_Claes_Johannesmann_Webersen_Lugovtsova_Prager_Henning_2021, title={Measurement and Simulation of Lamb Waves in Adhesive-bonded Multilayer Systems}, DOI={<a href=\"https://doi.org/10.5162/SMSI2021/A8.2\">10.5162/SMSI2021/A8.2</a>}, author={Zeipert, Henning and Claes, Leander and Johannesmann, Sarah and Webersen, Manuel and Lugovtsova, Yevgeniya and Prager, Jens and Henning, Bernd}, year={2021}, pages={91–92} }","chicago":"Zeipert, Henning, Leander Claes, Sarah Johannesmann, Manuel Webersen, Yevgeniya Lugovtsova, Jens Prager, and Bernd Henning. “Measurement and Simulation of Lamb Waves in Adhesive-Bonded Multilayer Systems,” 91–92, 2021. <a href=\"https://doi.org/10.5162/SMSI2021/A8.2\">https://doi.org/10.5162/SMSI2021/A8.2</a>.","ieee":"H. Zeipert <i>et al.</i>, “Measurement and Simulation of Lamb Waves in Adhesive-bonded Multilayer Systems,” presented at the Sensor and Measurement Science International, Nürnberg, 2021, pp. 91–92.","ama":"Zeipert H, Claes L, Johannesmann S, et al. Measurement and Simulation of Lamb Waves in Adhesive-bonded Multilayer Systems. In: ; 2021:91-92. doi:<a href=\"https://doi.org/10.5162/SMSI2021/A8.2\">10.5162/SMSI2021/A8.2</a>","apa":"Zeipert, H., Claes, L., Johannesmann, S., Webersen, M., Lugovtsova, Y., Prager, J., &#38; Henning, B. (2021). Measurement and Simulation of Lamb Waves in Adhesive-bonded Multilayer Systems (pp. 91–92). Presented at the Sensor and Measurement Science International, Nürnberg. <a href=\"https://doi.org/10.5162/SMSI2021/A8.2\">https://doi.org/10.5162/SMSI2021/A8.2</a>"},"user_id":"32580","project":[{"grant_number":"449607253","name":"Vermiedene Kreuzungen von Lamb-Wellenmoden in mehrlagigen Strukturen","_id":"105"}],"doi":"10.5162/SMSI2021/A8.2","title":"Measurement and Simulation of Lamb Waves in Adhesive-bonded Multilayer Systems","conference":{"location":"Nürnberg","name":"Sensor and Measurement Science International"},"author":[{"full_name":"Zeipert, Henning","first_name":"Henning","last_name":"Zeipert","id":"32580"},{"orcid":"0000-0002-4393-268X","first_name":"Leander","full_name":"Claes, Leander","last_name":"Claes","id":"11829"},{"id":"29190","last_name":"Johannesmann","full_name":"Johannesmann, Sarah","first_name":"Sarah"},{"full_name":"Webersen, Manuel","first_name":"Manuel","last_name":"Webersen","id":"11289","orcid":"0000-0001-6411-4232"},{"last_name":"Lugovtsova","first_name":"Yevgeniya","full_name":"Lugovtsova, Yevgeniya"},{"last_name":"Prager","first_name":"Jens","full_name":"Prager, Jens"},{"id":"213","last_name":"Henning","first_name":"Bernd","full_name":"Henning, Bernd"}]},{"department":[{"_id":"558"}],"citation":{"bibtex":"@inbook{Jager_Kurek_Niehues_2021, place={Cham}, title={Efficient Adaptively-Secure IB-KEMs and VRFs via Near-Collision Resistance}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-75245-3_22\">10.1007/978-3-030-75245-3_22</a>}, booktitle={Public-Key Cryptography – PKC 2021}, author={Jager, Tibor and Kurek, Rafael and Niehues, David}, year={2021} }","mla":"Jager, Tibor, et al. “Efficient Adaptively-Secure IB-KEMs and VRFs via Near-Collision Resistance.” <i>Public-Key Cryptography – PKC 2021</i>, 2021, doi:<a href=\"https://doi.org/10.1007/978-3-030-75245-3_22\">10.1007/978-3-030-75245-3_22</a>.","short":"T. Jager, R. Kurek, D. Niehues, in: Public-Key Cryptography – PKC 2021, Cham, 2021.","ama":"Jager T, Kurek R, Niehues D. Efficient Adaptively-Secure IB-KEMs and VRFs via Near-Collision Resistance. In: <i>Public-Key Cryptography – PKC 2021</i>. Cham; 2021. doi:<a href=\"https://doi.org/10.1007/978-3-030-75245-3_22\">10.1007/978-3-030-75245-3_22</a>","apa":"Jager, T., Kurek, R., &#38; Niehues, D. (2021). Efficient Adaptively-Secure IB-KEMs and VRFs via Near-Collision Resistance. In <i>Public-Key Cryptography – PKC 2021</i>. Cham. <a href=\"https://doi.org/10.1007/978-3-030-75245-3_22\">https://doi.org/10.1007/978-3-030-75245-3_22</a>","ieee":"T. Jager, R. Kurek, and D. Niehues, “Efficient Adaptively-Secure IB-KEMs and VRFs via Near-Collision Resistance,” in <i>Public-Key Cryptography – PKC 2021</i>, Cham, 2021.","chicago":"Jager, Tibor, Rafael Kurek, and David Niehues. “Efficient Adaptively-Secure IB-KEMs and VRFs via Near-Collision Resistance.” In <i>Public-Key Cryptography – PKC 2021</i>. Cham, 2021. <a href=\"https://doi.org/10.1007/978-3-030-75245-3_22\">https://doi.org/10.1007/978-3-030-75245-3_22</a>."},"publication_status":"published","place":"Cham","author":[{"first_name":"Tibor","full_name":"Jager, Tibor","last_name":"Jager"},{"full_name":"Kurek, Rafael","first_name":"Rafael","last_name":"Kurek"},{"id":"36113","last_name":"Niehues","first_name":"David","full_name":"Niehues, David"}],"date_updated":"2022-01-06T06:55:23Z","file_date_updated":"2021-05-10T16:02:02Z","_id":"22057","year":"2021","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783030752446","9783030752453"]},"language":[{"iso":"eng"}],"status":"public","date_created":"2021-05-10T15:56:24Z","user_id":"36113","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject C1","_id":"13"}],"has_accepted_license":"1","abstract":[{"text":"We construct more efficient cryptosystems with provable\r\nsecurity against adaptive attacks, based on simple and natural hardness\r\nassumptions in the standard model. Concretely, we describe:\r\n– An adaptively-secure variant of the efficient, selectively-secure LWE-\r\nbased identity-based encryption (IBE) scheme of Agrawal, Boneh,\r\nand Boyen (EUROCRYPT 2010). In comparison to the previously\r\nmost efficient such scheme by Yamada (CRYPTO 2017) we achieve\r\nsmaller lattice parameters and shorter public keys of size O(log λ),\r\nwhere λ is the security parameter.\r\n– Adaptively-secure variants of two efficient selectively-secure pairing-\r\nbased IBEs of Boneh and Boyen (EUROCRYPT 2004). One is based\r\non the DBDH assumption, has the same ciphertext size as the cor-\r\nresponding BB04 scheme, and achieves full adaptive security with\r\npublic parameters of size only O(log λ). The other is based on a q-\r\ntype assumption and has public key size O(λ), but a ciphertext is\r\nonly a single group element and the security reduction is quadrat-\r\nically tighter than the corresponding scheme by Jager and Kurek\r\n(ASIACRYPT 2018).\r\n– A very efficient adaptively-secure verifiable random function where\r\nproofs, public keys, and secret keys have size O(log λ).\r\nAs a technical contribution we introduce blockwise partitioning, which\r\nleverages the assumption that a cryptographic hash function is weak\r\nnear-collision resistant to prove full adaptive security of cryptosystems.","lang":"eng"}],"doi":"10.1007/978-3-030-75245-3_22","title":"Efficient Adaptively-Secure IB-KEMs and VRFs via Near-Collision Resistance","file":[{"date_updated":"2021-05-10T16:02:02Z","relation":"main_file","date_created":"2021-05-10T16:02:02Z","content_type":"application/pdf","file_id":"22058","access_level":"closed","file_size":701068,"file_name":"Jager et al. - 2021 - Efficient Adaptively-Secure IB-KEMs and VRFs via N.pdf","creator":"davnie"}],"type":"book_chapter","ddc":["000"],"publication":"Public-Key Cryptography – PKC 2021"},{"title":"Verifiable Random Functions with Optimal Tightness","file":[{"access_level":"closed","content_type":"application/pdf","file_id":"22060","date_created":"2021-05-10T16:09:17Z","creator":"davnie","file_size":697361,"file_name":"Niehues - 2021 - Verifiable Random Functions with Optimal Tightness.pdf","date_updated":"2021-05-10T16:09:17Z","relation":"main_file"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Subproject C1","_id":"13"}],"has_accepted_license":"1","abstract":[{"text":"Verifiable random functions (VRFs), introduced by Micali,\r\nRabin and Vadhan (FOCS’99), are the public-key equivalent of pseudo-\r\nrandom functions. A public verification key and proofs accompanying the\r\noutput enable all parties to verify the correctness of the output. How-\r\never, all known standard model VRFs have a reduction loss that is much\r\nworse than what one would expect from known optimal constructions of\r\nclosely related primitives like unique signatures. We show that:\r\n1. Every security proof for a VRF that relies on a non-interactive\r\nassumption has to lose a factor of Q, where Q is the number of adver-\r\nsarial queries. To that end, we extend the meta-reduction technique\r\nof Bader et al. (EUROCRYPT’16) to also cover VRFs.\r\n2. This raises the question: Is this bound optimal? We answer this ques-\r\ntion in the affirmative by presenting the first VRF with a reduction\r\nfrom the non-interactive qDBDHI assumption to the security of VRF\r\nthat achieves this optimal loss.\r\nWe thus paint a complete picture of the achievability of tight verifiable\r\nrandom functions: We show that a security loss of Q is unavoidable and\r\npresent the first construction that achieves this bound.","lang":"eng"}],"doi":"10.1007/978-3-030-75248-4_3","user_id":"36113","ddc":["000"],"publication":"Public-Key Cryptography – PKC 2021","type":"book_chapter","author":[{"last_name":"Niehues","id":"36113","full_name":"Niehues, David","first_name":"David"}],"place":"Cham","citation":{"mla":"Niehues, David. “Verifiable Random Functions with Optimal Tightness.” <i>Public-Key Cryptography – PKC 2021</i>, 2021, doi:<a href=\"https://doi.org/10.1007/978-3-030-75248-4_3\">10.1007/978-3-030-75248-4_3</a>.","bibtex":"@inbook{Niehues_2021, place={Cham}, title={Verifiable Random Functions with Optimal Tightness}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-75248-4_3\">10.1007/978-3-030-75248-4_3</a>}, booktitle={Public-Key Cryptography – PKC 2021}, author={Niehues, David}, year={2021} }","short":"D. Niehues, in: Public-Key Cryptography – PKC 2021, Cham, 2021.","apa":"Niehues, D. (2021). Verifiable Random Functions with Optimal Tightness. In <i>Public-Key Cryptography – PKC 2021</i>. Cham. <a href=\"https://doi.org/10.1007/978-3-030-75248-4_3\">https://doi.org/10.1007/978-3-030-75248-4_3</a>","ama":"Niehues D. Verifiable Random Functions with Optimal Tightness. In: <i>Public-Key Cryptography – PKC 2021</i>. Cham; 2021. doi:<a href=\"https://doi.org/10.1007/978-3-030-75248-4_3\">10.1007/978-3-030-75248-4_3</a>","chicago":"Niehues, David. “Verifiable Random Functions with Optimal Tightness.” In <i>Public-Key Cryptography – PKC 2021</i>. Cham, 2021. <a href=\"https://doi.org/10.1007/978-3-030-75248-4_3\">https://doi.org/10.1007/978-3-030-75248-4_3</a>.","ieee":"D. Niehues, “Verifiable Random Functions with Optimal Tightness,” in <i>Public-Key Cryptography – PKC 2021</i>, Cham, 2021."},"publication_status":"published","department":[{"_id":"558"}],"date_created":"2021-05-10T16:07:50Z","publication_identifier":{"isbn":["9783030752477","9783030752484"],"issn":["0302-9743","1611-3349"]},"year":"2021","language":[{"iso":"eng"}],"status":"public","file_date_updated":"2021-05-10T16:09:17Z","_id":"22059","date_updated":"2022-01-06T06:55:24Z"}]