[{"department":[{"_id":"969"}],"type":"journal_article","date_created":"2025-06-25T09:17:15Z","extern":"1","abstract":[{"text":"<jats:title>Abstract</jats:title><jats:p>We present a robust and fast method for the creation of conforming quad layouts on surfaces. Our algorithm is based on the quantization of a T‐mesh, i.e. an assignment of integer lengths to the sides of a non‐conforming rectangular partition of the surface. This representation has the benefit of being able to encode an infinite number of layout connectivity options in a finite manner, which guarantees that a valid layout can always be found. We carefully construct the T‐mesh from a given seamless parametrization such that the algorithm can provide guarantees on the results' quality. In particular, the user can specify a bound on the angular deviation of layout edges from prescribed directions. We solve an integer linear program (ILP) to find a coarse quad layout adhering to that maximal deviation. Our algorithm is guaranteed to yield a conforming quad layout free of T‐junctions together with bounded angle distortion. Our results show that the presented method is fast, reliable, and achieves high quality layouts.</jats:p>","lang":"eng"}],"issue":"2","publication":"Computer Graphics Forum","doi":"10.1111/cgf.142634","language":[{"iso":"eng"}],"intvolume":"        40","publication_status":"published","date_updated":"2025-07-14T12:47:35Z","publication_identifier":{"issn":["0167-7055","1467-8659"]},"author":[{"full_name":"Lyon, Max","first_name":"Max","last_name":"Lyon"},{"full_name":"Campen, Marcel","orcid":"0000-0003-2340-3462","first_name":"Marcel","last_name":"Campen","id":"114904"},{"full_name":"Kobbelt, Leif","first_name":"Leif","last_name":"Kobbelt"}],"year":"2021","title":"Quad Layouts via Constrained T‐Mesh Quantization","citation":{"ieee":"M. Lyon, M. Campen, and L. Kobbelt, “Quad Layouts via Constrained T‐Mesh Quantization,” <i>Computer Graphics Forum</i>, vol. 40, no. 2, pp. 305–314, 2021, doi: <a href=\"https://doi.org/10.1111/cgf.142634\">10.1111/cgf.142634</a>.","apa":"Lyon, M., Campen, M., &#38; Kobbelt, L. (2021). Quad Layouts via Constrained T‐Mesh Quantization. <i>Computer Graphics Forum</i>, <i>40</i>(2), 305–314. <a href=\"https://doi.org/10.1111/cgf.142634\">https://doi.org/10.1111/cgf.142634</a>","mla":"Lyon, Max, et al. “Quad Layouts via Constrained T‐Mesh Quantization.” <i>Computer Graphics Forum</i>, vol. 40, no. 2, Wiley, 2021, pp. 305–14, doi:<a href=\"https://doi.org/10.1111/cgf.142634\">10.1111/cgf.142634</a>.","bibtex":"@article{Lyon_Campen_Kobbelt_2021, title={Quad Layouts via Constrained T‐Mesh Quantization}, volume={40}, DOI={<a href=\"https://doi.org/10.1111/cgf.142634\">10.1111/cgf.142634</a>}, number={2}, journal={Computer Graphics Forum}, publisher={Wiley}, author={Lyon, Max and Campen, Marcel and Kobbelt, Leif}, year={2021}, pages={305–314} }","chicago":"Lyon, Max, Marcel Campen, and Leif Kobbelt. “Quad Layouts via Constrained T‐Mesh Quantization.” <i>Computer Graphics Forum</i> 40, no. 2 (2021): 305–14. <a href=\"https://doi.org/10.1111/cgf.142634\">https://doi.org/10.1111/cgf.142634</a>.","short":"M. Lyon, M. Campen, L. Kobbelt, Computer Graphics Forum 40 (2021) 305–314.","ama":"Lyon M, Campen M, Kobbelt L. Quad Layouts via Constrained T‐Mesh Quantization. <i>Computer Graphics Forum</i>. 2021;40(2):305-314. doi:<a href=\"https://doi.org/10.1111/cgf.142634\">10.1111/cgf.142634</a>"},"volume":40,"user_id":"117512","publisher":"Wiley","_id":"60374","page":"305-314","status":"public"},{"citation":{"apa":"Lyon, M., Campen, M., &#38; Kobbelt, L. (2021). Simpler Quad Layouts using Relaxed Singularities. <i>Computer Graphics Forum</i>, <i>40</i>(5), 169–180. <a href=\"https://doi.org/10.1111/cgf.14365\">https://doi.org/10.1111/cgf.14365</a>","ieee":"M. Lyon, M. Campen, and L. Kobbelt, “Simpler Quad Layouts using Relaxed Singularities,” <i>Computer Graphics Forum</i>, vol. 40, no. 5, pp. 169–180, 2021, doi: <a href=\"https://doi.org/10.1111/cgf.14365\">10.1111/cgf.14365</a>.","short":"M. Lyon, M. Campen, L. Kobbelt, Computer Graphics Forum 40 (2021) 169–180.","chicago":"Lyon, Max, Marcel Campen, and Leif Kobbelt. “Simpler Quad Layouts Using Relaxed Singularities.” <i>Computer Graphics Forum</i> 40, no. 5 (2021): 169–80. <a href=\"https://doi.org/10.1111/cgf.14365\">https://doi.org/10.1111/cgf.14365</a>.","mla":"Lyon, Max, et al. “Simpler Quad Layouts Using Relaxed Singularities.” <i>Computer Graphics Forum</i>, vol. 40, no. 5, Wiley, 2021, pp. 169–80, doi:<a href=\"https://doi.org/10.1111/cgf.14365\">10.1111/cgf.14365</a>.","ama":"Lyon M, Campen M, Kobbelt L. Simpler Quad Layouts using Relaxed Singularities. <i>Computer Graphics Forum</i>. 2021;40(5):169-180. doi:<a href=\"https://doi.org/10.1111/cgf.14365\">10.1111/cgf.14365</a>","bibtex":"@article{Lyon_Campen_Kobbelt_2021, title={Simpler Quad Layouts using Relaxed Singularities}, volume={40}, DOI={<a href=\"https://doi.org/10.1111/cgf.14365\">10.1111/cgf.14365</a>}, number={5}, journal={Computer Graphics Forum}, publisher={Wiley}, author={Lyon, Max and Campen, Marcel and Kobbelt, Leif}, year={2021}, pages={169–180} }"},"user_id":"117512","volume":40,"page":"169-180","_id":"60375","publisher":"Wiley","status":"public","type":"journal_article","department":[{"_id":"969"}],"date_created":"2025-06-25T09:39:31Z","extern":"1","abstract":[{"text":"<jats:title>Abstract</jats:title><jats:p>A common approach to automatic quad layout generation on surfaces is to, in a first stage, decide on the positioning of irregular layout vertices, followed by finding sensible layout edges connecting these vertices and partitioning the surface into quadrilateral patches in a second stage. While this two‐step approach reduces the problem's complexity, this separation also limits the result quality. In the worst case, the set of layout vertices fixed in the first stage without consideration of the second may not even permit a valid quad layout. We propose an algorithm for the creation of quad layouts in which the initial layout vertices can be adjusted in the second stage. Whenever beneficial for layout quality or even validity, these vertices may be moved within a prescribed radius or even be removed. Our algorithm is based on a robust quantization strategy, turning a continuous T‐mesh structure into a discrete layout. We show the effectiveness of our algorithm on a variety of inputs.</jats:p>","lang":"eng"}],"publication":"Computer Graphics Forum","issue":"5","doi":"10.1111/cgf.14365","language":[{"iso":"eng"}],"publication_status":"published","date_updated":"2025-07-14T12:47:37Z","intvolume":"        40","year":"2021","title":"Simpler Quad Layouts using Relaxed Singularities","author":[{"full_name":"Lyon, Max","last_name":"Lyon","first_name":"Max"},{"id":"114904","orcid":"0000-0003-2340-3462","first_name":"Marcel","last_name":"Campen","full_name":"Campen, Marcel"},{"full_name":"Kobbelt, Leif","first_name":"Leif","last_name":"Kobbelt"}],"publication_identifier":{"issn":["0167-7055","1467-8659"]}},{"citation":{"ieee":"U. Qudus, M. Saleem, A.-C. Ngonga Ngomo, and Y.-K. Lee, “An Empirical Evaluation of Cost-based Federated SPARQL Query Processing Engines,” <i>Semantic Web</i>, vol. 12, no. 6, pp. 843–868, doi: <a href=\"https://doi.org/10.3233/SW-200420\">10.3233/SW-200420</a>.","apa":"Qudus, U., Saleem, M., Ngonga Ngomo, A.-C., &#38; Lee, Y.-K. (n.d.). An Empirical Evaluation of Cost-based Federated SPARQL Query Processing Engines. <i>Semantic Web</i>, <i>12</i>(6), 843–868. <a href=\"https://doi.org/10.3233/SW-200420\">https://doi.org/10.3233/SW-200420</a>","chicago":"Qudus, Umair, Muhammad Saleem, Axel-Cyrille Ngonga Ngomo, and Young-Koo Lee. “An Empirical Evaluation of Cost-Based Federated SPARQL Query Processing Engines.” <i>Semantic Web</i> 12, no. 6 (n.d.): 843–68. <a href=\"https://doi.org/10.3233/SW-200420\">https://doi.org/10.3233/SW-200420</a>.","short":"U. Qudus, M. Saleem, A.-C. Ngonga Ngomo, Y.-K. Lee, Semantic Web 12 (n.d.) 843–868.","mla":"Qudus, Umair, et al. “An Empirical Evaluation of Cost-Based Federated SPARQL Query Processing Engines.” <i>Semantic Web</i>, vol. 12, no. 6, ISO Press, pp. 843–68, doi:<a href=\"https://doi.org/10.3233/SW-200420\">10.3233/SW-200420</a>.","bibtex":"@article{Qudus_Saleem_Ngonga Ngomo_Lee, title={An Empirical Evaluation of Cost-based Federated SPARQL Query Processing Engines}, volume={12}, DOI={<a href=\"https://doi.org/10.3233/SW-200420\">10.3233/SW-200420</a>}, number={6}, journal={Semantic Web}, publisher={ISO Press}, author={Qudus, Umair and Saleem, Muhammad and Ngonga Ngomo, Axel-Cyrille and Lee, Young-Koo}, pages={843–868} }","ama":"Qudus U, Saleem M, Ngonga Ngomo A-C, Lee Y-K. An Empirical Evaluation of Cost-based Federated SPARQL Query Processing Engines. <i>Semantic Web</i>. 12(6):843-868. doi:<a href=\"https://doi.org/10.3233/SW-200420\">10.3233/SW-200420</a>"},"file_date_updated":"2024-01-13T11:35:53Z","project":[{"_id":"410","name":"KnowGraphs: KnowGraphs: Knowledge Graphs at Scale"}],"status":"public","has_accepted_license":"1","publisher":"ISO Press","_id":"25212","page":"843-868","volume":12,"user_id":"83392","ddc":["000"],"issue":"6","publication":"Semantic Web","abstract":[{"lang":"eng","text":"Finding a good query plan is key to the optimization of query runtime. This holds in particular for cost-based federation\r\nengines, which make use of cardinality estimations to achieve this goal. A number of studies compare SPARQL federation engines across different performance metrics, including query runtime, result set completeness and correctness, number of sources selected and number of requests sent. Albeit informative, these metrics are generic and unable to quantify and evaluate the accuracy of the cardinality estimators of cost-based federation engines. To thoroughly evaluate cost-based federation engines, the effect of estimated cardinality errors on the overall query runtime performance must be measured. In this paper, we address this challenge by presenting novel evaluation metrics targeted at a fine-grained benchmarking of cost-based federated SPARQL query engines. We evaluate five cost-based federated SPARQL query engines using existing as well as novel evaluation metrics by using LargeRDFBench queries. Our results provide a detailed analysis of the experimental outcomes that reveal novel insights, useful for the development of future cost-based federated SPARQL query processing engines."}],"date_created":"2021-10-01T06:52:52Z","file":[{"success":1,"content_type":"application/pdf","file_id":"50483","access_level":"closed","file_size":978478,"file_name":"swj2604.pdf","date_updated":"2024-01-13T11:35:53Z","relation":"main_file","date_created":"2024-01-13T11:35:53Z","creator":"uqudus"}],"department":[{"_id":"574"}],"keyword":["SPARQL","benchmarking","cost-based","cost-free","federated","querying"],"type":"journal_article","author":[{"id":"83392","orcid":"0000-0001-6714-8729","first_name":"Umair","last_name":"Qudus","full_name":"Qudus, Umair"},{"full_name":"Saleem, Muhammad","last_name":"Saleem","first_name":"Muhammad"},{"full_name":"Ngonga Ngomo, Axel-Cyrille","last_name":"Ngonga Ngomo","first_name":"Axel-Cyrille","id":"65716"},{"last_name":"Lee","first_name":"Young-Koo","full_name":"Lee, Young-Koo"}],"publication_identifier":{"issn":["2210-4968"]},"year":"2021","title":"An Empirical Evaluation of Cost-based Federated SPARQL Query Processing Engines","article_type":"original","intvolume":"        12","publication_status":"accepted","date_updated":"2025-09-11T09:50:14Z","language":[{"iso":"eng"}],"doi":"10.3233/SW-200420"},{"has_accepted_license":"1","status":"public","conference":{"name":"DAGA 2021 - 47. JAHRESTAGUNG FÜR AKUSTIK","start_date":"2021-08-15","location":"Wien","end_date":"2021-08-18"},"user_id":"32616","ddc":["620"],"publisher":"Deutsche Gesellschaft für Akustik e.V. (DEGA)","_id":"25265","project":[{"_id":"89","name":"Vollständige Bestimmung der akustischen Materialparameter von Polymeren"}],"citation":{"ama":"Dreiling D, Itner D, Feldmann N, Scheidemann C, Gravenkamp H, Henning B. Application and modelling of ultrasonic transducers using 1-3 piezoelectric composites with structured electrodes. In: <i>Fortschritte Der Akustik - DAGA 2021</i>. Deutsche Gesellschaft für Akustik e.V. (DEGA); 2021.","bibtex":"@inproceedings{Dreiling_Itner_Feldmann_Scheidemann_Gravenkamp_Henning_2021, place={Wien}, title={Application and modelling of ultrasonic transducers using 1-3 piezoelectric composites with structured electrodes}, booktitle={Fortschritte der Akustik - DAGA 2021}, publisher={Deutsche Gesellschaft für Akustik e.V. (DEGA)}, author={Dreiling, Dmitrij and Itner, Dominik and Feldmann, Nadine and Scheidemann, Claus and Gravenkamp, Hauke and Henning, Bernd}, year={2021} }","mla":"Dreiling, Dmitrij, et al. “Application and Modelling of Ultrasonic Transducers Using 1-3 Piezoelectric Composites with Structured Electrodes.” <i>Fortschritte Der Akustik - DAGA 2021</i>, Deutsche Gesellschaft für Akustik e.V. (DEGA), 2021.","short":"D. Dreiling, D. Itner, N. Feldmann, C. Scheidemann, H. Gravenkamp, B. Henning, in: Fortschritte Der Akustik - DAGA 2021, Deutsche Gesellschaft für Akustik e.V. (DEGA), Wien, 2021.","chicago":"Dreiling, Dmitrij, Dominik Itner, Nadine Feldmann, Claus Scheidemann, Hauke Gravenkamp, and Bernd Henning. “Application and Modelling of Ultrasonic Transducers Using 1-3 Piezoelectric Composites with Structured Electrodes.” In <i>Fortschritte Der Akustik - DAGA 2021</i>. Wien: Deutsche Gesellschaft für Akustik e.V. (DEGA), 2021.","apa":"Dreiling, D., Itner, D., Feldmann, N., Scheidemann, C., Gravenkamp, H., &#38; Henning, B. (2021). Application and modelling of ultrasonic transducers using 1-3 piezoelectric composites with structured electrodes. <i>Fortschritte Der Akustik - DAGA 2021</i>. DAGA 2021 - 47. JAHRESTAGUNG FÜR AKUSTIK, Wien.","ieee":"D. Dreiling, D. Itner, N. Feldmann, C. Scheidemann, H. Gravenkamp, and B. Henning, “Application and modelling of ultrasonic transducers using 1-3 piezoelectric composites with structured electrodes,” presented at the DAGA 2021 - 47. JAHRESTAGUNG FÜR AKUSTIK, Wien, 2021."},"oa":"1","place":"Wien","publication_status":"published","date_updated":"2026-06-02T10:53:51Z","title":"Application and modelling of ultrasonic transducers using 1-3 piezoelectric composites with structured electrodes","year":"2021","author":[{"id":"32616","last_name":"Dreiling","first_name":"Dmitrij","full_name":"Dreiling, Dmitrij"},{"first_name":"Dominik","last_name":"Itner","full_name":"Itner, Dominik"},{"id":"23082","full_name":"Feldmann, Nadine","first_name":"Nadine","last_name":"Feldmann"},{"id":"38259","first_name":"Claus","last_name":"Scheidemann","full_name":"Scheidemann, Claus"},{"first_name":"Hauke","last_name":"Gravenkamp","full_name":"Gravenkamp, Hauke"},{"id":"213","full_name":"Henning, Bernd","last_name":"Henning","first_name":"Bernd"}],"main_file_link":[{"url":"https://pub.dega-akustik.de/DAGA_2021/data/articles/000138.pdf","open_access":"1"}],"language":[{"iso":"eng"}],"abstract":[{"text":"Waveguide-based methods can be used for the non-destructive determination of acoustic material parameters. One of these methods is based on transmission measurements of cylindrical polymeric specimens. Here, the experimental setup consists of two transducers, which excite and receive the waveguide modes at the faces of the cylinder. The measurement, as well as a forward model, are used to determine material parameters of the polymeric specimen in an inverse approach.\r\n1-3 piezoelectric composites are used as an active element because they can be approximated by a thickness vibration only. This allows an easy identification of Mason model parameters to characterise the transducers’ vibration behaviour. \r\nHowever, sensitivity analysis shows a high uncertainty in the determination of the mechanical shear parameters due to the uniform excitation. To increase the sensitivity to these shear motions, arbitrary excitations were investigated by means of numerical simulation. \r\nIn order to be able to realise the determined optimal excitation, new transducer prototypes were designed. By subdividing the electrodes of the active element, for example, ring-shaped excitation is feasible. Furthermore, it can be shown that modelling these transducers with a one-dimensional Mason model is sufficient.","lang":"eng"}],"publication":"Fortschritte der Akustik - DAGA 2021","type":"conference","department":[{"_id":"49"},{"_id":"151"}],"date_created":"2021-10-04T07:54:10Z"},{"date_updated":"2022-01-06T06:57:01Z","author":[{"first_name":"Paul","last_name":"Fiterau-Brostean","full_name":"Fiterau-Brostean, Paul"},{"full_name":"Jonsson, Bengt","first_name":"Bengt","last_name":"Jonsson"},{"full_name":"Merget, Robert","last_name":"Merget","first_name":"Robert"},{"last_name":"de Ruiter","first_name":"Joeri","full_name":"de Ruiter, Joeri"},{"last_name":"Sagonas","first_name":"Konstantinos","full_name":"Sagonas, Konstantinos"},{"id":"83504","full_name":"Somorovsky, Juraj","first_name":"Juraj","orcid":"0000-0002-3593-7720","last_name":"Somorovsky"}],"publication_identifier":{"isbn":["978-1-939133-17-5"]},"year":"2020","status":"public","title":"Analysis of DTLS Implementations Using Protocol State Fuzzing","user_id":"83504","publisher":"{USENIX} Association","_id":"25334","language":[{"iso":"eng"}],"page":"2523-2540","citation":{"short":"P. Fiterau-Brostean, B. Jonsson, R. Merget, J. de Ruiter, K. Sagonas, J. Somorovsky, in: 29th {USENIX} Security Symposium ({USENIX} Security 20), {USENIX} Association, 2020, pp. 2523–2540.","chicago":"Fiterau-Brostean, Paul, Bengt Jonsson, Robert Merget, Joeri de Ruiter, Konstantinos Sagonas, and Juraj Somorovsky. “Analysis of DTLS Implementations Using Protocol State Fuzzing.” In <i>29th {USENIX} Security Symposium ({USENIX} Security 20)</i>, 2523–40. {USENIX} Association, 2020.","ieee":"P. Fiterau-Brostean, B. Jonsson, R. Merget, J. de Ruiter, K. Sagonas, and J. Somorovsky, “Analysis of DTLS Implementations Using Protocol State Fuzzing,” in <i>29th {USENIX} Security Symposium ({USENIX} Security 20)</i>, 2020, pp. 2523–2540.","apa":"Fiterau-Brostean, P., Jonsson, B., Merget, R., de Ruiter, J., Sagonas, K., &#38; Somorovsky, J. (2020). Analysis of DTLS Implementations Using Protocol State Fuzzing. <i>29th {USENIX} Security Symposium ({USENIX} Security 20)</i>, 2523–2540.","bibtex":"@inproceedings{Fiterau-Brostean_Jonsson_Merget_de Ruiter_Sagonas_Somorovsky_2020, title={Analysis of DTLS Implementations Using Protocol State Fuzzing}, booktitle={29th {USENIX} Security Symposium ({USENIX} Security 20)}, publisher={{USENIX} Association}, author={Fiterau-Brostean, Paul and Jonsson, Bengt and Merget, Robert and de Ruiter, Joeri and Sagonas, Konstantinos and Somorovsky, Juraj}, year={2020}, pages={2523–2540} }","ama":"Fiterau-Brostean P, Jonsson B, Merget R, de Ruiter J, Sagonas K, Somorovsky J. Analysis of DTLS Implementations Using Protocol State Fuzzing. In: <i>29th {USENIX} Security Symposium ({USENIX} Security 20)</i>. {USENIX} Association; 2020:2523-2540.","mla":"Fiterau-Brostean, Paul, et al. “Analysis of DTLS Implementations Using Protocol State Fuzzing.” <i>29th {USENIX} Security Symposium ({USENIX} Security 20)</i>, {USENIX} Association, 2020, pp. 2523–40."},"publication":"29th {USENIX} Security Symposium ({USENIX} Security 20)","department":[{"_id":"632"}],"type":"conference","date_created":"2021-10-04T18:56:41Z"},{"place":"Cham","date_created":"2020-09-17T10:52:41Z","department":[{"_id":"7"},{"_id":"355"}],"type":"book_chapter","citation":{"bibtex":"@inbook{Pfannschmidt_Hüllermeier_2020, place={Cham}, title={Learning Choice Functions via Pareto-Embeddings}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-58285-2_30\">10.1007/978-3-030-58285-2_30</a>}, booktitle={Lecture Notes in Computer Science}, author={Pfannschmidt, Karlson and Hüllermeier, Eyke}, year={2020} }","chicago":"Pfannschmidt, Karlson, and Eyke Hüllermeier. “Learning Choice Functions via Pareto-Embeddings.” In <i>Lecture Notes in Computer Science</i>. Cham, 2020. <a href=\"https://doi.org/10.1007/978-3-030-58285-2_30\">https://doi.org/10.1007/978-3-030-58285-2_30</a>.","short":"K. Pfannschmidt, E. Hüllermeier, in: Lecture Notes in Computer Science, Cham, 2020.","ama":"Pfannschmidt K, Hüllermeier E. Learning Choice Functions via Pareto-Embeddings. In: <i>Lecture Notes in Computer Science</i>. Cham; 2020. doi:<a href=\"https://doi.org/10.1007/978-3-030-58285-2_30\">10.1007/978-3-030-58285-2_30</a>","ieee":"K. Pfannschmidt and E. Hüllermeier, “Learning Choice Functions via Pareto-Embeddings,” in <i>Lecture Notes in Computer Science</i>, Cham, 2020.","mla":"Pfannschmidt, Karlson, and Eyke Hüllermeier. “Learning Choice Functions via Pareto-Embeddings.” <i>Lecture Notes in Computer Science</i>, 2020, doi:<a href=\"https://doi.org/10.1007/978-3-030-58285-2_30\">10.1007/978-3-030-58285-2_30</a>.","apa":"Pfannschmidt, K., &#38; Hüllermeier, E. (2020). Learning Choice Functions via Pareto-Embeddings. In <i>Lecture Notes in Computer Science</i>. Cham. <a href=\"https://doi.org/10.1007/978-3-030-58285-2_30\">https://doi.org/10.1007/978-3-030-58285-2_30</a>"},"publication":"Lecture Notes in Computer Science","project":[{"_id":"52","name":"Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"language":[{"iso":"eng"}],"_id":"19521","doi":"10.1007/978-3-030-58285-2_30","user_id":"13472","publication_identifier":{"isbn":["9783030582845","9783030582852"],"issn":["0302-9743","1611-3349"]},"author":[{"full_name":"Pfannschmidt, Karlson","first_name":"Karlson","last_name":"Pfannschmidt"},{"first_name":"Eyke","last_name":"Hüllermeier","full_name":"Hüllermeier, Eyke"}],"year":"2020","status":"public","title":"Learning Choice Functions via Pareto-Embeddings","date_updated":"2022-01-06T06:54:06Z","publication_status":"published"},{"department":[{"_id":"66"},{"_id":"534"}],"type":"conference","keyword":["Product Configuration","Augmented Reality","Model-based","Tool Support"],"date_created":"2020-09-21T17:01:11Z","file":[{"access_level":"open_access","file_size":3913885,"file_name":"HCSE20_demo.pdf","date_updated":"2020-11-30T08:39:18Z","relation":"main_file","content_type":"application/pdf","file_id":"20542","creator":"sego","date_created":"2020-11-30T08:39:18Z"}],"abstract":[{"lang":"eng","text":"Mobile shopping apps have been using Augmented Reality (AR) in the last years to place their products in the environment of the customer. While this is possible with atomic 3D objects, there is is still a lack in the runtime configuration of 3D object compositions based on user needs and environmental constraints. For this, we previously developed an approach for model-based AR-assisted product configuration based on the concept of Dynamic Software Product Lines. In this demonstration paper, we present the corresponding tool support ProConAR in the form of a Product Modeler and a Product Configurator. While the Product Modeler is an Angular web app that splits products (e.g. table) up into atomic parts (e.g. tabletop, table legs, funnier) and saves it within a configuration model, the Product Configurator is an Android client that uses the configuration model to place different product configurations within the environment of the customer. We show technical details of our ready to use tool-chain ProConAR by describing its implementation and usage as well as pointing out future research directions."}],"publication":"Human-Centered Software Engineering. HCSE 2020","doi":"10.1007/978-3-030-64266-2_14","language":[{"iso":"eng"}],"series_title":"Lecture Notes in Computer Science","intvolume":"     12481","date_updated":"2022-01-06T06:54:07Z","author":[{"full_name":"Gottschalk, Sebastian","last_name":"Gottschalk","first_name":"Sebastian","id":"47208"},{"id":"8447","full_name":"Yigitbas, Enes","first_name":"Enes","last_name":"Yigitbas","orcid":"0000-0002-5967-833X"},{"full_name":"Schmidt, Eugen","last_name":"Schmidt","first_name":"Eugen"},{"id":"107","full_name":"Engels, Gregor","last_name":"Engels","first_name":"Gregor"}],"year":"2020","title":"ProConAR: A Tool Support for Model-based AR Product Configuration","oa":"1","place":"Cham","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"17","name":"SFB 901 - Subproject C5"}],"citation":{"ieee":"S. Gottschalk, E. Yigitbas, E. Schmidt, and G. Engels, “ProConAR: A Tool Support for Model-based AR Product Configuration,” in <i>Human-Centered Software Engineering. HCSE 2020</i>, Eindhoven, 2020, vol. 12481.","mla":"Gottschalk, Sebastian, et al. “ProConAR: A Tool Support for Model-Based AR Product Configuration.” <i>Human-Centered Software Engineering. HCSE 2020</i>, edited by Regina Bernhaupt et al., vol. 12481, Springer, 2020, doi:<a href=\"https://doi.org/10.1007/978-3-030-64266-2_14\">10.1007/978-3-030-64266-2_14</a>.","apa":"Gottschalk, S., Yigitbas, E., Schmidt, E., &#38; Engels, G. (2020). ProConAR: A Tool Support for Model-based AR Product Configuration. In R. Bernhaupt, C. Ardito, &#38; S. Sauer (Eds.), <i>Human-Centered Software Engineering. HCSE 2020</i> (Vol. 12481). Cham: Springer. <a href=\"https://doi.org/10.1007/978-3-030-64266-2_14\">https://doi.org/10.1007/978-3-030-64266-2_14</a>","bibtex":"@inproceedings{Gottschalk_Yigitbas_Schmidt_Engels_2020, place={Cham}, series={Lecture Notes in Computer Science}, title={ProConAR: A Tool Support for Model-based AR Product Configuration}, volume={12481}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-64266-2_14\">10.1007/978-3-030-64266-2_14</a>}, booktitle={Human-Centered Software Engineering. HCSE 2020}, publisher={Springer}, author={Gottschalk, Sebastian and Yigitbas, Enes and Schmidt, Eugen and Engels, Gregor}, editor={Bernhaupt, Regina and Ardito, Carmelo and Sauer, StefanEditors}, year={2020}, collection={Lecture Notes in Computer Science} }","chicago":"Gottschalk, Sebastian, Enes Yigitbas, Eugen Schmidt, and Gregor Engels. “ProConAR: A Tool Support for Model-Based AR Product Configuration.” In <i>Human-Centered Software Engineering. HCSE 2020</i>, edited by Regina Bernhaupt, Carmelo Ardito, and Stefan Sauer, Vol. 12481. Lecture Notes in Computer Science. Cham: Springer, 2020. <a href=\"https://doi.org/10.1007/978-3-030-64266-2_14\">https://doi.org/10.1007/978-3-030-64266-2_14</a>.","ama":"Gottschalk S, Yigitbas E, Schmidt E, Engels G. ProConAR: A Tool Support for Model-based AR Product Configuration. In: Bernhaupt R, Ardito C, Sauer S, eds. <i>Human-Centered Software Engineering. HCSE 2020</i>. Vol 12481. Lecture Notes in Computer Science. Cham: Springer; 2020. doi:<a href=\"https://doi.org/10.1007/978-3-030-64266-2_14\">10.1007/978-3-030-64266-2_14</a>","short":"S. Gottschalk, E. Yigitbas, E. Schmidt, G. Engels, in: R. Bernhaupt, C. Ardito, S. Sauer (Eds.), Human-Centered Software Engineering. HCSE 2020, Springer, Cham, 2020."},"file_date_updated":"2020-11-30T08:39:18Z","volume":12481,"editor":[{"last_name":"Bernhaupt","first_name":"Regina","full_name":"Bernhaupt, Regina"},{"first_name":"Carmelo","last_name":"Ardito","full_name":"Ardito, Carmelo"},{"full_name":"Sauer, Stefan","first_name":"Stefan","last_name":"Sauer"}],"user_id":"47208","ddc":["000"],"publisher":"Springer","_id":"19606","has_accepted_license":"1","conference":{"end_date":"2020-12-02","start_date":"2020-11-30","name":"8th International Working Conference on Human-Centered Software Engineering (HCSE'20)","location":"Eindhoven"},"status":"public"},{"project":[{"_id":"1","name":"SFB 901"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Subproject C4","_id":"16"}],"file_date_updated":"2020-09-22T06:36:25Z","citation":{"bibtex":"@inproceedings{Schneider_Klenner_Karl_2020, title={Every Node for Itself: Fully Distributed Service Coordination}, booktitle={IEEE International Conference on Network and Service Management (CNSM)}, publisher={IEEE}, author={Schneider, Stefan Balthasar and Klenner, Lars Dietrich and Karl, Holger}, year={2020} }","ama":"Schneider SB, Klenner LD, Karl H. Every Node for Itself: Fully Distributed Service Coordination. In: <i>IEEE International Conference on Network and Service Management (CNSM)</i>. IEEE; 2020.","mla":"Schneider, Stefan Balthasar, et al. “Every Node for Itself: Fully Distributed Service Coordination.” <i>IEEE International Conference on Network and Service Management (CNSM)</i>, IEEE, 2020.","short":"S.B. Schneider, L.D. Klenner, H. Karl, in: IEEE International Conference on Network and Service Management (CNSM), IEEE, 2020.","chicago":"Schneider, Stefan Balthasar, Lars Dietrich Klenner, and Holger Karl. “Every Node for Itself: Fully Distributed Service Coordination.” In <i>IEEE International Conference on Network and Service Management (CNSM)</i>. IEEE, 2020.","ieee":"S. B. Schneider, L. D. Klenner, and H. Karl, “Every Node for Itself: Fully Distributed Service Coordination,” in <i>IEEE International Conference on Network and Service Management (CNSM)</i>, 2020.","apa":"Schneider, S. B., Klenner, L. D., &#38; Karl, H. (2020). Every Node for Itself: Fully Distributed Service Coordination. In <i>IEEE International Conference on Network and Service Management (CNSM)</i>. IEEE."},"oa":"1","has_accepted_license":"1","status":"public","user_id":"35343","ddc":["006"],"publisher":"IEEE","_id":"19607","abstract":[{"lang":"eng","text":"Modern services consist of modular, interconnected\r\ncomponents, e.g., microservices forming a service mesh. To\r\ndynamically adjust to ever-changing service demands, service\r\ncomponents have to be instantiated on nodes across the network.\r\nIncoming flows requesting a service then need to be routed\r\nthrough the deployed instances while considering node and link\r\ncapacities. Ultimately, the goal is to maximize the successfully\r\nserved flows and Quality of Service (QoS) through online service\r\ncoordination. Current approaches for service coordination are\r\nusually centralized, assuming up-to-date global knowledge and\r\nmaking global decisions for all nodes in the network. Such global\r\nknowledge and centralized decisions are not realistic in practical\r\nlarge-scale networks.\r\n\r\nTo solve this problem, we propose two algorithms for fully\r\ndistributed service coordination. The proposed algorithms can be\r\nexecuted individually at each node in parallel and require only\r\nvery limited global knowledge. We compare and evaluate both\r\nalgorithms with a state-of-the-art centralized approach in extensive\r\nsimulations on a large-scale, real-world network topology.\r\nOur results indicate that the two algorithms can compete with\r\ncentralized approaches in terms of solution quality but require\r\nless global knowledge and are magnitudes faster (more than\r\n100x)."}],"publication":"IEEE International Conference on Network and Service Management (CNSM)","keyword":["distributed management","service coordination","network coordination","nfv","softwarization","orchestration"],"type":"conference","department":[{"_id":"75"}],"file":[{"file_id":"19608","content_type":"application/pdf","file_name":"ris_with_copyright.pdf","file_size":500948,"access_level":"open_access","relation":"main_file","date_updated":"2020-09-22T06:36:25Z","date_created":"2020-09-22T06:25:57Z","creator":"stschn"}],"date_created":"2020-09-22T06:23:40Z","date_updated":"2022-01-06T06:54:08Z","title":"Every Node for Itself: Fully Distributed Service Coordination","year":"2020","author":[{"id":"35343","first_name":"Stefan Balthasar","orcid":"0000-0001-8210-4011","last_name":"Schneider","full_name":"Schneider, Stefan Balthasar"},{"first_name":"Lars Dietrich","last_name":"Klenner","full_name":"Klenner, Lars Dietrich"},{"id":"126","last_name":"Karl","first_name":"Holger","full_name":"Karl, Holger"}],"language":[{"iso":"eng"}]},{"oa":"1","file_date_updated":"2020-09-22T06:36:00Z","citation":{"mla":"Schneider, Stefan Balthasar, et al. “Self-Driving Network and Service Coordination Using Deep Reinforcement Learning.” <i>IEEE International Conference on Network and Service Management (CNSM)</i>, IEEE, 2020.","ama":"Schneider SB, Manzoor A, Qarawlus H, et al. Self-Driving Network and Service Coordination Using Deep Reinforcement Learning. In: <i>IEEE International Conference on Network and Service Management (CNSM)</i>. IEEE; 2020.","bibtex":"@inproceedings{Schneider_Manzoor_Qarawlus_Schellenberg_Karl_Khalili_Hecker_2020, title={Self-Driving Network and Service Coordination Using Deep Reinforcement Learning}, booktitle={IEEE International Conference on Network and Service Management (CNSM)}, publisher={IEEE}, author={Schneider, Stefan Balthasar and Manzoor, Adnan and Qarawlus, Haydar and Schellenberg, Rafael and Karl, Holger and Khalili, Ramin and Hecker, Artur}, year={2020} }","apa":"Schneider, S. B., Manzoor, A., Qarawlus, H., Schellenberg, R., Karl, H., Khalili, R., &#38; Hecker, A. (2020). Self-Driving Network and Service Coordination Using Deep Reinforcement Learning. In <i>IEEE International Conference on Network and Service Management (CNSM)</i>. IEEE.","ieee":"S. B. Schneider <i>et al.</i>, “Self-Driving Network and Service Coordination Using Deep Reinforcement Learning,” in <i>IEEE International Conference on Network and Service Management (CNSM)</i>, 2020.","chicago":"Schneider, Stefan Balthasar, Adnan Manzoor, Haydar Qarawlus, Rafael Schellenberg, Holger Karl, Ramin Khalili, and Artur Hecker. “Self-Driving Network and Service Coordination Using Deep Reinforcement Learning.” In <i>IEEE International Conference on Network and Service Management (CNSM)</i>. IEEE, 2020.","short":"S.B. Schneider, A. Manzoor, H. Qarawlus, R. Schellenberg, H. Karl, R. Khalili, A. Hecker, in: IEEE International Conference on Network and Service Management (CNSM), IEEE, 2020."},"project":[{"name":"SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"16","name":"SFB 901 - Subproject C4"}],"_id":"19609","publisher":"IEEE","user_id":"35343","ddc":["006"],"status":"public","has_accepted_license":"1","file":[{"creator":"stschn","date_created":"2020-09-22T06:29:16Z","relation":"main_file","date_updated":"2020-09-22T06:36:00Z","file_name":"ris_with_copyright.pdf","file_size":642999,"access_level":"open_access","file_id":"19610","content_type":"application/pdf"}],"date_created":"2020-09-22T06:28:22Z","keyword":["self-driving networks","self-learning","network coordination","service coordination","reinforcement learning","deep learning","nfv"],"type":"conference","department":[{"_id":"75"}],"publication":"IEEE International Conference on Network and Service Management (CNSM)","abstract":[{"lang":"eng","text":"Modern services comprise interconnected components,\r\ne.g., microservices in a service mesh, that can scale and\r\nrun on multiple nodes across the network on demand. To process\r\nincoming traffic, service components have to be instantiated and\r\ntraffic assigned to these instances, taking capacities and changing\r\ndemands into account. This challenge is usually solved with\r\ncustom approaches designed by experts. While this typically\r\nworks well for the considered scenario, the models often rely\r\non unrealistic assumptions or on knowledge that is not available\r\nin practice (e.g., a priori knowledge).\r\n\r\nWe propose a novel deep reinforcement learning approach that\r\nlearns how to best coordinate services and is geared towards\r\nrealistic assumptions. It interacts with the network and relies on\r\navailable, possibly delayed monitoring information. Rather than\r\ndefining a complex model or an algorithm how to achieve an\r\nobjective, our model-free approach adapts to various objectives\r\nand traffic patterns. An agent is trained offline without expert\r\nknowledge and then applied online with minimal overhead. Compared\r\nto a state-of-the-art heuristic, it significantly improves flow\r\nthroughput and overall network utility on real-world network\r\ntopologies and traffic traces. It also learns to optimize different\r\nobjectives, generalizes to scenarios with unseen, stochastic traffic\r\npatterns, and scales to large real-world networks."}],"language":[{"iso":"eng"}],"year":"2020","title":"Self-Driving Network and Service Coordination Using Deep Reinforcement Learning","author":[{"last_name":"Schneider","first_name":"Stefan Balthasar","orcid":"0000-0001-8210-4011","full_name":"Schneider, Stefan Balthasar","id":"35343"},{"full_name":"Manzoor, Adnan","last_name":"Manzoor","first_name":"Adnan"},{"last_name":"Qarawlus","first_name":"Haydar","full_name":"Qarawlus, Haydar"},{"first_name":"Rafael","last_name":"Schellenberg","full_name":"Schellenberg, Rafael"},{"full_name":"Karl, Holger","first_name":"Holger","last_name":"Karl","id":"126"},{"last_name":"Khalili","first_name":"Ramin","full_name":"Khalili, Ramin"},{"full_name":"Hecker, Artur","last_name":"Hecker","first_name":"Artur"}],"date_updated":"2022-01-06T06:54:08Z"},{"user_id":"8447","page":"216-224","_id":"19632","language":[{"iso":"eng"}],"publisher":"Springer","date_updated":"2022-01-06T06:54:09Z","year":"2020","status":"public","title":"Augmented and Virtual Reality Object Repository for Rapid Prototyping ","author":[{"id":"39187","orcid":"https://orcid.org/0000-0002-1838-794X","last_name":"Jovanovikj","first_name":"Ivan","full_name":"Jovanovikj, Ivan"},{"id":"8447","full_name":"Yigitbas, Enes","orcid":"0000-0002-5967-833X","last_name":"Yigitbas","first_name":"Enes"},{"id":"447","first_name":"Stefan","last_name":"Sauer","full_name":"Sauer, Stefan"},{"id":"107","first_name":"Gregor","last_name":"Engels","full_name":"Engels, Gregor"}],"type":"conference","department":[{"_id":"66"},{"_id":"534"}],"date_created":"2020-09-22T12:44:51Z","publication":"Proceedings of the 8th International Working Conference on Human-Centered Software Engineering (HCSE'20)","citation":{"bibtex":"@inproceedings{Jovanovikj_Yigitbas_Sauer_Engels_2020, title={Augmented and Virtual Reality Object Repository for Rapid Prototyping }, booktitle={Proceedings of the 8th International Working Conference on Human-Centered Software Engineering (HCSE’20)}, publisher={Springer}, author={Jovanovikj, Ivan and Yigitbas, Enes and Sauer, Stefan and Engels, Gregor}, year={2020}, pages={216–224} }","chicago":"Jovanovikj, Ivan, Enes Yigitbas, Stefan Sauer, and Gregor Engels. “Augmented and Virtual Reality Object Repository for Rapid Prototyping .” In <i>Proceedings of the 8th International Working Conference on Human-Centered Software Engineering (HCSE’20)</i>, 216–24. Springer, 2020.","short":"I. Jovanovikj, E. Yigitbas, S. Sauer, G. Engels, in: Proceedings of the 8th International Working Conference on Human-Centered Software Engineering (HCSE’20), Springer, 2020, pp. 216–224.","ama":"Jovanovikj I, Yigitbas E, Sauer S, Engels G. Augmented and Virtual Reality Object Repository for Rapid Prototyping . In: <i>Proceedings of the 8th International Working Conference on Human-Centered Software Engineering (HCSE’20)</i>. Springer; 2020:216-224.","ieee":"I. Jovanovikj, E. Yigitbas, S. Sauer, and G. Engels, “Augmented and Virtual Reality Object Repository for Rapid Prototyping ,” in <i>Proceedings of the 8th International Working Conference on Human-Centered Software Engineering (HCSE’20)</i>, 2020, pp. 216–224.","apa":"Jovanovikj, I., Yigitbas, E., Sauer, S., &#38; Engels, G. (2020). Augmented and Virtual Reality Object Repository for Rapid Prototyping . In <i>Proceedings of the 8th International Working Conference on Human-Centered Software Engineering (HCSE’20)</i> (pp. 216–224). Springer.","mla":"Jovanovikj, Ivan, et al. “Augmented and Virtual Reality Object Repository for Rapid Prototyping .” <i>Proceedings of the 8th International Working Conference on Human-Centered Software Engineering (HCSE’20)</i>, Springer, 2020, pp. 216–24."}},{"date_created":"2020-09-24T12:53:02Z","department":[{"_id":"7"},{"_id":"77"}],"type":"conference","citation":{"mla":"Sharma, Arnab, and Heike Wehrheim. “Automatic Fairness Testing of Machine Learning Models.” <i>Proceedings of the 32th IFIP International Conference on Testing Software and Systems (ICTSS)</i>, Springer.","ama":"Sharma A, Wehrheim H. Automatic Fairness Testing of Machine Learning Models. In: <i>Proceedings of the 32th IFIP International Conference on Testing Software and Systems (ICTSS)</i>. LNCS. Springer.","bibtex":"@inproceedings{Sharma_Wehrheim, series={LNCS}, title={Automatic Fairness Testing of Machine Learning Models}, booktitle={Proceedings of the 32th IFIP International Conference on Testing Software and Systems (ICTSS)}, publisher={Springer}, author={Sharma, Arnab and Wehrheim, Heike}, collection={LNCS} }","apa":"Sharma, A., &#38; Wehrheim, H. (n.d.). Automatic Fairness Testing of Machine Learning Models. In <i>Proceedings of the 32th IFIP International Conference on Testing Software and Systems (ICTSS)</i>. Springer.","ieee":"A. Sharma and H. Wehrheim, “Automatic Fairness Testing of Machine Learning Models,” in <i>Proceedings of the 32th IFIP International Conference on Testing Software and Systems (ICTSS)</i>.","short":"A. Sharma, H. Wehrheim, in: Proceedings of the 32th IFIP International Conference on Testing Software and Systems (ICTSS), Springer, n.d.","chicago":"Sharma, Arnab, and Heike Wehrheim. “Automatic Fairness Testing of Machine Learning Models.” In <i>Proceedings of the 32th IFIP International Conference on Testing Software and Systems (ICTSS)</i>. LNCS. Springer, n.d."},"publication":"Proceedings of the 32th IFIP International Conference on Testing Software and Systems (ICTSS)","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subproject B3","_id":"11"},{"name":"SFB 901 - Project Area B","_id":"3"}],"publisher":"Springer","_id":"19656","language":[{"iso":"eng"}],"series_title":"LNCS","user_id":"477","author":[{"full_name":"Sharma, Arnab","last_name":"Sharma","first_name":"Arnab","id":"67200"},{"first_name":"Heike","last_name":"Wehrheim","full_name":"Wehrheim, Heike","id":"573"}],"year":"2020","status":"public","title":"Automatic Fairness Testing of Machine Learning Models","publication_status":"accepted","date_updated":"2022-01-06T06:54:09Z"},{"date_created":"2020-10-02T16:19:50Z","type":"journal_article","department":[{"_id":"563"}],"publication":"Proceedings of The 11th International Multi-Conference on Complexity, Informatics and Cybernetics (IMCIC 2020)","citation":{"ieee":"M. Meyer, M. Frank, M. Massmann, and R. Dumitrescu, “Research and Consulting in Data-Driven Strategic Product Planning,” <i>Proceedings of The 11th International Multi-Conference on Complexity, Informatics and Cybernetics (IMCIC 2020)</i>, 2020.","apa":"Meyer, M., Frank, M., Massmann, M., &#38; Dumitrescu, R. (2020). Research and Consulting in Data-Driven Strategic Product Planning. <i>Proceedings of The 11th International Multi-Conference on Complexity, Informatics and Cybernetics (IMCIC 2020)</i>.","short":"M. Meyer, M. Frank, M. Massmann, R. Dumitrescu, Proceedings of The 11th International Multi-Conference on Complexity, Informatics and Cybernetics (IMCIC 2020) (2020).","chicago":"Meyer, Maurice, Maximilian Frank, Melina Massmann, and Roman Dumitrescu. “Research and Consulting in Data-Driven Strategic Product Planning.” <i>Proceedings of The 11th International Multi-Conference on Complexity, Informatics and Cybernetics (IMCIC 2020)</i>, 2020.","mla":"Meyer, Maurice, et al. “Research and Consulting in Data-Driven Strategic Product Planning.” <i>Proceedings of The 11th International Multi-Conference on Complexity, Informatics and Cybernetics (IMCIC 2020)</i>, 2020.","bibtex":"@article{Meyer_Frank_Massmann_Dumitrescu_2020, title={Research and Consulting in Data-Driven Strategic Product Planning}, journal={Proceedings of The 11th International Multi-Conference on Complexity, Informatics and Cybernetics (IMCIC 2020)}, author={Meyer, Maurice and Frank, Maximilian and Massmann, Melina and Dumitrescu, Roman}, year={2020} }","ama":"Meyer M, Frank M, Massmann M, Dumitrescu R. Research and Consulting in Data-Driven Strategic Product Planning. <i>Proceedings of The 11th International Multi-Conference on Complexity, Informatics and Cybernetics (IMCIC 2020)</i>. 2020."},"_id":"19864","language":[{"iso":"eng"}],"user_id":"77201","status":"public","year":"2020","title":"Research and Consulting in Data-Driven Strategic Product Planning","author":[{"id":"77201","first_name":"Maurice","last_name":"Meyer","orcid":"0000-0003-0606-7321","full_name":"Meyer, Maurice"},{"first_name":"Maximilian","last_name":"Frank","full_name":"Frank, Maximilian"},{"full_name":"Massmann, Melina","first_name":"Melina","last_name":"Massmann"},{"first_name":"Roman","last_name":"Dumitrescu","full_name":"Dumitrescu, Roman","id":"16190"}],"date_updated":"2022-01-06T06:54:14Z","article_type":"original"},{"issue":"2","publication":"Journal of Systemics, Cybernetics and Informatics","citation":{"chicago":"Meyer, Maurice, Maximilian Frank, Melina Massmann, and Roman Dumitrescu. “Research and Consulting in Data-Driven Strategic Product Planning.” <i>Journal of Systemics, Cybernetics and Informatics</i> 18, no. 2 (2020): 55–61.","short":"M. Meyer, M. Frank, M. Massmann, R. Dumitrescu, Journal of Systemics, Cybernetics and Informatics 18 (2020) 55–61.","apa":"Meyer, M., Frank, M., Massmann, M., &#38; Dumitrescu, R. (2020). Research and Consulting in Data-Driven Strategic Product Planning. <i>Journal of Systemics, Cybernetics and Informatics</i>, <i>18</i>(2), 55–61.","ieee":"M. Meyer, M. Frank, M. Massmann, and R. Dumitrescu, “Research and Consulting in Data-Driven Strategic Product Planning,” <i>Journal of Systemics, Cybernetics and Informatics</i>, vol. 18, no. 2, pp. 55–61, 2020.","ama":"Meyer M, Frank M, Massmann M, Dumitrescu R. Research and Consulting in Data-Driven Strategic Product Planning. <i>Journal of Systemics, Cybernetics and Informatics</i>. 2020;18(2):55-61.","bibtex":"@article{Meyer_Frank_Massmann_Dumitrescu_2020, title={Research and Consulting in Data-Driven Strategic Product Planning}, volume={18}, number={2}, journal={Journal of Systemics, Cybernetics and Informatics}, author={Meyer, Maurice and Frank, Maximilian and Massmann, Melina and Dumitrescu, Roman}, year={2020}, pages={55–61} }","mla":"Meyer, Maurice, et al. “Research and Consulting in Data-Driven Strategic Product Planning.” <i>Journal of Systemics, Cybernetics and Informatics</i>, vol. 18, no. 2, 2020, pp. 55–61."},"date_created":"2020-10-02T16:21:47Z","type":"journal_article","department":[{"_id":"563"}],"title":"Research and Consulting in Data-Driven Strategic Product Planning","year":"2020","status":"public","author":[{"last_name":"Meyer","orcid":"0000-0003-0606-7321","first_name":"Maurice","full_name":"Meyer, Maurice","id":"77201"},{"full_name":"Frank, Maximilian","first_name":"Maximilian","last_name":"Frank"},{"full_name":"Massmann, Melina","last_name":"Massmann","first_name":"Melina"},{"full_name":"Dumitrescu, Roman","first_name":"Roman","last_name":"Dumitrescu","id":"16190"}],"date_updated":"2022-01-06T06:54:14Z","intvolume":"        18","article_type":"original","page":"55-61","language":[{"iso":"eng"}],"_id":"19866","user_id":"77201","volume":18},{"publication":"Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings","abstract":[{"text":"Most existing robot formation problems seek a target formation of a certain\r\nminimal and, thus, efficient structure. Examples include the Gathering\r\nand the Chain-Formation problem. In this work, we study formation problems that\r\ntry to reach a maximal structure, supporting for example an efficient\r\ncoverage in exploration scenarios. A recent example is the NASA Shapeshifter\r\nproject, which describes how the robots form a relay chain along which gathered\r\ndata from extraterrestrial cave explorations may be sent to a home base.\r\n  As a first step towards understanding such maximization tasks, we introduce\r\nand study the Max-Chain-Formation problem, where $n$ robots are ordered along a\r\nwinding, potentially self-intersecting chain and must form a connected,\r\nstraight line of maximal length connecting its two endpoints. We propose and\r\nanalyze strategies in a discrete and in a continuous time model. In the\r\ndiscrete case, we give a complete analysis if all robots are initially\r\ncollinear, showing that the worst-case time to reach an\r\n$\\varepsilon$-approximation is upper bounded by $\\mathcal{O}(n^2 \\cdot \\log\r\n(n/\\varepsilon))$ and lower bounded by $\\Omega(n^2 \\cdot~\\log\r\n(1/\\varepsilon))$. If one endpoint of the chain remains stationary, this result\r\ncan be extended to the non-collinear case. If both endpoints move, we identify\r\na family of instances whose runtime is unbounded. For the continuous model, we\r\ngive a strategy with an optimal runtime bound of $\\Theta(n)$. Avoiding an\r\nunbounded runtime similar to the discrete case relies crucially on a\r\ncounter-intuitive aspect of the strategy: slowing down the endpoints while all\r\nother robots move at full speed. Surprisingly, we can show that a similar trick\r\ndoes not work in the discrete model.","lang":"eng"}],"date_created":"2020-10-06T07:27:10Z","department":[{"_id":"63"}],"type":"conference","author":[{"last_name":"Castenow","first_name":"Jannik","full_name":"Castenow, Jannik","id":"38705"},{"last_name":"Kling","first_name":"Peter","full_name":"Kling, Peter"},{"orcid":"0000-0003-2014-4696","last_name":"Knollmann","first_name":"Till","full_name":"Knollmann, Till","id":"39241"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"}],"publication_identifier":{"isbn":["978-3-030-64347-8"]},"title":"A Discrete and Continuous Study of the Max-Chain-Formation Problem – Slow Down to Speed Up","year":"2020","intvolume":"     12514","date_updated":"2022-01-06T06:54:14Z","publication_status":"published","language":[{"iso":"eng"}],"series_title":"Lecture Notes in Computer Science (LNCS)","doi":"10.1007/978-3-030-64348-5_6","citation":{"ieee":"J. Castenow, P. Kling, T. Knollmann, and F. Meyer auf der Heide, “A Discrete and Continuous Study of the Max-Chain-Formation Problem – Slow Down to Speed Up,” in <i>Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings</i>, 2020, vol. 12514, pp. 65–80.","apa":"Castenow, J., Kling, P., Knollmann, T., &#38; Meyer auf der Heide, F. (2020). A Discrete and Continuous Study of the Max-Chain-Formation Problem – Slow Down to Speed Up. In S. Devismes  &#38; N. Mittal (Eds.), <i>Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings</i> (Vol. 12514, pp. 65–80). Springer. <a href=\"https://doi.org/10.1007/978-3-030-64348-5_6\">https://doi.org/10.1007/978-3-030-64348-5_6</a>","chicago":"Castenow, Jannik, Peter Kling, Till Knollmann, and Friedhelm Meyer auf der Heide. “A Discrete and Continuous Study of the Max-Chain-Formation Problem – Slow Down to Speed Up.” In <i>Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings</i>, edited by Stéphane  Devismes  and Neeraj  Mittal, 12514:65–80. Lecture Notes in Computer Science (LNCS). Springer, 2020. <a href=\"https://doi.org/10.1007/978-3-030-64348-5_6\">https://doi.org/10.1007/978-3-030-64348-5_6</a>.","short":"J. Castenow, P. Kling, T. Knollmann, F. Meyer auf der Heide, in: S. Devismes , N. Mittal (Eds.), Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings, Springer, 2020, pp. 65–80.","mla":"Castenow, Jannik, et al. “A Discrete and Continuous Study of the Max-Chain-Formation Problem – Slow Down to Speed Up.” <i>Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings</i>, edited by Stéphane  Devismes  and Neeraj  Mittal, vol. 12514, Springer, 2020, pp. 65–80, doi:<a href=\"https://doi.org/10.1007/978-3-030-64348-5_6\">10.1007/978-3-030-64348-5_6</a>.","bibtex":"@inproceedings{Castenow_Kling_Knollmann_Meyer auf der Heide_2020, series={Lecture Notes in Computer Science (LNCS)}, title={A Discrete and Continuous Study of the Max-Chain-Formation Problem – Slow Down to Speed Up}, volume={12514}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-64348-5_6\">10.1007/978-3-030-64348-5_6</a>}, booktitle={Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings}, publisher={Springer}, author={Castenow, Jannik and Kling, Peter and Knollmann, Till and Meyer auf der Heide, Friedhelm}, editor={Devismes , Stéphane  and Mittal, Neeraj Editors}, year={2020}, pages={65–80}, collection={Lecture Notes in Computer Science (LNCS)} }","ama":"Castenow J, Kling P, Knollmann T, Meyer auf der Heide F. A Discrete and Continuous Study of the Max-Chain-Formation Problem – Slow Down to Speed Up. In: Devismes  S, Mittal N, eds. <i>Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings</i>. Vol 12514. Lecture Notes in Computer Science (LNCS). Springer; 2020:65-80. doi:<a href=\"https://doi.org/10.1007/978-3-030-64348-5_6\">10.1007/978-3-030-64348-5_6</a>"},"external_id":{"arxiv":["2010.02043 "]},"status":"public","publisher":"Springer","_id":"19899","page":"65-80","editor":[{"full_name":"Devismes , Stéphane ","first_name":"Stéphane ","last_name":"Devismes "},{"full_name":"Mittal, Neeraj ","last_name":"Mittal","first_name":"Neeraj "}],"volume":12514,"user_id":"38705"},{"author":[{"first_name":"Robert I","last_name":"McLachlan","full_name":"McLachlan, Robert I"},{"id":"85279","full_name":"Offen, Christian","last_name":"Offen","orcid":"https://orcid.org/0000-0002-5940-8057","first_name":"Christian"}],"title":"Preservation of Bifurcations of Hamiltonian Boundary Value Problems Under Discretisation","year":"2020","article_type":"original","intvolume":"        20","publication_status":"published","date_updated":"2022-01-06T06:54:14Z","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://rdcu.be/b79aB"}],"doi":"10.1007/s10208-020-09454-z","publication":"Foundations of Computational Mathematics","issue":"6","extern":"1","abstract":[{"lang":"eng","text":"We show that symplectic integrators preserve bifurcations of Hamiltonian boundary value problems and that nonsymplectic integrators do not. We provide a universal description of the breaking of umbilic bifurcations by nonysmplectic integrators. We discover extra structure induced from certain types of boundary value problems, including classical Dirichlet problems, that is useful to locate bifurcations. Geodesics connecting two points are an example of a Hamiltonian boundary value problem, and we introduce the jet-RATTLE method, a symplectic integrator that easily computes geodesics and their bifurcations. Finally, we study the periodic pitchfork bifurcation, a codimension-1 bifurcation arising in integrable Hamiltonian systems. It is not preserved by either symplectic on nonsymplectic integrators, but in some circumstances symplecticity greatly reduces the error. "}],"date_created":"2020-10-06T16:31:46Z","department":[{"_id":"636"}],"type":"journal_article","status":"public","_id":"19938","page":"1363-1400","volume":20,"user_id":"85279","citation":{"mla":"McLachlan, Robert I., and Christian Offen. “Preservation of Bifurcations of Hamiltonian Boundary Value Problems Under Discretisation.” <i>Foundations of Computational Mathematics</i>, vol. 20, no. 6, 2020, pp. 1363–400, doi:<a href=\"https://doi.org/10.1007/s10208-020-09454-z\">10.1007/s10208-020-09454-z</a>.","ama":"McLachlan RI, Offen C. Preservation of Bifurcations of Hamiltonian Boundary Value Problems Under Discretisation. <i>Foundations of Computational Mathematics</i>. 2020;20(6):1363-1400. doi:<a href=\"https://doi.org/10.1007/s10208-020-09454-z\">10.1007/s10208-020-09454-z</a>","bibtex":"@article{McLachlan_Offen_2020, title={Preservation of Bifurcations of Hamiltonian Boundary Value Problems Under Discretisation}, volume={20}, DOI={<a href=\"https://doi.org/10.1007/s10208-020-09454-z\">10.1007/s10208-020-09454-z</a>}, number={6}, journal={Foundations of Computational Mathematics}, author={McLachlan, Robert I and Offen, Christian}, year={2020}, pages={1363–1400} }","apa":"McLachlan, R. I., &#38; Offen, C. (2020). Preservation of Bifurcations of Hamiltonian Boundary Value Problems Under Discretisation. <i>Foundations of Computational Mathematics</i>, <i>20</i>(6), 1363–1400. <a href=\"https://doi.org/10.1007/s10208-020-09454-z\">https://doi.org/10.1007/s10208-020-09454-z</a>","ieee":"R. I. McLachlan and C. Offen, “Preservation of Bifurcations of Hamiltonian Boundary Value Problems Under Discretisation,” <i>Foundations of Computational Mathematics</i>, vol. 20, no. 6, pp. 1363–1400, 2020.","chicago":"McLachlan, Robert I, and Christian Offen. “Preservation of Bifurcations of Hamiltonian Boundary Value Problems Under Discretisation.” <i>Foundations of Computational Mathematics</i> 20, no. 6 (2020): 1363–1400. <a href=\"https://doi.org/10.1007/s10208-020-09454-z\">https://doi.org/10.1007/s10208-020-09454-z</a>.","short":"R.I. McLachlan, C. Offen, Foundations of Computational Mathematics 20 (2020) 1363–1400."}},{"citation":{"mla":"Kreusser, Lisa Maria, et al. “Detection of High Codimensional Bifurcations in Variational PDEs.” <i>Nonlinearity</i>, vol. 33, no. 5, 2020, pp. 2335–63, doi:<a href=\"https://doi.org/10.1088/1361-6544/ab7293\">10.1088/1361-6544/ab7293</a>.","ama":"Kreusser LM, McLachlan RI, Offen C. Detection of high codimensional bifurcations in variational PDEs. <i>Nonlinearity</i>. 2020;33(5):2335-2363. doi:<a href=\"https://doi.org/10.1088/1361-6544/ab7293\">10.1088/1361-6544/ab7293</a>","bibtex":"@article{Kreusser_McLachlan_Offen_2020, title={Detection of high codimensional bifurcations in variational PDEs}, volume={33}, DOI={<a href=\"https://doi.org/10.1088/1361-6544/ab7293\">10.1088/1361-6544/ab7293</a>}, number={5}, journal={Nonlinearity}, author={Kreusser, Lisa Maria and McLachlan, Robert I and Offen, Christian}, year={2020}, pages={2335–2363} }","apa":"Kreusser, L. M., McLachlan, R. I., &#38; Offen, C. (2020). Detection of high codimensional bifurcations in variational PDEs. <i>Nonlinearity</i>, <i>33</i>(5), 2335–2363. <a href=\"https://doi.org/10.1088/1361-6544/ab7293\">https://doi.org/10.1088/1361-6544/ab7293</a>","ieee":"L. M. Kreusser, R. I. McLachlan, and C. Offen, “Detection of high codimensional bifurcations in variational PDEs,” <i>Nonlinearity</i>, vol. 33, no. 5, pp. 2335–2363, 2020.","short":"L.M. Kreusser, R.I. McLachlan, C. Offen, Nonlinearity 33 (2020) 2335–2363.","chicago":"Kreusser, Lisa Maria, Robert I McLachlan, and Christian Offen. “Detection of High Codimensional Bifurcations in Variational PDEs.” <i>Nonlinearity</i> 33, no. 5 (2020): 2335–63. <a href=\"https://doi.org/10.1088/1361-6544/ab7293\">https://doi.org/10.1088/1361-6544/ab7293</a>."},"oa":"1","status":"public","page":"2335-2363","_id":"19939","user_id":"85279","volume":33,"issue":"5","publication":"Nonlinearity","extern":"1","date_created":"2020-10-06T16:32:04Z","type":"journal_article","department":[{"_id":"636"}],"year":"2020","title":"Detection of high codimensional bifurcations in variational PDEs","publication_identifier":{"issn":["0951-7715","1361-6544"]},"author":[{"last_name":"Kreusser","first_name":"Lisa Maria","full_name":"Kreusser, Lisa Maria"},{"last_name":"McLachlan","first_name":"Robert I","full_name":"McLachlan, Robert I"},{"full_name":"Offen, Christian","first_name":"Christian","orcid":"https://orcid.org/0000-0002-5940-8057","last_name":"Offen","id":"85279"}],"publication_status":"published","date_updated":"2022-01-06T06:54:14Z","article_type":"original","intvolume":"        33","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1088/1361-6544/ab7293"}],"language":[{"iso":"eng"}],"doi":"10.1088/1361-6544/ab7293"},{"file":[{"file_size":771137,"access_level":"open_access","file_name":"damke20.pdf","date_updated":"2020-10-08T11:21:00Z","relation":"main_file","content_type":"application/pdf","file_id":"19954","creator":"cdamke","date_created":"2020-10-08T10:54:48Z"},{"creator":"cdamke","date_created":"2020-10-08T10:54:59Z","relation":"supplementary_material","date_updated":"2020-10-08T11:24:29Z","file_name":"damke20-supp.pdf","access_level":"open_access","file_size":613163,"file_id":"19955","content_type":"application/pdf"}],"date_created":"2020-10-08T10:48:38Z","type":"conference","keyword":["graph neural networks","Weisfeiler-Lehman test","cycle detection"],"department":[{"_id":"355"}],"publication":"Proceedings of the 12th Asian Conference on Machine Learning (ACML 2020)","abstract":[{"lang":"eng","text":"Current GNN architectures use a vertex neighborhood aggregation scheme, which limits their discriminative power to that of the 1-dimensional Weisfeiler-Lehman (WL) graph isomorphism test. Here, we propose a novel graph convolution operator that is based on the 2-dimensional WL test. We formally show that the resulting 2-WL-GNN architecture is more discriminative than existing GNN approaches. This theoretical result is complemented by experimental studies using synthetic and real data. On multiple common graph classification benchmarks, we demonstrate that the proposed model is competitive with state-of-the-art graph kernels and GNNs."}],"language":[{"iso":"eng"}],"series_title":"Proceedings of Machine Learning Research","title":"A Novel Higher-order Weisfeiler-Lehman Graph Convolution","year":"2020","author":[{"orcid":"0000-0002-0455-0048","last_name":"Damke","first_name":"Clemens","full_name":"Damke, Clemens","id":"48192"},{"last_name":"Melnikov","first_name":"Vitaly","full_name":"Melnikov, Vitaly","id":"58747"},{"id":"48129","full_name":"Hüllermeier, Eyke","first_name":"Eyke","last_name":"Hüllermeier"}],"date_updated":"2022-01-06T06:54:17Z","publication_status":"published","intvolume":"       129","external_id":{"arxiv":["2007.00346"]},"place":"Bangkok, Thailand","oa":"1","file_date_updated":"2020-10-08T11:24:29Z","citation":{"mla":"Damke, Clemens, et al. “A Novel Higher-Order Weisfeiler-Lehman Graph Convolution.” <i>Proceedings of the 12th Asian Conference on Machine Learning (ACML 2020)</i>, edited by Sinno Jialin Pan and Masashi Sugiyama, vol. 129, PMLR, 2020, pp. 49–64.","bibtex":"@inproceedings{Damke_Melnikov_Hüllermeier_2020, place={Bangkok, Thailand}, series={Proceedings of Machine Learning Research}, title={A Novel Higher-order Weisfeiler-Lehman Graph Convolution}, volume={129}, booktitle={Proceedings of the 12th Asian Conference on Machine Learning (ACML 2020)}, publisher={PMLR}, author={Damke, Clemens and Melnikov, Vitaly and Hüllermeier, Eyke}, editor={Jialin Pan, Sinno and Sugiyama, MasashiEditors}, year={2020}, pages={49–64}, collection={Proceedings of Machine Learning Research} }","ama":"Damke C, Melnikov V, Hüllermeier E. A Novel Higher-order Weisfeiler-Lehman Graph Convolution. In: Jialin Pan S, Sugiyama M, eds. <i>Proceedings of the 12th Asian Conference on Machine Learning (ACML 2020)</i>. Vol 129. Proceedings of Machine Learning Research. Bangkok, Thailand: PMLR; 2020:49-64.","ieee":"C. Damke, V. Melnikov, and E. Hüllermeier, “A Novel Higher-order Weisfeiler-Lehman Graph Convolution,” in <i>Proceedings of the 12th Asian Conference on Machine Learning (ACML 2020)</i>, Bangkok, Thailand, 2020, vol. 129, pp. 49–64.","apa":"Damke, C., Melnikov, V., &#38; Hüllermeier, E. (2020). A Novel Higher-order Weisfeiler-Lehman Graph Convolution. In S. Jialin Pan &#38; M. Sugiyama (Eds.), <i>Proceedings of the 12th Asian Conference on Machine Learning (ACML 2020)</i> (Vol. 129, pp. 49–64). Bangkok, Thailand: PMLR.","short":"C. Damke, V. Melnikov, E. Hüllermeier, in: S. Jialin Pan, M. Sugiyama (Eds.), Proceedings of the 12th Asian Conference on Machine Learning (ACML 2020), PMLR, Bangkok, Thailand, 2020, pp. 49–64.","chicago":"Damke, Clemens, Vitaly Melnikov, and Eyke Hüllermeier. “A Novel Higher-Order Weisfeiler-Lehman Graph Convolution.” In <i>Proceedings of the 12th Asian Conference on Machine Learning (ACML 2020)</i>, edited by Sinno Jialin Pan and Masashi Sugiyama, 129:49–64. Proceedings of Machine Learning Research. Bangkok, Thailand: PMLR, 2020."},"quality_controlled":"1","page":"49-64","publisher":"PMLR","_id":"19953","ddc":["006"],"user_id":"48192","editor":[{"full_name":"Jialin Pan, Sinno","first_name":"Sinno","last_name":"Jialin Pan"},{"first_name":"Masashi","last_name":"Sugiyama","full_name":"Sugiyama, Masashi"}],"volume":129,"status":"public","conference":{"start_date":"2020-11-18","name":"Asian Conference on Machine Learning","location":"Bangkok, Thailand","end_date":"2020-11-20"},"has_accepted_license":"1"},{"publisher":"Universität Paderborn","_id":"19999","language":[{"iso":"eng"}],"user_id":"477","author":[{"full_name":"Mayer, Stefan","first_name":"Stefan","last_name":"Mayer"}],"title":"Optimierung von JMCTest beim Testen von Inter Method Contracts","status":"public","year":"2020","date_updated":"2022-01-06T06:54:18Z","date_created":"2020-10-15T05:15:46Z","department":[{"_id":"7"},{"_id":"77"}],"type":"bachelorsthesis","citation":{"ieee":"S. Mayer, <i>Optimierung von JMCTest beim Testen von Inter Method Contracts</i>. Universität Paderborn, 2020.","apa":"Mayer, S. (2020). <i>Optimierung von JMCTest beim Testen von Inter Method Contracts</i>. Universität Paderborn.","chicago":"Mayer, Stefan. <i>Optimierung von JMCTest Beim Testen von Inter Method Contracts</i>. Universität Paderborn, 2020.","short":"S. Mayer, Optimierung von JMCTest Beim Testen von Inter Method Contracts, Universität Paderborn, 2020.","mla":"Mayer, Stefan. <i>Optimierung von JMCTest Beim Testen von Inter Method Contracts</i>. Universität Paderborn, 2020.","bibtex":"@book{Mayer_2020, title={Optimierung von JMCTest beim Testen von Inter Method Contracts}, publisher={Universität Paderborn}, author={Mayer, Stefan}, year={2020} }","ama":"Mayer S. <i>Optimierung von JMCTest Beim Testen von Inter Method Contracts</i>. Universität Paderborn; 2020."},"supervisor":[{"id":"573","full_name":"Wehrheim, Heike","last_name":"Wehrheim","first_name":"Heike"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - Subproject B3","_id":"11"}]},{"file":[{"date_created":"2020-11-10T14:25:56Z","creator":"znouri","file_id":"20334","content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2020-11-10T14:25:56Z","file_name":"Mining Crowdsourcing Problems from Discussion Forums of Workers.pdf","access_level":"closed","file_size":610246}],"date_created":"2020-10-18T12:21:34Z","type":"conference","department":[{"_id":"600"}],"publication":"Proceedings of COLING 2020, the 28th International Conference on Computational Linguistics","file_date_updated":"2020-11-10T14:25:56Z","citation":{"mla":"Nouri, Zahra, et al. “Mining Crowdsourcing Problems from Discussion Forums of Workers.” <i>Proceedings of COLING 2020, the 28th International Conference on Computational Linguistics</i>, pp. 6264–76.","bibtex":"@inproceedings{Nouri_Wachsmuth_Engels, title={Mining Crowdsourcing Problems from Discussion Forums of Workers}, booktitle={Proceedings of COLING 2020, the 28th International Conference on Computational Linguistics}, author={Nouri, Zahra and Wachsmuth, Henning and Engels, Gregor}, pages={6264–6276} }","ama":"Nouri Z, Wachsmuth H, Engels G. Mining Crowdsourcing Problems from Discussion Forums of Workers. In: <i>Proceedings of COLING 2020, the 28th International Conference on Computational Linguistics</i>. ; :6264-6276.","ieee":"Z. Nouri, H. Wachsmuth, and G. Engels, “Mining Crowdsourcing Problems from Discussion Forums of Workers,” in <i>Proceedings of COLING 2020, the 28th International Conference on Computational Linguistics</i>, Barcelona, Spain, pp. 6264–6276.","apa":"Nouri, Z., Wachsmuth, H., &#38; Engels, G. (n.d.). Mining Crowdsourcing Problems from Discussion Forums of Workers. In <i>Proceedings of COLING 2020, the 28th International Conference on Computational Linguistics</i> (pp. 6264–6276). Barcelona, Spain.","chicago":"Nouri, Zahra, Henning Wachsmuth, and Gregor Engels. “Mining Crowdsourcing Problems from Discussion Forums of Workers.” In <i>Proceedings of COLING 2020, the 28th International Conference on Computational Linguistics</i>, 6264–76, n.d.","short":"Z. Nouri, H. Wachsmuth, G. Engels, in: Proceedings of COLING 2020, the 28th International Conference on Computational Linguistics, n.d., pp. 6264–6276."},"page":"6264-6276","_id":"20116","language":[{"iso":"eng"}],"ddc":["000"],"user_id":"82920","status":"public","title":"Mining Crowdsourcing Problems from Discussion Forums of Workers","year":"2020","conference":{"name":"The 28th International Conference on Computational Linguistics","start_date":"2020-12-08","location":"Barcelona, Spain","end_date":"2020-12-13"},"author":[{"id":"35802","last_name":"Nouri","first_name":"Zahra","full_name":"Nouri, Zahra"},{"id":"3900","full_name":"Wachsmuth, Henning","first_name":"Henning","last_name":"Wachsmuth"},{"last_name":"Engels","first_name":"Gregor","full_name":"Engels, Gregor","id":"107"}],"date_updated":"2022-01-06T06:54:19Z","publication_status":"accepted","has_accepted_license":"1"},{"publication":"Third Workshop on Computational Modeling of People's Opinions, Personality, and Emotions in Social Media (PEOPLES 2020)","citation":{"mla":"El Baff, Roxanne, et al. “Persuasiveness of News Editorials Depending on Ideology and Personality.” <i>Third Workshop on Computational Modeling of People’s Opinions, Personality, and Emotions in Social Media (PEOPLES 2020)</i>, 2020, pp. 29–40.","bibtex":"@inproceedings{El Baff_Al-Khatib_Stein_Wachsmuth_2020, title={Persuasiveness of News Editorials depending on Ideology and Personality}, booktitle={Third Workshop on Computational Modeling of People’s Opinions, Personality, and Emotions in Social Media (PEOPLES 2020)}, author={El Baff, Roxanne and Al-Khatib, Khalid and Stein, Benno and Wachsmuth, Henning}, year={2020}, pages={29–40} }","ama":"El Baff R, Al-Khatib K, Stein B, Wachsmuth H. Persuasiveness of News Editorials depending on Ideology and Personality. In: <i>Third Workshop on Computational Modeling of People’s Opinions, Personality, and Emotions in Social Media (PEOPLES 2020)</i>. ; 2020:29-40.","ieee":"R. El Baff, K. Al-Khatib, B. Stein, and H. Wachsmuth, “Persuasiveness of News Editorials depending on Ideology and Personality,” in <i>Third Workshop on Computational Modeling of People’s Opinions, Personality, and Emotions in Social Media (PEOPLES 2020)</i>, 2020, pp. 29–40.","apa":"El Baff, R., Al-Khatib, K., Stein, B., &#38; Wachsmuth, H. (2020). Persuasiveness of News Editorials depending on Ideology and Personality. In <i>Third Workshop on Computational Modeling of People’s Opinions, Personality, and Emotions in Social Media (PEOPLES 2020)</i> (pp. 29–40).","short":"R. El Baff, K. Al-Khatib, B. Stein, H. Wachsmuth, in: Third Workshop on Computational Modeling of People’s Opinions, Personality, and Emotions in Social Media (PEOPLES 2020), 2020, pp. 29–40.","chicago":"El Baff, Roxanne, Khalid Al-Khatib, Benno Stein, and Henning Wachsmuth. “Persuasiveness of News Editorials Depending on Ideology and Personality.” In <i>Third Workshop on Computational Modeling of People’s Opinions, Personality, and Emotions in Social Media (PEOPLES 2020)</i>, 29–40, 2020."},"type":"conference","department":[{"_id":"600"}],"date_created":"2020-10-19T08:49:05Z","date_updated":"2022-01-06T06:54:20Z","status":"public","title":"Persuasiveness of News Editorials depending on Ideology and Personality","year":"2020","author":[{"full_name":"El Baff, Roxanne","first_name":"Roxanne","last_name":"El Baff"},{"full_name":"Al-Khatib, Khalid","first_name":"Khalid","last_name":"Al-Khatib"},{"last_name":"Stein","first_name":"Benno","full_name":"Stein, Benno"},{"id":"3900","last_name":"Wachsmuth","first_name":"Henning","full_name":"Wachsmuth, Henning"}],"user_id":"82920","main_file_link":[{"url":"https://www.aclweb.org/anthology/2020.peoples-1.4.pdf"}],"page":"29-40","language":[{"iso":"eng"}],"_id":"20122"}]