--- _id: '3345' abstract: - lang: eng text: "Dynamically steering flows through virtualized net- work function instances is a key enabler for elastic, on-demand deployments of virtualized network functions. This becomes par- ticular challenging when stateful functions are involved, necessi- tating state management. The problem with existing solutions is that they typically embrace state migration and flow rerouting jointly, imposing a huge set of requirements on the on-boarded VNFs, e.g., solution-specific state management interfaces.\r\nIn this paper, we introduce the seamless handover proto- col (SHarP). It provides an easy-to-use, loss-less, and order- preserving flow rerouting mechanism that is not fixed to a single state management approach. This allows VNF vendors to implement or use the state management solution of their choice. SHarP supports these solutions with additional information when flows are migrated. Further, we show how SHarP significantly reduces the buffer usage at a central (SDN) controller, which is a typical bottleneck in existing solutions. Our experiments show that SHarP uses a constant amount of controller buffer, irrespective of the time taken to migrate the VNF state." author: - first_name: Manuel full_name: Peuster, Manuel id: '13271' last_name: Peuster - first_name: Hannes full_name: Küttner, Hannes last_name: Küttner - first_name: Holger full_name: Karl, Holger id: '126' last_name: Karl citation: ama: 'Peuster M, Küttner H, Karl H. Let the state follow its flows: An SDN-based flow handover protocol to support state migration. In: 4th IEEE International Conference on Network Softwarization (NetSoft 2018). Montreal. doi:10.1109/NETSOFT.2018.8460007' apa: 'Peuster, M., Küttner, H., & Karl, H. (n.d.). Let the state follow its flows: An SDN-based flow handover protocol to support state migration. In 4th IEEE International Conference on Network Softwarization (NetSoft 2018). Montreal. https://doi.org/10.1109/NETSOFT.2018.8460007' bibtex: '@inproceedings{Peuster_Küttner_Karl, place={Montreal}, title={ Let the state follow its flows: An SDN-based flow handover protocol to support state migration}, DOI={10.1109/NETSOFT.2018.8460007}, booktitle={4th IEEE International Conference on Network Softwarization (NetSoft 2018)}, author={Peuster, Manuel and Küttner, Hannes and Karl, Holger} }' chicago: 'Peuster, Manuel, Hannes Küttner, and Holger Karl. “ Let the State Follow Its Flows: An SDN-Based Flow Handover Protocol to Support State Migration.” In 4th IEEE International Conference on Network Softwarization (NetSoft 2018). Montreal, n.d. https://doi.org/10.1109/NETSOFT.2018.8460007.' ieee: 'M. Peuster, H. Küttner, and H. Karl, “ Let the state follow its flows: An SDN-based flow handover protocol to support state migration,” in 4th IEEE International Conference on Network Softwarization (NetSoft 2018), Montreal.' mla: 'Peuster, Manuel, et al. “ Let the State Follow Its Flows: An SDN-Based Flow Handover Protocol to Support State Migration.” 4th IEEE International Conference on Network Softwarization (NetSoft 2018), doi:10.1109/NETSOFT.2018.8460007.' short: 'M. Peuster, H. Küttner, H. Karl, in: 4th IEEE International Conference on Network Softwarization (NetSoft 2018), Montreal, n.d.' conference: end_date: 2018-06-29 location: Montreal name: 4th IEEE International Conference on Network Softwarization (NetSoft 2018) start_date: 2018-06-25 date_created: 2018-06-25T12:21:49Z date_updated: 2022-01-06T06:59:11Z ddc: - '000' department: - _id: '75' doi: 10.1109/NETSOFT.2018.8460007 file: - access_level: open_access content_type: application/pdf creator: peuster date_created: 2018-07-05T11:11:37Z date_updated: 2018-07-05T11:12:29Z file_id: '3428' file_name: main_ris.pdf file_size: 901561 relation: main_file file_date_updated: 2018-07-05T11:12:29Z has_accepted_license: '1' language: - iso: eng main_file_link: - url: https://ieeexplore.ieee.org/document/8460007/ oa: '1' place: Montreal project: - _id: '28' grant_number: '761493' name: 5G Development and validation platform for global industry-specific network services and Apps - _id: '1' name: SFB 901 - _id: '4' name: SFB 901 - Project Area C - _id: '16' name: SFB 901 - Subproject C4 publication: 4th IEEE International Conference on Network Softwarization (NetSoft 2018) publication_status: accepted status: public title: ' Let the state follow its flows: An SDN-based flow handover protocol to support state migration' type: conference urn: '33458' user_id: '13271' year: '2018' ... --- _id: '3346' abstract: - lang: eng text: "Developing a virtualized network service does not only involve the\r\n implementation and configuration of the network functions it is\r\n composed of but also its integration and test with management\r\n solutions that will control the service in its production\r\n environment. These integration tasks require testbeds that offer the\r\n needed network function virtualization infrastructure~(NFVI), like OpenStack, introducing a\r\n lot of management and maintenance overheads. Such testbed setups\r\n become even more complicated when the multi\r\n point-of-presence~(PoP) case, with multiple infrastructure\r\n installations, is considered.\r\n\r\n \ In this demo, we showcase an emulation platform that executes\r\n containerized network services in user-defined multi-PoP\r\n topologies. The platform does not only allow network service developers to\r\n locally test their services but also to connect real-world\r\n management and orchestration solutions to the emulated PoPs. During our\r\n interactive demonstration we focus on the integration between\r\n the emulated infrastructure and state-of-the-art orchestration\r\n \ solutions like SONATA or OSM." author: - first_name: Manuel full_name: Peuster, Manuel id: '13271' last_name: Peuster - first_name: 'Johannes ' full_name: 'Kampmeyer, Johannes ' last_name: Kampmeyer - first_name: Holger full_name: Karl, Holger id: '126' last_name: Karl citation: ama: 'Peuster M, Kampmeyer J, Karl H. Containernet 2.0: A Rapid Prototyping Platform for Hybrid Service Function Chains. In: 4th IEEE International Conference on Network Softwarization (NetSoft 2018). Montreal. doi:10.1109/NETSOFT.2018.8459905' apa: 'Peuster, M., Kampmeyer, J., & Karl, H. (n.d.). Containernet 2.0: A Rapid Prototyping Platform for Hybrid Service Function Chains. In 4th IEEE International Conference on Network Softwarization (NetSoft 2018). Montreal. https://doi.org/10.1109/NETSOFT.2018.8459905' bibtex: '@inproceedings{Peuster_Kampmeyer_Karl, place={Montreal}, title={Containernet 2.0: A Rapid Prototyping Platform for Hybrid Service Function Chains}, DOI={10.1109/NETSOFT.2018.8459905}, booktitle={4th IEEE International Conference on Network Softwarization (NetSoft 2018)}, author={Peuster, Manuel and Kampmeyer, Johannes and Karl, Holger} }' chicago: 'Peuster, Manuel, Johannes Kampmeyer, and Holger Karl. “Containernet 2.0: A Rapid Prototyping Platform for Hybrid Service Function Chains.” In 4th IEEE International Conference on Network Softwarization (NetSoft 2018). Montreal, n.d. https://doi.org/10.1109/NETSOFT.2018.8459905.' ieee: 'M. Peuster, J. Kampmeyer, and H. Karl, “Containernet 2.0: A Rapid Prototyping Platform for Hybrid Service Function Chains,” in 4th IEEE International Conference on Network Softwarization (NetSoft 2018), Montreal.' mla: 'Peuster, Manuel, et al. “Containernet 2.0: A Rapid Prototyping Platform for Hybrid Service Function Chains.” 4th IEEE International Conference on Network Softwarization (NetSoft 2018), doi:10.1109/NETSOFT.2018.8459905.' short: 'M. Peuster, J. Kampmeyer, H. Karl, in: 4th IEEE International Conference on Network Softwarization (NetSoft 2018), Montreal, n.d.' conference: end_date: 2018-06-29 location: Montreal name: 4th IEEE International Conference on Network Softwarization (NetSoft 2018) start_date: 2018-06-25 date_created: 2018-06-25T12:24:19Z date_updated: 2022-01-06T06:59:11Z ddc: - '000' department: - _id: '75' doi: 10.1109/NETSOFT.2018.8459905 file: - access_level: open_access content_type: application/pdf creator: peuster date_created: 2018-07-05T11:12:55Z date_updated: 2018-07-05T11:12:55Z file_id: '3429' file_name: main_ris.pdf file_size: 449513 relation: main_file file_date_updated: 2018-07-05T11:12:55Z has_accepted_license: '1' language: - iso: eng main_file_link: - url: https://ieeexplore.ieee.org/document/8459905/ oa: '1' place: Montreal project: - _id: '28' grant_number: '761493' name: 5G Development and validation platform for global industry-specific network services and Apps - _id: '1' name: SFB 901 - _id: '4' name: SFB 901 - Project Area C - _id: '16' name: SFB 901 - Subproject C4 publication: 4th IEEE International Conference on Network Softwarization (NetSoft 2018) publication_status: accepted status: public title: 'Containernet 2.0: A Rapid Prototyping Platform for Hybrid Service Function Chains' type: conference urn: '33467' user_id: '13271' year: '2018' ... --- _id: '3347' abstract: - lang: eng text: "Management and orchestration~(MANO) systems are the key components of future large-scale NFV environments. They will manage resources of hundreds or even thousands of NFV infrastructure installations, so called points of presence~(PoP). Such scenarios need to be automatically tested during the development phase of a MANO system. This task becomes very challenging because large-scale NFV testbeds are hard to maintain, too expensive, or simply not available.\r\n\r\nIn this paper, we present a multi-PoP NFV infrastructure emulation platform that enables automated, large-scale testing of MANO stacks. We show that our platform can easily emulate hundreds of PoPs on a single physical machine and reduces the setup time of a test PoP by a factor of 232x compared to a DevStack-based test PoP installation. Further, we present a case study in which we test ETSI's Open Source MANO~(OSM) against our proposed system to gain insights about OSM's behaviour in large-scale NFV deployments." author: - first_name: Manuel full_name: Peuster, Manuel id: '13271' last_name: Peuster - first_name: Michael full_name: Marchetti, Michael last_name: Marchetti - first_name: Gerado full_name: Garcia de Blas, Gerado last_name: Garcia de Blas - first_name: Holger full_name: Karl, Holger id: '126' last_name: Karl citation: ama: 'Peuster M, Marchetti M, Garcia de Blas G, Karl H. Emulation-based Smoke Testing of NFV Orchestrators in Large Multi-PoP Environments. In: European Conference on Networks and Communications (EuCNC). Ljubljana. doi:10.1109/EuCNC.2018.8442701' apa: Peuster, M., Marchetti, M., Garcia de Blas, G., & Karl, H. (n.d.). Emulation-based Smoke Testing of NFV Orchestrators in Large Multi-PoP Environments. In European Conference on Networks and Communications (EuCNC). Ljubljana. https://doi.org/10.1109/EuCNC.2018.8442701 bibtex: '@inproceedings{Peuster_Marchetti_Garcia de Blas_Karl, place={Ljubljana}, title={Emulation-based Smoke Testing of NFV Orchestrators in Large Multi-PoP Environments}, DOI={10.1109/EuCNC.2018.8442701}, booktitle={European Conference on Networks and Communications (EuCNC)}, author={Peuster, Manuel and Marchetti, Michael and Garcia de Blas, Gerado and Karl, Holger} }' chicago: Peuster, Manuel, Michael Marchetti, Gerado Garcia de Blas, and Holger Karl. “Emulation-Based Smoke Testing of NFV Orchestrators in Large Multi-PoP Environments.” In European Conference on Networks and Communications (EuCNC). Ljubljana, n.d. https://doi.org/10.1109/EuCNC.2018.8442701. ieee: M. Peuster, M. Marchetti, G. Garcia de Blas, and H. Karl, “Emulation-based Smoke Testing of NFV Orchestrators in Large Multi-PoP Environments,” in European Conference on Networks and Communications (EuCNC), Ljubljana. mla: Peuster, Manuel, et al. “Emulation-Based Smoke Testing of NFV Orchestrators in Large Multi-PoP Environments.” European Conference on Networks and Communications (EuCNC), doi:10.1109/EuCNC.2018.8442701. short: 'M. Peuster, M. Marchetti, G. Garcia de Blas, H. Karl, in: European Conference on Networks and Communications (EuCNC), Ljubljana, n.d.' conference: location: Ljubljana name: European Conference on Networks and Communications (EuCNC) date_created: 2018-06-25T12:27:59Z date_updated: 2022-01-06T06:59:12Z ddc: - '000' department: - _id: '75' doi: 10.1109/EuCNC.2018.8442701 file: - access_level: open_access content_type: application/pdf creator: peuster date_created: 2018-07-05T11:13:29Z date_updated: 2018-07-05T11:13:29Z file_id: '3430' file_name: main_ris.pdf file_size: 713495 relation: main_file file_date_updated: 2018-07-05T11:13:29Z has_accepted_license: '1' language: - iso: eng main_file_link: - url: https://ieeexplore.ieee.org/document/8442701/ oa: '1' place: Ljubljana project: - _id: '28' grant_number: '761493' name: 5G Development and validation platform for global industry-specific network services and Apps - _id: '1' name: SFB 901 - _id: '4' name: SFB 901 - Project Area C - _id: '16' name: SFB 901 - Subproject C4 publication: European Conference on Networks and Communications (EuCNC) publication_status: accepted status: public title: Emulation-based Smoke Testing of NFV Orchestrators in Large Multi-PoP Environments type: conference urn: '33477' user_id: '13271' year: '2018' ... --- _id: '3362' abstract: - lang: eng text: Profiling applications on a heterogeneous compute node is challenging since the way to retrieve data from the resources and interpret them varies between resource types and manufacturers. This holds especially true for measuring the energy consumption. In this paper we present Ampehre, a novel open source measurement framework that allows developers to gather comparable measurements from heterogeneous compute nodes, e.g., nodes comprising CPU, GPU, and FPGA. We explain the architecture of Ampehre and detail the measurement process on the example of energy measurements on CPU and GPU. To characterize the probing effect, we quantitatively analyze the trade-off between the accuracy of measurements and the CPU load imposed by Ampehre. Based on this analysis, we are able to specify reasonable combinations of sampling periods for the different resource types of a compute node. author: - first_name: Achim full_name: Lösch, Achim id: '43646' last_name: Lösch - first_name: Alex full_name: Wiens, Alex last_name: Wiens - first_name: Marco full_name: Platzner, Marco id: '398' last_name: Platzner citation: ama: 'Lösch A, Wiens A, Platzner M. Ampehre: An Open Source Measurement Framework for Heterogeneous Compute Nodes. In: Proceedings of the International Conference on Architecture of Computing Systems (ARCS). Vol 10793. Lecture Notes in Computer Science. Cham: Springer International Publishing; 2018:73-84. doi:10.1007/978-3-319-77610-1_6' apa: 'Lösch, A., Wiens, A., & Platzner, M. (2018). Ampehre: An Open Source Measurement Framework for Heterogeneous Compute Nodes. In Proceedings of the International Conference on Architecture of Computing Systems (ARCS) (Vol. 10793, pp. 73–84). Cham: Springer International Publishing. https://doi.org/10.1007/978-3-319-77610-1_6' bibtex: '@inproceedings{Lösch_Wiens_Platzner_2018, place={Cham}, series={Lecture Notes in Computer Science}, title={Ampehre: An Open Source Measurement Framework for Heterogeneous Compute Nodes}, volume={10793}, DOI={10.1007/978-3-319-77610-1_6}, booktitle={Proceedings of the International Conference on Architecture of Computing Systems (ARCS)}, publisher={Springer International Publishing}, author={Lösch, Achim and Wiens, Alex and Platzner, Marco}, year={2018}, pages={73–84}, collection={Lecture Notes in Computer Science} }' chicago: 'Lösch, Achim, Alex Wiens, and Marco Platzner. “Ampehre: An Open Source Measurement Framework for Heterogeneous Compute Nodes.” In Proceedings of the International Conference on Architecture of Computing Systems (ARCS), 10793:73–84. Lecture Notes in Computer Science. Cham: Springer International Publishing, 2018. https://doi.org/10.1007/978-3-319-77610-1_6.' ieee: 'A. Lösch, A. Wiens, and M. Platzner, “Ampehre: An Open Source Measurement Framework for Heterogeneous Compute Nodes,” in Proceedings of the International Conference on Architecture of Computing Systems (ARCS), 2018, vol. 10793, pp. 73–84.' mla: 'Lösch, Achim, et al. “Ampehre: An Open Source Measurement Framework for Heterogeneous Compute Nodes.” Proceedings of the International Conference on Architecture of Computing Systems (ARCS), vol. 10793, Springer International Publishing, 2018, pp. 73–84, doi:10.1007/978-3-319-77610-1_6.' short: 'A. Lösch, A. Wiens, M. Platzner, in: Proceedings of the International Conference on Architecture of Computing Systems (ARCS), Springer International Publishing, Cham, 2018, pp. 73–84.' date_created: 2018-06-26T13:47:52Z date_updated: 2022-01-06T06:59:13Z ddc: - '040' department: - _id: '78' doi: 10.1007/978-3-319-77610-1_6 file: - access_level: closed content_type: application/pdf creator: aloesch date_created: 2018-06-26T13:58:28Z date_updated: 2018-06-26T13:58:28Z file_id: '3363' file_name: loesch2017_arcs.pdf file_size: 1114026 relation: main_file success: 1 file_date_updated: 2018-06-26T13:58:28Z has_accepted_license: '1' intvolume: ' 10793' page: 73-84 place: Cham project: - _id: '14' name: SFB 901 - Subproject C2 - _id: '4' name: SFB 901 - Project Area C - _id: '1' name: SFB 901 publication: Proceedings of the International Conference on Architecture of Computing Systems (ARCS) publication_identifier: isbn: - '9783319776095' - '9783319776101' issn: - 0302-9743 - 1611-3349 publication_status: published publisher: Springer International Publishing series_title: Lecture Notes in Computer Science status: public title: 'Ampehre: An Open Source Measurement Framework for Heterogeneous Compute Nodes' type: conference user_id: '477' volume: 10793 year: '2018' ... --- _id: '3365' author: - first_name: Jan-Philip full_name: Schnuer, Jan-Philip last_name: Schnuer citation: ama: Schnuer J-P. Static Scheduling Algorithms for Heterogeneous Compute Nodes. Universität Paderborn; 2018. apa: Schnuer, J.-P. (2018). Static Scheduling Algorithms for Heterogeneous Compute Nodes. Universität Paderborn. bibtex: '@book{Schnuer_2018, title={Static Scheduling Algorithms for Heterogeneous Compute Nodes}, publisher={Universität Paderborn}, author={Schnuer, Jan-Philip}, year={2018} }' chicago: Schnuer, Jan-Philip. Static Scheduling Algorithms for Heterogeneous Compute Nodes. Universität Paderborn, 2018. ieee: J.-P. Schnuer, Static Scheduling Algorithms for Heterogeneous Compute Nodes. Universität Paderborn, 2018. mla: Schnuer, Jan-Philip. Static Scheduling Algorithms for Heterogeneous Compute Nodes. Universität Paderborn, 2018. short: J.-P. Schnuer, Static Scheduling Algorithms for Heterogeneous Compute Nodes, Universität Paderborn, 2018. date_created: 2018-06-26T14:10:18Z date_updated: 2022-01-06T06:59:13Z department: - _id: '78' language: - iso: eng project: - _id: '14' name: SFB 901 - Subproject C2 - _id: '1' name: SFB 901 - _id: '4' name: SFB 901 - Project Area C publisher: Universität Paderborn status: public supervisor: - first_name: Achim full_name: Lösch, Achim id: '43646' last_name: Lösch - first_name: Marco full_name: Platzner, Marco id: '398' last_name: Platzner title: Static Scheduling Algorithms for Heterogeneous Compute Nodes type: bachelorsthesis user_id: '477' year: '2018' ... --- _id: '3366' author: - first_name: Marcel full_name: Croce, Marcel last_name: Croce citation: ama: Croce M. Evaluation of OpenCL-Based Compilation for FPGAs. Universität Paderborn; 2018. apa: Croce, M. (2018). Evaluation of OpenCL-based Compilation for FPGAs. Universität Paderborn. bibtex: '@book{Croce_2018, title={Evaluation of OpenCL-based Compilation for FPGAs}, publisher={Universität Paderborn}, author={Croce, Marcel}, year={2018} }' chicago: Croce, Marcel. Evaluation of OpenCL-Based Compilation for FPGAs. Universität Paderborn, 2018. ieee: M. Croce, Evaluation of OpenCL-based Compilation for FPGAs. Universität Paderborn, 2018. mla: Croce, Marcel. Evaluation of OpenCL-Based Compilation for FPGAs. Universität Paderborn, 2018. short: M. Croce, Evaluation of OpenCL-Based Compilation for FPGAs, Universität Paderborn, 2018. date_created: 2018-06-26T14:12:00Z date_updated: 2022-01-06T06:59:13Z department: - _id: '78' language: - iso: eng project: - _id: '14' name: SFB 901 - Subproject C2 - _id: '1' name: SFB 901 - _id: '4' name: SFB 901 - Project Area C publisher: Universität Paderborn status: public supervisor: - first_name: Achim full_name: Lösch, Achim id: '43646' last_name: Lösch - first_name: Marco full_name: Platzner, Marco id: '398' last_name: Platzner title: Evaluation of OpenCL-based Compilation for FPGAs type: bachelorsthesis user_id: '477' year: '2018' ... --- _id: '3373' abstract: - lang: eng text: Modern Boolean satisfiability solvers can emit proofs of unsatisfiability. There is substantial interest in being able to verify such proofs and also in using them for further computations. In this paper, we present an FPGA accelerator for checking resolution proofs, a popular proof format. Our accelerator exploits parallelism at the low level by implementing the basic resolution step in hardware, and at the high level by instantiating a number of parallel modules for proof checking. Since proof checking involves highly irregular memory accesses, we employ Hybrid Memory Cube technology for accelerator memory. The results show that while the accelerator is scalable and achieves speedups for all benchmark proofs, performance improvements are currently limited by the overhead of transitioning the proof into the accelerator memory. author: - first_name: Tim full_name: Hansmeier, Tim id: '49992' last_name: Hansmeier orcid: 0000-0003-1377-3339 - first_name: Marco full_name: Platzner, Marco id: '398' last_name: Platzner - first_name: David full_name: Andrews, David last_name: Andrews citation: ama: 'Hansmeier T, Platzner M, Andrews D. An FPGA/HMC-Based Accelerator for Resolution Proof Checking. In: ARC 2018: Applied Reconfigurable Computing. Architectures, Tools, and Applications. Vol 10824. Lecture Notes in Computer Science. Springer International Publishing; 2018:153-165. doi:10.1007/978-3-319-78890-6_13' apa: 'Hansmeier, T., Platzner, M., & Andrews, D. (2018). An FPGA/HMC-Based Accelerator for Resolution Proof Checking. In ARC 2018: Applied Reconfigurable Computing. Architectures, Tools, and Applications (Vol. 10824, pp. 153–165). Santorini, Greece: Springer International Publishing. https://doi.org/10.1007/978-3-319-78890-6_13' bibtex: '@inproceedings{Hansmeier_Platzner_Andrews_2018, series={Lecture Notes in Computer Science}, title={An FPGA/HMC-Based Accelerator for Resolution Proof Checking}, volume={10824}, DOI={10.1007/978-3-319-78890-6_13}, booktitle={ARC 2018: Applied Reconfigurable Computing. Architectures, Tools, and Applications}, publisher={Springer International Publishing}, author={Hansmeier, Tim and Platzner, Marco and Andrews, David}, year={2018}, pages={153–165}, collection={Lecture Notes in Computer Science} }' chicago: 'Hansmeier, Tim, Marco Platzner, and David Andrews. “An FPGA/HMC-Based Accelerator for Resolution Proof Checking.” In ARC 2018: Applied Reconfigurable Computing. Architectures, Tools, and Applications, 10824:153–65. Lecture Notes in Computer Science. Springer International Publishing, 2018. https://doi.org/10.1007/978-3-319-78890-6_13.' ieee: 'T. Hansmeier, M. Platzner, and D. Andrews, “An FPGA/HMC-Based Accelerator for Resolution Proof Checking,” in ARC 2018: Applied Reconfigurable Computing. Architectures, Tools, and Applications, Santorini, Greece, 2018, vol. 10824, pp. 153–165.' mla: 'Hansmeier, Tim, et al. “An FPGA/HMC-Based Accelerator for Resolution Proof Checking.” ARC 2018: Applied Reconfigurable Computing. Architectures, Tools, and Applications, vol. 10824, Springer International Publishing, 2018, pp. 153–65, doi:10.1007/978-3-319-78890-6_13.' short: 'T. Hansmeier, M. Platzner, D. Andrews, in: ARC 2018: Applied Reconfigurable Computing. Architectures, Tools, and Applications, Springer International Publishing, 2018, pp. 153–165.' conference: end_date: 2018-05-04 location: Santorini, Greece name: 'ARC: International Symposium on Applied Reconfigurable Computing' start_date: 2018-05-02 date_created: 2018-06-27T09:30:24Z date_updated: 2022-01-06T06:59:13Z ddc: - '000' department: - _id: '78' doi: 10.1007/978-3-319-78890-6_13 file: - access_level: closed content_type: application/pdf creator: ups date_created: 2018-11-02T13:55:07Z date_updated: 2018-11-02T13:55:07Z file_id: '5257' file_name: AnFPGAHMC-BasedAcceleratorForR.pdf file_size: 612367 relation: main_file success: 1 file_date_updated: 2018-11-02T13:55:07Z has_accepted_license: '1' intvolume: ' 10824' language: - iso: eng page: 153-165 project: - _id: '12' name: SFB 901 - Subproject B4 - _id: '1' name: SFB 901 - _id: '3' name: SFB 901 - Project Area B publication: 'ARC 2018: Applied Reconfigurable Computing. Architectures, Tools, and Applications' publication_identifier: isbn: - '9783319788890' - '9783319788906' issn: - 0302-9743 - 1611-3349 publication_status: published publisher: Springer International Publishing series_title: Lecture Notes in Computer Science status: public title: An FPGA/HMC-Based Accelerator for Resolution Proof Checking type: conference user_id: '3118' volume: 10824 year: '2018' ... --- _id: '3402' abstract: - lang: eng text: In machine learning, so-called nested dichotomies are utilized as a reduction technique, i.e., to decompose a multi-class classification problem into a set of binary problems, which are solved using a simple binary classifier as a base learner. The performance of the (multi-class) classifier thus produced strongly depends on the structure of the decomposition. In this paper, we conduct an empirical study, in which we compare existing heuristics for selecting a suitable structure in the form of a nested dichotomy. Moreover, we propose two additional heuristics as natural completions. One of them is the Best-of-K heuristic, which picks the (presumably) best among K randomly generated nested dichotomies. Surprisingly, and in spite of its simplicity, it turns out to outperform the state of the art. author: - first_name: Vitalik full_name: Melnikov, Vitalik last_name: Melnikov - first_name: Eyke full_name: Hüllermeier, Eyke id: '48129' last_name: Hüllermeier citation: ama: 'Melnikov V, Hüllermeier E. On the effectiveness of heuristics for learning nested dichotomies: an empirical analysis. Machine Learning. 2018. doi:10.1007/s10994-018-5733-1' apa: 'Melnikov, V., & Hüllermeier, E. (2018). On the effectiveness of heuristics for learning nested dichotomies: an empirical analysis. Machine Learning. https://doi.org/10.1007/s10994-018-5733-1' bibtex: '@article{Melnikov_Hüllermeier_2018, title={On the effectiveness of heuristics for learning nested dichotomies: an empirical analysis}, DOI={10.1007/s10994-018-5733-1}, journal={Machine Learning}, author={Melnikov, Vitalik and Hüllermeier, Eyke}, year={2018} }' chicago: 'Melnikov, Vitalik, and Eyke Hüllermeier. “On the Effectiveness of Heuristics for Learning Nested Dichotomies: An Empirical Analysis.” Machine Learning, 2018. https://doi.org/10.1007/s10994-018-5733-1.' ieee: 'V. Melnikov and E. Hüllermeier, “On the effectiveness of heuristics for learning nested dichotomies: an empirical analysis,” Machine Learning, 2018.' mla: 'Melnikov, Vitalik, and Eyke Hüllermeier. “On the Effectiveness of Heuristics for Learning Nested Dichotomies: An Empirical Analysis.” Machine Learning, 2018, doi:10.1007/s10994-018-5733-1.' short: V. Melnikov, E. Hüllermeier, Machine Learning (2018). date_created: 2018-06-29T07:44:26Z date_updated: 2022-01-06T06:59:14Z ddc: - '000' department: - _id: '355' doi: 10.1007/s10994-018-5733-1 file: - access_level: closed content_type: application/pdf creator: ups date_created: 2018-11-02T15:30:57Z date_updated: 2018-11-02T15:30:57Z file_id: '5305' file_name: OnTheEffectivenessOfHeuristics.pdf file_size: 1482882 relation: main_file success: 1 file_date_updated: 2018-11-02T15:30:57Z has_accepted_license: '1' language: - iso: eng project: - _id: '11' name: SFB 901 - Subproject B3 - _id: '3' name: SFB 901 - Project Area B - _id: '1' name: SFB 901 publication: Machine Learning publication_identifier: issn: - 1573-0565 status: public title: 'On the effectiveness of heuristics for learning nested dichotomies: an empirical analysis' type: journal_article user_id: '15504' year: '2018' ... --- _id: '3414' abstract: - lang: eng text: "Over the years, Design by Contract (DbC) has evolved as a\r\npowerful concept for program documentation, testing, and verification.\r\nContracts formally specify assertions on (mostly) object-oriented programs:\r\npre- and postconditions of methods, class invariants, allowed call\r\norders, etc. Missing in the long list of properties specifiable by contracts\r\nare, however, method correlations: DbC languages fall short on stating\r\nassertions relating methods.\r\nIn this paper, we propose the novel concept of inter-method contract,\r\nallowing precisely for expressing method correlations.We present JMC as\r\na language for specifying and JMCTest as a tool for dynamically checking\r\ninter-method contracts on Java programs. JMCTest fully automatically\r\ngenerates objects on which the contracted methods are called and\r\nthe validity of the contract is checked. Using JMCTest, we detected\r\nthat large Java code bases (e.g. JBoss, Java RT) frequently violate standard\r\ninter-method contracts. In comparison to other verification tools\r\ninspecting (some) inter-method contracts, JMCTest can find bugs that\r\nremain undetected by those tools." author: - first_name: Paul full_name: Börding, Paul last_name: Börding - first_name: Jan Frederik full_name: Haltermann, Jan Frederik id: '44413' last_name: Haltermann - first_name: Marie-Christine full_name: Jakobs, Marie-Christine last_name: Jakobs - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim citation: ama: 'Börding P, Haltermann JF, Jakobs M-C, Wehrheim H. JMCTest: Automatically Testing Inter-Method Contracts in Java. In: Proceedings of the IFIP International Conference on Testing Software and Systems (ICTSS 2018). Vol 11146. Lecture Notes in Computer Science. Springer; 2018:39--55.' apa: 'Börding, P., Haltermann, J. F., Jakobs, M.-C., & Wehrheim, H. (2018). JMCTest: Automatically Testing Inter-Method Contracts in Java. In Proceedings of the IFIP International Conference on Testing Software and Systems (ICTSS 2018) (Vol. 11146, pp. 39--55). Cádiz, Spain: Springer.' bibtex: '@inproceedings{Börding_Haltermann_Jakobs_Wehrheim_2018, series={Lecture Notes in Computer Science}, title={JMCTest: Automatically Testing Inter-Method Contracts in Java}, volume={11146}, booktitle={Proceedings of the IFIP International Conference on Testing Software and Systems (ICTSS 2018)}, publisher={Springer}, author={Börding, Paul and Haltermann, Jan Frederik and Jakobs, Marie-Christine and Wehrheim, Heike}, year={2018}, pages={39--55}, collection={Lecture Notes in Computer Science} }' chicago: 'Börding, Paul, Jan Frederik Haltermann, Marie-Christine Jakobs, and Heike Wehrheim. “JMCTest: Automatically Testing Inter-Method Contracts in Java.” In Proceedings of the IFIP International Conference on Testing Software and Systems (ICTSS 2018), 11146:39--55. Lecture Notes in Computer Science. Springer, 2018.' ieee: 'P. Börding, J. F. Haltermann, M.-C. Jakobs, and H. Wehrheim, “JMCTest: Automatically Testing Inter-Method Contracts in Java,” in Proceedings of the IFIP International Conference on Testing Software and Systems (ICTSS 2018), Cádiz, Spain, 2018, vol. 11146, pp. 39--55.' mla: 'Börding, Paul, et al. “JMCTest: Automatically Testing Inter-Method Contracts in Java.” Proceedings of the IFIP International Conference on Testing Software and Systems (ICTSS 2018), vol. 11146, Springer, 2018, pp. 39--55.' short: 'P. Börding, J.F. Haltermann, M.-C. Jakobs, H. Wehrheim, in: Proceedings of the IFIP International Conference on Testing Software and Systems (ICTSS 2018), Springer, 2018, pp. 39--55.' conference: end_date: 2018-10-03 location: Cádiz, Spain name: IFIP International Conference on Testing Software and Systems start_date: 2018-10-01 date_created: 2018-07-02T09:06:56Z date_updated: 2022-01-06T06:59:15Z ddc: - '006' department: - _id: '7' - _id: '77' file: - access_level: closed content_type: application/pdf creator: schlatt date_created: 2018-11-21T09:35:35Z date_updated: 2018-11-21T09:35:35Z file_id: '5770' file_name: Börding2018_Chapter_JMCTestAutomaticallyTestingInt.pdf file_size: 574386 relation: main_file success: 1 file_date_updated: 2018-11-21T09:35:35Z has_accepted_license: '1' intvolume: ' 11146' language: - iso: eng page: 39--55 project: - _id: '1' name: SFB 901 - _id: '3' name: SFB 901 - Project Area B - _id: '11' name: SFB 901 - Subproject B3 publication: Proceedings of the IFIP International Conference on Testing Software and Systems (ICTSS 2018) publication_status: published publisher: Springer series_title: Lecture Notes in Computer Science status: public title: 'JMCTest: Automatically Testing Inter-Method Contracts in Java' type: conference user_id: '29719' volume: 11146 year: '2018' ... --- _id: '3422' abstract: - lang: eng text: "We study the consensus problem in a synchronous distributed system of n nodes under an adaptive adversary that has a slightly outdated view of the system and can block all incoming and outgoing communication of a constant fraction of the nodes in each round. Motivated by a result of Ben-Or and Bar-Joseph (1998), showing that any consensus algorithm that is resilient against a linear number of crash faults requires $\\tilde \\Omega(\\sqrt n)$ rounds in an n-node network against an adaptive adversary, we consider a late adaptive adversary, who has full knowledge of the network state at the beginning of the previous round and unlimited computational power, but is oblivious to the current state of the nodes. \r\n\r\nOur main contributions are randomized distributed algorithms that achieve consensus with high probability among all except a small constant fraction of the nodes (i.e., \"almost-everywhere'') against a late adaptive adversary who can block up to ε n$ nodes in each round, for a small constant ε >0$. Our first protocol achieves binary almost-everywhere consensus and also guarantees a decision on the majority input value, thus ensuring plurality consensus. We also present an algorithm that achieves the same time complexity for multi-value consensus. Both of our algorithms succeed in $O(log n)$ rounds with high probability, thus showing an exponential gap to the $\\tilde\\Omega(\\sqrt n)$ lower bound of Ben-Or and Bar-Joseph for strongly adaptive crash-failure adversaries, which can be strengthened to $\\Omega(n)$ when allowing the adversary to block nodes instead of permanently crashing them. Our algorithms are scalable to large systems as each node contacts only an (amortized) constant number of peers in each communication round. We show that our algorithms are optimal up to constant (resp.\\ sub-logarithmic) factors by proving that every almost-everywhere consensus protocol takes $\\Omega(log_d n)$ rounds in the worst case, where d is an upper bound on the number of communication requests initiated per node in each round. We complement our theoretical results with an experimental evaluation of the binary almost-everywhere consensus protocol revealing a short convergence time even against an adversary blocking a large fraction of nodes." author: - first_name: Peter full_name: Robinson, Peter last_name: Robinson - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Alexander full_name: Setzer, Alexander id: '11108' last_name: Setzer citation: ama: 'Robinson P, Scheideler C, Setzer A. Breaking the $\tilde\Omega(\sqrt{n})$ Barrier: Fast Consensus under a Late Adversary. In: Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). doi:10.1145/3210377.3210399' apa: 'Robinson, P., Scheideler, C., & Setzer, A. (n.d.). Breaking the $\tilde\Omega(\sqrt{n})$ Barrier: Fast Consensus under a Late Adversary. In Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). Wien. https://doi.org/10.1145/3210377.3210399' bibtex: '@inproceedings{Robinson_Scheideler_Setzer, title={Breaking the $\tilde\Omega(\sqrt{n})$ Barrier: Fast Consensus under a Late Adversary}, DOI={10.1145/3210377.3210399}, booktitle={Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}, author={Robinson, Peter and Scheideler, Christian and Setzer, Alexander} }' chicago: 'Robinson, Peter, Christian Scheideler, and Alexander Setzer. “Breaking the $\tilde\Omega(\sqrt{n})$ Barrier: Fast Consensus under a Late Adversary.” In Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), n.d. https://doi.org/10.1145/3210377.3210399.' ieee: 'P. Robinson, C. Scheideler, and A. Setzer, “Breaking the $\tilde\Omega(\sqrt{n})$ Barrier: Fast Consensus under a Late Adversary,” in Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), Wien.' mla: 'Robinson, Peter, et al. “Breaking the $\tilde\Omega(\sqrt{n})$ Barrier: Fast Consensus under a Late Adversary.” Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), doi:10.1145/3210377.3210399.' short: 'P. Robinson, C. Scheideler, A. Setzer, in: Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), n.d.' conference: end_date: 2018-07-18 location: Wien name: 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) start_date: 2018-07-16 date_created: 2018-07-04T08:55:45Z date_updated: 2022-01-06T06:59:16Z ddc: - '040' department: - _id: '79' - _id: '34' - _id: '7' doi: 10.1145/3210377.3210399 file: - access_level: closed content_type: application/pdf creator: asetzer date_created: 2018-10-31T13:30:40Z date_updated: 2018-10-31T13:30:40Z file_id: '5215' file_name: p173-robinson.pdf file_size: 1675407 relation: main_file success: 1 file_date_updated: 2018-10-31T13:30:40Z has_accepted_license: '1' keyword: - distributed consensus - randomized algorithm - adaptive adversary - complexity lower bound language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '4' name: SFB 901 - Project Area C - _id: '13' name: SFB 901 - Subproject C1 publication: Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) publication_identifier: isbn: - 978-1-4503-5799-9/18/07 publication_status: accepted status: public title: 'Breaking the $\tilde\Omega(\sqrt{n})$ Barrier: Fast Consensus under a Late Adversary' type: conference user_id: '11108' year: '2018' ... --- _id: '3510' abstract: - lang: eng text: Automated machine learning (AutoML) seeks to automatically select, compose, and parametrize machine learning algorithms, so as to achieve optimal performance on a given task (dataset). Although current approaches to AutoML have already produced impressive results, the field is still far from mature, and new techniques are still being developed. In this paper, we present ML-Plan, a new approach to AutoML based on hierarchical planning. To highlight the potential of this approach, we compare ML-Plan to the state-of-the-art frameworks Auto-WEKA, auto-sklearn, and TPOT. In an extensive series of experiments, we show that ML-Plan is highly competitive and often outperforms existing approaches. article_type: original author: - first_name: Felix full_name: Mohr, Felix last_name: Mohr - first_name: Marcel Dominik full_name: Wever, Marcel Dominik id: '33176' last_name: Wever orcid: ' https://orcid.org/0000-0001-9782-6818' - first_name: Eyke full_name: Hüllermeier, Eyke id: '48129' last_name: Hüllermeier citation: ama: 'Mohr F, Wever MD, Hüllermeier E. ML-Plan: Automated Machine Learning via Hierarchical Planning. Machine Learning. Published online 2018:1495-1515. doi:10.1007/s10994-018-5735-z' apa: 'Mohr, F., Wever, M. D., & Hüllermeier, E. (2018). ML-Plan: Automated Machine Learning via Hierarchical Planning. Machine Learning, 1495–1515. https://doi.org/10.1007/s10994-018-5735-z' bibtex: '@article{Mohr_Wever_Hüllermeier_2018, title={ML-Plan: Automated Machine Learning via Hierarchical Planning}, DOI={10.1007/s10994-018-5735-z}, journal={Machine Learning}, publisher={Springer}, author={Mohr, Felix and Wever, Marcel Dominik and Hüllermeier, Eyke}, year={2018}, pages={1495–1515} }' chicago: 'Mohr, Felix, Marcel Dominik Wever, and Eyke Hüllermeier. “ML-Plan: Automated Machine Learning via Hierarchical Planning.” Machine Learning, 2018, 1495–1515. https://doi.org/10.1007/s10994-018-5735-z.' ieee: 'F. Mohr, M. D. Wever, and E. Hüllermeier, “ML-Plan: Automated Machine Learning via Hierarchical Planning,” Machine Learning, pp. 1495–1515, 2018, doi: 10.1007/s10994-018-5735-z.' mla: 'Mohr, Felix, et al. “ML-Plan: Automated Machine Learning via Hierarchical Planning.” Machine Learning, Springer, 2018, pp. 1495–515, doi:10.1007/s10994-018-5735-z.' short: F. Mohr, M.D. Wever, E. Hüllermeier, Machine Learning (2018) 1495–1515. conference: end_date: 2018-09-14 location: Dublin, Ireland name: European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases start_date: 2018-09-10 date_created: 2018-07-08T14:06:14Z date_updated: 2022-01-06T06:59:21Z ddc: - '000' department: - _id: '355' - _id: '34' - _id: '7' - _id: '26' doi: 10.1007/s10994-018-5735-z file: - access_level: closed content_type: application/pdf creator: ups date_created: 2018-11-02T15:32:16Z date_updated: 2018-11-02T15:32:16Z file_id: '5306' file_name: ML-PlanAutomatedMachineLearnin.pdf file_size: 1070937 relation: main_file success: 1 file_date_updated: 2018-11-02T15:32:16Z has_accepted_license: '1' keyword: - AutoML - Hierarchical Planning - HTN planning - ML-Plan language: - iso: eng main_file_link: - open_access: '1' url: https://rdcu.be/3Nc2 oa: '1' page: 1495-1515 project: - _id: '1' name: SFB 901 - _id: '3' name: SFB 901 - Project Area B - _id: '10' name: SFB 901 - Subproject B2 - _id: '52' name: Computing Resources Provided by the Paderborn Center for Parallel Computing publication: Machine Learning publication_identifier: eissn: - 1573-0565 issn: - 0885-6125 publication_status: epub_ahead publisher: Springer status: public title: 'ML-Plan: Automated Machine Learning via Hierarchical Planning' type: journal_article user_id: '5786' year: '2018' ... --- _id: '3516' abstract: - lang: eng text: 'Triadic service relationships comprise complex relationships in which not only the customer and provider are involved as partners but also other individuals with caregiving relationships with the customer. A triadic constellation may arise in the context of services for animal companions, for example, when veterinarians provide counsel and treatment to the animal companion and its owner. Through interviews with both owners of animal companions and providers of services for animal companions, this study explores typical constellations and characteristics of the three relationships in this service triad. In line with balance theory, the results show that four distinct types of triadic relationships exist in services for animal companions: the harmonious, the dysfunctional, the challenging, and the doubtful triad. The study highlights the potential conflicts and dynamics in the triads to advise providers on how to address customers depending on the types of triads to which they belong.' article_type: original author: - first_name: Julia full_name: Rötzmeier-Keuper, Julia id: '24869' last_name: Rötzmeier-Keuper - first_name: Jennifer full_name: Hendricks, Jennifer last_name: Hendricks - first_name: Nancy full_name: Wünderlich, Nancy id: '36392' last_name: Wünderlich - first_name: Gertrud full_name: Schmitz, Gertrud last_name: Schmitz citation: ama: Rötzmeier-Keuper J, Hendricks J, Wünderlich N, Schmitz G. Triadic relationships in the context of services for animal companions. Journal of Business Research. 2018;(85):295--303. apa: Rötzmeier-Keuper, J., Hendricks, J., Wünderlich, N., & Schmitz, G. (2018). Triadic relationships in the context of services for animal companions. Journal of Business Research, (85), 295--303. bibtex: '@article{Rötzmeier-Keuper_Hendricks_Wünderlich_Schmitz_2018, title={Triadic relationships in the context of services for animal companions}, number={85}, journal={Journal of Business Research}, publisher={Elsevier}, author={Rötzmeier-Keuper, Julia and Hendricks, Jennifer and Wünderlich, Nancy and Schmitz, Gertrud}, year={2018}, pages={295--303} }' chicago: 'Rötzmeier-Keuper, Julia, Jennifer Hendricks, Nancy Wünderlich, and Gertrud Schmitz. “Triadic Relationships in the Context of Services for Animal Companions.” Journal of Business Research, no. 85 (2018): 295--303.' ieee: J. Rötzmeier-Keuper, J. Hendricks, N. Wünderlich, and G. Schmitz, “Triadic relationships in the context of services for animal companions,” Journal of Business Research, no. 85, pp. 295--303, 2018. mla: Rötzmeier-Keuper, Julia, et al. “Triadic Relationships in the Context of Services for Animal Companions.” Journal of Business Research, no. 85, Elsevier, 2018, pp. 295--303. short: J. Rötzmeier-Keuper, J. Hendricks, N. Wünderlich, G. Schmitz, Journal of Business Research (2018) 295--303. date_created: 2018-07-10T07:15:45Z date_updated: 2022-01-06T06:59:21Z department: - _id: '181' issue: '85' keyword: - Triadic relationships - Balance theory - Pet-related services - Animal companions - Service relationship typology - Service triads language: - iso: eng page: 295--303 publication: Journal of Business Research publication_status: published publisher: Elsevier status: public title: Triadic relationships in the context of services for animal companions type: journal_article user_id: '37741' year: '2018' ... --- _id: '3520' author: - first_name: Matthias full_name: Pelster, Matthias id: '67265' last_name: Pelster orcid: ' https://orcid.org/0000-0001-5740-2420' - first_name: Annette full_name: Hofmann, Annette last_name: Hofmann citation: ama: 'Pelster M, Hofmann A. About the Fear of Reputational Loss: Social Trading and the Disposition Effect. Journal of Banking & Finance. 2018. doi:10.1016/j.jbankfin.2018.07.003' apa: 'Pelster, M., & Hofmann, A. (2018). About the Fear of Reputational Loss: Social Trading and the Disposition Effect. Journal of Banking & Finance. https://doi.org/10.1016/j.jbankfin.2018.07.003' bibtex: '@article{Pelster_Hofmann_2018, title={About the Fear of Reputational Loss: Social Trading and the Disposition Effect}, DOI={10.1016/j.jbankfin.2018.07.003}, journal={Journal of Banking & Finance}, author={Pelster, Matthias and Hofmann, Annette}, year={2018} }' chicago: 'Pelster, Matthias, and Annette Hofmann. “About the Fear of Reputational Loss: Social Trading and the Disposition Effect.” Journal of Banking & Finance, 2018. https://doi.org/10.1016/j.jbankfin.2018.07.003.' ieee: 'M. Pelster and A. Hofmann, “About the Fear of Reputational Loss: Social Trading and the Disposition Effect,” Journal of Banking & Finance, 2018.' mla: 'Pelster, Matthias, and Annette Hofmann. “About the Fear of Reputational Loss: Social Trading and the Disposition Effect.” Journal of Banking & Finance, 2018, doi:10.1016/j.jbankfin.2018.07.003.' short: M. Pelster, A. Hofmann, Journal of Banking & Finance (2018). date_created: 2018-07-10T08:13:12Z date_updated: 2022-01-06T06:59:21Z department: - _id: '186' - _id: '578' doi: 10.1016/j.jbankfin.2018.07.003 publication: Journal of Banking & Finance status: public title: 'About the Fear of Reputational Loss: Social Trading and the Disposition Effect' type: journal_article user_id: '67265' year: '2018' ... --- _id: '3536' author: - first_name: Gerhard full_name: Schellhorn, Gerhard last_name: Schellhorn - first_name: Monika full_name: Wedel, Monika last_name: Wedel - first_name: Oleg full_name: Travkin, Oleg last_name: Travkin - first_name: Jürgen full_name: König, Jürgen id: '22358' last_name: König - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim citation: ama: 'Schellhorn G, Wedel M, Travkin O, König J, Wehrheim H. FastLane Is Opaque – a Case Study in Mechanized Proofs of Opacity. In: Software Engineering and Formal Methods. Cham: Springer International Publishing; 2018:105-120. doi:10.1007/978-3-319-92970-5_7' apa: 'Schellhorn, G., Wedel, M., Travkin, O., König, J., & Wehrheim, H. (2018). FastLane Is Opaque – a Case Study in Mechanized Proofs of Opacity. In Software Engineering and Formal Methods (pp. 105–120). Cham: Springer International Publishing. https://doi.org/10.1007/978-3-319-92970-5_7' bibtex: '@inbook{Schellhorn_Wedel_Travkin_König_Wehrheim_2018, place={Cham}, title={FastLane Is Opaque – a Case Study in Mechanized Proofs of Opacity}, DOI={10.1007/978-3-319-92970-5_7}, booktitle={Software Engineering and Formal Methods}, publisher={Springer International Publishing}, author={Schellhorn, Gerhard and Wedel, Monika and Travkin, Oleg and König, Jürgen and Wehrheim, Heike}, year={2018}, pages={105–120} }' chicago: 'Schellhorn, Gerhard, Monika Wedel, Oleg Travkin, Jürgen König, and Heike Wehrheim. “FastLane Is Opaque – a Case Study in Mechanized Proofs of Opacity.” In Software Engineering and Formal Methods, 105–20. Cham: Springer International Publishing, 2018. https://doi.org/10.1007/978-3-319-92970-5_7.' ieee: 'G. Schellhorn, M. Wedel, O. Travkin, J. König, and H. Wehrheim, “FastLane Is Opaque – a Case Study in Mechanized Proofs of Opacity,” in Software Engineering and Formal Methods, Cham: Springer International Publishing, 2018, pp. 105–120.' mla: Schellhorn, Gerhard, et al. “FastLane Is Opaque – a Case Study in Mechanized Proofs of Opacity.” Software Engineering and Formal Methods, Springer International Publishing, 2018, pp. 105–20, doi:10.1007/978-3-319-92970-5_7. short: 'G. Schellhorn, M. Wedel, O. Travkin, J. König, H. Wehrheim, in: Software Engineering and Formal Methods, Springer International Publishing, Cham, 2018, pp. 105–120.' date_created: 2018-07-11T06:19:58Z date_updated: 2022-01-06T06:59:22Z department: - _id: '77' doi: 10.1007/978-3-319-92970-5_7 page: 105-120 place: Cham project: - _id: '78' name: Validation of Software Transactional Memory publication: Software Engineering and Formal Methods publication_identifier: isbn: - '9783319929699' - '9783319929705' issn: - 0302-9743 - 1611-3349 publication_status: published publisher: Springer International Publishing status: public title: FastLane Is Opaque – a Case Study in Mechanized Proofs of Opacity type: book_chapter user_id: '29719' year: '2018' ... --- _id: '3550' abstract: - lang: eng text: Nowadays companies like Apple create ecosystems of third- party providers and users around their software platforms. Often online stores like Apple App Store are created to directly market third-party solutions. We call such ecosystems store-oriented software ecosystems. While the architecture of these ecosystems is mainly derived from busi- ness decisions of their owners, ecosystems with greatly different archi- tectural designs have been created. This diversity makes it challenging for future ecosystem providers to understand which architectural design is suitable to fulfill certain business decisions. In turn, opening a plat- form becomes risky while endangering intellectual property or scarifying quality of services. In this paper, we identify three main design options of store-oriented software ecosystems by classifying existing ecosystems based on similarities in their business decisions. We elaborate on the design options, discuss their main contributions, and provide exemplary ecosystems. Our work provides aspiring ecosystem providers with the reusable knowledge of existing ecosystems and helps them to take more informed architectural decisions and reduce risks in future. author: - first_name: Bahar full_name: Jazayeri, Bahar id: '36399' last_name: Jazayeri - first_name: Olaf full_name: Zimmermann, Olaf last_name: Zimmermann - first_name: Gregor full_name: Engels, Gregor id: '107' last_name: Engels - first_name: Jochen full_name: Küster, Jochen last_name: Küster - first_name: Dennis full_name: Kundisch, Dennis id: '21117' last_name: Kundisch - first_name: Daniel full_name: Szopinski, Daniel id: '36372' last_name: Szopinski citation: ama: 'Jazayeri B, Zimmermann O, Engels G, Küster J, Kundisch D, Szopinski D. Design Options of Store-Oriented Software Ecosystems: An Investigation of Business Decisions. In: Proceeding of International Symposium on Business Modeling and Software Design. Vol 319. Lecture Notes in Business Information Processing (LNBIP). Wien, Austria: Springer; 2018:390-400. doi:10.1007/978-3-319-94214-8_30' apa: 'Jazayeri, B., Zimmermann, O., Engels, G., Küster, J., Kundisch, D., & Szopinski, D. (2018). Design Options of Store-Oriented Software Ecosystems: An Investigation of Business Decisions. In Proceeding of International Symposium on Business Modeling and Software Design (Vol. 319, pp. 390–400). Wien, Austria: Springer. https://doi.org/10.1007/978-3-319-94214-8_30' bibtex: '@inproceedings{Jazayeri_Zimmermann_Engels_Küster_Kundisch_Szopinski_2018, place={Wien, Austria}, series={Lecture Notes in Business Information Processing (LNBIP)}, title={Design Options of Store-Oriented Software Ecosystems: An Investigation of Business Decisions}, volume={319}, DOI={10.1007/978-3-319-94214-8_30}, booktitle={Proceeding of International Symposium on Business Modeling and Software Design}, publisher={Springer}, author={Jazayeri, Bahar and Zimmermann, Olaf and Engels, Gregor and Küster, Jochen and Kundisch, Dennis and Szopinski, Daniel}, year={2018}, pages={390–400}, collection={Lecture Notes in Business Information Processing (LNBIP)} }' chicago: 'Jazayeri, Bahar, Olaf Zimmermann, Gregor Engels, Jochen Küster, Dennis Kundisch, and Daniel Szopinski. “Design Options of Store-Oriented Software Ecosystems: An Investigation of Business Decisions.” In Proceeding of International Symposium on Business Modeling and Software Design, 319:390–400. Lecture Notes in Business Information Processing (LNBIP). Wien, Austria: Springer, 2018. https://doi.org/10.1007/978-3-319-94214-8_30.' ieee: 'B. Jazayeri, O. Zimmermann, G. Engels, J. Küster, D. Kundisch, and D. Szopinski, “Design Options of Store-Oriented Software Ecosystems: An Investigation of Business Decisions,” in Proceeding of International Symposium on Business Modeling and Software Design, 2018, vol. 319, pp. 390–400.' mla: 'Jazayeri, Bahar, et al. “Design Options of Store-Oriented Software Ecosystems: An Investigation of Business Decisions.” Proceeding of International Symposium on Business Modeling and Software Design, vol. 319, Springer, 2018, pp. 390–400, doi:10.1007/978-3-319-94214-8_30.' short: 'B. Jazayeri, O. Zimmermann, G. Engels, J. Küster, D. Kundisch, D. Szopinski, in: Proceeding of International Symposium on Business Modeling and Software Design, Springer, Wien, Austria, 2018, pp. 390–400.' date_created: 2018-07-12T10:59:16Z date_updated: 2022-01-06T06:59:24Z ddc: - '040' department: - _id: '66' - _id: '276' doi: 10.1007/978-3-319-94214-8_30 file: - access_level: closed content_type: application/pdf creator: bahareh date_created: 2018-11-12T19:01:06Z date_updated: 2018-11-12T19:01:06Z file_id: '5533' file_name: Jazayeri_BMSD2018.pdf file_size: 408509 relation: main_file success: 1 file_date_updated: 2018-11-12T19:01:06Z has_accepted_license: '1' intvolume: ' 319' language: - iso: eng page: 390-400 place: Wien, Austria project: - _id: '1' name: SFB 901 - _id: '4' name: SFB 901 - Project Area C - _id: '17' name: SFB 901 - Subproject C5 publication: Proceeding of International Symposium on Business Modeling and Software Design publication_identifier: isbn: - '9783319942131' - '9783319942148' issn: - 1865-1348 - 1865-1356 publication_status: published publisher: Springer series_title: Lecture Notes in Business Information Processing (LNBIP) status: public title: 'Design Options of Store-Oriented Software Ecosystems: An Investigation of Business Decisions' type: conference user_id: '16205' volume: 319 year: '2018' ... --- _id: '3551' author: - first_name: Jürgen full_name: König, Jürgen id: '22358' last_name: König - first_name: Alexander full_name: Mäcker, Alexander id: '13536' last_name: Mäcker - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Sören full_name: Riechers, Sören last_name: Riechers citation: ama: König J, Mäcker A, Meyer auf der Heide F, Riechers S. Scheduling with interjob communication on parallel processors. Journal of Combinatorial Optimization. 2018;36(4):1356-1379. doi:10.1007/s10878-018-0325-3 apa: König, J., Mäcker, A., Meyer auf der Heide, F., & Riechers, S. (2018). Scheduling with interjob communication on parallel processors. Journal of Combinatorial Optimization, 36(4), 1356–1379. https://doi.org/10.1007/s10878-018-0325-3 bibtex: '@article{König_Mäcker_Meyer auf der Heide_Riechers_2018, title={Scheduling with interjob communication on parallel processors}, volume={36}, DOI={10.1007/s10878-018-0325-3}, number={4}, journal={Journal of Combinatorial Optimization}, author={König, Jürgen and Mäcker, Alexander and Meyer auf der Heide, Friedhelm and Riechers, Sören}, year={2018}, pages={1356–1379} }' chicago: 'König, Jürgen, Alexander Mäcker, Friedhelm Meyer auf der Heide, and Sören Riechers. “Scheduling with Interjob Communication on Parallel Processors.” Journal of Combinatorial Optimization 36, no. 4 (2018): 1356–79. https://doi.org/10.1007/s10878-018-0325-3.' ieee: J. König, A. Mäcker, F. Meyer auf der Heide, and S. Riechers, “Scheduling with interjob communication on parallel processors,” Journal of Combinatorial Optimization, vol. 36, no. 4, pp. 1356–1379, 2018. mla: König, Jürgen, et al. “Scheduling with Interjob Communication on Parallel Processors.” Journal of Combinatorial Optimization, vol. 36, no. 4, 2018, pp. 1356–79, doi:10.1007/s10878-018-0325-3. short: J. König, A. Mäcker, F. Meyer auf der Heide, S. Riechers, Journal of Combinatorial Optimization 36 (2018) 1356–1379. date_created: 2018-07-13T09:57:48Z date_updated: 2022-01-06T06:59:24Z ddc: - '000' department: - _id: '63' doi: 10.1007/s10878-018-0325-3 file: - access_level: closed content_type: application/pdf creator: ups date_created: 2018-11-02T15:20:24Z date_updated: 2018-11-02T15:20:24Z file_id: '5299' file_name: SchedulingWithInterjobCommunic.pdf file_size: 745708 relation: main_file success: 1 file_date_updated: 2018-11-02T15:20:24Z has_accepted_license: '1' intvolume: ' 36' issue: '4' language: - iso: eng page: 1356-1379 project: - _id: '16' name: SFB 901 - Subproject C4 - _id: '1' name: SFB 901 - _id: '4' name: SFB 901 - Project Area C publication: Journal of Combinatorial Optimization status: public title: Scheduling with interjob communication on parallel processors type: journal_article user_id: '477' volume: 36 year: '2018' ... --- _id: '3552' author: - first_name: Felix full_name: Mohr, Felix last_name: Mohr - first_name: Marcel Dominik full_name: Wever, Marcel Dominik id: '33176' last_name: Wever orcid: ' https://orcid.org/0000-0001-9782-6818' - first_name: Eyke full_name: Hüllermeier, Eyke id: '48129' last_name: Hüllermeier citation: ama: 'Mohr F, Wever MD, Hüllermeier E. Reduction Stumps for Multi-Class Classification. In: Proceedings of the Symposium on Intelligent Data Analysis. ‘s-Hertogenbosch, the Netherlands. doi:10.1007/978-3-030-01768-2_19' apa: Mohr, F., Wever, M. D., & Hüllermeier, E. (n.d.). Reduction Stumps for Multi-Class Classification. In Proceedings of the Symposium on Intelligent Data Analysis. ‘s-Hertogenbosch, the Netherlands. https://doi.org/10.1007/978-3-030-01768-2_19 bibtex: '@inproceedings{Mohr_Wever_Hüllermeier, place={‘s-Hertogenbosch, the Netherlands}, title={Reduction Stumps for Multi-Class Classification}, DOI={10.1007/978-3-030-01768-2_19}, booktitle={Proceedings of the Symposium on Intelligent Data Analysis}, author={Mohr, Felix and Wever, Marcel Dominik and Hüllermeier, Eyke} }' chicago: Mohr, Felix, Marcel Dominik Wever, and Eyke Hüllermeier. “Reduction Stumps for Multi-Class Classification.” In Proceedings of the Symposium on Intelligent Data Analysis. ‘s-Hertogenbosch, the Netherlands, n.d. https://doi.org/10.1007/978-3-030-01768-2_19. ieee: F. Mohr, M. D. Wever, and E. Hüllermeier, “Reduction Stumps for Multi-Class Classification,” in Proceedings of the Symposium on Intelligent Data Analysis, ‘s-Hertogenbosch, the Netherlands. mla: Mohr, Felix, et al. “Reduction Stumps for Multi-Class Classification.” Proceedings of the Symposium on Intelligent Data Analysis, doi:10.1007/978-3-030-01768-2_19. short: 'F. Mohr, M.D. Wever, E. Hüllermeier, in: Proceedings of the Symposium on Intelligent Data Analysis, ‘s-Hertogenbosch, the Netherlands, n.d.' conference: end_date: 2018-10-26 location: ‘s-Hertogenbosch, the Netherlands name: Symposium on Intelligent Data Analysis start_date: 2018-10-24 date_created: 2018-07-13T15:29:15Z date_updated: 2022-01-06T06:59:25Z ddc: - '000' department: - _id: '355' doi: 10.1007/978-3-030-01768-2_19 file: - access_level: closed content_type: application/pdf creator: wever date_created: 2018-11-06T15:23:02Z date_updated: 2018-11-06T15:23:02Z file_id: '5385' file_name: Mohr2018_Chapter_ReductionStumpsForMulti-classC.pdf file_size: 1348768 relation: main_file success: 1 file_date_updated: 2018-11-06T15:23:02Z has_accepted_license: '1' language: - iso: eng main_file_link: - open_access: '1' url: https://link.springer.com/chapter/10.1007%2F978-3-030-01768-2_19 oa: '1' place: ‘s-Hertogenbosch, the Netherlands project: - _id: '1' name: SFB 901 - _id: '10' name: SFB 901 - Subproject B2 - _id: '3' name: SFB 901 - Project Area B publication: Proceedings of the Symposium on Intelligent Data Analysis publication_status: accepted quality_controlled: '1' status: public title: Reduction Stumps for Multi-Class Classification type: conference user_id: '49109' year: '2018' ... --- _id: '3586' abstract: - lang: eng text: Existing approaches and tools for the generation of approximate circuits often lack generality and are restricted to certain circuit types, approximation techniques, and quality assurance methods. Moreover, only few tools are publicly available. This hinders the development and evaluation of new techniques for approximating circuits and their comparison to previous approaches. In this paper, we first analyze and classify related approaches and then present CIRCA, our flexible framework for search-based approximate circuit generation. CIRCA is developed with a focus on modularity and extensibility. We present the architecture of CIRCA with its clear separation into stages and functional blocks, report on the current prototype, and show initial experiments. author: - first_name: Linus Matthias full_name: Witschen, Linus Matthias id: '49051' last_name: Witschen - first_name: Tobias full_name: Wiersema, Tobias id: '3118' last_name: Wiersema - first_name: Hassan full_name: Ghasemzadeh Mohammadi, Hassan id: '61186' last_name: Ghasemzadeh Mohammadi - first_name: Muhammad full_name: Awais, Muhammad id: '64665' last_name: Awais orcid: https://orcid.org/0000-0003-4148-2969 - first_name: Marco full_name: Platzner, Marco id: '398' last_name: Platzner citation: ama: 'Witschen LM, Wiersema T, Ghasemzadeh Mohammadi H, Awais M, Platzner M. CIRCA: Towards a Modular and Extensible Framework for Approximate Circuit Generation. Third Workshop on Approximate Computing (AxC 2018).' apa: 'Witschen, L. M., Wiersema, T., Ghasemzadeh Mohammadi, H., Awais, M., & Platzner, M. (n.d.). CIRCA: Towards a Modular and Extensible Framework for Approximate Circuit Generation. Third Workshop on Approximate Computing (AxC 2018).' bibtex: '@article{Witschen_Wiersema_Ghasemzadeh Mohammadi_Awais_Platzner, title={CIRCA: Towards a Modular and Extensible Framework for Approximate Circuit Generation}, journal={Third Workshop on Approximate Computing (AxC 2018)}, author={Witschen, Linus Matthias and Wiersema, Tobias and Ghasemzadeh Mohammadi, Hassan and Awais, Muhammad and Platzner, Marco} }' chicago: 'Witschen, Linus Matthias, Tobias Wiersema, Hassan Ghasemzadeh Mohammadi, Muhammad Awais, and Marco Platzner. “CIRCA: Towards a Modular and Extensible Framework for Approximate Circuit Generation.” Third Workshop on Approximate Computing (AxC 2018), n.d.' ieee: 'L. M. Witschen, T. Wiersema, H. Ghasemzadeh Mohammadi, M. Awais, and M. Platzner, “CIRCA: Towards a Modular and Extensible Framework for Approximate Circuit Generation,” Third Workshop on Approximate Computing (AxC 2018). .' mla: 'Witschen, Linus Matthias, et al. “CIRCA: Towards a Modular and Extensible Framework for Approximate Circuit Generation.” Third Workshop on Approximate Computing (AxC 2018).' short: L.M. Witschen, T. Wiersema, H. Ghasemzadeh Mohammadi, M. Awais, M. Platzner, Third Workshop on Approximate Computing (AxC 2018) (n.d.). date_created: 2018-07-20T14:10:46Z date_updated: 2022-01-06T06:59:26Z ddc: - '000' department: - _id: '78' file: - access_level: closed content_type: application/pdf creator: tobias82 date_created: 2018-07-20T14:13:31Z date_updated: 2018-07-20T14:13:31Z file_id: '3587' file_name: WitschenWMAP2018.pdf file_size: 285348 relation: main_file success: 1 file_date_updated: 2018-07-20T14:13:31Z has_accepted_license: '1' keyword: - Approximate Computing - Framework - Pareto Front - Accuracy language: - iso: eng page: '6' project: - _id: '12' name: SFB 901 - Subproject B4 - _id: '1' name: SFB 901 - _id: '3' name: SFB 901 - Project Area B - _id: '52' name: Computing Resources Provided by the Paderborn Center for Parallel Computing publication: Third Workshop on Approximate Computing (AxC 2018) publication_status: accepted status: public title: 'CIRCA: Towards a Modular and Extensible Framework for Approximate Circuit Generation' type: preprint user_id: '49051' year: '2018' ... --- _id: '3588' abstract: - lang: eng text: 'In scientific computing, unstructured meshes are a crucial foundation for the simulation of real-world physical phenomena. Compared to regular grids, they allow resembling the computational domain with a much higher accuracy, which in turn leads to more efficient computations.
There exists a wealth of supporting libraries and frameworks that aid programmers with the implementation of applications working on such grids, each built on top of existing parallelization technologies. However, many approaches require the programmer to introduce a different programming paradigm into their application or provide different variants of the code. SYCL is a new programming standard providing a remedy to this dilemma by building on standard C ++17 with its so-called single-source approach: Programmers write standard C ++ code and expose parallelism using C++17 keywords. The application is
then transformed into a concrete implementation by the SYCL implementation. By encapsulating the OpenCL ecosystem, different SYCL implementations enable not only the programming of CPUs but also of heterogeneous platforms such as GPUs or other devices. For the first time, this paper showcases a SYCL-
based solver for the nodal Discontinuous Galerkin method for Maxwell’s equations on unstructured meshes. We compare our solution to a previous C-based implementation with respect to programmability and performance on heterogeneous platforms.Proceedings of the 29th Annual IEEE International Conference on Application-Specific Systems, Architectures and Processors (ASAP). ; 2018:49-56. doi:10.1109/ASAP.2018.8445127' apa: 'Afzal, A., Schmitt, C., Alhaddad, S., Grynko, Y., Teich, J., Förstner, J., & Hannig, F. (2018). Solving Maxwell’s Equations with Modern C++ and SYCL: A Case Study. In Proceedings of the 29th Annual IEEE International Conference on Application-specific Systems, Architectures and Processors (ASAP) (pp. 49–56). https://doi.org/10.1109/ASAP.2018.8445127' bibtex: '@inproceedings{Afzal_Schmitt_Alhaddad_Grynko_Teich_Förstner_Hannig_2018, title={Solving Maxwell’s Equations with Modern C++ and SYCL: A Case Study}, DOI={10.1109/ASAP.2018.8445127}, booktitle={Proceedings of the 29th Annual IEEE International Conference on Application-specific Systems, Architectures and Processors (ASAP)}, author={Afzal, Ayesha and Schmitt, Christian and Alhaddad, Samer and Grynko, Yevgen and Teich, Jürgen and Förstner, Jens and Hannig, Frank}, year={2018}, pages={49–56} }' chicago: 'Afzal, Ayesha, Christian Schmitt, Samer Alhaddad, Yevgen Grynko, Jürgen Teich, Jens Förstner, and Frank Hannig. “Solving Maxwell’s Equations with Modern C++ and SYCL: A Case Study.” In Proceedings of the 29th Annual IEEE International Conference on Application-Specific Systems, Architectures and Processors (ASAP), 49–56, 2018. https://doi.org/10.1109/ASAP.2018.8445127.' ieee: 'A. Afzal et al., “Solving Maxwell’s Equations with Modern C++ and SYCL: A Case Study,” in Proceedings of the 29th Annual IEEE International Conference on Application-specific Systems, Architectures and Processors (ASAP), 2018, pp. 49–56.' mla: 'Afzal, Ayesha, et al. “Solving Maxwell’s Equations with Modern C++ and SYCL: A Case Study.” Proceedings of the 29th Annual IEEE International Conference on Application-Specific Systems, Architectures and Processors (ASAP), 2018, pp. 49–56, doi:10.1109/ASAP.2018.8445127.' short: 'A. Afzal, C. Schmitt, S. Alhaddad, Y. Grynko, J. Teich, J. Förstner, F. Hannig, in: Proceedings of the 29th Annual IEEE International Conference on Application-Specific Systems, Architectures and Processors (ASAP), 2018, pp. 49–56.' date_created: 2018-07-23T07:12:03Z date_updated: 2022-01-06T06:59:26Z ddc: - '004' department: - _id: '61' doi: 10.1109/ASAP.2018.8445127 file: - access_level: request content_type: application/pdf creator: fossie date_created: 2018-08-21T10:12:05Z date_updated: 2022-01-06T06:59:26Z embargo: 2019-09-03 embargo_to: open_access file_id: '3986' file_name: 2018-08 Afzal - ASAP Proceedings - Solving Maxwell equations with modern C++ and SYCL.pdf file_size: 252186 relation: main_file file_date_updated: 2022-01-06T06:59:26Z has_accepted_license: '1' keyword: - tet_topic_hpc language: - iso: eng page: 49-56 project: - _id: '33' grant_number: 01|H16005 name: HighPerMeshes - _id: '52' name: Computing Resources Provided by the Paderborn Center for Parallel Computing publication: Proceedings of the 29th Annual IEEE International Conference on Application-specific Systems, Architectures and Processors (ASAP) publication_identifier: isbn: - 978-1-5386-7479-6 status: public title: 'Solving Maxwell''s Equations with Modern C++ and SYCL: A Case Study' type: conference user_id: '158' year: '2018' ... --- _id: '3590' author: - first_name: Christoph full_name: Fischer, Christoph id: '31722' last_name: Fischer - first_name: Alexander full_name: Pöhler, Alexander last_name: Pöhler citation: ama: 'Fischer C, Pöhler A. Supporting the Change to Digitalized Production Environments Through Learning Organization Development. In: Harteis C, ed. The Impact of Digitalization in the Workplace. ; 2018:141--160. doi:10.1007/978-3-319-63257-5_10' apa: Fischer, C., & Pöhler, A. (2018). Supporting the Change to Digitalized Production Environments Through Learning Organization Development. In C. Harteis (Ed.), The Impact of Digitalization in the Workplace (pp. 141--160). https://doi.org/10.1007/978-3-319-63257-5_10 bibtex: '@inbook{Fischer_Pöhler_2018, title={Supporting the Change to Digitalized Production Environments Through Learning Organization Development}, DOI={10.1007/978-3-319-63257-5_10}, booktitle={The Impact of Digitalization in the Workplace}, author={Fischer, Christoph and Pöhler, Alexander}, editor={Harteis, ChristianEditor}, year={2018}, pages={141--160} }' chicago: Fischer, Christoph, and Alexander Pöhler. “Supporting the Change to Digitalized Production Environments Through Learning Organization Development.” In The Impact of Digitalization in the Workplace, edited by Christian Harteis, 141--160, 2018. https://doi.org/10.1007/978-3-319-63257-5_10. ieee: C. Fischer and A. Pöhler, “Supporting the Change to Digitalized Production Environments Through Learning Organization Development,” in The Impact of Digitalization in the Workplace, C. Harteis, Ed. 2018, pp. 141--160. mla: Fischer, Christoph, and Alexander Pöhler. “Supporting the Change to Digitalized Production Environments Through Learning Organization Development.” The Impact of Digitalization in the Workplace, edited by Christian Harteis, 2018, pp. 141--160, doi:10.1007/978-3-319-63257-5_10. short: 'C. Fischer, A. Pöhler, in: C. Harteis (Ed.), The Impact of Digitalization in the Workplace, 2018, pp. 141--160.' date_created: 2018-07-23T08:26:44Z date_updated: 2022-01-06T06:59:26Z doi: 10.1007/978-3-319-63257-5_10 editor: - first_name: Christian full_name: Harteis, Christian last_name: Harteis keyword: - i40 page: 141--160 publication: The Impact of Digitalization in the Workplace publication_identifier: isbn: - 978-3-319-63256-8 978-3-319-63257-5 status: public title: Supporting the Change to Digitalized Production Environments Through Learning Organization Development type: book_chapter user_id: '31722' year: '2018' ...