[{"author":[{"full_name":"Schaefer, Johannes Sebastian","first_name":"Johannes Sebastian","last_name":"Schaefer","id":"30291"}],"status":"public","title":"Routing Algorithms on Delayed Networks for Disaster Management Support","year":"2016","date_updated":"2022-01-06T07:03:23Z","language":[{"iso":"eng"}],"_id":"689","publisher":"Universität Paderborn","user_id":"477","supervisor":[{"id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"citation":{"short":"J.S. Schaefer, Routing Algorithms on Delayed Networks for Disaster Management Support, Universität Paderborn, 2016.","chicago":"Schaefer, Johannes Sebastian. <i>Routing Algorithms on Delayed Networks for Disaster Management Support</i>. Universität Paderborn, 2016.","ieee":"J. S. Schaefer, <i>Routing Algorithms on Delayed Networks for Disaster Management Support</i>. Universität Paderborn, 2016.","apa":"Schaefer, J. S. (2016). <i>Routing Algorithms on Delayed Networks for Disaster Management Support</i>. Universität Paderborn.","bibtex":"@book{Schaefer_2016, title={Routing Algorithms on Delayed Networks for Disaster Management Support}, publisher={Universität Paderborn}, author={Schaefer, Johannes Sebastian}, year={2016} }","ama":"Schaefer JS. <i>Routing Algorithms on Delayed Networks for Disaster Management Support</i>. Universität Paderborn; 2016.","mla":"Schaefer, Johannes Sebastian. <i>Routing Algorithms on Delayed Networks for Disaster Management Support</i>. Universität Paderborn, 2016."},"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"date_created":"2017-11-14T06:51:37Z","department":[{"_id":"63"}],"type":"mastersthesis"},{"department":[{"_id":"211"}],"type":"journal_article","date_created":"2019-01-25T08:58:19Z","citation":{"apa":"Kremer, H.-H., Büchter, K., &#38; Buchmann, U. (2016). Inklusion in der beruflichen Bildung. <i>bwp@ Berufs- und Wirtschaftspädagogik - online</i>, (30).","ieee":"H.-H. Kremer, K. Büchter, and U. Buchmann, “Inklusion in der beruflichen Bildung,” <i>bwp@ Berufs- und Wirtschaftspädagogik - online</i>, no. 30, 2016.","chicago":"Kremer, H.-Hugo, K. Büchter, and U. Buchmann. “Inklusion in der beruflichen Bildung.” <i>bwp@ Berufs- und Wirtschaftspädagogik - online</i>, no. 30 (2016).","short":"H.-H. Kremer, K. Büchter, U. Buchmann, bwp@ Berufs- und Wirtschaftspädagogik - online (2016).","mla":"Kremer, H. Hugo, et al. “Inklusion in der beruflichen Bildung.” <i>bwp@ Berufs- und Wirtschaftspädagogik - online</i>, no. 30, 2016.","ama":"Kremer H-H, Büchter K, Buchmann U. Inklusion in der beruflichen Bildung. <i>bwp@ Berufs- und Wirtschaftspädagogik - online</i>. 2016;(30).","bibtex":"@article{Kremer_Büchter_Buchmann_2016, title={Inklusion in der beruflichen Bildung}, number={30}, journal={bwp@ Berufs- und Wirtschaftspädagogik - online}, author={Kremer, H.-Hugo and Büchter, K. and Buchmann, U.}, year={2016} }"},"issue":"30","publication":"bwp@ Berufs- und Wirtschaftspädagogik - online","user_id":"74378","language":[{"iso":"ger"}],"_id":"6977","main_file_link":[{"url":"http://www.bwpat.de/ausgabe30/editorial_bwpat30.pdf"}],"date_updated":"2022-01-06T07:03:25Z","author":[{"id":"15280","last_name":"Kremer","first_name":"H.-Hugo","full_name":"Kremer, H.-Hugo"},{"first_name":"K.","last_name":"Büchter","full_name":"Büchter, K."},{"full_name":"Buchmann, U.","last_name":"Buchmann","first_name":"U."}],"status":"public","year":"2016","title":"Inklusion in der beruflichen Bildung"},{"user_id":"15415","_id":"16450","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:52:50Z","status":"public","title":"Asymptotically Optimal Gathering on a Grid","year":"2016","author":[{"last_name":"Cord-Landwehr","first_name":"Andreas ","full_name":"Cord-Landwehr, Andreas "},{"id":"146","full_name":"Fischer, Matthias","last_name":"Fischer","first_name":"Matthias"},{"id":"37827","full_name":"Jung, Daniel","last_name":"Jung","first_name":"Daniel"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide"}],"type":"preprint","department":[{"_id":"63"}],"external_id":{"arxiv":["1602.03303"]},"date_created":"2020-04-07T07:20:47Z","abstract":[{"lang":"eng","text":"In this paper, we solve the local gathering problem of a swarm of $n$\r\nindistinguishable, point-shaped robots on a two dimensional grid in\r\nasymptotically optimal time $\\mathcal{O}(n)$ in the fully synchronous\r\n$\\mathcal{FSYNC}$ time model. Given an arbitrarily distributed (yet connected)\r\nswarm of robots, the gathering problem on the grid is to locate all robots\r\nwithin a $2\\times 2$-sized area that is not known beforehand. Two robots are\r\nconnected if they are vertical or horizontal neighbors on the grid. The\r\nlocality constraint means that no global control, no compass, no global\r\ncommunication and only local vision is available; hence, a robot can only see\r\nits grid neighbors up to a constant $L_1$-distance, which also limits its\r\nmovements. A robot can move to one of its eight neighboring grid cells and if\r\ntwo or more robots move to the same location they are \\emph{merged} to be only\r\none robot. The locality constraint is the significant challenging issue here,\r\nsince robot movements must not harm the (only globally checkable) swarm\r\nconnectivity. For solving the gathering problem, we provide a synchronous\r\nalgorithm -- executed by every robot -- which ensures that robots merge without\r\nbreaking the swarm connectivity. In our model, robots can obtain a special\r\nstate, which marks such a robot to be performing specific connectivity\r\npreserving movements in order to allow later merge operations of the swarm.\r\nCompared to the grid, for gathering in the Euclidean plane for the same robot\r\nand time model the best known upper bound is $\\mathcal{O}(n^2)$."}],"publication":"arXiv:1602.03303","citation":{"ieee":"A. Cord-Landwehr, M. Fischer, D. Jung, and F. Meyer auf der Heide, “Asymptotically Optimal Gathering on a Grid,” <i>arXiv:1602.03303</i>. 2016.","mla":"Cord-Landwehr, Andreas, et al. “Asymptotically Optimal Gathering on a Grid.” <i>ArXiv:1602.03303</i>, 2016.","apa":"Cord-Landwehr, A., Fischer, M., Jung, D., &#38; Meyer auf der Heide, F. (2016). Asymptotically Optimal Gathering on a Grid. <i>ArXiv:1602.03303</i>.","bibtex":"@article{Cord-Landwehr_Fischer_Jung_Meyer auf der Heide_2016, title={Asymptotically Optimal Gathering on a Grid}, journal={arXiv:1602.03303}, author={Cord-Landwehr, Andreas  and Fischer, Matthias and Jung, Daniel and Meyer auf der Heide, Friedhelm}, year={2016} }","short":"A. Cord-Landwehr, M. Fischer, D. Jung, F. Meyer auf der Heide, ArXiv:1602.03303 (2016).","ama":"Cord-Landwehr A, Fischer M, Jung D, Meyer auf der Heide F. Asymptotically Optimal Gathering on a Grid. <i>arXiv:160203303</i>. 2016.","chicago":"Cord-Landwehr, Andreas , Matthias Fischer, Daniel Jung, and Friedhelm Meyer auf der Heide. “Asymptotically Optimal Gathering on a Grid.” <i>ArXiv:1602.03303</i>, 2016."}},{"citation":{"bibtex":"@inbook{Dellnitz_Eckstein_Flaßkamp_Friedel_Horenkamp_Köhler_Ober-Blöbaum_Peitz_Tiemeyer_2016, place={Cham}, title={Multiobjective Optimal Control Methods for the Development of an Intelligent Cruise Control}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-23413-7_87\">10.1007/978-3-319-23413-7_87</a>}, booktitle={Mathematics in Industry}, author={Dellnitz, Michael and Eckstein, Julian and Flaßkamp, Kathrin and Friedel, Patrick and Horenkamp, Christian and Köhler, Ulrich and Ober-Blöbaum, Sina and Peitz, Sebastian and Tiemeyer, Sebastian}, year={2016} }","ama":"Dellnitz M, Eckstein J, Flaßkamp K, et al. Multiobjective Optimal Control Methods for the Development of an Intelligent Cruise Control. In: <i>Mathematics in Industry</i>. Cham; 2016. doi:<a href=\"https://doi.org/10.1007/978-3-319-23413-7_87\">10.1007/978-3-319-23413-7_87</a>","mla":"Dellnitz, Michael, et al. “Multiobjective Optimal Control Methods for the Development of an Intelligent Cruise Control.” <i>Mathematics in Industry</i>, 2016, doi:<a href=\"https://doi.org/10.1007/978-3-319-23413-7_87\">10.1007/978-3-319-23413-7_87</a>.","short":"M. Dellnitz, J. Eckstein, K. Flaßkamp, P. Friedel, C. Horenkamp, U. Köhler, S. Ober-Blöbaum, S. Peitz, S. Tiemeyer, in: Mathematics in Industry, Cham, 2016.","chicago":"Dellnitz, Michael, Julian Eckstein, Kathrin Flaßkamp, Patrick Friedel, Christian Horenkamp, Ulrich Köhler, Sina Ober-Blöbaum, Sebastian Peitz, and Sebastian Tiemeyer. “Multiobjective Optimal Control Methods for the Development of an Intelligent Cruise Control.” In <i>Mathematics in Industry</i>. Cham, 2016. <a href=\"https://doi.org/10.1007/978-3-319-23413-7_87\">https://doi.org/10.1007/978-3-319-23413-7_87</a>.","ieee":"M. Dellnitz <i>et al.</i>, “Multiobjective Optimal Control Methods for the Development of an Intelligent Cruise Control,” in <i>Mathematics in Industry</i>, Cham, 2016.","apa":"Dellnitz, M., Eckstein, J., Flaßkamp, K., Friedel, P., Horenkamp, C., Köhler, U., … Tiemeyer, S. (2016). Multiobjective Optimal Control Methods for the Development of an Intelligent Cruise Control. In <i>Mathematics in Industry</i>. Cham. <a href=\"https://doi.org/10.1007/978-3-319-23413-7_87\">https://doi.org/10.1007/978-3-319-23413-7_87</a>"},"publication":"Mathematics in Industry","department":[{"_id":"101"}],"type":"book_chapter","date_created":"2020-04-16T05:37:11Z","place":"Cham","publication_status":"published","date_updated":"2022-01-06T06:52:52Z","author":[{"last_name":"Dellnitz","first_name":"Michael","full_name":"Dellnitz, Michael"},{"full_name":"Eckstein, Julian","first_name":"Julian","last_name":"Eckstein"},{"last_name":"Flaßkamp","first_name":"Kathrin","full_name":"Flaßkamp, Kathrin"},{"full_name":"Friedel, Patrick","first_name":"Patrick","last_name":"Friedel"},{"full_name":"Horenkamp, Christian","last_name":"Horenkamp","first_name":"Christian"},{"first_name":"Ulrich","last_name":"Köhler","full_name":"Köhler, Ulrich"},{"full_name":"Ober-Blöbaum, Sina","last_name":"Ober-Blöbaum","first_name":"Sina"},{"full_name":"Peitz, Sebastian","first_name":"Sebastian","last_name":"Peitz"},{"first_name":"Sebastian","last_name":"Tiemeyer","full_name":"Tiemeyer, Sebastian"}],"publication_identifier":{"isbn":["9783319234120","9783319234137"],"issn":["1612-3956","2198-3283"]},"status":"public","title":"Multiobjective Optimal Control Methods for the Development of an Intelligent Cruise Control","year":"2016","user_id":"15701","doi":"10.1007/978-3-319-23413-7_87","language":[{"iso":"eng"}],"_id":"16579"},{"citation":{"short":"A. Ziessler, M.H.-V. Molo, M. Dellnitz, Journal of Computational Dynamics (2016) 5–5.","chicago":"Ziessler, Adrian, Mirko Hessel-Von Molo, and Michael Dellnitz. “On the Computation of Attractors for Delay Differential Equations.” <i>Journal of Computational Dynamics</i>, 2016, 5–5. <a href=\"https://doi.org/10.3934/jcd.2016005\">https://doi.org/10.3934/jcd.2016005</a>.","ieee":"A. Ziessler, M. H.-V. Molo, and M. Dellnitz, “On the computation of attractors for delay differential equations,” <i>Journal of Computational Dynamics</i>, pp. 5–5, 2016.","apa":"Ziessler, A., Molo, M. H.-V., &#38; Dellnitz, M. (2016). On the computation of attractors for delay differential equations. <i>Journal of Computational Dynamics</i>, 5–5. <a href=\"https://doi.org/10.3934/jcd.2016005\">https://doi.org/10.3934/jcd.2016005</a>","bibtex":"@article{Ziessler_Molo_Dellnitz_2016, title={On the computation of attractors for delay differential equations}, DOI={<a href=\"https://doi.org/10.3934/jcd.2016005\">10.3934/jcd.2016005</a>}, journal={Journal of Computational Dynamics}, author={Ziessler, Adrian and Molo, Mirko Hessel-Von and Dellnitz, Michael}, year={2016}, pages={5–5} }","ama":"Ziessler A, Molo MH-V, Dellnitz M. On the computation of attractors for delay differential equations. <i>Journal of Computational Dynamics</i>. 2016:5-5. doi:<a href=\"https://doi.org/10.3934/jcd.2016005\">10.3934/jcd.2016005</a>","mla":"Ziessler, Adrian, et al. “On the Computation of Attractors for Delay Differential Equations.” <i>Journal of Computational Dynamics</i>, 2016, pp. 5–5, doi:<a href=\"https://doi.org/10.3934/jcd.2016005\">10.3934/jcd.2016005</a>."},"publication":"Journal of Computational Dynamics","department":[{"_id":"101"}],"type":"journal_article","date_created":"2020-04-16T05:38:13Z","publication_status":"published","date_updated":"2022-01-06T06:52:52Z","publication_identifier":{"issn":["2158-2491"]},"author":[{"full_name":"Ziessler, Adrian","last_name":"Ziessler","first_name":"Adrian"},{"first_name":"Mirko Hessel-Von","last_name":"Molo","full_name":"Molo, Mirko Hessel-Von"},{"last_name":"Dellnitz","first_name":"Michael","full_name":"Dellnitz, Michael"}],"title":"On the computation of attractors for delay differential equations","year":"2016","status":"public","user_id":"15701","doi":"10.3934/jcd.2016005","_id":"16580","language":[{"iso":"eng"}],"page":"5-5"},{"oa":"1","file_date_updated":"2018-06-25T07:53:54Z","citation":{"chicago":"Dräxler, Sevil, and Holger Karl. “Placement of Services with Flexible Structures Specified by a YANG Data Model.” In <i>Proceedings of the 2nd International IEEE Conference on Network Softwarization (NetSoft)</i>, 184--192, 2016. <a href=\"https://doi.org/10.1109/NETSOFT.2016.7502412\">https://doi.org/10.1109/NETSOFT.2016.7502412</a>.","short":"S. Dräxler, H. Karl, in: Proceedings of the 2nd International IEEE Conference on Network Softwarization (NetSoft), 2016, pp. 184--192.","apa":"Dräxler, S., &#38; Karl, H. (2016). Placement of Services with Flexible Structures Specified by a YANG Data Model. In <i>Proceedings of the 2nd International IEEE Conference on Network Softwarization (NetSoft)</i> (pp. 184--192). <a href=\"https://doi.org/10.1109/NETSOFT.2016.7502412\">https://doi.org/10.1109/NETSOFT.2016.7502412</a>","ieee":"S. Dräxler and H. Karl, “Placement of Services with Flexible Structures Specified by a YANG Data Model,” in <i>Proceedings of the 2nd International IEEE Conference on Network Softwarization (NetSoft)</i>, 2016, pp. 184--192.","ama":"Dräxler S, Karl H. Placement of Services with Flexible Structures Specified by a YANG Data Model. In: <i>Proceedings of the 2nd International IEEE Conference on Network Softwarization (NetSoft)</i>. ; 2016:184--192. doi:<a href=\"https://doi.org/10.1109/NETSOFT.2016.7502412\">10.1109/NETSOFT.2016.7502412</a>","bibtex":"@inproceedings{Dräxler_Karl_2016, title={Placement of Services with Flexible Structures Specified by a YANG Data Model}, DOI={<a href=\"https://doi.org/10.1109/NETSOFT.2016.7502412\">10.1109/NETSOFT.2016.7502412</a>}, booktitle={Proceedings of the 2nd International IEEE Conference on Network Softwarization (NetSoft)}, author={Dräxler, Sevil and Karl, Holger}, year={2016}, pages={184--192} }","mla":"Dräxler, Sevil, and Holger Karl. “Placement of Services with Flexible Structures Specified by a YANG Data Model.” <i>Proceedings of the 2nd International IEEE Conference on Network Softwarization (NetSoft)</i>, 2016, pp. 184--192, doi:<a href=\"https://doi.org/10.1109/NETSOFT.2016.7502412\">10.1109/NETSOFT.2016.7502412</a>."},"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C4","_id":"16"},{"_id":"4","name":"SFB 901 - Project Area C"},{"grant_number":"671517","_id":"25","name":"SONATA NFV: Agile Service Development and Orchestration in 5G Virtualized Networks","call_identifier":"5G PPP Phase 1"}],"page":"184--192","urn":"1665","_id":"166","user_id":"31764","ddc":["040"],"status":"public","has_accepted_license":"1","file":[{"creator":"sevilmeh","date_created":"2018-06-25T07:53:54Z","access_level":"open_access","file_size":1471937,"file_name":"RIS.pdf","date_updated":"2018-06-25T07:53:54Z","relation":"main_file","content_type":"application/pdf","file_id":"3322"}],"date_created":"2017-10-17T12:41:24Z","type":"conference","department":[{"_id":"75"}],"publication":"Proceedings of the 2nd International IEEE Conference on Network Softwarization (NetSoft)","abstract":[{"lang":"eng","text":"Network function virtualization and software-defined networking allow services consisting of virtual network functions to be designed and implemented with great flexibility by facilitating automatic deployments, migrations, and reconfigurations for services and their components. For extended flexibility, we go beyond seeing services as a fixed chain of functions. We present a YANG model for describing the service structure in deployment requests in a flexible way that enables changing the order of functions in case the order of traversing them does not affect the functionality of the service. Upon receiving such requests, the network orchestration system can choose the optimal composition of service components that gives the best results for placement of services in the network. This introduces new complexities to the placement problem by greatly increasing the number of possible ways a service can be composed. In this paper, we describe a heuristic solution that selects a Pareto set of the possible compositions of a service as well as possible combinations of different services, with respect to different resource requirements of the services. Our evaluations show that the selected combinations consist of representative samples of possible structures and requirements and therefore, can result in optimal or close-to-optimal placement results."}],"main_file_link":[{"url":"http://ieeexplore.ieee.org/search/searchresult.jsp?newsearch=true&queryText=10.1109%2FNETSOFT.2016.7502412"}],"doi":"10.1109/NETSOFT.2016.7502412","year":"2016","title":"Placement of Services with Flexible Structures Specified by a YANG Data Model","author":[{"full_name":"Dräxler, Sevil","first_name":"Sevil","last_name":"Dräxler","id":"31764"},{"id":"126","first_name":"Holger","last_name":"Karl","full_name":"Karl, Holger"}],"date_updated":"2022-01-06T06:52:53Z"},{"_id":"167","publisher":"Universität Paderborn","main_file_link":[{"url":"http://nbn-resolving.de/urn:nbn:de:hbz:466:2-24853"}],"user_id":"25078","ddc":["040"],"author":[{"first_name":"Peter","last_name":"Günther","full_name":"Günther, Peter"}],"year":"2016","title":"Physical attacks on pairing-based cryptography","status":"public","has_accepted_license":"1","date_updated":"2022-01-06T06:52:54Z","date_created":"2017-10-17T12:41:24Z","file":[{"date_created":"2018-03-21T12:43:21Z","creator":"florida","file_id":"1542","content_type":"application/pdf","success":1,"file_name":"167-thesis_peter_guenther.pdf","access_level":"closed","file_size":9456552,"relation":"main_file","date_updated":"2018-03-21T12:43:21Z"}],"department":[{"_id":"64"}],"type":"dissertation","citation":{"ieee":"P. Günther, <i>Physical attacks on pairing-based cryptography</i>. Universität Paderborn, 2016.","apa":"Günther, P. (2016). <i>Physical attacks on pairing-based cryptography</i>. Universität Paderborn.","chicago":"Günther, Peter. <i>Physical Attacks on Pairing-Based Cryptography</i>. Universität Paderborn, 2016.","short":"P. Günther, Physical Attacks on Pairing-Based Cryptography, Universität Paderborn, 2016.","mla":"Günther, Peter. <i>Physical Attacks on Pairing-Based Cryptography</i>. Universität Paderborn, 2016.","bibtex":"@book{Günther_2016, title={Physical attacks on pairing-based cryptography}, publisher={Universität Paderborn}, author={Günther, Peter}, year={2016} }","ama":"Günther P. <i>Physical Attacks on Pairing-Based Cryptography</i>. Universität Paderborn; 2016."},"supervisor":[{"id":"23","full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes"}],"file_date_updated":"2018-03-21T12:43:21Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"name":"SFB 901 - Project Area C","_id":"4"}]},{"series_title":"LNCS 9594","language":[{"iso":"eng"}],"doi":"10.1007/978-3-319-30668-1_18","title":"Patterns for Constructing Mutation Operators: Limiting the Search Space in a Software Engineering Application","year":"2016","author":[{"id":"49079","full_name":"Kühne, Thomas","first_name":"Thomas","last_name":"Kühne"},{"first_name":"Heiko","last_name":"Hamann","full_name":"Hamann, Heiko"},{"full_name":"Arifulina, Svetlana","last_name":"Arifulina","first_name":"Svetlana"},{"id":"107","last_name":"Engels","first_name":"Gregor","full_name":"Engels, Gregor"}],"date_updated":"2022-01-06T06:52:58Z","file":[{"creator":"florida","date_created":"2018-03-21T12:41:08Z","file_name":"169-kuehne.pdf","access_level":"closed","file_size":2069427,"relation":"main_file","date_updated":"2018-03-21T12:41:08Z","file_id":"1540","success":1,"content_type":"application/pdf"}],"date_created":"2017-10-17T12:41:25Z","type":"conference","department":[{"_id":"66"},{"_id":"238"},{"_id":"63"}],"publication":"Proceedings of the 19th European Conference on Genetic Programming (EuroGP 2016)","abstract":[{"lang":"eng","text":"We apply methods of genetic programming to a general problem from software engineering, namely example-based generation of specifications. In particular, we focus on model transformation by example. The definition and implementation of model transformations is a task frequently carried out by domain experts, hence, a (semi-)automatic approach is desirable. This application is challenging because the underlying search space has rich semantics, is high-dimensional, and unstructured. Hence, a computationally brute-force approach would be unscalable and potentially infeasible. To address that problem, we develop a sophisticated approach of designing complex mutation operators. We define ‘patterns’ for constructing mutation operators and report a successful case study. Furthermore, the code of the evolved model transformation is required to have high maintainability and extensibility, that is, the code should be easily readable by domain experts. We report an evaluation of this approach in a software engineering case study."}],"page":"278--293","_id":"169","user_id":"57458","ddc":["040"],"status":"public","has_accepted_license":"1","file_date_updated":"2018-03-21T12:41:08Z","citation":{"chicago":"Kühne, Thomas, Heiko Hamann, Svetlana Arifulina, and Gregor Engels. “Patterns for Constructing Mutation Operators: Limiting the Search Space in a Software Engineering Application.” In <i>Proceedings of the 19th European Conference on Genetic Programming (EuroGP 2016)</i>, 278--293. LNCS 9594, 2016. <a href=\"https://doi.org/10.1007/978-3-319-30668-1_18\">https://doi.org/10.1007/978-3-319-30668-1_18</a>.","short":"T. Kühne, H. Hamann, S. Arifulina, G. Engels, in: Proceedings of the 19th European Conference on Genetic Programming (EuroGP 2016), 2016, pp. 278--293.","ieee":"T. Kühne, H. Hamann, S. Arifulina, and G. Engels, “Patterns for Constructing Mutation Operators: Limiting the Search Space in a Software Engineering Application,” in <i>Proceedings of the 19th European Conference on Genetic Programming (EuroGP 2016)</i>, 2016, pp. 278--293.","apa":"Kühne, T., Hamann, H., Arifulina, S., &#38; Engels, G. (2016). Patterns for Constructing Mutation Operators: Limiting the Search Space in a Software Engineering Application. In <i>Proceedings of the 19th European Conference on Genetic Programming (EuroGP 2016)</i> (pp. 278--293). <a href=\"https://doi.org/10.1007/978-3-319-30668-1_18\">https://doi.org/10.1007/978-3-319-30668-1_18</a>","bibtex":"@inproceedings{Kühne_Hamann_Arifulina_Engels_2016, series={LNCS 9594}, title={Patterns for Constructing Mutation Operators: Limiting the Search Space in a Software Engineering Application}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-30668-1_18\">10.1007/978-3-319-30668-1_18</a>}, booktitle={Proceedings of the 19th European Conference on Genetic Programming (EuroGP 2016)}, author={Kühne, Thomas and Hamann, Heiko and Arifulina, Svetlana and Engels, Gregor}, year={2016}, pages={278--293}, collection={LNCS 9594} }","ama":"Kühne T, Hamann H, Arifulina S, Engels G. Patterns for Constructing Mutation Operators: Limiting the Search Space in a Software Engineering Application. In: <i>Proceedings of the 19th European Conference on Genetic Programming (EuroGP 2016)</i>. LNCS 9594. ; 2016:278--293. doi:<a href=\"https://doi.org/10.1007/978-3-319-30668-1_18\">10.1007/978-3-319-30668-1_18</a>","mla":"Kühne, Thomas, et al. “Patterns for Constructing Mutation Operators: Limiting the Search Space in a Software Engineering Application.” <i>Proceedings of the 19th European Conference on Genetic Programming (EuroGP 2016)</i>, 2016, pp. 278--293, doi:<a href=\"https://doi.org/10.1007/978-3-319-30668-1_18\">10.1007/978-3-319-30668-1_18</a>."},"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt B1","_id":"9"},{"name":"SFB 901 - Project Area B","_id":"3"}]},{"publication":"Zeitschrift für das gesamte Genossenschaftswesen ZFGG ","issue":"Heft 1","citation":{"mla":"Krimphove, Dieter. “Lang/Weidmüller: Genossenschaftsfesetz. Gesetz Betreffend Des Erwerbs- Und Wirtschaftsgenossenschaften (Kommentar) 38. Auflage.” <i>Zeitschrift Für Das Gesamte Genossenschaftswesen ZFGG </i>, vol. Bd. 66, no. Heft 1, 2016, pp. 54–57.","ama":"Krimphove D. Lang/Weidmüller: Genossenschaftsfesetz. Gesetz betreffend des Erwerbs- und Wirtschaftsgenossenschaften (Kommentar) 38. Auflage. <i>Zeitschrift für das gesamte Genossenschaftswesen ZFGG </i>. 2016;Bd. 66(Heft 1):54-57.","bibtex":"@article{Krimphove_2016, title={Lang/Weidmüller: Genossenschaftsfesetz. Gesetz betreffend des Erwerbs- und Wirtschaftsgenossenschaften (Kommentar) 38. Auflage}, volume={Bd. 66}, number={Heft 1}, journal={Zeitschrift für das gesamte Genossenschaftswesen ZFGG }, author={Krimphove, Dieter}, year={2016}, pages={54–57} }","apa":"Krimphove, D. (2016). Lang/Weidmüller: Genossenschaftsfesetz. Gesetz betreffend des Erwerbs- und Wirtschaftsgenossenschaften (Kommentar) 38. Auflage. <i>Zeitschrift Für Das Gesamte Genossenschaftswesen ZFGG </i>.","ieee":"D. Krimphove, “Lang/Weidmüller: Genossenschaftsfesetz. Gesetz betreffend des Erwerbs- und Wirtschaftsgenossenschaften (Kommentar) 38. Auflage,” <i>Zeitschrift für das gesamte Genossenschaftswesen ZFGG </i>, vol. Bd. 66, no. Heft 1. pp. 54–57, 2016.","chicago":"Krimphove, Dieter. “Lang/Weidmüller: Genossenschaftsfesetz. Gesetz Betreffend Des Erwerbs- Und Wirtschaftsgenossenschaften (Kommentar) 38. Auflage.” <i>Zeitschrift Für Das Gesamte Genossenschaftswesen ZFGG </i>, 2016.","short":"D. Krimphove, Zeitschrift Für Das Gesamte Genossenschaftswesen ZFGG  Bd. 66 (2016) 54–57."},"type":"review","date_created":"2018-03-22T15:45:51Z","date_updated":"2022-01-06T06:52:59Z","title":"Lang/Weidmüller: Genossenschaftsfesetz. Gesetz betreffend des Erwerbs- und Wirtschaftsgenossenschaften (Kommentar) 38. Auflage","status":"public","year":"2016","author":[{"full_name":"Krimphove, Dieter","last_name":"Krimphove","first_name":"Dieter","id":"282"}],"user_id":"282","volume":"Bd. 66","page":"54-57","_id":"1695"},{"date_created":"2020-05-15T07:11:55Z","type":"journal_article","keyword":["pc2-ressources"],"citation":{"short":"J. Hanske, S. Aleksić, M. Ballaschk, M. Jurk, E. Shanina, M. Beerbaum, P. Schmieder, B.G. Keller, C. Rademacher, Journal of the American Chemical Society (2016) 12176–12186.","chicago":"Hanske, Jonas, Stevan Aleksić, Martin Ballaschk, Marcel Jurk, Elena Shanina, Monika Beerbaum, Peter Schmieder, Bettina G. Keller, and Christoph Rademacher. “Intradomain Allosteric Network Modulates Calcium Affinity of the C-Type Lectin Receptor Langerin.” <i>Journal of the American Chemical Society</i>, 2016, 12176–86. <a href=\"https://doi.org/10.1021/jacs.6b05458\">https://doi.org/10.1021/jacs.6b05458</a>.","apa":"Hanske, J., Aleksić, S., Ballaschk, M., Jurk, M., Shanina, E., Beerbaum, M., … Rademacher, C. (2016). Intradomain Allosteric Network Modulates Calcium Affinity of the C-Type Lectin Receptor Langerin. <i>Journal of the American Chemical Society</i>, 12176–12186. <a href=\"https://doi.org/10.1021/jacs.6b05458\">https://doi.org/10.1021/jacs.6b05458</a>","ieee":"J. Hanske <i>et al.</i>, “Intradomain Allosteric Network Modulates Calcium Affinity of the C-Type Lectin Receptor Langerin,” <i>Journal of the American Chemical Society</i>, pp. 12176–12186, 2016.","ama":"Hanske J, Aleksić S, Ballaschk M, et al. Intradomain Allosteric Network Modulates Calcium Affinity of the C-Type Lectin Receptor Langerin. <i>Journal of the American Chemical Society</i>. 2016:12176-12186. doi:<a href=\"https://doi.org/10.1021/jacs.6b05458\">10.1021/jacs.6b05458</a>","bibtex":"@article{Hanske_Aleksić_Ballaschk_Jurk_Shanina_Beerbaum_Schmieder_Keller_Rademacher_2016, title={Intradomain Allosteric Network Modulates Calcium Affinity of the C-Type Lectin Receptor Langerin}, DOI={<a href=\"https://doi.org/10.1021/jacs.6b05458\">10.1021/jacs.6b05458</a>}, journal={Journal of the American Chemical Society}, author={Hanske, Jonas and Aleksić, Stevan and Ballaschk, Martin and Jurk, Marcel and Shanina, Elena and Beerbaum, Monika and Schmieder, Peter and Keller, Bettina G. and Rademacher, Christoph}, year={2016}, pages={12176–12186} }","mla":"Hanske, Jonas, et al. “Intradomain Allosteric Network Modulates Calcium Affinity of the C-Type Lectin Receptor Langerin.” <i>Journal of the American Chemical Society</i>, 2016, pp. 12176–86, doi:<a href=\"https://doi.org/10.1021/jacs.6b05458\">10.1021/jacs.6b05458</a>."},"publication":"Journal of the American Chemical Society","project":[{"name":"Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}],"_id":"16954","language":[{"iso":"eng"}],"page":"12176-12186","doi":"10.1021/jacs.6b05458","user_id":"61189","author":[{"full_name":"Hanske, Jonas","last_name":"Hanske","first_name":"Jonas"},{"last_name":"Aleksić","first_name":"Stevan","full_name":"Aleksić, Stevan"},{"full_name":"Ballaschk, Martin","first_name":"Martin","last_name":"Ballaschk"},{"first_name":"Marcel","last_name":"Jurk","full_name":"Jurk, Marcel"},{"full_name":"Shanina, Elena","last_name":"Shanina","first_name":"Elena"},{"last_name":"Beerbaum","first_name":"Monika","full_name":"Beerbaum, Monika"},{"first_name":"Peter","last_name":"Schmieder","full_name":"Schmieder, Peter"},{"full_name":"Keller, Bettina G.","last_name":"Keller","first_name":"Bettina G."},{"last_name":"Rademacher","first_name":"Christoph","full_name":"Rademacher, Christoph"}],"publication_identifier":{"issn":["0002-7863","1520-5126"]},"title":"Intradomain Allosteric Network Modulates Calcium Affinity of the C-Type Lectin Receptor Langerin","year":"2016","status":"public","date_updated":"2022-01-06T06:53:00Z","publication_status":"published"},{"file":[{"creator":"florida","date_created":"2018-03-21T12:40:27Z","date_updated":"2018-03-21T12:40:27Z","relation":"main_file","file_size":285299,"access_level":"closed","file_name":"170-main_04.pdf","success":1,"content_type":"application/pdf","file_id":"1539"}],"date_created":"2017-10-17T12:41:25Z","type":"conference","department":[{"_id":"77"}],"publication":"Workshop on Formal and Model-Driven Techniques for Developing Trustworthy Systems","related_material":{"link":[{"url":"https://pdfs.semanticscholar.org/58cd/94c8b2335d16aa2558f711cf81b3f7746696.pdf","relation":"contains"}]},"abstract":[{"text":"We present PAndA2, an extendable, static analysis tool for Android  apps  which  examines  permission  related security  threats  like overprivilege, existence of permission redelegation and permission flows. PAndA2 comes along with a textual and graphical visualization of the analysis result and even supports the comparison of analysis results for different android app versions.","lang":"eng"}],"series_title":"School of Computing Science Technical Report Series","year":"2016","title":"PAndA 2 : Analyzing Permission Use and Interplay in Android Apps (Tool Paper)","author":[{"full_name":"Jakobs, Marie-Christine","last_name":"Jakobs","first_name":"Marie-Christine"},{"first_name":"Manuel","last_name":"Töws","full_name":"Töws, Manuel","id":"11315"},{"id":"22398","last_name":"Pauck","first_name":"Felix","full_name":"Pauck, Felix"}],"date_updated":"2022-01-06T06:53:01Z","file_date_updated":"2018-03-21T12:40:27Z","citation":{"ama":"Jakobs M-C, Töws M, Pauck F. PAndA 2 : Analyzing Permission Use and Interplay in Android Apps (Tool Paper). In: Ishikawa F, Romanovsky A TE, ed. <i>Workshop on Formal and Model-Driven Techniques for Developing Trustworthy Systems</i>. School of Computing Science Technical Report Series. ; 2016.","bibtex":"@inproceedings{Jakobs_Töws_Pauck_2016, series={School of Computing Science Technical Report Series}, title={PAndA 2 : Analyzing Permission Use and Interplay in Android Apps (Tool Paper)}, booktitle={Workshop on Formal and Model-Driven Techniques for Developing Trustworthy Systems}, author={Jakobs, Marie-Christine and Töws, Manuel and Pauck, Felix}, editor={Ishikawa F, Romanovsky A, Troubitsyna EEditor}, year={2016}, collection={School of Computing Science Technical Report Series} }","mla":"Jakobs, Marie-Christine, et al. “PAndA 2 : Analyzing Permission Use and Interplay in Android Apps (Tool Paper).” <i>Workshop on Formal and Model-Driven Techniques for Developing Trustworthy Systems</i>, edited by Troubitsyna E Ishikawa F, Romanovsky A, 2016.","chicago":"Jakobs, Marie-Christine, Manuel Töws, and Felix Pauck. “PAndA 2 : Analyzing Permission Use and Interplay in Android Apps (Tool Paper).” In <i>Workshop on Formal and Model-Driven Techniques for Developing Trustworthy Systems</i>, edited by Troubitsyna E Ishikawa F, Romanovsky A. School of Computing Science Technical Report Series, 2016.","short":"M.-C. Jakobs, M. Töws, F. Pauck, in: T.E. Ishikawa F, Romanovsky A (Ed.), Workshop on Formal and Model-Driven Techniques for Developing Trustworthy Systems, 2016.","apa":"Jakobs, M.-C., Töws, M., &#38; Pauck, F. (2016). PAndA 2 : Analyzing Permission Use and Interplay in Android Apps (Tool Paper). In T. E. Ishikawa F, Romanovsky A (Ed.), <i>Workshop on Formal and Model-Driven Techniques for Developing Trustworthy Systems</i>.","ieee":"M.-C. Jakobs, M. Töws, and F. Pauck, “PAndA 2 : Analyzing Permission Use and Interplay in Android Apps (Tool Paper),” in <i>Workshop on Formal and Model-Driven Techniques for Developing Trustworthy Systems</i>, 2016."},"project":[{"name":"SFB 901","_id":"1"},{"_id":"12","name":"SFB 901 - Subprojekt B4"},{"_id":"3","name":"SFB 901 - Project Area B"}],"_id":"170","user_id":"15504","ddc":["040"],"editor":[{"last_name":"Ishikawa F, Romanovsky A","first_name":"Troubitsyna E","full_name":"Ishikawa F, Romanovsky A, Troubitsyna E"}],"status":"public","has_accepted_license":"1"},{"publisher":"Universität Paderborn","_id":"172","ddc":["040"],"user_id":"477","year":"2016","title":"Ontology-based representation of abstract optimization models for model formulation and system generation","status":"public","author":[{"first_name":"Florian","last_name":"Stapel","full_name":"Stapel, Florian"}],"date_updated":"2022-01-06T06:53:06Z","has_accepted_license":"1","file":[{"relation":"main_file","date_updated":"2018-03-21T12:39:19Z","file_name":"172-FStapelDissertation.pdf","access_level":"closed","file_size":9301431,"file_id":"1537","success":1,"content_type":"application/pdf","creator":"florida","date_created":"2018-03-21T12:39:19Z"}],"date_created":"2017-10-17T12:41:25Z","type":"dissertation","department":[{"_id":"19"}],"file_date_updated":"2018-03-21T12:39:19Z","supervisor":[{"first_name":"Lena","last_name":"Suhl","full_name":"Suhl, Lena"}],"citation":{"chicago":"Stapel, Florian. <i>Ontology-Based Representation of Abstract Optimization Models for Model Formulation and System Generation</i>. Universität Paderborn, 2016.","short":"F. Stapel, Ontology-Based Representation of Abstract Optimization Models for Model Formulation and System Generation, Universität Paderborn, 2016.","apa":"Stapel, F. (2016). <i>Ontology-based representation of abstract optimization models for model formulation and system generation</i>. Universität Paderborn.","ieee":"F. Stapel, <i>Ontology-based representation of abstract optimization models for model formulation and system generation</i>. Universität Paderborn, 2016.","ama":"Stapel F. <i>Ontology-Based Representation of Abstract Optimization Models for Model Formulation and System Generation</i>. Universität Paderborn; 2016.","bibtex":"@book{Stapel_2016, title={Ontology-based representation of abstract optimization models for model formulation and system generation}, publisher={Universität Paderborn}, author={Stapel, Florian}, year={2016} }","mla":"Stapel, Florian. <i>Ontology-Based Representation of Abstract Optimization Models for Model Formulation and System Generation</i>. Universität Paderborn, 2016."},"project":[{"name":"SFB 901","_id":"1"},{"_id":"15","name":"SFB 901 - Subprojekt C3"},{"name":"SFB 901 - Project Area C","_id":"4"}]},{"citation":{"apa":"Cedric Mertens, J. (2016). <i>Sprint Diagnostic with RTK-GPS \\&#38; IMU Sensor Fusion</i>. Paderborn University.","ieee":"J. Cedric Mertens, <i>Sprint Diagnostic with RTK-GPS \\&#38; IMU Sensor Fusion</i>. Paderborn University, 2016.","chicago":"Cedric Mertens, Jan. <i>Sprint Diagnostic with RTK-GPS \\&#38; IMU Sensor Fusion</i>. Paderborn University, 2016.","short":"J. Cedric Mertens, Sprint Diagnostic with RTK-GPS \\&#38; IMU Sensor Fusion, Paderborn University, 2016.","mla":"Cedric Mertens, Jan. <i>Sprint Diagnostic with RTK-GPS \\&#38; IMU Sensor Fusion</i>. Paderborn University, 2016.","ama":"Cedric Mertens J. <i>Sprint Diagnostic with RTK-GPS \\&#38; IMU Sensor Fusion</i>. Paderborn University; 2016.","bibtex":"@book{Cedric Mertens_2016, title={Sprint Diagnostic with RTK-GPS \\&#38; IMU Sensor Fusion}, publisher={Paderborn University}, author={Cedric Mertens, Jan}, year={2016} }"},"department":[{"_id":"78"}],"type":"mastersthesis","date_created":"2019-07-10T09:23:26Z","date_updated":"2022-01-06T06:50:47Z","author":[{"full_name":"Cedric Mertens, Jan","first_name":"Jan","last_name":"Cedric Mertens"}],"title":"Sprint Diagnostic with RTK-GPS \\& IMU Sensor Fusion","status":"public","year":"2016","user_id":"3118","_id":"10612","publisher":"Paderborn University","language":[{"iso":"eng"}]},{"date_created":"2019-07-10T09:25:14Z","type":"mastersthesis","department":[{"_id":"78"}],"supervisor":[{"first_name":"Paul","last_name":"Kaufmann","full_name":"Kaufmann, Paul"}],"citation":{"ieee":"A. S. Nassery, <i>Implementation of Bilinear Pairings on Reconfigurable Hardware</i>. Paderborn University, 2016.","apa":"Nassery, A. S. (2016). <i>Implementation of Bilinear Pairings on Reconfigurable Hardware</i>. Paderborn University.","short":"A.S. Nassery, Implementation of Bilinear Pairings on Reconfigurable Hardware, Paderborn University, 2016.","chicago":"Nassery, Abdul Sami. <i>Implementation of Bilinear Pairings on Reconfigurable Hardware</i>. Paderborn University, 2016.","mla":"Nassery, Abdul Sami. <i>Implementation of Bilinear Pairings on Reconfigurable Hardware</i>. Paderborn University, 2016.","bibtex":"@book{Nassery_2016, title={Implementation of Bilinear Pairings on Reconfigurable Hardware}, publisher={Paderborn University}, author={Nassery, Abdul Sami}, year={2016} }","ama":"Nassery AS. <i>Implementation of Bilinear Pairings on Reconfigurable Hardware</i>. Paderborn University; 2016."},"publisher":"Paderborn University","_id":"10616","language":[{"iso":"eng"}],"user_id":"3118","status":"public","title":"Implementation of Bilinear Pairings on Reconfigurable Hardware","year":"2016","author":[{"full_name":"Nassery, Abdul Sami","last_name":"Nassery","first_name":"Abdul Sami"}],"date_updated":"2022-01-06T06:50:47Z"},{"user_id":"3118","_id":"10617","language":[{"iso":"eng"}],"publisher":"Paderborn University","date_updated":"2022-01-06T06:50:47Z","status":"public","year":"2016","title":"Acceleration of EMTP for Distribution Networks on Data Flow Machines using the Latency Insertion Method","author":[{"full_name":"Amin, Omair","first_name":"Omair","last_name":"Amin"}],"type":"mastersthesis","department":[{"_id":"78"}],"date_created":"2019-07-10T09:25:15Z","supervisor":[{"full_name":"Kaufmann, Paul","last_name":"Kaufmann","first_name":"Paul"}],"citation":{"mla":"Amin, Omair. <i>Acceleration of EMTP for Distribution Networks on Data Flow Machines Using the Latency Insertion Method</i>. Paderborn University, 2016.","bibtex":"@book{Amin_2016, title={Acceleration of EMTP for Distribution Networks on Data Flow Machines using the Latency Insertion Method}, publisher={Paderborn University}, author={Amin, Omair}, year={2016} }","ama":"Amin O. <i>Acceleration of EMTP for Distribution Networks on Data Flow Machines Using the Latency Insertion Method</i>. Paderborn University; 2016.","ieee":"O. Amin, <i>Acceleration of EMTP for Distribution Networks on Data Flow Machines using the Latency Insertion Method</i>. Paderborn University, 2016.","apa":"Amin, O. (2016). <i>Acceleration of EMTP for Distribution Networks on Data Flow Machines using the Latency Insertion Method</i>. Paderborn University.","chicago":"Amin, Omair. <i>Acceleration of EMTP for Distribution Networks on Data Flow Machines Using the Latency Insertion Method</i>. Paderborn University, 2016.","short":"O. Amin, Acceleration of EMTP for Distribution Networks on Data Flow Machines Using the Latency Insertion Method, Paderborn University, 2016."}},{"date_created":"2019-07-10T09:33:00Z","department":[{"_id":"78"}],"type":"conference","citation":{"short":"J. Anwer, M. Platzner, in: Euromicro Conference on Digital System Design (DSD), 2016.","chicago":"Anwer, Jahanzeb, and Marco Platzner. “Boolean Difference Based Reliability Evaluation of Fault Tolerant Circuit Structures on FPGAs.” In <i>Euromicro Conference on Digital System Design (DSD)</i>, 2016. <a href=\"https://doi.org/10.1109/DSD.2016.35\">https://doi.org/10.1109/DSD.2016.35</a>.","ieee":"J. Anwer and M. Platzner, “Boolean Difference Based Reliability Evaluation of Fault Tolerant Circuit Structures on FPGAs,” in <i>Euromicro Conference on Digital System Design (DSD)</i>, 2016.","apa":"Anwer, J., &#38; Platzner, M. (2016). Boolean Difference Based Reliability Evaluation of Fault Tolerant Circuit Structures on FPGAs. In <i>Euromicro Conference on Digital System Design (DSD)</i>. <a href=\"https://doi.org/10.1109/DSD.2016.35\">https://doi.org/10.1109/DSD.2016.35</a>","bibtex":"@inproceedings{Anwer_Platzner_2016, title={Boolean Difference Based Reliability Evaluation of Fault Tolerant Circuit Structures on FPGAs}, DOI={<a href=\"https://doi.org/10.1109/DSD.2016.35\">10.1109/DSD.2016.35</a>}, booktitle={Euromicro Conference on Digital System Design (DSD)}, author={Anwer, Jahanzeb and Platzner, Marco}, year={2016} }","ama":"Anwer J, Platzner M. Boolean Difference Based Reliability Evaluation of Fault Tolerant Circuit Structures on FPGAs. In: <i>Euromicro Conference on Digital System Design (DSD)</i>. ; 2016. doi:<a href=\"https://doi.org/10.1109/DSD.2016.35\">10.1109/DSD.2016.35</a>","mla":"Anwer, Jahanzeb, and Marco Platzner. “Boolean Difference Based Reliability Evaluation of Fault Tolerant Circuit Structures on FPGAs.” <i>Euromicro Conference on Digital System Design (DSD)</i>, 2016, doi:<a href=\"https://doi.org/10.1109/DSD.2016.35\">10.1109/DSD.2016.35</a>."},"publication":"Euromicro Conference on Digital System Design (DSD)","_id":"10622","language":[{"iso":"eng"}],"doi":"10.1109/DSD.2016.35","user_id":"3118","author":[{"full_name":"Anwer, Jahanzeb","last_name":"Anwer","first_name":"Jahanzeb"},{"id":"398","first_name":"Marco","last_name":"Platzner","full_name":"Platzner, Marco"}],"title":"Boolean Difference Based Reliability Evaluation of Fault Tolerant Circuit Structures on FPGAs","year":"2016","status":"public","date_updated":"2022-01-06T06:50:48Z"},{"_id":"10631","user_id":"3118","author":[{"first_name":"Alexander","last_name":"Boschmann","full_name":"Boschmann, Alexander"},{"full_name":"Dosen, Strahinja","last_name":"Dosen","first_name":"Strahinja"},{"full_name":"Werner, Andreas","first_name":"Andreas","last_name":"Werner"},{"full_name":"Raies, Ali","last_name":"Raies","first_name":"Ali"},{"first_name":"Dario","last_name":"Farina","full_name":"Farina, Dario"}],"title":"A novel immersive augmented reality system for prosthesis training and assessment","year":"2016","status":"public","date_updated":"2022-01-06T06:50:49Z","date_created":"2019-07-10T11:02:57Z","department":[{"_id":"78"}],"type":"conference","citation":{"ieee":"A. Boschmann, S. Dosen, A. Werner, A. Raies, and D. Farina, “A novel immersive augmented reality system for prosthesis training and assessment,” in <i>Proc. IEEE Int. Conf. Biomed. Health Informatics (BHI)</i>, 2016.","apa":"Boschmann, A., Dosen, S., Werner, A., Raies, A., &#38; Farina, D. (2016). A novel immersive augmented reality system for prosthesis training and assessment. In <i>Proc. IEEE Int. Conf. Biomed. Health Informatics (BHI)</i>.","short":"A. Boschmann, S. Dosen, A. Werner, A. Raies, D. Farina, in: Proc. IEEE Int. Conf. Biomed. Health Informatics (BHI), 2016.","chicago":"Boschmann, Alexander, Strahinja Dosen, Andreas Werner, Ali Raies, and Dario Farina. “A Novel Immersive Augmented Reality System for Prosthesis Training and Assessment.” In <i>Proc. IEEE Int. Conf. Biomed. Health Informatics (BHI)</i>, 2016.","mla":"Boschmann, Alexander, et al. “A Novel Immersive Augmented Reality System for Prosthesis Training and Assessment.” <i>Proc. IEEE Int. Conf. Biomed. Health Informatics (BHI)</i>, 2016.","bibtex":"@inproceedings{Boschmann_Dosen_Werner_Raies_Farina_2016, title={A novel immersive augmented reality system for prosthesis training and assessment}, booktitle={Proc. IEEE Int. Conf. Biomed. Health Informatics (BHI)}, author={Boschmann, Alexander and Dosen, Strahinja and Werner, Andreas and Raies, Ali and Farina, Dario}, year={2016} }","ama":"Boschmann A, Dosen S, Werner A, Raies A, Farina D. A novel immersive augmented reality system for prosthesis training and assessment. In: <i>Proc. IEEE Int. Conf. Biomed. Health Informatics (BHI)</i>. ; 2016."},"publication":"Proc. IEEE Int. Conf. Biomed. Health Informatics (BHI)"},{"_id":"10661","publisher":"Elsevier","language":[{"iso":"eng"}],"page":"53-62","volume":644,"doi":"10.1016/j.tcs.2016.06.029","user_id":"3118","author":[{"last_name":"Graf","first_name":"Tobias","full_name":"Graf, Tobias"},{"id":"398","full_name":"Platzner, Marco","last_name":"Platzner","first_name":"Marco"}],"title":"Adaptive playouts for online learning of policies during Monte Carlo Tree Search","status":"public","year":"2016","intvolume":"       644","date_updated":"2022-01-06T06:50:49Z","date_created":"2019-07-10T11:14:43Z","department":[{"_id":"78"}],"type":"journal_article","citation":{"apa":"Graf, T., &#38; Platzner, M. (2016). Adaptive playouts for online learning of policies during Monte Carlo Tree Search. <i>Journal Theoretical Computer Science</i>, <i>644</i>, 53–62. <a href=\"https://doi.org/10.1016/j.tcs.2016.06.029\">https://doi.org/10.1016/j.tcs.2016.06.029</a>","mla":"Graf, Tobias, and Marco Platzner. “Adaptive Playouts for Online Learning of Policies during Monte Carlo Tree Search.” <i>Journal Theoretical Computer Science</i>, vol. 644, Elsevier, 2016, pp. 53–62, doi:<a href=\"https://doi.org/10.1016/j.tcs.2016.06.029\">10.1016/j.tcs.2016.06.029</a>.","ieee":"T. Graf and M. Platzner, “Adaptive playouts for online learning of policies during Monte Carlo Tree Search,” <i>Journal Theoretical Computer Science</i>, vol. 644, pp. 53–62, 2016.","short":"T. Graf, M. Platzner, Journal Theoretical Computer Science 644 (2016) 53–62.","ama":"Graf T, Platzner M. Adaptive playouts for online learning of policies during Monte Carlo Tree Search. <i>Journal Theoretical Computer Science</i>. 2016;644:53-62. doi:<a href=\"https://doi.org/10.1016/j.tcs.2016.06.029\">10.1016/j.tcs.2016.06.029</a>","chicago":"Graf, Tobias, and Marco Platzner. “Adaptive Playouts for Online Learning of Policies during Monte Carlo Tree Search.” <i>Journal Theoretical Computer Science</i> 644 (2016): 53–62. <a href=\"https://doi.org/10.1016/j.tcs.2016.06.029\">https://doi.org/10.1016/j.tcs.2016.06.029</a>.","bibtex":"@article{Graf_Platzner_2016, title={Adaptive playouts for online learning of policies during Monte Carlo Tree Search}, volume={644}, DOI={<a href=\"https://doi.org/10.1016/j.tcs.2016.06.029\">10.1016/j.tcs.2016.06.029</a>}, journal={Journal Theoretical Computer Science}, publisher={Elsevier}, author={Graf, Tobias and Platzner, Marco}, year={2016}, pages={53–62} }"},"publication":"Journal Theoretical Computer Science"},{"supervisor":[{"last_name":"Kaufmann","first_name":"Paul","full_name":"Kaufmann, Paul"}],"citation":{"mla":"Horstmann, Jens. <i>Beschleunigte Simulation Elektrischer Stromnetze Mit GPUs</i>. Paderborn University, 2016.","bibtex":"@book{Horstmann_2016, title={Beschleunigte Simulation elektrischer Stromnetze mit GPUs}, publisher={Paderborn University}, author={Horstmann, Jens}, year={2016} }","ama":"Horstmann J. <i>Beschleunigte Simulation Elektrischer Stromnetze Mit GPUs</i>. Paderborn University; 2016.","ieee":"J. Horstmann, <i>Beschleunigte Simulation elektrischer Stromnetze mit GPUs</i>. Paderborn University, 2016.","apa":"Horstmann, J. (2016). <i>Beschleunigte Simulation elektrischer Stromnetze mit GPUs</i>. Paderborn University.","chicago":"Horstmann, Jens. <i>Beschleunigte Simulation Elektrischer Stromnetze Mit GPUs</i>. Paderborn University, 2016.","short":"J. Horstmann, Beschleunigte Simulation Elektrischer Stromnetze Mit GPUs, Paderborn University, 2016."},"department":[{"_id":"78"}],"type":"bachelorsthesis","date_created":"2019-07-10T11:30:20Z","date_updated":"2022-01-06T06:50:49Z","author":[{"full_name":"Horstmann, Jens","last_name":"Horstmann","first_name":"Jens"}],"year":"2016","title":"Beschleunigte Simulation elektrischer Stromnetze mit GPUs","status":"public","user_id":"3118","_id":"10695","language":[{"iso":"eng"}],"publisher":"Paderborn University"},{"user_id":"3118","doi":"10.1016/j.renene.2015.07.083","volume":87,"page":"946-953","_id":"10705","publisher":"Elsevier","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:50:50Z","intvolume":"        87","status":"public","title":"Optimal Generation Dispatch of Distributed Generators Considering Fair Contribution to Grid Voltage Control","year":"2016","author":[{"full_name":"Ma, Chenjie","first_name":"Chenjie","last_name":"Ma"},{"first_name":"Paul","last_name":"Kaufmann","full_name":"Kaufmann, Paul"},{"full_name":"Töbermann, J.-Christian","first_name":"J.-Christian","last_name":"Töbermann"},{"first_name":"Martin","last_name":"Braun","full_name":"Braun, Martin"}],"type":"journal_article","department":[{"_id":"78"}],"date_created":"2019-07-10T11:42:59Z","issue":"(part 2)","publication":"Renewable Energy","citation":{"apa":"Ma, C., Kaufmann, P., Töbermann, J.-C., &#38; Braun, M. (2016). Optimal Generation Dispatch of Distributed Generators Considering Fair Contribution to Grid Voltage Control. <i>Renewable Energy</i>, <i>87</i>((part 2)), 946–953. <a href=\"https://doi.org/10.1016/j.renene.2015.07.083\">https://doi.org/10.1016/j.renene.2015.07.083</a>","mla":"Ma, Chenjie, et al. “Optimal Generation Dispatch of Distributed Generators Considering Fair Contribution to Grid Voltage Control.” <i>Renewable Energy</i>, vol. 87, no. (part 2), Elsevier, 2016, pp. 946–53, doi:<a href=\"https://doi.org/10.1016/j.renene.2015.07.083\">10.1016/j.renene.2015.07.083</a>.","ieee":"C. Ma, P. Kaufmann, J.-C. Töbermann, and M. Braun, “Optimal Generation Dispatch of Distributed Generators Considering Fair Contribution to Grid Voltage Control,” <i>Renewable Energy</i>, vol. 87, no. (part 2), pp. 946–953, 2016.","ama":"Ma C, Kaufmann P, Töbermann J-C, Braun M. Optimal Generation Dispatch of Distributed Generators Considering Fair Contribution to Grid Voltage Control. <i>Renewable Energy</i>. 2016;87((part 2)):946-953. doi:<a href=\"https://doi.org/10.1016/j.renene.2015.07.083\">10.1016/j.renene.2015.07.083</a>","short":"C. Ma, P. Kaufmann, J.-C. Töbermann, M. Braun, Renewable Energy 87 (2016) 946–953.","chicago":"Ma, Chenjie, Paul Kaufmann, J.-Christian Töbermann, and Martin Braun. “Optimal Generation Dispatch of Distributed Generators Considering Fair Contribution to Grid Voltage Control.” <i>Renewable Energy</i> 87, no. (part 2) (2016): 946–53. <a href=\"https://doi.org/10.1016/j.renene.2015.07.083\">https://doi.org/10.1016/j.renene.2015.07.083</a>.","bibtex":"@article{Ma_Kaufmann_Töbermann_Braun_2016, title={Optimal Generation Dispatch of Distributed Generators Considering Fair Contribution to Grid Voltage Control}, volume={87}, DOI={<a href=\"https://doi.org/10.1016/j.renene.2015.07.083\">10.1016/j.renene.2015.07.083</a>}, number={(part 2)}, journal={Renewable Energy}, publisher={Elsevier}, author={Ma, Chenjie and Kaufmann, Paul and Töbermann, J.-Christian and Braun, Martin}, year={2016}, pages={946–953} }"}}]