[{"volume":12,"user_id":"33185","ddc":["040"],"_id":"34640","page":"65-77","has_accepted_license":"1","status":"public","external_id":{"pmid":["36393995"]},"citation":{"mla":"Schloots, Franziska Margarete. “Die Tamagotchisierung des Selbst. Zur Anschaulichkeit von animierten Körperdaten.” <i>Rabbit Eye - Zeitschrift für Filmforschung</i>, vol. 12, 2022, pp. 65–77.","ama":"Schloots FM. Die Tamagotchisierung des Selbst. Zur Anschaulichkeit von animierten Körperdaten. <i>Rabbit Eye - Zeitschrift für Filmforschung</i>. 2022;12:65-77.","bibtex":"@article{Schloots_2022, title={Die Tamagotchisierung des Selbst. Zur Anschaulichkeit von animierten Körperdaten}, volume={12}, journal={Rabbit Eye - Zeitschrift für Filmforschung}, author={Schloots, Franziska Margarete}, year={2022}, pages={65–77} }","apa":"Schloots, F. M. (2022). Die Tamagotchisierung des Selbst. Zur Anschaulichkeit von animierten Körperdaten. <i>Rabbit Eye - Zeitschrift für Filmforschung</i>, <i>12</i>, 65–77.","ieee":"F. M. Schloots, “Die Tamagotchisierung des Selbst. Zur Anschaulichkeit von animierten Körperdaten,” <i>Rabbit Eye - Zeitschrift für Filmforschung</i>, vol. 12, pp. 65–77, 2022.","chicago":"Schloots, Franziska Margarete. “Die Tamagotchisierung des Selbst. Zur Anschaulichkeit von animierten Körperdaten.” <i>Rabbit Eye - Zeitschrift für Filmforschung</i> 12 (2022): 65–77.","short":"F.M. Schloots, Rabbit Eye - Zeitschrift für Filmforschung 12 (2022) 65–77."},"file_date_updated":"2023-01-19T14:12:55Z","pmid":"1","language":[{"iso":"ger"}],"article_type":"original","intvolume":"        12","publication_status":"published","date_updated":"2024-10-09T14:24:11Z","publication_identifier":{"issn":["2192-5445"]},"author":[{"last_name":"Schloots","first_name":"Franziska Margarete","full_name":"Schloots, Franziska Margarete","id":"33185"}],"title":"Die Tamagotchisierung des Selbst. Zur Anschaulichkeit von animierten Körperdaten","year":"2022","department":[{"_id":"574"}],"keyword":["Wearable","selft-tracking","Selbstvermessung","Animation","Tamagotchi","Anschaulichkeit"],"type":"journal_article","date_created":"2022-12-21T09:01:06Z","file":[{"date_created":"2023-01-19T14:12:55Z","creator":"fms","success":1,"content_type":"application/pdf","file_id":"37608","file_size":377601,"access_level":"closed","file_name":"schloots_tamagotchisierung.pdf","date_updated":"2023-01-19T14:12:55Z","relation":"main_file"}],"publication":"Rabbit Eye - Zeitschrift für Filmforschung"},{"citation":{"mla":"Baader, Franz, et al. “Efficient TBox Reasoning with Value Restrictions Using the FL0wer Reasoner (Extended Abstract).” <i>Proceedings of the 35th International Workshop on Description Logics (DL 2022) Co-Located with Federated Logic Conference (FLoC 2022), Haifa, Israel, August 7th to 10th, 2022</i>, edited by Ofer Arieli et al., vol. 3263, CEUR-WS.org, 2022.","ama":"Baader F, Koopmann P, Michel F, Turhan A-Y, Zarrieß B. Efficient TBox Reasoning with Value Restrictions Using the FL0wer Reasoner (Extended Abstract). In: Arieli O, Homola M, Jung JC, Mugnier M-L, eds. <i>Proceedings of the 35th International Workshop on Description Logics (DL 2022) Co-Located with Federated Logic Conference (FLoC 2022), Haifa, Israel, August 7th to 10th, 2022</i>. Vol 3263. CEUR Workshop Proceedings. CEUR-WS.org; 2022.","bibtex":"@inproceedings{Baader_Koopmann_Michel_Turhan_Zarrieß_2022, series={CEUR Workshop Proceedings}, title={Efficient TBox Reasoning with Value Restrictions Using the FL0wer Reasoner (Extended Abstract)}, volume={3263}, booktitle={Proceedings of the 35th International Workshop on Description Logics (DL 2022) co-located with Federated Logic Conference (FLoC 2022), Haifa, Israel, August 7th to 10th, 2022}, publisher={CEUR-WS.org}, author={Baader, Franz and Koopmann, Patrick and Michel, Friedrich and Turhan, Anni-Yasmin and Zarrieß, Benjamin}, editor={Arieli, Ofer and Homola, Martin and Jung, Jean Christoph and Mugnier, Marie-Laure}, year={2022}, collection={CEUR Workshop Proceedings} }","apa":"Baader, F., Koopmann, P., Michel, F., Turhan, A.-Y., &#38; Zarrieß, B. (2022). Efficient TBox Reasoning with Value Restrictions Using the FL0wer Reasoner (Extended Abstract). In O. Arieli, M. Homola, J. C. Jung, &#38; M.-L. Mugnier (Eds.), <i>Proceedings of the 35th International Workshop on Description Logics (DL 2022) co-located with Federated Logic Conference (FLoC 2022), Haifa, Israel, August 7th to 10th, 2022</i> (Vol. 3263). CEUR-WS.org.","ieee":"F. Baader, P. Koopmann, F. Michel, A.-Y. Turhan, and B. Zarrieß, “Efficient TBox Reasoning with Value Restrictions Using the FL0wer Reasoner (Extended Abstract),” in <i>Proceedings of the 35th International Workshop on Description Logics (DL 2022) co-located with Federated Logic Conference (FLoC 2022), Haifa, Israel, August 7th to 10th, 2022</i>, 2022, vol. 3263.","chicago":"Baader, Franz, Patrick Koopmann, Friedrich Michel, Anni-Yasmin Turhan, and Benjamin Zarrieß. “Efficient TBox Reasoning with Value Restrictions Using the FL0wer Reasoner (Extended Abstract).” In <i>Proceedings of the 35th International Workshop on Description Logics (DL 2022) Co-Located with Federated Logic Conference (FLoC 2022), Haifa, Israel, August 7th to 10th, 2022</i>, edited by Ofer Arieli, Martin Homola, Jean Christoph Jung, and Marie-Laure Mugnier, Vol. 3263. CEUR Workshop Proceedings. CEUR-WS.org, 2022.","short":"F. Baader, P. Koopmann, F. Michel, A.-Y. Turhan, B. Zarrieß, in: O. Arieli, M. Homola, J.C. Jung, M.-L. Mugnier (Eds.), Proceedings of the 35th International Workshop on Description Logics (DL 2022) Co-Located with Federated Logic Conference (FLoC 2022), Haifa, Israel, August 7th to 10th, 2022, CEUR-WS.org, 2022."},"publication":"Proceedings of the 35th International Workshop on Description Logics (DL 2022) co-located with Federated Logic Conference (FLoC 2022), Haifa, Israel, August 7th to 10th, 2022","department":[{"_id":"888"}],"type":"conference","date_created":"2024-03-26T10:53:20Z","intvolume":"      3263","date_updated":"2024-10-14T08:04:11Z","author":[{"first_name":"Franz","last_name":"Baader","full_name":"Baader, Franz"},{"full_name":"Koopmann, Patrick","first_name":"Patrick","last_name":"Koopmann"},{"full_name":"Michel, Friedrich","first_name":"Friedrich","last_name":"Michel"},{"id":"104470","last_name":"Turhan","first_name":"Anni-Yasmin","full_name":"Turhan, Anni-Yasmin"},{"first_name":"Benjamin","last_name":"Zarrieß","full_name":"Zarrieß, Benjamin"}],"title":"Efficient TBox Reasoning with Value Restrictions Using the FL0wer Reasoner (Extended Abstract)","year":"2022","status":"public","volume":3263,"editor":[{"full_name":"Arieli, Ofer","first_name":"Ofer","last_name":"Arieli"},{"full_name":"Homola, Martin","last_name":"Homola","first_name":"Martin"},{"first_name":"Jean Christoph","last_name":"Jung","full_name":"Jung, Jean Christoph"},{"first_name":"Marie-Laure","last_name":"Mugnier","full_name":"Mugnier, Marie-Laure"}],"user_id":"15504","series_title":"CEUR Workshop Proceedings","_id":"52920","language":[{"iso":"eng"}],"publisher":"CEUR-WS.org"},{"type":"conference","department":[{"_id":"888"}],"date_created":"2024-03-26T10:53:35Z","publication":"Proceedings of the 35th International Workshop on Description Logics (DL 2022) co-located with Federated Logic Conference (FLoC 2022), Haifa, Israel, August 7th to 10th, 2022","citation":{"apa":"Tirtarasa, S., &#38; Turhan, A.-Y. (2022). A New Dimension to Generalization: Computing Temporal EL Concepts from Positive Examples (Extended Abstract). In O. Arieli, M. Homola, J. C. Jung, &#38; M.-L. Mugnier (Eds.), <i>Proceedings of the 35th International Workshop on Description Logics (DL 2022) co-located with Federated Logic Conference (FLoC 2022), Haifa, Israel, August 7th to 10th, 2022</i> (Vol. 3263). CEUR-WS.org.","ieee":"S. Tirtarasa and A.-Y. Turhan, “A New Dimension to Generalization: Computing Temporal EL Concepts from Positive Examples (Extended Abstract),” in <i>Proceedings of the 35th International Workshop on Description Logics (DL 2022) co-located with Federated Logic Conference (FLoC 2022), Haifa, Israel, August 7th to 10th, 2022</i>, 2022, vol. 3263.","short":"S. Tirtarasa, A.-Y. Turhan, in: O. Arieli, M. Homola, J.C. Jung, M.-L. Mugnier (Eds.), Proceedings of the 35th International Workshop on Description Logics (DL 2022) Co-Located with Federated Logic Conference (FLoC 2022), Haifa, Israel, August 7th to 10th, 2022, CEUR-WS.org, 2022.","chicago":"Tirtarasa, Satyadharma, and Anni-Yasmin Turhan. “A New Dimension to Generalization: Computing Temporal EL Concepts from Positive Examples (Extended Abstract).” In <i>Proceedings of the 35th International Workshop on Description Logics (DL 2022) Co-Located with Federated Logic Conference (FLoC 2022), Haifa, Israel, August 7th to 10th, 2022</i>, edited by Ofer Arieli, Martin Homola, Jean Christoph Jung, and Marie-Laure Mugnier, Vol. 3263. CEUR Workshop Proceedings. CEUR-WS.org, 2022.","mla":"Tirtarasa, Satyadharma, and Anni-Yasmin Turhan. “A New Dimension to Generalization: Computing Temporal EL Concepts from Positive Examples (Extended Abstract).” <i>Proceedings of the 35th International Workshop on Description Logics (DL 2022) Co-Located with Federated Logic Conference (FLoC 2022), Haifa, Israel, August 7th to 10th, 2022</i>, edited by Ofer Arieli et al., vol. 3263, CEUR-WS.org, 2022.","ama":"Tirtarasa S, Turhan A-Y. A New Dimension to Generalization: Computing Temporal EL Concepts from Positive Examples (Extended Abstract). In: Arieli O, Homola M, Jung JC, Mugnier M-L, eds. <i>Proceedings of the 35th International Workshop on Description Logics (DL 2022) Co-Located with Federated Logic Conference (FLoC 2022), Haifa, Israel, August 7th to 10th, 2022</i>. Vol 3263. CEUR Workshop Proceedings. CEUR-WS.org; 2022.","bibtex":"@inproceedings{Tirtarasa_Turhan_2022, series={CEUR Workshop Proceedings}, title={A New Dimension to Generalization: Computing Temporal EL Concepts from Positive Examples (Extended Abstract)}, volume={3263}, booktitle={Proceedings of the 35th International Workshop on Description Logics (DL 2022) co-located with Federated Logic Conference (FLoC 2022), Haifa, Israel, August 7th to 10th, 2022}, publisher={CEUR-WS.org}, author={Tirtarasa, Satyadharma and Turhan, Anni-Yasmin}, editor={Arieli, Ofer and Homola, Martin and Jung, Jean Christoph and Mugnier, Marie-Laure}, year={2022}, collection={CEUR Workshop Proceedings} }"},"user_id":"15504","volume":3263,"editor":[{"full_name":"Arieli, Ofer","first_name":"Ofer","last_name":"Arieli"},{"full_name":"Homola, Martin","last_name":"Homola","first_name":"Martin"},{"full_name":"Jung, Jean Christoph","last_name":"Jung","first_name":"Jean Christoph"},{"full_name":"Mugnier, Marie-Laure","last_name":"Mugnier","first_name":"Marie-Laure"}],"publisher":"CEUR-WS.org","_id":"52921","language":[{"iso":"eng"}],"series_title":"CEUR Workshop Proceedings","date_updated":"2024-10-14T08:02:28Z","intvolume":"      3263","title":"A New Dimension to Generalization: Computing Temporal EL Concepts from Positive Examples (Extended Abstract)","status":"public","year":"2022","author":[{"full_name":"Tirtarasa, Satyadharma","last_name":"Tirtarasa","first_name":"Satyadharma"},{"id":"104470","last_name":"Turhan","first_name":"Anni-Yasmin","full_name":"Turhan, Anni-Yasmin"}]},{"date_created":"2024-03-26T10:53:53Z","department":[{"_id":"888"}],"type":"conference","citation":{"mla":"Peñaloza, Rafael, and Anni-Yasmin Turhan. “User-Aware Explications of Ontology Consequences: Levelling Technicality.” <i>Proceedings of the 8th Workshop on Formal and Cognitive Reasoning Co-Located with the 45th German Conference on Artificial Intelligence (KI 2022), Virtual Event, Trier, Germany, September 19, 2022</i>, edited by Christoph Beierle et al., vol. 3242, CEUR-WS.org, 2022, pp. 90–101.","bibtex":"@inproceedings{Peñaloza_Turhan_2022, series={CEUR Workshop Proceedings}, title={User-aware Explications of Ontology Consequences: Levelling Technicality}, volume={3242}, booktitle={Proceedings of the 8th Workshop on Formal and Cognitive Reasoning co-located with the 45th German Conference on Artificial Intelligence (KI 2022), Virtual Event, Trier, Germany, September 19, 2022}, publisher={CEUR-WS.org}, author={Peñaloza, Rafael and Turhan, Anni-Yasmin}, editor={Beierle, Christoph and Ragni, Marco and Stolzenburg, Frieder and Sauerwald, Kai and Thimm, Matthias}, year={2022}, pages={90–101}, collection={CEUR Workshop Proceedings} }","ama":"Peñaloza R, Turhan A-Y. User-aware Explications of Ontology Consequences: Levelling Technicality. In: Beierle C, Ragni M, Stolzenburg F, Sauerwald K, Thimm M, eds. <i>Proceedings of the 8th Workshop on Formal and Cognitive Reasoning Co-Located with the 45th German Conference on Artificial Intelligence (KI 2022), Virtual Event, Trier, Germany, September 19, 2022</i>. Vol 3242. CEUR Workshop Proceedings. CEUR-WS.org; 2022:90–101.","ieee":"R. Peñaloza and A.-Y. Turhan, “User-aware Explications of Ontology Consequences: Levelling Technicality,” in <i>Proceedings of the 8th Workshop on Formal and Cognitive Reasoning co-located with the 45th German Conference on Artificial Intelligence (KI 2022), Virtual Event, Trier, Germany, September 19, 2022</i>, 2022, vol. 3242, pp. 90–101.","apa":"Peñaloza, R., &#38; Turhan, A.-Y. (2022). User-aware Explications of Ontology Consequences: Levelling Technicality. In C. Beierle, M. Ragni, F. Stolzenburg, K. Sauerwald, &#38; M. Thimm (Eds.), <i>Proceedings of the 8th Workshop on Formal and Cognitive Reasoning co-located with the 45th German Conference on Artificial Intelligence (KI 2022), Virtual Event, Trier, Germany, September 19, 2022</i> (Vol. 3242, pp. 90–101). CEUR-WS.org.","short":"R. Peñaloza, A.-Y. Turhan, in: C. Beierle, M. Ragni, F. Stolzenburg, K. Sauerwald, M. Thimm (Eds.), Proceedings of the 8th Workshop on Formal and Cognitive Reasoning Co-Located with the 45th German Conference on Artificial Intelligence (KI 2022), Virtual Event, Trier, Germany, September 19, 2022, CEUR-WS.org, 2022, pp. 90–101.","chicago":"Peñaloza, Rafael, and Anni-Yasmin Turhan. “User-Aware Explications of Ontology Consequences: Levelling Technicality.” In <i>Proceedings of the 8th Workshop on Formal and Cognitive Reasoning Co-Located with the 45th German Conference on Artificial Intelligence (KI 2022), Virtual Event, Trier, Germany, September 19, 2022</i>, edited by Christoph Beierle, Marco Ragni, Frieder Stolzenburg, Kai Sauerwald, and Matthias Thimm, 3242:90–101. CEUR Workshop Proceedings. CEUR-WS.org, 2022."},"publication":"Proceedings of the 8th Workshop on Formal and Cognitive Reasoning co-located with the 45th German Conference on Artificial Intelligence (KI 2022), Virtual Event, Trier, Germany, September 19, 2022","_id":"52922","series_title":"CEUR Workshop Proceedings","language":[{"iso":"eng"}],"publisher":"CEUR-WS.org","page":"90–101","editor":[{"full_name":"Beierle, Christoph","last_name":"Beierle","first_name":"Christoph"},{"full_name":"Ragni, Marco","first_name":"Marco","last_name":"Ragni"},{"full_name":"Stolzenburg, Frieder","first_name":"Frieder","last_name":"Stolzenburg"},{"last_name":"Sauerwald","first_name":"Kai","full_name":"Sauerwald, Kai"},{"last_name":"Thimm","first_name":"Matthias","full_name":"Thimm, Matthias"}],"volume":3242,"user_id":"15504","author":[{"full_name":"Peñaloza, Rafael","first_name":"Rafael","last_name":"Peñaloza"},{"full_name":"Turhan, Anni-Yasmin","first_name":"Anni-Yasmin","last_name":"Turhan","id":"104470"}],"year":"2022","title":"User-aware Explications of Ontology Consequences: Levelling Technicality","status":"public","intvolume":"      3242","date_updated":"2024-10-14T08:04:50Z"},{"_id":"64115","publisher":"IEEE","doi":"10.1109/vlsi-soc54400.2022.9939606","user_id":"64665","author":[{"full_name":"Awais, Muhammad","first_name":"Muhammad","last_name":"Awais"},{"full_name":"Platzner, Marco","last_name":"Platzner","first_name":"Marco"}],"status":"public","year":"2022","title":"Automated Framework for Fast Synthesis of Approximate Hardware Accelerators","date_updated":"2026-02-11T10:20:33Z","publication_status":"published","date_created":"2026-02-11T10:20:04Z","department":[{"_id":"78"}],"type":"conference","citation":{"mla":"Awais, Muhammad, and Marco Platzner. “Automated Framework for Fast Synthesis of Approximate Hardware Accelerators.” <i>2022 IFIP/IEEE 30th International Conference on Very Large Scale Integration (VLSI-SoC)</i>, IEEE, 2022, doi:<a href=\"https://doi.org/10.1109/vlsi-soc54400.2022.9939606\">10.1109/vlsi-soc54400.2022.9939606</a>.","ama":"Awais M, Platzner M. Automated Framework for Fast Synthesis of Approximate Hardware Accelerators. In: <i>2022 IFIP/IEEE 30th International Conference on Very Large Scale Integration (VLSI-SoC)</i>. IEEE; 2022. doi:<a href=\"https://doi.org/10.1109/vlsi-soc54400.2022.9939606\">10.1109/vlsi-soc54400.2022.9939606</a>","bibtex":"@inproceedings{Awais_Platzner_2022, title={Automated Framework for Fast Synthesis of Approximate Hardware Accelerators}, DOI={<a href=\"https://doi.org/10.1109/vlsi-soc54400.2022.9939606\">10.1109/vlsi-soc54400.2022.9939606</a>}, booktitle={2022 IFIP/IEEE 30th International Conference on Very Large Scale Integration (VLSI-SoC)}, publisher={IEEE}, author={Awais, Muhammad and Platzner, Marco}, year={2022} }","apa":"Awais, M., &#38; Platzner, M. (2022). Automated Framework for Fast Synthesis of Approximate Hardware Accelerators. <i>2022 IFIP/IEEE 30th International Conference on Very Large Scale Integration (VLSI-SoC)</i>. <a href=\"https://doi.org/10.1109/vlsi-soc54400.2022.9939606\">https://doi.org/10.1109/vlsi-soc54400.2022.9939606</a>","ieee":"M. Awais and M. Platzner, “Automated Framework for Fast Synthesis of Approximate Hardware Accelerators,” 2022, doi: <a href=\"https://doi.org/10.1109/vlsi-soc54400.2022.9939606\">10.1109/vlsi-soc54400.2022.9939606</a>.","short":"M. Awais, M. Platzner, in: 2022 IFIP/IEEE 30th International Conference on Very Large Scale Integration (VLSI-SoC), IEEE, 2022.","chicago":"Awais, Muhammad, and Marco Platzner. “Automated Framework for Fast Synthesis of Approximate Hardware Accelerators.” In <i>2022 IFIP/IEEE 30th International Conference on Very Large Scale Integration (VLSI-SoC)</i>. IEEE, 2022. <a href=\"https://doi.org/10.1109/vlsi-soc54400.2022.9939606\">https://doi.org/10.1109/vlsi-soc54400.2022.9939606</a>."},"publication":"2022 IFIP/IEEE 30th International Conference on Very Large Scale Integration (VLSI-SoC)"},{"publication":"Proceedings of the German Microwave Conference (GeMiC)","citation":{"bibtex":"@inproceedings{Mager_Jürgenhake_Dumitrescu_2022, title={Efficient method for determining substrate parameters of additive manufactured spatial circuit carriers}, booktitle={Proceedings of the German Microwave Conference (GeMiC)}, author={Mager, Thomas and Jürgenhake, Christoph and Dumitrescu, Roman}, year={2022}, pages={224–227} }","ama":"Mager T, Jürgenhake C, Dumitrescu R. Efficient method for determining substrate parameters of additive manufactured spatial circuit carriers. In: <i>Proceedings of the German Microwave Conference (GeMiC)</i>. ; 2022:224-227.","mla":"Mager, Thomas, et al. “Efficient Method for Determining Substrate Parameters of Additive Manufactured Spatial Circuit Carriers.” <i>Proceedings of the German Microwave Conference (GeMiC)</i>, 2022, pp. 224–27.","short":"T. Mager, C. Jürgenhake, R. Dumitrescu, in: Proceedings of the German Microwave Conference (GeMiC), 2022, pp. 224–227.","chicago":"Mager, Thomas, Christoph Jürgenhake, and Roman Dumitrescu. “Efficient Method for Determining Substrate Parameters of Additive Manufactured Spatial Circuit Carriers.” In <i>Proceedings of the German Microwave Conference (GeMiC)</i>, 224–27, 2022.","ieee":"T. Mager, C. Jürgenhake, and R. Dumitrescu, “Efficient method for determining substrate parameters of additive manufactured spatial circuit carriers,” in <i>Proceedings of the German Microwave Conference (GeMiC)</i>, Ulm, 2022, pp. 224–227.","apa":"Mager, T., Jürgenhake, C., &#38; Dumitrescu, R. (2022). Efficient method for determining substrate parameters of additive manufactured spatial circuit carriers. <i>Proceedings of the German Microwave Conference (GeMiC)</i>, 224–227."},"date_created":"2026-02-19T11:13:35Z","type":"conference","department":[{"_id":"563"}],"title":"Efficient method for determining substrate parameters of additive manufactured spatial circuit carriers","year":"2022","status":"public","conference":{"name":"14th German Microwave Conference (GeMiC)","location":"Ulm"},"author":[{"first_name":"Thomas","last_name":"Mager","full_name":"Mager, Thomas"},{"full_name":"Jürgenhake, Christoph","last_name":"Jürgenhake","first_name":"Christoph"},{"first_name":"Roman","last_name":"Dumitrescu","full_name":"Dumitrescu, Roman","id":"16190"}],"date_updated":"2026-02-19T11:13:45Z","page":"224-227","_id":"64260","language":[{"iso":"eng"}],"user_id":"15782"},{"_id":"46305","publisher":"Association for Computing Machinery","page":"356–359","editor":[{"first_name":"J","last_name":"Fieldsend","full_name":"Fieldsend, J"},{"first_name":"M.","last_name":"Wagner","full_name":"Wagner, M."}],"user_id":"14972","status":"public","place":"New York, NY, USA","citation":{"short":"J. Rook, H. Trautmann, J. Bossek, C. Grimme, in: J. Fieldsend, M. Wagner (Eds.), Proceedings of the Genetic and Evolutionary Computation Conference Companion, Association for Computing Machinery, New York, NY, USA, 2022, pp. 356–359.","ama":"Rook J, Trautmann H, Bossek J, Grimme C. On the Potential of Automated Algorithm Configuration on Multi-Modal Multi-Objective Optimization Problems. In: Fieldsend J, Wagner M, eds. <i>Proceedings of the Genetic and Evolutionary Computation Conference Companion</i>. GECCO ’22. Association for Computing Machinery; 2022:356–359. doi:<a href=\"https://doi.org/10.1145/3520304.3528998\">10.1145/3520304.3528998</a>","chicago":"Rook, J, Heike Trautmann, Jakob Bossek, and C Grimme. “On the Potential of Automated Algorithm Configuration on Multi-Modal Multi-Objective Optimization Problems.” In <i>Proceedings of the Genetic and Evolutionary Computation Conference Companion</i>, edited by J Fieldsend and M. Wagner, 356–359. GECCO ’22. New York, NY, USA: Association for Computing Machinery, 2022. <a href=\"https://doi.org/10.1145/3520304.3528998\">https://doi.org/10.1145/3520304.3528998</a>.","bibtex":"@inproceedings{Rook_Trautmann_Bossek_Grimme_2022, place={New York, NY, USA}, series={GECCO ’22}, title={On the Potential of Automated Algorithm Configuration on Multi-Modal Multi-Objective Optimization Problems}, DOI={<a href=\"https://doi.org/10.1145/3520304.3528998\">10.1145/3520304.3528998</a>}, booktitle={Proceedings of the Genetic and Evolutionary Computation Conference Companion}, publisher={Association for Computing Machinery}, author={Rook, J and Trautmann, Heike and Bossek, Jakob and Grimme, C}, editor={Fieldsend, J and Wagner, M.}, year={2022}, pages={356–359}, collection={GECCO ’22} }","apa":"Rook, J., Trautmann, H., Bossek, J., &#38; Grimme, C. (2022). On the Potential of Automated Algorithm Configuration on Multi-Modal Multi-Objective Optimization Problems. In J. Fieldsend &#38; M. Wagner (Eds.), <i>Proceedings of the Genetic and Evolutionary Computation Conference Companion</i> (pp. 356–359). Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3520304.3528998\">https://doi.org/10.1145/3520304.3528998</a>","mla":"Rook, J., et al. “On the Potential of Automated Algorithm Configuration on Multi-Modal Multi-Objective Optimization Problems.” <i>Proceedings of the Genetic and Evolutionary Computation Conference Companion</i>, edited by J Fieldsend and M. Wagner, Association for Computing Machinery, 2022, pp. 356–359, doi:<a href=\"https://doi.org/10.1145/3520304.3528998\">10.1145/3520304.3528998</a>.","ieee":"J. Rook, H. Trautmann, J. Bossek, and C. Grimme, “On the Potential of Automated Algorithm Configuration on Multi-Modal Multi-Objective Optimization Problems,” in <i>Proceedings of the Genetic and Evolutionary Computation Conference Companion</i>, 2022, pp. 356–359, doi: <a href=\"https://doi.org/10.1145/3520304.3528998\">10.1145/3520304.3528998</a>."},"language":[{"iso":"eng"}],"series_title":"GECCO ’22","doi":"10.1145/3520304.3528998","author":[{"first_name":"J","last_name":"Rook","full_name":"Rook, J"},{"id":"100740","first_name":"Heike","last_name":"Trautmann","orcid":"0000-0002-9788-8282","full_name":"Trautmann, Heike"},{"full_name":"Bossek, Jakob","last_name":"Bossek","first_name":"Jakob","orcid":"0000-0002-4121-4668","id":"102979"},{"full_name":"Grimme, C","last_name":"Grimme","first_name":"C"}],"publication_identifier":{"isbn":["9781450392686"]},"title":"On the Potential of Automated Algorithm Configuration on Multi-Modal Multi-Objective Optimization Problems","year":"2022","date_updated":"2026-02-19T15:12:35Z","date_created":"2023-08-04T07:14:24Z","department":[{"_id":"34"},{"_id":"819"}],"type":"conference","publication":"Proceedings of the Genetic and Evolutionary Computation Conference Companion","abstract":[{"lang":"eng","text":"Hardness of Multi-Objective (MO) continuous optimization problems results from an interplay of various problem characteristics, e. g. the degree of multi-modality. We present a benchmark study of classical and diversity focused optimizers on multi-modal MO problems based on automated algorithm configuration. We show the large effect of the latter and investigate the trade-off between convergence in objective space and diversity in decision space."}]},{"publication_identifier":{"issn":["2511-0896","0947-0085"]},"author":[{"last_name":"Kharatyan","first_name":"Aschot","full_name":"Kharatyan, Aschot"},{"first_name":"Lynn","last_name":"Humpert","full_name":"Humpert, Lynn"},{"first_name":"Harald","last_name":"Anacker","full_name":"Anacker, Harald"},{"first_name":"Roman","last_name":"Dumitrescu","full_name":"Dumitrescu, Roman","id":"16190"},{"full_name":"Wäschle, Moritz","last_name":"Wäschle","first_name":"Moritz"},{"full_name":"Albers, Albert","last_name":"Albers","first_name":"Albert"},{"full_name":"Horstmeyer, Sarah","last_name":"Horstmeyer","first_name":"Sarah"}],"year":"2022","title":"Künstliche Intelligenz im Engineering","intvolume":"       117","publication_status":"published","date_updated":"2026-02-20T14:47:18Z","language":[{"iso":"eng"}],"alternative_title":["Menschorientiere Analyse von Potenzialen am Beispiel vom Sondermaschinenbau"],"doi":"10.1515/zwf-2022-1074","issue":"6","publication":"Zeitschrift für wirtschaftlichen Fabrikbetrieb","abstract":[{"text":"<jats:title>Abstract</jats:title>\r\n               <jats:p>Künstliche Intelligenz bietet großes Potenzial im Engineering. Der Einsatz gestattet insbesondere für Wissensarbeiter eine effiziente Arbeitsteilung, in der beispielsweise fehleranfällige und repetitive Aktivitäten unterstützt werden. Eine erfolgreiche Einführung bedarf einer vorangehenden Analyse von nutzenstiftenden Einsatzpotenzialen, bei der alle Anwendenden frühzeitig einbezogen werden. Der folgende Beitrag verdeutlicht dieses Vorgehen anhand eines realen Beispiels im Sondermaschinenbau.</jats:p>","lang":"eng"}],"date_created":"2026-02-19T11:20:48Z","department":[{"_id":"563"}],"type":"journal_article","status":"public","_id":"64264","publisher":"Walter de Gruyter GmbH","page":"427-431","volume":117,"user_id":"15782","citation":{"bibtex":"@article{Kharatyan_Humpert_Anacker_Dumitrescu_Wäschle_Albers_Horstmeyer_2022, title={Künstliche Intelligenz im Engineering}, volume={117}, DOI={<a href=\"https://doi.org/10.1515/zwf-2022-1074\">10.1515/zwf-2022-1074</a>}, number={6}, journal={Zeitschrift für wirtschaftlichen Fabrikbetrieb}, publisher={Walter de Gruyter GmbH}, author={Kharatyan, Aschot and Humpert, Lynn and Anacker, Harald and Dumitrescu, Roman and Wäschle, Moritz and Albers, Albert and Horstmeyer, Sarah}, year={2022}, pages={427–431} }","chicago":"Kharatyan, Aschot, Lynn Humpert, Harald Anacker, Roman Dumitrescu, Moritz Wäschle, Albert Albers, and Sarah Horstmeyer. “Künstliche Intelligenz Im Engineering.” <i>Zeitschrift Für Wirtschaftlichen Fabrikbetrieb</i> 117, no. 6 (2022): 427–31. <a href=\"https://doi.org/10.1515/zwf-2022-1074\">https://doi.org/10.1515/zwf-2022-1074</a>.","short":"A. Kharatyan, L. Humpert, H. Anacker, R. Dumitrescu, M. Wäschle, A. Albers, S. Horstmeyer, Zeitschrift Für Wirtschaftlichen Fabrikbetrieb 117 (2022) 427–431.","ama":"Kharatyan A, Humpert L, Anacker H, et al. Künstliche Intelligenz im Engineering. <i>Zeitschrift für wirtschaftlichen Fabrikbetrieb</i>. 2022;117(6):427-431. doi:<a href=\"https://doi.org/10.1515/zwf-2022-1074\">10.1515/zwf-2022-1074</a>","ieee":"A. Kharatyan <i>et al.</i>, “Künstliche Intelligenz im Engineering,” <i>Zeitschrift für wirtschaftlichen Fabrikbetrieb</i>, vol. 117, no. 6, pp. 427–431, 2022, doi: <a href=\"https://doi.org/10.1515/zwf-2022-1074\">10.1515/zwf-2022-1074</a>.","mla":"Kharatyan, Aschot, et al. “Künstliche Intelligenz Im Engineering.” <i>Zeitschrift Für Wirtschaftlichen Fabrikbetrieb</i>, vol. 117, no. 6, Walter de Gruyter GmbH, 2022, pp. 427–31, doi:<a href=\"https://doi.org/10.1515/zwf-2022-1074\">10.1515/zwf-2022-1074</a>.","apa":"Kharatyan, A., Humpert, L., Anacker, H., Dumitrescu, R., Wäschle, M., Albers, A., &#38; Horstmeyer, S. (2022). Künstliche Intelligenz im Engineering. <i>Zeitschrift Für Wirtschaftlichen Fabrikbetrieb</i>, <i>117</i>(6), 427–431. <a href=\"https://doi.org/10.1515/zwf-2022-1074\">https://doi.org/10.1515/zwf-2022-1074</a>"}},{"department":[{"_id":"563"}],"type":"journal_article","date_created":"2026-02-19T11:20:18Z","abstract":[{"lang":"eng","text":"<jats:title>Abstract</jats:title>\n               <jats:p>Künstliche Intelligenz bietet großes Potenzial im Engineering. Der Einsatz gestattet insbesondere für Wissensarbeiter eine effiziente Arbeitsteilung, in der beispielsweise fehleranfällige und repetitive Aktivitäten unterstützt werden. Eine erfolgreiche Einführung bedarf einer vorangehenden Analyse von nutzenstiftenden Einsatzpotenzialen, bei der alle Anwendenden frühzeitig einbezogen werden. Der folgende Beitrag verdeutlicht dieses Vorgehen anhand eines realen Beispiels im Sondermaschinenbau.</jats:p>"}],"issue":"6","publication":"Zeitschrift für wirtschaftlichen Fabrikbetrieb","alternative_title":["Menschorientiere Analyse von Potenzialen am Beispiel vom Sondermaschinenbau"],"doi":"10.1515/zwf-2022-1074","language":[{"iso":"eng"}],"intvolume":"       117","publication_status":"published","date_updated":"2026-02-20T14:47:28Z","author":[{"first_name":"Aschot","last_name":"Kharatyan","full_name":"Kharatyan, Aschot"},{"full_name":"Humpert, Lynn","first_name":"Lynn","last_name":"Humpert"},{"last_name":"Anacker","first_name":"Harald","full_name":"Anacker, Harald"},{"last_name":"Dumitrescu","first_name":"Roman","full_name":"Dumitrescu, Roman"},{"full_name":"Wäschle, Moritz","first_name":"Moritz","last_name":"Wäschle"},{"full_name":"Albers, Albert","last_name":"Albers","first_name":"Albert"},{"last_name":"Horstmeyer","first_name":"Sarah","full_name":"Horstmeyer, Sarah"}],"publication_identifier":{"issn":["2511-0896","0947-0085"]},"year":"2022","title":"Künstliche Intelligenz im Engineering","citation":{"ama":"Kharatyan A, Humpert L, Anacker H, et al. Künstliche Intelligenz im Engineering. <i>Zeitschrift für wirtschaftlichen Fabrikbetrieb</i>. 2022;117(6):427-431. doi:<a href=\"https://doi.org/10.1515/zwf-2022-1074\">10.1515/zwf-2022-1074</a>","bibtex":"@article{Kharatyan_Humpert_Anacker_Dumitrescu_Wäschle_Albers_Horstmeyer_2022, title={Künstliche Intelligenz im Engineering}, volume={117}, DOI={<a href=\"https://doi.org/10.1515/zwf-2022-1074\">10.1515/zwf-2022-1074</a>}, number={6}, journal={Zeitschrift für wirtschaftlichen Fabrikbetrieb}, publisher={Walter de Gruyter GmbH}, author={Kharatyan, Aschot and Humpert, Lynn and Anacker, Harald and Dumitrescu, Roman and Wäschle, Moritz and Albers, Albert and Horstmeyer, Sarah}, year={2022}, pages={427–431} }","mla":"Kharatyan, Aschot, et al. “Künstliche Intelligenz Im Engineering.” <i>Zeitschrift Für Wirtschaftlichen Fabrikbetrieb</i>, vol. 117, no. 6, Walter de Gruyter GmbH, 2022, pp. 427–31, doi:<a href=\"https://doi.org/10.1515/zwf-2022-1074\">10.1515/zwf-2022-1074</a>.","chicago":"Kharatyan, Aschot, Lynn Humpert, Harald Anacker, Roman Dumitrescu, Moritz Wäschle, Albert Albers, and Sarah Horstmeyer. “Künstliche Intelligenz Im Engineering.” <i>Zeitschrift Für Wirtschaftlichen Fabrikbetrieb</i> 117, no. 6 (2022): 427–31. <a href=\"https://doi.org/10.1515/zwf-2022-1074\">https://doi.org/10.1515/zwf-2022-1074</a>.","short":"A. Kharatyan, L. Humpert, H. Anacker, R. Dumitrescu, M. Wäschle, A. Albers, S. Horstmeyer, Zeitschrift Für Wirtschaftlichen Fabrikbetrieb 117 (2022) 427–431.","apa":"Kharatyan, A., Humpert, L., Anacker, H., Dumitrescu, R., Wäschle, M., Albers, A., &#38; Horstmeyer, S. (2022). Künstliche Intelligenz im Engineering. <i>Zeitschrift Für Wirtschaftlichen Fabrikbetrieb</i>, <i>117</i>(6), 427–431. <a href=\"https://doi.org/10.1515/zwf-2022-1074\">https://doi.org/10.1515/zwf-2022-1074</a>","ieee":"A. Kharatyan <i>et al.</i>, “Künstliche Intelligenz im Engineering,” <i>Zeitschrift für wirtschaftlichen Fabrikbetrieb</i>, vol. 117, no. 6, pp. 427–431, 2022, doi: <a href=\"https://doi.org/10.1515/zwf-2022-1074\">10.1515/zwf-2022-1074</a>."},"volume":117,"user_id":"15782","_id":"64263","publisher":"Walter de Gruyter GmbH","page":"427-431","status":"public"},{"publication_identifier":{"issn":["0928-8910","1573-7535"]},"author":[{"id":"60543","full_name":"Schubert, Philipp","first_name":"Philipp","last_name":"Schubert","orcid":"0000-0002-8674-1859"},{"last_name":"Gazzillo","first_name":"Paul","full_name":"Gazzillo, Paul"},{"last_name":"Patterson","first_name":"Zach","full_name":"Patterson, Zach"},{"last_name":"Braha","first_name":"Julian","full_name":"Braha, Julian"},{"id":"55745","first_name":"Fabian Benedikt","last_name":"Schiebel","orcid":"0009-0008-6867-9802","full_name":"Schiebel, Fabian Benedikt"},{"full_name":"Hermann, Ben","last_name":"Hermann","first_name":"Ben","orcid":"0000-0001-9848-2017","id":"66173"},{"full_name":"Wei, Shiyi","first_name":"Shiyi","last_name":"Wei"},{"id":"59256","full_name":"Bodden, Eric","orcid":"0000-0003-3470-3647","first_name":"Eric","last_name":"Bodden"}],"year":"2022","title":"Static data-flow analysis for software product lines in C","intvolume":"        29","article_type":"original","date_updated":"2025-12-04T10:42:38Z","publication_status":"published","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://link.springer.com/article/10.1007/s10515-022-00333-1","open_access":"1"}],"article_number":"35","alternative_title":["Revoking the preprocessor’s special role"],"doi":"10.1007/s10515-022-00333-1","issue":"1","publication":"Automated Software Engineering","abstract":[{"lang":"eng","text":"<jats:title>Abstract</jats:title><jats:p>Many critical codebases are written in C, and most of them use preprocessor directives to encode variability, effectively encoding software product lines. These preprocessor directives, however, challenge any static code analysis. SPLlift, a previously presented approach for analyzing software product lines, is limited to Java programs that use a rather simple feature encoding and to analysis problems with a finite and ideally small domain. Other approaches that allow the analysis of real-world C software product lines use special-purpose analyses, preventing the reuse of existing analysis infrastructures and ignoring the progress made by the static analysis community. This work presents <jats:sc>VarAlyzer</jats:sc>, a novel static analysis approach for software product lines. <jats:sc>VarAlyzer</jats:sc> first transforms preprocessor constructs to plain C while preserving their variability and semantics. It then solves any given distributive analysis problem on transformed product lines in a variability-aware manner. <jats:sc>VarAlyzer</jats:sc> ’s analysis results are annotated with feature constraints that encode in which configurations each result holds. Our experiments with 95 compilation units of OpenSSL show that applying <jats:sc>VarAlyzer</jats:sc> enables one to conduct inter-procedural, flow-, field- and context-sensitive data-flow analyses on entire product lines for the first time, outperforming the product-based approach for highly-configurable systems.</jats:p>"}],"date_created":"2022-03-25T07:41:26Z","department":[{"_id":"76"}],"type":"journal_article","keyword":["inter-procedural static analysis","software product lines","preprocessor","LLVM","C/C++"],"status":"public","_id":"30511","publisher":"Springer Science and Business Media LLC","volume":29,"user_id":"15249","citation":{"apa":"Schubert, P., Gazzillo, P., Patterson, Z., Braha, J., Schiebel, F. B., Hermann, B., Wei, S., &#38; Bodden, E. (2022). Static data-flow analysis for software product lines in C. <i>Automated Software Engineering</i>, <i>29</i>(1), Article 35. <a href=\"https://doi.org/10.1007/s10515-022-00333-1\">https://doi.org/10.1007/s10515-022-00333-1</a>","ieee":"P. Schubert <i>et al.</i>, “Static data-flow analysis for software product lines in C,” <i>Automated Software Engineering</i>, vol. 29, no. 1, Art. no. 35, 2022, doi: <a href=\"https://doi.org/10.1007/s10515-022-00333-1\">10.1007/s10515-022-00333-1</a>.","short":"P. Schubert, P. Gazzillo, Z. Patterson, J. Braha, F.B. Schiebel, B. Hermann, S. Wei, E. Bodden, Automated Software Engineering 29 (2022).","chicago":"Schubert, Philipp, Paul Gazzillo, Zach Patterson, Julian Braha, Fabian Benedikt Schiebel, Ben Hermann, Shiyi Wei, and Eric Bodden. “Static Data-Flow Analysis for Software Product Lines in C.” <i>Automated Software Engineering</i> 29, no. 1 (2022). <a href=\"https://doi.org/10.1007/s10515-022-00333-1\">https://doi.org/10.1007/s10515-022-00333-1</a>.","mla":"Schubert, Philipp, et al. “Static Data-Flow Analysis for Software Product Lines in C.” <i>Automated Software Engineering</i>, vol. 29, no. 1, 35, Springer Science and Business Media LLC, 2022, doi:<a href=\"https://doi.org/10.1007/s10515-022-00333-1\">10.1007/s10515-022-00333-1</a>.","ama":"Schubert P, Gazzillo P, Patterson Z, et al. Static data-flow analysis for software product lines in C. <i>Automated Software Engineering</i>. 2022;29(1). doi:<a href=\"https://doi.org/10.1007/s10515-022-00333-1\">10.1007/s10515-022-00333-1</a>","bibtex":"@article{Schubert_Gazzillo_Patterson_Braha_Schiebel_Hermann_Wei_Bodden_2022, title={Static data-flow analysis for software product lines in C}, volume={29}, DOI={<a href=\"https://doi.org/10.1007/s10515-022-00333-1\">10.1007/s10515-022-00333-1</a>}, number={135}, journal={Automated Software Engineering}, publisher={Springer Science and Business Media LLC}, author={Schubert, Philipp and Gazzillo, Paul and Patterson, Zach and Braha, Julian and Schiebel, Fabian Benedikt and Hermann, Ben and Wei, Shiyi and Bodden, Eric}, year={2022} }"},"project":[{"name":"SFB 901 - B4: SFB 901 - Subproject B4","_id":"12"},{"_id":"3","name":"SFB 901 - B: SFB 901 - Project Area B"},{"_id":"1","name":"SFB 901: SFB 901"}],"oa":"1"},{"citation":{"mla":"Schloots, Franziska Margarete. “‚Understand what’s happening within‘. Selbstkontrolle mit Personenwaage, Wearable und habit tracker.” <i>ffk Journal</i>, vol. 6, no. 7, 2022, pp. 74–91, doi:<a href=\"https://doi.org/10.25969/MEDIAREP/18238\">10.25969/MEDIAREP/18238</a>.","bibtex":"@article{Schloots_2022, title={‚Understand what’s happening within‘. Selbstkontrolle mit Personenwaage, Wearable und habit tracker}, volume={6}, DOI={<a href=\"https://doi.org/10.25969/MEDIAREP/18238\">10.25969/MEDIAREP/18238</a>}, number={7}, journal={ffk Journal}, author={Schloots, Franziska Margarete}, year={2022}, pages={74–91} }","ama":"Schloots FM. ‚Understand what’s happening within‘. Selbstkontrolle mit Personenwaage, Wearable und habit tracker. <i>ffk Journal</i>. 2022;6(7):74-91. doi:<a href=\"https://doi.org/10.25969/MEDIAREP/18238\">10.25969/MEDIAREP/18238</a>","ieee":"F. M. Schloots, “‚Understand what’s happening within‘. Selbstkontrolle mit Personenwaage, Wearable und habit tracker,” <i>ffk Journal</i>, vol. 6, no. 7, pp. 74–91, 2022, doi: <a href=\"https://doi.org/10.25969/MEDIAREP/18238\">10.25969/MEDIAREP/18238</a>.","apa":"Schloots, F. M. (2022). ‚Understand what’s happening within‘. Selbstkontrolle mit Personenwaage, Wearable und habit tracker. <i>ffk Journal</i>, <i>6</i>(7), 74–91. <a href=\"https://doi.org/10.25969/MEDIAREP/18238\">https://doi.org/10.25969/MEDIAREP/18238</a>","short":"F.M. Schloots, ffk Journal 6 (2022) 74–91.","chicago":"Schloots, Franziska Margarete. “‚Understand what’s happening within‘. Selbstkontrolle mit Personenwaage, Wearable und habit tracker.” <i>ffk Journal</i> 6, no. 7 (2022): 74–91. <a href=\"https://doi.org/10.25969/MEDIAREP/18238\">https://doi.org/10.25969/MEDIAREP/18238</a>."},"file_date_updated":"2022-12-20T14:23:57Z","volume":6,"ddc":["040"],"user_id":"33185","_id":"34614","page":"74-91","has_accepted_license":"1","status":"public","department":[{"_id":"574"}],"type":"journal_article","keyword":["self-tracking","Selbsttechnologien","Wearable","Bullet Journal","Personenwaage","Selbstvermessung"],"date_created":"2022-12-20T14:20:56Z","file":[{"content_type":"application/pdf","success":1,"file_id":"34616","access_level":"closed","file_size":530069,"file_name":"ffk_journal_07_74-91_Schloots_Selbstkontrolle_.pdf","date_updated":"2022-12-20T14:23:57Z","relation":"main_file","date_created":"2022-12-20T14:23:57Z","creator":"fms"}],"abstract":[{"lang":"ger","text":"Mit steigenden Optimierungsanforderungen an das Individuum wächst auch das indivi-\r\nduelle Bedürfnis nach Kontrolle. Dieses kann u. a. durch self tracking-Technologien erfüllt werden.\r\nAnhand von drei Fallbeispielen – der Personenwaage, dem Wearable und dem habit tracker – zeigt\r\ndieser Aufsatz, wie sich medienbasierte Selbsttechnologien im historischen Verlauf intensiviert und\r\nstärker in den Alltag integriert haben. Ein besonderer Fokus liegt dabei auf der Ambivalenz dieser\r\nMedien: Ermöglichen sie auf der einen Seite zwar eine Selbstkontrolle und stellen so potenziell sta-\r\nbilisierende Ressourcen für das Individuum dar, schaffen sie auf der anderen Seite auch neue\r\nAnforderungen, die es zu erfüllen gilt."}],"issue":"7","publication":"ffk Journal","doi":"10.25969/MEDIAREP/18238","language":[{"iso":"ger"}],"intvolume":"         6","article_type":"original","date_updated":"2024-11-22T10:09:55Z","publication_status":"published","author":[{"last_name":"Schloots","first_name":"Franziska Margarete","orcid":"0009-0008-9673-2615","full_name":"Schloots, Franziska Margarete","id":"33185"}],"title":"‚Understand what’s happening within‘. Selbstkontrolle mit Personenwaage, Wearable und habit tracker","year":"2022"},{"doi":"http://dx.doi.org/10.3233/FAIA220138","user_id":"3900","page":"21 - 31","_id":"32247","language":[{"iso":"eng"}],"date_updated":"2025-02-20T08:22:16Z","year":"2022","title":"Generating Contrastive Snippets for Argument Search","status":"public","author":[{"first_name":"Milad","last_name":"Alshomary","full_name":"Alshomary, Milad","id":"73059"},{"last_name":"Rieskamp","first_name":"Jonas","full_name":"Rieskamp, Jonas","id":"77643"},{"id":"3900","first_name":"Henning","last_name":"Wachsmuth","full_name":"Wachsmuth, Henning"}],"type":"conference","department":[{"_id":"600"},{"_id":"660"}],"date_created":"2022-06-28T09:03:30Z","project":[{"_id":"118","name":"TRR 318 - INF: TRR 318 - Project Area INF"}],"publication":"Proceedings of the 9th International Conference on Computational Models of Argument","citation":{"short":"M. Alshomary, J. Rieskamp, H. Wachsmuth, in: Proceedings of the 9th International Conference on Computational Models of Argument, 2022, pp. 21–31.","ama":"Alshomary M, Rieskamp J, Wachsmuth H. Generating Contrastive Snippets for Argument Search. In: <i>Proceedings of the 9th International Conference on Computational Models of Argument</i>. ; 2022:21-31. doi:<a href=\"http://dx.doi.org/10.3233/FAIA220138\">http://dx.doi.org/10.3233/FAIA220138</a>","chicago":"Alshomary, Milad, Jonas Rieskamp, and Henning Wachsmuth. “Generating Contrastive Snippets for Argument Search.” In <i>Proceedings of the 9th International Conference on Computational Models of Argument</i>, 21–31, 2022. <a href=\"http://dx.doi.org/10.3233/FAIA220138\">http://dx.doi.org/10.3233/FAIA220138</a>.","bibtex":"@inproceedings{Alshomary_Rieskamp_Wachsmuth_2022, title={Generating Contrastive Snippets for Argument Search}, DOI={<a href=\"http://dx.doi.org/10.3233/FAIA220138\">http://dx.doi.org/10.3233/FAIA220138</a>}, booktitle={Proceedings of the 9th International Conference on Computational Models of Argument}, author={Alshomary, Milad and Rieskamp, Jonas and Wachsmuth, Henning}, year={2022}, pages={21–31} }","mla":"Alshomary, Milad, et al. “Generating Contrastive Snippets for Argument Search.” <i>Proceedings of the 9th International Conference on Computational Models of Argument</i>, 2022, pp. 21–31, doi:<a href=\"http://dx.doi.org/10.3233/FAIA220138\">http://dx.doi.org/10.3233/FAIA220138</a>.","apa":"Alshomary, M., Rieskamp, J., &#38; Wachsmuth, H. (2022). Generating Contrastive Snippets for Argument Search. <i>Proceedings of the 9th International Conference on Computational Models of Argument</i>, 21–31. <a href=\"http://dx.doi.org/10.3233/FAIA220138\">http://dx.doi.org/10.3233/FAIA220138</a>","ieee":"M. Alshomary, J. Rieskamp, and H. Wachsmuth, “Generating Contrastive Snippets for Argument Search,” in <i>Proceedings of the 9th International Conference on Computational Models of Argument</i>, 2022, pp. 21–31, doi: <a href=\"http://dx.doi.org/10.3233/FAIA220138\">http://dx.doi.org/10.3233/FAIA220138</a>."}},{"project":[{"_id":"118","name":"TRR 318 - INF: TRR 318 - Project Area INF"}],"citation":{"bibtex":"@inproceedings{Alshomary_El Baff_Gurcke_Wachsmuth_2022, title={The Moral Debater: A Study on the Computational Generation of Morally Framed Arguments}, booktitle={Proceedings of the 60th Annual Meeting of the Association for Computational Linguistics}, author={Alshomary, Milad and El Baff, Roxanne and Gurcke, Timon and Wachsmuth, Henning}, year={2022}, pages={8782–8797} }","chicago":"Alshomary, Milad, Roxanne El Baff, Timon Gurcke, and Henning Wachsmuth. “The Moral Debater: A Study on the Computational Generation of Morally Framed Arguments.” In <i>Proceedings of the 60th Annual Meeting of the Association for Computational Linguistics</i>, 8782–97, 2022.","ama":"Alshomary M, El Baff R, Gurcke T, Wachsmuth H. The Moral Debater: A Study on the Computational Generation of Morally Framed Arguments. In: <i>Proceedings of the 60th Annual Meeting of the Association for Computational Linguistics</i>. ; 2022:8782-8797.","short":"M. Alshomary, R. El Baff, T. Gurcke, H. Wachsmuth, in: Proceedings of the 60th Annual Meeting of the Association for Computational Linguistics, 2022, pp. 8782–8797.","ieee":"M. Alshomary, R. El Baff, T. Gurcke, and H. Wachsmuth, “The Moral Debater: A Study on the Computational Generation of Morally Framed Arguments,” in <i>Proceedings of the 60th Annual Meeting of the Association for Computational Linguistics</i>, 2022, pp. 8782–8797.","apa":"Alshomary, M., El Baff, R., Gurcke, T., &#38; Wachsmuth, H. (2022). The Moral Debater: A Study on the Computational Generation of Morally Framed Arguments. <i>Proceedings of the 60th Annual Meeting of the Association for Computational Linguistics</i>, 8782–8797.","mla":"Alshomary, Milad, et al. “The Moral Debater: A Study on the Computational Generation of Morally Framed Arguments.” <i>Proceedings of the 60th Annual Meeting of the Association for Computational Linguistics</i>, 2022, pp. 8782–97."},"publication":"Proceedings of the 60th Annual Meeting of the Association for Computational Linguistics","department":[{"_id":"600"},{"_id":"660"}],"type":"conference","date_created":"2022-04-06T14:05:45Z","date_updated":"2025-02-20T08:22:46Z","author":[{"last_name":"Alshomary","first_name":"Milad","full_name":"Alshomary, Milad","id":"73059"},{"full_name":"El Baff, Roxanne","last_name":"El Baff","first_name":"Roxanne"},{"id":"52174","first_name":"Timon","last_name":"Gurcke","full_name":"Gurcke, Timon"},{"full_name":"Wachsmuth, Henning","last_name":"Wachsmuth","first_name":"Henning","id":"3900"}],"year":"2022","title":"The Moral Debater: A Study on the Computational Generation of Morally Framed Arguments","status":"public","user_id":"3900","language":[{"iso":"eng"}],"_id":"30840","page":"8782 - 8797"},{"page":"113-124","_id":"60369","publisher":"Wiley","user_id":"117512","volume":41,"status":"public","citation":{"mla":"Schmidt, Patrick, et al. “TinyAD: Automatic Differentiation in Geometry Processing Made Simple.” <i>Computer Graphics Forum</i>, vol. 41, no. 5, Wiley, 2022, pp. 113–24, doi:<a href=\"https://doi.org/10.1111/cgf.14607\">10.1111/cgf.14607</a>.","apa":"Schmidt, P., Born, J., Bommes, D., Campen, M., &#38; Kobbelt, L. (2022). TinyAD: Automatic Differentiation in Geometry Processing Made Simple. <i>Computer Graphics Forum</i>, <i>41</i>(5), 113–124. <a href=\"https://doi.org/10.1111/cgf.14607\">https://doi.org/10.1111/cgf.14607</a>","ieee":"P. Schmidt, J. Born, D. Bommes, M. Campen, and L. Kobbelt, “TinyAD: Automatic Differentiation in Geometry Processing Made Simple,” <i>Computer Graphics Forum</i>, vol. 41, no. 5, pp. 113–124, 2022, doi: <a href=\"https://doi.org/10.1111/cgf.14607\">10.1111/cgf.14607</a>.","chicago":"Schmidt, Patrick, Janis Born, David Bommes, Marcel Campen, and Leif Kobbelt. “TinyAD: Automatic Differentiation in Geometry Processing Made Simple.” <i>Computer Graphics Forum</i> 41, no. 5 (2022): 113–24. <a href=\"https://doi.org/10.1111/cgf.14607\">https://doi.org/10.1111/cgf.14607</a>.","short":"P. Schmidt, J. Born, D. Bommes, M. Campen, L. Kobbelt, Computer Graphics Forum 41 (2022) 113–124.","ama":"Schmidt P, Born J, Bommes D, Campen M, Kobbelt L. TinyAD: Automatic Differentiation in Geometry Processing Made Simple. <i>Computer Graphics Forum</i>. 2022;41(5):113-124. doi:<a href=\"https://doi.org/10.1111/cgf.14607\">10.1111/cgf.14607</a>","bibtex":"@article{Schmidt_Born_Bommes_Campen_Kobbelt_2022, title={TinyAD: Automatic Differentiation in Geometry Processing Made Simple}, volume={41}, DOI={<a href=\"https://doi.org/10.1111/cgf.14607\">10.1111/cgf.14607</a>}, number={5}, journal={Computer Graphics Forum}, publisher={Wiley}, author={Schmidt, Patrick and Born, Janis and Bommes, David and Campen, Marcel and Kobbelt, Leif}, year={2022}, pages={113–124} }"},"language":[{"iso":"eng"}],"doi":"10.1111/cgf.14607","year":"2022","title":"TinyAD: Automatic Differentiation in Geometry Processing Made Simple","publication_identifier":{"issn":["0167-7055","1467-8659"]},"author":[{"full_name":"Schmidt, Patrick","last_name":"Schmidt","first_name":"Patrick"},{"full_name":"Born, Janis","first_name":"Janis","last_name":"Born"},{"full_name":"Bommes, David","last_name":"Bommes","first_name":"David"},{"first_name":"Marcel","last_name":"Campen","orcid":"0000-0003-2340-3462","full_name":"Campen, Marcel","id":"114904"},{"full_name":"Kobbelt, Leif","last_name":"Kobbelt","first_name":"Leif"}],"publication_status":"published","date_updated":"2025-07-14T12:47:14Z","intvolume":"        41","date_created":"2025-06-25T09:02:28Z","type":"journal_article","department":[{"_id":"969"}],"publication":"Computer Graphics Forum","issue":"5","extern":"1","abstract":[{"text":"<jats:title>Abstract</jats:title><jats:p>Non‐linear optimization is essential to many areas of geometry processing research. However, when experimenting with different problem formulations or when prototyping new algorithms, a major practical obstacle is the need to figure out derivatives of objective functions, especially when second‐order derivatives are required. Deriving and manually implementing gradients and Hessians is both time‐consuming and error‐prone. Automatic differentiation techniques address this problem, but can introduce a diverse set of obstacles themselves, e.g. limiting the set of supported language features, imposing restrictions on a program's control flow, incurring a significant run time overhead, or making it hard to exploit sparsity patterns common in geometry processing. We show that for many geometric problems, in particular on meshes, the simplest form of forward‐mode automatic differentiation is not only the most flexible, but also actually the most efficient choice. We introduce TinyAD: a lightweight C++ library that automatically computes gradients and Hessians, in particular of sparse problems, by differentiating small (tiny) sub‐problems. Its simplicity enables easy integration; no restrictions on, e.g., looping and branching are imposed. TinyAD provides the basic ingredients to quickly implement first and second order Newton‐style solvers, allowing for flexible adjustment of both problem formulations and solver details. By showcasing compact implementations of methods from parametrization, deformation, and direction field design, we demonstrate how TinyAD lowers the barrier to exploring non‐linear optimization techniques. This enables not only fast prototyping of new research ideas, but also improves replicability of existing algorithms in geometry processing. TinyAD is available to the community as an open source library.</jats:p>","lang":"eng"}]},{"citation":{"bibtex":"@article{Shen_Zhu_Capouellez_Panozzo_Campen_Zorin_2022, title={Which cross fields can be quadrangulated?}, volume={41}, DOI={<a href=\"https://doi.org/10.1145/3528223.3530187\">10.1145/3528223.3530187</a>}, number={4}, journal={ACM Transactions on Graphics}, publisher={Association for Computing Machinery (ACM)}, author={Shen, Hanxiao and Zhu, Leyi and Capouellez, Ryan and Panozzo, Daniele and Campen, Marcel and Zorin, Denis}, year={2022}, pages={1–12} }","chicago":"Shen, Hanxiao, Leyi Zhu, Ryan Capouellez, Daniele Panozzo, Marcel Campen, and Denis Zorin. “Which Cross Fields Can Be Quadrangulated?” <i>ACM Transactions on Graphics</i> 41, no. 4 (2022): 1–12. <a href=\"https://doi.org/10.1145/3528223.3530187\">https://doi.org/10.1145/3528223.3530187</a>.","ama":"Shen H, Zhu L, Capouellez R, Panozzo D, Campen M, Zorin D. Which cross fields can be quadrangulated? <i>ACM Transactions on Graphics</i>. 2022;41(4):1-12. doi:<a href=\"https://doi.org/10.1145/3528223.3530187\">10.1145/3528223.3530187</a>","short":"H. Shen, L. Zhu, R. Capouellez, D. Panozzo, M. Campen, D. Zorin, ACM Transactions on Graphics 41 (2022) 1–12.","ieee":"H. Shen, L. Zhu, R. Capouellez, D. Panozzo, M. Campen, and D. Zorin, “Which cross fields can be quadrangulated?,” <i>ACM Transactions on Graphics</i>, vol. 41, no. 4, pp. 1–12, 2022, doi: <a href=\"https://doi.org/10.1145/3528223.3530187\">10.1145/3528223.3530187</a>.","apa":"Shen, H., Zhu, L., Capouellez, R., Panozzo, D., Campen, M., &#38; Zorin, D. (2022). Which cross fields can be quadrangulated? <i>ACM Transactions on Graphics</i>, <i>41</i>(4), 1–12. <a href=\"https://doi.org/10.1145/3528223.3530187\">https://doi.org/10.1145/3528223.3530187</a>","mla":"Shen, Hanxiao, et al. “Which Cross Fields Can Be Quadrangulated?” <i>ACM Transactions on Graphics</i>, vol. 41, no. 4, Association for Computing Machinery (ACM), 2022, pp. 1–12, doi:<a href=\"https://doi.org/10.1145/3528223.3530187\">10.1145/3528223.3530187</a>."},"status":"public","volume":41,"user_id":"117512","publisher":"Association for Computing Machinery (ACM)","_id":"60371","page":"1-12","abstract":[{"text":"<jats:p>We describe a method for the generation of seamless surface parametrizations with guaranteed local injectivity and full control over holonomy. Previous methods guarantee only one of the two. Local injectivity is required to enable these parametrizations' use in applications such as surface quadrangulation and spline construction. Holonomy control is crucial to enable guidance or prescription of the parametrization's isocurves based on directional information, in particular from cross-fields or feature curves, and more generally to constrain the parametrization topologically. To this end we investigate the relation between cross-field topology and seamless parametrization topology. Leveraging previous results on locally injective parametrization and combining them with insights on this relation in terms of holonomy, we propose an algorithm that meets these requirements. A key component relies on the insight that arbitrary surface cut graphs, as required for global parametrization, can be homeomorphically modified to assume almost any set of turning numbers with respect to a given target cross-field.</jats:p>","lang":"eng"}],"extern":"1","publication":"ACM Transactions on Graphics","issue":"4","department":[{"_id":"969"}],"type":"journal_article","date_created":"2025-06-25T09:05:57Z","intvolume":"        41","date_updated":"2025-07-14T12:47:19Z","publication_status":"published","publication_identifier":{"issn":["0730-0301","1557-7368"]},"author":[{"last_name":"Shen","first_name":"Hanxiao","full_name":"Shen, Hanxiao"},{"first_name":"Leyi","last_name":"Zhu","full_name":"Zhu, Leyi"},{"full_name":"Capouellez, Ryan","first_name":"Ryan","last_name":"Capouellez"},{"full_name":"Panozzo, Daniele","first_name":"Daniele","last_name":"Panozzo"},{"id":"114904","orcid":"0000-0003-2340-3462","last_name":"Campen","first_name":"Marcel","full_name":"Campen, Marcel"},{"last_name":"Zorin","first_name":"Denis","full_name":"Zorin, Denis"}],"year":"2022","title":"Which cross fields can be quadrangulated?","alternative_title":["global parameterization from prescribed holonomy signatures"],"doi":"10.1145/3528223.3530187","language":[{"iso":"eng"}]},{"citation":{"short":"H. Brückler, O. Gupta, M. Mandad, M. Campen, Computer Graphics Forum 41 (2022) 221–235.","chicago":"Brückler, Hendrik, Ojaswi Gupta, Manish Mandad, and Marcel Campen. “The 3D Motorcycle Complex for Structured Volume Decomposition.” <i>Computer Graphics Forum</i> 41, no. 2 (2022): 221–35. <a href=\"https://doi.org/10.1111/cgf.14470\">https://doi.org/10.1111/cgf.14470</a>.","apa":"Brückler, H., Gupta, O., Mandad, M., &#38; Campen, M. (2022). The 3D Motorcycle Complex for Structured Volume Decomposition. <i>Computer Graphics Forum</i>, <i>41</i>(2), 221–235. <a href=\"https://doi.org/10.1111/cgf.14470\">https://doi.org/10.1111/cgf.14470</a>","ieee":"H. Brückler, O. Gupta, M. Mandad, and M. Campen, “The 3D Motorcycle Complex for Structured Volume Decomposition,” <i>Computer Graphics Forum</i>, vol. 41, no. 2, pp. 221–235, 2022, doi: <a href=\"https://doi.org/10.1111/cgf.14470\">10.1111/cgf.14470</a>.","ama":"Brückler H, Gupta O, Mandad M, Campen M. The 3D Motorcycle Complex for Structured Volume Decomposition. <i>Computer Graphics Forum</i>. 2022;41(2):221-235. doi:<a href=\"https://doi.org/10.1111/cgf.14470\">10.1111/cgf.14470</a>","bibtex":"@article{Brückler_Gupta_Mandad_Campen_2022, title={The 3D Motorcycle Complex for Structured Volume Decomposition}, volume={41}, DOI={<a href=\"https://doi.org/10.1111/cgf.14470\">10.1111/cgf.14470</a>}, number={2}, journal={Computer Graphics Forum}, publisher={Wiley}, author={Brückler, Hendrik and Gupta, Ojaswi and Mandad, Manish and Campen, Marcel}, year={2022}, pages={221–235} }","mla":"Brückler, Hendrik, et al. “The 3D Motorcycle Complex for Structured Volume Decomposition.” <i>Computer Graphics Forum</i>, vol. 41, no. 2, Wiley, 2022, pp. 221–35, doi:<a href=\"https://doi.org/10.1111/cgf.14470\">10.1111/cgf.14470</a>."},"user_id":"117512","volume":41,"page":"221-235","_id":"60366","publisher":"Wiley","status":"public","type":"journal_article","department":[{"_id":"969"}],"date_created":"2025-06-25T08:52:53Z","abstract":[{"text":"<jats:title>Abstract</jats:title><jats:p>The so‐called motorcycle graph has been employed in recent years for various purposes in the context of structured and aligned block decomposition of 2D shapes and 2‐manifold surfaces. Applications are in the fields of surface parametrization, spline space construction, semi‐structured quad mesh generation, or geometry data compression. We describe a generalization of this motorcycle graph concept to the three‐dimensional volumetric setting. Through careful extensions aware of topological intricacies of this higher‐dimensional setting, we are able to guarantee important block decomposition properties also in this case. We describe algorithms for the construction of this 3D motorcycle complex on the basis of either hexahedral meshes or seamless volumetric parametrizations. Its utility is illustrated on examples in hexahedral mesh generation and volumetric T‐spline construction.</jats:p>","lang":"eng"}],"extern":"1","issue":"2","publication":"Computer Graphics Forum","doi":"10.1111/cgf.14470","language":[{"iso":"eng"}],"date_updated":"2025-07-14T12:47:02Z","publication_status":"published","intvolume":"        41","title":"The 3D Motorcycle Complex for Structured Volume Decomposition","year":"2022","author":[{"id":"115694","first_name":"Hendrik","last_name":"Brückler","full_name":"Brückler, Hendrik"},{"first_name":"Ojaswi","last_name":"Gupta","full_name":"Gupta, Ojaswi"},{"last_name":"Mandad","first_name":"Manish","full_name":"Mandad, Manish"},{"id":"114904","full_name":"Campen, Marcel","orcid":"0000-0003-2340-3462","first_name":"Marcel","last_name":"Campen"}],"publication_identifier":{"issn":["0167-7055","1467-8659"]}},{"title":"Rational Bézier Guarding","year":"2022","author":[{"full_name":"Khanteimouri, Payam","last_name":"Khanteimouri","first_name":"Payam"},{"first_name":"Manish","last_name":"Mandad","full_name":"Mandad, Manish"},{"full_name":"Campen, Marcel","first_name":"Marcel","last_name":"Campen","orcid":"0000-0003-2340-3462","id":"114904"}],"publication_identifier":{"issn":["0167-7055","1467-8659"]},"date_updated":"2025-07-14T12:46:58Z","publication_status":"published","intvolume":"        41","language":[{"iso":"eng"}],"doi":"10.1111/cgf.14605","issue":"5","publication":"Computer Graphics Forum","abstract":[{"lang":"eng","text":"<jats:title>Abstract</jats:title><jats:p>We present a reliable method to generate planar meshes of nonlinear rational triangular elements. The elements are guaranteed to be valid, i.e. defined by injective rational functions. The mesh is guaranteed to conform exactly, without geometric error, to arbitrary rational domain boundary and feature curves. The method generalizes the recent Bézier Guarding technique, which is applicable only to polynomial curves and elements. This generalization enables the accurate handling of practically important cases involving, for instance, circular or elliptic arcs and NURBS curves, which cannot be matched by polynomial elements. Furthermore, although many practical scenarios are concerned with rational functions of quadratic and cubic degree only, our method is fully general and supports arbitrary degree. We demonstrate the method on a variety of test cases.</jats:p>"}],"extern":"1","date_created":"2025-06-25T08:56:35Z","type":"journal_article","department":[{"_id":"969"}],"status":"public","page":"89-99","publisher":"Wiley","_id":"60368","user_id":"117512","volume":41,"citation":{"short":"P. Khanteimouri, M. Mandad, M. Campen, Computer Graphics Forum 41 (2022) 89–99.","chicago":"Khanteimouri, Payam, Manish Mandad, and Marcel Campen. “Rational Bézier Guarding.” <i>Computer Graphics Forum</i> 41, no. 5 (2022): 89–99. <a href=\"https://doi.org/10.1111/cgf.14605\">https://doi.org/10.1111/cgf.14605</a>.","apa":"Khanteimouri, P., Mandad, M., &#38; Campen, M. (2022). Rational Bézier Guarding. <i>Computer Graphics Forum</i>, <i>41</i>(5), 89–99. <a href=\"https://doi.org/10.1111/cgf.14605\">https://doi.org/10.1111/cgf.14605</a>","ieee":"P. Khanteimouri, M. Mandad, and M. Campen, “Rational Bézier Guarding,” <i>Computer Graphics Forum</i>, vol. 41, no. 5, pp. 89–99, 2022, doi: <a href=\"https://doi.org/10.1111/cgf.14605\">10.1111/cgf.14605</a>.","ama":"Khanteimouri P, Mandad M, Campen M. Rational Bézier Guarding. <i>Computer Graphics Forum</i>. 2022;41(5):89-99. doi:<a href=\"https://doi.org/10.1111/cgf.14605\">10.1111/cgf.14605</a>","bibtex":"@article{Khanteimouri_Mandad_Campen_2022, title={Rational Bézier Guarding}, volume={41}, DOI={<a href=\"https://doi.org/10.1111/cgf.14605\">10.1111/cgf.14605</a>}, number={5}, journal={Computer Graphics Forum}, publisher={Wiley}, author={Khanteimouri, Payam and Mandad, Manish and Campen, Marcel}, year={2022}, pages={89–99} }","mla":"Khanteimouri, Payam, et al. “Rational Bézier Guarding.” <i>Computer Graphics Forum</i>, vol. 41, no. 5, Wiley, 2022, pp. 89–99, doi:<a href=\"https://doi.org/10.1111/cgf.14605\">10.1111/cgf.14605</a>."}},{"citation":{"mla":"Mandad, Manish, et al. “Intrinsic Mixed-Integer Polycubes for Hexahedral Meshing.” <i>Computer Aided Geometric Design</i>, vol. 94, 102078, Elsevier BV, 2022, doi:<a href=\"https://doi.org/10.1016/j.cagd.2022.102078\">10.1016/j.cagd.2022.102078</a>.","ama":"Mandad M, Chen R, Bommes D, Campen M. Intrinsic mixed-integer polycubes for hexahedral meshing. <i>Computer Aided Geometric Design</i>. 2022;94. doi:<a href=\"https://doi.org/10.1016/j.cagd.2022.102078\">10.1016/j.cagd.2022.102078</a>","bibtex":"@article{Mandad_Chen_Bommes_Campen_2022, title={Intrinsic mixed-integer polycubes for hexahedral meshing}, volume={94}, DOI={<a href=\"https://doi.org/10.1016/j.cagd.2022.102078\">10.1016/j.cagd.2022.102078</a>}, number={102078}, journal={Computer Aided Geometric Design}, publisher={Elsevier BV}, author={Mandad, Manish and Chen, Ruizhi and Bommes, David and Campen, Marcel}, year={2022} }","apa":"Mandad, M., Chen, R., Bommes, D., &#38; Campen, M. (2022). Intrinsic mixed-integer polycubes for hexahedral meshing. <i>Computer Aided Geometric Design</i>, <i>94</i>, Article 102078. <a href=\"https://doi.org/10.1016/j.cagd.2022.102078\">https://doi.org/10.1016/j.cagd.2022.102078</a>","ieee":"M. Mandad, R. Chen, D. Bommes, and M. Campen, “Intrinsic mixed-integer polycubes for hexahedral meshing,” <i>Computer Aided Geometric Design</i>, vol. 94, Art. no. 102078, 2022, doi: <a href=\"https://doi.org/10.1016/j.cagd.2022.102078\">10.1016/j.cagd.2022.102078</a>.","chicago":"Mandad, Manish, Ruizhi Chen, David Bommes, and Marcel Campen. “Intrinsic Mixed-Integer Polycubes for Hexahedral Meshing.” <i>Computer Aided Geometric Design</i> 94 (2022). <a href=\"https://doi.org/10.1016/j.cagd.2022.102078\">https://doi.org/10.1016/j.cagd.2022.102078</a>.","short":"M. Mandad, R. Chen, D. Bommes, M. Campen, Computer Aided Geometric Design 94 (2022)."},"_id":"60363","publisher":"Elsevier BV","user_id":"117512","volume":94,"status":"public","date_created":"2025-06-25T08:44:09Z","type":"journal_article","department":[{"_id":"969"}],"publication":"Computer Aided Geometric Design","extern":"1","article_number":"102078","language":[{"iso":"eng"}],"doi":"10.1016/j.cagd.2022.102078","year":"2022","title":"Intrinsic mixed-integer polycubes for hexahedral meshing","publication_identifier":{"issn":["0167-8396"]},"author":[{"first_name":"Manish","last_name":"Mandad","full_name":"Mandad, Manish"},{"full_name":"Chen, Ruizhi","first_name":"Ruizhi","last_name":"Chen"},{"full_name":"Bommes, David","last_name":"Bommes","first_name":"David"},{"full_name":"Campen, Marcel","first_name":"Marcel","orcid":"0000-0003-2340-3462","last_name":"Campen","id":"114904"}],"date_updated":"2025-07-14T12:47:12Z","publication_status":"published","intvolume":"        94"},{"doi":"10.1016/j.cagd.2022.102085","language":[{"iso":"eng"}],"article_number":"102085","intvolume":"        95","publication_status":"published","date_updated":"2025-07-14T12:47:05Z","author":[{"id":"116615","first_name":"Steffen","last_name":"Hinderink","full_name":"Hinderink, Steffen"},{"full_name":"Mandad, Manish","first_name":"Manish","last_name":"Mandad"},{"id":"114904","orcid":"0000-0003-2340-3462","first_name":"Marcel","last_name":"Campen","full_name":"Campen, Marcel"}],"publication_identifier":{"issn":["0167-8396"]},"year":"2022","title":"Angle-bounded 2D mesh simplification","department":[{"_id":"969"}],"type":"journal_article","date_created":"2025-06-25T08:50:14Z","extern":"1","publication":"Computer Aided Geometric Design","volume":95,"user_id":"117512","_id":"60365","publisher":"Elsevier BV","status":"public","citation":{"ama":"Hinderink S, Mandad M, Campen M. Angle-bounded 2D mesh simplification. <i>Computer Aided Geometric Design</i>. 2022;95. doi:<a href=\"https://doi.org/10.1016/j.cagd.2022.102085\">10.1016/j.cagd.2022.102085</a>","short":"S. Hinderink, M. Mandad, M. Campen, Computer Aided Geometric Design 95 (2022).","chicago":"Hinderink, Steffen, Manish Mandad, and Marcel Campen. “Angle-Bounded 2D Mesh Simplification.” <i>Computer Aided Geometric Design</i> 95 (2022). <a href=\"https://doi.org/10.1016/j.cagd.2022.102085\">https://doi.org/10.1016/j.cagd.2022.102085</a>.","bibtex":"@article{Hinderink_Mandad_Campen_2022, title={Angle-bounded 2D mesh simplification}, volume={95}, DOI={<a href=\"https://doi.org/10.1016/j.cagd.2022.102085\">10.1016/j.cagd.2022.102085</a>}, number={102085}, journal={Computer Aided Geometric Design}, publisher={Elsevier BV}, author={Hinderink, Steffen and Mandad, Manish and Campen, Marcel}, year={2022} }","mla":"Hinderink, Steffen, et al. “Angle-Bounded 2D Mesh Simplification.” <i>Computer Aided Geometric Design</i>, vol. 95, 102085, Elsevier BV, 2022, doi:<a href=\"https://doi.org/10.1016/j.cagd.2022.102085\">10.1016/j.cagd.2022.102085</a>.","apa":"Hinderink, S., Mandad, M., &#38; Campen, M. (2022). Angle-bounded 2D mesh simplification. <i>Computer Aided Geometric Design</i>, <i>95</i>, Article 102085. <a href=\"https://doi.org/10.1016/j.cagd.2022.102085\">https://doi.org/10.1016/j.cagd.2022.102085</a>","ieee":"S. Hinderink, M. Mandad, and M. Campen, “Angle-bounded 2D mesh simplification,” <i>Computer Aided Geometric Design</i>, vol. 95, Art. no. 102085, 2022, doi: <a href=\"https://doi.org/10.1016/j.cagd.2022.102085\">10.1016/j.cagd.2022.102085</a>."}},{"extern":"1","abstract":[{"text":"<jats:p>Developments in the field of parametrization-based quad mesh generation on surfaces have been impactful over the past decade. In this context, an important advance has been the replacement of error-prone rounding in the generation of integer-grid maps, by robust quantization methods. In parallel, parametrization-based hex mesh generation for volumes has been advanced. In this volumetric context, however, the state-of-the-art still relies on fragile rounding, not rarely producing defective meshes, especially when targeting a coarse mesh resolution. We present a method to robustly quantize volume parametrizations, i.e., to determine guaranteed valid choices of integers for 3D integer-grid maps. Inspired by the 2D case, we base our construction on a non-conforming cell decomposition of the volume, a 3D analogue of a T-mesh. In particular, we leverage the motorcycle complex, a recent generalization of the motorcycle graph, for this purpose. Integer values are expressed in a differential manner on the edges of this complex, enabling the efficient formulation of the conditions required to strictly prevent forcing the map into degeneration. Applying our method in the context of hexahedral meshing, we demonstrate that hexahedral meshes can be generated with significantly improved flexibility.</jats:p>","lang":"eng"}],"issue":"4","publication":"ACM Transactions on Graphics","department":[{"_id":"969"}],"type":"journal_article","date_created":"2025-06-25T09:07:20Z","intvolume":"        41","publication_status":"published","date_updated":"2025-07-14T12:47:23Z","author":[{"id":"115694","last_name":"Brückler","first_name":"Hendrik","full_name":"Brückler, Hendrik"},{"last_name":"Bommes","first_name":"David","full_name":"Bommes, David"},{"full_name":"Campen, Marcel","last_name":"Campen","orcid":"0000-0003-2340-3462","first_name":"Marcel","id":"114904"}],"publication_identifier":{"issn":["0730-0301","1557-7368"]},"year":"2022","title":"Volume parametrization quantization for hexahedral meshing","doi":"10.1145/3528223.3530123","language":[{"iso":"eng"}],"citation":{"apa":"Brückler, H., Bommes, D., &#38; Campen, M. (2022). Volume parametrization quantization for hexahedral meshing. <i>ACM Transactions on Graphics</i>, <i>41</i>(4), 1–19. <a href=\"https://doi.org/10.1145/3528223.3530123\">https://doi.org/10.1145/3528223.3530123</a>","ieee":"H. Brückler, D. Bommes, and M. Campen, “Volume parametrization quantization for hexahedral meshing,” <i>ACM Transactions on Graphics</i>, vol. 41, no. 4, pp. 1–19, 2022, doi: <a href=\"https://doi.org/10.1145/3528223.3530123\">10.1145/3528223.3530123</a>.","short":"H. Brückler, D. Bommes, M. Campen, ACM Transactions on Graphics 41 (2022) 1–19.","chicago":"Brückler, Hendrik, David Bommes, and Marcel Campen. “Volume Parametrization Quantization for Hexahedral Meshing.” <i>ACM Transactions on Graphics</i> 41, no. 4 (2022): 1–19. <a href=\"https://doi.org/10.1145/3528223.3530123\">https://doi.org/10.1145/3528223.3530123</a>.","mla":"Brückler, Hendrik, et al. “Volume Parametrization Quantization for Hexahedral Meshing.” <i>ACM Transactions on Graphics</i>, vol. 41, no. 4, Association for Computing Machinery (ACM), 2022, pp. 1–19, doi:<a href=\"https://doi.org/10.1145/3528223.3530123\">10.1145/3528223.3530123</a>.","ama":"Brückler H, Bommes D, Campen M. Volume parametrization quantization for hexahedral meshing. <i>ACM Transactions on Graphics</i>. 2022;41(4):1-19. doi:<a href=\"https://doi.org/10.1145/3528223.3530123\">10.1145/3528223.3530123</a>","bibtex":"@article{Brückler_Bommes_Campen_2022, title={Volume parametrization quantization for hexahedral meshing}, volume={41}, DOI={<a href=\"https://doi.org/10.1145/3528223.3530123\">10.1145/3528223.3530123</a>}, number={4}, journal={ACM Transactions on Graphics}, publisher={Association for Computing Machinery (ACM)}, author={Brückler, Hendrik and Bommes, David and Campen, Marcel}, year={2022}, pages={1–19} }"},"status":"public","volume":41,"user_id":"117512","publisher":"Association for Computing Machinery (ACM)","_id":"60372","page":"1-19"}]