[{"citation":{"mla":"Bar-Yehuda, Reuven, et al. “Bandwidth Allocation in Cellular Networks with Multiple Interferences.” <i>Discrete Applied Mathematics </i>, vol. 194, Elsevier, 2015, pp. 23–36, doi:<a href=\"http://dx.doi.org/10.1016/j.dam.2015.05.013\">http://dx.doi.org/10.1016/j.dam.2015.05.013</a>.","ama":"Bar-Yehuda R, Polevoy G, Rawitz D. Bandwidth allocation in cellular networks with multiple interferences. <i>Discrete Applied Mathematics </i>. 2015;194:23-36. doi:<a href=\"http://dx.doi.org/10.1016/j.dam.2015.05.013\">http://dx.doi.org/10.1016/j.dam.2015.05.013</a>","bibtex":"@article{Bar-Yehuda_Polevoy_Rawitz_2015, title={Bandwidth allocation in cellular networks with multiple interferences}, volume={194}, DOI={<a href=\"http://dx.doi.org/10.1016/j.dam.2015.05.013\">http://dx.doi.org/10.1016/j.dam.2015.05.013</a>}, journal={Discrete Applied Mathematics }, publisher={Elsevier}, author={Bar-Yehuda, Reuven and Polevoy, Gleb and Rawitz, Dror}, year={2015}, pages={23–36} }","apa":"Bar-Yehuda, R., Polevoy, G., &#38; Rawitz, D. (2015). Bandwidth allocation in cellular networks with multiple interferences. <i>Discrete Applied Mathematics </i>, <i>194</i>, 23–36. <a href=\"http://dx.doi.org/10.1016/j.dam.2015.05.013\">http://dx.doi.org/10.1016/j.dam.2015.05.013</a>","ieee":"R. Bar-Yehuda, G. Polevoy, and D. Rawitz, “Bandwidth allocation in cellular networks with multiple interferences,” <i>Discrete Applied Mathematics </i>, vol. 194, pp. 23–36, 2015.","short":"R. Bar-Yehuda, G. Polevoy, D. Rawitz, Discrete Applied Mathematics  194 (2015) 23–36.","chicago":"Bar-Yehuda, Reuven, Gleb Polevoy, and Dror Rawitz. “Bandwidth Allocation in Cellular Networks with Multiple Interferences.” <i>Discrete Applied Mathematics </i> 194 (2015): 23–36. <a href=\"http://dx.doi.org/10.1016/j.dam.2015.05.013\">http://dx.doi.org/10.1016/j.dam.2015.05.013</a>."},"volume":194,"user_id":"83983","publisher":"Elsevier","_id":"17658","page":"23 - 36","status":"public","department":[{"_id":"63"},{"_id":"541"}],"keyword":["Local ratio"],"type":"journal_article","date_created":"2020-08-06T15:21:15Z","abstract":[{"text":"Abstract We study the problem of bandwidth allocation with multiple interferences. In this problem the input consists of a set of users and a set of base stations. Each user has a list of requests, each consisting of a base station, a frequency demand, and a profit that may be gained by scheduling this request. The goal is to find a maximum profit set of user requests S that satisfies the following conditions: (i) S contains at most one request per user, (ii) the frequency sets allotted to requests in S that correspond to the same base station are pairwise non-intersecting, and (iii) the QoS received by any user at any frequency is reasonable according to an interference model. In this paper we consider two variants of bandwidth allocation with multiple interferences. In the first each request specifies a demand that can be satisfied by any subset of frequencies that is large enough. In the second each request specifies a specific frequency interval. Furthermore, we consider two interference models, multiplicative and additive. We show that these problems are extremely hard to approximate if the interferences depend on both the interfered and the interfering base stations. On the other hand, we provide constant factor approximation algorithms for both variants of bandwidth allocation with multiple interferences for the case where the interferences depend only on the interfering base stations. We also consider a restrictive special case that is closely related to the Knapsack problem. We show that this special case is NP-hard and that it admits an FPTAS. ","lang":"eng"}],"extern":"1","publication":"Discrete Applied Mathematics ","doi":"http://dx.doi.org/10.1016/j.dam.2015.05.013","language":[{"iso":"eng"}],"intvolume":"       194","date_updated":"2022-01-06T06:53:16Z","publication_identifier":{"issn":["0166-218X"]},"author":[{"last_name":"Bar-Yehuda","first_name":"Reuven","full_name":"Bar-Yehuda, Reuven"},{"id":"83983","full_name":"Polevoy, Gleb","last_name":"Polevoy","first_name":"Gleb"},{"last_name":"Rawitz","first_name":"Dror","full_name":"Rawitz, Dror"}],"title":"Bandwidth allocation in cellular networks with multiple interferences","year":"2015"},{"publication":"IEEE Computer","issue":"7","department":[{"_id":"27"},{"_id":"518"},{"_id":"78"}],"keyword":["self-awareness","self-expression"],"type":"journal_article","date_created":"2018-03-23T14:06:12Z","file":[{"date_updated":"2018-11-02T15:47:45Z","relation":"main_file","file_size":5605009,"access_level":"closed","file_name":"07163237.pdf","content_type":"application/pdf","success":1,"file_id":"5313","creator":"ups","date_created":"2018-11-02T15:47:45Z"}],"intvolume":"        48","date_updated":"2022-01-06T06:53:19Z","author":[{"first_name":"Jim","last_name":"Torresen","full_name":"Torresen, Jim"},{"id":"16153","full_name":"Plessl, Christian","orcid":"0000-0001-5728-9982","last_name":"Plessl","first_name":"Christian"},{"first_name":"Xin","last_name":"Yao","full_name":"Yao, Xin"}],"title":"Self-Aware and Self-Expressive Systems – Guest Editor's Introduction","year":"2015","doi":"10.1109/MC.2015.205","language":[{"iso":"eng"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Subproject C2","_id":"14"},{"_id":"34","grant_number":"610996","name":"Self-Adaptive Virtualisation-Aware High-Performance/Low-Energy Heterogeneous System Architectures"}],"citation":{"chicago":"Torresen, Jim, Christian Plessl, and Xin Yao. “Self-Aware and Self-Expressive Systems – Guest Editor’s Introduction.” <i>IEEE Computer</i> 48, no. 7 (2015): 18–20. <a href=\"https://doi.org/10.1109/MC.2015.205\">https://doi.org/10.1109/MC.2015.205</a>.","short":"J. Torresen, C. Plessl, X. Yao, IEEE Computer 48 (2015) 18–20.","ieee":"J. Torresen, C. Plessl, and X. Yao, “Self-Aware and Self-Expressive Systems – Guest Editor’s Introduction,” <i>IEEE Computer</i>, vol. 48, no. 7, pp. 18–20, 2015.","apa":"Torresen, J., Plessl, C., &#38; Yao, X. (2015). Self-Aware and Self-Expressive Systems – Guest Editor’s Introduction. <i>IEEE Computer</i>, <i>48</i>(7), 18–20. <a href=\"https://doi.org/10.1109/MC.2015.205\">https://doi.org/10.1109/MC.2015.205</a>","bibtex":"@article{Torresen_Plessl_Yao_2015, title={Self-Aware and Self-Expressive Systems – Guest Editor’s Introduction}, volume={48}, DOI={<a href=\"https://doi.org/10.1109/MC.2015.205\">10.1109/MC.2015.205</a>}, number={7}, journal={IEEE Computer}, publisher={IEEE Computer Society}, author={Torresen, Jim and Plessl, Christian and Yao, Xin}, year={2015}, pages={18–20} }","ama":"Torresen J, Plessl C, Yao X. Self-Aware and Self-Expressive Systems – Guest Editor’s Introduction. <i>IEEE Computer</i>. 2015;48(7):18-20. doi:<a href=\"https://doi.org/10.1109/MC.2015.205\">10.1109/MC.2015.205</a>","mla":"Torresen, Jim, et al. “Self-Aware and Self-Expressive Systems – Guest Editor’s Introduction.” <i>IEEE Computer</i>, vol. 48, no. 7, IEEE Computer Society, 2015, pp. 18–20, doi:<a href=\"https://doi.org/10.1109/MC.2015.205\">10.1109/MC.2015.205</a>."},"file_date_updated":"2018-11-02T15:47:45Z","has_accepted_license":"1","status":"public","volume":48,"user_id":"16153","ddc":["000"],"_id":"1772","publisher":"IEEE Computer Society","page":"18-20"},{"department":[{"_id":"27"},{"_id":"518"}],"type":"mastersthesis","place":"Paderborn","date_created":"2018-03-26T15:24:10Z","abstract":[{"text":"Demands for computational power and energy efficiency of computing devices are steadily increasing. At the same time, following classic methods to increase speed and reduce energy consumption of these devices becomes increasingly difficult, bringing alternative methods into focus. One of these methods is approximate computing which utilizes the fact that small errors in computations are acceptable in many applications in order to allow acceleration of these computations or to increase energy efficiency. This thesis develops elements of a workflow that can be followed to apply approximate computing to existing applications. It proposes a novel heuristic approach to the localization of code paths that are suitable to approximate computing based on findings in recent research. Additionally, an approach to identification of approximable instructions within these code paths is proposed and used to implement simulation of approximation. The parts of the workflow are implemented with the goal to lay the foundation for a partly automated toolflow. Evaluation of the developed techniques shows that the proposed methods can help providing a convenient workflow, facilitating the first steps into the application of approximate computing.","lang":"eng"}],"supervisor":[{"orcid":"0000-0001-5728-9982","last_name":"Plessl","first_name":"Christian","full_name":"Plessl, Christian","id":"16153"}],"citation":{"bibtex":"@book{Lass_2015, place={Paderborn}, title={Localization and Analysis of Code Paths Suitable for Acceleration using Approximate Computing}, publisher={Paderborn University}, author={Lass, Michael}, year={2015} }","ama":"Lass M. <i>Localization and Analysis of Code Paths Suitable for Acceleration Using Approximate Computing</i>. Paderborn: Paderborn University; 2015.","mla":"Lass, Michael. <i>Localization and Analysis of Code Paths Suitable for Acceleration Using Approximate Computing</i>. Paderborn University, 2015.","chicago":"Lass, Michael. <i>Localization and Analysis of Code Paths Suitable for Acceleration Using Approximate Computing</i>. Paderborn: Paderborn University, 2015.","short":"M. Lass, Localization and Analysis of Code Paths Suitable for Acceleration Using Approximate Computing, Paderborn University, Paderborn, 2015.","ieee":"M. Lass, <i>Localization and Analysis of Code Paths Suitable for Acceleration using Approximate Computing</i>. Paderborn: Paderborn University, 2015.","apa":"Lass, M. (2015). <i>Localization and Analysis of Code Paths Suitable for Acceleration using Approximate Computing</i>. Paderborn: Paderborn University."},"user_id":"24135","_id":"1794","publisher":"Paderborn University","date_updated":"2022-01-06T06:53:23Z","author":[{"id":"24135","last_name":"Lass","orcid":"0000-0002-5708-7632","first_name":"Michael","full_name":"Lass, Michael"}],"status":"public","title":"Localization and Analysis of Code Paths Suitable for Acceleration using Approximate Computing","year":"2015"},{"citation":{"bibtex":"@inproceedings{Heindorf_Potthast_Stein_Engels_2015, title={Towards Vandalism Detection in Knowledge Bases: Corpus Construction and Analysis}, DOI={<a href=\"https://doi.org/10.1145/2766462.2767804\">10.1145/2766462.2767804</a>}, booktitle={Proceedings of the 38th International ACM Conference on Research and Development in Information Retrieval (SIGIR 15)}, author={Heindorf, Stefan and Potthast, Martin and Stein, Benno and Engels, Gregor}, year={2015}, pages={831--834} }","ama":"Heindorf S, Potthast M, Stein B, Engels G. Towards Vandalism Detection in Knowledge Bases: Corpus Construction and Analysis. In: <i>Proceedings of the 38th International ACM Conference on Research and Development in Information Retrieval (SIGIR 15)</i>. ; 2015:831--834. doi:<a href=\"https://doi.org/10.1145/2766462.2767804\">10.1145/2766462.2767804</a>","short":"S. Heindorf, M. Potthast, B. Stein, G. Engels, in: Proceedings of the 38th International ACM Conference on Research and Development in Information Retrieval (SIGIR 15), 2015, pp. 831--834.","chicago":"Heindorf, Stefan, Martin Potthast, Benno Stein, and Gregor Engels. “Towards Vandalism Detection in Knowledge Bases: Corpus Construction and Analysis.” In <i>Proceedings of the 38th International ACM Conference on Research and Development in Information Retrieval (SIGIR 15)</i>, 831--834, 2015. <a href=\"https://doi.org/10.1145/2766462.2767804\">https://doi.org/10.1145/2766462.2767804</a>.","ieee":"S. Heindorf, M. Potthast, B. Stein, and G. Engels, “Towards Vandalism Detection in Knowledge Bases: Corpus Construction and Analysis,” in <i>Proceedings of the 38th International ACM Conference on Research and Development in Information Retrieval (SIGIR 15)</i>, 2015, pp. 831--834.","mla":"Heindorf, Stefan, et al. “Towards Vandalism Detection in Knowledge Bases: Corpus Construction and Analysis.” <i>Proceedings of the 38th International ACM Conference on Research and Development in Information Retrieval (SIGIR 15)</i>, 2015, pp. 831--834, doi:<a href=\"https://doi.org/10.1145/2766462.2767804\">10.1145/2766462.2767804</a>.","apa":"Heindorf, S., Potthast, M., Stein, B., &#38; Engels, G. (2015). Towards Vandalism Detection in Knowledge Bases: Corpus Construction and Analysis. In <i>Proceedings of the 38th International ACM Conference on Research and Development in Information Retrieval (SIGIR 15)</i> (pp. 831--834). <a href=\"https://doi.org/10.1145/2766462.2767804\">https://doi.org/10.1145/2766462.2767804</a>"},"file_date_updated":"2018-03-21T10:29:18Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C5","_id":"17"},{"name":"SFB 901 - Project Area C","_id":"4"}],"status":"public","has_accepted_license":"1","_id":"239","page":"831--834","user_id":"477","ddc":["040"],"publication":"Proceedings of the 38th International ACM Conference on Research and Development in Information Retrieval (SIGIR 15)","abstract":[{"text":"We report on the construction of the Wikidata Vandalism Corpus WDVC-2015, the first corpus for vandalism in knowledge bases. Our corpus is based on the entire revision history of Wikidata, the knowledge base underlying Wikipedia. Among Wikidata's 24 million manual revisions, we have identified more than 100,000 cases of vandalism. An in-depth corpus analysis lays the groundwork for research and development on automatic vandalism detection in public knowledge bases. Our analysis shows that 58% of the vandalism revisions can be found in the textual portions of Wikidata, and the remainder in structural content, e.g., subject-predicate-object triples. Moreover, we find that some vandals also target Wikidata content whose manipulation may impact content displayed on Wikipedia, revealing potential vulnerabilities. Given today's importance of knowledge bases for information systems, this shows that public knowledge bases must be used with caution.","lang":"eng"}],"date_created":"2017-10-17T12:41:38Z","file":[{"content_type":"application/pdf","success":1,"file_id":"1499","date_updated":"2018-03-21T10:29:18Z","relation":"main_file","file_size":735898,"access_level":"closed","file_name":"239-p831-heindorf.pdf","date_created":"2018-03-21T10:29:18Z","creator":"florida"}],"department":[{"_id":"66"}],"type":"conference","author":[{"full_name":"Heindorf, Stefan","first_name":"Stefan","last_name":"Heindorf"},{"first_name":"Martin","last_name":"Potthast","full_name":"Potthast, Martin"},{"first_name":"Benno","last_name":"Stein","full_name":"Stein, Benno"},{"full_name":"Engels, Gregor","last_name":"Engels","first_name":"Gregor","id":"107"}],"title":"Towards Vandalism Detection in Knowledge Bases: Corpus Construction and Analysis","year":"2015","date_updated":"2022-01-06T06:56:04Z","language":[{"iso":"eng"}],"doi":"10.1145/2766462.2767804"},{"series_title":"Lecture Notes in Computer Science","doi":"10.1007/978-3-319-21398-9_22","author":[{"full_name":"Li, Shouwei","last_name":"Li","first_name":"Shouwei"},{"id":"13536","full_name":"Mäcker, Alexander","last_name":"Mäcker","first_name":"Alexander"},{"id":"37612","last_name":"Markarian","first_name":"Christine","full_name":"Markarian, Christine"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523"},{"full_name":"Riechers, Sören","first_name":"Sören","last_name":"Riechers"}],"title":"Towards Flexible Demands in Online Leasing Problems","year":"2015","date_updated":"2022-01-06T06:56:05Z","date_created":"2017-10-17T12:41:38Z","file":[{"creator":"florida","date_created":"2018-03-21T10:28:50Z","date_updated":"2018-03-21T10:28:50Z","relation":"main_file","access_level":"closed","file_size":264482,"file_name":"240-chp_3A10.1007_2F978-3-319-21398-9_22.pdf","content_type":"application/pdf","success":1,"file_id":"1498"}],"department":[{"_id":"63"}],"type":"conference","publication":"Proceedings of the 21st Annual International Computing and Combinatorics Conference (COCOON)","abstract":[{"text":"We consider online leasing problems in which demands arrive over time and need to be served by leasing resources. We introduce a new model for these problems such that a resource can be leased for K different durations each incurring a different cost (longer leases cost less per time unit). Each demand i can be served anytime between its arrival ai and its deadline ai+di by a leased resource. The objective is to meet all deadlines while minimizing the total leasing costs. This model is a natural generalization of Meyerson’s ParkingPermitProblem (FOCS 2005) in which di=0 for all i. We propose an online algorithm that is Θ(K+dmaxlmin)-competitive where dmax and lmin denote the largest di and the shortest available lease length, respectively. We also extend the SetCoverLeasing problem by deadlines and give a competitive online algorithm which also improves on existing solutions for the original SetCoverLeasing problem.","lang":"eng"}],"_id":"240","page":"277--288","user_id":"15504","ddc":["040"],"status":"public","has_accepted_license":"1","citation":{"mla":"Li, Shouwei, et al. “Towards Flexible Demands in Online Leasing Problems.” <i>Proceedings of the 21st Annual International Computing and Combinatorics Conference (COCOON)</i>, 2015, pp. 277--288, doi:<a href=\"https://doi.org/10.1007/978-3-319-21398-9_22\">10.1007/978-3-319-21398-9_22</a>.","ama":"Li S, Mäcker A, Markarian C, Meyer auf der Heide F, Riechers S. Towards Flexible Demands in Online Leasing Problems. In: <i>Proceedings of the 21st Annual International Computing and Combinatorics Conference (COCOON)</i>. Lecture Notes in Computer Science. ; 2015:277--288. doi:<a href=\"https://doi.org/10.1007/978-3-319-21398-9_22\">10.1007/978-3-319-21398-9_22</a>","bibtex":"@inproceedings{Li_Mäcker_Markarian_Meyer auf der Heide_Riechers_2015, series={Lecture Notes in Computer Science}, title={Towards Flexible Demands in Online Leasing Problems}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-21398-9_22\">10.1007/978-3-319-21398-9_22</a>}, booktitle={Proceedings of the 21st Annual International Computing and Combinatorics Conference (COCOON)}, author={Li, Shouwei and Mäcker, Alexander and Markarian, Christine and Meyer auf der Heide, Friedhelm and Riechers, Sören}, year={2015}, pages={277--288}, collection={Lecture Notes in Computer Science} }","apa":"Li, S., Mäcker, A., Markarian, C., Meyer auf der Heide, F., &#38; Riechers, S. (2015). Towards Flexible Demands in Online Leasing Problems. In <i>Proceedings of the 21st Annual International Computing and Combinatorics Conference (COCOON)</i> (pp. 277--288). <a href=\"https://doi.org/10.1007/978-3-319-21398-9_22\">https://doi.org/10.1007/978-3-319-21398-9_22</a>","ieee":"S. Li, A. Mäcker, C. Markarian, F. Meyer auf der Heide, and S. Riechers, “Towards Flexible Demands in Online Leasing Problems,” in <i>Proceedings of the 21st Annual International Computing and Combinatorics Conference (COCOON)</i>, 2015, pp. 277--288.","chicago":"Li, Shouwei, Alexander Mäcker, Christine Markarian, Friedhelm Meyer auf der Heide, and Sören Riechers. “Towards Flexible Demands in Online Leasing Problems.” In <i>Proceedings of the 21st Annual International Computing and Combinatorics Conference (COCOON)</i>, 277--288. Lecture Notes in Computer Science, 2015. <a href=\"https://doi.org/10.1007/978-3-319-21398-9_22\">https://doi.org/10.1007/978-3-319-21398-9_22</a>.","short":"S. Li, A. Mäcker, C. Markarian, F. Meyer auf der Heide, S. Riechers, in: Proceedings of the 21st Annual International Computing and Combinatorics Conference (COCOON), 2015, pp. 277--288."},"file_date_updated":"2018-03-21T10:28:50Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"16","name":"SFB 901 - Subprojekt C4"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"4","name":"SFB 901 - Project Area C"}]},{"user_id":"5786","_id":"20832","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:54:40Z","author":[{"last_name":"Schäfer","first_name":"Wilhelm","full_name":"Schäfer, Wilhelm"},{"last_name":"Dziwok","first_name":"Stefan","orcid":"http://orcid.org/0000-0002-8679-6673","full_name":"Dziwok, Stefan","id":"3901"},{"full_name":"Pohlmann, Uwe","last_name":"Pohlmann","first_name":"Uwe"},{"id":"27207","last_name":"Bobolz","first_name":"Jan","full_name":"Bobolz, Jan"},{"full_name":"Czech, Mike","first_name":"Mike","last_name":"Czech"},{"id":"26886","last_name":"Dann","first_name":"Andreas Peter","full_name":"Dann, Andreas Peter"},{"id":"20063","full_name":"Geismann, Johannes","first_name":"Johannes","orcid":"https://orcid.org/0000-0003-2015-2047","last_name":"Geismann"},{"full_name":"Hüwe, Marcus","last_name":"Hüwe","first_name":"Marcus","id":"13606"},{"full_name":"Krieger, Arthur","last_name":"Krieger","first_name":"Arthur"},{"first_name":"Goran","last_name":"Piskachev","orcid":"0000-0003-4424-5838","full_name":"Piskachev, Goran","id":"41936"},{"id":"9106","last_name":"Schubert","first_name":"David","full_name":"Schubert, David"},{"last_name":"Wohlrab","first_name":"Rebekka","full_name":"Wohlrab, Rebekka"}],"status":"public","year":"2015","title":"Seminar Theses of the Project Group Cybertron","department":[{"_id":"76"}],"type":"report","date_created":"2020-12-22T10:03:05Z","citation":{"mla":"Schäfer, Wilhelm, et al. <i>Seminar Theses of the Project Group Cybertron</i>. 2015.","ama":"Schäfer W, Dziwok S, Pohlmann U, et al. <i>Seminar Theses of the Project Group Cybertron</i>.; 2015.","bibtex":"@book{Schäfer_Dziwok_Pohlmann_Bobolz_Czech_Dann_Geismann_Hüwe_Krieger_Piskachev_et al._2015, title={Seminar Theses of the Project Group Cybertron}, author={Schäfer, Wilhelm and Dziwok, Stefan and Pohlmann, Uwe and Bobolz, Jan and Czech, Mike and Dann, Andreas Peter and Geismann, Johannes and Hüwe, Marcus and Krieger, Arthur and Piskachev, Goran and et al.}, year={2015} }","apa":"Schäfer, W., Dziwok, S., Pohlmann, U., Bobolz, J., Czech, M., Dann, A. P., Geismann, J., Hüwe, M., Krieger, A., Piskachev, G., Schubert, D., &#38; Wohlrab, R. (2015). <i>Seminar Theses of the Project Group Cybertron</i>.","ieee":"W. Schäfer <i>et al.</i>, <i>Seminar Theses of the Project Group Cybertron</i>. 2015.","chicago":"Schäfer, Wilhelm, Stefan Dziwok, Uwe Pohlmann, Jan Bobolz, Mike Czech, Andreas Peter Dann, Johannes Geismann, et al. <i>Seminar Theses of the Project Group Cybertron</i>, 2015.","short":"W. Schäfer, S. Dziwok, U. Pohlmann, J. Bobolz, M. Czech, A.P. Dann, J. Geismann, M. Hüwe, A. Krieger, G. Piskachev, D. Schubert, R. Wohlrab, Seminar Theses of the Project Group Cybertron, 2015."}},{"citation":{"ieee":"J. Geismann, <i>Multi-Core Execution of Safety-Critical Component-Based Software</i>. Universität Paderborn, Heinz Nixdorf Institut, Softwaretechnik, 2015.","apa":"Geismann, J. (2015). <i>Multi-Core Execution of Safety-Critical Component-Based Software</i>. Universität Paderborn, Heinz Nixdorf Institut, Softwaretechnik.","short":"J. Geismann, Multi-Core Execution of Safety-Critical Component-Based Software, Universität Paderborn, Heinz Nixdorf Institut, Softwaretechnik, 2015.","chicago":"Geismann, Johannes. <i>Multi-Core Execution of Safety-Critical Component-Based Software</i>. Universität Paderborn, Heinz Nixdorf Institut, Softwaretechnik, 2015.","mla":"Geismann, Johannes. <i>Multi-Core Execution of Safety-Critical Component-Based Software</i>. Universität Paderborn, Heinz Nixdorf Institut, Softwaretechnik, 2015.","bibtex":"@book{Geismann_2015, title={Multi-Core Execution of Safety-Critical Component-Based Software}, publisher={Universität Paderborn, Heinz Nixdorf Institut, Softwaretechnik}, author={Geismann, Johannes}, year={2015} }","ama":"Geismann J. <i>Multi-Core Execution of Safety-Critical Component-Based Software</i>. Universität Paderborn, Heinz Nixdorf Institut, Softwaretechnik; 2015."},"department":[{"_id":"76"}],"type":"mastersthesis","date_created":"2020-12-22T10:04:54Z","date_updated":"2022-01-06T06:54:40Z","author":[{"full_name":"Geismann, Johannes","first_name":"Johannes","orcid":"https://orcid.org/0000-0003-2015-2047","last_name":"Geismann","id":"20063"}],"year":"2015","status":"public","title":"Multi-Core Execution of Safety-Critical Component-Based Software","user_id":"5786","language":[{"iso":"eng"}],"_id":"20833","publisher":"Universität Paderborn, Heinz Nixdorf Institut, Softwaretechnik"},{"author":[{"full_name":"Meyer, Jan","last_name":"Meyer","first_name":"Jan"},{"id":"3875","first_name":"Jörg","orcid":"0000-0001-6141-4571","last_name":"Holtmann","full_name":"Holtmann, Jörg"},{"first_name":"Thorsten","last_name":"Koch","full_name":"Koch, Thorsten","id":"13616"},{"id":"683","full_name":"Meyer, Matthias","first_name":"Matthias","last_name":"Meyer"}],"status":"public","year":"2015","title":"Generierung von AUTOSAR-Modellen aus UML-Spezifikationen","intvolume":"       343","date_updated":"2022-01-06T06:54:41Z","_id":"20902","publisher":"Heinz Nixdorf Institut","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","language":[{"iso":"eng"}],"page":"159–172","volume":343,"editor":[{"full_name":"Gausemeier, Jürgen","first_name":"Jürgen","last_name":"Gausemeier"},{"full_name":"Dumitrescu, Roman","first_name":"Roman","last_name":"Dumitrescu"},{"full_name":"Rammig, Franz-Josef","first_name":"Franz-Josef","last_name":"Rammig"},{"first_name":"Wilhelm","last_name":"Schäfer","full_name":"Schäfer, Wilhelm"},{"full_name":"Trächtler, Ansgar","first_name":"Ansgar","last_name":"Trächtler"}],"user_id":"5786","citation":{"bibtex":"@inproceedings{Meyer_Holtmann_Koch_Meyer_2015, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Generierung von AUTOSAR-Modellen aus UML-Spezifikationen}, volume={343}, booktitle={10. Paderborner Workshop Entwurf mechatronischer Systeme}, publisher={Heinz Nixdorf Institut}, author={Meyer, Jan and Holtmann, Jörg and Koch, Thorsten and Meyer, Matthias}, editor={Gausemeier, Jürgen and Dumitrescu, Roman and Rammig, Franz-Josef and Schäfer, Wilhelm and Trächtler, Ansgar}, year={2015}, pages={159–172}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","chicago":"Meyer, Jan, Jörg Holtmann, Thorsten Koch, and Matthias Meyer. “Generierung von AUTOSAR-Modellen Aus UML-Spezifikationen.” In <i>10. Paderborner Workshop Entwurf Mechatronischer Systeme</i>, edited by Jürgen Gausemeier, Roman Dumitrescu, Franz-Josef Rammig, Wilhelm Schäfer, and Ansgar Trächtler, 343:159–172. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Heinz Nixdorf Institut, 2015.","ama":"Meyer J, Holtmann J, Koch T, Meyer M. Generierung von AUTOSAR-Modellen aus UML-Spezifikationen. In: Gausemeier J, Dumitrescu R, Rammig F-J, Schäfer W, Trächtler A, eds. <i>10. Paderborner Workshop Entwurf Mechatronischer Systeme</i>. Vol 343. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn. Heinz Nixdorf Institut; 2015:159–172.","short":"J. Meyer, J. Holtmann, T. Koch, M. Meyer, in: J. Gausemeier, R. Dumitrescu, F.-J. Rammig, W. Schäfer, A. Trächtler (Eds.), 10. Paderborner Workshop Entwurf Mechatronischer Systeme, Heinz Nixdorf Institut, 2015, pp. 159–172.","ieee":"J. Meyer, J. Holtmann, T. Koch, and M. Meyer, “Generierung von AUTOSAR-Modellen aus UML-Spezifikationen,” in <i>10. Paderborner Workshop Entwurf mechatronischer Systeme</i>, 2015, vol. 343, pp. 159–172.","apa":"Meyer, J., Holtmann, J., Koch, T., &#38; Meyer, M. (2015). Generierung von AUTOSAR-Modellen aus UML-Spezifikationen. In J. Gausemeier, R. Dumitrescu, F.-J. Rammig, W. Schäfer, &#38; A. Trächtler (Eds.), <i>10. Paderborner Workshop Entwurf mechatronischer Systeme</i> (Vol. 343, pp. 159–172). Heinz Nixdorf Institut.","mla":"Meyer, Jan, et al. “Generierung von AUTOSAR-Modellen Aus UML-Spezifikationen.” <i>10. Paderborner Workshop Entwurf Mechatronischer Systeme</i>, edited by Jürgen Gausemeier et al., vol. 343, Heinz Nixdorf Institut, 2015, pp. 159–172."},"publication":"10. Paderborner Workshop Entwurf mechatronischer Systeme","abstract":[{"lang":"ger","text":"Die Komplexität moderner Fahrzeuge steigt aufgrund der zunehmenden Anzahl von Funktionen, die durch elektronische Systeme umgesetzt werden. Insbesondere nehmen die Abhängigkeiten zwischen den an der Entwicklung beteiligten Fachdisziplinen und der Softwareanteil massiv zu. Wir haben einen für die Automobilindustrie angepassten, zum Reifegradmodell Automotive SPICE konformen Prozess für die Entwicklung von Steuergeräten konzipiert, der ein fachdisziplinübergreifendes Systems Engineering und einen systematischen Übergang in die Softwareentwicklung unterstützt. Im Kontext dieses Entwicklungsprozess beschreiben wir in diesem Beitrag den Übergang vom UML-basierten Softwareentwurf zum in der Automobilindustrie etablierten AUTOSAR-Standard mit Hilfe einer automatischen Modelltransformation. So werden fehleranfällige und zeitaufwändige manuelle Tätigkeiten reduziert. Wir haben die Generierung von AUTOSAR-Modellen gemeinsam mit dem international tätigen Automobilzulieferer Hella KGaA Hueck & Co. in seriennahen Entwicklungsprojekten praktisch erprobt und Zeit- und Kostenersparnisse festgestellt."}],"date_created":"2021-01-12T13:56:52Z","department":[{"_id":"76"},{"_id":"241"},{"_id":"662"}],"type":"conference"},{"_id":"18003","publisher":"Universität Paderborn","language":[{"iso":"eng"}],"user_id":"477","author":[{"id":"34727","last_name":"Götte","first_name":"Thorsten","full_name":"Götte, Thorsten"}],"title":"Covering and Bridging im selbstorganisierenden Partikelsystem Amoebabot","year":"2015","status":"public","date_updated":"2022-01-06T06:53:25Z","date_created":"2020-08-17T08:18:04Z","department":[{"_id":"79"}],"type":"bachelorsthesis","supervisor":[{"id":"20792","full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler"}],"citation":{"apa":"Götte, T. (2015). <i>Covering and Bridging im selbstorganisierenden Partikelsystem Amoebabot</i>. Universität Paderborn.","ieee":"T. Götte, <i>Covering and Bridging im selbstorganisierenden Partikelsystem Amoebabot</i>. Universität Paderborn, 2015.","short":"T. Götte, Covering and Bridging Im Selbstorganisierenden Partikelsystem Amoebabot, Universität Paderborn, 2015.","chicago":"Götte, Thorsten. <i>Covering and Bridging Im Selbstorganisierenden Partikelsystem Amoebabot</i>. Universität Paderborn, 2015.","mla":"Götte, Thorsten. <i>Covering and Bridging Im Selbstorganisierenden Partikelsystem Amoebabot</i>. Universität Paderborn, 2015.","ama":"Götte T. <i>Covering and Bridging Im Selbstorganisierenden Partikelsystem Amoebabot</i>. Universität Paderborn; 2015.","bibtex":"@book{Götte_2015, title={Covering and Bridging im selbstorganisierenden Partikelsystem Amoebabot}, publisher={Universität Paderborn}, author={Götte, Thorsten}, year={2015} }"},"project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A1","_id":"5"}]},{"_id":"18004","language":[{"iso":"eng"}],"user_id":"15504","title":"3D-Nesting in der SLM-Technologie","status":"public","year":"2015","author":[{"full_name":"Isenberg, Daniel","first_name":"Daniel","last_name":"Isenberg"}],"date_updated":"2022-01-06T06:53:25Z","date_created":"2020-08-17T08:18:44Z","type":"bachelorsthesis","department":[{"_id":"79"}],"supervisor":[{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"}],"citation":{"ieee":"D. Isenberg, <i>3D-Nesting in der SLM-Technologie</i>. 2015.","apa":"Isenberg, D. (2015). <i>3D-Nesting in der SLM-Technologie</i>.","mla":"Isenberg, Daniel. <i>3D-Nesting in Der SLM-Technologie</i>. 2015.","bibtex":"@book{Isenberg_2015, title={3D-Nesting in der SLM-Technologie}, author={Isenberg, Daniel}, year={2015} }","short":"D. Isenberg, 3D-Nesting in Der SLM-Technologie, 2015.","ama":"Isenberg D. <i>3D-Nesting in Der SLM-Technologie</i>.; 2015.","chicago":"Isenberg, Daniel. <i>3D-Nesting in Der SLM-Technologie</i>, 2015."}},{"supervisor":[{"id":"20792","full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler"}],"citation":{"ieee":"C. Korfmacher, <i>Implementierung und Analyse von Cone-DHT</i>. Universität Paderborn, 2015.","apa":"Korfmacher, C. (2015). <i>Implementierung und Analyse von Cone-DHT</i>. Universität Paderborn.","short":"C. Korfmacher, Implementierung Und Analyse von Cone-DHT, Universität Paderborn, 2015.","chicago":"Korfmacher, Christian. <i>Implementierung Und Analyse von Cone-DHT</i>. Universität Paderborn, 2015.","mla":"Korfmacher, Christian. <i>Implementierung Und Analyse von Cone-DHT</i>. Universität Paderborn, 2015.","bibtex":"@book{Korfmacher_2015, title={Implementierung und Analyse von Cone-DHT}, publisher={Universität Paderborn}, author={Korfmacher, Christian}, year={2015} }","ama":"Korfmacher C. <i>Implementierung Und Analyse von Cone-DHT</i>. Universität Paderborn; 2015."},"project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"date_created":"2020-08-17T08:19:47Z","type":"bachelorsthesis","department":[{"_id":"79"}],"year":"2015","title":"Implementierung und Analyse von Cone-DHT","status":"public","author":[{"last_name":"Korfmacher","first_name":"Christian","full_name":"Korfmacher, Christian"}],"date_updated":"2022-01-06T06:53:25Z","publisher":"Universität Paderborn","_id":"18005","language":[{"iso":"eng"}],"user_id":"477"},{"date_created":"2020-08-17T08:20:59Z","type":"bachelorsthesis","department":[{"_id":"79"}],"citation":{"bibtex":"@book{Sundermeier_2015, title={Implementierung eines selbststabilisierenden verteilten Stacks}, publisher={Universität Paderborn}, author={Sundermeier, Jannik}, year={2015} }","ama":"Sundermeier J. <i>Implementierung Eines Selbststabilisierenden Verteilten Stacks</i>. Universität Paderborn; 2015.","mla":"Sundermeier, Jannik. <i>Implementierung Eines Selbststabilisierenden Verteilten Stacks</i>. Universität Paderborn, 2015.","chicago":"Sundermeier, Jannik. <i>Implementierung Eines Selbststabilisierenden Verteilten Stacks</i>. Universität Paderborn, 2015.","short":"J. Sundermeier, Implementierung Eines Selbststabilisierenden Verteilten Stacks, Universität Paderborn, 2015.","ieee":"J. Sundermeier, <i>Implementierung eines selbststabilisierenden verteilten Stacks</i>. Universität Paderborn, 2015.","apa":"Sundermeier, J. (2015). <i>Implementierung eines selbststabilisierenden verteilten Stacks</i>. Universität Paderborn."},"supervisor":[{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"_id":"18006","language":[{"iso":"eng"}],"publisher":"Universität Paderborn","user_id":"477","year":"2015","status":"public","title":"Implementierung eines selbststabilisierenden verteilten Stacks","author":[{"first_name":"Jannik","last_name":"Sundermeier","full_name":"Sundermeier, Jannik","id":"38705"}],"date_updated":"2022-01-06T06:53:25Z"},{"date_updated":"2022-01-06T06:53:25Z","author":[{"id":"39241","full_name":"Knollmann, Till","orcid":"0000-0003-2014-4696","last_name":"Knollmann","first_name":"Till"}],"year":"2015","status":"public","title":"Implementierung einer selbststabilisierenden Datenstruktur für das längste gemeinsame Präfix","user_id":"477","publisher":"Universität Paderborn","_id":"18024","language":[{"iso":"eng"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"supervisor":[{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"}],"citation":{"bibtex":"@book{Knollmann_2015, title={Implementierung einer selbststabilisierenden Datenstruktur für das längste gemeinsame Präfix}, publisher={Universität Paderborn}, author={Knollmann, Till}, year={2015} }","ama":"Knollmann T. <i>Implementierung Einer Selbststabilisierenden Datenstruktur Für Das Längste Gemeinsame Präfix</i>. Universität Paderborn; 2015.","mla":"Knollmann, Till. <i>Implementierung Einer Selbststabilisierenden Datenstruktur Für Das Längste Gemeinsame Präfix</i>. Universität Paderborn, 2015.","chicago":"Knollmann, Till. <i>Implementierung Einer Selbststabilisierenden Datenstruktur Für Das Längste Gemeinsame Präfix</i>. Universität Paderborn, 2015.","short":"T. Knollmann, Implementierung Einer Selbststabilisierenden Datenstruktur Für Das Längste Gemeinsame Präfix, Universität Paderborn, 2015.","ieee":"T. Knollmann, <i>Implementierung einer selbststabilisierenden Datenstruktur für das längste gemeinsame Präfix</i>. Universität Paderborn, 2015.","apa":"Knollmann, T. (2015). <i>Implementierung einer selbststabilisierenden Datenstruktur für das längste gemeinsame Präfix</i>. Universität Paderborn."},"department":[{"_id":"79"}],"type":"bachelorsthesis","date_created":"2020-08-18T08:37:33Z"},{"intvolume":"      9211","date_updated":"2022-01-06T06:53:36Z","author":[{"first_name":"Zahra","last_name":"Derakhshandeh","full_name":"Derakhshandeh, Zahra"},{"first_name":"Robert","last_name":"Gmyr","full_name":"Gmyr, Robert"},{"full_name":"Strothmann, Thim Frederik","last_name":"Strothmann","first_name":"Thim Frederik","id":"11319"},{"full_name":"A. Bazzi, Rida","last_name":"A. Bazzi","first_name":"Rida"},{"last_name":"W. Richa","first_name":"Andrea","full_name":"W. Richa, Andrea"},{"id":"20792","first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian"}],"publication_identifier":{"isbn":["978-3-319-21998-1"]},"title":"Leader Election and Shape Formation with Self-organizing Programmable Matter","year":"2015","status":"public","volume":9211,"user_id":"15504","doi":"10.1007/978-3-319-21999-8_8","_id":"1850","language":[{"iso":"eng"}],"series_title":"Lecture Notes in Computer Science","page":"117--132","citation":{"apa":"Derakhshandeh, Z., Gmyr, R., Strothmann, T. F., A. Bazzi, R., W. Richa, A., &#38; Scheideler, C. (2015). Leader Election and Shape Formation with Self-organizing Programmable Matter. In <i>DNA Computing and Molecular Programming - 21st International Conference, DNA 21, Boston and Cambridge, MA, USA, August 17-21, 2015. Proceedings</i> (Vol. 9211, pp. 117--132). <a href=\"https://doi.org/10.1007/978-3-319-21999-8_8\">https://doi.org/10.1007/978-3-319-21999-8_8</a>","ieee":"Z. Derakhshandeh, R. Gmyr, T. F. Strothmann, R. A. Bazzi, A. W. Richa, and C. Scheideler, “Leader Election and Shape Formation with Self-organizing Programmable Matter,” in <i>DNA Computing and Molecular Programming - 21st International Conference, DNA 21, Boston and Cambridge, MA, USA, August 17-21, 2015. Proceedings</i>, 2015, vol. 9211, pp. 117--132.","chicago":"Derakhshandeh, Zahra, Robert Gmyr, Thim Frederik Strothmann, Rida A. Bazzi, Andrea W. Richa, and Christian Scheideler. “Leader Election and Shape Formation with Self-Organizing Programmable Matter.” In <i>DNA Computing and Molecular Programming - 21st International Conference, DNA 21, Boston and Cambridge, MA, USA, August 17-21, 2015. Proceedings</i>, 9211:117--132. Lecture Notes in Computer Science, 2015. <a href=\"https://doi.org/10.1007/978-3-319-21999-8_8\">https://doi.org/10.1007/978-3-319-21999-8_8</a>.","short":"Z. Derakhshandeh, R. Gmyr, T.F. Strothmann, R. A. Bazzi, A. W. Richa, C. Scheideler, in: DNA Computing and Molecular Programming - 21st International Conference, DNA 21, Boston and Cambridge, MA, USA, August 17-21, 2015. Proceedings, 2015, pp. 117--132.","mla":"Derakhshandeh, Zahra, et al. “Leader Election and Shape Formation with Self-Organizing Programmable Matter.” <i>DNA Computing and Molecular Programming - 21st International Conference, DNA 21, Boston and Cambridge, MA, USA, August 17-21, 2015. Proceedings</i>, vol. 9211, 2015, pp. 117--132, doi:<a href=\"https://doi.org/10.1007/978-3-319-21999-8_8\">10.1007/978-3-319-21999-8_8</a>.","ama":"Derakhshandeh Z, Gmyr R, Strothmann TF, A. Bazzi R, W. Richa A, Scheideler C. Leader Election and Shape Formation with Self-organizing Programmable Matter. In: <i>DNA Computing and Molecular Programming - 21st International Conference, DNA 21, Boston and Cambridge, MA, USA, August 17-21, 2015. Proceedings</i>. Vol 9211. Lecture Notes in Computer Science. ; 2015:117--132. doi:<a href=\"https://doi.org/10.1007/978-3-319-21999-8_8\">10.1007/978-3-319-21999-8_8</a>","bibtex":"@inproceedings{Derakhshandeh_Gmyr_Strothmann_A. Bazzi_W. Richa_Scheideler_2015, series={Lecture Notes in Computer Science}, title={Leader Election and Shape Formation with Self-organizing Programmable Matter}, volume={9211}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-21999-8_8\">10.1007/978-3-319-21999-8_8</a>}, booktitle={DNA Computing and Molecular Programming - 21st International Conference, DNA 21, Boston and Cambridge, MA, USA, August 17-21, 2015. Proceedings}, author={Derakhshandeh, Zahra and Gmyr, Robert and Strothmann, Thim Frederik and A. Bazzi, Rida and W. Richa, Andrea and Scheideler, Christian}, year={2015}, pages={117--132}, collection={Lecture Notes in Computer Science} }"},"publication":"DNA Computing and Molecular Programming - 21st International Conference, DNA 21, Boston and Cambridge, MA, USA, August 17-21, 2015. Proceedings","department":[{"_id":"79"}],"type":"conference","date_created":"2018-03-28T05:49:12Z"},{"date_updated":"2022-01-06T06:53:36Z","year":"2015","title":"An Algorithmic Framework for Shape Formation Problems in Self-Organizing Particle Systems","status":"public","publication_identifier":{"isbn":["978-1-4503-3674-1"]},"author":[{"full_name":"Derakhshandeh, Zahra","last_name":"Derakhshandeh","first_name":"Zahra"},{"first_name":"Robert","last_name":"Gmyr","full_name":"Gmyr, Robert"},{"full_name":"W. Richa, Andrea","last_name":"W. Richa","first_name":"Andrea"},{"id":"20792","last_name":"Scheideler","first_name":"Christian","full_name":"Scheideler, Christian"},{"id":"11319","full_name":"Strothmann, Thim Frederik","first_name":"Thim Frederik","last_name":"Strothmann"}],"doi":"10.1145/2800795.2800829","user_id":"15504","page":"21:1--21:2","language":[{"iso":"eng"}],"_id":"1851","publisher":"ACM","publication":"Proceedings of the Second Annual International Conference on Nanoscale Computing and Communication, NANOCOM' 15, Boston, MA, USA, September 21-22, 2015","citation":{"apa":"Derakhshandeh, Z., Gmyr, R., W. Richa, A., Scheideler, C., &#38; Strothmann, T. F. (2015). An Algorithmic Framework for Shape Formation Problems in Self-Organizing Particle Systems. In <i>Proceedings of the Second Annual International Conference on Nanoscale Computing and Communication, NANOCOM’ 15, Boston, MA, USA, September 21-22, 2015</i> (pp. 21:1--21:2). ACM. <a href=\"https://doi.org/10.1145/2800795.2800829\">https://doi.org/10.1145/2800795.2800829</a>","mla":"Derakhshandeh, Zahra, et al. “An Algorithmic Framework for Shape Formation Problems in Self-Organizing Particle Systems.” <i>Proceedings of the Second Annual International Conference on Nanoscale Computing and Communication, NANOCOM’ 15, Boston, MA, USA, September 21-22, 2015</i>, ACM, 2015, pp. 21:1--21:2, doi:<a href=\"https://doi.org/10.1145/2800795.2800829\">10.1145/2800795.2800829</a>.","ieee":"Z. Derakhshandeh, R. Gmyr, A. W. Richa, C. Scheideler, and T. F. Strothmann, “An Algorithmic Framework for Shape Formation Problems in Self-Organizing Particle Systems,” in <i>Proceedings of the Second Annual International Conference on Nanoscale Computing and Communication, NANOCOM’ 15, Boston, MA, USA, September 21-22, 2015</i>, 2015, pp. 21:1--21:2.","chicago":"Derakhshandeh, Zahra, Robert Gmyr, Andrea W. Richa, Christian Scheideler, and Thim Frederik Strothmann. “An Algorithmic Framework for Shape Formation Problems in Self-Organizing Particle Systems.” In <i>Proceedings of the Second Annual International Conference on Nanoscale Computing and Communication, NANOCOM’ 15, Boston, MA, USA, September 21-22, 2015</i>, 21:1--21:2. ACM, 2015. <a href=\"https://doi.org/10.1145/2800795.2800829\">https://doi.org/10.1145/2800795.2800829</a>.","ama":"Derakhshandeh Z, Gmyr R, W. Richa A, Scheideler C, Strothmann TF. An Algorithmic Framework for Shape Formation Problems in Self-Organizing Particle Systems. In: <i>Proceedings of the Second Annual International Conference on Nanoscale Computing and Communication, NANOCOM’ 15, Boston, MA, USA, September 21-22, 2015</i>. ACM; 2015:21:1--21:2. doi:<a href=\"https://doi.org/10.1145/2800795.2800829\">10.1145/2800795.2800829</a>","short":"Z. Derakhshandeh, R. Gmyr, A. W. Richa, C. Scheideler, T.F. Strothmann, in: Proceedings of the Second Annual International Conference on Nanoscale Computing and Communication, NANOCOM’ 15, Boston, MA, USA, September 21-22, 2015, ACM, 2015, pp. 21:1--21:2.","bibtex":"@inproceedings{Derakhshandeh_Gmyr_W. Richa_Scheideler_Strothmann_2015, title={An Algorithmic Framework for Shape Formation Problems in Self-Organizing Particle Systems}, DOI={<a href=\"https://doi.org/10.1145/2800795.2800829\">10.1145/2800795.2800829</a>}, booktitle={Proceedings of the Second Annual International Conference on Nanoscale Computing and Communication, NANOCOM’ 15, Boston, MA, USA, September 21-22, 2015}, publisher={ACM}, author={Derakhshandeh, Zahra and Gmyr, Robert and W. Richa, Andrea and Scheideler, Christian and Strothmann, Thim Frederik}, year={2015}, pages={21:1--21:2} }"},"type":"conference","department":[{"_id":"79"}],"date_created":"2018-03-28T05:50:25Z"},{"date_updated":"2022-01-06T06:53:36Z","author":[{"last_name":"Derakhshandeh","first_name":"Zahra","full_name":"Derakhshandeh, Zahra"},{"full_name":"Gmyr, Robert","first_name":"Robert","last_name":"Gmyr"},{"last_name":"Strothmann","first_name":"Thim Frederik","full_name":"Strothmann, Thim Frederik","id":"11319"},{"full_name":"A. Bazzi, Rida","last_name":"A. Bazzi","first_name":"Rida"},{"full_name":"W. Richa, Andrea","last_name":"W. Richa","first_name":"Andrea"},{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"}],"publication_identifier":{"isbn":["978-1-4503-3617-8"]},"title":"Brief Announcement: On the Feasibility of Leader Election and Shape Formation with Self-Organizing Programmable Matter","status":"public","year":"2015","doi":"10.1145/2767386.2767451","user_id":"15504","language":[{"iso":"eng"}],"_id":"1852","publisher":"ACM","page":"67--69","citation":{"mla":"Derakhshandeh, Zahra, et al. “Brief Announcement: On the Feasibility of Leader Election and Shape Formation with Self-Organizing Programmable Matter.” <i>Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, PODC 2015, Donostia-San Sebasti{\\’{a}}n, Spain, July 21 - 23, 2015</i>, ACM, 2015, pp. 67--69, doi:<a href=\"https://doi.org/10.1145/2767386.2767451\">10.1145/2767386.2767451</a>.","bibtex":"@inproceedings{Derakhshandeh_Gmyr_Strothmann_A. Bazzi_W. Richa_Scheideler_2015, title={Brief Announcement: On the Feasibility of Leader Election and Shape Formation with Self-Organizing Programmable Matter}, DOI={<a href=\"https://doi.org/10.1145/2767386.2767451\">10.1145/2767386.2767451</a>}, booktitle={Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, PODC 2015, Donostia-San Sebasti{\\’{a}}n, Spain, July 21 - 23, 2015}, publisher={ACM}, author={Derakhshandeh, Zahra and Gmyr, Robert and Strothmann, Thim Frederik and A. Bazzi, Rida and W. Richa, Andrea and Scheideler, Christian}, year={2015}, pages={67--69} }","ama":"Derakhshandeh Z, Gmyr R, Strothmann TF, A. Bazzi R, W. Richa A, Scheideler C. Brief Announcement: On the Feasibility of Leader Election and Shape Formation with Self-Organizing Programmable Matter. In: <i>Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, PODC 2015, Donostia-San Sebasti{\\’{a}}n, Spain, July 21 - 23, 2015</i>. ACM; 2015:67--69. doi:<a href=\"https://doi.org/10.1145/2767386.2767451\">10.1145/2767386.2767451</a>","ieee":"Z. Derakhshandeh, R. Gmyr, T. F. Strothmann, R. A. Bazzi, A. W. Richa, and C. Scheideler, “Brief Announcement: On the Feasibility of Leader Election and Shape Formation with Self-Organizing Programmable Matter,” in <i>Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, PODC 2015, Donostia-San Sebasti{\\’{a}}n, Spain, July 21 - 23, 2015</i>, 2015, pp. 67--69.","apa":"Derakhshandeh, Z., Gmyr, R., Strothmann, T. F., A. Bazzi, R., W. Richa, A., &#38; Scheideler, C. (2015). Brief Announcement: On the Feasibility of Leader Election and Shape Formation with Self-Organizing Programmable Matter. In <i>Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, PODC 2015, Donostia-San Sebasti{\\’{a}}n, Spain, July 21 - 23, 2015</i> (pp. 67--69). ACM. <a href=\"https://doi.org/10.1145/2767386.2767451\">https://doi.org/10.1145/2767386.2767451</a>","chicago":"Derakhshandeh, Zahra, Robert Gmyr, Thim Frederik Strothmann, Rida A. Bazzi, Andrea W. Richa, and Christian Scheideler. “Brief Announcement: On the Feasibility of Leader Election and Shape Formation with Self-Organizing Programmable Matter.” In <i>Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, PODC 2015, Donostia-San Sebasti{\\’{a}}n, Spain, July 21 - 23, 2015</i>, 67--69. ACM, 2015. <a href=\"https://doi.org/10.1145/2767386.2767451\">https://doi.org/10.1145/2767386.2767451</a>.","short":"Z. Derakhshandeh, R. Gmyr, T.F. Strothmann, R. A. Bazzi, A. W. Richa, C. Scheideler, in: Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, PODC 2015, Donostia-San Sebasti{\\’{a}}n, Spain, July 21 - 23, 2015, ACM, 2015, pp. 67--69."},"publication":"Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, PODC 2015, Donostia-San Sebasti{\\'{a}}n, Spain, July 21 - 23, 2015","department":[{"_id":"79"}],"type":"conference","date_created":"2018-03-28T05:52:44Z"},{"publication":"Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, SPAA 2015, Portland, OR, USA, June 13-15, 2015","citation":{"short":"A. Koutsopoulos, C. Scheideler, T.F. Strothmann, in: Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, SPAA 2015, Portland, OR, USA, June 13-15, 2015, ACM, 2015, pp. 77--79.","chicago":"Koutsopoulos, Andreas, Christian Scheideler, and Thim Frederik Strothmann. “Brief Announcement: Towards a Universal Approach for the Finite Departure Problem in Overlay Networks.” In <i>Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, SPAA 2015, Portland, OR, USA, June 13-15, 2015</i>, 77--79. ACM, 2015. <a href=\"https://doi.org/10.1145/2755573.2755614\">https://doi.org/10.1145/2755573.2755614</a>.","apa":"Koutsopoulos, A., Scheideler, C., &#38; Strothmann, T. F. (2015). Brief Announcement: Towards a Universal Approach for the Finite Departure Problem in Overlay Networks. In <i>Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, SPAA 2015, Portland, OR, USA, June 13-15, 2015</i> (pp. 77--79). ACM. <a href=\"https://doi.org/10.1145/2755573.2755614\">https://doi.org/10.1145/2755573.2755614</a>","ieee":"A. Koutsopoulos, C. Scheideler, and T. F. Strothmann, “Brief Announcement: Towards a Universal Approach for the Finite Departure Problem in Overlay Networks,” in <i>Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, SPAA 2015, Portland, OR, USA, June 13-15, 2015</i>, 2015, pp. 77--79.","ama":"Koutsopoulos A, Scheideler C, Strothmann TF. Brief Announcement: Towards a Universal Approach for the Finite Departure Problem in Overlay Networks. In: <i>Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, SPAA 2015, Portland, OR, USA, June 13-15, 2015</i>. ACM; 2015:77--79. doi:<a href=\"https://doi.org/10.1145/2755573.2755614\">10.1145/2755573.2755614</a>","bibtex":"@inproceedings{Koutsopoulos_Scheideler_Strothmann_2015, title={Brief Announcement: Towards a Universal Approach for the Finite Departure Problem in Overlay Networks}, DOI={<a href=\"https://doi.org/10.1145/2755573.2755614\">10.1145/2755573.2755614</a>}, booktitle={Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, SPAA 2015, Portland, OR, USA, June 13-15, 2015}, publisher={ACM}, author={Koutsopoulos, Andreas and Scheideler, Christian and Strothmann, Thim Frederik}, year={2015}, pages={77--79} }","mla":"Koutsopoulos, Andreas, et al. “Brief Announcement: Towards a Universal Approach for the Finite Departure Problem in Overlay Networks.” <i>Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, SPAA 2015, Portland, OR, USA, June 13-15, 2015</i>, ACM, 2015, pp. 77--79, doi:<a href=\"https://doi.org/10.1145/2755573.2755614\">10.1145/2755573.2755614</a>."},"date_created":"2018-03-28T05:57:20Z","type":"conference","department":[{"_id":"79"}],"title":"Brief Announcement: Towards a Universal Approach for the Finite Departure Problem in Overlay Networks","status":"public","year":"2015","publication_identifier":{"isbn":["978-1-4503-3588-1"]},"author":[{"last_name":"Koutsopoulos","first_name":"Andreas","full_name":"Koutsopoulos, Andreas"},{"full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian","id":"20792"},{"id":"11319","last_name":"Strothmann","first_name":"Thim Frederik","full_name":"Strothmann, Thim Frederik"}],"date_updated":"2022-01-06T06:53:36Z","page":"77--79","language":[{"iso":"eng"}],"_id":"1853","publisher":"ACM","doi":"10.1145/2755573.2755614","user_id":"15504"},{"date_created":"2018-03-28T06:09:00Z","type":"conference_editor","department":[{"_id":"79"}],"citation":{"chicago":"Scheideler, Christian, ed. <i>Structural Information and Communication Complexity - 22nd International Colloquium, SIROCCO 2015, Montserrat, Spain, July 14-16, 2015, Post-Proceedings</i>. Lecture Notes in Computer Science, 2015. <a href=\"https://doi.org/10.1007/978-3-319-25258-2\">https://doi.org/10.1007/978-3-319-25258-2</a>.","short":"C. Scheideler, ed., Structural Information and Communication Complexity - 22nd International Colloquium, SIROCCO 2015, Montserrat, Spain, July 14-16, 2015, Post-Proceedings, 2015.","ieee":"C. Scheideler, Ed., <i>Structural Information and Communication Complexity - 22nd International Colloquium, SIROCCO 2015, Montserrat, Spain, July 14-16, 2015, Post-Proceedings</i>. 2015.","apa":"Scheideler, C. (Ed.). (2015). <i>Structural Information and Communication Complexity - 22nd International Colloquium, SIROCCO 2015, Montserrat, Spain, July 14-16, 2015, Post-Proceedings</i>. <a href=\"https://doi.org/10.1007/978-3-319-25258-2\">https://doi.org/10.1007/978-3-319-25258-2</a>","bibtex":"@book{Scheideler_2015, series={Lecture Notes in Computer Science}, title={Structural Information and Communication Complexity - 22nd International Colloquium, SIROCCO 2015, Montserrat, Spain, July 14-16, 2015, Post-Proceedings}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-25258-2\">10.1007/978-3-319-25258-2</a>}, year={2015}, collection={Lecture Notes in Computer Science} }","ama":"Scheideler C, ed. <i>Structural Information and Communication Complexity - 22nd International Colloquium, SIROCCO 2015, Montserrat, Spain, July 14-16, 2015, Post-Proceedings</i>.; 2015. doi:<a href=\"https://doi.org/10.1007/978-3-319-25258-2\">10.1007/978-3-319-25258-2</a>","mla":"Scheideler, Christian, editor. <i>Structural Information and Communication Complexity - 22nd International Colloquium, SIROCCO 2015, Montserrat, Spain, July 14-16, 2015, Post-Proceedings</i>. 2015, doi:<a href=\"https://doi.org/10.1007/978-3-319-25258-2\">10.1007/978-3-319-25258-2</a>."},"series_title":"Lecture Notes in Computer Science","_id":"1854","doi":"10.1007/978-3-319-25258-2","user_id":"15504","editor":[{"id":"20792","first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian"}],"title":"Structural Information and Communication Complexity - 22nd International Colloquium, SIROCCO 2015, Montserrat, Spain, July 14-16, 2015, Post-Proceedings","status":"public","year":"2015","publication_identifier":{"isbn":["978-3-319-25257-5"]},"date_updated":"2022-01-06T06:53:36Z"},{"date_updated":"2022-01-06T06:55:43Z","conference":{"end_date":"2015-11-19","location":"Houston, Texas","name":" ASME 2015 International Mechanical Engineering Congress & Exposition (IMECE2015)","start_date":"2015-11-13"},"author":[{"full_name":"Westermann, Thorsten","first_name":"Thorsten","last_name":"Westermann"},{"last_name":"Anacker","first_name":"Harald","full_name":"Anacker, Harald"},{"id":"16190","last_name":"Dumitrescu","first_name":"Roman","full_name":"Dumitrescu, Roman"},{"first_name":"Ursula","last_name":"Frank","full_name":"Frank, Ursula"},{"first_name":"Axel","last_name":"Hessenkämper","full_name":"Hessenkämper, Axel"}],"status":"public","year":"2015","title":" Interdisciplinary System Architecture for Intelligent Technical Systems","user_id":"21240","_id":"22888","language":[{"iso":"eng"}],"citation":{"short":"T. Westermann, H. Anacker, R. Dumitrescu, U. Frank, A. Hessenkämper, in: Proceedings of the ASME 2015 International Mechanical Engineering Congress &#38; Exposition (IMECE2015), Houston, Texas, 2015.","chicago":"Westermann, Thorsten, Harald Anacker, Roman Dumitrescu, Ursula Frank, and Axel Hessenkämper. “ Interdisciplinary System Architecture for Intelligent Technical Systems.” In <i>Proceedings of the ASME 2015 International Mechanical Engineering Congress &#38; Exposition (IMECE2015)</i>. Houston, Texas, 2015.","apa":"Westermann, T., Anacker, H., Dumitrescu, R., Frank, U., &#38; Hessenkämper, A. (2015).  Interdisciplinary System Architecture for Intelligent Technical Systems. In <i>Proceedings of the ASME 2015 International Mechanical Engineering Congress &#38; Exposition (IMECE2015)</i>. Houston, Texas.","ieee":"T. Westermann, H. Anacker, R. Dumitrescu, U. Frank, and A. Hessenkämper, “ Interdisciplinary System Architecture for Intelligent Technical Systems,” in <i>Proceedings of the ASME 2015 International Mechanical Engineering Congress &#38; Exposition (IMECE2015)</i>, Houston, Texas, 2015.","ama":"Westermann T, Anacker H, Dumitrescu R, Frank U, Hessenkämper A.  Interdisciplinary System Architecture for Intelligent Technical Systems. In: <i>Proceedings of the ASME 2015 International Mechanical Engineering Congress &#38; Exposition (IMECE2015)</i>. Houston, Texas; 2015.","bibtex":"@inproceedings{Westermann_Anacker_Dumitrescu_Frank_Hessenkämper_2015, place={Houston, Texas}, title={ Interdisciplinary System Architecture for Intelligent Technical Systems}, booktitle={Proceedings of the ASME 2015 International Mechanical Engineering Congress &#38; Exposition (IMECE2015)}, author={Westermann, Thorsten and Anacker, Harald and Dumitrescu, Roman and Frank, Ursula and Hessenkämper, Axel}, year={2015} }","mla":"Westermann, Thorsten, et al. “ Interdisciplinary System Architecture for Intelligent Technical Systems.” <i>Proceedings of the ASME 2015 International Mechanical Engineering Congress &#38; Exposition (IMECE2015)</i>, 2015."},"publication":"Proceedings of the ASME 2015 International Mechanical Engineering Congress & Exposition (IMECE2015)","department":[{"_id":"563"}],"type":"conference","place":"Houston, Texas","date_created":"2021-07-29T08:56:09Z"},{"user_id":"21240","language":[{"iso":"eng"}],"_id":"22889","date_updated":"2022-01-06T06:55:43Z","author":[{"full_name":"Tschirner, Christian","first_name":"Christian","last_name":"Tschirner"},{"first_name":"Lukas Helmut","last_name":"Bretz","full_name":"Bretz, Lukas Helmut"},{"first_name":"Roman","last_name":"Dumitrescu","full_name":"Dumitrescu, Roman","id":"16190"},{"first_name":"Jürgen","last_name":"Gausemeier","full_name":"Gausemeier, Jürgen"}],"year":"2015","title":"Applying Model-Based Systems Engineering for Product Engineering Management - Concepts for Industrial Application","status":"public","department":[{"_id":"563"}],"type":"conference","date_created":"2021-07-29T08:58:46Z","citation":{"mla":"Tschirner, Christian, et al. “Applying Model-Based Systems Engineering for Product Engineering Management - Concepts for Industrial Application.” <i>1st International Symposium on Systems Engineering (IEEE ISSE), Rome, Italy, 28. - 30. Sep. 2015</i>, 2015.","bibtex":"@inproceedings{Tschirner_Bretz_Dumitrescu_Gausemeier_2015, title={Applying Model-Based Systems Engineering for Product Engineering Management - Concepts for Industrial Application}, booktitle={1st International Symposium on Systems Engineering (IEEE ISSE), Rome, Italy, 28. - 30. Sep. 2015}, author={Tschirner, Christian and Bretz, Lukas Helmut and Dumitrescu, Roman and Gausemeier, Jürgen}, year={2015} }","ama":"Tschirner C, Bretz LH, Dumitrescu R, Gausemeier J. Applying Model-Based Systems Engineering for Product Engineering Management - Concepts for Industrial Application. In: <i>1st International Symposium on Systems Engineering (IEEE ISSE), Rome, Italy, 28. - 30. Sep. 2015</i>. ; 2015.","ieee":"C. Tschirner, L. H. Bretz, R. Dumitrescu, and J. Gausemeier, “Applying Model-Based Systems Engineering for Product Engineering Management - Concepts for Industrial Application,” in <i>1st International Symposium on Systems Engineering (IEEE ISSE), Rome, Italy, 28. - 30. Sep. 2015</i>, 2015.","apa":"Tschirner, C., Bretz, L. H., Dumitrescu, R., &#38; Gausemeier, J. (2015). Applying Model-Based Systems Engineering for Product Engineering Management - Concepts for Industrial Application. In <i>1st International Symposium on Systems Engineering (IEEE ISSE), Rome, Italy, 28. - 30. Sep. 2015</i>.","chicago":"Tschirner, Christian, Lukas Helmut Bretz, Roman Dumitrescu, and Jürgen Gausemeier. “Applying Model-Based Systems Engineering for Product Engineering Management - Concepts for Industrial Application.” In <i>1st International Symposium on Systems Engineering (IEEE ISSE), Rome, Italy, 28. - 30. Sep. 2015</i>, 2015.","short":"C. Tschirner, L.H. Bretz, R. Dumitrescu, J. Gausemeier, in: 1st International Symposium on Systems Engineering (IEEE ISSE), Rome, Italy, 28. - 30. Sep. 2015, 2015."},"publication":"1st International Symposium on Systems Engineering (IEEE ISSE), Rome, Italy, 28. - 30. Sep. 2015"}]