[{"has_accepted_license":"1","year":"2015","citation":{"apa":"Mohr, F., Jungmann, A., &#38; Kleine Büning, H. (2015). Automated Online Service Composition. In <i>Proceedings of the 12th IEEE International Conference on Services Computing (SCC)</i> (pp. 57--64). <a href=\"https://doi.org/10.1109/SCC.2015.18\">https://doi.org/10.1109/SCC.2015.18</a>","bibtex":"@inproceedings{Mohr_Jungmann_Kleine Büning_2015, title={Automated Online Service Composition}, DOI={<a href=\"https://doi.org/10.1109/SCC.2015.18\">10.1109/SCC.2015.18</a>}, booktitle={Proceedings of the 12th IEEE International Conference on Services Computing (SCC)}, author={Mohr, Felix and Jungmann, Alexander and Kleine Büning, Hans}, year={2015}, pages={57--64} }","short":"F. Mohr, A. Jungmann, H. Kleine Büning, in: Proceedings of the 12th IEEE International Conference on Services Computing (SCC), 2015, pp. 57--64.","mla":"Mohr, Felix, et al. “Automated Online Service Composition.” <i>Proceedings of the 12th IEEE International Conference on Services Computing (SCC)</i>, 2015, pp. 57--64, doi:<a href=\"https://doi.org/10.1109/SCC.2015.18\">10.1109/SCC.2015.18</a>.","ama":"Mohr F, Jungmann A, Kleine Büning H. Automated Online Service Composition. In: <i>Proceedings of the 12th IEEE International Conference on Services Computing (SCC)</i>. ; 2015:57--64. doi:<a href=\"https://doi.org/10.1109/SCC.2015.18\">10.1109/SCC.2015.18</a>","chicago":"Mohr, Felix, Alexander Jungmann, and Hans Kleine Büning. “Automated Online Service Composition.” In <i>Proceedings of the 12th IEEE International Conference on Services Computing (SCC)</i>, 57--64, 2015. <a href=\"https://doi.org/10.1109/SCC.2015.18\">https://doi.org/10.1109/SCC.2015.18</a>.","ieee":"F. Mohr, A. Jungmann, and H. Kleine Büning, “Automated Online Service Composition,” in <i>Proceedings of the 12th IEEE International Conference on Services Computing (SCC)</i>, 2015, pp. 57--64."},"page":"57--64","date_updated":"2022-01-06T06:59:04Z","date_created":"2017-10-17T12:41:54Z","author":[{"last_name":"Mohr","full_name":"Mohr, Felix","first_name":"Felix"},{"last_name":"Jungmann","full_name":"Jungmann, Alexander","first_name":"Alexander"},{"first_name":"Hans","full_name":"Kleine Büning, Hans","last_name":"Kleine Büning"}],"title":"Automated Online Service Composition","doi":"10.1109/SCC.2015.18","type":"conference","publication":"Proceedings of the 12th IEEE International Conference on Services Computing (SCC)","abstract":[{"text":"Services are self-contained and platform independent software components that aim at maximizing software reuse. The automated composition of services to a target software artifact has been tackled with many AI techniques, but existing approaches make unreasonably strong assumptions such as a predefined data flow, are limited to tiny problem sizes, ignore non-functional properties, or assume offline service repositories. This paper presents an algorithm that automatically composes services without making such assumptions. We employ a backward search algorithm that starts from an empty composition and prepends service calls to already discovered candidates until a solution is found. Available services are determined during the search process. We implemented our algorithm, performed an experimental evaluation, and compared it to other approaches.","lang":"eng"}],"file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":345742,"access_level":"closed","file_name":"319-07207336.pdf","file_id":"1434","date_updated":"2018-03-20T07:42:03Z","creator":"florida","date_created":"2018-03-20T07:42:03Z"}],"status":"public","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt B2","_id":"10"},{"name":"SFB 901 - Project Area B","_id":"3"}],"_id":"319","user_id":"477","department":[{"_id":"355"}],"ddc":["040"],"file_date_updated":"2018-03-20T07:42:03Z","language":[{"iso":"eng"}]},{"ddc":["040"],"file_date_updated":"2018-03-21T09:30:02Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"270","user_id":"477","department":[{"_id":"63"}],"file":[{"date_updated":"2018-03-21T09:30:02Z","creator":"florida","date_created":"2018-03-21T09:30:02Z","file_size":448614,"access_level":"closed","file_name":"270-Dissertation_-_Abshoff.pdf","file_id":"1476","content_type":"application/pdf","success":1,"relation":"main_file"}],"status":"public","type":"dissertation","title":"On the Complexity of Fundamental Problems in Dynamic Ad-hoc Networks","date_updated":"2022-01-06T06:57:32Z","publisher":"Universität Paderborn","date_created":"2017-10-17T12:41:44Z","author":[{"first_name":"Sebastian","last_name":"Abshoff","full_name":"Abshoff, Sebastian"}],"supervisor":[{"last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"year":"2015","citation":{"apa":"Abshoff, S. (2015). <i>On the Complexity of Fundamental Problems in Dynamic Ad-hoc Networks</i>. Universität Paderborn.","bibtex":"@book{Abshoff_2015, title={On the Complexity of Fundamental Problems in Dynamic Ad-hoc Networks}, publisher={Universität Paderborn}, author={Abshoff, Sebastian}, year={2015} }","mla":"Abshoff, Sebastian. <i>On the Complexity of Fundamental Problems in Dynamic Ad-Hoc Networks</i>. Universität Paderborn, 2015.","short":"S. Abshoff, On the Complexity of Fundamental Problems in Dynamic Ad-Hoc Networks, Universität Paderborn, 2015.","chicago":"Abshoff, Sebastian. <i>On the Complexity of Fundamental Problems in Dynamic Ad-Hoc Networks</i>. Universität Paderborn, 2015.","ieee":"S. Abshoff, <i>On the Complexity of Fundamental Problems in Dynamic Ad-hoc Networks</i>. Universität Paderborn, 2015.","ama":"Abshoff S. <i>On the Complexity of Fundamental Problems in Dynamic Ad-Hoc Networks</i>. Universität Paderborn; 2015."},"has_accepted_license":"1"},{"title":"On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games","date_created":"2017-10-17T12:41:45Z","year":"2015","ddc":["040"],"external_id":{"arxiv":["1507.02908"]},"abstract":[{"text":"In \\emph{bandwidth allocation games} (BAGs), the strategy of a player consists of various demands on different resources. The player's utility is at most the sum of these demands, provided they are fully satisfied. Every resource has a limited capacity and if it is exceeded by the total demand, it has to be split between the players. Since these games generally do not have pure Nash equilibria, we consider approximate pure Nash equilibria, in which no player can improve her utility by more than some fixed factor $\\alpha$ through unilateral strategy changes. There is a threshold $\\alpha_\\delta$ (where $\\delta$ is a parameter that limits the demand of each player on a specific resource) such that $\\alpha$-approximate pure Nash equilibria always exist for $\\alpha \\geq \\alpha_\\delta$, but not for $\\alpha < \\alpha_\\delta$. We give both upper and lower bounds on this threshold $\\alpha_\\delta$ and show that the corresponding decision problem is ${\\sf NP}$-hard. We also show that the $\\alpha$-approximate price of anarchy for BAGs is $\\alpha+1$. For a restricted version of the game, where demands of players only differ slightly from each other (e.g. symmetric games), we show that approximate Nash equilibria can be reached (and thus also be computed) in polynomial time using the best-response dynamic. Finally, we show that a broader class of utility-maximization games (which includes BAGs) converges quickly towards states whose social welfare is close to the optimum.","lang":"eng"}],"file":[{"date_created":"2018-03-21T09:29:34Z","creator":"florida","date_updated":"2018-03-21T09:29:34Z","access_level":"closed","file_id":"1475","file_name":"271-chp_3A10.1007_2F978-3-662-48433-3_14.pdf","file_size":256718,"content_type":"application/pdf","relation":"main_file","success":1}],"publication":"Proceedings of the 8th International Symposium on Algorithmic Game Theory (SAGT)","doi":"10.1007/978-3-662-48433-3_14","date_updated":"2022-01-06T06:57:34Z","author":[{"last_name":"Drees","full_name":"Drees, Maximilian","first_name":"Maximilian"},{"last_name":"Feldotto","orcid":"0000-0003-1348-6516","id":"14052","full_name":"Feldotto, Matthias","first_name":"Matthias"},{"full_name":"Riechers, Sören","last_name":"Riechers","first_name":"Sören"},{"last_name":"Skopalik","full_name":"Skopalik, Alexander","id":"40384","first_name":"Alexander"}],"page":"178-189","citation":{"mla":"Drees, Maximilian, et al. “On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games.” <i>Proceedings of the 8th International Symposium on Algorithmic Game Theory (SAGT)</i>, 2015, pp. 178–89, doi:<a href=\"https://doi.org/10.1007/978-3-662-48433-3_14\">10.1007/978-3-662-48433-3_14</a>.","bibtex":"@inproceedings{Drees_Feldotto_Riechers_Skopalik_2015, series={Lecture Notes in Computer Science}, title={On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games}, DOI={<a href=\"https://doi.org/10.1007/978-3-662-48433-3_14\">10.1007/978-3-662-48433-3_14</a>}, booktitle={Proceedings of the 8th International Symposium on Algorithmic Game Theory (SAGT)}, author={Drees, Maximilian and Feldotto, Matthias and Riechers, Sören and Skopalik, Alexander}, year={2015}, pages={178–189}, collection={Lecture Notes in Computer Science} }","short":"M. Drees, M. Feldotto, S. Riechers, A. Skopalik, in: Proceedings of the 8th International Symposium on Algorithmic Game Theory (SAGT), 2015, pp. 178–189.","apa":"Drees, M., Feldotto, M., Riechers, S., &#38; Skopalik, A. (2015). On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games. In <i>Proceedings of the 8th International Symposium on Algorithmic Game Theory (SAGT)</i> (pp. 178–189). <a href=\"https://doi.org/10.1007/978-3-662-48433-3_14\">https://doi.org/10.1007/978-3-662-48433-3_14</a>","ieee":"M. Drees, M. Feldotto, S. Riechers, and A. Skopalik, “On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games,” in <i>Proceedings of the 8th International Symposium on Algorithmic Game Theory (SAGT)</i>, 2015, pp. 178–189.","chicago":"Drees, Maximilian, Matthias Feldotto, Sören Riechers, and Alexander Skopalik. “On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games.” In <i>Proceedings of the 8th International Symposium on Algorithmic Game Theory (SAGT)</i>, 178–89. Lecture Notes in Computer Science, 2015. <a href=\"https://doi.org/10.1007/978-3-662-48433-3_14\">https://doi.org/10.1007/978-3-662-48433-3_14</a>.","ama":"Drees M, Feldotto M, Riechers S, Skopalik A. On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games. In: <i>Proceedings of the 8th International Symposium on Algorithmic Game Theory (SAGT)</i>. Lecture Notes in Computer Science. ; 2015:178-189. doi:<a href=\"https://doi.org/10.1007/978-3-662-48433-3_14\">10.1007/978-3-662-48433-3_14</a>"},"has_accepted_license":"1","file_date_updated":"2018-03-21T09:29:34Z","_id":"271","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"name":"SFB 901 - Subproject C4","_id":"16"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"4","name":"SFB 901 - Project Area C"}],"department":[{"_id":"63"},{"_id":"541"}],"series_title":"Lecture Notes in Computer Science","user_id":"14052","status":"public","type":"conference"},{"publication_status":"published","year":"2015","page":"39-53","intvolume":"       330","citation":{"apa":"Keil,  Reinhard , &#38; Selke, H. (2015). <i>Virtual knowledge {\\ “a} ume - From the presentation of content to virtual learning {\\” a} tten</i> (R. Keil &#38;  Harald Selke, Eds.; Vol. 330, pp. 39–53). publishing series of the Heinz Nixdorf Institute, Paderborn.","short":"Reinhard  Keil, H. Selke, in: R. Keil,  Harald Selke (Eds.), publishing series of the Heinz Nixdorf Institute, Paderborn, 2015, pp. 39–53.","mla":"Keil,  Reinhard , and Harald Selke. <i>Virtual Knowledge {\\ “A} Ume - From the Presentation of Content to Virtual Learning {\\” A} Tten</i>. Edited by Reinhard  Keil and  Harald Selke, vol. 330, publishing series of the Heinz Nixdorf Institute, Paderborn, 2015, pp. 39–53.","bibtex":"@inproceedings{Keil_Selke_2015, title={Virtual knowledge {\\ “a} ume - From the presentation of content to virtual learning {\\” a} tten}, volume={330}, publisher={publishing series of the Heinz Nixdorf Institute, Paderborn}, author={Keil,  Reinhard  and Selke, Harald}, editor={Keil, Reinhard  and Selke,  Harald}, year={2015}, pages={39–53} }","ama":"Keil  Reinhard , Selke H. Virtual knowledge {\\ “a} ume - From the presentation of content to virtual learning {\\” a} tten. In: Keil R, Selke  Harald, eds. Vol 330. publishing series of the Heinz Nixdorf Institute, Paderborn; 2015:39-53.","ieee":"Reinhard  Keil and H. Selke, “Virtual knowledge {\\ ‘a} ume - From the presentation of content to virtual learning {\\’ a} tten,” 2015, vol. 330, pp. 39–53.","chicago":"Keil,  Reinhard , and Harald Selke. “Virtual Knowledge {\\ ‘A} Ume - From the Presentation of Content to Virtual Learning {\\’ A} Tten.” edited by Reinhard  Keil and  Harald Selke, 330:39–53. publishing series of the Heinz Nixdorf Institute, Paderborn, 2015."},"publisher":"publishing series of the Heinz Nixdorf Institute, Paderborn","date_updated":"2022-01-06T06:57:35Z","volume":330,"date_created":"2021-11-05T22:48:51Z","author":[{"first_name":" Reinhard ","full_name":"Keil,  Reinhard ","last_name":"Keil"},{"last_name":"Selke","id":"497","full_name":"Selke, Harald","first_name":"Harald"}],"title":"Virtual knowledge {\\ \"a} ume - From the presentation of content to virtual learning {\\\" a} tten","type":"conference","editor":[{"last_name":"Keil","full_name":"Keil, Reinhard ","first_name":"Reinhard "},{"last_name":"Selke","full_name":"Selke,  Harald","first_name":" Harald"}],"status":"public","_id":"27163","department":[{"_id":"71"}],"user_id":"71124","language":[{"iso":"eng"}]},{"type":"dissertation","status":"public","department":[{"_id":"71"}],"user_id":"71124","_id":"27164","language":[{"iso":"eng"}],"citation":{"chicago":"Klompmaker, Florian. <i>Development of a Structured Process of Interaction Design for {\\ “U} r Nat {\\” U} Local User Interfaces</i>. Universit {\\ \"a} t Paderborn, Heinz Nixdorf Institute, Contextual Computer Science: Universitaetsbibliothek Paderborn, 2015.","ieee":"F. Klompmaker, <i>Development of a structured process of interaction design for {\\ “u} r nat {\\” u} local user interfaces</i>. Universit {\\ \"a} t Paderborn, Heinz Nixdorf Institute, Contextual Computer Science: Universitaetsbibliothek Paderborn, 2015.","ama":"Klompmaker F. <i>Development of a Structured Process of Interaction Design for {\\ “U} r Nat {\\” U} Local User Interfaces</i>. Universitaetsbibliothek Paderborn; 2015.","bibtex":"@book{Klompmaker_2015, place={Universit {\\ \"a} t Paderborn, Heinz Nixdorf Institute, Contextual Computer Science}, title={Development of a structured process of interaction design for {\\ “u} r nat {\\” u} local user interfaces}, publisher={Universitaetsbibliothek Paderborn}, author={Klompmaker, Florian}, year={2015} }","short":"F. Klompmaker, Development of a Structured Process of Interaction Design for {\\ “U} r Nat {\\” U} Local User Interfaces, Universitaetsbibliothek Paderborn, Universit {\\ \"a} t Paderborn, Heinz Nixdorf Institute, Contextual Computer Science, 2015.","mla":"Klompmaker, Florian. <i>Development of a Structured Process of Interaction Design for {\\ “U} r Nat {\\” U} Local User Interfaces</i>. Universitaetsbibliothek Paderborn, 2015.","apa":"Klompmaker, F. (2015). <i>Development of a structured process of interaction design for {\\ “u} r nat {\\” u} local user interfaces</i>. Universitaetsbibliothek Paderborn."},"place":"Universit {\\ \"a} t Paderborn, Heinz Nixdorf Institute, Contextual Computer Science","year":"2015","date_created":"2021-11-05T22:52:55Z","author":[{"first_name":"Florian","last_name":"Klompmaker","full_name":"Klompmaker, Florian"}],"date_updated":"2022-01-06T06:57:35Z","publisher":"Universitaetsbibliothek Paderborn","title":"Development of a structured process of interaction design for {\\ \"u} r nat {\\\" u} local user interfaces"},{"title":"Empirical validation of design patterns ","publisher":"De Gruyter Oldenbourg","date_updated":"2022-01-06T06:57:35Z","date_created":"2021-11-05T22:57:59Z","author":[{"full_name":"Schild,  Christian","last_name":"Schild","first_name":" Christian"},{"first_name":"Vanessa","last_name":" Petrausch","full_name":" Petrausch, Vanessa"}],"place":"Berlin","year":"2015","page":"173-182","citation":{"short":"Christian Schild, V.  Petrausch, in: De Gruyter Oldenbourg, Berlin, 2015, pp. 173–182.","mla":"Schild,  Christian, and Vanessa  Petrausch. <i>Empirical Validation of Design Patterns </i>. De Gruyter Oldenbourg, 2015, pp. 173–82.","bibtex":"@inproceedings{Schild_ Petrausch_2015, place={Berlin}, title={Empirical validation of design patterns }, publisher={De Gruyter Oldenbourg}, author={Schild,  Christian and  Petrausch, Vanessa}, year={2015}, pages={173–182} }","apa":"Schild,  Christian, &#38;  Petrausch, V. (2015). <i>Empirical validation of design patterns </i>. 173–182.","ama":"Schild  Christian,  Petrausch V. Empirical validation of design patterns . In: De Gruyter Oldenbourg; 2015:173-182.","chicago":"Schild,  Christian, and Vanessa  Petrausch. “Empirical Validation of Design Patterns ,” 173–82. Berlin: De Gruyter Oldenbourg, 2015.","ieee":"Christian Schild and V.  Petrausch, “Empirical validation of design patterns ,” 2015, pp. 173–182."},"publication_status":"published","language":[{"iso":"eng"}],"_id":"27165","department":[{"_id":"71"}],"user_id":"71124","abstract":[{"lang":"eng","text":"Patterns serve to codify design knowledge. By embedding them in a hypothesis-driven design, it is possible to develop them further into sample languages. For this it is necessary to resolve the underlying conflicts in the form of design hypotheses and to validate them empirically in order to enable further use and generalization. In this article, an experiment is presented that describes this procedure and demonstrates the interplay between theory formation and codification of design knowledge using two examples."}],"status":"public","type":"conference"},{"type":"mastersthesis","status":"public","_id":"273","project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"4","name":"SFB 901 - Project Area C"}],"department":[{"_id":"64"}],"user_id":"477","year":"2015","citation":{"apa":"Kohn, K. (2015). <i>Number of Voronoi-relevant vectors in lattices with respect to arbitrary norms</i>. Universität Paderborn.","bibtex":"@book{Kohn_2015, title={Number of Voronoi-relevant vectors in lattices with respect to arbitrary norms}, publisher={Universität Paderborn}, author={Kohn, Kathlén}, year={2015} }","mla":"Kohn, Kathlén. <i>Number of Voronoi-Relevant Vectors in Lattices with Respect to Arbitrary Norms</i>. Universität Paderborn, 2015.","short":"K. Kohn, Number of Voronoi-Relevant Vectors in Lattices with Respect to Arbitrary Norms, Universität Paderborn, 2015.","ama":"Kohn K. <i>Number of Voronoi-Relevant Vectors in Lattices with Respect to Arbitrary Norms</i>. Universität Paderborn; 2015.","chicago":"Kohn, Kathlén. <i>Number of Voronoi-Relevant Vectors in Lattices with Respect to Arbitrary Norms</i>. Universität Paderborn, 2015.","ieee":"K. Kohn, <i>Number of Voronoi-relevant vectors in lattices with respect to arbitrary norms</i>. Universität Paderborn, 2015."},"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:57:37Z","supervisor":[{"last_name":"Blömer","full_name":"Blömer, Johannes","id":"23","first_name":"Johannes"}],"author":[{"full_name":"Kohn, Kathlén","last_name":"Kohn","first_name":"Kathlén"}],"date_created":"2017-10-17T12:41:45Z","title":"Number of Voronoi-relevant vectors in lattices with respect to arbitrary norms"},{"_id":"274","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C4","_id":"16"},{"_id":"4","name":"SFB 901 - Project Area C"}],"department":[{"_id":"63"}],"series_title":"Lecture Notes in Computer Science","user_id":"15504","ddc":["040"],"file_date_updated":"2018-03-21T09:28:34Z","publication":"Algorithms and Data Structures: 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings","type":"conference","abstract":[{"text":"Consider the problem in which n jobs that are classified into k types are to be scheduled on m identical machines without preemption. A machine requires a proper setup taking s time units before processing jobs of a given type. The objective is to minimize the makespan of the resulting schedule. We design and analyze an approximation algorithm that runs in time polynomial in n,m and k and computes a solution with an approximation factor that can be made arbitrarily close to 3/2.","lang":"eng"}],"editor":[{"last_name":"Dehne","full_name":"Dehne, Frank","first_name":"Frank"},{"full_name":"Sack, Jörg Rüdiger","last_name":"Sack","first_name":"Jörg Rüdiger"},{"first_name":"Ulrike","last_name":"Stege","full_name":"Stege, Ulrike"}],"status":"public","file":[{"file_id":"1473","file_name":"274-chp_3A10.1007_2F978-3-319-21840-3_45.pdf","access_level":"closed","file_size":215498,"creator":"florida","date_created":"2018-03-21T09:28:34Z","date_updated":"2018-03-21T09:28:34Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"date_updated":"2022-01-06T06:57:39Z","author":[{"full_name":"Mäcker, Alexander","id":"13536","last_name":"Mäcker","first_name":"Alexander"},{"last_name":"Malatyali","full_name":"Malatyali, Manuel","first_name":"Manuel"},{"full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"first_name":"Sören","last_name":"Riechers","full_name":"Riechers, Sören"}],"date_created":"2017-10-17T12:41:45Z","title":"Non-preemptive Scheduling on Machines with Setup Times","doi":"10.1007/978-3-319-21840-3_45","has_accepted_license":"1","year":"2015","page":"542--553","citation":{"chicago":"Mäcker, Alexander, Manuel Malatyali, Friedhelm Meyer auf der Heide, and Sören Riechers. “Non-Preemptive Scheduling on Machines with Setup Times.” In <i>Algorithms and Data Structures: 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings</i>, edited by Frank Dehne, Jörg Rüdiger Sack, and Ulrike Stege, 542--553. Lecture Notes in Computer Science, 2015. <a href=\"https://doi.org/10.1007/978-3-319-21840-3_45\">https://doi.org/10.1007/978-3-319-21840-3_45</a>.","ieee":"A. Mäcker, M. Malatyali, F. Meyer auf der Heide, and S. Riechers, “Non-preemptive Scheduling on Machines with Setup Times,” in <i>Algorithms and Data Structures: 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings</i>, 2015, pp. 542--553.","ama":"Mäcker A, Malatyali M, Meyer auf der Heide F, Riechers S. Non-preemptive Scheduling on Machines with Setup Times. In: Dehne F, Sack JR, Stege U, eds. <i>Algorithms and Data Structures: 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings</i>. Lecture Notes in Computer Science. ; 2015:542--553. doi:<a href=\"https://doi.org/10.1007/978-3-319-21840-3_45\">10.1007/978-3-319-21840-3_45</a>","bibtex":"@inproceedings{Mäcker_Malatyali_Meyer auf der Heide_Riechers_2015, series={Lecture Notes in Computer Science}, title={Non-preemptive Scheduling on Machines with Setup Times}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-21840-3_45\">10.1007/978-3-319-21840-3_45</a>}, booktitle={Algorithms and Data Structures: 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings}, author={Mäcker, Alexander and Malatyali, Manuel and Meyer auf der Heide, Friedhelm and Riechers, Sören}, editor={Dehne, Frank and Sack, Jörg Rüdiger and Stege, UlrikeEditors}, year={2015}, pages={542--553}, collection={Lecture Notes in Computer Science} }","short":"A. Mäcker, M. Malatyali, F. Meyer auf der Heide, S. Riechers, in: F. Dehne, J.R. Sack, U. Stege (Eds.), Algorithms and Data Structures: 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings, 2015, pp. 542--553.","mla":"Mäcker, Alexander, et al. “Non-Preemptive Scheduling on Machines with Setup Times.” <i>Algorithms and Data Structures: 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings</i>, edited by Frank Dehne et al., 2015, pp. 542--553, doi:<a href=\"https://doi.org/10.1007/978-3-319-21840-3_45\">10.1007/978-3-319-21840-3_45</a>.","apa":"Mäcker, A., Malatyali, M., Meyer auf der Heide, F., &#38; Riechers, S. (2015). Non-preemptive Scheduling on Machines with Setup Times. In F. Dehne, J. R. Sack, &#38; U. Stege (Eds.), <i>Algorithms and Data Structures: 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings</i> (pp. 542--553). <a href=\"https://doi.org/10.1007/978-3-319-21840-3_45\">https://doi.org/10.1007/978-3-319-21840-3_45</a>"}},{"doi":"10.1007/978-3-662-48054-0_21","title":"Network Creation Games: Think Global - Act Local","date_created":"2017-10-17T12:41:45Z","author":[{"full_name":"Cord-Landwehr, Andreas","last_name":"Cord-Landwehr","first_name":"Andreas"},{"full_name":"Lenzner, Pascal","last_name":"Lenzner","first_name":"Pascal"}],"date_updated":"2022-01-06T06:57:40Z","page":"248--260","citation":{"apa":"Cord-Landwehr, A., &#38; Lenzner, P. (2015). Network Creation Games: Think Global - Act Local. In <i>Proceedings of the 40th Conference on Mathematical Foundations of Computer Science (MFCS)</i> (pp. 248--260). <a href=\"https://doi.org/10.1007/978-3-662-48054-0_21\">https://doi.org/10.1007/978-3-662-48054-0_21</a>","bibtex":"@inproceedings{Cord-Landwehr_Lenzner_2015, series={LNCS}, title={Network Creation Games: Think Global - Act Local}, DOI={<a href=\"https://doi.org/10.1007/978-3-662-48054-0_21\">10.1007/978-3-662-48054-0_21</a>}, booktitle={Proceedings of the 40th Conference on Mathematical Foundations of Computer Science (MFCS)}, author={Cord-Landwehr, Andreas and Lenzner, Pascal}, year={2015}, pages={248--260}, collection={LNCS} }","short":"A. Cord-Landwehr, P. Lenzner, in: Proceedings of the 40th Conference on Mathematical Foundations of Computer Science (MFCS), 2015, pp. 248--260.","mla":"Cord-Landwehr, Andreas, and Pascal Lenzner. “Network Creation Games: Think Global - Act Local.” <i>Proceedings of the 40th Conference on Mathematical Foundations of Computer Science (MFCS)</i>, 2015, pp. 248--260, doi:<a href=\"https://doi.org/10.1007/978-3-662-48054-0_21\">10.1007/978-3-662-48054-0_21</a>.","ama":"Cord-Landwehr A, Lenzner P. Network Creation Games: Think Global - Act Local. In: <i>Proceedings of the 40th Conference on Mathematical Foundations of Computer Science (MFCS)</i>. LNCS. ; 2015:248--260. doi:<a href=\"https://doi.org/10.1007/978-3-662-48054-0_21\">10.1007/978-3-662-48054-0_21</a>","chicago":"Cord-Landwehr, Andreas, and Pascal Lenzner. “Network Creation Games: Think Global - Act Local.” In <i>Proceedings of the 40th Conference on Mathematical Foundations of Computer Science (MFCS)</i>, 248--260. LNCS, 2015. <a href=\"https://doi.org/10.1007/978-3-662-48054-0_21\">https://doi.org/10.1007/978-3-662-48054-0_21</a>.","ieee":"A. Cord-Landwehr and P. Lenzner, “Network Creation Games: Think Global - Act Local,” in <i>Proceedings of the 40th Conference on Mathematical Foundations of Computer Science (MFCS)</i>, 2015, pp. 248--260."},"year":"2015","has_accepted_license":"1","language":[{"iso":"eng"}],"file_date_updated":"2018-03-21T09:27:12Z","ddc":["040"],"department":[{"_id":"63"}],"user_id":"477","series_title":"LNCS","_id":"275","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"status":"public","file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-03-21T09:27:12Z","creator":"florida","date_created":"2018-03-21T09:27:12Z","file_size":279995,"file_id":"1472","access_level":"closed","file_name":"275-978-3-662-48054-0_21.pdf"}],"abstract":[{"text":"We investigate a non-cooperative game-theoretic model for the formation of communication networks by selfish agents. Each agent aims for a central position at minimum cost for creating edges. In particular, the general model (Fabrikant et al., PODC'03) became popular for studying the structure of the Internet or social networks. Despite its significance, locality in this game was first studied only recently (Bilò et al., SPAA'14), where a worst case locality model was presented, which came with a high efficiency loss in terms of quality of equilibria. Our main contribution is a new and more optimistic view on locality: agents are limited in their knowledge and actions to their local view ranges, but can probe different strategies and finally choose the best. We study the influence of our locality notion on the hardness of computing best responses, convergence to equilibria, and quality of equilibria. Moreover, we compare the strength of local versus non-local strategy changes. Our results address the gap between the original model and the worst case locality variant. On the bright side, our efficiency results are in line with observations from the original model, yet we have a non-constant lower bound on the Price of Anarchy.","lang":"eng"}],"publication":"Proceedings of the 40th Conference on Mathematical Foundations of Computer Science (MFCS)","type":"conference"},{"year":"2015","citation":{"ama":"Kothe N. <i>Multilevel Netzwerk Spiele mit konstanten Entfernungen im Highspeed-Netzwerk</i>. Universität Paderborn; 2015.","chicago":"Kothe, Nils. <i>Multilevel Netzwerk Spiele mit konstanten Entfernungen im Highspeed-Netzwerk</i>. Universität Paderborn, 2015.","ieee":"N. Kothe, <i>Multilevel Netzwerk Spiele mit konstanten Entfernungen im Highspeed-Netzwerk</i>. Universität Paderborn, 2015.","apa":"Kothe, N. (2015). <i>Multilevel Netzwerk Spiele mit konstanten Entfernungen im Highspeed-Netzwerk</i>. Universität Paderborn.","mla":"Kothe, Nils. <i>Multilevel Netzwerk Spiele mit konstanten Entfernungen im Highspeed-Netzwerk</i>. Universität Paderborn, 2015.","bibtex":"@book{Kothe_2015, title={Multilevel Netzwerk Spiele mit konstanten Entfernungen im Highspeed-Netzwerk}, publisher={Universität Paderborn}, author={Kothe, Nils}, year={2015} }","short":"N. Kothe, Multilevel Netzwerk Spiele mit konstanten Entfernungen im Highspeed-Netzwerk, Universität Paderborn, 2015."},"title":"Multilevel Netzwerk Spiele mit konstanten Entfernungen im Highspeed-Netzwerk","date_updated":"2022-01-06T06:57:44Z","publisher":"Universität Paderborn","supervisor":[{"last_name":"Skopalik","full_name":"Skopalik, Alexander","id":"40384","first_name":"Alexander"}],"author":[{"first_name":"Nils","last_name":"Kothe","full_name":"Kothe, Nils"}],"date_created":"2017-10-17T12:41:46Z","status":"public","type":"bachelorsthesis","language":[{"iso":"ger"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"_id":"277","user_id":"14052","department":[{"_id":"63"},{"_id":"541"}]},{"language":[{"iso":"eng"}],"department":[{"_id":"79"}],"user_id":"477","_id":"278","project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"status":"public","type":"mastersthesis","title":"Monotonic Searchability for distributed sorted Lists and De Bruijn Graphs","supervisor":[{"full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler","first_name":"Christian"}],"date_created":"2017-10-17T12:41:46Z","author":[{"first_name":"Michael","last_name":"Feldmann","id":"23538","full_name":"Feldmann, Michael"}],"date_updated":"2022-01-06T06:57:45Z","publisher":"Universität Paderborn","citation":{"ama":"Feldmann M. <i>Monotonic Searchability for Distributed Sorted Lists and De Bruijn Graphs</i>. Universität Paderborn; 2015.","chicago":"Feldmann, Michael. <i>Monotonic Searchability for Distributed Sorted Lists and De Bruijn Graphs</i>. Universität Paderborn, 2015.","ieee":"M. Feldmann, <i>Monotonic Searchability for distributed sorted Lists and De Bruijn Graphs</i>. Universität Paderborn, 2015.","apa":"Feldmann, M. (2015). <i>Monotonic Searchability for distributed sorted Lists and De Bruijn Graphs</i>. Universität Paderborn.","mla":"Feldmann, Michael. <i>Monotonic Searchability for Distributed Sorted Lists and De Bruijn Graphs</i>. Universität Paderborn, 2015.","bibtex":"@book{Feldmann_2015, title={Monotonic Searchability for distributed sorted Lists and De Bruijn Graphs}, publisher={Universität Paderborn}, author={Feldmann, Michael}, year={2015} }","short":"M. Feldmann, Monotonic Searchability for Distributed Sorted Lists and De Bruijn Graphs, Universität Paderborn, 2015."},"year":"2015"},{"publication":"Proceedings of the 18th International ACM Sigsoft Symposium on Component-Based Software Engineering (CBSE'15)","type":"conference","status":"public","file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-03-21T09:26:40Z","date_created":"2018-03-21T09:26:40Z","creator":"florida","file_size":2090964,"file_name":"279-p75-platenius.pdf","file_id":"1471","access_level":"closed"}],"abstract":[{"lang":"eng","text":"Service discovery in global software markets is performed by brokers who act as intermediaries between service consumers and service providers.In order to discover services, brokers apply service matching for determining whether the specification of a provided service satisfies the consumer's requirements.Brokers can already choose between a lot of different service matching approaches considering different service properties (structural, behavioral, and non-functional properties).Different matching approaches can be combined into configurable matching processes leading to a high matching quality (e.g., accurate matching results). However, this combination and configuration is a manual procedure and has to be repeated for different consumers' or market requirements regarding matching quality. In this paper, we propose our framework MatchBox, which supports a broker in reusing existing matching approaches and combining them in a model-driven way based on a reconfigurable model of the matching process.Using this reconfigurable model, MatchBox takes care of control and data flow between matching approaches and executes the modeled processes automatically.As a case study, we integrated eleven matchers into MatchBox to demonstrate that it remains flexibility and reduces effort for a broker at the same time."}],"department":[{"_id":"76"},{"_id":"66"}],"user_id":"477","_id":"279","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area B","_id":"3"},{"_id":"9","name":"SFB 901 - Subproject B1"}],"language":[{"iso":"eng"}],"file_date_updated":"2018-03-21T09:26:40Z","ddc":["040"],"has_accepted_license":"1","page":"75-84","citation":{"mla":"Platenius, Marie Christin, et al. “MatchBox: A Framework for Dynamic Configuration of Service Matching Processes.” <i>Proceedings of the 18th International ACM Sigsoft Symposium on Component-Based Software Engineering (CBSE’15)</i>, 2015, pp. 75–84, doi:<a href=\"https://doi.org/10.1145/2737166.2737174\">10.1145/2737166.2737174</a>.","short":"M.C. Platenius, S. Arifulina, W. Schäfer, in: Proceedings of the 18th International ACM Sigsoft Symposium on Component-Based Software Engineering (CBSE’15), 2015, pp. 75–84.","bibtex":"@inproceedings{Platenius_Arifulina_Schäfer_2015, title={MatchBox: A Framework for Dynamic Configuration of Service Matching Processes}, DOI={<a href=\"https://doi.org/10.1145/2737166.2737174\">10.1145/2737166.2737174</a>}, booktitle={Proceedings of the 18th International ACM Sigsoft Symposium on Component-Based Software Engineering (CBSE’15)}, author={Platenius, Marie Christin and Arifulina, Svetlana and Schäfer, Wilhelm}, year={2015}, pages={75–84} }","apa":"Platenius, M. C., Arifulina, S., &#38; Schäfer, W. (2015). MatchBox: A Framework for Dynamic Configuration of Service Matching Processes. In <i>Proceedings of the 18th International ACM Sigsoft Symposium on Component-Based Software Engineering (CBSE’15)</i> (pp. 75–84). <a href=\"https://doi.org/10.1145/2737166.2737174\">https://doi.org/10.1145/2737166.2737174</a>","ama":"Platenius MC, Arifulina S, Schäfer W. MatchBox: A Framework for Dynamic Configuration of Service Matching Processes. In: <i>Proceedings of the 18th International ACM Sigsoft Symposium on Component-Based Software Engineering (CBSE’15)</i>. ; 2015:75-84. doi:<a href=\"https://doi.org/10.1145/2737166.2737174\">10.1145/2737166.2737174</a>","chicago":"Platenius, Marie Christin, Svetlana Arifulina, and Wilhelm Schäfer. “MatchBox: A Framework for Dynamic Configuration of Service Matching Processes.” In <i>Proceedings of the 18th International ACM Sigsoft Symposium on Component-Based Software Engineering (CBSE’15)</i>, 75–84, 2015. <a href=\"https://doi.org/10.1145/2737166.2737174\">https://doi.org/10.1145/2737166.2737174</a>.","ieee":"M. C. Platenius, S. Arifulina, and W. Schäfer, “MatchBox: A Framework for Dynamic Configuration of Service Matching Processes,” in <i>Proceedings of the 18th International ACM Sigsoft Symposium on Component-Based Software Engineering (CBSE’15)</i>, 2015, pp. 75–84."},"year":"2015","date_created":"2017-10-17T12:41:46Z","author":[{"first_name":"Marie Christin","last_name":"Platenius","full_name":"Platenius, Marie Christin"},{"first_name":"Svetlana","full_name":"Arifulina, Svetlana","last_name":"Arifulina"},{"full_name":"Schäfer, Wilhelm","last_name":"Schäfer","first_name":"Wilhelm"}],"date_updated":"2022-01-06T06:57:48Z","doi":"10.1145/2737166.2737174","title":"MatchBox: A Framework for Dynamic Configuration of Service Matching Processes"},{"user_id":"5786","date_created":"2021-01-13T13:21:34Z","author":[{"first_name":"Wilhelm","last_name":"Schäfer","full_name":"Schäfer, Wilhelm"},{"orcid":"http://orcid.org/0000-0002-8679-6673","last_name":"Dziwok","id":"3901","full_name":"Dziwok, Stefan","first_name":"Stefan"},{"last_name":"Pohlmann","full_name":"Pohlmann, Uwe","first_name":"Uwe"},{"last_name":"Bobolz","full_name":"Bobolz, Jan","first_name":"Jan"},{"first_name":"Mike","full_name":"Czech, Mike","last_name":"Czech"},{"first_name":"Andreas Peter","full_name":"Dann, Andreas Peter","last_name":"Dann"},{"full_name":"Geismann, Johannes","last_name":"Geismann","first_name":"Johannes"},{"last_name":"Hüwe","id":"13606","full_name":"Hüwe, Marcus","first_name":"Marcus"},{"first_name":"Arthur","full_name":"Krieger, Arthur","last_name":"Krieger"},{"first_name":"Goran","full_name":"Piskachev, Goran","last_name":"Piskachev"},{"first_name":"David","last_name":"Schubert","full_name":"Schubert, David","id":"9106"},{"first_name":"Rebekka","last_name":"Wohlrab","full_name":"Wohlrab, Rebekka"}],"department":[{"_id":"76"}],"date_updated":"2022-01-06T06:54:42Z","_id":"20977","language":[{"iso":"eng"}],"title":"Seminar Theses of the Project Group Cybertron","type":"report","citation":{"ama":"Schäfer W, Dziwok S, Pohlmann U, et al. <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.","ieee":"W. Schäfer <i>et al.</i>, <i>Seminar Theses of the Project Group Cybertron</i>. 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>.","mla":"Schäfer, Wilhelm, 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.","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} }"},"status":"public","year":"2015"},{"status":"public","editor":[{"last_name":"Chechik","full_name":"Chechik, Marsha","first_name":"Marsha"},{"first_name":"Dimitris","last_name":"Kolovos","full_name":"Kolovos, Dimitris"}],"publication":"Proceedings of the Doctoral Symposium of the ACM/IEEE 18th International Conference on Model Driven Engineering Languages and Systems","type":"conference","language":[{"iso":"eng"}],"department":[{"_id":"76"}],"user_id":"5786","_id":"20979","citation":{"bibtex":"@inproceedings{Stockmann_2015, title={Debugging Models in the Context of Automotive Software Development}, booktitle={Proceedings of the Doctoral Symposium of the ACM/IEEE 18th International Conference on Model Driven Engineering Languages and Systems}, author={Stockmann, Lars}, editor={Chechik, Marsha and Kolovos, Dimitris}, year={2015} }","short":"L. Stockmann, in: M. Chechik, D. Kolovos (Eds.), Proceedings of the Doctoral Symposium of the ACM/IEEE 18th International Conference on Model Driven Engineering Languages and Systems, 2015.","mla":"Stockmann, Lars. “Debugging Models in the Context of Automotive Software Development.” <i>Proceedings of the Doctoral Symposium of the ACM/IEEE 18th International Conference on Model Driven Engineering Languages and Systems</i>, edited by Marsha Chechik and Dimitris Kolovos, 2015.","apa":"Stockmann, L. (2015). Debugging Models in the Context of Automotive Software Development. In M. Chechik &#38; D. Kolovos (Eds.), <i>Proceedings of the Doctoral Symposium of the ACM/IEEE 18th International Conference on Model Driven Engineering Languages and Systems</i>.","ama":"Stockmann L. Debugging Models in the Context of Automotive Software Development. In: Chechik M, Kolovos D, eds. <i>Proceedings of the Doctoral Symposium of the ACM/IEEE 18th International Conference on Model Driven Engineering Languages and Systems</i>. ; 2015.","ieee":"L. Stockmann, “Debugging Models in the Context of Automotive Software Development,” in <i>Proceedings of the Doctoral Symposium of the ACM/IEEE 18th International Conference on Model Driven Engineering Languages and Systems</i>, 2015.","chicago":"Stockmann, Lars. “Debugging Models in the Context of Automotive Software Development.” In <i>Proceedings of the Doctoral Symposium of the ACM/IEEE 18th International Conference on Model Driven Engineering Languages and Systems</i>, edited by Marsha Chechik and Dimitris Kolovos, 2015."},"year":"2015","title":"Debugging Models in the Context of Automotive Software Development","date_created":"2021-01-13T13:27:27Z","author":[{"id":"48144","full_name":"Stockmann, Lars","last_name":"Stockmann","first_name":"Lars"}],"date_updated":"2022-01-06T06:54:42Z"},{"page":"65-78","intvolume":"       343","citation":{"ama":"Berssenbrügge J, Wiederkehr O, Jähn C, Fischer M. Anbindung des Virtuellen Prototypen an die Partialmodelle intelligenter technischer Systeme. In: <i>12. Paderborner Workshop Augmented &#38; Virtual Reality in Der Produktentstehung</i>. Vol 343. Verlagsschriftenreihe des Heinz Nixdorf Instituts; 2015:65-78.","ieee":"J. Berssenbrügge, O. Wiederkehr, C. Jähn, and M. Fischer, “Anbindung des Virtuellen Prototypen an die Partialmodelle intelligenter technischer Systeme,” in <i>12. Paderborner Workshop Augmented &#38; Virtual Reality in der Produktentstehung</i>, 2015, vol. 343, pp. 65–78.","chicago":"Berssenbrügge, Jan , Olga Wiederkehr, Claudius Jähn, and Matthias Fischer. “Anbindung Des Virtuellen Prototypen an Die Partialmodelle Intelligenter Technischer Systeme.” In <i>12. Paderborner Workshop Augmented &#38; Virtual Reality in Der Produktentstehung</i>, 343:65–78. Paderborn: Verlagsschriftenreihe des Heinz Nixdorf Instituts, 2015.","bibtex":"@inproceedings{Berssenbrügge_Wiederkehr_Jähn_Fischer_2015, place={Paderborn}, title={Anbindung des Virtuellen Prototypen an die Partialmodelle intelligenter technischer Systeme}, volume={343}, booktitle={12. Paderborner Workshop Augmented &#38; Virtual Reality in der Produktentstehung}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts}, author={Berssenbrügge, Jan  and Wiederkehr, Olga and Jähn, Claudius and Fischer, Matthias}, year={2015}, pages={65–78} }","mla":"Berssenbrügge, Jan, et al. “Anbindung Des Virtuellen Prototypen an Die Partialmodelle Intelligenter Technischer Systeme.” <i>12. Paderborner Workshop Augmented &#38; Virtual Reality in Der Produktentstehung</i>, vol. 343, Verlagsschriftenreihe des Heinz Nixdorf Instituts, 2015, pp. 65–78.","short":"J. Berssenbrügge, O. Wiederkehr, C. Jähn, M. Fischer, in: 12. Paderborner Workshop Augmented &#38; Virtual Reality in Der Produktentstehung, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2015, pp. 65–78.","apa":"Berssenbrügge, J., Wiederkehr, O., Jähn, C., &#38; Fischer, M. (2015). Anbindung des Virtuellen Prototypen an die Partialmodelle intelligenter technischer Systeme. <i>12. Paderborner Workshop Augmented &#38; Virtual Reality in Der Produktentstehung</i>, <i>343</i>, 65–78."},"place":"Paderborn","year":"2015","volume":343,"author":[{"last_name":"Berssenbrügge","full_name":"Berssenbrügge, Jan ","first_name":"Jan "},{"full_name":"Wiederkehr, Olga","last_name":"Wiederkehr","first_name":"Olga"},{"first_name":"Claudius","last_name":"Jähn","full_name":"Jähn, Claudius"},{"id":"146","full_name":"Fischer, Matthias","last_name":"Fischer","first_name":"Matthias"}],"date_created":"2020-07-28T09:49:42Z","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts","date_updated":"2022-01-06T06:53:11Z","title":"Anbindung des Virtuellen Prototypen an die Partialmodelle intelligenter technischer Systeme","publication":"12. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung","type":"conference","status":"public","department":[{"_id":"63"},{"_id":"26"}],"user_id":"15415","_id":"17425","language":[{"iso":"eng"}]},{"_id":"17427","user_id":"15415","department":[{"_id":"63"},{"_id":"26"}],"language":[{"iso":"eng"}],"type":"conference","publication":"12. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung","status":"public","date_updated":"2022-01-06T06:53:11Z","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts","author":[{"first_name":"Claudius","last_name":"Jähn","full_name":"Jähn, Claudius"},{"last_name":"Fischer","full_name":"Fischer, Matthias","id":"146","first_name":"Matthias"},{"last_name":"Gerges","full_name":"Gerges, Maria","first_name":"Maria"},{"first_name":"Jan","last_name":"Berssenbrügge","full_name":"Berssenbrügge, Jan"}],"date_created":"2020-07-28T10:23:18Z","volume":342,"title":"Automatische Ableitung geometrischer Eigenschaften von Bauteilen aus dem 3-D-Polygonmodell","place":"Paderborn","year":"2015","citation":{"apa":"Jähn, C., Fischer, M., Gerges, M., &#38; Berssenbrügge, J. (2015). Automatische Ableitung geometrischer Eigenschaften von Bauteilen aus dem 3-D-Polygonmodell. <i>12. Paderborner Workshop Augmented &#38; Virtual Reality in Der Produktentstehung</i>, <i>342</i>, 107–120.","bibtex":"@inproceedings{Jähn_Fischer_Gerges_Berssenbrügge_2015, place={Paderborn}, title={Automatische Ableitung geometrischer Eigenschaften von Bauteilen aus dem 3-D-Polygonmodell}, volume={342}, booktitle={12. Paderborner Workshop Augmented &#38; Virtual Reality in der Produktentstehung}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts}, author={Jähn, Claudius and Fischer, Matthias and Gerges, Maria and Berssenbrügge, Jan}, year={2015}, pages={107–120} }","mla":"Jähn, Claudius, et al. “Automatische Ableitung Geometrischer Eigenschaften von Bauteilen Aus Dem 3-D-Polygonmodell.” <i>12. Paderborner Workshop Augmented &#38; Virtual Reality in Der Produktentstehung</i>, vol. 342, Verlagsschriftenreihe des Heinz Nixdorf Instituts, 2015, pp. 107–20.","short":"C. Jähn, M. Fischer, M. Gerges, J. Berssenbrügge, in: 12. Paderborner Workshop Augmented &#38; Virtual Reality in Der Produktentstehung, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2015, pp. 107–120.","ieee":"C. Jähn, M. Fischer, M. Gerges, and J. Berssenbrügge, “Automatische Ableitung geometrischer Eigenschaften von Bauteilen aus dem 3-D-Polygonmodell,” in <i>12. Paderborner Workshop Augmented &#38; Virtual Reality in der Produktentstehung</i>, 2015, vol. 342, pp. 107–120.","chicago":"Jähn, Claudius, Matthias Fischer, Maria Gerges, and Jan Berssenbrügge. “Automatische Ableitung Geometrischer Eigenschaften von Bauteilen Aus Dem 3-D-Polygonmodell.” In <i>12. Paderborner Workshop Augmented &#38; Virtual Reality in Der Produktentstehung</i>, 342:107–20. Paderborn: Verlagsschriftenreihe des Heinz Nixdorf Instituts, 2015.","ama":"Jähn C, Fischer M, Gerges M, Berssenbrügge J. Automatische Ableitung geometrischer Eigenschaften von Bauteilen aus dem 3-D-Polygonmodell. In: <i>12. Paderborner Workshop Augmented &#38; Virtual Reality in Der Produktentstehung</i>. Vol 342. Verlagsschriftenreihe des Heinz Nixdorf Instituts; 2015:107-120."},"page":"107-120","intvolume":"       342"},{"publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts","date_updated":"2022-01-06T06:53:12Z","volume":342,"date_created":"2020-07-28T13:39:25Z","title":"Augmented & Virtual Reality in der Produktentstehung: Grundlagen, Methoden und Werkzeuge; Interaktions- und Visualisierungstechniken, Virtual Prototyping intelligenter technischer Systeme mit AR/VR","edition":"12. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung","year":"2015","place":"Paderborn","intvolume":"       342","citation":{"apa":"Gausemeier, J., Grafe, M., &#38; Meyer auf der Heide, F. (Eds.). (2015). <i>Augmented &#38; Virtual Reality in der Produktentstehung: Grundlagen, Methoden und Werkzeuge; Interaktions- und Visualisierungstechniken, Virtual Prototyping intelligenter technischer Systeme mit AR/VR</i> (12. Paderborner Workshop Augmented &#38; Virtual Reality in der Produktentstehung, Vol. 342). Verlagsschriftenreihe des Heinz Nixdorf Instituts.","bibtex":"@book{Gausemeier_Grafe_Meyer auf der Heide_2015, place={Paderborn}, edition={12. Paderborner Workshop Augmented &#38; Virtual Reality in der Produktentstehung}, title={Augmented &#38; Virtual Reality in der Produktentstehung: Grundlagen, Methoden und Werkzeuge; Interaktions- und Visualisierungstechniken, Virtual Prototyping intelligenter technischer Systeme mit AR/VR}, volume={342}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts}, year={2015} }","short":"J. Gausemeier, M. Grafe, F. Meyer auf der Heide, eds., Augmented &#38; Virtual Reality in Der Produktentstehung: Grundlagen, Methoden Und Werkzeuge; Interaktions- Und Visualisierungstechniken, Virtual Prototyping Intelligenter Technischer Systeme Mit AR/VR, 12. Paderborner Workshop Augmented &#38; Virtual Reality in der Produktentstehung, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2015.","mla":"Gausemeier, Jürgen, et al., editors. <i>Augmented &#38; Virtual Reality in Der Produktentstehung: Grundlagen, Methoden Und Werkzeuge; Interaktions- Und Visualisierungstechniken, Virtual Prototyping Intelligenter Technischer Systeme Mit AR/VR</i>. 12. Paderborner Workshop Augmented &#38; Virtual Reality in der Produktentstehung, vol. 342, Verlagsschriftenreihe des Heinz Nixdorf Instituts, 2015.","ama":"Gausemeier J, Grafe M, Meyer auf der Heide F, eds. <i>Augmented &#38; Virtual Reality in Der Produktentstehung: Grundlagen, Methoden Und Werkzeuge; Interaktions- Und Visualisierungstechniken, Virtual Prototyping Intelligenter Technischer Systeme Mit AR/VR</i>. Vol 342. 12. Paderborner Workshop Augmented &#38; Virtual Reality in der Produktentstehung. Verlagsschriftenreihe des Heinz Nixdorf Instituts; 2015.","ieee":"J. Gausemeier, M. Grafe, and F. Meyer auf der Heide, Eds., <i>Augmented &#38; Virtual Reality in der Produktentstehung: Grundlagen, Methoden und Werkzeuge; Interaktions- und Visualisierungstechniken, Virtual Prototyping intelligenter technischer Systeme mit AR/VR</i>, 12. Paderborner Workshop Augmented &#38; Virtual Reality in der Produktentstehung., vol. 342. Paderborn: Verlagsschriftenreihe des Heinz Nixdorf Instituts, 2015.","chicago":"Gausemeier, Jürgen, Michael Grafe, and Friedhelm Meyer auf der Heide, eds. <i>Augmented &#38; Virtual Reality in Der Produktentstehung: Grundlagen, Methoden Und Werkzeuge; Interaktions- Und Visualisierungstechniken, Virtual Prototyping Intelligenter Technischer Systeme Mit AR/VR</i>. 12. Paderborner Workshop Augmented &#38; Virtual Reality in der Produktentstehung. Vol. 342. Paderborn: Verlagsschriftenreihe des Heinz Nixdorf Instituts, 2015."},"_id":"17431","department":[{"_id":"63"},{"_id":"26"}],"user_id":"15415","language":[{"iso":"eng"}],"type":"book_editor","editor":[{"last_name":"Gausemeier","full_name":"Gausemeier, Jürgen","first_name":"Jürgen"},{"last_name":"Grafe","full_name":"Grafe, Michael","first_name":"Michael"},{"last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"status":"public"},{"extern":"1","language":[{"iso":"eng"}],"keyword":["Approximation algorithms","Approximation methods","Bandwidth","Cloud computing","Routing","Schedules","Scheduling"],"user_id":"83983","department":[{"_id":"63"},{"_id":"541"}],"_id":"17657","status":"public","abstract":[{"text":"Inter-datacenter transfers of non-interactive but timely large flows over a private (managed) network is an important problem faced by many cloud service providers. The considered flows are non-interactive because they do not explicitly target the end users. However, most of them must be performed on a timely basis and are associated with a deadline. We propose to schedule these flows by a centralized controller, which determines when to transmit each flow and which path to use. Two scheduling models are presented in this paper. In the first, the controller also determines the rate of each flow, while in the second bandwidth is assigned by the network according to the TCP rules. We develop scheduling algorithms for both models and compare their complexity and performance.","lang":"eng"}],"type":"journal_article","publication":"Cloud Computing, IEEE Transactions on","doi":"10.1109/TCC.2015.2487964","title":"Inter-Datacenter Scheduling of Large Data Flows","date_created":"2020-08-06T15:20:58Z","author":[{"first_name":"R.","last_name":"Cohen","full_name":"Cohen, R."},{"first_name":"Gleb","full_name":"Polevoy, Gleb","id":"83983","last_name":"Polevoy"}],"volume":"PP","date_updated":"2022-01-06T06:53:16Z","citation":{"ieee":"R. Cohen and G. Polevoy, “Inter-Datacenter Scheduling of Large Data Flows,” <i>Cloud Computing, IEEE Transactions on</i>, vol. PP, no. 99, pp. 1–1, 2015.","chicago":"Cohen, R., and Gleb Polevoy. “Inter-Datacenter Scheduling of Large Data Flows.” <i>Cloud Computing, IEEE Transactions On</i> PP, no. 99 (2015): 1–1. <a href=\"https://doi.org/10.1109/TCC.2015.2487964\">https://doi.org/10.1109/TCC.2015.2487964</a>.","ama":"Cohen R, Polevoy G. Inter-Datacenter Scheduling of Large Data Flows. <i>Cloud Computing, IEEE Transactions on</i>. 2015;PP(99):1-1. doi:<a href=\"https://doi.org/10.1109/TCC.2015.2487964\">10.1109/TCC.2015.2487964</a>","apa":"Cohen, R., &#38; Polevoy, G. (2015). Inter-Datacenter Scheduling of Large Data Flows. <i>Cloud Computing, IEEE Transactions On</i>, <i>PP</i>(99), 1–1. <a href=\"https://doi.org/10.1109/TCC.2015.2487964\">https://doi.org/10.1109/TCC.2015.2487964</a>","bibtex":"@article{Cohen_Polevoy_2015, title={Inter-Datacenter Scheduling of Large Data Flows}, volume={PP}, DOI={<a href=\"https://doi.org/10.1109/TCC.2015.2487964\">10.1109/TCC.2015.2487964</a>}, number={99}, journal={Cloud Computing, IEEE Transactions on}, author={Cohen, R. and Polevoy, Gleb}, year={2015}, pages={1–1} }","short":"R. Cohen, G. Polevoy, Cloud Computing, IEEE Transactions On PP (2015) 1–1.","mla":"Cohen, R., and Gleb Polevoy. “Inter-Datacenter Scheduling of Large Data Flows.” <i>Cloud Computing, IEEE Transactions On</i>, vol. PP, no. 99, 2015, pp. 1–1, doi:<a href=\"https://doi.org/10.1109/TCC.2015.2487964\">10.1109/TCC.2015.2487964</a>."},"page":"1-1","year":"2015","issue":"99","publication_identifier":{"issn":["2168-7161"]}},{"publisher":"Elsevier","date_updated":"2022-01-06T06:53:16Z","date_created":"2020-08-06T15:21:15Z","author":[{"first_name":"Reuven","last_name":"Bar-Yehuda","full_name":"Bar-Yehuda, Reuven"},{"first_name":"Gleb","last_name":"Polevoy","full_name":"Polevoy, Gleb","id":"83983"},{"first_name":"Dror","full_name":"Rawitz, Dror","last_name":"Rawitz"}],"volume":194,"title":"Bandwidth allocation in cellular networks with multiple interferences","doi":"http://dx.doi.org/10.1016/j.dam.2015.05.013","publication_identifier":{"issn":["0166-218X"]},"year":"2015","citation":{"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.","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>.","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} }","short":"R. Bar-Yehuda, G. Polevoy, D. Rawitz, Discrete Applied Mathematics  194 (2015) 23–36.","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>.","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>"},"intvolume":"       194","page":"23 - 36","_id":"17658","user_id":"83983","department":[{"_id":"63"},{"_id":"541"}],"keyword":["Local ratio"],"language":[{"iso":"eng"}],"extern":"1","type":"journal_article","publication":"Discrete Applied Mathematics ","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"}],"status":"public"},{"issue":"9","year":"2015","page":"440-450","intvolume":"        82","citation":{"apa":"Hegler, S., Statz, C., Mütze, M., Mooshofer, H., Goldammer, M., Fendt, K., … Plettemeier, D. (2015). Simulative Ultraschall-Untersuchung von Pitch-Catch-Messanordnungen für große zylindrische Stahl-Prüflinge und gradientenbasierte Bildgebung. <i>Tm - Technisches Messen</i>, <i>82</i>(9), 440–450. <a href=\"https://doi.org/doi:10.1515/teme-2015-0031\">https://doi.org/doi:10.1515/teme-2015-0031</a>","mla":"Hegler, Sebastian, et al. “Simulative Ultraschall-Untersuchung von Pitch-Catch-Messanordnungen Für Große Zylindrische Stahl-Prüflinge Und Gradientenbasierte Bildgebung.” <i>Tm - Technisches Messen</i>, vol. 82, no. 9, Walter de Gruyter, 2015, pp. 440–50, doi:<a href=\"https://doi.org/doi:10.1515/teme-2015-0031\">doi:10.1515/teme-2015-0031</a>.","bibtex":"@article{Hegler_Statz_Mütze_Mooshofer_Goldammer_Fendt_Schwarzer_Feldhoff_Flehmig_Markwardt_et al._2015, title={Simulative Ultraschall-Untersuchung von Pitch-Catch-Messanordnungen für große zylindrische Stahl-Prüflinge und gradientenbasierte Bildgebung}, volume={82}, DOI={<a href=\"https://doi.org/doi:10.1515/teme-2015-0031\">doi:10.1515/teme-2015-0031</a>}, number={9}, journal={tm - Technisches Messen}, publisher={Walter de Gruyter}, author={Hegler, Sebastian and Statz, Christoph and Mütze, Marco and Mooshofer, Hubert and Goldammer, Matthias and Fendt, Karl and Schwarzer, Stefan and Feldhoff, Kim and Flehmig, Martin and Markwardt, Ulf and et al.}, year={2015}, pages={440–450} }","short":"S. Hegler, C. Statz, M. Mütze, H. Mooshofer, M. Goldammer, K. Fendt, S. Schwarzer, K. Feldhoff, M. Flehmig, U. Markwardt, W. E. Nagel, M. Schütte, A. Walther, M. Meinel, A. Basermann, D. Plettemeier, Tm - Technisches Messen 82 (2015) 440–450.","ieee":"S. Hegler <i>et al.</i>, “Simulative Ultraschall-Untersuchung von Pitch-Catch-Messanordnungen für große zylindrische Stahl-Prüflinge und gradientenbasierte Bildgebung,” <i>tm - Technisches Messen</i>, vol. 82, no. 9, pp. 440–450, 2015.","chicago":"Hegler, Sebastian, Christoph Statz, Marco Mütze, Hubert Mooshofer, Matthias Goldammer, Karl Fendt, Stefan Schwarzer, et al. “Simulative Ultraschall-Untersuchung von Pitch-Catch-Messanordnungen Für Große Zylindrische Stahl-Prüflinge Und Gradientenbasierte Bildgebung.” <i>Tm - Technisches Messen</i> 82, no. 9 (2015): 440–50. <a href=\"https://doi.org/doi:10.1515/teme-2015-0031\">https://doi.org/doi:10.1515/teme-2015-0031</a>.","ama":"Hegler S, Statz C, Mütze M, et al. Simulative Ultraschall-Untersuchung von Pitch-Catch-Messanordnungen für große zylindrische Stahl-Prüflinge und gradientenbasierte Bildgebung. <i>tm - Technisches Messen</i>. 2015;82(9):440-450. doi:<a href=\"https://doi.org/doi:10.1515/teme-2015-0031\">doi:10.1515/teme-2015-0031</a>"},"date_updated":"2022-01-06T06:53:17Z","publisher":"Walter de Gruyter","volume":82,"date_created":"2018-03-23T14:01:39Z","author":[{"full_name":"Hegler, Sebastian","last_name":"Hegler","first_name":"Sebastian"},{"last_name":"Statz","full_name":"Statz, Christoph","first_name":"Christoph"},{"full_name":"Mütze, Marco","last_name":"Mütze","first_name":"Marco"},{"last_name":"Mooshofer","full_name":"Mooshofer, Hubert","first_name":"Hubert"},{"first_name":"Matthias","last_name":"Goldammer","full_name":"Goldammer, Matthias"},{"last_name":"Fendt","full_name":"Fendt, Karl","first_name":"Karl"},{"first_name":"Stefan","full_name":"Schwarzer, Stefan","last_name":"Schwarzer"},{"full_name":"Feldhoff, Kim","last_name":"Feldhoff","first_name":"Kim"},{"full_name":"Flehmig, Martin","last_name":"Flehmig","first_name":"Martin"},{"first_name":"Ulf","full_name":"Markwardt, Ulf","last_name":"Markwardt"},{"last_name":"E. Nagel","full_name":"E. Nagel, Wolfgang","first_name":"Wolfgang"},{"full_name":"Schütte, Maria","last_name":"Schütte","first_name":"Maria"},{"first_name":"Andrea","full_name":"Walther, Andrea","last_name":"Walther"},{"last_name":"Meinel","full_name":"Meinel, Michael","first_name":"Michael"},{"first_name":"Achim","last_name":"Basermann","full_name":"Basermann, Achim"},{"first_name":"Dirk","full_name":"Plettemeier, Dirk","last_name":"Plettemeier"}],"title":"Simulative Ultraschall-Untersuchung von Pitch-Catch-Messanordnungen für große zylindrische Stahl-Prüflinge und gradientenbasierte Bildgebung","doi":"doi:10.1515/teme-2015-0031","publication":"tm - Technisches Messen","type":"journal_article","abstract":[{"lang":"eng","text":"Große zylindrische Stahlprüflinge werden mittels der Methode der finiten Differenzen im Zeitbereich (engl. finite differences in time domain, FDTD) simulativ untersucht. Dabei werden Pitch-Catch-Messanordnungen verwendet. Es werden zwei Bildgebungsansätze vorgestellt: ersterer basiert auf dem Imaging Principle nach Claerbout, letzterer basiert auf gradientenbasierter Optimierung eines Zielfunktionals."}],"status":"public","_id":"1769","department":[{"_id":"27"},{"_id":"104"}],"user_id":"24135"}]