[{"page":"1-8","publisher":"IEEE","_id":"591","user_id":"15278","ddc":["040"],"status":"public","has_accepted_license":"1","file_date_updated":"2018-03-15T08:33:18Z","citation":{"apa":"Kenter, T., Plessl, C., &#38; Schmitz, H. (2012). Pragma based parallelization - Trading hardware efficiency for ease of use? <i>Proceedings of the International Conference on ReConFigurable Computing and FPGAs (ReConFig)</i>, 1–8. <a href=\"https://doi.org/10.1109/ReConFig.2012.6416773\">https://doi.org/10.1109/ReConFig.2012.6416773</a>","ieee":"T. Kenter, C. Plessl, and H. Schmitz, “Pragma based parallelization - Trading hardware efficiency for ease of use?,” in <i>Proceedings of the International Conference on ReConFigurable Computing and FPGAs (ReConFig)</i>, 2012, pp. 1–8, doi: <a href=\"https://doi.org/10.1109/ReConFig.2012.6416773\">10.1109/ReConFig.2012.6416773</a>.","short":"T. Kenter, C. Plessl, H. Schmitz, in: Proceedings of the International Conference on ReConFigurable Computing and FPGAs (ReConFig), IEEE, 2012, pp. 1–8.","chicago":"Kenter, Tobias, Christian Plessl, and Henning Schmitz. “Pragma Based Parallelization - Trading Hardware Efficiency for Ease of Use?” In <i>Proceedings of the International Conference on ReConFigurable Computing and FPGAs (ReConFig)</i>, 1–8. IEEE, 2012. <a href=\"https://doi.org/10.1109/ReConFig.2012.6416773\">https://doi.org/10.1109/ReConFig.2012.6416773</a>.","mla":"Kenter, Tobias, et al. “Pragma Based Parallelization - Trading Hardware Efficiency for Ease of Use?” <i>Proceedings of the International Conference on ReConFigurable Computing and FPGAs (ReConFig)</i>, IEEE, 2012, pp. 1–8, doi:<a href=\"https://doi.org/10.1109/ReConFig.2012.6416773\">10.1109/ReConFig.2012.6416773</a>.","ama":"Kenter T, Plessl C, Schmitz H. Pragma based parallelization - Trading hardware efficiency for ease of use? In: <i>Proceedings of the International Conference on ReConFigurable Computing and FPGAs (ReConFig)</i>. IEEE; 2012:1-8. doi:<a href=\"https://doi.org/10.1109/ReConFig.2012.6416773\">10.1109/ReConFig.2012.6416773</a>","bibtex":"@inproceedings{Kenter_Plessl_Schmitz_2012, title={Pragma based parallelization - Trading hardware efficiency for ease of use?}, DOI={<a href=\"https://doi.org/10.1109/ReConFig.2012.6416773\">10.1109/ReConFig.2012.6416773</a>}, booktitle={Proceedings of the International Conference on ReConFigurable Computing and FPGAs (ReConFig)}, publisher={IEEE}, author={Kenter, Tobias and Plessl, Christian and Schmitz, Henning}, year={2012}, pages={1–8} }"},"quality_controlled":"1","project":[{"_id":"1","grant_number":"160364472","name":"SFB 901"},{"_id":"14","grant_number":"160364472","name":"SFB 901 - Subprojekt C2"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"Engineering Proprioception in Computing Systems","grant_number":"257906","_id":"31"}],"language":[{"iso":"eng"}],"doi":"10.1109/ReConFig.2012.6416773","title":"Pragma based parallelization - Trading hardware efficiency for ease of use?","year":"2012","author":[{"id":"3145","first_name":"Tobias","last_name":"Kenter","full_name":"Kenter, Tobias"},{"first_name":"Christian","orcid":"0000-0001-5728-9982","last_name":"Plessl","full_name":"Plessl, Christian","id":"16153"},{"full_name":"Schmitz, Henning","first_name":"Henning","last_name":"Schmitz"}],"date_updated":"2023-09-26T13:41:08Z","file":[{"success":1,"content_type":"application/pdf","file_id":"1257","access_level":"closed","file_size":371235,"file_name":"591-ReConFig2012Kenter_Schmitz_Plessl.pdf","date_updated":"2018-03-15T08:33:18Z","relation":"main_file","date_created":"2018-03-15T08:33:18Z","creator":"florida"}],"date_created":"2017-10-17T12:42:47Z","type":"conference","department":[{"_id":"27"},{"_id":"518"},{"_id":"78"}],"publication":"Proceedings of the International Conference on ReConFigurable Computing and FPGAs (ReConFig)","abstract":[{"text":"One major obstacle for a wide spread FPGA usage in general-purpose computing is the development tool flow that requires much higher effort than for pure software solutions. Convey Computer promises a solution to this problem for their HC-1 platform, where the FPGAs are configured to run as a vector processor and the software source code can be annotated with pragmas that guide an automated vectorization process. We investigate this approach for a stereo matching algorithm that has abundant parallelism and a number of different computational patterns. We note that for this case study the automated vectorization in its current state doesn’t hold its productivity promise. However, we also show that using the Vector Personality can yield a significant speedups compared to CPU implementations in two of three investigated phases of the algorithm. Those speedups don’t match custom FPGA implementations, but can come with much reduced development effort.","lang":"eng"}]},{"has_accepted_license":"1","status":"public","user_id":"15278","ddc":["040"],"page":"8-9","_id":"609","quality_controlled":"1","project":[{"name":"SFB 901","grant_number":"160364472","_id":"1"},{"name":"SFB 901 - Subprojekt C2","grant_number":"160364472","_id":"14"},{"_id":"4","name":"SFB 901 - Project Area C"},{"grant_number":"257906","_id":"31","name":"Engineering Proprioception in Computing Systems"}],"file_date_updated":"2018-03-15T08:14:17Z","citation":{"apa":"Happe, M., Agne, A., Plessl, C., &#38; Platzner, M. (2012). Hardware/Software Platform for Self-aware Compute Nodes. <i>Proceedings of the Workshop on Self-Awareness in Reconfigurable Computing Systems (SRCS)</i>, 8–9.","mla":"Happe, Markus, et al. “Hardware/Software Platform for Self-Aware Compute Nodes.” <i>Proceedings of the Workshop on Self-Awareness in Reconfigurable Computing Systems (SRCS)</i>, 2012, pp. 8–9.","ieee":"M. Happe, A. Agne, C. Plessl, and M. Platzner, “Hardware/Software Platform for Self-aware Compute Nodes,” in <i>Proceedings of the Workshop on Self-Awareness in Reconfigurable Computing Systems (SRCS)</i>, 2012, pp. 8–9.","chicago":"Happe, Markus, Andreas Agne, Christian Plessl, and Marco Platzner. “Hardware/Software Platform for Self-Aware Compute Nodes.” In <i>Proceedings of the Workshop on Self-Awareness in Reconfigurable Computing Systems (SRCS)</i>, 8–9, 2012.","short":"M. Happe, A. Agne, C. Plessl, M. Platzner, in: Proceedings of the Workshop on Self-Awareness in Reconfigurable Computing Systems (SRCS), 2012, pp. 8–9.","ama":"Happe M, Agne A, Plessl C, Platzner M. Hardware/Software Platform for Self-aware Compute Nodes. In: <i>Proceedings of the Workshop on Self-Awareness in Reconfigurable Computing Systems (SRCS)</i>. ; 2012:8-9.","bibtex":"@inproceedings{Happe_Agne_Plessl_Platzner_2012, title={Hardware/Software Platform for Self-aware Compute Nodes}, booktitle={Proceedings of the Workshop on Self-Awareness in Reconfigurable Computing Systems (SRCS)}, author={Happe, Markus and Agne, Andreas and Plessl, Christian and Platzner, Marco}, year={2012}, pages={8–9} }"},"date_updated":"2023-09-26T13:41:36Z","title":"Hardware/Software Platform for Self-aware Compute Nodes","year":"2012","author":[{"full_name":"Happe, Markus","last_name":"Happe","first_name":"Markus"},{"full_name":"Agne, Andreas","last_name":"Agne","first_name":"Andreas"},{"id":"16153","first_name":"Christian","orcid":"0000-0001-5728-9982","last_name":"Plessl","full_name":"Plessl, Christian"},{"full_name":"Platzner, Marco","first_name":"Marco","last_name":"Platzner","id":"398"}],"language":[{"iso":"eng"}],"abstract":[{"text":"Today's design and operation principles and methods do not scale well with future reconfigurable computing systems due to an increased complexity in system architectures and applications, run-time dynamics and corresponding requirements. Hence, novel design and operation principles and methods are needed that possibly break drastically with the static ones we have built into our systems and the fixed abstraction layers we have cherished over the last decades. Thus, we propose a HW/SW platform that collects and maintains information about its state and progress which enables the system to reason about its behavior (self-awareness) and utilizes its knowledge to effectively and autonomously adapt its behavior to changing requirements (self-expression).To enable self-awareness, our compute nodes collect information using a variety of sensors, i.e. performance counters and thermal diodes, and use internal self-awareness models that process these information. For self-awareness, on-line learning is crucial such that the node learns and continuously updates its models at run-time to react to changing conditions. To enable self-expression, we break with the classic design-time abstraction layers of hardware, operating system and software. In contrast, our system is able to vertically migrate functionalities between the layers at run-time to exploit trade-offs between abstraction and optimization.This paper presents a heterogeneous multi-core architecture, that enables self-awareness and self-expression, an operating system for our proposed hardware/software platform and a novel self-expression method.","lang":"eng"}],"publication":"Proceedings of the Workshop on Self-Awareness in Reconfigurable Computing Systems (SRCS)","type":"conference","department":[{"_id":"27"},{"_id":"518"},{"_id":"78"}],"file":[{"file_name":"609-happe12_fpl_awareness.pdf","access_level":"closed","file_size":146789,"relation":"main_file","date_updated":"2018-03-15T08:14:17Z","file_id":"1249","success":1,"content_type":"application/pdf","creator":"florida","date_created":"2018-03-15T08:14:17Z"}],"date_created":"2017-10-17T12:42:50Z"},{"department":[{"_id":"27"},{"_id":"518"},{"_id":"78"}],"type":"conference","date_created":"2017-10-17T12:42:42Z","file":[{"date_created":"2018-03-15T10:20:24Z","creator":"florida","file_id":"1275","content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-03-15T10:20:24Z","file_name":"567-ba-ca-12a.pdf","file_size":288508,"access_level":"closed"}],"abstract":[{"lang":"eng","text":"Heterogeneous machines are gaining momentum in the High Performance Computing field, due to the theoretical speedups and power consumption. In practice, while some applications meet the performance expectations, heterogeneous architectures still require a tremendous effort from the application developers. This work presents a code generation method to port codes into heterogeneous platforms, based on transformations of the control flow into function calls. The results show that the cost of the function-call mechanism is affordable for the tested HPC kernels. The complete toolchain, based on the LLVM compiler infrastructure, is fully automated once the sequential specification is provided."}],"publication":"Proceedings of the International Conference on High Performance Computing and Simulation (HPCS)","doi":"10.1109/HPCSim.2012.6266973","language":[{"iso":"eng"}],"date_updated":"2023-09-26T13:42:54Z","author":[{"full_name":"Barrio, Pablo","first_name":"Pablo","last_name":"Barrio"},{"last_name":"Carreras","first_name":"Carlos","full_name":"Carreras, Carlos"},{"full_name":"Sierra, Roberto","first_name":"Roberto","last_name":"Sierra"},{"id":"3145","full_name":"Kenter, Tobias","first_name":"Tobias","last_name":"Kenter"},{"orcid":"0000-0001-5728-9982","last_name":"Plessl","first_name":"Christian","full_name":"Plessl, Christian","id":"16153"}],"year":"2012","title":"Turning control flow graphs into function calls: Code generation for heterogeneous architectures","project":[{"grant_number":"160364472","_id":"1","name":"SFB 901"},{"grant_number":"160364472","_id":"14","name":"SFB 901 - Subprojekt C2"},{"name":"SFB 901 - Project Area C","_id":"4"}],"quality_controlled":"1","citation":{"ieee":"P. Barrio, C. Carreras, R. Sierra, T. Kenter, and C. Plessl, “Turning control flow graphs into function calls: Code generation for heterogeneous architectures,” in <i>Proceedings of the International Conference on High Performance Computing and Simulation (HPCS)</i>, 2012, pp. 559–565, doi: <a href=\"https://doi.org/10.1109/HPCSim.2012.6266973\">10.1109/HPCSim.2012.6266973</a>.","apa":"Barrio, P., Carreras, C., Sierra, R., Kenter, T., &#38; Plessl, C. (2012). Turning control flow graphs into function calls: Code generation for heterogeneous architectures. <i>Proceedings of the International Conference on High Performance Computing and Simulation (HPCS)</i>, 559–565. <a href=\"https://doi.org/10.1109/HPCSim.2012.6266973\">https://doi.org/10.1109/HPCSim.2012.6266973</a>","short":"P. Barrio, C. Carreras, R. Sierra, T. Kenter, C. Plessl, in: Proceedings of the International Conference on High Performance Computing and Simulation (HPCS), IEEE, 2012, pp. 559–565.","chicago":"Barrio, Pablo, Carlos Carreras, Roberto Sierra, Tobias Kenter, and Christian Plessl. “Turning Control Flow Graphs into Function Calls: Code Generation for Heterogeneous Architectures.” In <i>Proceedings of the International Conference on High Performance Computing and Simulation (HPCS)</i>, 559–65. IEEE, 2012. <a href=\"https://doi.org/10.1109/HPCSim.2012.6266973\">https://doi.org/10.1109/HPCSim.2012.6266973</a>.","mla":"Barrio, Pablo, et al. “Turning Control Flow Graphs into Function Calls: Code Generation for Heterogeneous Architectures.” <i>Proceedings of the International Conference on High Performance Computing and Simulation (HPCS)</i>, IEEE, 2012, pp. 559–65, doi:<a href=\"https://doi.org/10.1109/HPCSim.2012.6266973\">10.1109/HPCSim.2012.6266973</a>.","bibtex":"@inproceedings{Barrio_Carreras_Sierra_Kenter_Plessl_2012, title={Turning control flow graphs into function calls: Code generation for heterogeneous architectures}, DOI={<a href=\"https://doi.org/10.1109/HPCSim.2012.6266973\">10.1109/HPCSim.2012.6266973</a>}, booktitle={Proceedings of the International Conference on High Performance Computing and Simulation (HPCS)}, publisher={IEEE}, author={Barrio, Pablo and Carreras, Carlos and Sierra, Roberto and Kenter, Tobias and Plessl, Christian}, year={2012}, pages={559–565} }","ama":"Barrio P, Carreras C, Sierra R, Kenter T, Plessl C. Turning control flow graphs into function calls: Code generation for heterogeneous architectures. In: <i>Proceedings of the International Conference on High Performance Computing and Simulation (HPCS)</i>. IEEE; 2012:559-565. doi:<a href=\"https://doi.org/10.1109/HPCSim.2012.6266973\">10.1109/HPCSim.2012.6266973</a>"},"file_date_updated":"2018-03-15T10:20:24Z","user_id":"15278","ddc":["040"],"_id":"567","publisher":"IEEE","page":"559-565","has_accepted_license":"1","status":"public"},{"user_id":"15278","ddc":["040"],"_id":"612","publisher":"IEEE","page":"559-562","has_accepted_license":"1","status":"public","project":[{"_id":"1","grant_number":"160364472","name":"SFB 901"},{"_id":"14","grant_number":"160364472","name":"SFB 901 - Subprojekt C2"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"31","grant_number":"257906","name":"Engineering Proprioception in Computing Systems"}],"quality_controlled":"1","citation":{"mla":"Rüthing, Christoph, et al. “Exploration of Ring Oscillator Design Space for Temperature Measurements on FPGAs.” <i>Proceedings of the International Conference on Field Programmable Logic and Applications (FPL)</i>, IEEE, 2012, pp. 559–62, doi:<a href=\"https://doi.org/10.1109/FPL.2012.6339370\">10.1109/FPL.2012.6339370</a>.","ama":"Rüthing C, Happe M, Agne A, Plessl C. Exploration of Ring Oscillator Design Space for Temperature Measurements on FPGAs. In: <i>Proceedings of the International Conference on Field Programmable Logic and Applications (FPL)</i>. IEEE; 2012:559-562. doi:<a href=\"https://doi.org/10.1109/FPL.2012.6339370\">10.1109/FPL.2012.6339370</a>","bibtex":"@inproceedings{Rüthing_Happe_Agne_Plessl_2012, title={Exploration of Ring Oscillator Design Space for Temperature Measurements on FPGAs}, DOI={<a href=\"https://doi.org/10.1109/FPL.2012.6339370\">10.1109/FPL.2012.6339370</a>}, booktitle={Proceedings of the International Conference on Field Programmable Logic and Applications (FPL)}, publisher={IEEE}, author={Rüthing, Christoph and Happe, Markus and Agne, Andreas and Plessl, Christian}, year={2012}, pages={559–562} }","apa":"Rüthing, C., Happe, M., Agne, A., &#38; Plessl, C. (2012). Exploration of Ring Oscillator Design Space for Temperature Measurements on FPGAs. <i>Proceedings of the International Conference on Field Programmable Logic and Applications (FPL)</i>, 559–562. <a href=\"https://doi.org/10.1109/FPL.2012.6339370\">https://doi.org/10.1109/FPL.2012.6339370</a>","ieee":"C. Rüthing, M. Happe, A. Agne, and C. Plessl, “Exploration of Ring Oscillator Design Space for Temperature Measurements on FPGAs,” in <i>Proceedings of the International Conference on Field Programmable Logic and Applications (FPL)</i>, 2012, pp. 559–562, doi: <a href=\"https://doi.org/10.1109/FPL.2012.6339370\">10.1109/FPL.2012.6339370</a>.","chicago":"Rüthing, Christoph, Markus Happe, Andreas Agne, and Christian Plessl. “Exploration of Ring Oscillator Design Space for Temperature Measurements on FPGAs.” In <i>Proceedings of the International Conference on Field Programmable Logic and Applications (FPL)</i>, 559–62. IEEE, 2012. <a href=\"https://doi.org/10.1109/FPL.2012.6339370\">https://doi.org/10.1109/FPL.2012.6339370</a>.","short":"C. Rüthing, M. Happe, A. Agne, C. Plessl, in: Proceedings of the International Conference on Field Programmable Logic and Applications (FPL), IEEE, 2012, pp. 559–562."},"file_date_updated":"2018-03-15T06:49:03Z","doi":"10.1109/FPL.2012.6339370","language":[{"iso":"eng"}],"date_updated":"2023-09-26T13:42:03Z","author":[{"full_name":"Rüthing, Christoph","last_name":"Rüthing","first_name":"Christoph"},{"last_name":"Happe","first_name":"Markus","full_name":"Happe, Markus"},{"full_name":"Agne, Andreas","first_name":"Andreas","last_name":"Agne"},{"first_name":"Christian","last_name":"Plessl","orcid":"0000-0001-5728-9982","full_name":"Plessl, Christian","id":"16153"}],"title":"Exploration of Ring Oscillator Design Space for Temperature Measurements on FPGAs","year":"2012","department":[{"_id":"27"},{"_id":"518"},{"_id":"78"}],"type":"conference","date_created":"2017-10-17T12:42:51Z","file":[{"date_created":"2018-03-15T06:49:03Z","creator":"florida","content_type":"application/pdf","success":1,"file_id":"1247","file_size":202923,"access_level":"closed","file_name":"612-ruething_fpl12.pdf","date_updated":"2018-03-15T06:49:03Z","relation":"main_file"}],"abstract":[{"lang":"eng","text":"While numerous publications have presented ring oscillator designs for temperature measurements a detailed study of the ring oscillator's design space is still missing. In this work, we introduce metrics for comparing the performance and area efficiency of ring oscillators and a methodology for determining these metrics. As a result, we present a systematic study of the design space for ring oscillators for a Xilinx Virtex-5 platform FPGA."}],"publication":"Proceedings of the International Conference on Field Programmable Logic and Applications (FPL)"},{"publication":"Proc. Workshop on Computer Architecture and Operating System Co-design (CAOS)","citation":{"bibtex":"@inproceedings{Beisel_Wiersema_Plessl_Brinkmann_2012, title={Programming and Scheduling Model for Supporting Heterogeneous Accelerators in Linux}, booktitle={Proc. Workshop on Computer Architecture and Operating System Co-design (CAOS)}, author={Beisel, Tobias and Wiersema, Tobias and Plessl, Christian and Brinkmann, André}, year={2012} }","ama":"Beisel T, Wiersema T, Plessl C, Brinkmann A. Programming and Scheduling Model for Supporting Heterogeneous Accelerators in Linux. In: <i>Proc. Workshop on Computer Architecture and Operating System Co-Design (CAOS)</i>. ; 2012.","mla":"Beisel, Tobias, et al. “Programming and Scheduling Model for Supporting Heterogeneous Accelerators in Linux.” <i>Proc. Workshop on Computer Architecture and Operating System Co-Design (CAOS)</i>, 2012.","chicago":"Beisel, Tobias, Tobias Wiersema, Christian Plessl, and André Brinkmann. “Programming and Scheduling Model for Supporting Heterogeneous Accelerators in Linux.” In <i>Proc. Workshop on Computer Architecture and Operating System Co-Design (CAOS)</i>, 2012.","short":"T. Beisel, T. Wiersema, C. Plessl, A. Brinkmann, in: Proc. Workshop on Computer Architecture and Operating System Co-Design (CAOS), 2012.","ieee":"T. Beisel, T. Wiersema, C. Plessl, and A. Brinkmann, “Programming and Scheduling Model for Supporting Heterogeneous Accelerators in Linux,” 2012.","apa":"Beisel, T., Wiersema, T., Plessl, C., &#38; Brinkmann, A. (2012). Programming and Scheduling Model for Supporting Heterogeneous Accelerators in Linux. <i>Proc. Workshop on Computer Architecture and Operating System Co-Design (CAOS)</i>."},"quality_controlled":"1","project":[{"name":"Enabling Heterogeneous Hardware Acceleration using Novel Programming and Scheduling Models","grant_number":"01|H11004A","_id":"30"}],"date_created":"2018-04-03T09:18:33Z","keyword":["funding-enhance"],"type":"conference","department":[{"_id":"27"},{"_id":"518"},{"_id":"78"}],"title":"Programming and Scheduling Model for Supporting Heterogeneous Accelerators in Linux","status":"public","year":"2012","author":[{"full_name":"Beisel, Tobias","last_name":"Beisel","first_name":"Tobias"},{"full_name":"Wiersema, Tobias","last_name":"Wiersema","first_name":"Tobias","id":"3118"},{"id":"16153","full_name":"Plessl, Christian","orcid":"0000-0001-5728-9982","first_name":"Christian","last_name":"Plessl"},{"full_name":"Brinkmann, André","first_name":"André","last_name":"Brinkmann"}],"date_updated":"2023-09-26T13:40:17Z","language":[{"iso":"eng"}],"_id":"2180","user_id":"15278"},{"publication":"Int. Journal of Reconfigurable Computing (IJRC)","citation":{"bibtex":"@article{Grad_Plessl_2012, title={On the Feasibility and Limitations of Just-In-Time Instruction Set Extension for FPGA-based Reconfigurable Processors}, DOI={<a href=\"https://doi.org/10.1155/2012/418315\">10.1155/2012/418315</a>}, journal={Int. Journal of Reconfigurable Computing (IJRC)}, publisher={Hindawi Publishing Corp.}, author={Grad, Mariusz and Plessl, Christian}, year={2012} }","chicago":"Grad, Mariusz, and Christian Plessl. “On the Feasibility and Limitations of Just-In-Time Instruction Set Extension for FPGA-Based Reconfigurable Processors.” <i>Int. Journal of Reconfigurable Computing (IJRC)</i>, 2012. <a href=\"https://doi.org/10.1155/2012/418315\">https://doi.org/10.1155/2012/418315</a>.","ama":"Grad M, Plessl C. On the Feasibility and Limitations of Just-In-Time Instruction Set Extension for FPGA-based Reconfigurable Processors. <i>Int Journal of Reconfigurable Computing (IJRC)</i>. Published online 2012. doi:<a href=\"https://doi.org/10.1155/2012/418315\">10.1155/2012/418315</a>","short":"M. Grad, C. Plessl, Int. Journal of Reconfigurable Computing (IJRC) (2012).","ieee":"M. Grad and C. Plessl, “On the Feasibility and Limitations of Just-In-Time Instruction Set Extension for FPGA-based Reconfigurable Processors,” <i>Int. Journal of Reconfigurable Computing (IJRC)</i>, 2012, doi: <a href=\"https://doi.org/10.1155/2012/418315\">10.1155/2012/418315</a>.","apa":"Grad, M., &#38; Plessl, C. (2012). On the Feasibility and Limitations of Just-In-Time Instruction Set Extension for FPGA-based Reconfigurable Processors. <i>Int. Journal of Reconfigurable Computing (IJRC)</i>. <a href=\"https://doi.org/10.1155/2012/418315\">https://doi.org/10.1155/2012/418315</a>","mla":"Grad, Mariusz, and Christian Plessl. “On the Feasibility and Limitations of Just-In-Time Instruction Set Extension for FPGA-Based Reconfigurable Processors.” <i>Int. Journal of Reconfigurable Computing (IJRC)</i>, Hindawi Publishing Corp., 2012, doi:<a href=\"https://doi.org/10.1155/2012/418315\">10.1155/2012/418315</a>."},"quality_controlled":"1","date_created":"2018-04-03T09:13:22Z","type":"journal_article","department":[{"_id":"27"},{"_id":"518"},{"_id":"78"}],"year":"2012","title":"On the Feasibility and Limitations of Just-In-Time Instruction Set Extension for FPGA-based Reconfigurable Processors","status":"public","author":[{"first_name":"Mariusz","last_name":"Grad","full_name":"Grad, Mariusz"},{"orcid":"0000-0001-5728-9982","last_name":"Plessl","first_name":"Christian","full_name":"Plessl, Christian","id":"16153"}],"date_updated":"2023-09-26T13:39:48Z","_id":"2177","language":[{"iso":"eng"}],"publisher":"Hindawi Publishing Corp.","doi":"10.1155/2012/418315","user_id":"15278"},{"citation":{"ama":"Keil R, Metternich H-J, Ritzenhoff S. Passability in education - a challenge for the future. In: Keil R, Metternich H-J, Ritzenhoff S, eds. ; 2012:15-17.","bibtex":"@inproceedings{Keil_Metternich_Ritzenhoff_2012, title={Passability in education - a challenge for the future}, author={Keil, Reinhard  and Metternich, Hans-Jürgen and Ritzenhoff, Steffan}, editor={Keil, Reinhard  and Metternich, Hans-Jürgen and Ritzenhoff, Steffan}, year={2012}, pages={15–17} }","mla":"Keil, Reinhard, et al. <i>Passability in Education - a Challenge for the Future</i>. Edited by Reinhard  Keil et al., 2012, pp. 15–17.","chicago":"Keil, Reinhard , Hans-Jürgen Metternich, and Steffan Ritzenhoff. “Passability in Education - a Challenge for the Future.” edited by Reinhard  Keil, Hans-Jürgen Metternich, and Steffan Ritzenhoff, 15–17, 2012.","short":"R. Keil, H.-J. Metternich, S. Ritzenhoff, in: R. Keil, H.-J. Metternich, S. Ritzenhoff (Eds.), 2012, pp. 15–17.","apa":"Keil, R., Metternich, H.-J., &#38; Ritzenhoff, S. (2012). <i>Passability in education - a challenge for the future</i> (R. Keil, H.-J. Metternich, &#38; S. Ritzenhoff, Eds.; pp. 15–17).","ieee":"R. Keil, H.-J. Metternich, and S. Ritzenhoff, “Passability in education - a challenge for the future,” 2012, pp. 15–17."},"date_created":"2021-11-08T06:35:24Z","department":[{"_id":"71"}],"type":"conference","author":[{"first_name":"Reinhard ","last_name":"Keil","full_name":"Keil, Reinhard "},{"first_name":"Hans-Jürgen","last_name":"Metternich","full_name":"Metternich, Hans-Jürgen"},{"last_name":"Ritzenhoff","first_name":"Steffan","full_name":"Ritzenhoff, Steffan"}],"year":"2012","status":"public","title":"Passability in education - a challenge for the future","publication_status":"published","date_updated":"2026-02-24T14:52:49Z","language":[{"iso":"eng"}],"_id":"27191","page":"15-17","editor":[{"last_name":"Keil","first_name":"Reinhard ","full_name":"Keil, Reinhard "},{"full_name":"Metternich, Hans-Jürgen","first_name":"Hans-Jürgen","last_name":"Metternich"},{"full_name":"Ritzenhoff, Steffan","last_name":"Ritzenhoff","first_name":"Steffan"}],"user_id":"14972"},{"citation":{"ieee":"R. Keil, H.-J. Metternich, and  Steffan Ritzenhoff, “Summary and Outlook,” 2012, pp. 112–115.","mla":"Keil, Reinhard, et al. <i>Summary and Outlook</i>. Edited by Reinhard Keil et al., 2012, pp. 112–15.","apa":"Keil, R., Metternich, H.-J., &#38; Ritzenhoff,  Steffan. (2012). <i>Summary and Outlook</i> (R. Keil, H.-J. Metternich, &#38; S. Ritzenhoff, Eds.; pp. 112–115).","bibtex":"@inproceedings{Keil_Metternich_Ritzenhoff_2012, title={Summary and Outlook}, author={Keil, Reinhard  and Metternich, Hans-Jürgen and Ritzenhoff,  Steffan}, editor={Keil, Reinhard and Metternich, Hans-Jürgen and Ritzenhoff, Steffan}, year={2012}, pages={112–115} }","chicago":"Keil, Reinhard , Hans-Jürgen Metternich, and  Steffan Ritzenhoff. “Summary and Outlook.” edited by Reinhard Keil, Hans-Jürgen Metternich, and Steffan Ritzenhoff, 112–15, 2012.","ama":"Keil R, Metternich H-J, Ritzenhoff  Steffan. Summary and Outlook. In: Keil R, Metternich H-J, Ritzenhoff S, eds. ; 2012:112-115.","short":"R. Keil, H.-J. Metternich,  Steffan Ritzenhoff, in: R. Keil, H.-J. Metternich, S. Ritzenhoff (Eds.), 2012, pp. 112–115."},"department":[{"_id":"71"}],"type":"conference","date_created":"2021-11-08T06:20:43Z","publication_status":"published","date_updated":"2026-02-24T14:51:42Z","author":[{"last_name":"Keil","first_name":"Reinhard ","full_name":"Keil, Reinhard "},{"full_name":"Metternich, Hans-Jürgen","first_name":"Hans-Jürgen","last_name":"Metternich"},{"first_name":" Steffan","last_name":"Ritzenhoff","full_name":"Ritzenhoff,  Steffan"}],"year":"2012","title":"Summary and Outlook","status":"public","editor":[{"last_name":"Keil","first_name":"Reinhard","full_name":"Keil, Reinhard"},{"last_name":"Metternich","first_name":"Hans-Jürgen","full_name":"Metternich, Hans-Jürgen"},{"full_name":"Ritzenhoff, Steffan","first_name":"Steffan","last_name":"Ritzenhoff"}],"user_id":"14972","language":[{"iso":"eng"}],"_id":"27188","page":"112-115"},{"status":"public","page":"1-11","publisher":"Association for Computing Machinery (ACM)","_id":"60456","user_id":"117512","volume":31,"citation":{"mla":"Campen, Marcel, et al. “Dual Loops Meshing.” <i>ACM Transactions on Graphics</i>, vol. 31, no. 4, Association for Computing Machinery (ACM), 2012, pp. 1–11, doi:<a href=\"https://doi.org/10.1145/2185520.2185606\">10.1145/2185520.2185606</a>.","apa":"Campen, M., Bommes, D., &#38; Kobbelt, L. (2012). Dual loops meshing. <i>ACM Transactions on Graphics</i>, <i>31</i>(4), 1–11. <a href=\"https://doi.org/10.1145/2185520.2185606\">https://doi.org/10.1145/2185520.2185606</a>","ieee":"M. Campen, D. Bommes, and L. Kobbelt, “Dual loops meshing,” <i>ACM Transactions on Graphics</i>, vol. 31, no. 4, pp. 1–11, 2012, doi: <a href=\"https://doi.org/10.1145/2185520.2185606\">10.1145/2185520.2185606</a>.","chicago":"Campen, Marcel, David Bommes, and Leif Kobbelt. “Dual Loops Meshing.” <i>ACM Transactions on Graphics</i> 31, no. 4 (2012): 1–11. <a href=\"https://doi.org/10.1145/2185520.2185606\">https://doi.org/10.1145/2185520.2185606</a>.","ama":"Campen M, Bommes D, Kobbelt L. Dual loops meshing. <i>ACM Transactions on Graphics</i>. 2012;31(4):1-11. doi:<a href=\"https://doi.org/10.1145/2185520.2185606\">10.1145/2185520.2185606</a>","short":"M. Campen, D. Bommes, L. Kobbelt, ACM Transactions on Graphics 31 (2012) 1–11.","bibtex":"@article{Campen_Bommes_Kobbelt_2012, title={Dual loops meshing}, volume={31}, DOI={<a href=\"https://doi.org/10.1145/2185520.2185606\">10.1145/2185520.2185606</a>}, number={4}, journal={ACM Transactions on Graphics}, publisher={Association for Computing Machinery (ACM)}, author={Campen, Marcel and Bommes, David and Kobbelt, Leif}, year={2012}, pages={1–11} }"},"title":"Dual loops meshing","year":"2012","publication_identifier":{"issn":["0730-0301","1557-7368"]},"author":[{"orcid":"0000-0003-2340-3462","first_name":"Marcel","last_name":"Campen","full_name":"Campen, Marcel","id":"114904"},{"last_name":"Bommes","first_name":"David","full_name":"Bommes, David"},{"last_name":"Kobbelt","first_name":"Leif","full_name":"Kobbelt, Leif"}],"date_updated":"2025-07-14T12:39:21Z","publication_status":"published","intvolume":"        31","language":[{"iso":"eng"}],"doi":"10.1145/2185520.2185606","alternative_title":["quality quad layouts on manifolds"],"publication":"ACM Transactions on Graphics","issue":"4","abstract":[{"text":"<jats:p>We present a theoretical framework and practical method for the automatic construction of simple, all-quadrilateral patch layouts on manifold surfaces. The resulting layouts are coarse, surface-embedded cell complexes well adapted to the geometric structure, hence they are ideally suited as domains and base complexes for surface parameterization, spline fitting, or subdivision surfaces and can be used to generate quad meshes with a high-level patch structure that are advantageous in many application scenarios. Our approach is based on the careful construction of the layout graph's combinatorial dual. In contrast to the primal this dual perspective provides direct control over the globally interdependent structural constraints inherent to quad layouts. The dual layout is built from curvature-guided, crossing loops on the surface. A novel method to construct these efficiently in a geometry- and structure-aware manner constitutes the core of our approach.</jats:p>","lang":"eng"}],"extern":"1","date_created":"2025-06-30T07:32:26Z","type":"journal_article","department":[{"_id":"969"}]},{"doi":"10.1007/978-3-7091-1251-9_26","user_id":"117512","editor":[{"last_name":"Hesselgren","first_name":"Lars","full_name":"Hesselgren, Lars"},{"first_name":"Shrikant","last_name":"Sharma","full_name":"Sharma, Shrikant"},{"full_name":"Wallner, Johannes","first_name":"Johannes","last_name":"Wallner"},{"full_name":"Baldassini, Niccolo","first_name":"Niccolo","last_name":"Baldassini"},{"last_name":"Bompas","first_name":"Philippe","full_name":"Bompas, Philippe"},{"first_name":"Jacques","last_name":"Raynaud","full_name":"Raynaud, Jacques"}],"page":"319–332","language":[{"iso":"eng"}],"_id":"60457","publisher":"Springer","date_updated":"2025-07-14T12:38:54Z","year":"2012","title":"Variational Tangent Plane Intersection for Planar Polygonal Meshing","status":"public","author":[{"full_name":"Zimmer, Henrik","first_name":"Henrik","last_name":"Zimmer"},{"id":"114904","full_name":"Campen, Marcel","orcid":"0000-0003-2340-3462","first_name":"Marcel","last_name":"Campen"},{"first_name":"Ralf","last_name":"Herkrath","full_name":"Herkrath, Ralf"},{"first_name":"Leif","last_name":"Kobbelt","full_name":"Kobbelt, Leif"}],"type":"conference","department":[{"_id":"969"}],"date_created":"2025-06-30T07:39:33Z","extern":"1","publication":"Advances in Architectural Geometry, AAG 2012, Paris, France, September 27-28, 2012","citation":{"bibtex":"@inproceedings{Zimmer_Campen_Herkrath_Kobbelt_2012, title={Variational Tangent Plane Intersection for Planar Polygonal Meshing}, DOI={<a href=\"https://doi.org/10.1007/978-3-7091-1251-9_26\">10.1007/978-3-7091-1251-9_26</a>}, booktitle={Advances in Architectural Geometry, AAG 2012, Paris, France, September 27-28, 2012}, publisher={Springer}, author={Zimmer, Henrik and Campen, Marcel and Herkrath, Ralf and Kobbelt, Leif}, editor={Hesselgren, Lars and Sharma, Shrikant and Wallner, Johannes and Baldassini, Niccolo and Bompas, Philippe and Raynaud, Jacques}, year={2012}, pages={319–332} }","ama":"Zimmer H, Campen M, Herkrath R, Kobbelt L. Variational Tangent Plane Intersection for Planar Polygonal Meshing. In: Hesselgren L, Sharma S, Wallner J, Baldassini N, Bompas P, Raynaud J, eds. <i>Advances in Architectural Geometry, AAG 2012, Paris, France, September 27-28, 2012</i>. Springer; 2012:319–332. doi:<a href=\"https://doi.org/10.1007/978-3-7091-1251-9_26\">10.1007/978-3-7091-1251-9_26</a>","mla":"Zimmer, Henrik, et al. “Variational Tangent Plane Intersection for Planar Polygonal Meshing.” <i>Advances in Architectural Geometry, AAG 2012, Paris, France, September 27-28, 2012</i>, edited by Lars Hesselgren et al., Springer, 2012, pp. 319–332, doi:<a href=\"https://doi.org/10.1007/978-3-7091-1251-9_26\">10.1007/978-3-7091-1251-9_26</a>.","short":"H. Zimmer, M. Campen, R. Herkrath, L. Kobbelt, in: L. Hesselgren, S. Sharma, J. Wallner, N. Baldassini, P. Bompas, J. Raynaud (Eds.), Advances in Architectural Geometry, AAG 2012, Paris, France, September 27-28, 2012, Springer, 2012, pp. 319–332.","chicago":"Zimmer, Henrik, Marcel Campen, Ralf Herkrath, and Leif Kobbelt. “Variational Tangent Plane Intersection for Planar Polygonal Meshing.” In <i>Advances in Architectural Geometry, AAG 2012, Paris, France, September 27-28, 2012</i>, edited by Lars Hesselgren, Shrikant Sharma, Johannes Wallner, Niccolo Baldassini, Philippe Bompas, and Jacques Raynaud, 319–332. Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-7091-1251-9_26\">https://doi.org/10.1007/978-3-7091-1251-9_26</a>.","ieee":"H. Zimmer, M. Campen, R. Herkrath, and L. Kobbelt, “Variational Tangent Plane Intersection for Planar Polygonal Meshing,” in <i>Advances in Architectural Geometry, AAG 2012, Paris, France, September 27-28, 2012</i>, 2012, pp. 319–332, doi: <a href=\"https://doi.org/10.1007/978-3-7091-1251-9_26\">10.1007/978-3-7091-1251-9_26</a>.","apa":"Zimmer, H., Campen, M., Herkrath, R., &#38; Kobbelt, L. (2012). Variational Tangent Plane Intersection for Planar Polygonal Meshing. In L. Hesselgren, S. Sharma, J. Wallner, N. Baldassini, P. Bompas, &#38; J. Raynaud (Eds.), <i>Advances in Architectural Geometry, AAG 2012, Paris, France, September 27-28, 2012</i> (pp. 319–332). Springer. <a href=\"https://doi.org/10.1007/978-3-7091-1251-9_26\">https://doi.org/10.1007/978-3-7091-1251-9_26</a>"}},{"doi":"10.1111/j.1467-8659.2012.03040.x","language":[{"iso":"eng"}],"date_updated":"2025-07-14T12:39:35Z","publication_status":"published","intvolume":"        31","year":"2012","title":"Rationalization of Triangle‐Based Point‐Folding Structures","author":[{"first_name":"Henrik","last_name":"Zimmer","full_name":"Zimmer, Henrik"},{"full_name":"Campen, Marcel","last_name":"Campen","first_name":"Marcel","orcid":"0000-0003-2340-3462","id":"114904"},{"full_name":"Bommes, David","first_name":"David","last_name":"Bommes"},{"first_name":"Leif","last_name":"Kobbelt","full_name":"Kobbelt, Leif"}],"publication_identifier":{"issn":["0167-7055","1467-8659"]},"type":"journal_article","department":[{"_id":"969"}],"date_created":"2025-06-30T07:19:54Z","abstract":[{"lang":"eng","text":"<jats:title>Abstract</jats:title><jats:p>In mechanical engineering and architecture, structural elements with low material consumption and high load‐bearing capabilities are essential for light‐weight and even self‐supporting constructions. This paper deals with so called point‐folding elements – non‐planar, pyramidal panels, usually formed from thin metal sheets, which exploit the increased structural capabilities emerging from folds or creases. Given a triangulated free‐form surface, a corresponding point‐folding structure is a collection of pyramidal elements basing on the triangles. User‐specified or material‐induced geometric constraints often imply that each individual folding element has a different shape, leading to immense fabrication costs. We present a rationalization method for such structures which respects the prescribed aesthetic and production constraints and finds a minimal set of molds for the production process, leading to drastically reduced costs. For each base triangle we compute and parametrize the range of feasible folding elements that satisfy the given constraints within the allowed tolerances. Then we pose the rationalization task as a geometric intersection problem, which we solve so as to maximize the re‐use of mold dies. Major challenges arise from the high precision requirements and the non‐trivial parametrization of the search space. We evaluate our method on a number of practical examples where we achieve rationalization gains of more than 90%.</jats:p>"}],"extern":"1","publication":"Computer Graphics Forum","issue":"2pt3","user_id":"117512","volume":31,"page":"611-620","_id":"60455","publisher":"Wiley","status":"public","citation":{"ama":"Zimmer H, Campen M, Bommes D, Kobbelt L. Rationalization of Triangle‐Based Point‐Folding Structures. <i>Computer Graphics Forum</i>. 2012;31(2pt3):611-620. doi:<a href=\"https://doi.org/10.1111/j.1467-8659.2012.03040.x\">10.1111/j.1467-8659.2012.03040.x</a>","bibtex":"@article{Zimmer_Campen_Bommes_Kobbelt_2012, title={Rationalization of Triangle‐Based Point‐Folding Structures}, volume={31}, DOI={<a href=\"https://doi.org/10.1111/j.1467-8659.2012.03040.x\">10.1111/j.1467-8659.2012.03040.x</a>}, number={2pt3}, journal={Computer Graphics Forum}, publisher={Wiley}, author={Zimmer, Henrik and Campen, Marcel and Bommes, David and Kobbelt, Leif}, year={2012}, pages={611–620} }","mla":"Zimmer, Henrik, et al. “Rationalization of Triangle‐Based Point‐Folding Structures.” <i>Computer Graphics Forum</i>, vol. 31, no. 2pt3, Wiley, 2012, pp. 611–20, doi:<a href=\"https://doi.org/10.1111/j.1467-8659.2012.03040.x\">10.1111/j.1467-8659.2012.03040.x</a>.","short":"H. Zimmer, M. Campen, D. Bommes, L. Kobbelt, Computer Graphics Forum 31 (2012) 611–620.","chicago":"Zimmer, Henrik, Marcel Campen, David Bommes, and Leif Kobbelt. “Rationalization of Triangle‐Based Point‐Folding Structures.” <i>Computer Graphics Forum</i> 31, no. 2pt3 (2012): 611–20. <a href=\"https://doi.org/10.1111/j.1467-8659.2012.03040.x\">https://doi.org/10.1111/j.1467-8659.2012.03040.x</a>.","apa":"Zimmer, H., Campen, M., Bommes, D., &#38; Kobbelt, L. (2012). Rationalization of Triangle‐Based Point‐Folding Structures. <i>Computer Graphics Forum</i>, <i>31</i>(2pt3), 611–620. <a href=\"https://doi.org/10.1111/j.1467-8659.2012.03040.x\">https://doi.org/10.1111/j.1467-8659.2012.03040.x</a>","ieee":"H. Zimmer, M. Campen, D. Bommes, and L. Kobbelt, “Rationalization of Triangle‐Based Point‐Folding Structures,” <i>Computer Graphics Forum</i>, vol. 31, no. 2pt3, pp. 611–620, 2012, doi: <a href=\"https://doi.org/10.1111/j.1467-8659.2012.03040.x\">10.1111/j.1467-8659.2012.03040.x</a>."}},{"publication":"Experimental brain research","citation":{"apa":"Grimme, B., Lipinski, J., &#38; Schöner, G. (2012). Naturalistic arm movements during obstacle avoidance in 3D and the identification of movement primitives. <i>Experimental Brain Research</i>, <i>222</i>, 185–200.","ieee":"B. Grimme, J. Lipinski, and G. Schöner, “Naturalistic arm movements during obstacle avoidance in 3D and the identification of movement primitives,” <i>Experimental brain research</i>, vol. 222, pp. 185–200, 2012.","short":"B. Grimme, J. Lipinski, G. Schöner, Experimental Brain Research 222 (2012) 185–200.","chicago":"Grimme, Britta, John Lipinski, and Gregor Schöner. “Naturalistic Arm Movements during Obstacle Avoidance in 3D and the Identification of Movement Primitives.” <i>Experimental Brain Research</i> 222 (2012): 185–200.","mla":"Grimme, Britta, et al. “Naturalistic Arm Movements during Obstacle Avoidance in 3D and the Identification of Movement Primitives.” <i>Experimental Brain Research</i>, vol. 222, Springer, 2012, pp. 185–200.","ama":"Grimme B, Lipinski J, Schöner G. Naturalistic arm movements during obstacle avoidance in 3D and the identification of movement primitives. <i>Experimental brain research</i>. 2012;222:185–200.","bibtex":"@article{Grimme_Lipinski_Schöner_2012, title={Naturalistic arm movements during obstacle avoidance in 3D and the identification of movement primitives}, volume={222}, journal={Experimental brain research}, publisher={Springer}, author={Grimme, Britta and Lipinski, John and Schöner, Gregor}, year={2012}, pages={185–200} }"},"type":"journal_article","department":[{"_id":"819"}],"date_created":"2024-03-25T14:58:49Z","date_updated":"2026-03-19T07:49:12Z","intvolume":"       222","year":"2012","title":"Naturalistic arm movements during obstacle avoidance in 3D and the identification of movement primitives","status":"public","author":[{"full_name":"Grimme, Britta","first_name":"Britta","last_name":"Grimme"},{"full_name":"Lipinski, John","last_name":"Lipinski","first_name":"John"},{"full_name":"Schöner, Gregor","first_name":"Gregor","last_name":"Schöner"}],"user_id":"103682","volume":222,"page":"185–200","publisher":"Springer","_id":"52868"},{"date_created":"2020-09-22T09:22:32Z","type":"dissertation","department":[{"_id":"63"},{"_id":"26"}],"supervisor":[{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide"}],"citation":{"mla":"Korzeniowski, Miroslaw. <i>Dynamic Load Balancing in Peer-to-Peer Networks</i>. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2011.","ama":"Korzeniowski M. <i>Dynamic Load Balancing in Peer-to-Peer Networks</i>. Vol 289. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2011.","bibtex":"@book{Korzeniowski_2011, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Dynamic Load Balancing in Peer-to-Peer Networks}, volume={289}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Korzeniowski, Miroslaw}, year={2011}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","apa":"Korzeniowski, M. (2011). <i>Dynamic Load Balancing in Peer-to-Peer Networks</i> (Vol. 289). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","ieee":"M. Korzeniowski, <i>Dynamic Load Balancing in Peer-to-Peer Networks</i>, vol. 289. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2011.","short":"M. Korzeniowski, Dynamic Load Balancing in Peer-to-Peer Networks, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2011.","chicago":"Korzeniowski, Miroslaw. <i>Dynamic Load Balancing in Peer-to-Peer Networks</i>. Vol. 289. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2011."},"related_material":{"link":[{"relation":"confirmation","url":"http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-2007030135"}]},"_id":"19619","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","language":[{"iso":"eng"}],"user_id":"5786","volume":289,"year":"2011","status":"public","title":"Dynamic Load Balancing in Peer-to-Peer Networks","publication_identifier":{"isbn":["978-3-942647-08-3"]},"author":[{"full_name":"Korzeniowski, Miroslaw","last_name":"Korzeniowski","first_name":"Miroslaw"}],"date_updated":"2022-01-06T06:54:08Z","intvolume":"       289"},{"department":[{"_id":"63"}],"type":"journal_article","date_created":"2020-09-24T13:54:02Z","citation":{"bibtex":"@article{Briest_Krysta_Hoefer_2011, title={Stackelberg Network Pricing Games}, volume={62}, DOI={<a href=\"https://doi.org/10.1007/s00453-010-9480-3\">10.1007/s00453-010-9480-3</a>}, journal={Algorithmica}, author={Briest, Patrick and Krysta, Piotr and Hoefer, Martin}, year={2011}, pages={733–753} }","ama":"Briest P, Krysta P, Hoefer M. Stackelberg Network Pricing Games. <i>Algorithmica</i>. 2011;62:733–753. doi:<a href=\"https://doi.org/10.1007/s00453-010-9480-3\">10.1007/s00453-010-9480-3</a>","mla":"Briest, Patrick, et al. “Stackelberg Network Pricing Games.” <i>Algorithmica</i>, vol. 62, 2011, pp. 733–753, doi:<a href=\"https://doi.org/10.1007/s00453-010-9480-3\">10.1007/s00453-010-9480-3</a>.","chicago":"Briest, Patrick, Piotr Krysta, and Martin Hoefer. “Stackelberg Network Pricing Games.” <i>Algorithmica</i> 62 (2011): 733–753. <a href=\"https://doi.org/10.1007/s00453-010-9480-3\">https://doi.org/10.1007/s00453-010-9480-3</a>.","short":"P. Briest, P. Krysta, M. Hoefer, Algorithmica 62 (2011) 733–753.","ieee":"P. Briest, P. Krysta, and M. Hoefer, “Stackelberg Network Pricing Games,” <i>Algorithmica</i>, vol. 62, pp. 733–753, 2011.","apa":"Briest, P., Krysta, P., &#38; Hoefer, M. (2011). Stackelberg Network Pricing Games. <i>Algorithmica</i>, <i>62</i>, 733–753. <a href=\"https://doi.org/10.1007/s00453-010-9480-3\">https://doi.org/10.1007/s00453-010-9480-3</a>"},"publication":"Algorithmica","volume":62,"user_id":"15415","doi":"10.1007/s00453-010-9480-3","_id":"19677","language":[{"iso":"eng"}],"page":"733–753","intvolume":"        62","date_updated":"2022-01-06T06:54:09Z","author":[{"full_name":"Briest, Patrick","last_name":"Briest","first_name":"Patrick"},{"last_name":"Krysta","first_name":"Piotr","full_name":"Krysta, Piotr"},{"full_name":"Hoefer, Martin","first_name":"Martin","last_name":"Hoefer"}],"year":"2011","title":"Stackelberg Network Pricing Games","status":"public"},{"abstract":[{"lang":"eng","text":"In dieser Arbeit stellen wir ein flexibles System zur Entwicklung und Evaluation von 3-D-Renderingalgorithmen vor, das die Visualisierung komplexer virtueller Szenen auf einem breiten Spektrum an Geräten erlaubt. Die Aufbereitung und Echtzeitdarstellung solcher virtueller Szenen, wie sie beispielsweise aus detaillierten CAD-Daten erzeugt werden, stellt in vielerlei Hinsicht eine algorithmische und technische Herausforderung dar. Die 3-D-Szenendaten können nach dem Dateiimport aus einem Austauschformat in eine Vielzahl unterschiedlicher Datenstrukturen überführt werden. Es muss ein geeignetes Renderingverfahren ausgewählt und eingestellt werden, welches sowohl die Eigenschaften der Szene (Zahl der Polygone, Grad der Verdeckung etc.) als auch die Fähigkeiten der Hardware berücksichtigt. Auf der einen Seite stellt die Darstellung auf mobilen Endgeräten wie Smartphones besonders hohe Anforderungen aufgrund der Speicherbeschränkung und der geringen Leistungsfähigkeit der Grafikhardware. Auf der anderen Seite stehen bei Großprojektionssystemen, wie beispielsweise dem HD-Visualisierungscenter des Heinz Nixdorf Instituts, die hohe Bildqualität bei stereoskopischer Darstellung und die Unterstützung von Trackingsystemen im Vordergrund.\r\n\r\nDer Fokus des von uns entwickelten Systems PADrend liegt in der Bereitstellung einer flexiblen und leicht erweiterbaren Grundlage für die Entwicklung und Evaluation von 3-D-Renderingalgorithmen und räumlichen Datenstrukturen im Bereich der Forschung und der universitären Ausbildung. Durch den modularen Aufbau und die große Bandbreite an unterstützten Systemen wird gewährleistet, dass eine Vielzahl unterschiedlicher Entwicklungen und Anwendungen auf PADrend aufsetzen können. In diesem Artikel geben wir einen Überblick über den Aufbau und die Fähigkeiten des Systems. Des Weiteren geben wir ein Beispiel für ein Anwendungsszenario, in dem PADrend eingesetzt wird: die Visualisierung von architektonischen Modellen auf einem Multiprojektionssystem."}],"citation":{"mla":"Jähn, Claudius, et al. “PADrend: Platform for Algorithm Development and Rendering.” <i>Augmented &#38; Virtual Reality in Der Produktentstehung</i>, vol. 295, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2011, pp. 159--170.","ama":"Jähn C, Petring R, Eikel B. PADrend: Platform for Algorithm Development and Rendering. In: <i>Augmented &#38; Virtual Reality in Der Produktentstehung</i>. Vol 295. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2011:159--170.","bibtex":"@inproceedings{Jähn_Petring_Eikel_2011, title={PADrend: Platform for Algorithm Development and Rendering}, volume={295}, booktitle={Augmented &#38; Virtual Reality in der Produktentstehung}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Jähn, Claudius and Petring, Ralf and Eikel, Benjamin}, year={2011}, pages={159--170} }","apa":"Jähn, C., Petring, R., &#38; Eikel, B. (2011). PADrend: Platform for Algorithm Development and Rendering. <i>Augmented &#38; Virtual Reality in Der Produktentstehung</i>, <i>295</i>, 159--170.","ieee":"C. Jähn, R. Petring, and B. Eikel, “PADrend: Platform for Algorithm Development and Rendering,” in <i>Augmented &#38; Virtual Reality in der Produktentstehung</i>, 2011, vol. 295, pp. 159--170.","short":"C. Jähn, R. Petring, B. Eikel, in: Augmented &#38; Virtual Reality in Der Produktentstehung, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2011, pp. 159--170.","chicago":"Jähn, Claudius, Ralf Petring, and Benjamin Eikel. “PADrend: Platform for Algorithm Development and Rendering.” In <i>Augmented &#38; Virtual Reality in Der Produktentstehung</i>, 295:159--170. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2011."},"publication":"Augmented & Virtual Reality in der Produktentstehung","department":[{"_id":"63"},{"_id":"26"}],"type":"conference","date_created":"2020-10-02T09:36:57Z","intvolume":"       295","date_updated":"2022-01-06T06:54:13Z","author":[{"last_name":"Jähn","first_name":"Claudius","full_name":"Jähn, Claudius"},{"full_name":"Petring, Ralf","first_name":"Ralf","last_name":"Petring"},{"full_name":"Eikel, Benjamin","first_name":"Benjamin","last_name":"Eikel"}],"title":"PADrend: Platform for Algorithm Development and Rendering","status":"public","year":"2011","volume":295,"user_id":"5786","language":[{"iso":"eng"}],"_id":"19845","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","page":"159--170"},{"citation":{"mla":"Hamann, Heiko, et al. “Coupled Inverted Pendulums: A Benchmark for Evolving Decentral Controllers in Modular Robotics.” <i>Proceedings of the 13th Annual Genetic and Evolutionary Computation Conference, GECCO 2011</i>, 2011, pp. 195--202, doi:<a href=\"https://doi.org/10.1145/2001576.2001604\">10.1145/2001576.2001604</a>.","ama":"Hamann H, Schmickl T, Crailsheim K, Krasnogor N, Luca Lanzi P. Coupled inverted pendulums: A benchmark for evolving decentral controllers in modular robotics. In: <i>Proceedings of the 13th Annual Genetic and Evolutionary Computation Conference, GECCO 2011</i>. ; 2011:195--202. doi:<a href=\"https://doi.org/10.1145/2001576.2001604\">10.1145/2001576.2001604</a>","bibtex":"@inproceedings{Hamann_Schmickl_Crailsheim_Krasnogor_Luca Lanzi_2011, title={Coupled inverted pendulums: A benchmark for evolving decentral controllers in modular robotics}, DOI={<a href=\"https://doi.org/10.1145/2001576.2001604\">10.1145/2001576.2001604</a>}, booktitle={Proceedings of the 13th Annual Genetic and Evolutionary Computation Conference, GECCO 2011}, author={Hamann, Heiko and Schmickl, Thomas and Crailsheim, Karl and Krasnogor, Natalio and Luca Lanzi, Pier}, year={2011}, pages={195--202} }","apa":"Hamann, H., Schmickl, T., Crailsheim, K., Krasnogor, N., &#38; Luca Lanzi, P. (2011). Coupled inverted pendulums: A benchmark for evolving decentral controllers in modular robotics. In <i>Proceedings of the 13th Annual Genetic and Evolutionary Computation Conference, GECCO 2011</i> (pp. 195--202). <a href=\"https://doi.org/10.1145/2001576.2001604\">https://doi.org/10.1145/2001576.2001604</a>","ieee":"H. Hamann, T. Schmickl, K. Crailsheim, N. Krasnogor, and P. Luca Lanzi, “Coupled inverted pendulums: A benchmark for evolving decentral controllers in modular robotics,” in <i>Proceedings of the 13th Annual Genetic and Evolutionary Computation Conference, GECCO 2011</i>, 2011, pp. 195--202.","chicago":"Hamann, Heiko, Thomas Schmickl, Karl Crailsheim, Natalio Krasnogor, and Pier Luca Lanzi. “Coupled Inverted Pendulums: A Benchmark for Evolving Decentral Controllers in Modular Robotics.” In <i>Proceedings of the 13th Annual Genetic and Evolutionary Computation Conference, GECCO 2011</i>, 195--202, 2011. <a href=\"https://doi.org/10.1145/2001576.2001604\">https://doi.org/10.1145/2001576.2001604</a>.","short":"H. Hamann, T. Schmickl, K. Crailsheim, N. Krasnogor, P. Luca Lanzi, in: Proceedings of the 13th Annual Genetic and Evolutionary Computation Conference, GECCO 2011, 2011, pp. 195--202."},"publication":"Proceedings of the 13th Annual Genetic and Evolutionary Computation Conference, GECCO 2011","abstract":[{"lang":"eng","text":"The challenging scientific field of self-reconfiguring modular robotics (i.e., decentrally controlled 'super-robots' based on autonomous, interacting robot modules with variable morphologies) calls for novel paradigms of designing robot controllers. One option is the approach of evolutionary robotics. In this approach, the challenge is to achieve high evaluation numbers with the available resources which may even affect the feasibility of this approach. Simulations are usually applied at least in a preliminary stage of research to support controller design. However, even simulations are computationally expensive which gets even more burdensome once comprehensive studies and comparisons between different controller designs and approaches have to be done. Hence, a benchmark with low computational cost is needed that still contains the typical challenges of decentral control, is comparable, and easily manageable. We propose such a benchmark and report an empirical study of its characteristics including the transition from the single-robot setting to the multi-robot setting, typical local optima, and properties of adaptive walks through the fitness landscape."}],"date_created":"2020-10-22T12:14:11Z","department":[{"_id":"63"},{"_id":"238"}],"type":"conference","author":[{"full_name":"Hamann, Heiko","last_name":"Hamann","first_name":"Heiko"},{"first_name":"Thomas","last_name":"Schmickl","full_name":"Schmickl, Thomas"},{"full_name":"Crailsheim, Karl","first_name":"Karl","last_name":"Crailsheim"},{"first_name":"Natalio","last_name":"Krasnogor","full_name":"Krasnogor, Natalio"},{"last_name":"Luca Lanzi","first_name":"Pier","full_name":"Luca Lanzi, Pier"}],"status":"public","year":"2011","title":"Coupled inverted pendulums: A benchmark for evolving decentral controllers in modular robotics","date_updated":"2022-01-06T06:54:21Z","language":[{"iso":"eng"}],"_id":"20180","page":"195--202","user_id":"15415","doi":"10.1145/2001576.2001604"},{"page":"62--69","language":[{"iso":"eng"}],"_id":"20181","doi":"10.1109/ALIFE.2011.5954660","user_id":"15415","status":"public","year":"2011","title":"Thermodynamics of Emergence: Langton's Ant Meets Boltzmann","author":[{"last_name":"Hamann","first_name":"Heiko","full_name":"Hamann, Heiko"},{"first_name":"Thomas","last_name":"Schmickl","full_name":"Schmickl, Thomas"},{"first_name":"Karl","last_name":"Crailsheim","full_name":"Crailsheim, Karl"}],"date_updated":"2022-01-06T06:54:21Z","date_created":"2020-10-22T12:19:41Z","type":"conference","department":[{"_id":"63"},{"_id":"238"}],"publication":"IEEE Symposium on Artificial Life (IEEE ALIFE 2011)","citation":{"chicago":"Hamann, Heiko, Thomas Schmickl, and Karl Crailsheim. “Thermodynamics of Emergence: Langton’s Ant Meets Boltzmann.” In <i>IEEE Symposium on Artificial Life (IEEE ALIFE 2011)</i>, 62--69, 2011. <a href=\"https://doi.org/10.1109/ALIFE.2011.5954660\">https://doi.org/10.1109/ALIFE.2011.5954660</a>.","ama":"Hamann H, Schmickl T, Crailsheim K. Thermodynamics of Emergence: Langton’s Ant Meets Boltzmann. In: <i>IEEE Symposium on Artificial Life (IEEE ALIFE 2011)</i>. ; 2011:62--69. doi:<a href=\"https://doi.org/10.1109/ALIFE.2011.5954660\">10.1109/ALIFE.2011.5954660</a>","short":"H. Hamann, T. Schmickl, K. Crailsheim, in: IEEE Symposium on Artificial Life (IEEE ALIFE 2011), 2011, pp. 62--69.","bibtex":"@inproceedings{Hamann_Schmickl_Crailsheim_2011, title={Thermodynamics of Emergence: Langton’s Ant Meets Boltzmann}, DOI={<a href=\"https://doi.org/10.1109/ALIFE.2011.5954660\">10.1109/ALIFE.2011.5954660</a>}, booktitle={IEEE Symposium on Artificial Life (IEEE ALIFE 2011)}, author={Hamann, Heiko and Schmickl, Thomas and Crailsheim, Karl}, year={2011}, pages={62--69} }","apa":"Hamann, H., Schmickl, T., &#38; Crailsheim, K. (2011). Thermodynamics of Emergence: Langton’s Ant Meets Boltzmann. In <i>IEEE Symposium on Artificial Life (IEEE ALIFE 2011)</i> (pp. 62--69). <a href=\"https://doi.org/10.1109/ALIFE.2011.5954660\">https://doi.org/10.1109/ALIFE.2011.5954660</a>","mla":"Hamann, Heiko, et al. “Thermodynamics of Emergence: Langton’s Ant Meets Boltzmann.” <i>IEEE Symposium on Artificial Life (IEEE ALIFE 2011)</i>, 2011, pp. 62--69, doi:<a href=\"https://doi.org/10.1109/ALIFE.2011.5954660\">10.1109/ALIFE.2011.5954660</a>.","ieee":"H. Hamann, T. Schmickl, and K. Crailsheim, “Thermodynamics of Emergence: Langton’s Ant Meets Boltzmann,” in <i>IEEE Symposium on Artificial Life (IEEE ALIFE 2011)</i>, 2011, pp. 62--69."},"abstract":[{"lang":"eng","text":"The current definitions of emergence have no effects in the context of artificial life that could convincingly be called `constructive'. They are rather descriptive labels or tests. In order to get towards recipes of generating emergence we need to know systemic characteristics that help during the design phase of artificial life systems and worlds. In this paper, we develop and discuss five hypotheses that are not meant to be irrevocable but rather thought-provoking. We introduce two modeling approaches for Langton's ant to clarify these hypotheses. Then we discuss general properties of systems, such as (ir-)reversibility, dependence on initial states, computation, discreetness, and undecidable properties of system states."}]},{"department":[{"_id":"63"},{"_id":"238"}],"type":"conference","date_created":"2020-10-22T12:27:11Z","citation":{"apa":"Hamann, H., Schmickl, T., &#38; Crailsheim, K. (2011). Evolving for Creativity: Maximizing Complexity in a Self-organized Multi-particle System. In <i>10th European Conference on Artificial Life (ECAL’09)</i> (Vol. 5777, pp. 442--449). <a href=\"https://doi.org/10.1007/978-3-642-21283-3_55\">https://doi.org/10.1007/978-3-642-21283-3_55</a>","ieee":"H. Hamann, T. Schmickl, and K. Crailsheim, “Evolving for Creativity: Maximizing Complexity in a Self-organized Multi-particle System,” in <i>10th European Conference on Artificial Life (ECAL’09)</i>, 2011, vol. 5777, pp. 442--449.","short":"H. Hamann, T. Schmickl, K. Crailsheim, in: 10th European Conference on Artificial Life (ECAL’09), 2011, pp. 442--449.","chicago":"Hamann, Heiko, Thomas Schmickl, and Karl Crailsheim. “Evolving for Creativity: Maximizing Complexity in a Self-Organized Multi-Particle System.” In <i>10th European Conference on Artificial Life (ECAL’09)</i>, 5777:442--449, 2011. <a href=\"https://doi.org/10.1007/978-3-642-21283-3_55\">https://doi.org/10.1007/978-3-642-21283-3_55</a>.","mla":"Hamann, Heiko, et al. “Evolving for Creativity: Maximizing Complexity in a Self-Organized Multi-Particle System.” <i>10th European Conference on Artificial Life (ECAL’09)</i>, vol. 5777, 2011, pp. 442--449, doi:<a href=\"https://doi.org/10.1007/978-3-642-21283-3_55\">10.1007/978-3-642-21283-3_55</a>.","ama":"Hamann H, Schmickl T, Crailsheim K. Evolving for Creativity: Maximizing Complexity in a Self-organized Multi-particle System. In: <i>10th European Conference on Artificial Life (ECAL’09)</i>. Vol 5777. ; 2011:442--449. doi:<a href=\"https://doi.org/10.1007/978-3-642-21283-3_55\">10.1007/978-3-642-21283-3_55</a>","bibtex":"@inproceedings{Hamann_Schmickl_Crailsheim_2011, title={Evolving for Creativity: Maximizing Complexity in a Self-organized Multi-particle System}, volume={5777}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-21283-3_55\">10.1007/978-3-642-21283-3_55</a>}, booktitle={10th European Conference on Artificial Life (ECAL’09)}, author={Hamann, Heiko and Schmickl, Thomas and Crailsheim, Karl}, year={2011}, pages={442--449} }"},"publication":"10th European Conference on Artificial Life (ECAL'09)","volume":5777,"user_id":"15415","doi":"10.1007/978-3-642-21283-3_55","_id":"20183","language":[{"iso":"eng"}],"page":"442--449","intvolume":"      5777","publication_status":"published","date_updated":"2022-01-06T06:54:21Z","author":[{"full_name":"Hamann, Heiko","last_name":"Hamann","first_name":"Heiko"},{"last_name":"Schmickl","first_name":"Thomas","full_name":"Schmickl, Thomas"},{"full_name":"Crailsheim, Karl","last_name":"Crailsheim","first_name":"Karl"}],"publication_identifier":{"isbn":["9783642212826","9783642212833"],"issn":["0302-9743","1611-3349"]},"status":"public","title":"Evolving for Creativity: Maximizing Complexity in a Self-organized Multi-particle System","year":"2011"},{"date_created":"2020-10-22T12:34:50Z","department":[{"_id":"63"},{"_id":"238"}],"type":"conference","citation":{"mla":"Hamann, Heiko, et al. “Robotic Organisms: Artificial Homeostatic Hormone System and Virtual Embryogenesis as Examples for Adaptive Reaction-Diffusion Controllers.” <i>Robotic Organisms: Artificial Homeostatic Hormone System and Virtual Embryogenesis as Examples</i>, 2011.","ama":"Hamann H, Schmickl T, Stradner J, Crailsheim K, Thenius R, Fitch R. Robotic Organisms: Artificial Homeostatic Hormone System and Virtual Embryogenesis as Examples for Adaptive Reaction-Diffusion Controllers. In: <i>Robotic Organisms: Artificial Homeostatic Hormone System and Virtual Embryogenesis as Examples</i>. ; 2011.","bibtex":"@inproceedings{Hamann_Schmickl_Stradner_Crailsheim_Thenius_Fitch_2011, title={Robotic Organisms: Artificial Homeostatic Hormone System and Virtual Embryogenesis as Examples for Adaptive Reaction-Diffusion Controllers}, booktitle={Robotic Organisms: Artificial Homeostatic Hormone System and Virtual Embryogenesis as Examples}, author={Hamann, Heiko and Schmickl, Thomas and Stradner, Jürgen and Crailsheim, Karl and Thenius, Rona and Fitch, Robert}, year={2011} }","apa":"Hamann, H., Schmickl, T., Stradner, J., Crailsheim, K., Thenius, R., &#38; Fitch, R. (2011). Robotic Organisms: Artificial Homeostatic Hormone System and Virtual Embryogenesis as Examples for Adaptive Reaction-Diffusion Controllers. In <i>Robotic Organisms: Artificial Homeostatic Hormone System and Virtual Embryogenesis as Examples</i>.","ieee":"H. Hamann, T. Schmickl, J. Stradner, K. Crailsheim, R. Thenius, and R. Fitch, “Robotic Organisms: Artificial Homeostatic Hormone System and Virtual Embryogenesis as Examples for Adaptive Reaction-Diffusion Controllers,” in <i>Robotic Organisms: Artificial Homeostatic Hormone System and Virtual Embryogenesis as Examples</i>, 2011.","short":"H. Hamann, T. Schmickl, J. Stradner, K. Crailsheim, R. Thenius, R. Fitch, in: Robotic Organisms: Artificial Homeostatic Hormone System and Virtual Embryogenesis as Examples, 2011.","chicago":"Hamann, Heiko, Thomas Schmickl, Jürgen Stradner, Karl Crailsheim, Rona Thenius, and Robert Fitch. “Robotic Organisms: Artificial Homeostatic Hormone System and Virtual Embryogenesis as Examples for Adaptive Reaction-Diffusion Controllers.” In <i>Robotic Organisms: Artificial Homeostatic Hormone System and Virtual Embryogenesis as Examples</i>, 2011."},"publication":"Robotic Organisms: Artificial Homeostatic Hormone System and Virtual Embryogenesis as Examples","_id":"20184","language":[{"iso":"eng"}],"user_id":"15415","author":[{"full_name":"Hamann, Heiko","first_name":"Heiko","last_name":"Hamann"},{"last_name":"Schmickl","first_name":"Thomas","full_name":"Schmickl, Thomas"},{"last_name":"Stradner","first_name":"Jürgen","full_name":"Stradner, Jürgen"},{"first_name":"Karl","last_name":"Crailsheim","full_name":"Crailsheim, Karl"},{"first_name":"Rona","last_name":"Thenius","full_name":"Thenius, Rona"},{"full_name":"Fitch, Robert","last_name":"Fitch","first_name":"Robert"}],"year":"2011","title":"Robotic Organisms: Artificial Homeostatic Hormone System and Virtual Embryogenesis as Examples for Adaptive Reaction-Diffusion Controllers","status":"public","date_updated":"2022-01-06T06:54:21Z"},{"author":[{"last_name":"Hamann","first_name":"Heiko","full_name":"Hamann, Heiko"},{"last_name":"Schmickl","first_name":"Thomas","full_name":"Schmickl, Thomas"}],"status":"public","year":"2011","title":"{BEECLUST}: {A} Swarm Algorithm Derived from Honeybees","date_updated":"2022-01-06T06:54:22Z","language":[{"iso":"eng"}],"_id":"20193","publisher":"CRC Press","editor":[{"full_name":"Xiao, Yang","last_name":"Xiao","first_name":"Yang"}],"user_id":"15415","citation":{"mla":"Hamann, Heiko, and Thomas Schmickl. “{BEECLUST}: {A} Swarm Algorithm Derived from Honeybees.” <i>Bio-Inspired Computing and Communication Networks</i>, edited by Yang Xiao, CRC Press, 2011.","ama":"Hamann H, Schmickl T. {BEECLUST}: {A} Swarm Algorithm Derived from Honeybees. In: Xiao Y, ed. <i>Bio-Inspired Computing and Communication Networks</i>. Boca Raton, FL, USA: CRC Press; 2011.","bibtex":"@inbook{Hamann_Schmickl_2011, place={Boca Raton, FL, USA}, title={{BEECLUST}: {A} Swarm Algorithm Derived from Honeybees}, booktitle={Bio-inspired Computing and Communication Networks}, publisher={CRC Press}, author={Hamann, Heiko and Schmickl, Thomas}, editor={Xiao, YangEditor}, year={2011} }","apa":"Hamann, H., &#38; Schmickl, T. (2011). {BEECLUST}: {A} Swarm Algorithm Derived from Honeybees. In Y. Xiao (Ed.), <i>Bio-inspired Computing and Communication Networks</i>. Boca Raton, FL, USA: CRC Press.","ieee":"H. Hamann and T. Schmickl, “{BEECLUST}: {A} Swarm Algorithm Derived from Honeybees,” in <i>Bio-inspired Computing and Communication Networks</i>, Y. Xiao, Ed. Boca Raton, FL, USA: CRC Press, 2011.","chicago":"Hamann, Heiko, and Thomas Schmickl. “{BEECLUST}: {A} Swarm Algorithm Derived from Honeybees.” In <i>Bio-Inspired Computing and Communication Networks</i>, edited by Yang Xiao. Boca Raton, FL, USA: CRC Press, 2011.","short":"H. Hamann, T. Schmickl, in: Y. Xiao (Ed.), Bio-Inspired Computing and Communication Networks, CRC Press, Boca Raton, FL, USA, 2011."},"publication":"Bio-inspired Computing and Communication Networks","place":"Boca Raton, FL, USA","date_created":"2020-10-26T10:56:14Z","department":[{"_id":"63"},{"_id":"238"}],"type":"book_chapter"}]