[{"citation":{"ieee":"C. Stransky <i>et al.</i>, “Lessons Learned from Using an Online Platform to Conduct Large-Scale, Online Controlled Security Experiments with Software Developers,” in <i>10th USENIX Workshop on Cyber Security Experimentation and Test, CSET 2017, Vancouver, BC, Canada, August 14, 2017</i>, 2017.","apa":"Stransky, C., Acar, Y., Nguyen, D. C., Wermke, D., Kim, D., Redmiles, E. M., Backes, M., Garfinkel, S. L., Mazurek, M. L., &#38; Fahl, S. (2017). Lessons Learned from Using an Online Platform to Conduct Large-Scale, Online Controlled Security Experiments with Software Developers. In J. M. Fernandez &#38; M. Payer (Eds.), <i>10th USENIX Workshop on Cyber Security Experimentation and Test, CSET 2017, Vancouver, BC, Canada, August 14, 2017</i>. USENIX Association.","chicago":"Stransky, Christian, Yasemin Acar, Duc Cuong Nguyen, Dominik Wermke, Doowon Kim, Elissa M. Redmiles, Michael Backes, Simson L. Garfinkel, Michelle L. Mazurek, and Sascha Fahl. “Lessons Learned from Using an Online Platform to Conduct Large-Scale, Online Controlled Security Experiments with Software Developers.” In <i>10th USENIX Workshop on Cyber Security Experimentation and Test, CSET 2017, Vancouver, BC, Canada, August 14, 2017</i>, edited by José M. Fernandez and Mathias Payer. USENIX Association, 2017.","short":"C. Stransky, Y. Acar, D.C. Nguyen, D. Wermke, D. Kim, E.M. Redmiles, M. Backes, S.L. Garfinkel, M.L. Mazurek, S. Fahl, in: J.M. Fernandez, M. Payer (Eds.), 10th USENIX Workshop on Cyber Security Experimentation and Test, CSET 2017, Vancouver, BC, Canada, August 14, 2017, USENIX Association, 2017.","mla":"Stransky, Christian, et al. “Lessons Learned from Using an Online Platform to Conduct Large-Scale, Online Controlled Security Experiments with Software Developers.” <i>10th USENIX Workshop on Cyber Security Experimentation and Test, CSET 2017, Vancouver, BC, Canada, August 14, 2017</i>, edited by José M. Fernandez and Mathias Payer, USENIX Association, 2017.","bibtex":"@inproceedings{Stransky_Acar_Nguyen_Wermke_Kim_Redmiles_Backes_Garfinkel_Mazurek_Fahl_2017, title={Lessons Learned from Using an Online Platform to Conduct Large-Scale, Online Controlled Security Experiments with Software Developers}, booktitle={10th USENIX Workshop on Cyber Security Experimentation and Test, CSET 2017, Vancouver, BC, Canada, August 14, 2017}, publisher={USENIX Association}, author={Stransky, Christian and Acar, Yasemin and Nguyen, Duc Cuong and Wermke, Dominik and Kim, Doowon and Redmiles, Elissa M. and Backes, Michael and Garfinkel, Simson L. and Mazurek, Michelle L. and Fahl, Sascha}, editor={Fernandez, José M. and Payer, Mathias}, year={2017} }","ama":"Stransky C, Acar Y, Nguyen DC, et al. Lessons Learned from Using an Online Platform to Conduct Large-Scale, Online Controlled Security Experiments with Software Developers. In: Fernandez JM, Payer M, eds. <i>10th USENIX Workshop on Cyber Security Experimentation and Test, CSET 2017, Vancouver, BC, Canada, August 14, 2017</i>. USENIX Association; 2017."},"publication":"10th USENIX Workshop on Cyber Security Experimentation and Test, CSET 2017, Vancouver, BC, Canada, August 14, 2017","extern":"1","date_created":"2023-09-22T12:47:30Z","department":[{"_id":"34"},{"_id":"858"}],"type":"conference","author":[{"full_name":"Stransky, Christian","last_name":"Stransky","first_name":"Christian"},{"last_name":"Acar","first_name":"Yasemin","full_name":"Acar, Yasemin","id":"94636"},{"first_name":"Duc Cuong","last_name":"Nguyen","full_name":"Nguyen, Duc Cuong"},{"full_name":"Wermke, Dominik","last_name":"Wermke","first_name":"Dominik"},{"full_name":"Kim, Doowon","first_name":"Doowon","last_name":"Kim"},{"last_name":"Redmiles","first_name":"Elissa M.","full_name":"Redmiles, Elissa M."},{"full_name":"Backes, Michael","last_name":"Backes","first_name":"Michael"},{"full_name":"Garfinkel, Simson L.","last_name":"Garfinkel","first_name":"Simson L."},{"last_name":"Mazurek","first_name":"Michelle L.","full_name":"Mazurek, Michelle L."},{"last_name":"Fahl","first_name":"Sascha","full_name":"Fahl, Sascha"}],"title":"Lessons Learned from Using an Online Platform to Conduct Large-Scale, Online Controlled Security Experiments with Software Developers","status":"public","year":"2017","date_updated":"2024-06-05T13:12:04Z","publisher":"USENIX Association","_id":"47245","language":[{"iso":"eng"}],"editor":[{"last_name":"Fernandez","first_name":"José M.","full_name":"Fernandez, José M."},{"last_name":"Payer","first_name":"Mathias","full_name":"Payer, Mathias"}],"user_id":"14931"},{"page":"121–136","_id":"47243","publisher":"IEEE Computer Society","language":[{"iso":"eng"}],"user_id":"14931","doi":"10.1109/SP.2017.31","title":"Stack Overflow Considered Harmful? The Impact of Copy&Paste on Android Application Security","year":"2017","status":"public","author":[{"last_name":"Fischer","first_name":"Felix","full_name":"Fischer, Felix"},{"first_name":"Konstantin","last_name":"Böttinger","full_name":"Böttinger, Konstantin"},{"last_name":"Xiao","first_name":"Huang","full_name":"Xiao, Huang"},{"first_name":"Christian","last_name":"Stransky","full_name":"Stransky, Christian"},{"id":"94636","full_name":"Acar, Yasemin","first_name":"Yasemin","last_name":"Acar"},{"full_name":"Backes, Michael","first_name":"Michael","last_name":"Backes"},{"last_name":"Fahl","first_name":"Sascha","full_name":"Fahl, Sascha"}],"date_updated":"2024-06-05T13:12:27Z","date_created":"2023-09-22T12:43:27Z","type":"conference","department":[{"_id":"34"},{"_id":"858"}],"publication":"2017 IEEE Symposium on Security and Privacy, SP 2017, San Jose, CA, USA, May 22-26, 2017","citation":{"bibtex":"@inproceedings{Fischer_Böttinger_Xiao_Stransky_Acar_Backes_Fahl_2017, title={Stack Overflow Considered Harmful? The Impact of Copy&#38;Paste on Android Application Security}, DOI={<a href=\"https://doi.org/10.1109/SP.2017.31\">10.1109/SP.2017.31</a>}, booktitle={2017 IEEE Symposium on Security and Privacy, SP 2017, San Jose, CA, USA, May 22-26, 2017}, publisher={IEEE Computer Society}, author={Fischer, Felix and Böttinger, Konstantin and Xiao, Huang and Stransky, Christian and Acar, Yasemin and Backes, Michael and Fahl, Sascha}, year={2017}, pages={121–136} }","ama":"Fischer F, Böttinger K, Xiao H, et al. Stack Overflow Considered Harmful? The Impact of Copy&#38;Paste on Android Application Security. In: <i>2017 IEEE Symposium on Security and Privacy, SP 2017, San Jose, CA, USA, May 22-26, 2017</i>. IEEE Computer Society; 2017:121–136. doi:<a href=\"https://doi.org/10.1109/SP.2017.31\">10.1109/SP.2017.31</a>","mla":"Fischer, Felix, et al. “Stack Overflow Considered Harmful? The Impact of Copy&#38;Paste on Android Application Security.” <i>2017 IEEE Symposium on Security and Privacy, SP 2017, San Jose, CA, USA, May 22-26, 2017</i>, IEEE Computer Society, 2017, pp. 121–136, doi:<a href=\"https://doi.org/10.1109/SP.2017.31\">10.1109/SP.2017.31</a>.","chicago":"Fischer, Felix, Konstantin Böttinger, Huang Xiao, Christian Stransky, Yasemin Acar, Michael Backes, and Sascha Fahl. “Stack Overflow Considered Harmful? The Impact of Copy&#38;Paste on Android Application Security.” In <i>2017 IEEE Symposium on Security and Privacy, SP 2017, San Jose, CA, USA, May 22-26, 2017</i>, 121–136. IEEE Computer Society, 2017. <a href=\"https://doi.org/10.1109/SP.2017.31\">https://doi.org/10.1109/SP.2017.31</a>.","short":"F. Fischer, K. Böttinger, H. Xiao, C. Stransky, Y. Acar, M. Backes, S. Fahl, in: 2017 IEEE Symposium on Security and Privacy, SP 2017, San Jose, CA, USA, May 22-26, 2017, IEEE Computer Society, 2017, pp. 121–136.","ieee":"F. Fischer <i>et al.</i>, “Stack Overflow Considered Harmful? The Impact of Copy&#38;Paste on Android Application Security,” in <i>2017 IEEE Symposium on Security and Privacy, SP 2017, San Jose, CA, USA, May 22-26, 2017</i>, 2017, pp. 121–136, doi: <a href=\"https://doi.org/10.1109/SP.2017.31\">10.1109/SP.2017.31</a>.","apa":"Fischer, F., Böttinger, K., Xiao, H., Stransky, C., Acar, Y., Backes, M., &#38; Fahl, S. (2017). Stack Overflow Considered Harmful? The Impact of Copy&#38;Paste on Android Application Security. <i>2017 IEEE Symposium on Security and Privacy, SP 2017, San Jose, CA, USA, May 22-26, 2017</i>, 121–136. <a href=\"https://doi.org/10.1109/SP.2017.31\">https://doi.org/10.1109/SP.2017.31</a>"},"extern":"1"},{"date_updated":"2024-06-05T13:12:56Z","publication_status":"published","title":"A Stitch in Time: Supporting Android Developers in Writing Secure Code","year":"2017","status":"public","author":[{"full_name":"Nguyen, Duc Cuong","last_name":"Nguyen","first_name":"Duc Cuong"},{"full_name":"Wermke, Dominik","first_name":"Dominik","last_name":"Wermke"},{"first_name":"Yasemin","last_name":"Acar","full_name":"Acar, Yasemin","id":"94636"},{"full_name":"Backes, Michael","last_name":"Backes","first_name":"Michael"},{"full_name":"Weir, Charles","first_name":"Charles","last_name":"Weir"},{"full_name":"Fahl, Sascha","last_name":"Fahl","first_name":"Sascha"}],"doi":"10.1145/3133956.3133977","user_id":"14931","_id":"47250","language":[{"iso":"eng"}],"publisher":"ACM","extern":"1","publication":"Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security","citation":{"chicago":"Nguyen, Duc Cuong, Dominik Wermke, Yasemin Acar, Michael Backes, Charles Weir, and Sascha Fahl. “A Stitch in Time: Supporting Android Developers in Writing Secure Code.” In <i>Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security</i>. ACM, 2017. <a href=\"https://doi.org/10.1145/3133956.3133977\">https://doi.org/10.1145/3133956.3133977</a>.","short":"D.C. Nguyen, D. Wermke, Y. Acar, M. Backes, C. Weir, S. Fahl, in: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, ACM, 2017.","ieee":"D. C. Nguyen, D. Wermke, Y. Acar, M. Backes, C. Weir, and S. Fahl, “A Stitch in Time: Supporting Android Developers in Writing Secure Code,” 2017, doi: <a href=\"https://doi.org/10.1145/3133956.3133977\">10.1145/3133956.3133977</a>.","apa":"Nguyen, D. C., Wermke, D., Acar, Y., Backes, M., Weir, C., &#38; Fahl, S. (2017). A Stitch in Time: Supporting Android Developers in Writing Secure Code. <i>Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security</i>. <a href=\"https://doi.org/10.1145/3133956.3133977\">https://doi.org/10.1145/3133956.3133977</a>","bibtex":"@inproceedings{Nguyen_Wermke_Acar_Backes_Weir_Fahl_2017, title={A Stitch in Time: Supporting Android Developers in Writing Secure Code}, DOI={<a href=\"https://doi.org/10.1145/3133956.3133977\">10.1145/3133956.3133977</a>}, booktitle={Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security}, publisher={ACM}, author={Nguyen, Duc Cuong and Wermke, Dominik and Acar, Yasemin and Backes, Michael and Weir, Charles and Fahl, Sascha}, year={2017} }","ama":"Nguyen DC, Wermke D, Acar Y, Backes M, Weir C, Fahl S. A Stitch in Time: Supporting Android Developers in Writing Secure Code. In: <i>Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security</i>. ACM; 2017. doi:<a href=\"https://doi.org/10.1145/3133956.3133977\">10.1145/3133956.3133977</a>","mla":"Nguyen, Duc Cuong, et al. “A Stitch in Time: Supporting Android Developers in Writing Secure Code.” <i>Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security</i>, ACM, 2017, doi:<a href=\"https://doi.org/10.1145/3133956.3133977\">10.1145/3133956.3133977</a>."},"type":"conference","department":[{"_id":"34"},{"_id":"858"}],"date_created":"2023-09-22T12:50:51Z"},{"extern":"1","publication":"2017 IEEE Cybersecurity Development (SecDev)","citation":{"short":"Y. Acar, C. Stransky, D. Wermke, C. Weir, M.L. Mazurek, S. Fahl, in: 2017 IEEE Cybersecurity Development (SecDev), IEEE, 2017.","chicago":"Acar, Yasemin, Christian Stransky, Dominik Wermke, Charles Weir, Michelle L. Mazurek, and Sascha Fahl. “Developers Need Support, Too: A Survey of Security Advice for Software Developers.” In <i>2017 IEEE Cybersecurity Development (SecDev)</i>. IEEE, 2017. <a href=\"https://doi.org/10.1109/secdev.2017.17\">https://doi.org/10.1109/secdev.2017.17</a>.","ieee":"Y. Acar, C. Stransky, D. Wermke, C. Weir, M. L. Mazurek, and S. Fahl, “Developers Need Support, Too: A Survey of Security Advice for Software Developers,” 2017, doi: <a href=\"https://doi.org/10.1109/secdev.2017.17\">10.1109/secdev.2017.17</a>.","apa":"Acar, Y., Stransky, C., Wermke, D., Weir, C., Mazurek, M. L., &#38; Fahl, S. (2017). Developers Need Support, Too: A Survey of Security Advice for Software Developers. <i>2017 IEEE Cybersecurity Development (SecDev)</i>. <a href=\"https://doi.org/10.1109/secdev.2017.17\">https://doi.org/10.1109/secdev.2017.17</a>","bibtex":"@inproceedings{Acar_Stransky_Wermke_Weir_Mazurek_Fahl_2017, title={Developers Need Support, Too: A Survey of Security Advice for Software Developers}, DOI={<a href=\"https://doi.org/10.1109/secdev.2017.17\">10.1109/secdev.2017.17</a>}, booktitle={2017 IEEE Cybersecurity Development (SecDev)}, publisher={IEEE}, author={Acar, Yasemin and Stransky, Christian and Wermke, Dominik and Weir, Charles and Mazurek, Michelle L. and Fahl, Sascha}, year={2017} }","ama":"Acar Y, Stransky C, Wermke D, Weir C, Mazurek ML, Fahl S. Developers Need Support, Too: A Survey of Security Advice for Software Developers. In: <i>2017 IEEE Cybersecurity Development (SecDev)</i>. IEEE; 2017. doi:<a href=\"https://doi.org/10.1109/secdev.2017.17\">10.1109/secdev.2017.17</a>","mla":"Acar, Yasemin, et al. “Developers Need Support, Too: A Survey of Security Advice for Software Developers.” <i>2017 IEEE Cybersecurity Development (SecDev)</i>, IEEE, 2017, doi:<a href=\"https://doi.org/10.1109/secdev.2017.17\">10.1109/secdev.2017.17</a>."},"type":"conference","department":[{"_id":"34"},{"_id":"858"}],"date_created":"2023-09-22T12:50:12Z","publication_status":"published","date_updated":"2024-06-05T13:11:41Z","year":"2017","title":"Developers Need Support, Too: A Survey of Security Advice for Software Developers","status":"public","author":[{"first_name":"Yasemin","last_name":"Acar","full_name":"Acar, Yasemin","id":"94636"},{"full_name":"Stransky, Christian","last_name":"Stransky","first_name":"Christian"},{"full_name":"Wermke, Dominik","last_name":"Wermke","first_name":"Dominik"},{"last_name":"Weir","first_name":"Charles","full_name":"Weir, Charles"},{"last_name":"Mazurek","first_name":"Michelle L.","full_name":"Mazurek, Michelle L."},{"full_name":"Fahl, Sascha","last_name":"Fahl","first_name":"Sascha"}],"user_id":"14931","doi":"10.1109/secdev.2017.17","publisher":"IEEE","_id":"47248","language":[{"iso":"eng"}]},{"date_created":"2023-09-22T12:42:23Z","type":"conference","department":[{"_id":"34"},{"_id":"858"}],"publication":"2016 IEEE Cybersecurity Development (SecDev)","citation":{"apa":"Acar, Y., Fahl, S., &#38; Mazurek, M. L. (2017). You are Not Your Developer, Either: A Research Agenda for Usable Security and Privacy Research Beyond End Users. <i>2016 IEEE Cybersecurity Development (SecDev)</i>. <a href=\"https://doi.org/10.1109/secdev.2016.013\">https://doi.org/10.1109/secdev.2016.013</a>","ieee":"Y. Acar, S. Fahl, and M. L. Mazurek, “You are Not Your Developer, Either: A Research Agenda for Usable Security and Privacy Research Beyond End Users,” 2017, doi: <a href=\"https://doi.org/10.1109/secdev.2016.013\">10.1109/secdev.2016.013</a>.","chicago":"Acar, Yasemin, Sascha Fahl, and Michelle L. Mazurek. “You Are Not Your Developer, Either: A Research Agenda for Usable Security and Privacy Research Beyond End Users.” In <i>2016 IEEE Cybersecurity Development (SecDev)</i>. IEEE, 2017. <a href=\"https://doi.org/10.1109/secdev.2016.013\">https://doi.org/10.1109/secdev.2016.013</a>.","short":"Y. Acar, S. Fahl, M.L. Mazurek, in: 2016 IEEE Cybersecurity Development (SecDev), IEEE, 2017.","mla":"Acar, Yasemin, et al. “You Are Not Your Developer, Either: A Research Agenda for Usable Security and Privacy Research Beyond End Users.” <i>2016 IEEE Cybersecurity Development (SecDev)</i>, IEEE, 2017, doi:<a href=\"https://doi.org/10.1109/secdev.2016.013\">10.1109/secdev.2016.013</a>.","ama":"Acar Y, Fahl S, Mazurek ML. You are Not Your Developer, Either: A Research Agenda for Usable Security and Privacy Research Beyond End Users. In: <i>2016 IEEE Cybersecurity Development (SecDev)</i>. IEEE; 2017. doi:<a href=\"https://doi.org/10.1109/secdev.2016.013\">10.1109/secdev.2016.013</a>","bibtex":"@inproceedings{Acar_Fahl_Mazurek_2017, title={You are Not Your Developer, Either: A Research Agenda for Usable Security and Privacy Research Beyond End Users}, DOI={<a href=\"https://doi.org/10.1109/secdev.2016.013\">10.1109/secdev.2016.013</a>}, booktitle={2016 IEEE Cybersecurity Development (SecDev)}, publisher={IEEE}, author={Acar, Yasemin and Fahl, Sascha and Mazurek, Michelle L.}, year={2017} }"},"extern":"1","publisher":"IEEE","_id":"47242","language":[{"iso":"eng"}],"user_id":"14931","doi":"10.1109/secdev.2016.013","status":"public","title":"You are Not Your Developer, Either: A Research Agenda for Usable Security and Privacy Research Beyond End Users","year":"2017","author":[{"id":"94636","full_name":"Acar, Yasemin","first_name":"Yasemin","last_name":"Acar"},{"last_name":"Fahl","first_name":"Sascha","full_name":"Fahl, Sascha"},{"first_name":"Michelle L.","last_name":"Mazurek","full_name":"Mazurek, Michelle L."}],"publication_status":"published","date_updated":"2024-06-05T13:13:34Z"},{"user_id":"14931","doi":"10.1109/sp.2017.52","_id":"47246","language":[{"iso":"eng"}],"publisher":"IEEE","publication_status":"published","date_updated":"2024-06-05T13:14:03Z","year":"2017","title":"Comparing the Usability of Cryptographic APIs","status":"public","author":[{"last_name":"Acar","first_name":"Yasemin","full_name":"Acar, Yasemin","id":"94636"},{"first_name":"Michael","last_name":"Backes","full_name":"Backes, Michael"},{"full_name":"Fahl, Sascha","first_name":"Sascha","last_name":"Fahl"},{"full_name":"Garfinkel, Simson","last_name":"Garfinkel","first_name":"Simson"},{"full_name":"Kim, Doowon","first_name":"Doowon","last_name":"Kim"},{"full_name":"Mazurek, Michelle L.","first_name":"Michelle L.","last_name":"Mazurek"},{"last_name":"Stransky","first_name":"Christian","full_name":"Stransky, Christian"}],"type":"conference","department":[{"_id":"34"},{"_id":"858"}],"date_created":"2023-09-22T12:48:37Z","extern":"1","publication":"2017 IEEE Symposium on Security and Privacy (SP)","citation":{"ieee":"Y. Acar <i>et al.</i>, “Comparing the Usability of Cryptographic APIs,” 2017, doi: <a href=\"https://doi.org/10.1109/sp.2017.52\">10.1109/sp.2017.52</a>.","apa":"Acar, Y., Backes, M., Fahl, S., Garfinkel, S., Kim, D., Mazurek, M. L., &#38; Stransky, C. (2017). Comparing the Usability of Cryptographic APIs. <i>2017 IEEE Symposium on Security and Privacy (SP)</i>. <a href=\"https://doi.org/10.1109/sp.2017.52\">https://doi.org/10.1109/sp.2017.52</a>","short":"Y. Acar, M. Backes, S. Fahl, S. Garfinkel, D. Kim, M.L. Mazurek, C. Stransky, in: 2017 IEEE Symposium on Security and Privacy (SP), IEEE, 2017.","chicago":"Acar, Yasemin, Michael Backes, Sascha Fahl, Simson Garfinkel, Doowon Kim, Michelle L. Mazurek, and Christian Stransky. “Comparing the Usability of Cryptographic APIs.” In <i>2017 IEEE Symposium on Security and Privacy (SP)</i>. IEEE, 2017. <a href=\"https://doi.org/10.1109/sp.2017.52\">https://doi.org/10.1109/sp.2017.52</a>.","mla":"Acar, Yasemin, et al. “Comparing the Usability of Cryptographic APIs.” <i>2017 IEEE Symposium on Security and Privacy (SP)</i>, IEEE, 2017, doi:<a href=\"https://doi.org/10.1109/sp.2017.52\">10.1109/sp.2017.52</a>.","bibtex":"@inproceedings{Acar_Backes_Fahl_Garfinkel_Kim_Mazurek_Stransky_2017, title={Comparing the Usability of Cryptographic APIs}, DOI={<a href=\"https://doi.org/10.1109/sp.2017.52\">10.1109/sp.2017.52</a>}, booktitle={2017 IEEE Symposium on Security and Privacy (SP)}, publisher={IEEE}, author={Acar, Yasemin and Backes, Michael and Fahl, Sascha and Garfinkel, Simson and Kim, Doowon and Mazurek, Michelle L. and Stransky, Christian}, year={2017} }","ama":"Acar Y, Backes M, Fahl S, et al. Comparing the Usability of Cryptographic APIs. In: <i>2017 IEEE Symposium on Security and Privacy (SP)</i>. IEEE; 2017. doi:<a href=\"https://doi.org/10.1109/sp.2017.52\">10.1109/sp.2017.52</a>"}},{"date_updated":"2024-06-05T13:14:32Z","author":[{"id":"94636","full_name":"Acar, Yasemin","last_name":"Acar","first_name":"Yasemin"},{"full_name":"Stransky, Christian","last_name":"Stransky","first_name":"Christian"},{"full_name":"Wermke, Dominik","last_name":"Wermke","first_name":"Dominik"},{"last_name":"Mazurek","first_name":"Michelle L.","full_name":"Mazurek, Michelle L."},{"full_name":"Fahl, Sascha","last_name":"Fahl","first_name":"Sascha"}],"status":"public","title":"Security Developer Studies with GitHub Users: Exploring a Convenience Sample","year":"2017","user_id":"14931","_id":"47244","language":[{"iso":"eng"}],"publisher":"USENIX Association","page":"81–95","extern":"1","citation":{"chicago":"Acar, Yasemin, Christian Stransky, Dominik Wermke, Michelle L. Mazurek, and Sascha Fahl. “Security Developer Studies with GitHub Users: Exploring a Convenience Sample.” In <i>Thirteenth Symposium on Usable Privacy and Security, SOUPS 2017, Santa Clara, CA, USA, July 12-14, 2017</i>, 81–95. USENIX Association, 2017.","short":"Y. Acar, C. Stransky, D. Wermke, M.L. Mazurek, S. Fahl, in: Thirteenth Symposium on Usable Privacy and Security, SOUPS 2017, Santa Clara, CA, USA, July 12-14, 2017, USENIX Association, 2017, pp. 81–95.","ieee":"Y. Acar, C. Stransky, D. Wermke, M. L. Mazurek, and S. Fahl, “Security Developer Studies with GitHub Users: Exploring a Convenience Sample,” in <i>Thirteenth Symposium on Usable Privacy and Security, SOUPS 2017, Santa Clara, CA, USA, July 12-14, 2017</i>, 2017, pp. 81–95.","apa":"Acar, Y., Stransky, C., Wermke, D., Mazurek, M. L., &#38; Fahl, S. (2017). Security Developer Studies with GitHub Users: Exploring a Convenience Sample. <i>Thirteenth Symposium on Usable Privacy and Security, SOUPS 2017, Santa Clara, CA, USA, July 12-14, 2017</i>, 81–95.","bibtex":"@inproceedings{Acar_Stransky_Wermke_Mazurek_Fahl_2017, title={Security Developer Studies with GitHub Users: Exploring a Convenience Sample}, booktitle={Thirteenth Symposium on Usable Privacy and Security, SOUPS 2017, Santa Clara, CA, USA, July 12-14, 2017}, publisher={USENIX Association}, author={Acar, Yasemin and Stransky, Christian and Wermke, Dominik and Mazurek, Michelle L. and Fahl, Sascha}, year={2017}, pages={81–95} }","ama":"Acar Y, Stransky C, Wermke D, Mazurek ML, Fahl S. Security Developer Studies with GitHub Users: Exploring a Convenience Sample. In: <i>Thirteenth Symposium on Usable Privacy and Security, SOUPS 2017, Santa Clara, CA, USA, July 12-14, 2017</i>. USENIX Association; 2017:81–95.","mla":"Acar, Yasemin, et al. “Security Developer Studies with GitHub Users: Exploring a Convenience Sample.” <i>Thirteenth Symposium on Usable Privacy and Security, SOUPS 2017, Santa Clara, CA, USA, July 12-14, 2017</i>, USENIX Association, 2017, pp. 81–95."},"publication":"Thirteenth Symposium on Usable Privacy and Security, SOUPS 2017, Santa Clara, CA, USA, July 12-14, 2017","department":[{"_id":"34"},{"_id":"858"}],"type":"conference","date_created":"2023-09-22T12:45:33Z"},{"department":[{"_id":"34"},{"_id":"858"}],"type":"report","date_created":"2023-10-09T13:16:14Z","extern":"1","citation":{"ieee":"E. M. Redmiles, Y. Acar, S. Fahl, and M. L. Mazurek, <i>A Summary of Survey Methodology Best Practices for Security and Privacy Researchers</i>. University of Maryland Computer Science Department, 2017.","apa":"Redmiles, E. M., Acar, Y., Fahl, S., &#38; Mazurek, M. L. (2017). <i>A Summary of Survey Methodology Best Practices for Security and Privacy Researchers</i>. University of Maryland Computer Science Department. <a href=\"https://doi.org/10.13016/M22K2W\">https://doi.org/10.13016/M22K2W</a>","mla":"Redmiles, Elissa M., et al. <i>A Summary of Survey Methodology Best Practices for Security and Privacy Researchers</i>. University of Maryland Computer Science Department, 2017, doi:<a href=\"https://doi.org/10.13016/M22K2W\">10.13016/M22K2W</a>.","bibtex":"@book{Redmiles_Acar_Fahl_Mazurek_2017, title={A Summary of Survey Methodology Best Practices for Security and Privacy Researchers}, DOI={<a href=\"https://doi.org/10.13016/M22K2W\">10.13016/M22K2W</a>}, publisher={University of Maryland Computer Science Department}, author={Redmiles, Elissa M. and Acar, Yasemin and Fahl, Sascha and Mazurek, Michelle L.}, year={2017} }","chicago":"Redmiles, Elissa M., Yasemin Acar, Sascha Fahl, and Michelle L. Mazurek. <i>A Summary of Survey Methodology Best Practices for Security and Privacy Researchers</i>. University of Maryland Computer Science Department, 2017. <a href=\"https://doi.org/10.13016/M22K2W\">https://doi.org/10.13016/M22K2W</a>.","short":"E.M. Redmiles, Y. Acar, S. Fahl, M.L. Mazurek, A Summary of Survey Methodology Best Practices for Security and Privacy Researchers, University of Maryland Computer Science Department, 2017.","ama":"Redmiles EM, Acar Y, Fahl S, Mazurek ML. <i>A Summary of Survey Methodology Best Practices for Security and Privacy Researchers</i>. University of Maryland Computer Science Department; 2017. doi:<a href=\"https://doi.org/10.13016/M22K2W\">10.13016/M22K2W</a>"},"doi":"10.13016/M22K2W","user_id":"14931","language":[{"iso":"eng"}],"_id":"47873","publisher":"University of Maryland Computer Science Department","date_updated":"2024-06-05T13:10:02Z","author":[{"first_name":"Elissa M.","last_name":"Redmiles","full_name":"Redmiles, Elissa M."},{"first_name":"Yasemin","last_name":"Acar","full_name":"Acar, Yasemin","id":"94636"},{"last_name":"Fahl","first_name":"Sascha","full_name":"Fahl, Sascha"},{"full_name":"Mazurek, Michelle L.","last_name":"Mazurek","first_name":"Michelle L."}],"title":"A Summary of Survey Methodology Best Practices for Security and Privacy Researchers","year":"2017","status":"public"},{"project":[{"name":"SFB 901","_id":"1","grant_number":"160364472"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject C2","grant_number":"160364472","_id":"14"},{"name":"Self-Adaptive Virtualisation-Aware High-Performance/Low-Energy Heterogeneous System Architectures","grant_number":"610996","_id":"34"},{"name":"Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}],"quality_controlled":"1","citation":{"ama":"Riebler H, Lass M, Mittendorf R, Löcke T, Plessl C. Efficient Branch and Bound on FPGAs Using Work Stealing and Instance-Specific Designs. <i>ACM Transactions on Reconfigurable Technology and Systems (TRETS)</i>. 2017;10(3):24:1-24:23. doi:<a href=\"https://doi.org/10.1145/3053687\">10.1145/3053687</a>","bibtex":"@article{Riebler_Lass_Mittendorf_Löcke_Plessl_2017, title={Efficient Branch and Bound on FPGAs Using Work Stealing and Instance-Specific Designs}, volume={10}, DOI={<a href=\"https://doi.org/10.1145/3053687\">10.1145/3053687</a>}, number={3}, journal={ACM Transactions on Reconfigurable Technology and Systems (TRETS)}, publisher={Association for Computing Machinery (ACM)}, author={Riebler, Heinrich and Lass, Michael and Mittendorf, Robert and Löcke, Thomas and Plessl, Christian}, year={2017}, pages={24:1-24:23} }","mla":"Riebler, Heinrich, et al. “Efficient Branch and Bound on FPGAs Using Work Stealing and Instance-Specific Designs.” <i>ACM Transactions on Reconfigurable Technology and Systems (TRETS)</i>, vol. 10, no. 3, Association for Computing Machinery (ACM), 2017, p. 24:1-24:23, doi:<a href=\"https://doi.org/10.1145/3053687\">10.1145/3053687</a>.","short":"H. Riebler, M. Lass, R. Mittendorf, T. Löcke, C. Plessl, ACM Transactions on Reconfigurable Technology and Systems (TRETS) 10 (2017) 24:1-24:23.","chicago":"Riebler, Heinrich, Michael Lass, Robert Mittendorf, Thomas Löcke, and Christian Plessl. “Efficient Branch and Bound on FPGAs Using Work Stealing and Instance-Specific Designs.” <i>ACM Transactions on Reconfigurable Technology and Systems (TRETS)</i> 10, no. 3 (2017): 24:1-24:23. <a href=\"https://doi.org/10.1145/3053687\">https://doi.org/10.1145/3053687</a>.","apa":"Riebler, H., Lass, M., Mittendorf, R., Löcke, T., &#38; Plessl, C. (2017). Efficient Branch and Bound on FPGAs Using Work Stealing and Instance-Specific Designs. <i>ACM Transactions on Reconfigurable Technology and Systems (TRETS)</i>, <i>10</i>(3), 24:1-24:23. <a href=\"https://doi.org/10.1145/3053687\">https://doi.org/10.1145/3053687</a>","ieee":"H. Riebler, M. Lass, R. Mittendorf, T. Löcke, and C. Plessl, “Efficient Branch and Bound on FPGAs Using Work Stealing and Instance-Specific Designs,” <i>ACM Transactions on Reconfigurable Technology and Systems (TRETS)</i>, vol. 10, no. 3, p. 24:1-24:23, 2017, doi: <a href=\"https://doi.org/10.1145/3053687\">10.1145/3053687</a>."},"file_date_updated":"2018-11-02T16:04:14Z","volume":10,"user_id":"15278","ddc":["000"],"publisher":"Association for Computing Machinery (ACM)","_id":"18","page":"24:1-24:23","has_accepted_license":"1","status":"public","department":[{"_id":"27"},{"_id":"518"}],"keyword":["coldboot"],"type":"journal_article","date_created":"2017-07-25T14:17:32Z","file":[{"creator":"ups","date_created":"2018-11-02T16:04:14Z","date_updated":"2018-11-02T16:04:14Z","relation":"main_file","file_size":2131617,"access_level":"closed","file_name":"a24-riebler.pdf","success":1,"content_type":"application/pdf","file_id":"5322"}],"abstract":[{"text":"Branch and bound (B&B) algorithms structure the search space as a tree and eliminate infeasible solutions early by pruning subtrees that cannot lead to a valid or optimal solution. Custom hardware designs significantly accelerate the execution of these algorithms. In this article, we demonstrate a high-performance B&B implementation on FPGAs. First, we identify general elements of B&B algorithms and describe their implementation as a finite state machine. Then, we introduce workers that autonomously cooperate using work stealing to allow parallel execution and full utilization of the target FPGA. Finally, we explore advantages of instance-specific designs that target a specific problem instance to improve performance.\r\n\r\nWe evaluate our concepts by applying them to a branch and bound problem, the reconstruction of corrupted AES keys obtained from cold-boot attacks. The evaluation shows that our work stealing approach is scalable with the available resources and provides speedups proportional to the number of workers. Instance-specific designs allow us to achieve an overall speedup of 47 × compared to the fastest implementation of AES key reconstruction so far. Finally, we demonstrate how instance-specific designs can be generated just-in-time such that the provided speedups outweigh the additional time required for design synthesis.","lang":"eng"}],"publication":"ACM Transactions on Reconfigurable Technology and Systems (TRETS)","issue":"3","doi":"10.1145/3053687","language":[{"iso":"eng"}],"intvolume":"        10","publication_status":"published","date_updated":"2023-09-26T13:23:58Z","publication_identifier":{"issn":["1936-7406"]},"author":[{"full_name":"Riebler, Heinrich","last_name":"Riebler","first_name":"Heinrich","id":"8961"},{"id":"24135","last_name":"Lass","orcid":"0000-0002-5708-7632","first_name":"Michael","full_name":"Lass, Michael"},{"full_name":"Mittendorf, Robert","last_name":"Mittendorf","first_name":"Robert"},{"full_name":"Löcke, Thomas","last_name":"Löcke","first_name":"Thomas"},{"id":"16153","full_name":"Plessl, Christian","first_name":"Christian","orcid":"0000-0001-5728-9982","last_name":"Plessl"}],"title":"Efficient Branch and Bound on FPGAs Using Work Stealing and Instance-Specific Designs","year":"2017"},{"abstract":[{"lang":"eng","text":"Compared to classical HDL designs, generating FPGA with high-level synthesis from an OpenCL specification promises easier exploration of different design alternatives and, through ready-to-use infrastructure and common abstractions for host and memory interfaces, easier portability between different FPGA families. In this work, we evaluate the extent of this promise. To this end, we present a parameterized FDTD implementation for photonic microcavity simulations. Our design can trade-off different forms of parallelism and works for two independent OpenCL-based FPGA design flows. Hence, we can target FPGAs from different vendors and different FPGA families. We describe how we used pre-processor macros to achieve this flexibility and to work around different shortcomings of the current tools. Choosing the right design configurations, we are able to present two extremely competitive solutions for very different FPGA targets, reaching up to 172 GFLOPS sustained performance. With the portability and flexibility demonstrated, code developers not only avoid vendor lock-in, but can even make best use of real trade-offs between different architectures."}],"publication":"Proc. Int. Conf. on Field Programmable Logic and Applications (FPL)","department":[{"_id":"27"},{"_id":"518"},{"_id":"61"}],"type":"conference","keyword":["tet_topic_hpc"],"date_created":"2018-03-22T11:10:23Z","file":[{"creator":"ups","date_created":"2018-11-02T15:02:28Z","date_updated":"2018-11-02T15:02:28Z","relation":"main_file","access_level":"closed","file_size":230235,"file_name":"08056844.pdf","success":1,"content_type":"application/pdf","file_id":"5291"}],"date_updated":"2023-09-26T13:24:38Z","author":[{"last_name":"Kenter","first_name":"Tobias","full_name":"Kenter, Tobias","id":"3145"},{"id":"158","first_name":"Jens","last_name":"Förstner","orcid":"0000-0001-7059-9862","full_name":"Förstner, Jens"},{"full_name":"Plessl, Christian","last_name":"Plessl","orcid":"0000-0001-5728-9982","first_name":"Christian","id":"16153"}],"title":"Flexible FPGA design for FDTD using OpenCL","year":"2017","doi":"10.23919/FPL.2017.8056844","language":[{"iso":"eng"}],"project":[{"name":"SFB 901","grant_number":"160364472","_id":"1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"grant_number":"160364472","_id":"14","name":"SFB 901 - Subproject C2"},{"name":"HighPerMeshes","grant_number":"01|H16005A","_id":"33"},{"grant_number":"PL 595/2-1 / 320898746","_id":"32","name":"Performance and Efficiency in HPC with Custom Computing"},{"_id":"52","name":"Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"quality_controlled":"1","citation":{"ieee":"T. Kenter, J. Förstner, and C. Plessl, “Flexible FPGA design for FDTD using OpenCL,” 2017, doi: <a href=\"https://doi.org/10.23919/FPL.2017.8056844\">10.23919/FPL.2017.8056844</a>.","apa":"Kenter, T., Förstner, J., &#38; Plessl, C. (2017). Flexible FPGA design for FDTD using OpenCL. <i>Proc. Int. Conf. on Field Programmable Logic and Applications (FPL)</i>. <a href=\"https://doi.org/10.23919/FPL.2017.8056844\">https://doi.org/10.23919/FPL.2017.8056844</a>","chicago":"Kenter, Tobias, Jens Förstner, and Christian Plessl. “Flexible FPGA Design for FDTD Using OpenCL.” In <i>Proc. Int. Conf. on Field Programmable Logic and Applications (FPL)</i>. IEEE, 2017. <a href=\"https://doi.org/10.23919/FPL.2017.8056844\">https://doi.org/10.23919/FPL.2017.8056844</a>.","short":"T. Kenter, J. Förstner, C. Plessl, in: Proc. Int. Conf. on Field Programmable Logic and Applications (FPL), IEEE, 2017.","mla":"Kenter, Tobias, et al. “Flexible FPGA Design for FDTD Using OpenCL.” <i>Proc. Int. Conf. on Field Programmable Logic and Applications (FPL)</i>, IEEE, 2017, doi:<a href=\"https://doi.org/10.23919/FPL.2017.8056844\">10.23919/FPL.2017.8056844</a>.","bibtex":"@inproceedings{Kenter_Förstner_Plessl_2017, title={Flexible FPGA design for FDTD using OpenCL}, DOI={<a href=\"https://doi.org/10.23919/FPL.2017.8056844\">10.23919/FPL.2017.8056844</a>}, booktitle={Proc. Int. Conf. on Field Programmable Logic and Applications (FPL)}, publisher={IEEE}, author={Kenter, Tobias and Förstner, Jens and Plessl, Christian}, year={2017} }","ama":"Kenter T, Förstner J, Plessl C. Flexible FPGA design for FDTD using OpenCL. In: <i>Proc. Int. Conf. on Field Programmable Logic and Applications (FPL)</i>. IEEE; 2017. doi:<a href=\"https://doi.org/10.23919/FPL.2017.8056844\">10.23919/FPL.2017.8056844</a>"},"file_date_updated":"2018-11-02T15:02:28Z","has_accepted_license":"1","status":"public","user_id":"15278","ddc":["000"],"_id":"1592","publisher":"IEEE"},{"date_created":"2018-03-22T10:51:20Z","type":"journal_article","department":[{"_id":"27"},{"_id":"518"}],"publication":"Journal of Physics: Conference Series","citation":{"apa":"Schumacher, J., Plessl, C., &#38; Vandelli, W. (2017). High-Throughput and Low-Latency Network Communication with NetIO. <i>Journal of Physics: Conference Series</i>, <i>898</i>, Article 082003. <a href=\"https://doi.org/10.1088/1742-6596/898/8/082003\">https://doi.org/10.1088/1742-6596/898/8/082003</a>","ieee":"J. Schumacher, C. Plessl, and W. Vandelli, “High-Throughput and Low-Latency Network Communication with NetIO,” <i>Journal of Physics: Conference Series</i>, vol. 898, Art. no. 082003, 2017, doi: <a href=\"https://doi.org/10.1088/1742-6596/898/8/082003\">10.1088/1742-6596/898/8/082003</a>.","short":"J. Schumacher, C. Plessl, W. Vandelli, Journal of Physics: Conference Series 898 (2017).","chicago":"Schumacher, Jörn, Christian Plessl, and Wainer Vandelli. “High-Throughput and Low-Latency Network Communication with NetIO.” <i>Journal of Physics: Conference Series</i> 898 (2017). <a href=\"https://doi.org/10.1088/1742-6596/898/8/082003\">https://doi.org/10.1088/1742-6596/898/8/082003</a>.","mla":"Schumacher, Jörn, et al. “High-Throughput and Low-Latency Network Communication with NetIO.” <i>Journal of Physics: Conference Series</i>, vol. 898, 082003, IOP Publishing, 2017, doi:<a href=\"https://doi.org/10.1088/1742-6596/898/8/082003\">10.1088/1742-6596/898/8/082003</a>.","ama":"Schumacher J, Plessl C, Vandelli W. High-Throughput and Low-Latency Network Communication with NetIO. <i>Journal of Physics: Conference Series</i>. 2017;898. doi:<a href=\"https://doi.org/10.1088/1742-6596/898/8/082003\">10.1088/1742-6596/898/8/082003</a>","bibtex":"@article{Schumacher_Plessl_Vandelli_2017, title={High-Throughput and Low-Latency Network Communication with NetIO}, volume={898}, DOI={<a href=\"https://doi.org/10.1088/1742-6596/898/8/082003\">10.1088/1742-6596/898/8/082003</a>}, number={082003}, journal={Journal of Physics: Conference Series}, publisher={IOP Publishing}, author={Schumacher, Jörn and Plessl, Christian and Vandelli, Wainer}, year={2017} }"},"quality_controlled":"1","article_number":"082003","publisher":"IOP Publishing","_id":"1589","language":[{"iso":"eng"}],"doi":"10.1088/1742-6596/898/8/082003","user_id":"15278","volume":898,"title":"High-Throughput and Low-Latency Network Communication with NetIO","status":"public","year":"2017","author":[{"first_name":"Jörn","last_name":"Schumacher","full_name":"Schumacher, Jörn"},{"id":"16153","full_name":"Plessl, Christian","last_name":"Plessl","first_name":"Christian","orcid":"0000-0001-5728-9982"},{"full_name":"Vandelli, Wainer","first_name":"Wainer","last_name":"Vandelli"}],"date_updated":"2023-09-26T13:24:19Z","intvolume":"       898"},{"citation":{"mla":"Krüger, Stefan, et al. <i>CrySL: Validating Correct Usage of Cryptographic APIs</i>. 2017.","ama":"Krüger S, Späth J, Ali K, Bodden E, Mezini M. <i>CrySL: Validating Correct Usage of Cryptographic APIs</i>.; 2017.","bibtex":"@book{Krüger_Späth_Ali_Bodden_Mezini_2017, title={CrySL: Validating Correct Usage of Cryptographic APIs}, author={Krüger, Stefan and Späth, Johannes and Ali, Karim and Bodden, Eric and Mezini, Mira}, year={2017} }","apa":"Krüger, S., Späth, J., Ali, K., Bodden, E., &#38; Mezini, M. (2017). <i>CrySL: Validating Correct Usage of Cryptographic APIs</i>.","ieee":"S. Krüger, J. Späth, K. Ali, E. Bodden, and M. Mezini, <i>CrySL: Validating Correct Usage of Cryptographic APIs</i>. 2017.","chicago":"Krüger, Stefan, Johannes Späth, Karim Ali, Eric Bodden, and Mira Mezini. <i>CrySL: Validating Correct Usage of Cryptographic APIs</i>, 2017.","short":"S. Krüger, J. Späth, K. Ali, E. Bodden, M. Mezini, CrySL: Validating Correct Usage of Cryptographic APIs, 2017."},"external_id":{"arxiv":["1710.00564"]},"date_created":"2020-11-30T10:29:41Z","type":"report","keyword":["ITSECWEBSITE"],"department":[{"_id":"76"}],"title":"CrySL: Validating Correct Usage of Cryptographic APIs","status":"public","year":"2017","author":[{"last_name":"Krüger","first_name":"Stefan","full_name":"Krüger, Stefan"},{"full_name":"Späth, Johannes","first_name":"Johannes","last_name":"Späth"},{"last_name":"Ali","first_name":"Karim","full_name":"Ali, Karim"},{"last_name":"Bodden","first_name":"Eric","orcid":"0000-0003-3470-3647","full_name":"Bodden, Eric","id":"59256"},{"first_name":"Mira","last_name":"Mezini","full_name":"Mezini, Mira"}],"date_updated":"2026-02-19T14:39:50Z","main_file_link":[{"url":"https://arxiv.org/abs/1710.00564"}],"_id":"20555","language":[{"iso":"eng"}],"user_id":"14972"},{"user_id":"33185","doi":"10.1007/978-3-658-20265-1_18","_id":"57234","publisher":"Springer Fachmedien Wiesbaden","language":[{"iso":"ger"}],"publication_status":"published","date_updated":"2024-11-19T11:31:51Z","year":"2017","status":"public","title":"Interdisziplinäres Projektmanagement – Strategische Handlungsempfehlungen für Kooperationsverbünde in akademischen Kontexten","author":[{"last_name":"Meise","first_name":"Bianca","full_name":"Meise, Bianca"},{"id":"33185","last_name":"Schloots","first_name":"Franziska Margarete","full_name":"Schloots, Franziska Margarete"},{"last_name":"Müller-Lietzkow","first_name":"Jörg","full_name":"Müller-Lietzkow, Jörg"},{"last_name":"Meister","first_name":"Dorothee M.","full_name":"Meister, Dorothee M."}],"publication_identifier":{"isbn":["9783658202644","9783658202651"]},"type":"book_chapter","department":[{"_id":"574"}],"date_created":"2024-11-19T11:30:16Z","place":"Wiesbaden","publication":"Interdisziplinäre Perspektiven zur Zukunft der Wertschöpfung","citation":{"bibtex":"@inbook{Meise_Schloots_Müller-Lietzkow_Meister_2017, place={Wiesbaden}, title={Interdisziplinäres Projektmanagement – Strategische Handlungsempfehlungen für Kooperationsverbünde in akademischen Kontexten}, DOI={<a href=\"https://doi.org/10.1007/978-3-658-20265-1_18\">10.1007/978-3-658-20265-1_18</a>}, booktitle={Interdisziplinäre Perspektiven zur Zukunft der Wertschöpfung}, publisher={Springer Fachmedien Wiesbaden}, author={Meise, Bianca and Schloots, Franziska Margarete and Müller-Lietzkow, Jörg and Meister, Dorothee M.}, year={2017} }","ama":"Meise B, Schloots FM, Müller-Lietzkow J, Meister DM. Interdisziplinäres Projektmanagement – Strategische Handlungsempfehlungen für Kooperationsverbünde in akademischen Kontexten. In: <i>Interdisziplinäre Perspektiven zur Zukunft der Wertschöpfung</i>. Springer Fachmedien Wiesbaden; 2017. doi:<a href=\"https://doi.org/10.1007/978-3-658-20265-1_18\">10.1007/978-3-658-20265-1_18</a>","mla":"Meise, Bianca, et al. “Interdisziplinäres Projektmanagement – Strategische Handlungsempfehlungen für Kooperationsverbünde in akademischen Kontexten.” <i>Interdisziplinäre Perspektiven zur Zukunft der Wertschöpfung</i>, Springer Fachmedien Wiesbaden, 2017, doi:<a href=\"https://doi.org/10.1007/978-3-658-20265-1_18\">10.1007/978-3-658-20265-1_18</a>.","short":"B. Meise, F.M. Schloots, J. Müller-Lietzkow, D.M. Meister, in: Interdisziplinäre Perspektiven zur Zukunft der Wertschöpfung, Springer Fachmedien Wiesbaden, Wiesbaden, 2017.","chicago":"Meise, Bianca, Franziska Margarete Schloots, Jörg Müller-Lietzkow, and Dorothee M. Meister. “Interdisziplinäres Projektmanagement – Strategische Handlungsempfehlungen für Kooperationsverbünde in akademischen Kontexten.” In <i>Interdisziplinäre Perspektiven zur Zukunft der Wertschöpfung</i>. Wiesbaden: Springer Fachmedien Wiesbaden, 2017. <a href=\"https://doi.org/10.1007/978-3-658-20265-1_18\">https://doi.org/10.1007/978-3-658-20265-1_18</a>.","ieee":"B. Meise, F. M. Schloots, J. Müller-Lietzkow, and D. M. Meister, “Interdisziplinäres Projektmanagement – Strategische Handlungsempfehlungen für Kooperationsverbünde in akademischen Kontexten,” in <i>Interdisziplinäre Perspektiven zur Zukunft der Wertschöpfung</i>, Wiesbaden: Springer Fachmedien Wiesbaden, 2017.","apa":"Meise, B., Schloots, F. M., Müller-Lietzkow, J., &#38; Meister, D. M. (2017). Interdisziplinäres Projektmanagement – Strategische Handlungsempfehlungen für Kooperationsverbünde in akademischen Kontexten. In <i>Interdisziplinäre Perspektiven zur Zukunft der Wertschöpfung</i>. Springer Fachmedien Wiesbaden. <a href=\"https://doi.org/10.1007/978-3-658-20265-1_18\">https://doi.org/10.1007/978-3-658-20265-1_18</a>"}},{"user_id":"5603","_id":"25069","language":[{"iso":"eng"}],"date_updated":"2025-02-26T14:45:23Z","corporate_editor":["University Booth Interactive Presentation"],"author":[{"id":"5603","full_name":"Adelt, Peer","last_name":"Adelt","first_name":"Peer"},{"full_name":"Koppelmann, Bastian","first_name":"Bastian","last_name":"Koppelmann","id":"25260"},{"full_name":"Müller, Wolfgang","first_name":"Wolfgang","last_name":"Müller","id":"16243"},{"first_name":"Bernd","last_name":"Kleinjohann","full_name":"Kleinjohann, Bernd"},{"full_name":"Scheytt, J. Christoph","orcid":"0000-0002-5950-6618 ","first_name":"J. Christoph","last_name":"Scheytt","id":"37144"}],"conference":{"location":"Lausanne, CH, Mrz. 2017"},"year":"2017","title":"ANALISA - A Tool for Static Instruction Set Analysis","status":"public","department":[{"_id":"672"}],"type":"conference","date_created":"2021-09-28T11:12:00Z","citation":{"short":"P. Adelt, B. Koppelmann, W. Müller, B. Kleinjohann, J.C. Scheytt, in: University Booth Interactive Presentation (Ed.), Design Automation and Testing in Europe (DATE), 2017.","chicago":"Adelt, Peer, Bastian Koppelmann, Wolfgang Müller, Bernd Kleinjohann, and J. Christoph Scheytt. “ANALISA - A Tool for Static Instruction Set Analysis.” In <i>Design Automation and Testing in Europe (DATE)</i>, edited by University Booth Interactive Presentation, 2017.","apa":"Adelt, P., Koppelmann, B., Müller, W., Kleinjohann, B., &#38; Scheytt, J. C. (2017). ANALISA - A Tool for Static Instruction Set Analysis. In University Booth Interactive Presentation (Ed.), <i>Design Automation and Testing in Europe (DATE)</i>.","ieee":"P. Adelt, B. Koppelmann, W. Müller, B. Kleinjohann, and J. C. Scheytt, “ANALISA - A Tool for Static Instruction Set Analysis,” in <i>Design Automation and Testing in Europe (DATE)</i>, Lausanne, CH, Mrz. 2017, 2017.","ama":"Adelt P, Koppelmann B, Müller W, Kleinjohann B, Scheytt JC. ANALISA - A Tool for Static Instruction Set Analysis. In: University Booth Interactive Presentation, ed. <i>Design Automation and Testing in Europe (DATE)</i>. ; 2017.","bibtex":"@inproceedings{Adelt_Koppelmann_Müller_Kleinjohann_Scheytt_2017, title={ANALISA - A Tool for Static Instruction Set Analysis}, booktitle={Design Automation and Testing in Europe (DATE)}, author={Adelt, Peer and Koppelmann, Bastian and Müller, Wolfgang and Kleinjohann, Bernd and Scheytt, J. Christoph}, editor={University Booth Interactive Presentation}, year={2017} }","mla":"Adelt, Peer, et al. “ANALISA - A Tool for Static Instruction Set Analysis.” <i>Design Automation and Testing in Europe (DATE)</i>, edited by University Booth Interactive Presentation, 2017."},"publication":"Design Automation and Testing in Europe (DATE)"},{"year":"2017","title":"Similarity maps and field-guided T-splines","author":[{"full_name":"Campen, Marcel","first_name":"Marcel","last_name":"Campen","orcid":"0000-0003-2340-3462","id":"114904"},{"first_name":"Denis","last_name":"Zorin","full_name":"Zorin, Denis"}],"publication_identifier":{"issn":["0730-0301","1557-7368"]},"publication_status":"published","date_updated":"2025-07-14T12:43:19Z","intvolume":"        36","language":[{"iso":"eng"}],"doi":"10.1145/3072959.3073647","alternative_title":["a perfect couple"],"issue":"4","publication":"ACM Transactions on Graphics","extern":"1","abstract":[{"lang":"eng","text":"<jats:p>A variety of techniques were proposed to model smooth surfaces based on tensor product splines (e.g. subdivision surfaces, free-form splines, T-splines). Conversion of an input surface into such a representation is commonly achieved by constructing a global seamless parametrization, possibly aligned to a guiding cross-field (e.g. of principal curvature directions), and using this parametrization as domain to construct the spline-based surface.</jats:p>\r\n          <jats:p>One major fundamental difficulty in designing robust algorithms for this task is the fact that for common types, e.g. subdivision surfaces (requiring a conforming domain mesh) or T-spline surfaces (requiring a globally consistent knot interval assignment) reliably obtaining a suitable parametrization that has the same topological structure as the guiding field poses a major challenge. Even worse, not all fields do admit suitable parametrizations, and no concise conditions are known as to which fields do.</jats:p>\r\n          <jats:p>\r\n            We present a class of surface constructions (T-splines with\r\n            <jats:italic>halfedge knots</jats:italic>\r\n            ) and a class of parametrizations (\r\n            <jats:italic>seamless similarity maps</jats:italic>\r\n            ) that are, in a sense, a perfect match for the task: for\r\n            <jats:italic>any</jats:italic>\r\n            given guiding field structure, a compatible parametrization of this kind exists and a smooth piecewise rational surface with exactly the same structure as the input field can be constructed from it. As a byproduct, this enables full control over extraordinary points. The construction is backward compatible with classical NURBS. We present efficient algorithms for building discrete conformal similarity maps and associated T-meshes and T-spline surfaces.\r\n          </jats:p>"}],"date_created":"2025-06-26T08:16:00Z","type":"journal_article","department":[{"_id":"969"}],"status":"public","page":"1-16","publisher":"Association for Computing Machinery (ACM)","_id":"60399","user_id":"117512","volume":36,"citation":{"ieee":"M. Campen and D. Zorin, “Similarity maps and field-guided T-splines,” <i>ACM Transactions on Graphics</i>, vol. 36, no. 4, pp. 1–16, 2017, doi: <a href=\"https://doi.org/10.1145/3072959.3073647\">10.1145/3072959.3073647</a>.","mla":"Campen, Marcel, and Denis Zorin. “Similarity Maps and Field-Guided T-Splines.” <i>ACM Transactions on Graphics</i>, vol. 36, no. 4, Association for Computing Machinery (ACM), 2017, pp. 1–16, doi:<a href=\"https://doi.org/10.1145/3072959.3073647\">10.1145/3072959.3073647</a>.","apa":"Campen, M., &#38; Zorin, D. (2017). Similarity maps and field-guided T-splines. <i>ACM Transactions on Graphics</i>, <i>36</i>(4), 1–16. <a href=\"https://doi.org/10.1145/3072959.3073647\">https://doi.org/10.1145/3072959.3073647</a>","bibtex":"@article{Campen_Zorin_2017, title={Similarity maps and field-guided T-splines}, volume={36}, DOI={<a href=\"https://doi.org/10.1145/3072959.3073647\">10.1145/3072959.3073647</a>}, number={4}, journal={ACM Transactions on Graphics}, publisher={Association for Computing Machinery (ACM)}, author={Campen, Marcel and Zorin, Denis}, year={2017}, pages={1–16} }","chicago":"Campen, Marcel, and Denis Zorin. “Similarity Maps and Field-Guided T-Splines.” <i>ACM Transactions on Graphics</i> 36, no. 4 (2017): 1–16. <a href=\"https://doi.org/10.1145/3072959.3073647\">https://doi.org/10.1145/3072959.3073647</a>.","ama":"Campen M, Zorin D. Similarity maps and field-guided T-splines. <i>ACM Transactions on Graphics</i>. 2017;36(4):1-16. doi:<a href=\"https://doi.org/10.1145/3072959.3073647\">10.1145/3072959.3073647</a>","short":"M. Campen, D. Zorin, ACM Transactions on Graphics 36 (2017) 1–16."}},{"status":"public","publisher":"Wiley","_id":"60398","page":"567-588","volume":36,"user_id":"117512","citation":{"short":"M. Campen, Computer Graphics Forum 36 (2017) 567–588.","ama":"Campen M. Partitioning Surfaces Into Quadrilateral Patches: A Survey. <i>Computer Graphics Forum</i>. 2017;36(8):567-588. doi:<a href=\"https://doi.org/10.1111/cgf.13153\">10.1111/cgf.13153</a>","chicago":"Campen, Marcel. “Partitioning Surfaces Into Quadrilateral Patches: A Survey.” <i>Computer Graphics Forum</i> 36, no. 8 (2017): 567–88. <a href=\"https://doi.org/10.1111/cgf.13153\">https://doi.org/10.1111/cgf.13153</a>.","bibtex":"@article{Campen_2017, title={Partitioning Surfaces Into Quadrilateral Patches: A Survey}, volume={36}, DOI={<a href=\"https://doi.org/10.1111/cgf.13153\">10.1111/cgf.13153</a>}, number={8}, journal={Computer Graphics Forum}, publisher={Wiley}, author={Campen, Marcel}, year={2017}, pages={567–588} }","mla":"Campen, Marcel. “Partitioning Surfaces Into Quadrilateral Patches: A Survey.” <i>Computer Graphics Forum</i>, vol. 36, no. 8, Wiley, 2017, pp. 567–88, doi:<a href=\"https://doi.org/10.1111/cgf.13153\">10.1111/cgf.13153</a>.","apa":"Campen, M. (2017). Partitioning Surfaces Into Quadrilateral Patches: A Survey. <i>Computer Graphics Forum</i>, <i>36</i>(8), 567–588. <a href=\"https://doi.org/10.1111/cgf.13153\">https://doi.org/10.1111/cgf.13153</a>","ieee":"M. Campen, “Partitioning Surfaces Into Quadrilateral Patches: A Survey,” <i>Computer Graphics Forum</i>, vol. 36, no. 8, pp. 567–588, 2017, doi: <a href=\"https://doi.org/10.1111/cgf.13153\">10.1111/cgf.13153</a>."},"publication_identifier":{"issn":["0167-7055","1467-8659"]},"author":[{"id":"114904","full_name":"Campen, Marcel","first_name":"Marcel","orcid":"0000-0003-2340-3462","last_name":"Campen"}],"title":"Partitioning Surfaces Into Quadrilateral Patches: A Survey","year":"2017","intvolume":"        36","date_updated":"2025-07-14T12:42:33Z","publication_status":"published","language":[{"iso":"eng"}],"doi":"10.1111/cgf.13153","publication":"Computer Graphics Forum","issue":"8","abstract":[{"text":"<jats:title>Abstract</jats:title><jats:p>The efficient and practical representation and processing of geometrically or topologically complex shapes often demands a partitioning into simpler patches. Possibilities range from unstructured arrangements of arbitrarily shaped patches on the one end, to highly structured conforming networks of all‐quadrilateral patches on the other end of the spectrum. Due to its regularity, this latter extreme of conforming partitions with quadrilateral patches, called quad layouts, is most beneficial in many application scenarios, for instance enabling the use of tensor‐product representations based on splines or Bézier patches, grid‐based multi‐resolution techniques and discrete pixel‐based map representations. However, this type of partition is also most complicated to create due to the strict inherent structural restrictions. Traditionally often performed manually in a tedious and demanding process, research in computer graphics and geometry processing has led to a number of computer‐assisted, semi‐automatic, as well as fully automatic approaches to address this problem more efficiently. This survey provides a detailed discussion of this range of methods, treats their strengths and weaknesses and outlines open problems in this field of research.</jats:p>","lang":"eng"}],"extern":"1","date_created":"2025-06-26T08:14:22Z","department":[{"_id":"969"}],"type":"journal_article"},{"external_id":{"arxiv":["1705.02422"]},"date_created":"2025-06-26T08:37:34Z","type":"preprint","department":[{"_id":"969"}],"publication":"arXiv:1705.02422","citation":{"apa":"Campen, M., &#38; Zorin, D. (2017). On Discrete Conformal Seamless Similarity Maps. In <i>arXiv:1705.02422</i>.","ieee":"M. Campen and D. Zorin, “On Discrete Conformal Seamless Similarity Maps,” <i>arXiv:1705.02422</i>. 2017.","short":"M. Campen, D. Zorin, ArXiv:1705.02422 (2017).","chicago":"Campen, Marcel, and Denis Zorin. “On Discrete Conformal Seamless Similarity Maps.” <i>ArXiv:1705.02422</i>, 2017.","mla":"Campen, Marcel, and Denis Zorin. “On Discrete Conformal Seamless Similarity Maps.” <i>ArXiv:1705.02422</i>, 2017.","ama":"Campen M, Zorin D. On Discrete Conformal Seamless Similarity Maps. <i>arXiv:170502422</i>. Published online 2017.","bibtex":"@article{Campen_Zorin_2017, title={On Discrete Conformal Seamless Similarity Maps}, journal={arXiv:1705.02422}, author={Campen, Marcel and Zorin, Denis}, year={2017} }"},"abstract":[{"text":"An algorithm for the computation of global discrete conformal\r\nparametrizations with prescribed global holonomy signatures for triangle meshes\r\nwas recently described in [Campen and Zorin 2017]. In this paper we provide a\r\ndetailed analysis of convergence and correctness of this algorithm. We\r\ngeneralize and extend ideas of [Springborn et al. 2008] to show a connection of\r\nthe algorithm to Newton's algorithm applied to solving the system of\r\nconstraints on angles in the parametric domain, and demonstrate that this\r\nsystem can be obtained as a gradient of a convex energy.","lang":"eng"}],"extern":"1","language":[{"iso":"eng"}],"_id":"60406","user_id":"117512","status":"public","year":"2017","title":"On Discrete Conformal Seamless Similarity Maps","author":[{"last_name":"Campen","first_name":"Marcel","orcid":"0000-0003-2340-3462","full_name":"Campen, Marcel","id":"114904"},{"full_name":"Zorin, Denis","first_name":"Denis","last_name":"Zorin"}],"date_updated":"2025-07-14T12:42:13Z"},{"author":[{"id":"114904","full_name":"Campen, Marcel","last_name":"Campen","first_name":"Marcel","orcid":"0000-0003-2340-3462"}],"publication_identifier":{"issn":["0272-1716","1558-1756"]},"title":"Tiling the Bunny: Quad Layouts for Efficient 3D Geometry Representation","year":"2017","intvolume":"        37","date_updated":"2025-07-14T12:45:26Z","publication_status":"published","language":[{"iso":"eng"}],"doi":"10.1109/mcg.2017.35","publication":"IEEE Computer Graphics and Applications","issue":"3","extern":"1","date_created":"2025-06-26T08:12:08Z","department":[{"_id":"969"}],"type":"journal_article","status":"public","publisher":"Institute of Electrical and Electronics Engineers (IEEE)","_id":"60397","page":"88-95","volume":37,"user_id":"117512","citation":{"mla":"Campen, Marcel. “Tiling the Bunny: Quad Layouts for Efficient 3D Geometry Representation.” <i>IEEE Computer Graphics and Applications</i>, vol. 37, no. 3, Institute of Electrical and Electronics Engineers (IEEE), 2017, pp. 88–95, doi:<a href=\"https://doi.org/10.1109/mcg.2017.35\">10.1109/mcg.2017.35</a>.","bibtex":"@article{Campen_2017, title={Tiling the Bunny: Quad Layouts for Efficient 3D Geometry Representation}, volume={37}, DOI={<a href=\"https://doi.org/10.1109/mcg.2017.35\">10.1109/mcg.2017.35</a>}, number={3}, journal={IEEE Computer Graphics and Applications}, publisher={Institute of Electrical and Electronics Engineers (IEEE)}, author={Campen, Marcel}, year={2017}, pages={88–95} }","ama":"Campen M. Tiling the Bunny: Quad Layouts for Efficient 3D Geometry Representation. <i>IEEE Computer Graphics and Applications</i>. 2017;37(3):88-95. doi:<a href=\"https://doi.org/10.1109/mcg.2017.35\">10.1109/mcg.2017.35</a>","ieee":"M. Campen, “Tiling the Bunny: Quad Layouts for Efficient 3D Geometry Representation,” <i>IEEE Computer Graphics and Applications</i>, vol. 37, no. 3, pp. 88–95, 2017, doi: <a href=\"https://doi.org/10.1109/mcg.2017.35\">10.1109/mcg.2017.35</a>.","apa":"Campen, M. (2017). Tiling the Bunny: Quad Layouts for Efficient 3D Geometry Representation. <i>IEEE Computer Graphics and Applications</i>, <i>37</i>(3), 88–95. <a href=\"https://doi.org/10.1109/mcg.2017.35\">https://doi.org/10.1109/mcg.2017.35</a>","short":"M. Campen, IEEE Computer Graphics and Applications 37 (2017) 88–95.","chicago":"Campen, Marcel. “Tiling the Bunny: Quad Layouts for Efficient 3D Geometry Representation.” <i>IEEE Computer Graphics and Applications</i> 37, no. 3 (2017): 88–95. <a href=\"https://doi.org/10.1109/mcg.2017.35\">https://doi.org/10.1109/mcg.2017.35</a>."}},{"citation":{"apa":"Jungmann, A., &#38; Kleinjohann, B. (2016). Automatic Composition of Service-based Image Processing Applications. <i>Proceedings of the 13th IEEE International Conference on Services Computing (SCC)</i>, 106–113.","ieee":"A. Jungmann and B. Kleinjohann, “Automatic Composition of Service-based Image Processing Applications,” in <i>Proceedings of the 13th IEEE International Conference on Services Computing (SCC)</i>, 2016, pp. 106–113.","chicago":"Jungmann, Alexander, and Bernd Kleinjohann. “Automatic Composition of Service-Based Image Processing Applications.” In <i>Proceedings of the 13th IEEE International Conference on Services Computing (SCC)</i>, 106–13. IEEE Computer Society, 2016.","short":"A. Jungmann, B. Kleinjohann, in: Proceedings of the 13th IEEE International Conference on Services Computing (SCC), IEEE Computer Society, 2016, pp. 106–113.","mla":"Jungmann, Alexander, and Bernd Kleinjohann. “Automatic Composition of Service-Based Image Processing Applications.” <i>Proceedings of the 13th IEEE International Conference on Services Computing (SCC)</i>, IEEE Computer Society, 2016, pp. 106–13.","ama":"Jungmann A, Kleinjohann B. Automatic Composition of Service-based Image Processing Applications. In: <i>Proceedings of the 13th IEEE International Conference on Services Computing (SCC)</i>. IEEE Computer Society; 2016:106-113.","bibtex":"@inproceedings{Jungmann_Kleinjohann_2016, title={Automatic Composition of Service-based Image Processing Applications}, booktitle={Proceedings of the 13th IEEE International Conference on Services Computing (SCC)}, publisher={IEEE Computer Society}, author={Jungmann, Alexander and Kleinjohann, Bernd}, year={2016}, pages={106–113} }"},"publication":"Proceedings of the 13th IEEE International Conference on Services Computing (SCC)","abstract":[{"text":"In the Image Processing domain, automated generation of complex Image Processing functionality is highly desirable; e.g., for rapid prototyping. Service composition techniques, in turn, facilitate automated generation of complex functionality based on building blocks in terms of services. For that reason, we aim for transferring the Service Composition paradigm into the Image Processing domain. In this paper, we present our symbolic composition approach that enables us to automatically generate Image Processing applications. Functionality of Image Processing services is described by means of a variant of first-order logic, which grounds on domain knowledge operationalized in terms of ontologies. A Petri-net formalism serves as basis for modeling data-flow of services and composed services. A planning-based composition algorithm automatically composes complex data-flow for a required functionality. A brief evaluation serves as proof of concept.","lang":"eng"}],"date_created":"2021-09-28T11:29:00Z","department":[{"_id":"672"}],"type":"conference","author":[{"full_name":"Jungmann, Alexander","first_name":"Alexander","last_name":"Jungmann"},{"last_name":"Kleinjohann","first_name":"Bernd","full_name":"Kleinjohann, Bernd"}],"conference":{"end_date":"2016-07-02","start_date":"2016-06-27"},"year":"2016","title":"Automatic Composition of Service-based Image Processing Applications","status":"public","date_updated":"2022-01-06T06:56:50Z","publisher":"IEEE Computer Society","_id":"25070","language":[{"iso":"eng"}],"page":"106-113","user_id":"21240"},{"_id":"195","publisher":"Universität Paderborn","ddc":["040"],"user_id":"14052","author":[{"full_name":"Platenius, Marie Christin","first_name":"Marie Christin","last_name":"Platenius"}],"title":"Fuzzy Matching of Comprehensive Service Specifications","status":"public","year":"2016","has_accepted_license":"1","date_updated":"2022-01-06T06:54:06Z","date_created":"2017-10-17T12:41:30Z","file":[{"access_level":"closed","file_size":18246710,"file_name":"195-Dissertation_-_Marie_Christin_Platenius.pdf","date_updated":"2018-03-21T12:15:58Z","relation":"main_file","success":1,"content_type":"application/pdf","file_id":"1527","creator":"florida","date_created":"2018-03-21T12:15:58Z"}],"department":[{"_id":"76"}],"type":"dissertation","supervisor":[{"full_name":"Schäfer, Wilhelm","last_name":"Schäfer","first_name":"Wilhelm"}],"citation":{"chicago":"Platenius, Marie Christin. <i>Fuzzy Matching of Comprehensive Service Specifications</i>. Universität Paderborn, 2016.","short":"M.C. Platenius, Fuzzy Matching of Comprehensive Service Specifications, Universität Paderborn, 2016.","apa":"Platenius, M. C. (2016). <i>Fuzzy Matching of Comprehensive Service Specifications</i>. Universität Paderborn.","ieee":"M. C. Platenius, <i>Fuzzy Matching of Comprehensive Service Specifications</i>. Universität Paderborn, 2016.","ama":"Platenius MC. <i>Fuzzy Matching of Comprehensive Service Specifications</i>. Universität Paderborn; 2016.","bibtex":"@book{Platenius_2016, title={Fuzzy Matching of Comprehensive Service Specifications}, publisher={Universität Paderborn}, author={Platenius, Marie Christin}, year={2016} }","mla":"Platenius, Marie Christin. <i>Fuzzy Matching of Comprehensive Service Specifications</i>. Universität Paderborn, 2016."},"file_date_updated":"2018-03-21T12:15:58Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt B1","_id":"9"},{"name":"SFB 901 - Project Area B","_id":"3"}]}]