[{"status":"public","type":"book_chapter","publication":"Lecture Notes in Computer Science","language":[{"iso":"eng"}],"project":[{"_id":"52","name":"Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"_id":"19521","user_id":"13472","department":[{"_id":"7"},{"_id":"355"}],"year":"2020","place":"Cham","citation":{"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>","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} }","short":"K. Pfannschmidt, E. Hüllermeier, in: Lecture Notes in Computer Science, 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>.","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>.","ieee":"K. Pfannschmidt and E. Hüllermeier, “Learning Choice Functions via Pareto-Embeddings,” in <i>Lecture Notes in Computer Science</i>, 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>"},"publication_status":"published","publication_identifier":{"isbn":["9783030582845","9783030582852"],"issn":["0302-9743","1611-3349"]},"title":"Learning Choice Functions via Pareto-Embeddings","doi":"10.1007/978-3-030-58285-2_30","date_updated":"2022-01-06T06:54:06Z","author":[{"full_name":"Pfannschmidt, Karlson","last_name":"Pfannschmidt","first_name":"Karlson"},{"first_name":"Eyke","full_name":"Hüllermeier, Eyke","last_name":"Hüllermeier"}],"date_created":"2020-09-17T10:52:41Z"},{"has_accepted_license":"1","citation":{"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>","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.","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} }","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>.","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>.","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.","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>"},"intvolume":"     12481","place":"Cham","author":[{"first_name":"Sebastian","last_name":"Gottschalk","full_name":"Gottschalk, Sebastian","id":"47208"},{"first_name":"Enes","full_name":"Yigitbas, Enes","id":"8447","last_name":"Yigitbas","orcid":"0000-0002-5967-833X"},{"full_name":"Schmidt, Eugen","last_name":"Schmidt","first_name":"Eugen"},{"last_name":"Engels","full_name":"Engels, Gregor","id":"107","first_name":"Gregor"}],"volume":12481,"date_updated":"2022-01-06T06:54:07Z","oa":"1","conference":{"name":"8th International Working Conference on Human-Centered Software Engineering (HCSE'20)","start_date":"2020-11-30","end_date":"2020-12-02","location":"Eindhoven"},"doi":"10.1007/978-3-030-64266-2_14","type":"conference","status":"public","editor":[{"first_name":"Regina","last_name":"Bernhaupt","full_name":"Bernhaupt, Regina"},{"first_name":"Carmelo","last_name":"Ardito","full_name":"Ardito, Carmelo"},{"full_name":"Sauer, Stefan","last_name":"Sauer","first_name":"Stefan"}],"user_id":"47208","series_title":"Lecture Notes in Computer Science","department":[{"_id":"66"},{"_id":"534"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"17","name":"SFB 901 - Subproject C5"}],"_id":"19606","file_date_updated":"2020-11-30T08:39:18Z","year":"2020","date_created":"2020-09-21T17:01:11Z","publisher":"Springer","title":"ProConAR: A Tool Support for Model-based AR Product Configuration","publication":"Human-Centered Software Engineering. HCSE 2020","file":[{"relation":"main_file","content_type":"application/pdf","file_size":3913885,"access_level":"open_access","file_name":"HCSE20_demo.pdf","file_id":"20542","date_updated":"2020-11-30T08:39:18Z","date_created":"2020-11-30T08:39:18Z","creator":"sego"}],"abstract":[{"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.","lang":"eng"}],"language":[{"iso":"eng"}],"ddc":["000"],"keyword":["Product Configuration","Augmented Reality","Model-based","Tool Support"]},{"file_date_updated":"2020-09-22T06:36:25Z","user_id":"35343","department":[{"_id":"75"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject C4","_id":"16"}],"_id":"19607","status":"public","type":"conference","author":[{"id":"35343","full_name":"Schneider, Stefan Balthasar","orcid":"0000-0001-8210-4011","last_name":"Schneider","first_name":"Stefan Balthasar"},{"last_name":"Klenner","full_name":"Klenner, Lars Dietrich","first_name":"Lars Dietrich"},{"first_name":"Holger","full_name":"Karl, Holger","id":"126","last_name":"Karl"}],"date_updated":"2022-01-06T06:54:08Z","oa":"1","citation":{"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.","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.","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.","short":"S.B. Schneider, L.D. Klenner, H. Karl, in: IEEE International Conference on Network and Service Management (CNSM), 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.","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} }"},"has_accepted_license":"1","language":[{"iso":"eng"}],"ddc":["006"],"keyword":["distributed management","service coordination","network coordination","nfv","softwarization","orchestration"],"file":[{"content_type":"application/pdf","relation":"main_file","creator":"stschn","date_created":"2020-09-22T06:25:57Z","date_updated":"2020-09-22T06:36:25Z","access_level":"open_access","file_id":"19608","file_name":"ris_with_copyright.pdf","file_size":500948}],"abstract":[{"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).","lang":"eng"}],"publication":"IEEE International Conference on Network and Service Management (CNSM)","title":"Every Node for Itself: Fully Distributed Service Coordination","date_created":"2020-09-22T06:23:40Z","publisher":"IEEE","year":"2020"},{"status":"public","type":"conference","file_date_updated":"2020-09-22T06:36:00Z","_id":"19609","project":[{"name":"SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Subproject C4","_id":"16"}],"department":[{"_id":"75"}],"user_id":"35343","citation":{"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.","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} }","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.","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.","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.","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."},"has_accepted_license":"1","date_updated":"2022-01-06T06:54:08Z","oa":"1","author":[{"full_name":"Schneider, Stefan Balthasar","id":"35343","orcid":"0000-0001-8210-4011","last_name":"Schneider","first_name":"Stefan Balthasar"},{"full_name":"Manzoor, Adnan","last_name":"Manzoor","first_name":"Adnan"},{"full_name":"Qarawlus, Haydar","last_name":"Qarawlus","first_name":"Haydar"},{"full_name":"Schellenberg, Rafael","last_name":"Schellenberg","first_name":"Rafael"},{"first_name":"Holger","full_name":"Karl, Holger","id":"126","last_name":"Karl"},{"last_name":"Khalili","full_name":"Khalili, Ramin","first_name":"Ramin"},{"first_name":"Artur","last_name":"Hecker","full_name":"Hecker, Artur"}],"abstract":[{"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.","lang":"eng"}],"file":[{"relation":"main_file","content_type":"application/pdf","access_level":"open_access","file_name":"ris_with_copyright.pdf","file_id":"19610","file_size":642999,"creator":"stschn","date_created":"2020-09-22T06:29:16Z","date_updated":"2020-09-22T06:36:00Z"}],"publication":"IEEE International Conference on Network and Service Management (CNSM)","keyword":["self-driving networks","self-learning","network coordination","service coordination","reinforcement learning","deep learning","nfv"],"ddc":["006"],"language":[{"iso":"eng"}],"year":"2020","title":"Self-Driving Network and Service Coordination Using Deep Reinforcement Learning","publisher":"IEEE","date_created":"2020-09-22T06:28:22Z"},{"title":"Augmented and Virtual Reality Object Repository for Rapid Prototyping ","date_created":"2020-09-22T12:44:51Z","author":[{"first_name":"Ivan","last_name":"Jovanovikj","orcid":"https://orcid.org/0000-0002-1838-794X","full_name":"Jovanovikj, Ivan","id":"39187"},{"full_name":"Yigitbas, Enes","id":"8447","orcid":"0000-0002-5967-833X","last_name":"Yigitbas","first_name":"Enes"},{"last_name":"Sauer","id":"447","full_name":"Sauer, Stefan","first_name":"Stefan"},{"first_name":"Gregor","full_name":"Engels, Gregor","id":"107","last_name":"Engels"}],"publisher":"Springer","date_updated":"2022-01-06T06:54:09Z","citation":{"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.","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.","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} }","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.","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.","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.","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."},"page":"216-224","year":"2020","language":[{"iso":"eng"}],"user_id":"8447","department":[{"_id":"66"},{"_id":"534"}],"_id":"19632","status":"public","type":"conference","publication":"Proceedings of the 8th International Working Conference on Human-Centered Software Engineering (HCSE'20)"},{"title":"Automatic Fairness Testing of Machine Learning Models","date_created":"2020-09-24T12:53:02Z","author":[{"first_name":"Arnab","id":"67200","full_name":"Sharma, Arnab","last_name":"Sharma"},{"last_name":"Wehrheim","id":"573","full_name":"Wehrheim, Heike","first_name":"Heike"}],"date_updated":"2022-01-06T06:54:09Z","publisher":"Springer","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.","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} }","short":"A. Sharma, H. Wehrheim, in: Proceedings of the 32th IFIP International Conference on Testing Software and Systems (ICTSS), Springer, n.d.","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.","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.","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>.","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."},"year":"2020","publication_status":"accepted","language":[{"iso":"eng"}],"series_title":"LNCS","user_id":"477","department":[{"_id":"7"},{"_id":"77"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"11","name":"SFB 901 - Subproject B3"},{"_id":"3","name":"SFB 901 - Project Area B"}],"_id":"19656","status":"public","type":"conference","publication":"Proceedings of the 32th IFIP International Conference on Testing Software and Systems (ICTSS)"},{"article_type":"original","language":[{"iso":"eng"}],"_id":"19864","department":[{"_id":"563"}],"user_id":"77201","status":"public","publication":"Proceedings of The 11th International Multi-Conference on Complexity, Informatics and Cybernetics (IMCIC 2020)","type":"journal_article","title":"Research and Consulting in Data-Driven Strategic Product Planning","date_updated":"2022-01-06T06:54:14Z","author":[{"orcid":"0000-0003-0606-7321","last_name":"Meyer","id":"77201","full_name":"Meyer, Maurice","first_name":"Maurice"},{"last_name":"Frank","full_name":"Frank, Maximilian","first_name":"Maximilian"},{"first_name":"Melina","full_name":"Massmann, Melina","last_name":"Massmann"},{"last_name":"Dumitrescu","id":"16190","full_name":"Dumitrescu, Roman","first_name":"Roman"}],"date_created":"2020-10-02T16:19:50Z","year":"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.","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.","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.","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>.","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.","short":"M. Meyer, M. Frank, M. Massmann, R. Dumitrescu, Proceedings of The 11th International Multi-Conference on Complexity, Informatics and Cybernetics (IMCIC 2020) (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} }"}},{"author":[{"first_name":"Maurice","last_name":"Meyer","orcid":"0000-0003-0606-7321","full_name":"Meyer, Maurice","id":"77201"},{"full_name":"Frank, Maximilian","last_name":"Frank","first_name":"Maximilian"},{"first_name":"Melina","full_name":"Massmann, Melina","last_name":"Massmann"},{"first_name":"Roman","last_name":"Dumitrescu","full_name":"Dumitrescu, Roman","id":"16190"}],"date_created":"2020-10-02T16:21:47Z","volume":18,"date_updated":"2022-01-06T06:54:14Z","title":"Research and Consulting in Data-Driven Strategic Product Planning","issue":"2","citation":{"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.","short":"M. Meyer, M. Frank, M. Massmann, R. Dumitrescu, Journal of Systemics, Cybernetics and Informatics 18 (2020) 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.","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.","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.","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."},"page":"55-61","intvolume":"        18","year":"2020","user_id":"77201","department":[{"_id":"563"}],"_id":"19866","language":[{"iso":"eng"}],"article_type":"original","type":"journal_article","publication":"Journal of Systemics, Cybernetics and Informatics","status":"public"},{"doi":"10.1007/978-3-030-64348-5_6","author":[{"id":"38705","full_name":"Castenow, Jannik","last_name":"Castenow","first_name":"Jannik"},{"first_name":"Peter","last_name":"Kling","full_name":"Kling, Peter"},{"orcid":"0000-0003-2014-4696","last_name":"Knollmann","full_name":"Knollmann, Till","id":"39241","first_name":"Till"},{"last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"volume":12514,"date_updated":"2022-01-06T06:54:14Z","citation":{"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>","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>.","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.","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>","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.","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>."},"page":"65-80","intvolume":"     12514","publication_status":"published","publication_identifier":{"isbn":["978-3-030-64347-8"]},"user_id":"38705","series_title":"Lecture Notes in Computer Science (LNCS)","department":[{"_id":"63"}],"_id":"19899","status":"public","editor":[{"first_name":"Stéphane ","last_name":"Devismes ","full_name":"Devismes , Stéphane "},{"full_name":"Mittal, Neeraj ","last_name":"Mittal","first_name":"Neeraj "}],"type":"conference","title":"A Discrete and Continuous Study of the Max-Chain-Formation Problem – Slow Down to Speed Up","date_created":"2020-10-06T07:27:10Z","publisher":"Springer","year":"2020","language":[{"iso":"eng"}],"external_id":{"arxiv":["2010.02043 "]},"abstract":[{"lang":"eng","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."}],"publication":"Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings"},{"date_updated":"2022-01-06T06:54:17Z","oa":"1","author":[{"first_name":"Clemens","id":"48192","full_name":"Damke, Clemens","orcid":"0000-0002-0455-0048","last_name":"Damke"},{"full_name":"Melnikov, Vitaly","id":"58747","last_name":"Melnikov","first_name":"Vitaly"},{"first_name":"Eyke","last_name":"Hüllermeier","full_name":"Hüllermeier, Eyke","id":"48129"}],"volume":129,"conference":{"location":"Bangkok, Thailand","end_date":"2020-11-20","start_date":"2020-11-18","name":"Asian Conference on Machine Learning"},"publication_status":"published","has_accepted_license":"1","place":"Bangkok, Thailand","citation":{"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.","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.","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.","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} }","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.","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."},"page":"49-64","intvolume":"       129","_id":"19953","series_title":"Proceedings of Machine Learning Research","user_id":"48192","department":[{"_id":"355"}],"file_date_updated":"2020-10-08T11:24:29Z","type":"conference","editor":[{"first_name":"Sinno","full_name":"Jialin Pan, Sinno","last_name":"Jialin Pan"},{"last_name":"Sugiyama","full_name":"Sugiyama, Masashi","first_name":"Masashi"}],"status":"public","publisher":"PMLR","date_created":"2020-10-08T10:48:38Z","title":"A Novel Higher-order Weisfeiler-Lehman Graph Convolution","quality_controlled":"1","year":"2020","external_id":{"arxiv":["2007.00346"]},"ddc":["006"],"keyword":["graph neural networks","Weisfeiler-Lehman test","cycle detection"],"language":[{"iso":"eng"}],"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."}],"file":[{"relation":"main_file","content_type":"application/pdf","file_size":771137,"file_id":"19954","access_level":"open_access","file_name":"damke20.pdf","date_updated":"2020-10-08T11:21:00Z","creator":"cdamke","date_created":"2020-10-08T10:54:48Z"},{"content_type":"application/pdf","relation":"supplementary_material","creator":"cdamke","date_created":"2020-10-08T10:54:59Z","date_updated":"2020-10-08T11:24:29Z","file_id":"19955","access_level":"open_access","file_name":"damke20-supp.pdf","file_size":613163}]},{"language":[{"iso":"eng"}],"user_id":"477","department":[{"_id":"7"},{"_id":"77"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"3","name":"SFB 901 - Project Area B"},{"name":"SFB 901 - Subproject B3","_id":"11"}],"_id":"19999","status":"public","type":"bachelorsthesis","title":"Optimierung von JMCTest beim Testen von Inter Method Contracts","date_created":"2020-10-15T05:15:46Z","author":[{"first_name":"Stefan","last_name":"Mayer","full_name":"Mayer, Stefan"}],"supervisor":[{"first_name":"Heike","full_name":"Wehrheim, Heike","id":"573","last_name":"Wehrheim"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:54:18Z","citation":{"ieee":"S. Mayer, <i>Optimierung von JMCTest beim Testen von Inter Method Contracts</i>. Universität Paderborn, 2020.","chicago":"Mayer, Stefan. <i>Optimierung von JMCTest Beim Testen von Inter Method Contracts</i>. Universität Paderborn, 2020.","ama":"Mayer S. <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.","bibtex":"@book{Mayer_2020, title={Optimierung von JMCTest beim Testen von Inter Method Contracts}, publisher={Universität Paderborn}, author={Mayer, Stefan}, year={2020} }","mla":"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."},"year":"2020"},{"publication_status":"accepted","has_accepted_license":"1","citation":{"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.","short":"Z. Nouri, H. Wachsmuth, G. Engels, in: Proceedings of COLING 2020, the 28th International Conference on Computational Linguistics, n.d., pp. 6264–6276.","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.","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."},"page":"6264-6276","year":"2020","author":[{"last_name":"Nouri","id":"35802","full_name":"Nouri, Zahra","first_name":"Zahra"},{"last_name":"Wachsmuth","full_name":"Wachsmuth, Henning","id":"3900","first_name":"Henning"},{"first_name":"Gregor","last_name":"Engels","full_name":"Engels, Gregor","id":"107"}],"date_created":"2020-10-18T12:21:34Z","date_updated":"2022-01-06T06:54:19Z","conference":{"name":"The 28th International Conference on Computational Linguistics","start_date":"2020-12-08","end_date":"2020-12-13","location":"Barcelona, Spain"},"title":"Mining Crowdsourcing Problems from Discussion Forums of Workers","type":"conference","publication":"Proceedings of COLING 2020, the 28th International Conference on Computational Linguistics","file":[{"content_type":"application/pdf","relation":"main_file","success":1,"creator":"znouri","date_created":"2020-11-10T14:25:56Z","date_updated":"2020-11-10T14:25:56Z","access_level":"closed","file_name":"Mining Crowdsourcing Problems from Discussion Forums of Workers.pdf","file_id":"20334","file_size":610246}],"status":"public","user_id":"82920","department":[{"_id":"600"}],"_id":"20116","file_date_updated":"2020-11-10T14:25:56Z","language":[{"iso":"eng"}],"ddc":["000"]},{"year":"2020","page":"29-40","citation":{"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.","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.","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.","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} }","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.","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.","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)."},"date_updated":"2022-01-06T06:54:20Z","date_created":"2020-10-19T08:49:05Z","author":[{"full_name":"El Baff, Roxanne","last_name":"El Baff","first_name":"Roxanne"},{"first_name":"Khalid","last_name":"Al-Khatib","full_name":"Al-Khatib, Khalid"},{"first_name":"Benno","full_name":"Stein, Benno","last_name":"Stein"},{"last_name":"Wachsmuth","id":"3900","full_name":"Wachsmuth, Henning","first_name":"Henning"}],"title":"Persuasiveness of News Editorials depending on Ideology and Personality","main_file_link":[{"url":"https://www.aclweb.org/anthology/2020.peoples-1.4.pdf"}],"publication":"Third Workshop on Computational Modeling of People's Opinions, Personality, and Emotions in Social Media (PEOPLES 2020)","type":"conference","status":"public","_id":"20122","department":[{"_id":"600"}],"user_id":"82920","language":[{"iso":"eng"}]},{"citation":{"ama":"Spliethöver M, Wachsmuth H. Argument from Old Man’s View: Assessing Social Bias in Argumentation. In: <i>Proceedings of the 7th Workshop on Argument Mining (ArgMining 2020)</i>. ; 2020:76-87.","ieee":"M. Spliethöver and H. Wachsmuth, “Argument from Old Man’s View: Assessing Social Bias in Argumentation,” in <i>Proceedings of the 7th Workshop on Argument Mining (ArgMining 2020)</i>, 2020, pp. 76–87.","chicago":"Spliethöver, Maximilian, and Henning Wachsmuth. “Argument from Old Man’s View: Assessing Social Bias in Argumentation.” In <i>Proceedings of the 7th Workshop on Argument Mining (ArgMining 2020)</i>, 76–87, 2020.","apa":"Spliethöver, M., &#38; Wachsmuth, H. (2020). Argument from Old Man’s View: Assessing Social Bias in Argumentation. In <i>Proceedings of the 7th Workshop on Argument Mining (ArgMining 2020)</i> (pp. 76–87).","mla":"Spliethöver, Maximilian, and Henning Wachsmuth. “Argument from Old Man’s View: Assessing Social Bias in Argumentation.” <i>Proceedings of the 7th Workshop on Argument Mining (ArgMining 2020)</i>, 2020, pp. 76–87.","short":"M. Spliethöver, H. Wachsmuth, in: Proceedings of the 7th Workshop on Argument Mining (ArgMining 2020), 2020, pp. 76–87.","bibtex":"@inproceedings{Spliethöver_Wachsmuth_2020, title={Argument from Old Man’s View: Assessing Social Bias in Argumentation}, booktitle={Proceedings of the 7th Workshop on Argument Mining (ArgMining 2020)}, author={Spliethöver, Maximilian and Wachsmuth, Henning}, year={2020}, pages={76–87} }"},"page":"76-87","year":"2020","author":[{"last_name":"Spliethöver","orcid":"0000-0003-4364-1409","id":"84035","full_name":"Spliethöver, Maximilian","first_name":"Maximilian"},{"first_name":"Henning","last_name":"Wachsmuth","id":"3900","full_name":"Wachsmuth, Henning"}],"date_created":"2020-10-20T13:03:08Z","oa":"1","date_updated":"2022-01-06T06:54:20Z","main_file_link":[{"open_access":"1","url":"https://www.aclweb.org/anthology/2020.argmining-1.9"}],"title":"Argument from Old Man's View: Assessing Social Bias in Argumentation","type":"conference","publication":"Proceedings of the 7th Workshop on Argument Mining (ArgMining 2020)","status":"public","user_id":"84035","department":[{"_id":"600"}],"_id":"20139","language":[{"iso":"eng"}]},{"year":"2020","page":"19-29","citation":{"apa":"Dorsch, J., &#38; Wachsmuth, H. (2020). Semi-Supervised Cleansing of Web Argument Corpora. In <i>Proceedings of the 7th Workshop on Argument Mining (ArgMining 2020)</i> (pp. 19–29).","bibtex":"@inproceedings{Dorsch_Wachsmuth_2020, title={Semi-Supervised Cleansing of Web Argument Corpora}, booktitle={Proceedings of the 7th Workshop on Argument Mining (ArgMining 2020)}, author={Dorsch, Jonas and Wachsmuth, Henning}, year={2020}, pages={19–29} }","short":"J. Dorsch, H. Wachsmuth, in: Proceedings of the 7th Workshop on Argument Mining (ArgMining 2020), 2020, pp. 19–29.","mla":"Dorsch, Jonas, and Henning Wachsmuth. “Semi-Supervised Cleansing of Web Argument Corpora.” <i>Proceedings of the 7th Workshop on Argument Mining (ArgMining 2020)</i>, 2020, pp. 19–29.","chicago":"Dorsch, Jonas, and Henning Wachsmuth. “Semi-Supervised Cleansing of Web Argument Corpora.” In <i>Proceedings of the 7th Workshop on Argument Mining (ArgMining 2020)</i>, 19–29, 2020.","ieee":"J. Dorsch and H. Wachsmuth, “Semi-Supervised Cleansing of Web Argument Corpora,” in <i>Proceedings of the 7th Workshop on Argument Mining (ArgMining 2020)</i>, 2020, pp. 19–29.","ama":"Dorsch J, Wachsmuth H. Semi-Supervised Cleansing of Web Argument Corpora. In: <i>Proceedings of the 7th Workshop on Argument Mining (ArgMining 2020)</i>. ; 2020:19-29."},"date_updated":"2022-01-06T06:54:20Z","date_created":"2020-10-20T13:04:15Z","author":[{"last_name":"Dorsch","full_name":"Dorsch, Jonas","first_name":"Jonas"},{"full_name":"Wachsmuth, Henning","id":"3900","last_name":"Wachsmuth","first_name":"Henning"}],"title":"Semi-Supervised Cleansing of Web Argument Corpora","main_file_link":[{"url":"https://www.aclweb.org/anthology/2020.argmining-1.3.pdf"}],"publication":"Proceedings of the 7th Workshop on Argument Mining (ArgMining 2020)","type":"conference","status":"public","_id":"20140","department":[{"_id":"600"}],"user_id":"82920","language":[{"iso":"eng"}]},{"date_updated":"2022-01-06T06:54:20Z","volume":173,"author":[{"first_name":"Surender","last_name":"Baswana","full_name":"Baswana, Surender"},{"first_name":"Shiv","last_name":"Gupta","full_name":"Gupta, Shiv"},{"first_name":"Till","orcid":"0000-0003-2014-4696","last_name":"Knollmann","full_name":"Knollmann, Till","id":"39241"}],"doi":"10.4230/LIPIcs.ESA.2020.12","publication_identifier":{"isbn":["978-3-95977-162-7"],"issn":["1868-8969"]},"place":"Dagstuhl, Germany","page":"12:1-12:14","intvolume":"       173","citation":{"ieee":"S. Baswana, S. Gupta, and T. Knollmann, “Mincut Sensitivity Data Structures for the Insertion of an Edge,” in <i>28th Annual European Symposium on Algorithms (ESA 2020)</i>, 2020, vol. 173, pp. 12:1-12:14.","chicago":"Baswana, Surender, Shiv Gupta, and Till Knollmann. “Mincut Sensitivity Data Structures for the Insertion of an Edge.” In <i>28th Annual European Symposium on Algorithms (ESA 2020)</i>, edited by Fabrizio Grandoni, Grzegorz Herman, and Peter Sanders, 173:12:1-12:14. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, 2020. <a href=\"https://doi.org/10.4230/LIPIcs.ESA.2020.12\">https://doi.org/10.4230/LIPIcs.ESA.2020.12</a>.","ama":"Baswana S, Gupta S, Knollmann T. Mincut Sensitivity Data Structures for the Insertion of an Edge. In: Grandoni F, Herman G, Sanders P, eds. <i>28th Annual European Symposium on Algorithms (ESA 2020)</i>. Vol 173. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl -- Leibniz-Zentrum für Informatik; 2020:12:1-12:14. doi:<a href=\"https://doi.org/10.4230/LIPIcs.ESA.2020.12\">10.4230/LIPIcs.ESA.2020.12</a>","mla":"Baswana, Surender, et al. “Mincut Sensitivity Data Structures for the Insertion of an Edge.” <i>28th Annual European Symposium on Algorithms (ESA 2020)</i>, edited by Fabrizio Grandoni et al., vol. 173, Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, 2020, pp. 12:1-12:14, doi:<a href=\"https://doi.org/10.4230/LIPIcs.ESA.2020.12\">10.4230/LIPIcs.ESA.2020.12</a>.","bibtex":"@inproceedings{Baswana_Gupta_Knollmann_2020, place={Dagstuhl, Germany}, series={Leibniz International Proceedings in Informatics (LIPIcs)}, title={Mincut Sensitivity Data Structures for the Insertion of an Edge}, volume={173}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.ESA.2020.12\">10.4230/LIPIcs.ESA.2020.12</a>}, booktitle={28th Annual European Symposium on Algorithms (ESA 2020)}, publisher={Schloss Dagstuhl -- Leibniz-Zentrum für Informatik}, author={Baswana, Surender and Gupta, Shiv and Knollmann, Till}, editor={Grandoni, Fabrizio and Herman, Grzegorz and Sanders, PeterEditors}, year={2020}, pages={12:1-12:14}, collection={Leibniz International Proceedings in Informatics (LIPIcs)} }","short":"S. Baswana, S. Gupta, T. Knollmann, in: F. Grandoni, G. Herman, P. Sanders (Eds.), 28th Annual European Symposium on Algorithms (ESA 2020), Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2020, pp. 12:1-12:14.","apa":"Baswana, S., Gupta, S., &#38; Knollmann, T. (2020). Mincut Sensitivity Data Structures for the Insertion of an Edge. In F. Grandoni, G. Herman, &#38; P. Sanders (Eds.), <i>28th Annual European Symposium on Algorithms (ESA 2020)</i> (Vol. 173, pp. 12:1-12:14). Dagstuhl, Germany: Schloss Dagstuhl -- Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.ESA.2020.12\">https://doi.org/10.4230/LIPIcs.ESA.2020.12</a>"},"_id":"20159","department":[{"_id":"63"}],"series_title":"Leibniz International Proceedings in Informatics (LIPIcs)","user_id":"39241","type":"conference","editor":[{"last_name":"Grandoni","full_name":"Grandoni, Fabrizio","first_name":"Fabrizio"},{"full_name":"Herman, Grzegorz","last_name":"Herman","first_name":"Grzegorz"},{"first_name":"Peter","full_name":"Sanders, Peter","last_name":"Sanders"}],"status":"public","publisher":"Schloss Dagstuhl -- Leibniz-Zentrum für Informatik","date_created":"2020-10-21T12:00:20Z","title":"Mincut Sensitivity Data Structures for the Insertion of an Edge","year":"2020","keyword":["Mincut","Sensitivity","Data Structure"],"language":[{"iso":"eng"}],"publication":"28th Annual European Symposium on Algorithms (ESA 2020)","abstract":[{"lang":"eng","text":"Let G = (V,E) be an undirected graph on n vertices with non-negative capacities on its edges. The mincut sensitivity problem for the insertion of an edge is defined as follows. Build a compact data structure for G and a given set S ⊆ V of vertices that, on receiving any edge (x,y) ∈ S×S of positive capacity as query input, can efficiently report the set of all pairs from S× S whose mincut value increases upon insertion of the edge (x,y) to G. The only result that exists for this problem is for a single pair of vertices (Picard and Queyranne, Mathematical Programming Study, 13 (1980), 8-16). We present the following results for the single source and the all-pairs versions of this problem. \r\n1) Single source: Given any designated source vertex s, there exists a data structure of size 𝒪(|S|) that can output all those vertices from S whose mincut value to s increases upon insertion of any given edge. The time taken by the data structure to answer any query is 𝒪(|S|). \r\n2) All-pairs: There exists an 𝒪(|S|²) size data structure that can output all those pairs of vertices from S× S whose mincut value gets increased upon insertion of any given edge. The time taken by the data structure to answer any query is 𝒪(k), where k is the number of pairs of vertices whose mincut increases. \r\nFor both these versions, we also address the problem of reporting the values of the mincuts upon insertion of any given edge. To derive our results, we use interesting insights into the nearest and the farthest mincuts for a pair of vertices. In addition, a crucial result, that we establish and use in our data structures, is that there exists a directed acyclic graph of 𝒪(n) size that compactly stores the farthest mincuts from all vertices of V to a designated vertex s in the graph. We believe that this result is of independent interest, especially, because it also complements a previously existing result by Hariharan et al. (STOC 2007) that the nearest mincuts from all vertices of V to s is a laminar family, and hence, can be stored compactly in a tree of 𝒪(n) size."}]},{"type":"conference","publication":"CEUR Workshop Proceedings","status":"public","_id":"20166","user_id":"82920","department":[{"_id":"600"}],"language":[{"iso":"eng"}],"year":"2020","citation":{"ama":"Bondarenko A, Fröbe M, Beloucif M, et al. Overview of Touché 2020: Argument Retrieval. In: <i>CEUR Workshop Proceedings</i>. Vol 2696. ; 2020:384-395.","ieee":"A. Bondarenko <i>et al.</i>, “Overview of Touché 2020: Argument Retrieval,” in <i>CEUR Workshop Proceedings</i>, 2020, vol. 2696, pp. 384–395.","chicago":"Bondarenko, Alexander, Maik Fröbe, Meriem Beloucif, Lukas Gienapp, Yamen Ajjour, Alexander Panchenko, Chris Biemann, et al. “Overview of Touché 2020: Argument Retrieval.” In <i>CEUR Workshop Proceedings</i>, 2696:384–95, 2020.","apa":"Bondarenko, A., Fröbe, M., Beloucif, M., Gienapp, L., Ajjour, Y., Panchenko, A., … Hagen, M. (2020). Overview of Touché 2020: Argument Retrieval. In <i>CEUR Workshop Proceedings</i> (Vol. 2696, pp. 384–395).","bibtex":"@inproceedings{Bondarenko_Fröbe_Beloucif_Gienapp_Ajjour_Panchenko_Biemann_Stein_Wachsmuth_Potthast_et al._2020, title={Overview of Touché 2020: Argument Retrieval}, volume={2696}, booktitle={CEUR Workshop Proceedings}, author={Bondarenko, Alexander and Fröbe, Maik and Beloucif, Meriem and Gienapp, Lukas and Ajjour, Yamen and Panchenko, Alexander and Biemann, Chris and Stein, Benno and Wachsmuth, Henning and Potthast, Martin and et al.}, year={2020}, pages={384–395} }","short":"A. Bondarenko, M. Fröbe, M. Beloucif, L. Gienapp, Y. Ajjour, A. Panchenko, C. Biemann, B. Stein, H. Wachsmuth, M. Potthast, M. Hagen, in: CEUR Workshop Proceedings, 2020, pp. 384–395.","mla":"Bondarenko, Alexander, et al. “Overview of Touché 2020: Argument Retrieval.” <i>CEUR Workshop Proceedings</i>, vol. 2696, 2020, pp. 384–95."},"intvolume":"      2696","page":"384-395","date_updated":"2022-01-06T06:54:20Z","date_created":"2020-10-22T07:22:52Z","author":[{"last_name":"Bondarenko","full_name":"Bondarenko, Alexander","first_name":"Alexander"},{"first_name":"Maik","full_name":"Fröbe, Maik","last_name":"Fröbe"},{"last_name":"Beloucif","full_name":"Beloucif, Meriem","first_name":"Meriem"},{"first_name":"Lukas","last_name":"Gienapp","full_name":"Gienapp, Lukas"},{"first_name":"Yamen","last_name":"Ajjour","full_name":"Ajjour, Yamen"},{"first_name":"Alexander","last_name":"Panchenko","full_name":"Panchenko, Alexander"},{"full_name":"Biemann, Chris","last_name":"Biemann","first_name":"Chris"},{"full_name":"Stein, Benno","last_name":"Stein","first_name":"Benno"},{"first_name":"Henning","last_name":"Wachsmuth","id":"3900","full_name":"Wachsmuth, Henning"},{"last_name":"Potthast","full_name":"Potthast, Martin","first_name":"Martin"},{"first_name":"Matthias","last_name":"Hagen","full_name":"Hagen, Matthias"}],"volume":2696,"title":"Overview of Touché 2020: Argument Retrieval","main_file_link":[{"url":"http://ceur-ws.org/Vol-2696/paper_261.pdf"}]},{"title":"Brief Announcement: Gathering in Linear Time: A Closed Chain of Disoriented & Luminous Robots with Limited Visibility ","publisher":"Springer","date_created":"2020-10-23T08:50:28Z","year":"2020","language":[{"iso":"eng"}],"external_id":{"arxiv":["2010.04424 "]},"publication":"Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings ","doi":"10.1007/978-3-030-64348-5_5","date_updated":"2022-01-06T06:54:21Z","volume":12514,"author":[{"first_name":"Jannik","id":"38705","full_name":"Castenow, Jannik","last_name":"Castenow"},{"full_name":"Harbig, Jonas","id":"47213","last_name":"Harbig","first_name":"Jonas"},{"first_name":"Daniel","full_name":"Jung, Daniel","id":"37827","last_name":"Jung"},{"id":"39241","full_name":"Knollmann, Till","orcid":"0000-0003-2014-4696","last_name":"Knollmann","first_name":"Till"},{"full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"intvolume":"     12514","page":"60-64","citation":{"ama":"Castenow J, Harbig J, Jung D, Knollmann T, Meyer auf der Heide F. Brief Announcement: Gathering in Linear Time: A Closed Chain of Disoriented &#38; Luminous Robots with Limited Visibility . 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:60-64. doi:<a href=\"https://doi.org/10.1007/978-3-030-64348-5_5\">10.1007/978-3-030-64348-5_5</a>","chicago":"Castenow, Jannik, Jonas Harbig, Daniel Jung, Till Knollmann, and Friedhelm Meyer auf der Heide. “Brief Announcement: Gathering in Linear Time: A Closed Chain of Disoriented &#38; Luminous Robots with Limited Visibility .” 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:60–64. Lecture Notes in Computer Science (LNCS). Springer, 2020. <a href=\"https://doi.org/10.1007/978-3-030-64348-5_5\">https://doi.org/10.1007/978-3-030-64348-5_5</a>.","ieee":"J. Castenow, J. Harbig, D. Jung, T. Knollmann, and F. Meyer auf der Heide, “Brief Announcement: Gathering in Linear Time: A Closed Chain of Disoriented &#38; Luminous Robots with Limited Visibility ,” 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. 60–64.","short":"J. Castenow, J. Harbig, D. Jung, 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. 60–64.","bibtex":"@inproceedings{Castenow_Harbig_Jung_Knollmann_Meyer auf der Heide_2020, series={Lecture Notes in Computer Science (LNCS)}, title={Brief Announcement: Gathering in Linear Time: A Closed Chain of Disoriented &#38; Luminous Robots with Limited Visibility }, volume={12514}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-64348-5_5\">10.1007/978-3-030-64348-5_5</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 Harbig, Jonas and Jung, Daniel and Knollmann, Till and Meyer auf der Heide, Friedhelm}, editor={Devismes, Stéphane  and  Mittal, NeerajEditors}, year={2020}, pages={60–64}, collection={Lecture Notes in Computer Science (LNCS)} }","mla":"Castenow, Jannik, et al. “Brief Announcement: Gathering in Linear Time: A Closed Chain of Disoriented &#38; Luminous Robots with Limited Visibility .” <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. 60–64, doi:<a href=\"https://doi.org/10.1007/978-3-030-64348-5_5\">10.1007/978-3-030-64348-5_5</a>.","apa":"Castenow, J., Harbig, J., Jung, D., Knollmann, T., &#38; Meyer auf der Heide, F. (2020). Brief Announcement: Gathering in Linear Time: A Closed Chain of Disoriented &#38; Luminous Robots with Limited Visibility . 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. 60–64). Springer. <a href=\"https://doi.org/10.1007/978-3-030-64348-5_5\">https://doi.org/10.1007/978-3-030-64348-5_5</a>"},"publication_identifier":{"isbn":["978-3-030-64347-8"]},"publication_status":"published","_id":"20185","department":[{"_id":"63"}],"series_title":"Lecture Notes in Computer Science (LNCS)","user_id":"38705","editor":[{"last_name":"Devismes","full_name":"Devismes, Stéphane ","first_name":"Stéphane "},{"full_name":" Mittal, Neeraj","last_name":" Mittal","first_name":"Neeraj"}],"status":"public","type":"conference"},{"type":"mastersthesis","status":"public","department":[{"_id":"79"}],"user_id":"15504","_id":"20221","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"language":[{"iso":"eng"}],"citation":{"apa":"Yeole, P. K. (2020). <i>Plurality Consensus in Hybrid Networks</i>.","mla":"Yeole, Paresh Kishor. <i>Plurality Consensus in Hybrid Networks</i>. 2020.","short":"P.K. Yeole, Plurality Consensus in Hybrid Networks, 2020.","bibtex":"@book{Yeole_2020, title={Plurality Consensus in Hybrid Networks}, author={Yeole, Paresh Kishor}, year={2020} }","ama":"Yeole PK. <i>Plurality Consensus in Hybrid Networks</i>.; 2020.","chicago":"Yeole, Paresh Kishor. <i>Plurality Consensus in Hybrid Networks</i>, 2020.","ieee":"P. K. Yeole, <i>Plurality Consensus in Hybrid Networks</i>. 2020."},"year":"2020","author":[{"first_name":"Paresh Kishor","full_name":"Yeole, Paresh Kishor","last_name":"Yeole"}],"supervisor":[{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"}],"date_created":"2020-10-29T07:45:57Z","date_updated":"2022-01-06T06:54:23Z","title":"Plurality Consensus in Hybrid Networks"},{"_id":"20274","project":[{"_id":"78","name":"Validation of Software Transactional Memory"}],"department":[{"_id":"77"}],"series_title":"Lecture Notes in Computer Science","user_id":"29719","language":[{"iso":"eng"}],"publication":"Formal Techniques for Distributed Objects, Components, and Systems - 40th {IFIP} {WG} 6.1 International Conference, {FORTE} 2020, Held as Part of the 15th International Federated Conference on Distributed Computing Techniques, DisCoTec 2020, Valletta, Malta, June 15-19, 2020, Proceedings","type":"conference","editor":[{"last_name":"Gotsman","full_name":"Gotsman, Alexey","first_name":"Alexey"},{"first_name":"Ana","full_name":"Sokolova, Ana","last_name":"Sokolova"}],"status":"public","date_updated":"2022-01-06T06:54:25Z","publisher":"Springer","volume":12136,"date_created":"2020-11-04T08:27:09Z","author":[{"last_name":"Bila","full_name":"Bila, Eleni","first_name":"Eleni"},{"full_name":"Doherty, Simon","last_name":"Doherty","first_name":"Simon"},{"first_name":"Brijesh","full_name":"Dongol, Brijesh","last_name":"Dongol"},{"last_name":"Derrick","full_name":"Derrick, John","first_name":"John"},{"last_name":"Schellhorn","full_name":"Schellhorn, Gerhard","first_name":"Gerhard"},{"first_name":"Heike","full_name":"Wehrheim, Heike","id":"573","last_name":"Wehrheim"}],"title":"Defining and Verifying Durable Opacity: Correctness for Persistent Software Transactional Memory","doi":"10.1007/978-3-030-50086-3\\_3","year":"2020","page":"39-58","intvolume":"     12136","citation":{"mla":"Bila, Eleni, et al. “Defining and Verifying Durable Opacity: Correctness for Persistent Software Transactional Memory.” <i>Formal Techniques for Distributed Objects, Components, and Systems - 40th {IFIP} {WG} 6.1 International Conference, {FORTE} 2020, Held as Part of the 15th International Federated Conference on Distributed Computing Techniques, DisCoTec 2020, Valletta, Malta, June 15-19, 2020, Proceedings</i>, edited by Alexey Gotsman and Ana Sokolova, vol. 12136, Springer, 2020, pp. 39–58, doi:<a href=\"https://doi.org/10.1007/978-3-030-50086-3\\_3\">10.1007/978-3-030-50086-3\\_3</a>.","short":"E. Bila, S. Doherty, B. Dongol, J. Derrick, G. Schellhorn, H. Wehrheim, in: A. Gotsman, A. Sokolova (Eds.), Formal Techniques for Distributed Objects, Components, and Systems - 40th {IFIP} {WG} 6.1 International Conference, {FORTE} 2020, Held as Part of the 15th International Federated Conference on Distributed Computing Techniques, DisCoTec 2020, Valletta, Malta, June 15-19, 2020, Proceedings, Springer, 2020, pp. 39–58.","bibtex":"@inproceedings{Bila_Doherty_Dongol_Derrick_Schellhorn_Wehrheim_2020, series={Lecture Notes in Computer Science}, title={Defining and Verifying Durable Opacity: Correctness for Persistent Software Transactional Memory}, volume={12136}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-50086-3\\_3\">10.1007/978-3-030-50086-3\\_3</a>}, booktitle={Formal Techniques for Distributed Objects, Components, and Systems - 40th {IFIP} {WG} 6.1 International Conference, {FORTE} 2020, Held as Part of the 15th International Federated Conference on Distributed Computing Techniques, DisCoTec 2020, Valletta, Malta, June 15-19, 2020, Proceedings}, publisher={Springer}, author={Bila, Eleni and Doherty, Simon and Dongol, Brijesh and Derrick, John and Schellhorn, Gerhard and Wehrheim, Heike}, editor={Gotsman, Alexey and Sokolova, AnaEditors}, year={2020}, pages={39–58}, collection={Lecture Notes in Computer Science} }","apa":"Bila, E., Doherty, S., Dongol, B., Derrick, J., Schellhorn, G., &#38; Wehrheim, H. (2020). Defining and Verifying Durable Opacity: Correctness for Persistent Software Transactional Memory. In A. Gotsman &#38; A. Sokolova (Eds.), <i>Formal Techniques for Distributed Objects, Components, and Systems - 40th {IFIP} {WG} 6.1 International Conference, {FORTE} 2020, Held as Part of the 15th International Federated Conference on Distributed Computing Techniques, DisCoTec 2020, Valletta, Malta, June 15-19, 2020, Proceedings</i> (Vol. 12136, pp. 39–58). Springer. <a href=\"https://doi.org/10.1007/978-3-030-50086-3\\_3\">https://doi.org/10.1007/978-3-030-50086-3\\_3</a>","ama":"Bila E, Doherty S, Dongol B, Derrick J, Schellhorn G, Wehrheim H. Defining and Verifying Durable Opacity: Correctness for Persistent Software Transactional Memory. In: Gotsman A, Sokolova A, eds. <i>Formal Techniques for Distributed Objects, Components, and Systems - 40th {IFIP} {WG} 6.1 International Conference, {FORTE} 2020, Held as Part of the 15th International Federated Conference on Distributed Computing Techniques, DisCoTec 2020, Valletta, Malta, June 15-19, 2020, Proceedings</i>. Vol 12136. Lecture Notes in Computer Science. Springer; 2020:39-58. doi:<a href=\"https://doi.org/10.1007/978-3-030-50086-3\\_3\">10.1007/978-3-030-50086-3\\_3</a>","ieee":"E. Bila, S. Doherty, B. Dongol, J. Derrick, G. Schellhorn, and H. Wehrheim, “Defining and Verifying Durable Opacity: Correctness for Persistent Software Transactional Memory,” in <i>Formal Techniques for Distributed Objects, Components, and Systems - 40th {IFIP} {WG} 6.1 International Conference, {FORTE} 2020, Held as Part of the 15th International Federated Conference on Distributed Computing Techniques, DisCoTec 2020, Valletta, Malta, June 15-19, 2020, Proceedings</i>, 2020, vol. 12136, pp. 39–58.","chicago":"Bila, Eleni, Simon Doherty, Brijesh Dongol, John Derrick, Gerhard Schellhorn, and Heike Wehrheim. “Defining and Verifying Durable Opacity: Correctness for Persistent Software Transactional Memory.” In <i>Formal Techniques for Distributed Objects, Components, and Systems - 40th {IFIP} {WG} 6.1 International Conference, {FORTE} 2020, Held as Part of the 15th International Federated Conference on Distributed Computing Techniques, DisCoTec 2020, Valletta, Malta, June 15-19, 2020, Proceedings</i>, edited by Alexey Gotsman and Ana Sokolova, 12136:39–58. Lecture Notes in Computer Science. Springer, 2020. <a href=\"https://doi.org/10.1007/978-3-030-50086-3\\_3\">https://doi.org/10.1007/978-3-030-50086-3\\_3</a>."}}]