--- _id: '689' author: - first_name: Johannes Sebastian full_name: Schaefer, Johannes Sebastian id: '30291' last_name: Schaefer citation: ama: Schaefer JS. Routing Algorithms on Delayed Networks for Disaster Management Support. Universität Paderborn; 2016. apa: Schaefer, J. S. (2016). Routing Algorithms on Delayed Networks for Disaster Management Support. 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} }' chicago: Schaefer, Johannes Sebastian. Routing Algorithms on Delayed Networks for Disaster Management Support. Universität Paderborn, 2016. ieee: J. S. Schaefer, Routing Algorithms on Delayed Networks for Disaster Management Support. Universität Paderborn, 2016. mla: Schaefer, Johannes Sebastian. Routing Algorithms on Delayed Networks for Disaster Management Support. Universität Paderborn, 2016. short: J.S. Schaefer, Routing Algorithms on Delayed Networks for Disaster Management Support, Universität Paderborn, 2016. date_created: 2017-11-14T06:51:37Z date_updated: 2022-01-06T07:03:23Z department: - _id: '63' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '5' name: SFB 901 - Subprojekt A1 - _id: '2' name: SFB 901 - Project Area A publisher: Universität Paderborn status: public supervisor: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide title: Routing Algorithms on Delayed Networks for Disaster Management Support type: mastersthesis user_id: '477' year: '2016' ... --- _id: '6977' author: - first_name: H.-Hugo full_name: Kremer, H.-Hugo id: '15280' last_name: Kremer - first_name: K. full_name: Büchter, K. last_name: Büchter - first_name: U. full_name: Buchmann, U. last_name: Buchmann citation: ama: Kremer H-H, Büchter K, Buchmann U. Inklusion in der beruflichen Bildung. bwp@ Berufs- und Wirtschaftspädagogik - online. 2016;(30). apa: Kremer, H.-H., Büchter, K., & Buchmann, U. (2016). Inklusion in der beruflichen Bildung. bwp@ Berufs- und Wirtschaftspädagogik - online, (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} }' chicago: Kremer, H.-Hugo, K. Büchter, and U. Buchmann. “Inklusion in der beruflichen Bildung.” bwp@ Berufs- und Wirtschaftspädagogik - online, no. 30 (2016). ieee: H.-H. Kremer, K. Büchter, and U. Buchmann, “Inklusion in der beruflichen Bildung,” bwp@ Berufs- und Wirtschaftspädagogik - online, no. 30, 2016. mla: Kremer, H. Hugo, et al. “Inklusion in der beruflichen Bildung.” bwp@ Berufs- und Wirtschaftspädagogik - online, no. 30, 2016. short: H.-H. Kremer, K. Büchter, U. Buchmann, bwp@ Berufs- und Wirtschaftspädagogik - online (2016). date_created: 2019-01-25T08:58:19Z date_updated: 2022-01-06T07:03:25Z department: - _id: '211' issue: '30' language: - iso: ger main_file_link: - url: http://www.bwpat.de/ausgabe30/editorial_bwpat30.pdf publication: bwp@ Berufs- und Wirtschaftspädagogik - online status: public title: Inklusion in der beruflichen Bildung type: journal_article user_id: '74378' year: '2016' ... --- _id: '16450' 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)$." author: - first_name: 'Andreas ' full_name: 'Cord-Landwehr, Andreas ' last_name: Cord-Landwehr - first_name: Matthias full_name: Fischer, Matthias id: '146' last_name: Fischer - first_name: Daniel full_name: Jung, Daniel id: '37827' last_name: Jung - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: Cord-Landwehr A, Fischer M, Jung D, Meyer auf der Heide F. Asymptotically Optimal Gathering on a Grid. arXiv:160203303. 2016. apa: Cord-Landwehr, A., Fischer, M., Jung, D., & Meyer auf der Heide, F. (2016). Asymptotically Optimal Gathering on a Grid. ArXiv:1602.03303. 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} }' chicago: Cord-Landwehr, Andreas , Matthias Fischer, Daniel Jung, and Friedhelm Meyer auf der Heide. “Asymptotically Optimal Gathering on a Grid.” ArXiv:1602.03303, 2016. ieee: A. Cord-Landwehr, M. Fischer, D. Jung, and F. Meyer auf der Heide, “Asymptotically Optimal Gathering on a Grid,” arXiv:1602.03303. 2016. mla: Cord-Landwehr, Andreas, et al. “Asymptotically Optimal Gathering on a Grid.” ArXiv:1602.03303, 2016. short: A. Cord-Landwehr, M. Fischer, D. Jung, F. Meyer auf der Heide, ArXiv:1602.03303 (2016). date_created: 2020-04-07T07:20:47Z date_updated: 2022-01-06T06:52:50Z department: - _id: '63' external_id: arxiv: - '1602.03303' language: - iso: eng publication: arXiv:1602.03303 status: public title: Asymptotically Optimal Gathering on a Grid type: preprint user_id: '15415' year: '2016' ... --- _id: '16579' author: - first_name: Michael full_name: Dellnitz, Michael last_name: Dellnitz - first_name: Julian full_name: Eckstein, Julian last_name: Eckstein - first_name: Kathrin full_name: Flaßkamp, Kathrin last_name: Flaßkamp - first_name: Patrick full_name: Friedel, Patrick last_name: Friedel - first_name: Christian full_name: Horenkamp, Christian last_name: Horenkamp - first_name: Ulrich full_name: Köhler, Ulrich last_name: Köhler - first_name: Sina full_name: Ober-Blöbaum, Sina last_name: Ober-Blöbaum - first_name: Sebastian full_name: Peitz, Sebastian last_name: Peitz - first_name: Sebastian full_name: Tiemeyer, Sebastian last_name: Tiemeyer citation: ama: 'Dellnitz M, Eckstein J, Flaßkamp K, et al. Multiobjective Optimal Control Methods for the Development of an Intelligent Cruise Control. In: Mathematics in Industry. Cham; 2016. doi:10.1007/978-3-319-23413-7_87' 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 Mathematics in Industry. Cham. https://doi.org/10.1007/978-3-319-23413-7_87 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={10.1007/978-3-319-23413-7_87}, 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} }' 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 Mathematics in Industry. Cham, 2016. https://doi.org/10.1007/978-3-319-23413-7_87. ieee: M. Dellnitz et al., “Multiobjective Optimal Control Methods for the Development of an Intelligent Cruise Control,” in Mathematics in Industry, Cham, 2016. mla: Dellnitz, Michael, et al. “Multiobjective Optimal Control Methods for the Development of an Intelligent Cruise Control.” Mathematics in Industry, 2016, doi:10.1007/978-3-319-23413-7_87. 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.' date_created: 2020-04-16T05:37:11Z date_updated: 2022-01-06T06:52:52Z department: - _id: '101' doi: 10.1007/978-3-319-23413-7_87 language: - iso: eng place: Cham publication: Mathematics in Industry publication_identifier: isbn: - '9783319234120' - '9783319234137' issn: - 1612-3956 - 2198-3283 publication_status: published status: public title: Multiobjective Optimal Control Methods for the Development of an Intelligent Cruise Control type: book_chapter user_id: '15701' year: '2016' ... --- _id: '16580' author: - first_name: Adrian full_name: Ziessler, Adrian last_name: Ziessler - first_name: Mirko Hessel-Von full_name: Molo, Mirko Hessel-Von last_name: Molo - first_name: Michael full_name: Dellnitz, Michael last_name: Dellnitz citation: ama: Ziessler A, Molo MH-V, Dellnitz M. On the computation of attractors for delay differential equations. Journal of Computational Dynamics. 2016:5-5. doi:10.3934/jcd.2016005 apa: Ziessler, A., Molo, M. H.-V., & Dellnitz, M. (2016). On the computation of attractors for delay differential equations. Journal of Computational Dynamics, 5–5. https://doi.org/10.3934/jcd.2016005 bibtex: '@article{Ziessler_Molo_Dellnitz_2016, title={On the computation of attractors for delay differential equations}, DOI={10.3934/jcd.2016005}, journal={Journal of Computational Dynamics}, author={Ziessler, Adrian and Molo, Mirko Hessel-Von and Dellnitz, Michael}, year={2016}, pages={5–5} }' chicago: Ziessler, Adrian, Mirko Hessel-Von Molo, and Michael Dellnitz. “On the Computation of Attractors for Delay Differential Equations.” Journal of Computational Dynamics, 2016, 5–5. https://doi.org/10.3934/jcd.2016005. ieee: A. Ziessler, M. H.-V. Molo, and M. Dellnitz, “On the computation of attractors for delay differential equations,” Journal of Computational Dynamics, pp. 5–5, 2016. mla: Ziessler, Adrian, et al. “On the Computation of Attractors for Delay Differential Equations.” Journal of Computational Dynamics, 2016, pp. 5–5, doi:10.3934/jcd.2016005. short: A. Ziessler, M.H.-V. Molo, M. Dellnitz, Journal of Computational Dynamics (2016) 5–5. date_created: 2020-04-16T05:38:13Z date_updated: 2022-01-06T06:52:52Z department: - _id: '101' doi: 10.3934/jcd.2016005 language: - iso: eng page: 5-5 publication: Journal of Computational Dynamics publication_identifier: issn: - 2158-2491 publication_status: published status: public title: On the computation of attractors for delay differential equations type: journal_article user_id: '15701' year: '2016' ... --- _id: '166' 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. author: - first_name: Sevil full_name: Dräxler, Sevil id: '31764' last_name: Dräxler - first_name: Holger full_name: Karl, Holger id: '126' last_name: Karl citation: ama: 'Dräxler S, Karl H. Placement of Services with Flexible Structures Specified by a YANG Data Model. In: Proceedings of the 2nd International IEEE Conference on Network Softwarization (NetSoft). ; 2016:184--192. doi:10.1109/NETSOFT.2016.7502412' apa: Dräxler, S., & Karl, H. (2016). Placement of Services with Flexible Structures Specified by a YANG Data Model. In Proceedings of the 2nd International IEEE Conference on Network Softwarization (NetSoft) (pp. 184--192). https://doi.org/10.1109/NETSOFT.2016.7502412 bibtex: '@inproceedings{Dräxler_Karl_2016, title={Placement of Services with Flexible Structures Specified by a YANG Data Model}, DOI={10.1109/NETSOFT.2016.7502412}, booktitle={Proceedings of the 2nd International IEEE Conference on Network Softwarization (NetSoft)}, author={Dräxler, Sevil and Karl, Holger}, year={2016}, pages={184--192} }' chicago: Dräxler, Sevil, and Holger Karl. “Placement of Services with Flexible Structures Specified by a YANG Data Model.” In Proceedings of the 2nd International IEEE Conference on Network Softwarization (NetSoft), 184--192, 2016. https://doi.org/10.1109/NETSOFT.2016.7502412. ieee: S. Dräxler and H. Karl, “Placement of Services with Flexible Structures Specified by a YANG Data Model,” in Proceedings of the 2nd International IEEE Conference on Network Softwarization (NetSoft), 2016, pp. 184--192. mla: Dräxler, Sevil, and Holger Karl. “Placement of Services with Flexible Structures Specified by a YANG Data Model.” Proceedings of the 2nd International IEEE Conference on Network Softwarization (NetSoft), 2016, pp. 184--192, doi:10.1109/NETSOFT.2016.7502412. short: 'S. Dräxler, H. Karl, in: Proceedings of the 2nd International IEEE Conference on Network Softwarization (NetSoft), 2016, pp. 184--192.' date_created: 2017-10-17T12:41:24Z date_updated: 2022-01-06T06:52:53Z ddc: - '040' department: - _id: '75' doi: 10.1109/NETSOFT.2016.7502412 file: - access_level: open_access content_type: application/pdf creator: sevilmeh date_created: 2018-06-25T07:53:54Z date_updated: 2018-06-25T07:53:54Z file_id: '3322' file_name: RIS.pdf file_size: 1471937 relation: main_file file_date_updated: 2018-06-25T07:53:54Z has_accepted_license: '1' main_file_link: - url: http://ieeexplore.ieee.org/search/searchresult.jsp?newsearch=true&queryText=10.1109%2FNETSOFT.2016.7502412 oa: '1' page: 184--192 project: - _id: '1' name: SFB 901 - _id: '16' name: SFB 901 - Subprojekt C4 - _id: '4' name: SFB 901 - Project Area C - _id: '25' call_identifier: 5G PPP Phase 1 grant_number: '671517' name: 'SONATA NFV: Agile Service Development and Orchestration in 5G Virtualized Networks' publication: Proceedings of the 2nd International IEEE Conference on Network Softwarization (NetSoft) status: public title: Placement of Services with Flexible Structures Specified by a YANG Data Model type: conference urn: '1665' user_id: '31764' year: '2016' ... --- _id: '167' author: - first_name: Peter full_name: Günther, Peter last_name: Günther citation: ama: Günther P. Physical Attacks on Pairing-Based Cryptography. Universität Paderborn; 2016. apa: Günther, P. (2016). Physical attacks on pairing-based cryptography. Universität Paderborn. bibtex: '@book{Günther_2016, title={Physical attacks on pairing-based cryptography}, publisher={Universität Paderborn}, author={Günther, Peter}, year={2016} }' chicago: Günther, Peter. Physical Attacks on Pairing-Based Cryptography. Universität Paderborn, 2016. ieee: P. Günther, Physical attacks on pairing-based cryptography. Universität Paderborn, 2016. mla: Günther, Peter. Physical Attacks on Pairing-Based Cryptography. Universität Paderborn, 2016. short: P. Günther, Physical Attacks on Pairing-Based Cryptography, Universität Paderborn, 2016. date_created: 2017-10-17T12:41:24Z date_updated: 2022-01-06T06:52:54Z ddc: - '040' department: - _id: '64' file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-21T12:43:21Z date_updated: 2018-03-21T12:43:21Z file_id: '1542' file_name: 167-thesis_peter_guenther.pdf file_size: 9456552 relation: main_file success: 1 file_date_updated: 2018-03-21T12:43:21Z has_accepted_license: '1' main_file_link: - url: http://nbn-resolving.de/urn:nbn:de:hbz:466:2-24853 project: - _id: '1' name: SFB 901 - _id: '13' name: SFB 901 - Subprojekt C1 - _id: '4' name: SFB 901 - Project Area C publisher: Universität Paderborn status: public supervisor: - first_name: Johannes full_name: Blömer, Johannes id: '23' last_name: Blömer title: Physical attacks on pairing-based cryptography type: dissertation user_id: '25078' year: '2016' ... --- _id: '169' 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. author: - first_name: Thomas full_name: Kühne, Thomas id: '49079' last_name: Kühne - first_name: Heiko full_name: Hamann, Heiko last_name: Hamann - first_name: Svetlana full_name: Arifulina, Svetlana last_name: Arifulina - first_name: Gregor full_name: Engels, Gregor id: '107' last_name: Engels citation: 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: Proceedings of the 19th European Conference on Genetic Programming (EuroGP 2016). LNCS 9594. ; 2016:278--293. doi:10.1007/978-3-319-30668-1_18' apa: 'Kühne, T., Hamann, H., Arifulina, S., & Engels, G. (2016). Patterns for Constructing Mutation Operators: Limiting the Search Space in a Software Engineering Application. In Proceedings of the 19th European Conference on Genetic Programming (EuroGP 2016) (pp. 278--293). https://doi.org/10.1007/978-3-319-30668-1_18' 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={10.1007/978-3-319-30668-1_18}, 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} }' 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 Proceedings of the 19th European Conference on Genetic Programming (EuroGP 2016), 278--293. LNCS 9594, 2016. https://doi.org/10.1007/978-3-319-30668-1_18.' 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 Proceedings of the 19th European Conference on Genetic Programming (EuroGP 2016), 2016, pp. 278--293.' mla: 'Kühne, Thomas, et al. “Patterns for Constructing Mutation Operators: Limiting the Search Space in a Software Engineering Application.” Proceedings of the 19th European Conference on Genetic Programming (EuroGP 2016), 2016, pp. 278--293, doi:10.1007/978-3-319-30668-1_18.' 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.' date_created: 2017-10-17T12:41:25Z date_updated: 2022-01-06T06:52:58Z ddc: - '040' department: - _id: '66' - _id: '238' - _id: '63' doi: 10.1007/978-3-319-30668-1_18 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-21T12:41:08Z date_updated: 2018-03-21T12:41:08Z file_id: '1540' file_name: 169-kuehne.pdf file_size: 2069427 relation: main_file success: 1 file_date_updated: 2018-03-21T12:41:08Z has_accepted_license: '1' language: - iso: eng page: 278--293 project: - _id: '1' name: SFB 901 - _id: '9' name: SFB 901 - Subprojekt B1 - _id: '3' name: SFB 901 - Project Area B publication: Proceedings of the 19th European Conference on Genetic Programming (EuroGP 2016) series_title: LNCS 9594 status: public title: 'Patterns for Constructing Mutation Operators: Limiting the Search Space in a Software Engineering Application' type: conference user_id: '57458' year: '2016' ... --- _id: '1695' author: - first_name: Dieter full_name: Krimphove, Dieter id: '282' last_name: Krimphove citation: ama: 'Krimphove D. Lang/Weidmüller: Genossenschaftsfesetz. Gesetz betreffend des Erwerbs- und Wirtschaftsgenossenschaften (Kommentar) 38. Auflage. Zeitschrift für das gesamte Genossenschaftswesen ZFGG . 2016;Bd. 66(Heft 1):54-57.' apa: 'Krimphove, D. (2016). Lang/Weidmüller: Genossenschaftsfesetz. Gesetz betreffend des Erwerbs- und Wirtschaftsgenossenschaften (Kommentar) 38. Auflage. Zeitschrift Für Das Gesamte Genossenschaftswesen ZFGG .' 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} }' chicago: 'Krimphove, Dieter. “Lang/Weidmüller: Genossenschaftsfesetz. Gesetz Betreffend Des Erwerbs- Und Wirtschaftsgenossenschaften (Kommentar) 38. Auflage.” Zeitschrift Für Das Gesamte Genossenschaftswesen ZFGG , 2016.' ieee: 'D. Krimphove, “Lang/Weidmüller: Genossenschaftsfesetz. Gesetz betreffend des Erwerbs- und Wirtschaftsgenossenschaften (Kommentar) 38. Auflage,” Zeitschrift für das gesamte Genossenschaftswesen ZFGG , vol. Bd. 66, no. Heft 1. pp. 54–57, 2016.' mla: 'Krimphove, Dieter. “Lang/Weidmüller: Genossenschaftsfesetz. Gesetz Betreffend Des Erwerbs- Und Wirtschaftsgenossenschaften (Kommentar) 38. Auflage.” Zeitschrift Für Das Gesamte Genossenschaftswesen ZFGG , vol. Bd. 66, no. Heft 1, 2016, pp. 54–57.' short: D. Krimphove, Zeitschrift Für Das Gesamte Genossenschaftswesen ZFGG Bd. 66 (2016) 54–57. date_created: 2018-03-22T15:45:51Z date_updated: 2022-01-06T06:52:59Z issue: Heft 1 page: 54-57 publication: 'Zeitschrift für das gesamte Genossenschaftswesen ZFGG ' status: public title: 'Lang/Weidmüller: Genossenschaftsfesetz. Gesetz betreffend des Erwerbs- und Wirtschaftsgenossenschaften (Kommentar) 38. Auflage' type: review user_id: '282' volume: Bd. 66 year: '2016' ... --- _id: '16954' author: - first_name: Jonas full_name: Hanske, Jonas last_name: Hanske - first_name: Stevan full_name: Aleksić, Stevan last_name: Aleksić - first_name: Martin full_name: Ballaschk, Martin last_name: Ballaschk - first_name: Marcel full_name: Jurk, Marcel last_name: Jurk - first_name: Elena full_name: Shanina, Elena last_name: Shanina - first_name: Monika full_name: Beerbaum, Monika last_name: Beerbaum - first_name: Peter full_name: Schmieder, Peter last_name: Schmieder - first_name: Bettina G. full_name: Keller, Bettina G. last_name: Keller - first_name: Christoph full_name: Rademacher, Christoph last_name: Rademacher citation: ama: Hanske J, Aleksić S, Ballaschk M, et al. Intradomain Allosteric Network Modulates Calcium Affinity of the C-Type Lectin Receptor Langerin. Journal of the American Chemical Society. 2016:12176-12186. doi:10.1021/jacs.6b05458 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. Journal of the American Chemical Society, 12176–12186. https://doi.org/10.1021/jacs.6b05458 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={10.1021/jacs.6b05458}, 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} }' 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.” Journal of the American Chemical Society, 2016, 12176–86. https://doi.org/10.1021/jacs.6b05458. ieee: J. Hanske et al., “Intradomain Allosteric Network Modulates Calcium Affinity of the C-Type Lectin Receptor Langerin,” Journal of the American Chemical Society, pp. 12176–12186, 2016. mla: Hanske, Jonas, et al. “Intradomain Allosteric Network Modulates Calcium Affinity of the C-Type Lectin Receptor Langerin.” Journal of the American Chemical Society, 2016, pp. 12176–86, doi:10.1021/jacs.6b05458. 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. date_created: 2020-05-15T07:11:55Z date_updated: 2022-01-06T06:53:00Z doi: 10.1021/jacs.6b05458 keyword: - pc2-ressources language: - iso: eng page: 12176-12186 project: - _id: '52' name: Computing Resources Provided by the Paderborn Center for Parallel Computing publication: Journal of the American Chemical Society publication_identifier: issn: - 0002-7863 - 1520-5126 publication_status: published status: public title: Intradomain Allosteric Network Modulates Calcium Affinity of the C-Type Lectin Receptor Langerin type: journal_article user_id: '61189' year: '2016' ... --- _id: '170' abstract: - lang: eng 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. author: - first_name: Marie-Christine full_name: Jakobs, Marie-Christine last_name: Jakobs - first_name: Manuel full_name: Töws, Manuel id: '11315' last_name: Töws - first_name: Felix full_name: Pauck, Felix id: '22398' last_name: Pauck 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. Workshop on Formal and Model-Driven Techniques for Developing Trustworthy Systems. School of Computing Science Technical Report Series. ; 2016.' apa: 'Jakobs, M.-C., Töws, M., & Pauck, F. (2016). PAndA 2 : Analyzing Permission Use and Interplay in Android Apps (Tool Paper). In T. E. Ishikawa F, Romanovsky A (Ed.), Workshop on Formal and Model-Driven Techniques for Developing Trustworthy Systems.' 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} }' chicago: 'Jakobs, Marie-Christine, Manuel Töws, and Felix Pauck. “PAndA 2 : Analyzing Permission Use and Interplay in Android Apps (Tool Paper).” In Workshop on Formal and Model-Driven Techniques for Developing Trustworthy Systems, edited by Troubitsyna E Ishikawa F, Romanovsky A. School of Computing Science Technical Report Series, 2016.' ieee: 'M.-C. Jakobs, M. Töws, and F. Pauck, “PAndA 2 : Analyzing Permission Use and Interplay in Android Apps (Tool Paper),” in Workshop on Formal and Model-Driven Techniques for Developing Trustworthy Systems, 2016.' mla: 'Jakobs, Marie-Christine, et al. “PAndA 2 : Analyzing Permission Use and Interplay in Android Apps (Tool Paper).” Workshop on Formal and Model-Driven Techniques for Developing Trustworthy Systems, edited by Troubitsyna E Ishikawa F, Romanovsky A, 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.' date_created: 2017-10-17T12:41:25Z date_updated: 2022-01-06T06:53:01Z ddc: - '040' department: - _id: '77' editor: - first_name: Troubitsyna E full_name: Ishikawa F, Romanovsky A, Troubitsyna E last_name: Ishikawa F, Romanovsky A file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-21T12:40:27Z date_updated: 2018-03-21T12:40:27Z file_id: '1539' file_name: 170-main_04.pdf file_size: 285299 relation: main_file success: 1 file_date_updated: 2018-03-21T12:40:27Z has_accepted_license: '1' project: - _id: '1' name: SFB 901 - _id: '12' name: SFB 901 - Subprojekt B4 - _id: '3' name: SFB 901 - Project Area B publication: Workshop on Formal and Model-Driven Techniques for Developing Trustworthy Systems related_material: link: - relation: contains url: https://pdfs.semanticscholar.org/58cd/94c8b2335d16aa2558f711cf81b3f7746696.pdf series_title: School of Computing Science Technical Report Series status: public title: 'PAndA 2 : Analyzing Permission Use and Interplay in Android Apps (Tool Paper)' type: conference user_id: '15504' year: '2016' ... --- _id: '172' author: - first_name: Florian full_name: Stapel, Florian last_name: Stapel citation: ama: Stapel F. Ontology-Based Representation of Abstract Optimization Models for Model Formulation and System Generation. Universität Paderborn; 2016. apa: Stapel, F. (2016). Ontology-based representation of abstract optimization models for model formulation and system generation. Universität Paderborn. 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} }' chicago: Stapel, Florian. Ontology-Based Representation of Abstract Optimization Models for Model Formulation and System Generation. Universität Paderborn, 2016. ieee: F. Stapel, Ontology-based representation of abstract optimization models for model formulation and system generation. Universität Paderborn, 2016. mla: Stapel, Florian. Ontology-Based Representation of Abstract Optimization Models for Model Formulation and System Generation. Universität Paderborn, 2016. short: F. Stapel, Ontology-Based Representation of Abstract Optimization Models for Model Formulation and System Generation, Universität Paderborn, 2016. date_created: 2017-10-17T12:41:25Z date_updated: 2022-01-06T06:53:06Z ddc: - '040' department: - _id: '19' file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-21T12:39:19Z date_updated: 2018-03-21T12:39:19Z file_id: '1537' file_name: 172-FStapelDissertation.pdf file_size: 9301431 relation: main_file success: 1 file_date_updated: 2018-03-21T12:39:19Z has_accepted_license: '1' project: - _id: '1' name: SFB 901 - _id: '15' name: SFB 901 - Subprojekt C3 - _id: '4' name: SFB 901 - Project Area C publisher: Universität Paderborn status: public supervisor: - first_name: Lena full_name: Suhl, Lena last_name: Suhl title: Ontology-based representation of abstract optimization models for model formulation and system generation type: dissertation user_id: '477' year: '2016' ... --- _id: '10612' author: - first_name: Jan full_name: Cedric Mertens, Jan last_name: Cedric Mertens citation: ama: Cedric Mertens J. Sprint Diagnostic with RTK-GPS \& IMU Sensor Fusion. Paderborn University; 2016. apa: Cedric Mertens, J. (2016). Sprint Diagnostic with RTK-GPS \& IMU Sensor Fusion. Paderborn University. bibtex: '@book{Cedric Mertens_2016, title={Sprint Diagnostic with RTK-GPS \& IMU Sensor Fusion}, publisher={Paderborn University}, author={Cedric Mertens, Jan}, year={2016} }' chicago: Cedric Mertens, Jan. Sprint Diagnostic with RTK-GPS \& IMU Sensor Fusion. Paderborn University, 2016. ieee: J. Cedric Mertens, Sprint Diagnostic with RTK-GPS \& IMU Sensor Fusion. Paderborn University, 2016. mla: Cedric Mertens, Jan. Sprint Diagnostic with RTK-GPS \& IMU Sensor Fusion. Paderborn University, 2016. short: J. Cedric Mertens, Sprint Diagnostic with RTK-GPS \& IMU Sensor Fusion, Paderborn University, 2016. date_created: 2019-07-10T09:23:26Z date_updated: 2022-01-06T06:50:47Z department: - _id: '78' language: - iso: eng publisher: Paderborn University status: public title: Sprint Diagnostic with RTK-GPS \& IMU Sensor Fusion type: mastersthesis user_id: '3118' year: '2016' ... --- _id: '10616' author: - first_name: Abdul Sami full_name: Nassery, Abdul Sami last_name: Nassery citation: ama: Nassery AS. Implementation of Bilinear Pairings on Reconfigurable Hardware. Paderborn University; 2016. apa: Nassery, A. S. (2016). Implementation of Bilinear Pairings on Reconfigurable Hardware. Paderborn University. bibtex: '@book{Nassery_2016, title={Implementation of Bilinear Pairings on Reconfigurable Hardware}, publisher={Paderborn University}, author={Nassery, Abdul Sami}, year={2016} }' chicago: Nassery, Abdul Sami. Implementation of Bilinear Pairings on Reconfigurable Hardware. Paderborn University, 2016. ieee: A. S. Nassery, Implementation of Bilinear Pairings on Reconfigurable Hardware. Paderborn University, 2016. mla: Nassery, Abdul Sami. Implementation of Bilinear Pairings on Reconfigurable Hardware. Paderborn University, 2016. short: A.S. Nassery, Implementation of Bilinear Pairings on Reconfigurable Hardware, Paderborn University, 2016. date_created: 2019-07-10T09:25:14Z date_updated: 2022-01-06T06:50:47Z department: - _id: '78' language: - iso: eng publisher: Paderborn University status: public supervisor: - first_name: Paul full_name: Kaufmann, Paul last_name: Kaufmann title: Implementation of Bilinear Pairings on Reconfigurable Hardware type: mastersthesis user_id: '3118' year: '2016' ... --- _id: '10617' author: - first_name: Omair full_name: Amin, Omair last_name: Amin citation: ama: Amin O. Acceleration of EMTP for Distribution Networks on Data Flow Machines Using the Latency Insertion Method. Paderborn University; 2016. apa: Amin, O. (2016). Acceleration of EMTP for Distribution Networks on Data Flow Machines using the Latency Insertion Method. Paderborn University. 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} }' chicago: Amin, Omair. Acceleration of EMTP for Distribution Networks on Data Flow Machines Using the Latency Insertion Method. Paderborn University, 2016. ieee: O. Amin, Acceleration of EMTP for Distribution Networks on Data Flow Machines using the Latency Insertion Method. Paderborn University, 2016. mla: Amin, Omair. Acceleration of EMTP for Distribution Networks on Data Flow Machines Using the Latency Insertion Method. 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:25:15Z date_updated: 2022-01-06T06:50:47Z department: - _id: '78' language: - iso: eng publisher: Paderborn University status: public supervisor: - first_name: Paul full_name: Kaufmann, Paul last_name: Kaufmann title: Acceleration of EMTP for Distribution Networks on Data Flow Machines using the Latency Insertion Method type: mastersthesis user_id: '3118' year: '2016' ... --- _id: '10622' author: - first_name: Jahanzeb full_name: Anwer, Jahanzeb last_name: Anwer - first_name: Marco full_name: Platzner, Marco id: '398' last_name: Platzner citation: ama: 'Anwer J, Platzner M. Boolean Difference Based Reliability Evaluation of Fault Tolerant Circuit Structures on FPGAs. In: Euromicro Conference on Digital System Design (DSD). ; 2016. doi:10.1109/DSD.2016.35' apa: Anwer, J., & Platzner, M. (2016). Boolean Difference Based Reliability Evaluation of Fault Tolerant Circuit Structures on FPGAs. In Euromicro Conference on Digital System Design (DSD). https://doi.org/10.1109/DSD.2016.35 bibtex: '@inproceedings{Anwer_Platzner_2016, title={Boolean Difference Based Reliability Evaluation of Fault Tolerant Circuit Structures on FPGAs}, DOI={10.1109/DSD.2016.35}, booktitle={Euromicro Conference on Digital System Design (DSD)}, author={Anwer, Jahanzeb and Platzner, Marco}, year={2016} }' chicago: Anwer, Jahanzeb, and Marco Platzner. “Boolean Difference Based Reliability Evaluation of Fault Tolerant Circuit Structures on FPGAs.” In Euromicro Conference on Digital System Design (DSD), 2016. https://doi.org/10.1109/DSD.2016.35. ieee: J. Anwer and M. Platzner, “Boolean Difference Based Reliability Evaluation of Fault Tolerant Circuit Structures on FPGAs,” in Euromicro Conference on Digital System Design (DSD), 2016. mla: Anwer, Jahanzeb, and Marco Platzner. “Boolean Difference Based Reliability Evaluation of Fault Tolerant Circuit Structures on FPGAs.” Euromicro Conference on Digital System Design (DSD), 2016, doi:10.1109/DSD.2016.35. short: 'J. Anwer, M. Platzner, in: Euromicro Conference on Digital System Design (DSD), 2016.' date_created: 2019-07-10T09:33:00Z date_updated: 2022-01-06T06:50:48Z department: - _id: '78' doi: 10.1109/DSD.2016.35 language: - iso: eng publication: Euromicro Conference on Digital System Design (DSD) status: public title: Boolean Difference Based Reliability Evaluation of Fault Tolerant Circuit Structures on FPGAs type: conference user_id: '3118' year: '2016' ... --- _id: '10631' author: - first_name: Alexander full_name: Boschmann, Alexander last_name: Boschmann - first_name: Strahinja full_name: Dosen, Strahinja last_name: Dosen - first_name: Andreas full_name: Werner, Andreas last_name: Werner - first_name: Ali full_name: Raies, Ali last_name: Raies - first_name: Dario full_name: Farina, Dario last_name: Farina citation: ama: 'Boschmann A, Dosen S, Werner A, Raies A, Farina D. A novel immersive augmented reality system for prosthesis training and assessment. In: Proc. IEEE Int. Conf. Biomed. Health Informatics (BHI). ; 2016.' apa: Boschmann, A., Dosen, S., Werner, A., Raies, A., & Farina, D. (2016). A novel immersive augmented reality system for prosthesis training and assessment. In Proc. IEEE Int. Conf. Biomed. Health Informatics (BHI). 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} }' chicago: Boschmann, Alexander, Strahinja Dosen, Andreas Werner, Ali Raies, and Dario Farina. “A Novel Immersive Augmented Reality System for Prosthesis Training and Assessment.” In Proc. IEEE Int. Conf. Biomed. Health Informatics (BHI), 2016. ieee: A. Boschmann, S. Dosen, A. Werner, A. Raies, and D. Farina, “A novel immersive augmented reality system for prosthesis training and assessment,” in Proc. IEEE Int. Conf. Biomed. Health Informatics (BHI), 2016. mla: Boschmann, Alexander, et al. “A Novel Immersive Augmented Reality System for Prosthesis Training and Assessment.” Proc. IEEE Int. Conf. Biomed. Health Informatics (BHI), 2016. short: 'A. Boschmann, S. Dosen, A. Werner, A. Raies, D. Farina, in: Proc. IEEE Int. Conf. Biomed. Health Informatics (BHI), 2016.' date_created: 2019-07-10T11:02:57Z date_updated: 2022-01-06T06:50:49Z department: - _id: '78' publication: Proc. IEEE Int. Conf. Biomed. Health Informatics (BHI) status: public title: A novel immersive augmented reality system for prosthesis training and assessment type: conference user_id: '3118' year: '2016' ... --- _id: '10661' author: - first_name: Tobias full_name: Graf, Tobias last_name: Graf - first_name: Marco full_name: Platzner, Marco id: '398' last_name: Platzner citation: ama: Graf T, Platzner M. Adaptive playouts for online learning of policies during Monte Carlo Tree Search. Journal Theoretical Computer Science. 2016;644:53-62. doi:10.1016/j.tcs.2016.06.029 apa: Graf, T., & Platzner, M. (2016). Adaptive playouts for online learning of policies during Monte Carlo Tree Search. Journal Theoretical Computer Science, 644, 53–62. https://doi.org/10.1016/j.tcs.2016.06.029 bibtex: '@article{Graf_Platzner_2016, title={Adaptive playouts for online learning of policies during Monte Carlo Tree Search}, volume={644}, DOI={10.1016/j.tcs.2016.06.029}, journal={Journal Theoretical Computer Science}, publisher={Elsevier}, author={Graf, Tobias and Platzner, Marco}, year={2016}, pages={53–62} }' chicago: 'Graf, Tobias, and Marco Platzner. “Adaptive Playouts for Online Learning of Policies during Monte Carlo Tree Search.” Journal Theoretical Computer Science 644 (2016): 53–62. https://doi.org/10.1016/j.tcs.2016.06.029.' ieee: T. Graf and M. Platzner, “Adaptive playouts for online learning of policies during Monte Carlo Tree Search,” Journal Theoretical Computer Science, vol. 644, pp. 53–62, 2016. mla: Graf, Tobias, and Marco Platzner. “Adaptive Playouts for Online Learning of Policies during Monte Carlo Tree Search.” Journal Theoretical Computer Science, vol. 644, Elsevier, 2016, pp. 53–62, doi:10.1016/j.tcs.2016.06.029. short: T. Graf, M. Platzner, Journal Theoretical Computer Science 644 (2016) 53–62. date_created: 2019-07-10T11:14:43Z date_updated: 2022-01-06T06:50:49Z department: - _id: '78' doi: 10.1016/j.tcs.2016.06.029 intvolume: ' 644' language: - iso: eng page: 53-62 publication: Journal Theoretical Computer Science publisher: Elsevier status: public title: Adaptive playouts for online learning of policies during Monte Carlo Tree Search type: journal_article user_id: '3118' volume: 644 year: '2016' ... --- _id: '10695' author: - first_name: Jens full_name: Horstmann, Jens last_name: Horstmann citation: ama: Horstmann J. Beschleunigte Simulation Elektrischer Stromnetze Mit GPUs. Paderborn University; 2016. apa: Horstmann, J. (2016). Beschleunigte Simulation elektrischer Stromnetze mit GPUs. Paderborn University. bibtex: '@book{Horstmann_2016, title={Beschleunigte Simulation elektrischer Stromnetze mit GPUs}, publisher={Paderborn University}, author={Horstmann, Jens}, year={2016} }' chicago: Horstmann, Jens. Beschleunigte Simulation Elektrischer Stromnetze Mit GPUs. Paderborn University, 2016. ieee: J. Horstmann, Beschleunigte Simulation elektrischer Stromnetze mit GPUs. Paderborn University, 2016. mla: Horstmann, Jens. Beschleunigte Simulation Elektrischer Stromnetze Mit GPUs. Paderborn University, 2016. short: J. Horstmann, Beschleunigte Simulation Elektrischer Stromnetze Mit GPUs, Paderborn University, 2016. date_created: 2019-07-10T11:30:20Z date_updated: 2022-01-06T06:50:49Z department: - _id: '78' language: - iso: eng publisher: Paderborn University status: public supervisor: - first_name: Paul full_name: Kaufmann, Paul last_name: Kaufmann title: Beschleunigte Simulation elektrischer Stromnetze mit GPUs type: bachelorsthesis user_id: '3118' year: '2016' ... --- _id: '10705' author: - first_name: Chenjie full_name: Ma, Chenjie last_name: Ma - first_name: Paul full_name: Kaufmann, Paul last_name: Kaufmann - first_name: J.-Christian full_name: Töbermann, J.-Christian last_name: Töbermann - first_name: Martin full_name: Braun, Martin last_name: Braun citation: ama: Ma C, Kaufmann P, Töbermann J-C, Braun M. Optimal Generation Dispatch of Distributed Generators Considering Fair Contribution to Grid Voltage Control. Renewable Energy. 2016;87((part 2)):946-953. doi:10.1016/j.renene.2015.07.083 apa: Ma, C., Kaufmann, P., Töbermann, J.-C., & Braun, M. (2016). Optimal Generation Dispatch of Distributed Generators Considering Fair Contribution to Grid Voltage Control. Renewable Energy, 87((part 2)), 946–953. https://doi.org/10.1016/j.renene.2015.07.083 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={10.1016/j.renene.2015.07.083}, 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} }' 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.” Renewable Energy 87, no. (part 2) (2016): 946–53. https://doi.org/10.1016/j.renene.2015.07.083.' 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,” Renewable Energy, vol. 87, no. (part 2), pp. 946–953, 2016. mla: Ma, Chenjie, et al. “Optimal Generation Dispatch of Distributed Generators Considering Fair Contribution to Grid Voltage Control.” Renewable Energy, vol. 87, no. (part 2), Elsevier, 2016, pp. 946–53, doi:10.1016/j.renene.2015.07.083. short: C. Ma, P. Kaufmann, J.-C. Töbermann, M. Braun, Renewable Energy 87 (2016) 946–953. date_created: 2019-07-10T11:42:59Z date_updated: 2022-01-06T06:50:50Z department: - _id: '78' doi: 10.1016/j.renene.2015.07.083 intvolume: ' 87' issue: (part 2) language: - iso: eng page: 946-953 publication: Renewable Energy publisher: Elsevier status: public title: Optimal Generation Dispatch of Distributed Generators Considering Fair Contribution to Grid Voltage Control type: journal_article user_id: '3118' volume: 87 year: '2016' ...