[{"date_created":"2017-11-27T10:22:25Z","author":[{"last_name":"Dräxler","full_name":"Dräxler, Sevil","id":"31764","first_name":"Sevil"},{"last_name":"Karl","full_name":"Karl, Holger","id":"126","first_name":"Holger"}],"oa":"1","date_updated":"2022-01-06T07:03:39Z","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1503.02442"}],"title":"Specification of Complex Structures in Distributed Service Function Chaining Using a YANG Data Model","citation":{"ama":"Dräxler S, Karl H. Specification of Complex Structures in Distributed Service Function Chaining Using a YANG Data Model. <i>CoRR</i>. 2015.","ieee":"S. Dräxler and H. Karl, “Specification of Complex Structures in Distributed Service Function Chaining Using a YANG Data Model,” <i>CoRR</i>. 2015.","chicago":"Dräxler, Sevil, and Holger Karl. “Specification of Complex Structures in Distributed Service Function Chaining Using a YANG Data Model.” <i>CoRR</i>, 2015.","short":"S. Dräxler, H. Karl, CoRR (2015).","mla":"Dräxler, Sevil, and Holger Karl. “Specification of Complex Structures in Distributed Service Function Chaining Using a YANG Data Model.” <i>CoRR</i>, 2015.","bibtex":"@article{Dräxler_Karl_2015, title={Specification of Complex Structures in Distributed Service Function Chaining Using a YANG Data Model}, journal={CoRR}, author={Dräxler, Sevil and Karl, Holger}, year={2015} }","apa":"Dräxler, S., &#38; Karl, H. (2015). Specification of Complex Structures in Distributed Service Function Chaining Using a YANG Data Model. <i>CoRR</i>."},"year":"2015","department":[{"_id":"75"}],"user_id":"31764","_id":"749","language":[{"iso":"eng"}],"publication":"CoRR","type":"preprint","status":"public"},{"type":"preprint","publication":"CoRR","citation":{"mla":"Dräxler, Martin, and Holger Karl. “Dynamic Backhaul Network Configuration in SDN-Based Cloud RANs.” <i>CoRR</i>, 2015.","bibtex":"@article{Dräxler_Karl_2015, title={Dynamic Backhaul Network Configuration in SDN-based Cloud RANs}, journal={CoRR}, author={Dräxler, Martin and Karl, Holger}, year={2015} }","short":"M. Dräxler, H. Karl, CoRR (2015).","apa":"Dräxler, M., &#38; Karl, H. (2015). Dynamic Backhaul Network Configuration in SDN-based Cloud RANs. <i>CoRR</i>.","chicago":"Dräxler, Martin, and Holger Karl. “Dynamic Backhaul Network Configuration in SDN-Based Cloud RANs.” <i>CoRR</i>, 2015.","ieee":"M. Dräxler and H. Karl, “Dynamic Backhaul Network Configuration in SDN-based Cloud RANs,” <i>CoRR</i>. 2015.","ama":"Dräxler M, Karl H. Dynamic Backhaul Network Configuration in SDN-based Cloud RANs. <i>CoRR</i>. 2015."},"status":"public","year":"2015","user_id":"15572","author":[{"first_name":"Martin","full_name":"Dräxler, Martin","last_name":"Dräxler"},{"id":"126","full_name":"Karl, Holger","last_name":"Karl","first_name":"Holger"}],"date_created":"2017-11-27T10:22:25Z","department":[{"_id":"75"}],"date_updated":"2022-01-06T07:03:39Z","_id":"750","title":"Dynamic Backhaul Network Configuration in SDN-based Cloud RANs"},{"language":[{"iso":"eng"}],"_id":"7568","department":[{"_id":"66"},{"_id":"600"}],"user_id":"82920","abstract":[{"lang":"eng","text":"Today's web search and big data analytics applications aim to address information needs~(typically given in the form of search queries) ad-hoc on large numbers of texts. In order to directly return relevant information instead of only returning potentially relevant texts, these applications have begun to employ text mining. The term text mining covers tasks that deal with the inference of structured high-quality information from collections and streams of unstructured input texts. Text mining requires task-specific text analysis processes that may consist of several interdependent steps. These processes are realized with sequences of algorithms from information extraction, text classification, and natural language processing. However, the use of such text analysis pipelines is still restricted to addressing a few predefined information needs. We argue that the reasons behind are three-fold: First, text analysis pipelines are usually made manually in respect of the given information need and input texts, because their design requires expert knowledge about the algorithms to be employed. When information needs have to be addressed that are unknown beforehand, text mining hence cannot be performed ad-hoc. Second, text analysis pipelines tend to be inefficient in terms of run-time, because their execution often includes analyzing texts with computationally expensive algorithms. When information needs have to be addressed ad-hoc, text mining hence cannot be performed in the large. And third, text analysis pipelines tend not to robustly achieve high effectiveness on all texts, because their results are often inferred by algorithms that rely on domain-dependent features of texts. Hence, text mining currently cannot guarantee to infer high-quality information. In this thesis, we contribute to the question of how to address information needs from text mining ad-hoc in an efficient and domain-robust manner. We observe that knowledge about a text analysis process and information obtained within the process help to improve the design, the execution, and the results of the pipeline that realizes the process. To this end, we apply different techniques from classical and statistical artificial intelligence. In particular, we first develop knowledge-based approaches for an ad-hoc pipeline construction and for an optimal execution of a pipeline on its input. Then, we show theoretically and practically how to optimize and adapt the schedule of the algorithms in a pipeline based on information in the analyzed input texts in order to maximize execution efficiency. Finally, we learn patterns in the argumentation structures of texts statistically that remain strongly invariant across domains and that, thereby, allow for more robust analysis results in a restricted set of tasks. We formally analyze all developed approaches and we implement them as open-source software applications. Based on these applications, we evaluate the approaches on established and on newly created collections of texts for scientifically and industrially important text analysis tasks, such as financial event extraction and fine-grained sentiment analysis. Our findings show that text analysis pipelines can be designed automatically, which process only portions of text that are relevant for the information need at hand. Through scheduling, the run-time efficiency of pipelines can be improved by up to more than one order of magnitude while maintaining effectiveness. Moreover, we provide evidence that a pipeline's domain robustness substantially benefits from focusing on argumentation structure in tasks like sentiment analysis. We conclude that our approaches denote essential building blocks of enabling ad-hoc large-scale text mining in web search and big data analytics applications."}],"status":"public","type":"dissertation","title":"Pipelines for Ad-hoc Large-scale Text Mining","date_updated":"2022-01-06T07:03:39Z","date_created":"2019-02-06T14:14:29Z","author":[{"first_name":"Henning","full_name":"Wachsmuth, Henning","id":"3900","last_name":"Wachsmuth"}],"year":"2015","citation":{"apa":"Wachsmuth, H. (2015). <i>Pipelines for Ad-hoc Large-scale Text Mining</i>.","bibtex":"@book{Wachsmuth_2015, title={Pipelines for Ad-hoc Large-scale Text Mining}, author={Wachsmuth, Henning}, year={2015} }","short":"H. Wachsmuth, Pipelines for Ad-Hoc Large-Scale Text Mining, 2015.","mla":"Wachsmuth, Henning. <i>Pipelines for Ad-Hoc Large-Scale Text Mining</i>. 2015.","chicago":"Wachsmuth, Henning. <i>Pipelines for Ad-Hoc Large-Scale Text Mining</i>, 2015.","ieee":"H. Wachsmuth, <i>Pipelines for Ad-hoc Large-scale Text Mining</i>. 2015.","ama":"Wachsmuth H. <i>Pipelines for Ad-Hoc Large-Scale Text Mining</i>.; 2015."},"related_material":{"link":[{"relation":"confirmation","url":"https://webis.de/downloads/publications/papers/wachsmuth_2013.pdf"}]}},{"status":"public","publication":"Proceedings of the 2nd International Workshop on Model-Driven Engineering for Component-Based Software Systems co-located with ACM/IEEE 18th International Conference on Model Driven Engineering Languages & Systems (MoDELS 2015)","type":"conference","language":[{"iso":"eng"}],"department":[{"_id":"66"}],"user_id":"52534","_id":"8491","page":"6-11","intvolume":"      1463","citation":{"ama":"Derakhshanmanesh  M, Ebert  J, Grieger M. Challenges for Model-Integrating Components. In: <i>Proceedings of the 2nd International Workshop on Model-Driven Engineering for Component-Based Software Systems Co-Located with ACM/IEEE 18th International Conference on Model Driven Engineering Languages &#38; Systems (MoDELS 2015)</i>. Vol 1463. CEUR Workshop Proceedings; 2015:6-11.","ieee":"M. Derakhshanmanesh , J. Ebert , and M. Grieger, “Challenges for Model-Integrating Components,” in <i>Proceedings of the 2nd International Workshop on Model-Driven Engineering for Component-Based Software Systems co-located with ACM/IEEE 18th International Conference on Model Driven Engineering Languages &#38; Systems (MoDELS 2015)</i>, 2015, vol. 1463, pp. 6–11.","chicago":"Derakhshanmanesh , Mahdi , Jürgen  Ebert , and Marvin  Grieger. “Challenges for Model-Integrating Components.” In <i>Proceedings of the 2nd International Workshop on Model-Driven Engineering for Component-Based Software Systems Co-Located with ACM/IEEE 18th International Conference on Model Driven Engineering Languages &#38; Systems (MoDELS 2015)</i>, 1463:6–11. CEUR Workshop Proceedings, 2015.","short":"M. Derakhshanmanesh , J. Ebert , M. Grieger, in: Proceedings of the 2nd International Workshop on Model-Driven Engineering for Component-Based Software Systems Co-Located with ACM/IEEE 18th International Conference on Model Driven Engineering Languages &#38; Systems (MoDELS 2015), CEUR Workshop Proceedings, 2015, pp. 6–11.","mla":"Derakhshanmanesh , Mahdi, et al. “Challenges for Model-Integrating Components.” <i>Proceedings of the 2nd International Workshop on Model-Driven Engineering for Component-Based Software Systems Co-Located with ACM/IEEE 18th International Conference on Model Driven Engineering Languages &#38; Systems (MoDELS 2015)</i>, vol. 1463, CEUR Workshop Proceedings, 2015, pp. 6–11.","bibtex":"@inproceedings{Derakhshanmanesh _Ebert _Grieger_2015, title={Challenges for Model-Integrating Components}, volume={1463}, booktitle={Proceedings of the 2nd International Workshop on Model-Driven Engineering for Component-Based Software Systems co-located with ACM/IEEE 18th International Conference on Model Driven Engineering Languages &#38; Systems (MoDELS 2015)}, publisher={CEUR Workshop Proceedings}, author={Derakhshanmanesh , Mahdi  and Ebert , Jürgen  and Grieger, Marvin }, year={2015}, pages={6–11} }","apa":"Derakhshanmanesh , M., Ebert , J., &#38; Grieger, M. (2015). Challenges for Model-Integrating Components. In <i>Proceedings of the 2nd International Workshop on Model-Driven Engineering for Component-Based Software Systems co-located with ACM/IEEE 18th International Conference on Model Driven Engineering Languages &#38; Systems (MoDELS 2015)</i> (Vol. 1463, pp. 6–11). CEUR Workshop Proceedings."},"year":"2015","title":"Challenges for Model-Integrating Components","volume":1463,"date_created":"2019-03-08T14:15:26Z","author":[{"full_name":"Derakhshanmanesh , Mahdi ","last_name":"Derakhshanmanesh ","first_name":"Mahdi "},{"last_name":"Ebert ","full_name":"Ebert , Jürgen ","first_name":"Jürgen "},{"first_name":"Marvin ","full_name":"Grieger, Marvin ","last_name":"Grieger"}],"date_updated":"2022-01-06T07:03:56Z","publisher":"CEUR Workshop Proceedings"},{"publication":"Gemeinsamer Tagungsband der Workshops der Tagung Software Engineering 2015","type":"conference","status":"public","_id":"8492","department":[{"_id":"66"}],"user_id":"52534","language":[{"iso":"eng"}],"year":"2015","intvolume":"      1337","page":"112-114","citation":{"short":"M. Derakhshanmanesh , M. Grieger, in: Gemeinsamer Tagungsband Der Workshops Der Tagung Software Engineering 2015, CEUR Workshop Proceedings, 2015, pp. 112–114.","mla":"Derakhshanmanesh , Mahdi, and Marvin Grieger. “On Enabling Technologies for Longevity in Software.” <i>Gemeinsamer Tagungsband Der Workshops Der Tagung Software Engineering 2015</i>, vol. 1337, CEUR Workshop Proceedings, 2015, pp. 112–14.","bibtex":"@inproceedings{Derakhshanmanesh _Grieger_2015, title={On Enabling Technologies for Longevity in Software}, volume={1337}, booktitle={Gemeinsamer Tagungsband der Workshops der Tagung Software Engineering 2015}, publisher={CEUR Workshop Proceedings}, author={Derakhshanmanesh , Mahdi  and Grieger, Marvin }, year={2015}, pages={112–114} }","apa":"Derakhshanmanesh , M., &#38; Grieger, M. (2015). On Enabling Technologies for Longevity in Software. In <i>Gemeinsamer Tagungsband der Workshops der Tagung Software Engineering 2015</i> (Vol. 1337, pp. 112–114). CEUR Workshop Proceedings.","ama":"Derakhshanmanesh  M, Grieger M. On Enabling Technologies for Longevity in Software. In: <i>Gemeinsamer Tagungsband Der Workshops Der Tagung Software Engineering 2015</i>. Vol 1337. CEUR Workshop Proceedings; 2015:112-114.","ieee":"M. Derakhshanmanesh  and M. Grieger, “On Enabling Technologies for Longevity in Software,” in <i>Gemeinsamer Tagungsband der Workshops der Tagung Software Engineering 2015</i>, 2015, vol. 1337, pp. 112–114.","chicago":"Derakhshanmanesh , Mahdi , and Marvin  Grieger. “On Enabling Technologies for Longevity in Software.” In <i>Gemeinsamer Tagungsband Der Workshops Der Tagung Software Engineering 2015</i>, 1337:112–14. CEUR Workshop Proceedings, 2015."},"publisher":"CEUR Workshop Proceedings","date_updated":"2022-01-06T07:03:56Z","volume":1337,"date_created":"2019-03-08T14:17:37Z","author":[{"first_name":"Mahdi ","full_name":"Derakhshanmanesh , Mahdi ","last_name":"Derakhshanmanesh "},{"full_name":"Grieger, Marvin ","last_name":"Grieger","first_name":"Marvin "}],"title":"On Enabling Technologies for Longevity in Software","main_file_link":[{"url":"http://ceur-ws.org/Vol-1337/paper18.pdf"}]},{"language":[{"iso":"eng"}],"_id":"8493","user_id":"52534","department":[{"_id":"66"}],"status":"public","type":"conference","publication":"Proceedings of the 10th Workshop on Models@run.time co-located with 18th International Conference on Model Driven Engineering Languages and Systems (MODELS 2015)","title":"On the Need for Transactional Models@Run.Time","date_updated":"2022-01-06T07:03:56Z","publisher":"CEUR Workshop Proceedings","date_created":"2019-03-08T14:19:42Z","author":[{"first_name":"Mahdi ","full_name":"Derakhshanmanesh , Mahdi ","last_name":"Derakhshanmanesh "},{"first_name":"Marvin ","last_name":"Grieger ","full_name":"Grieger , Marvin "},{"first_name":"Jürgen ","last_name":"Ebert","full_name":"Ebert, Jürgen "}],"volume":1474,"year":"2015","citation":{"bibtex":"@inproceedings{Derakhshanmanesh _Grieger _Ebert_2015, title={On the Need for Transactional Models@Run.Time}, volume={1474}, booktitle={Proceedings of the 10th Workshop on Models@run.time co-located with 18th International Conference on Model Driven Engineering Languages and Systems (MODELS 2015)}, publisher={CEUR Workshop Proceedings}, author={Derakhshanmanesh , Mahdi  and Grieger , Marvin  and Ebert, Jürgen }, year={2015}, pages={21–30} }","short":"M. Derakhshanmanesh , M. Grieger , J. Ebert, in: Proceedings of the 10th Workshop on Models@run.Time Co-Located with 18th International Conference on Model Driven Engineering Languages and Systems (MODELS 2015), CEUR Workshop Proceedings, 2015, pp. 21–30.","mla":"Derakhshanmanesh , Mahdi, et al. “On the Need for Transactional Models@Run.Time.” <i>Proceedings of the 10th Workshop on Models@run.Time Co-Located with 18th International Conference on Model Driven Engineering Languages and Systems (MODELS 2015)</i>, vol. 1474, CEUR Workshop Proceedings, 2015, pp. 21–30.","apa":"Derakhshanmanesh , M., Grieger , M., &#38; Ebert, J. (2015). On the Need for Transactional Models@Run.Time. In <i>Proceedings of the 10th Workshop on Models@run.time co-located with 18th International Conference on Model Driven Engineering Languages and Systems (MODELS 2015)</i> (Vol. 1474, pp. 21–30). CEUR Workshop Proceedings.","ama":"Derakhshanmanesh  M, Grieger  M, Ebert J. On the Need for Transactional Models@Run.Time. In: <i>Proceedings of the 10th Workshop on Models@run.Time Co-Located with 18th International Conference on Model Driven Engineering Languages and Systems (MODELS 2015)</i>. Vol 1474. CEUR Workshop Proceedings; 2015:21-30.","chicago":"Derakhshanmanesh , Mahdi , Marvin  Grieger , and Jürgen  Ebert. “On the Need for Transactional Models@Run.Time.” In <i>Proceedings of the 10th Workshop on Models@run.Time Co-Located with 18th International Conference on Model Driven Engineering Languages and Systems (MODELS 2015)</i>, 1474:21–30. CEUR Workshop Proceedings, 2015.","ieee":"M. Derakhshanmanesh , M. Grieger , and J. Ebert, “On the Need for Transactional Models@Run.Time,” in <i>Proceedings of the 10th Workshop on Models@run.time co-located with 18th International Conference on Model Driven Engineering Languages and Systems (MODELS 2015)</i>, 2015, vol. 1474, pp. 21–30."},"page":"21-30","intvolume":"      1474"},{"language":[{"iso":"eng"}],"ddc":["000"],"file":[{"relation":"main_file","success":1,"file_id":"5261","access_level":"closed","date_created":"2018-11-02T14:06:06Z","open_access":1,"date_updated":"2018-11-02T14:06:06Z","content_type":"application/pdf","file_name":"p25-peuster.pdf","file_size":1916017,"creator":"ups"}],"abstract":[{"text":"The increasing amount of mobile traffic leads to a significantly higher energy consumption of mobile networks that is mainly caused by the high number of required base stations. One recent solution for this is based on a two-layered network that uses long-range macro cells to provide a full coverage signaling overlay and short-range small cells for fast data transmissions. These small cells can be switched off when they are not needed and allow network-wide energy optimizations.\r\n\r\nThis paper presents an architecture that extends existing mobile networks to integrate a small cell layer that supports on-demand cell activation. We discuss how additional small cells can be interconnected with existing core components and how they can be controlled by a resource management component. \r\nFinally, a Wi-Fi based proof of concept testbed implementation is presented that demonstrates the feasibility of the approach.","lang":"eng"}],"publication":"Proceedings of the 5th Workshop on All Things Cellular: Operations, Applications and Challenges","title":"An Architecture for Energy-aware On-demand Mobile Network Management","date_created":"2017-11-27T10:22:29Z","year":"2015","file_date_updated":"2018-11-02T14:06:06Z","department":[{"_id":"75"}],"user_id":"477","_id":"986","project":[{"name":"SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Subproject C4","_id":"16"}],"status":"public","type":"conference","accept":"1","conference":{"location":"London","name":"Proceedings of the 5th Workshop on All Things Cellular: Operations, Applications and Challenges"},"main_file_link":[{"url":"https://dl.acm.org/citation.cfm?id=2785973"}],"author":[{"last_name":"Peuster","full_name":"Peuster, Manuel","id":"13271","first_name":"Manuel"},{"first_name":"Holger","id":"126","full_name":"Karl, Holger","last_name":"Karl"}],"date_updated":"2019-01-03T13:18:55Z","citation":{"apa":"Peuster, M., &#38; Karl, H. (2015). An Architecture for Energy-aware On-demand Mobile Network Management. In <i>Proceedings of the 5th Workshop on All Things Cellular: Operations, Applications and Challenges</i>. London.","bibtex":"@inproceedings{Peuster_Karl_2015, title={An Architecture for Energy-aware On-demand Mobile Network Management}, booktitle={Proceedings of the 5th Workshop on All Things Cellular: Operations, Applications and Challenges}, author={Peuster, Manuel and Karl, Holger}, year={2015} }","mla":"Peuster, Manuel, and Holger Karl. “An Architecture for Energy-Aware On-Demand Mobile Network Management.” <i>Proceedings of the 5th Workshop on All Things Cellular: Operations, Applications and Challenges</i>, 2015.","short":"M. Peuster, H. Karl, in: Proceedings of the 5th Workshop on All Things Cellular: Operations, Applications and Challenges, 2015.","ieee":"M. Peuster and H. Karl, “An Architecture for Energy-aware On-demand Mobile Network Management,” in <i>Proceedings of the 5th Workshop on All Things Cellular: Operations, Applications and Challenges</i>, London, 2015.","chicago":"Peuster, Manuel, and Holger Karl. “An Architecture for Energy-Aware On-Demand Mobile Network Management.” In <i>Proceedings of the 5th Workshop on All Things Cellular: Operations, Applications and Challenges</i>, 2015.","ama":"Peuster M, Karl H. An Architecture for Energy-aware On-demand Mobile Network Management. In: <i>Proceedings of the 5th Workshop on All Things Cellular: Operations, Applications and Challenges</i>. ; 2015."},"publication_status":"published"},{"page":"280-291","citation":{"short":"L. Li, A. Bartel, T.F. Bissyande, J. Klein, Y. Le Traon, S. Arzt, S. Rasthofer, E. Bodden, D. Octeau, P. McDaniel, in: 2015 International Conference on Software Engineering (ICSE), 2015, pp. 280–291.","mla":"Li, Li, et al. “IccTA: Detecting Inter-Component Privacy Leaks in Android Apps.” <i>2015 International Conference on Software Engineering (ICSE)</i>, 2015, pp. 280–91.","bibtex":"@inproceedings{Li_Bartel_Bissyande_Klein_Le Traon_Arzt_Rasthofer_Bodden_Octeau_McDaniel_2015, title={IccTA: Detecting Inter-Component Privacy Leaks in Android Apps}, booktitle={2015 International Conference on Software Engineering (ICSE)}, author={Li, Li and Bartel, Alexandre and Bissyande, Tegawende F. and Klein, Jacques and Le Traon, Yves and Arzt, Steven and Rasthofer, Siegfried and Bodden, Eric and Octeau, Damien and McDaniel, Patrick}, year={2015}, pages={280–291} }","apa":"Li, L., Bartel, A., Bissyande, T. F., Klein, J., Le Traon, Y., Arzt, S., … McDaniel, P. (2015). IccTA: Detecting Inter-Component Privacy Leaks in Android Apps. In <i>2015 International Conference on Software Engineering (ICSE)</i> (pp. 280–291).","chicago":"Li, Li, Alexandre Bartel, Tegawende F. Bissyande, Jacques Klein, Yves Le Traon, Steven Arzt, Siegfried Rasthofer, Eric Bodden, Damien Octeau, and Patrick McDaniel. “IccTA: Detecting Inter-Component Privacy Leaks in Android Apps.” In <i>2015 International Conference on Software Engineering (ICSE)</i>, 280–91, 2015.","ieee":"L. Li <i>et al.</i>, “IccTA: Detecting Inter-Component Privacy Leaks in Android Apps,” in <i>2015 International Conference on Software Engineering (ICSE)</i>, 2015, pp. 280–291.","ama":"Li L, Bartel A, Bissyande TF, et al. IccTA: Detecting Inter-Component Privacy Leaks in Android Apps. In: <i>2015 International Conference on Software Engineering (ICSE)</i>. ; 2015:280-291."},"year":"2015","has_accepted_license":"1","publication_identifier":{"isbn":["978-1-4799-1934-5"]},"main_file_link":[{"url":"http://www.bodden.de/pubs/lbb+15iccta.pdf"}],"title":"IccTA: Detecting Inter-Component Privacy Leaks in Android Apps","date_created":"2018-10-31T12:59:44Z","author":[{"first_name":"Li","full_name":"Li, Li","last_name":"Li"},{"full_name":"Bartel, Alexandre","last_name":"Bartel","first_name":"Alexandre"},{"first_name":"Tegawende F.","last_name":"Bissyande","full_name":"Bissyande, Tegawende F."},{"first_name":"Jacques","last_name":"Klein","full_name":"Klein, Jacques"},{"full_name":"Le Traon, Yves","last_name":"Le Traon","first_name":"Yves"},{"first_name":"Steven","last_name":"Arzt","full_name":"Arzt, Steven"},{"full_name":"Rasthofer, Siegfried","last_name":"Rasthofer","first_name":"Siegfried"},{"first_name":"Eric","last_name":"Bodden","orcid":"0000-0003-3470-3647","id":"59256","full_name":"Bodden, Eric"},{"first_name":"Damien","full_name":"Octeau, Damien","last_name":"Octeau"},{"last_name":"McDaniel","full_name":"McDaniel, Patrick","first_name":"Patrick"}],"date_updated":"2022-01-06T07:01:46Z","status":"public","file":[{"content_type":"application/pdf","relation":"main_file","success":1,"date_created":"2018-11-02T14:10:22Z","creator":"ups","date_updated":"2018-11-02T14:10:22Z","file_id":"5263","access_level":"closed","file_name":"lbb+15iccta.pdf","file_size":206378}],"publication":"2015 International Conference on Software Engineering (ICSE)","type":"conference","language":[{"iso":"eng"}],"file_date_updated":"2018-11-02T14:10:22Z","extern":"1","keyword":["CROSSING","ATTRACT","ITSECWEBSITE"],"ddc":["000"],"department":[{"_id":"76"}],"user_id":"477","_id":"5207","project":[{"_id":"1","name":"SFB 901"},{"_id":"3","name":"SFB 901 - Project Area B"},{"name":"SFB 901 - Subproject B4","_id":"12"}]},{"status":"public","type":"mastersthesis","language":[{"iso":"eng"}],"user_id":"477","department":[{"_id":"27"},{"_id":"518"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"14","name":"SFB 901 - Subproject C2"}],"_id":"5413","citation":{"chicago":"Funke, Lukas. <i>An LLVM Based Toolchain for Transparent Acceleration of Digital Image Processing Applications Using FPGA Overlay Architectures</i>. Universität Paderborn, 2015.","ieee":"L. Funke, <i>An LLVM Based Toolchain for Transparent Acceleration of Digital Image Processing Applications using FPGA Overlay Architectures</i>. Universität Paderborn, 2015.","ama":"Funke L. <i>An LLVM Based Toolchain for Transparent Acceleration of Digital Image Processing Applications Using FPGA Overlay Architectures</i>. Universität Paderborn; 2015.","apa":"Funke, L. (2015). <i>An LLVM Based Toolchain for Transparent Acceleration of Digital Image Processing Applications using FPGA Overlay Architectures</i>. Universität Paderborn.","mla":"Funke, Lukas. <i>An LLVM Based Toolchain for Transparent Acceleration of Digital Image Processing Applications Using FPGA Overlay Architectures</i>. Universität Paderborn, 2015.","bibtex":"@book{Funke_2015, title={An LLVM Based Toolchain for Transparent Acceleration of Digital Image Processing Applications using FPGA Overlay Architectures}, publisher={Universität Paderborn}, author={Funke, Lukas}, year={2015} }","short":"L. Funke, An LLVM Based Toolchain for Transparent Acceleration of Digital Image Processing Applications Using FPGA Overlay Architectures, Universität Paderborn, 2015."},"year":"2015","title":"An LLVM Based Toolchain for Transparent Acceleration of Digital Image Processing Applications using FPGA Overlay Architectures","date_created":"2018-11-07T15:10:35Z","supervisor":[{"first_name":"Christian","last_name":"Plessl","orcid":"0000-0001-5728-9982","id":"16153","full_name":"Plessl, Christian"}],"author":[{"first_name":"Lukas","full_name":"Funke, Lukas","last_name":"Funke"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T07:01:52Z"},{"type":"mastersthesis","status":"public","department":[{"_id":"27"},{"_id":"518"}],"user_id":"477","_id":"5416","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"14","name":"SFB 901 - Subproject C2"}],"language":[{"iso":"eng"}],"citation":{"short":"T. Löcke, Instance-Specific Computing in Hard- and Software for Faster Solving of Complex Problems, Universität Paderborn, 2015.","bibtex":"@book{Löcke_2015, title={Instance-Specific Computing in Hard- and Software for Faster Solving of Complex Problems}, publisher={Universität Paderborn}, author={Löcke, Thomas}, year={2015} }","mla":"Löcke, Thomas. <i>Instance-Specific Computing in Hard- and Software for Faster Solving of Complex Problems</i>. Universität Paderborn, 2015.","apa":"Löcke, T. (2015). <i>Instance-Specific Computing in Hard- and Software for Faster Solving of Complex Problems</i>. Universität Paderborn.","ama":"Löcke T. <i>Instance-Specific Computing in Hard- and Software for Faster Solving of Complex Problems</i>. Universität Paderborn; 2015.","chicago":"Löcke, Thomas. <i>Instance-Specific Computing in Hard- and Software for Faster Solving of Complex Problems</i>. Universität Paderborn, 2015.","ieee":"T. Löcke, <i>Instance-Specific Computing in Hard- and Software for Faster Solving of Complex Problems</i>. Universität Paderborn, 2015."},"year":"2015","date_created":"2018-11-07T16:06:53Z","supervisor":[{"first_name":"Christian","orcid":"0000-0001-5728-9982","last_name":"Plessl","id":"16153","full_name":"Plessl, Christian"}],"author":[{"first_name":"Thomas","last_name":"Löcke","full_name":"Löcke, Thomas"}],"date_updated":"2022-01-06T07:01:52Z","publisher":"Universität Paderborn","title":"Instance-Specific Computing in Hard- and Software for Faster Solving of Complex Problems"},{"author":[{"first_name":"Felix","full_name":"Wallaschek, Felix","last_name":"Wallaschek"}],"supervisor":[{"orcid":"0000-0001-5728-9982","last_name":"Plessl","full_name":"Plessl, Christian","id":"16153","first_name":"Christian"}],"date_created":"2018-11-07T16:14:30Z","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:01:52Z","title":"Accelerating Programmable Logic Controllers with the use of FPGAs","citation":{"apa":"Wallaschek, F. (2015). <i>Accelerating Programmable Logic Controllers with the use of FPGAs</i>. Universität Paderborn.","bibtex":"@book{Wallaschek_2015, title={Accelerating Programmable Logic Controllers with the use of FPGAs}, publisher={Universität Paderborn}, author={Wallaschek, Felix}, year={2015} }","short":"F. Wallaschek, Accelerating Programmable Logic Controllers with the Use of FPGAs, Universität Paderborn, 2015.","mla":"Wallaschek, Felix. <i>Accelerating Programmable Logic Controllers with the Use of FPGAs</i>. Universität Paderborn, 2015.","chicago":"Wallaschek, Felix. <i>Accelerating Programmable Logic Controllers with the Use of FPGAs</i>. Universität Paderborn, 2015.","ieee":"F. Wallaschek, <i>Accelerating Programmable Logic Controllers with the use of FPGAs</i>. Universität Paderborn, 2015.","ama":"Wallaschek F. <i>Accelerating Programmable Logic Controllers with the Use of FPGAs</i>. Universität Paderborn; 2015."},"year":"2015","department":[{"_id":"27"},{"_id":"518"}],"user_id":"477","_id":"5419","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"14","name":"SFB 901 - Subproject C2"}],"language":[{"iso":"eng"}],"type":"mastersthesis","status":"public"},{"page":"173-185","citation":{"apa":"Czerwinski, W., Martens, W., van Rooijen, L., &#38; Zeitoun, M. (2015). A Note on Decidable Separability by Piecewise Testable Languages. In <i>Fundamentals of Computation Theory - 20th International Symposium, (FCT) 2015, Gdańsk, Poland, August 17-19, 2015, Proceedings</i> (pp. 173–185). <a href=\"https://doi.org/10.1007/978-3-319-22177-9\\_14\">https://doi.org/10.1007/978-3-319-22177-9\\_14</a>","short":"W. Czerwinski, W. Martens, L. van Rooijen, M. Zeitoun, in: Fundamentals of Computation Theory - 20th International Symposium, (FCT) 2015, Gdańsk, Poland, August 17-19, 2015, Proceedings, 2015, pp. 173–185.","mla":"Czerwinski, Wojciech, et al. “A Note on Decidable Separability by Piecewise Testable Languages.” <i>Fundamentals of Computation Theory - 20th International Symposium, (FCT) 2015, Gdańsk, Poland, August 17-19, 2015, Proceedings</i>, 2015, pp. 173–85, doi:<a href=\"https://doi.org/10.1007/978-3-319-22177-9\\_14\">10.1007/978-3-319-22177-9\\_14</a>.","bibtex":"@inproceedings{Czerwinski_Martens_van Rooijen_Zeitoun_2015, title={A Note on Decidable Separability by Piecewise Testable Languages}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-22177-9\\_14\">10.1007/978-3-319-22177-9\\_14</a>}, booktitle={Fundamentals of Computation Theory - 20th International Symposium, (FCT) 2015, Gdańsk, Poland, August 17-19, 2015, Proceedings}, author={Czerwinski, Wojciech and Martens, Wim and van Rooijen, Lorijn and Zeitoun, Marc}, year={2015}, pages={173–185} }","ama":"Czerwinski W, Martens W, van Rooijen L, Zeitoun M. A Note on Decidable Separability by Piecewise Testable Languages. In: <i>Fundamentals of Computation Theory - 20th International Symposium, (FCT) 2015, Gdańsk, Poland, August 17-19, 2015, Proceedings</i>. ; 2015:173-185. doi:<a href=\"https://doi.org/10.1007/978-3-319-22177-9\\_14\">10.1007/978-3-319-22177-9\\_14</a>","ieee":"W. Czerwinski, W. Martens, L. van Rooijen, and M. Zeitoun, “A Note on Decidable Separability by Piecewise Testable Languages,” in <i>Fundamentals of Computation Theory - 20th International Symposium, (FCT) 2015, Gdańsk, Poland, August 17-19, 2015, Proceedings</i>, 2015, pp. 173–185.","chicago":"Czerwinski, Wojciech, Wim Martens, Lorijn van Rooijen, and Marc Zeitoun. “A Note on Decidable Separability by Piecewise Testable Languages.” In <i>Fundamentals of Computation Theory - 20th International Symposium, (FCT) 2015, Gdańsk, Poland, August 17-19, 2015, Proceedings</i>, 173–85, 2015. <a href=\"https://doi.org/10.1007/978-3-319-22177-9\\_14\">https://doi.org/10.1007/978-3-319-22177-9\\_14</a>."},"year":"2015","author":[{"full_name":"Czerwinski, Wojciech","last_name":"Czerwinski","first_name":"Wojciech"},{"first_name":"Wim","full_name":"Martens, Wim","last_name":"Martens"},{"full_name":"van Rooijen, Lorijn","id":"58843","last_name":"van Rooijen","first_name":"Lorijn"},{"last_name":"Zeitoun","full_name":"Zeitoun, Marc","first_name":"Marc"}],"date_created":"2019-01-15T10:01:56Z","date_updated":"2022-01-06T07:03:17Z","doi":"10.1007/978-3-319-22177-9\\_14","title":"A Note on Decidable Separability by Piecewise Testable Languages","publication":"Fundamentals of Computation Theory - 20th International Symposium, (FCT) 2015, Gdańsk, Poland, August 17-19, 2015, Proceedings","type":"conference","status":"public","department":[{"_id":"66"}],"user_id":"58843","_id":"6726","extern":"1","language":[{"iso":"eng"}]},{"publication":"arXiv:1510.05454","type":"preprint","status":"public","abstract":[{"text":"We consider the following variant of the two dimensional gathering problem\r\nfor swarms of robots: Given a swarm of $n$ indistinguishable, point shaped\r\nrobots on a two dimensional grid. Initially, the robots form a closed chain on\r\nthe grid and must keep this connectivity during the whole process of their\r\ngathering. Connectivity means, that neighboring robots of the chain need to be\r\npositioned at the same or neighboring points of the grid. In our model,\r\ngathering means to keep shortening the chain until the robots are located\r\ninside a $2\\times 2$ subgrid. Our model is completely local (no global control,\r\nno global coordinates, no compass, no global communication or vision, \\ldots).\r\nEach robot can only see its next constant number of left and right neighbors on\r\nthe chain. This fixed constant is called the \\emph{viewing path length}. All\r\nits operations and detections are restricted to this constant number of robots.\r\nOther robots, even if located at neighboring or the same grid point cannot be\r\ndetected. Only based on the relative positions of its detectable chain\r\nneighbors, a robot can decide to obtain a certain state. Based on this state\r\nand their local knowledge, the robots do local modifications to the chain by\r\nmoving to neighboring grid points without breaking the chain. These\r\nmodifications are performed without the knowledge whether they lead to a global\r\nprogress or not. We assume the fully synchronous $\\mathcal{FSYNC}$ model. For\r\nthis problem, we present a gathering algorithm which needs linear time. This\r\nresult generalizes the result from \\cite{hopper}, where an open chain with\r\nspecified distinguishable (and fixed) endpoints is considered.","lang":"eng"}],"department":[{"_id":"63"}],"user_id":"15415","external_id":{"arxiv":["1510.05454"]},"_id":"16449","language":[{"iso":"eng"}],"citation":{"apa":"Abshoff, S., Cord-Landwehr, A., Fischer, M., Jung, D., &#38; Meyer auf der Heide, F. (2015). Gathering a Closed Chain of Robots on a Grid. <i>ArXiv:1510.05454</i>.","short":"S. Abshoff, A. Cord-Landwehr, M. Fischer, D. Jung, F. Meyer auf der Heide, ArXiv:1510.05454 (2015).","bibtex":"@article{Abshoff_Cord-Landwehr_Fischer_Jung_Meyer auf der Heide_2015, title={Gathering a Closed Chain of Robots on a Grid}, journal={arXiv:1510.05454}, author={Abshoff, Sebastian and Cord-Landwehr, Andreas  and Fischer, Matthias and Jung, Daniel and Meyer auf der Heide, Friedhelm}, year={2015} }","mla":"Abshoff, Sebastian, et al. “Gathering a Closed Chain of Robots on a Grid.” <i>ArXiv:1510.05454</i>, 2015.","ama":"Abshoff S, Cord-Landwehr A, Fischer M, Jung D, Meyer auf der Heide F. Gathering a Closed Chain of Robots on a Grid. <i>arXiv:151005454</i>. 2015.","chicago":"Abshoff, Sebastian, Andreas  Cord-Landwehr, Matthias Fischer, Daniel Jung, and Friedhelm Meyer auf der Heide. “Gathering a Closed Chain of Robots on a Grid.” <i>ArXiv:1510.05454</i>, 2015.","ieee":"S. Abshoff, A. Cord-Landwehr, M. Fischer, D. Jung, and F. Meyer auf der Heide, “Gathering a Closed Chain of Robots on a Grid,” <i>arXiv:1510.05454</i>. 2015."},"year":"2015","date_created":"2020-04-07T07:20:46Z","author":[{"last_name":"Abshoff","full_name":"Abshoff, Sebastian","first_name":"Sebastian"},{"full_name":"Cord-Landwehr, Andreas ","last_name":"Cord-Landwehr","first_name":"Andreas "},{"first_name":"Matthias","last_name":"Fischer","full_name":"Fischer, Matthias","id":"146"},{"last_name":"Jung","id":"37827","full_name":"Jung, Daniel","first_name":"Daniel"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm"}],"date_updated":"2022-01-06T06:52:50Z","title":"Gathering a Closed Chain of Robots on a Grid"},{"citation":{"apa":"Abu-Khzam, F. N., Markarian, C., Meyer auf der Heide, F., &#38; Schubert, M. (2015). Approximation and Heuristic Algorithms for Computing Backbones in  Asymmetric Ad-Hoc Networks. <i>ArXiv:1510.01866</i>.","short":"F.N. Abu-Khzam, C. Markarian, F. Meyer auf der Heide, M. Schubert, ArXiv:1510.01866 (2015).","mla":"Abu-Khzam, Faisal N., et al. “Approximation and Heuristic Algorithms for Computing Backbones in  Asymmetric Ad-Hoc Networks.” <i>ArXiv:1510.01866</i>, 2015.","bibtex":"@article{Abu-Khzam_Markarian_Meyer auf der Heide_Schubert_2015, title={Approximation and Heuristic Algorithms for Computing Backbones in  Asymmetric Ad-Hoc Networks}, journal={arXiv:1510.01866}, author={Abu-Khzam, Faisal N.  and Markarian, Christine and Meyer auf der Heide, Friedhelm and Schubert, Michael}, year={2015} }","ama":"Abu-Khzam FN, Markarian C, Meyer auf der Heide F, Schubert M. Approximation and Heuristic Algorithms for Computing Backbones in  Asymmetric Ad-Hoc Networks. <i>arXiv:151001866</i>. 2015.","chicago":"Abu-Khzam, Faisal N. , Christine Markarian, Friedhelm Meyer auf der Heide, and Michael Schubert. “Approximation and Heuristic Algorithms for Computing Backbones in  Asymmetric Ad-Hoc Networks.” <i>ArXiv:1510.01866</i>, 2015.","ieee":"F. N. Abu-Khzam, C. Markarian, F. Meyer auf der Heide, and M. Schubert, “Approximation and Heuristic Algorithms for Computing Backbones in  Asymmetric Ad-Hoc Networks,” <i>arXiv:1510.01866</i>. 2015."},"year":"2015","title":"Approximation and Heuristic Algorithms for Computing Backbones in  Asymmetric Ad-Hoc Networks","author":[{"first_name":"Faisal N. ","full_name":"Abu-Khzam, Faisal N. ","last_name":"Abu-Khzam"},{"last_name":"Markarian","full_name":"Markarian, Christine","id":"37612","first_name":"Christine"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm"},{"first_name":"Michael","last_name":"Schubert","full_name":"Schubert, Michael"}],"date_created":"2020-04-07T12:22:48Z","date_updated":"2022-01-06T06:52:50Z","status":"public","abstract":[{"lang":"eng","text":"We consider the problem of dominating set-based virtual backbone used for\r\nrouting in asymmetric wireless ad-hoc networks. These networks have non-uniform\r\ntransmission ranges and are modeled using the well-established disk graphs. The\r\ncorresponding graph theoretic problem seeks a strongly connected\r\ndominating-absorbent set of minimum cardinality in a digraph. A subset of nodes\r\nin a digraph is a strongly connected dominating-absorbent set if the subgraph\r\ninduced by these nodes is strongly connected and each node in the graph is\r\neither in the set or has both an in-neighbor and an out-neighbor in it.\r\nDistributed algorithms for this problem are of practical significance due to\r\nthe dynamic nature of ad-hoc networks. We present a first distributed\r\napproximation algorithm, with a constant approximation factor and O(Diam)\r\nrunning time, where Diam is the diameter of the graph. Moreover we present a\r\nsimple heuristic algorithm and conduct an extensive simulation study showing\r\nthat our heuristic outperforms previously known approaches for the problem."}],"type":"preprint","publication":"arXiv:1510.01866","language":[{"iso":"eng"}],"user_id":"15415","department":[{"_id":"63"}],"external_id":{"arxiv":["1510.01866"]},"_id":"16452"},{"language":[{"iso":"eng"}],"user_id":"15415","department":[{"_id":"63"}],"external_id":{"arxiv":["1410.7912"]},"_id":"16460","status":"public","abstract":[{"lang":"eng","text":"Consider n nodes connected to a single coordinator. Each node receives an\r\nindividual online data stream of numbers and, at any point in time, the\r\ncoordinator has to know the k nodes currently observing the largest values, for\r\na given k between 1 and n. We design and analyze an algorithm that solves this\r\nproblem while bounding the amount of messages exchanged between the nodes and\r\nthe coordinator. Our algorithm employs the idea of using filters which,\r\nintuitively speaking, leads to few messages to be sent, if the new input is\r\n\"similar\" to the previous ones. The algorithm uses a number of messages that is\r\non expectation by a factor of O((log {\\Delta} + k) log n) larger than that of\r\nan offline algorithm that sets filters in an optimal way, where {\\Delta} is\r\nupper bounded by the largest value observed by any node."}],"type":"conference","publication":"Proceedings of the 29th International Parallel and Distributed Processing Symposium (IPDPS)","doi":"10.1109/IPDPS.2015.40","title":"Online Top-k-Position Monitoring of Distributed Data Streams","date_created":"2020-04-08T07:02:15Z","author":[{"first_name":"Alexander","last_name":"Mäcker","full_name":"Mäcker, Alexander"},{"first_name":"Manuel","last_name":"Malatyali","full_name":"Malatyali, Manuel"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"publisher":"IEEE","date_updated":"2022-01-06T06:52:50Z","citation":{"chicago":"Mäcker, Alexander, Manuel Malatyali, and Friedhelm Meyer auf der Heide. “Online Top-k-Position Monitoring of Distributed Data Streams.” In <i>Proceedings of the 29th International Parallel and Distributed Processing Symposium (IPDPS)</i>, 357–64. IEEE, 2015. <a href=\"https://doi.org/10.1109/IPDPS.2015.40\">https://doi.org/10.1109/IPDPS.2015.40</a>.","ieee":"A. Mäcker, M. Malatyali, and F. Meyer auf der Heide, “Online Top-k-Position Monitoring of Distributed Data Streams,” in <i>Proceedings of the 29th International Parallel and Distributed Processing Symposium (IPDPS)</i>, 2015, pp. 357–364.","ama":"Mäcker A, Malatyali M, Meyer auf der Heide F. Online Top-k-Position Monitoring of Distributed Data Streams. In: <i>Proceedings of the 29th International Parallel and Distributed Processing Symposium (IPDPS)</i>. IEEE; 2015:357-364. doi:<a href=\"https://doi.org/10.1109/IPDPS.2015.40\">10.1109/IPDPS.2015.40</a>","apa":"Mäcker, A., Malatyali, M., &#38; Meyer auf der Heide, F. (2015). Online Top-k-Position Monitoring of Distributed Data Streams. In <i>Proceedings of the 29th International Parallel and Distributed Processing Symposium (IPDPS)</i> (pp. 357–364). IEEE. <a href=\"https://doi.org/10.1109/IPDPS.2015.40\">https://doi.org/10.1109/IPDPS.2015.40</a>","bibtex":"@inproceedings{Mäcker_Malatyali_Meyer auf der Heide_2015, title={Online Top-k-Position Monitoring of Distributed Data Streams}, DOI={<a href=\"https://doi.org/10.1109/IPDPS.2015.40\">10.1109/IPDPS.2015.40</a>}, booktitle={Proceedings of the 29th International Parallel and Distributed Processing Symposium (IPDPS)}, publisher={IEEE}, author={Mäcker, Alexander and Malatyali, Manuel and Meyer auf der Heide, Friedhelm}, year={2015}, pages={357–364} }","mla":"Mäcker, Alexander, et al. “Online Top-k-Position Monitoring of Distributed Data Streams.” <i>Proceedings of the 29th International Parallel and Distributed Processing Symposium (IPDPS)</i>, IEEE, 2015, pp. 357–64, doi:<a href=\"https://doi.org/10.1109/IPDPS.2015.40\">10.1109/IPDPS.2015.40</a>.","short":"A. Mäcker, M. Malatyali, F. Meyer auf der Heide, in: Proceedings of the 29th International Parallel and Distributed Processing Symposium (IPDPS), IEEE, 2015, pp. 357–364."},"page":"357-364","year":"2015"},{"title":"Self-Optimizing Organic Cache","author":[{"first_name":"Abdullah Fathi","last_name":"Ahmed","full_name":"Ahmed, Abdullah Fathi"}],"date_created":"2019-07-10T09:25:13Z","supervisor":[{"full_name":"Kaufmann, Paul","last_name":"Kaufmann","first_name":"Paul"}],"date_updated":"2022-01-06T06:50:47Z","publisher":"Paderborn University","citation":{"ieee":"A. F. Ahmed, <i>Self-Optimizing Organic Cache</i>. Paderborn University, 2015.","chicago":"Ahmed, Abdullah Fathi. <i>Self-Optimizing Organic Cache</i>. Paderborn University, 2015.","ama":"Ahmed AF. <i>Self-Optimizing Organic Cache</i>. Paderborn University; 2015.","apa":"Ahmed, A. F. (2015). <i>Self-Optimizing Organic Cache</i>. Paderborn University.","short":"A.F. Ahmed, Self-Optimizing Organic Cache, Paderborn University, 2015.","bibtex":"@book{Ahmed_2015, title={Self-Optimizing Organic Cache}, publisher={Paderborn University}, author={Ahmed, Abdullah Fathi}, year={2015} }","mla":"Ahmed, Abdullah Fathi. <i>Self-Optimizing Organic Cache</i>. Paderborn University, 2015."},"year":"2015","language":[{"iso":"eng"}],"department":[{"_id":"78"}],"user_id":"3118","_id":"10615","status":"public","type":"mastersthesis"},{"title":"Management and Scheduling of Accelerators for Heterogeneous High-Performance Computing","publisher":"Logos Verlag Berlin GmbH","date_updated":"2022-01-06T06:50:48Z","author":[{"last_name":"Beisel","full_name":"Beisel, Tobias","first_name":"Tobias"}],"supervisor":[{"last_name":"Plessl","orcid":"0000-0001-5728-9982","full_name":"Plessl, Christian","id":"16153","first_name":"Christian"}],"date_created":"2019-07-10T09:36:58Z","place":"Berlin","year":"2015","page":"183","citation":{"ieee":"T. Beisel, <i>Management and Scheduling of Accelerators for Heterogeneous High-Performance Computing</i>. Berlin: Logos Verlag Berlin GmbH, 2015.","chicago":"Beisel, Tobias. <i>Management and Scheduling of Accelerators for Heterogeneous High-Performance Computing</i>. Berlin: Logos Verlag Berlin GmbH, 2015.","ama":"Beisel T. <i>Management and Scheduling of Accelerators for Heterogeneous High-Performance Computing</i>. Berlin: Logos Verlag Berlin GmbH; 2015.","short":"T. Beisel, Management and Scheduling of Accelerators for Heterogeneous High-Performance Computing, Logos Verlag Berlin GmbH, Berlin, 2015.","bibtex":"@book{Beisel_2015, place={Berlin}, title={Management and Scheduling of Accelerators for Heterogeneous High-Performance Computing}, publisher={Logos Verlag Berlin GmbH}, author={Beisel, Tobias}, year={2015} }","mla":"Beisel, Tobias. <i>Management and Scheduling of Accelerators for Heterogeneous High-Performance Computing</i>. Logos Verlag Berlin GmbH, 2015.","apa":"Beisel, T. (2015). <i>Management and Scheduling of Accelerators for Heterogeneous High-Performance Computing</i>. Berlin: Logos Verlag Berlin GmbH."},"publication_identifier":{"isbn":["978-3-8325-4155-2"]},"language":[{"iso":"eng"}],"_id":"10624","project":[{"name":"Enabling Heterogeneous Hardware Acceleration using Novel Programming and Scheduling Models","_id":"30","grant_number":"01|H11004"}],"department":[{"_id":"78"},{"_id":"27"},{"_id":"518"}],"user_id":"3118","abstract":[{"lang":"eng","text":"The use of heterogeneous computing resources, such as graphics processing units or other specialized co-processors, has become widespread in recent years because of their performance and energy efficiency advantages. Operating system approaches that are limited to optimizing CPU usage are no longer sufficient for the efficient utilization of systems that comprise diverse resource types.\r\n\r\nEnabling task preemption on these architectures and migration of tasks between different resource types at run-time is not only key to improving the performance and energy consumption but also to enabling automatic scheduling methods for heterogeneous compute nodes.\r\n\r\nThis thesis proposes novel techniques for run-time management of heterogeneous resources and enabling tasks to migrate between diverse hardware. It provides fundamental work towards future operating systems by discussing implications, limitations, and chances of the heterogeneity and introducing solutions for energy- and performance-efficient run-time systems. Scheduling methods to utilize heterogeneous systems by the use of a centralized scheduler are presented that show benefits over existing approaches in varying case studies."}],"status":"public","type":"dissertation"},{"year":"2015","citation":{"chicago":"Hangmann, Hendrik. <i>Evolution of Heat Flow Prediction Models for FPGA Devices</i>. Paderborn University, 2015.","ieee":"H. Hangmann, <i>Evolution of Heat Flow Prediction Models for FPGA Devices</i>. Paderborn University, 2015.","ama":"Hangmann H. <i>Evolution of Heat Flow Prediction Models for FPGA Devices</i>. Paderborn University; 2015.","short":"H. Hangmann, Evolution of Heat Flow Prediction Models for FPGA Devices, Paderborn University, 2015.","bibtex":"@book{Hangmann_2015, title={Evolution of Heat Flow Prediction Models for FPGA Devices}, publisher={Paderborn University}, author={Hangmann, Hendrik}, year={2015} }","mla":"Hangmann, Hendrik. <i>Evolution of Heat Flow Prediction Models for FPGA Devices</i>. Paderborn University, 2015.","apa":"Hangmann, H. (2015). <i>Evolution of Heat Flow Prediction Models for FPGA Devices</i>. Paderborn University."},"date_updated":"2022-01-06T06:50:49Z","publisher":"Paderborn University","author":[{"full_name":"Hangmann, Hendrik","last_name":"Hangmann","first_name":"Hendrik"}],"date_created":"2019-07-10T11:15:13Z","supervisor":[{"first_name":"Paul","last_name":"Kaufmann","full_name":"Kaufmann, Paul"}],"title":"Evolution of Heat Flow Prediction Models for FPGA Devices","type":"mastersthesis","status":"public","_id":"10668","department":[{"_id":"78"}],"user_id":"3118","language":[{"iso":"eng"}]},{"date_updated":"2022-01-06T06:50:49Z","publisher":"Paderborn University","date_created":"2019-07-10T11:17:57Z","supervisor":[{"last_name":"Boschmann","full_name":"Boschmann, Alexander","first_name":"Alexander"}],"author":[{"last_name":"Haupt","full_name":"Haupt, Christian","first_name":"Christian"}],"title":"Computer Vision basierte Klassifikation von HD EMG Signalen","year":"2015","citation":{"apa":"Haupt, C. (2015). <i>Computer Vision basierte Klassifikation von HD EMG Signalen</i>. Paderborn University.","short":"C. Haupt, Computer Vision Basierte Klassifikation von HD EMG Signalen, Paderborn University, 2015.","mla":"Haupt, Christian. <i>Computer Vision Basierte Klassifikation von HD EMG Signalen</i>. Paderborn University, 2015.","bibtex":"@book{Haupt_2015, title={Computer Vision basierte Klassifikation von HD EMG Signalen}, publisher={Paderborn University}, author={Haupt, Christian}, year={2015} }","chicago":"Haupt, Christian. <i>Computer Vision Basierte Klassifikation von HD EMG Signalen</i>. Paderborn University, 2015.","ieee":"C. Haupt, <i>Computer Vision basierte Klassifikation von HD EMG Signalen</i>. Paderborn University, 2015.","ama":"Haupt C. <i>Computer Vision Basierte Klassifikation von HD EMG Signalen</i>. Paderborn University; 2015."},"_id":"10671","user_id":"3118","department":[{"_id":"78"}],"language":[{"iso":"eng"}],"type":"mastersthesis","status":"public"},{"_id":"10673","project":[{"_id":"31","name":"Engineering Proprioception in Computing Systems","grant_number":"257906"}],"department":[{"_id":"78"}],"user_id":"3118","keyword":["cache storage","field programmable gate arrays","multiprocessing systems","parallel architectures","reconfigurable architectures","FPGA","dynamic reconfiguration","evolvable cache mapping","many-core architecture","memory-to-cache address mapping function","microarchitectural optimization","multicore architecture","nature-inspired optimization","parallelization degrees","processor","reconfigurable cache mapping","reconfigurable computing","Field programmable gate arrays","Software","Tuning"],"language":[{"iso":"eng"}],"publication":"Proc. NASA/ESA Conf. Adaptive Hardware and Systems (AHS)","type":"conference","status":"public","date_updated":"2022-01-06T06:50:49Z","date_created":"2019-07-10T11:18:00Z","author":[{"full_name":"Ho, Nam","last_name":"Ho","first_name":"Nam"},{"first_name":"Abdullah Fathi","full_name":"Ahmed, Abdullah Fathi","last_name":"Ahmed"},{"first_name":"Paul","full_name":"Kaufmann, Paul","last_name":"Kaufmann"},{"id":"398","full_name":"Platzner, Marco","last_name":"Platzner","first_name":"Marco"}],"title":"Microarchitectural optimization by means of reconfigurable and evolvable cache mappings","doi":"10.1109/AHS.2015.7231178","year":"2015","page":"1-7","citation":{"short":"N. Ho, A.F. Ahmed, P. Kaufmann, M. Platzner, in: Proc. NASA/ESA Conf. Adaptive Hardware and Systems (AHS), 2015, pp. 1–7.","mla":"Ho, Nam, et al. “Microarchitectural Optimization by Means of Reconfigurable and Evolvable Cache Mappings.” <i>Proc. NASA/ESA Conf. Adaptive Hardware and Systems (AHS)</i>, 2015, pp. 1–7, doi:<a href=\"https://doi.org/10.1109/AHS.2015.7231178\">10.1109/AHS.2015.7231178</a>.","bibtex":"@inproceedings{Ho_Ahmed_Kaufmann_Platzner_2015, title={Microarchitectural optimization by means of reconfigurable and evolvable cache mappings}, DOI={<a href=\"https://doi.org/10.1109/AHS.2015.7231178\">10.1109/AHS.2015.7231178</a>}, booktitle={Proc. NASA/ESA Conf. Adaptive Hardware and Systems (AHS)}, author={Ho, Nam and Ahmed, Abdullah Fathi and Kaufmann, Paul and Platzner, Marco}, year={2015}, pages={1–7} }","apa":"Ho, N., Ahmed, A. F., Kaufmann, P., &#38; Platzner, M. (2015). Microarchitectural optimization by means of reconfigurable and evolvable cache mappings. In <i>Proc. NASA/ESA Conf. Adaptive Hardware and Systems (AHS)</i> (pp. 1–7). <a href=\"https://doi.org/10.1109/AHS.2015.7231178\">https://doi.org/10.1109/AHS.2015.7231178</a>","ama":"Ho N, Ahmed AF, Kaufmann P, Platzner M. Microarchitectural optimization by means of reconfigurable and evolvable cache mappings. In: <i>Proc. NASA/ESA Conf. Adaptive Hardware and Systems (AHS)</i>. ; 2015:1-7. doi:<a href=\"https://doi.org/10.1109/AHS.2015.7231178\">10.1109/AHS.2015.7231178</a>","chicago":"Ho, Nam, Abdullah Fathi Ahmed, Paul Kaufmann, and Marco Platzner. “Microarchitectural Optimization by Means of Reconfigurable and Evolvable Cache Mappings.” In <i>Proc. NASA/ESA Conf. Adaptive Hardware and Systems (AHS)</i>, 1–7, 2015. <a href=\"https://doi.org/10.1109/AHS.2015.7231178\">https://doi.org/10.1109/AHS.2015.7231178</a>.","ieee":"N. Ho, A. F. Ahmed, P. Kaufmann, and M. Platzner, “Microarchitectural optimization by means of reconfigurable and evolvable cache mappings,” in <i>Proc. NASA/ESA Conf. Adaptive Hardware and Systems (AHS)</i>, 2015, pp. 1–7."}}]