[{"publisher":"Universität Paderborn","date_updated":"2022-01-06T07:02:48Z","date_created":"2017-10-17T12:42:48Z","author":[{"first_name":"Frederik","last_name":"Mallmann Trenn","full_name":"Mallmann Trenn, Frederik"}],"title":"On scheduling with multi-core and multi-speed processors using power down","year":"2012","citation":{"apa":"Mallmann Trenn, F. (2012). <i>On scheduling with multi-core and multi-speed processors using power down</i>. Universität Paderborn.","bibtex":"@book{Mallmann Trenn_2012, title={On scheduling with multi-core and multi-speed processors using power down}, publisher={Universität Paderborn}, author={Mallmann Trenn, Frederik}, year={2012} }","short":"F. Mallmann Trenn, On Scheduling with Multi-Core and Multi-Speed Processors Using Power Down, Universität Paderborn, 2012.","mla":"Mallmann Trenn, Frederik. <i>On Scheduling with Multi-Core and Multi-Speed Processors Using Power Down</i>. Universität Paderborn, 2012.","ama":"Mallmann Trenn F. <i>On Scheduling with Multi-Core and Multi-Speed Processors Using Power Down</i>. Universität Paderborn; 2012.","ieee":"F. Mallmann Trenn, <i>On scheduling with multi-core and multi-speed processors using power down</i>. Universität Paderborn, 2012.","chicago":"Mallmann Trenn, Frederik. <i>On Scheduling with Multi-Core and Multi-Speed Processors Using Power Down</i>. Universität Paderborn, 2012."},"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C2","_id":"14"},{"name":"SFB 901 - Project Area C","_id":"4"}],"_id":"595","user_id":"15504","type":"bachelorsthesis","status":"public"},{"has_accepted_license":"1","year":"2012","page":"117-122","citation":{"mla":"Becker, Matthias, et al. “Model-Driven Performance Engineering of Self-Adaptive Systems: A Survey.” <i>Proceedings of the 8th ACM SigSoft International Conference on Quality of Software Architectures (QoSA’12)</i>, 2012, pp. 117–22, doi:<a href=\"https://doi.org/10.1145/2304696.2304716\">10.1145/2304696.2304716</a>.","short":"M. Becker, M. Luckey, S. Becker, in: Proceedings of the 8th ACM SigSoft International Conference on Quality of Software Architectures (QoSA’12), 2012, pp. 117–122.","bibtex":"@inproceedings{Becker_Luckey_Becker_2012, title={Model-Driven Performance Engineering of Self-Adaptive Systems: A Survey}, DOI={<a href=\"https://doi.org/10.1145/2304696.2304716\">10.1145/2304696.2304716</a>}, booktitle={Proceedings of the 8th ACM SigSoft International Conference on Quality of Software Architectures (QoSA’12)}, author={Becker, Matthias and Luckey, Markus and Becker, Steffen}, year={2012}, pages={117–122} }","apa":"Becker, M., Luckey, M., &#38; Becker, S. (2012). Model-Driven Performance Engineering of Self-Adaptive Systems: A Survey. In <i>Proceedings of the 8th ACM SigSoft International Conference on Quality of Software Architectures (QoSA’12)</i> (pp. 117–122). <a href=\"https://doi.org/10.1145/2304696.2304716\">https://doi.org/10.1145/2304696.2304716</a>","ama":"Becker M, Luckey M, Becker S. Model-Driven Performance Engineering of Self-Adaptive Systems: A Survey. In: <i>Proceedings of the 8th ACM SigSoft International Conference on Quality of Software Architectures (QoSA’12)</i>. ; 2012:117-122. doi:<a href=\"https://doi.org/10.1145/2304696.2304716\">10.1145/2304696.2304716</a>","chicago":"Becker, Matthias, Markus Luckey, and Steffen Becker. “Model-Driven Performance Engineering of Self-Adaptive Systems: A Survey.” In <i>Proceedings of the 8th ACM SigSoft International Conference on Quality of Software Architectures (QoSA’12)</i>, 117–22, 2012. <a href=\"https://doi.org/10.1145/2304696.2304716\">https://doi.org/10.1145/2304696.2304716</a>.","ieee":"M. Becker, M. Luckey, and S. Becker, “Model-Driven Performance Engineering of Self-Adaptive Systems: A Survey,” in <i>Proceedings of the 8th ACM SigSoft International Conference on Quality of Software Architectures (QoSA’12)</i>, 2012, pp. 117–122."},"date_updated":"2022-01-06T07:02:48Z","date_created":"2017-10-17T12:42:48Z","author":[{"full_name":"Becker, Matthias","last_name":"Becker","first_name":"Matthias"},{"full_name":"Luckey, Markus","last_name":"Luckey","first_name":"Markus"},{"first_name":"Steffen","last_name":"Becker","full_name":"Becker, Steffen"}],"title":"Model-Driven Performance Engineering of Self-Adaptive Systems: A Survey","doi":"10.1145/2304696.2304716","publication":"Proceedings of the 8th ACM SigSoft International Conference on Quality of Software Architectures (QoSA'12)","type":"conference","abstract":[{"lang":"eng","text":"To meet quality-of-service requirements in changing environments, modern software systems adapt themselves. The structure, and correspondingly the behavior, of these systems undergoes continuous change. Model-driven performance engineering, however, assumes static system structures, behavior, and deployment. Hence, self-adaptive systems pose new challenges to model-driven performance engineering. There are a few surveys on self-adaptive systems, performance engineering, and the combination of both in the literature. In contrast to existing work, here we focus on model-driven performance analysis approaches. Based on a systematic literature review, we present a classication, identify open issues, and outline further research."}],"status":"public","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":141651,"access_level":"closed","file_name":"596-qosa25s-becker.pdf","file_id":"1256","date_updated":"2018-03-15T08:23:31Z","creator":"florida","date_created":"2018-03-15T08:23:31Z"}],"_id":"596","project":[{"_id":"1","name":"SFB 901"},{"_id":"11","name":"SFB 901 - Subprojekt B3"},{"_id":"3","name":"SFB 901 - Project Area B"}],"user_id":"15504","ddc":["040"],"file_date_updated":"2018-03-15T08:23:31Z"},{"file_date_updated":"2018-03-15T08:20:53Z","ddc":["040"],"user_id":"15504","series_title":"LNCS","_id":"597","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"_id":"2","name":"SFB 901 - Project Area A"}],"status":"public","file":[{"date_created":"2018-03-15T08:20:53Z","creator":"florida","date_updated":"2018-03-15T08:20:53Z","access_level":"closed","file_id":"1254","file_name":"597-newtocs_01.pdf","file_size":345826,"content_type":"application/pdf","relation":"main_file","success":1}],"abstract":[{"lang":"eng","text":"We consider strategic games in which each player seeks a mixed strategy to minimize her cost evaluated by a concave valuation V (mapping probability distributions to reals); such valuations are used to model risk. In contrast to games with expectation-optimizer players where mixed equilibria always exist [15, 16], a mixed equilibrium for such games, called a V -equilibrium, may fail to exist, even though pure equilibria (if any) transfer over. What is the impact of such valuations on the existence, structure and complexity of mixed equilibria? We address this fundamental question for a particular concave valuation: expectation plus variance, denoted as RA, which stands for risk-averse; so, variance enters as a measure of risk and it is used as an additive adjustment to expectation. We obtain the following results about RA-equilibria:- A collection of general structural properties of RA-equilibria connecting to (i) E-equilibria and Var-equilibria, which correspond to the expectation and variance valuations E and Var, respectively, and to (ii) other weaker or incomparable equilibrium properties.- A second collection of (i) existence, (ii) equivalence and separation (with respect to E-equilibria), and (iii) characterization results for RA-equilibria in the new class of player-specific scheduling games. Using examples, we provide the first demonstration that going from E to RA may as well create new mixed (RA-)equilibria.- A purification technique to transform a player-specific scheduling game on identical links into a player-specific scheduling game so that all non-pure RA-equilibria are eliminated while new pure equilibria cannot be created; so, a particular game on two identical links yields one with no RA-equilibrium. As a by-product, the first-completeness result for the computation of RA-equilibria follows."}],"publication":"Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT)","type":"conference","doi":"10.1007/978-3-642-33996-7_21","title":"Minimizing Expectation Plus Variance","date_created":"2017-10-17T12:42:48Z","author":[{"last_name":"Mavronicolas","full_name":"Mavronicolas, Marios","first_name":"Marios"},{"first_name":"Burkhard","last_name":"Monien","full_name":"Monien, Burkhard"}],"date_updated":"2022-01-06T07:02:48Z","page":"239-250","citation":{"apa":"Mavronicolas, M., &#38; Monien, B. (2012). Minimizing Expectation Plus Variance. In <i>Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT)</i> (pp. 239–250). <a href=\"https://doi.org/10.1007/978-3-642-33996-7_21\">https://doi.org/10.1007/978-3-642-33996-7_21</a>","bibtex":"@inproceedings{Mavronicolas_Monien_2012, series={LNCS}, title={Minimizing Expectation Plus Variance}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-33996-7_21\">10.1007/978-3-642-33996-7_21</a>}, booktitle={Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT)}, author={Mavronicolas, Marios and Monien, Burkhard}, year={2012}, pages={239–250}, collection={LNCS} }","short":"M. Mavronicolas, B. Monien, in: Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT), 2012, pp. 239–250.","mla":"Mavronicolas, Marios, and Burkhard Monien. “Minimizing Expectation Plus Variance.” <i>Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT)</i>, 2012, pp. 239–50, doi:<a href=\"https://doi.org/10.1007/978-3-642-33996-7_21\">10.1007/978-3-642-33996-7_21</a>.","ama":"Mavronicolas M, Monien B. Minimizing Expectation Plus Variance. In: <i>Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT)</i>. LNCS. ; 2012:239-250. doi:<a href=\"https://doi.org/10.1007/978-3-642-33996-7_21\">10.1007/978-3-642-33996-7_21</a>","chicago":"Mavronicolas, Marios, and Burkhard Monien. “Minimizing Expectation Plus Variance.” In <i>Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT)</i>, 239–50. LNCS, 2012. <a href=\"https://doi.org/10.1007/978-3-642-33996-7_21\">https://doi.org/10.1007/978-3-642-33996-7_21</a>.","ieee":"M. Mavronicolas and B. Monien, “Minimizing Expectation Plus Variance,” in <i>Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT)</i>, 2012, pp. 239–250."},"year":"2012","has_accepted_license":"1"},{"title":"Methoden zur Bestimmung von innerbetrieblichen Verrechnungspreisen","date_created":"2017-10-17T12:42:48Z","author":[{"last_name":"Mammadov","full_name":"Mammadov, Fuad","first_name":"Fuad"}],"date_updated":"2022-01-06T07:02:48Z","publisher":"Universität Paderborn","citation":{"chicago":"Mammadov, Fuad. <i>Methoden zur Bestimmung von innerbetrieblichen Verrechnungspreisen</i>. Universität Paderborn, 2012.","ieee":"F. Mammadov, <i>Methoden zur Bestimmung von innerbetrieblichen Verrechnungspreisen</i>. Universität Paderborn, 2012.","ama":"Mammadov F. <i>Methoden zur Bestimmung von innerbetrieblichen Verrechnungspreisen</i>. Universität Paderborn; 2012.","apa":"Mammadov, F. (2012). <i>Methoden zur Bestimmung von innerbetrieblichen Verrechnungspreisen</i>. Universität Paderborn.","bibtex":"@book{Mammadov_2012, title={Methoden zur Bestimmung von innerbetrieblichen Verrechnungspreisen}, publisher={Universität Paderborn}, author={Mammadov, Fuad}, year={2012} }","short":"F. Mammadov, Methoden zur Bestimmung von innerbetrieblichen Verrechnungspreisen, Universität Paderborn, 2012.","mla":"Mammadov, Fuad. <i>Methoden zur Bestimmung von innerbetrieblichen Verrechnungspreisen</i>. Universität Paderborn, 2012."},"year":"2012","language":[{"iso":"ger"}],"user_id":"477","_id":"598","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"name":"SFB 901 - Project Area A","_id":"2"}],"status":"public","type":"bachelorsthesis"},{"year":"2012","citation":{"mla":"Löwen, Xenia. <i>Managerial Delegation and Capacity Choices: An Analysis of the Cournot-Nash Equilibrium</i>. Universität Paderborn, 2012.","bibtex":"@book{Löwen_2012, title={Managerial Delegation and Capacity Choices: An Analysis of the Cournot-Nash Equilibrium}, publisher={Universität Paderborn}, author={Löwen, Xenia}, year={2012} }","short":"X. Löwen, Managerial Delegation and Capacity Choices: An Analysis of the Cournot-Nash Equilibrium, Universität Paderborn, 2012.","apa":"Löwen, X. (2012). <i>Managerial Delegation and Capacity Choices: An Analysis of the Cournot-Nash Equilibrium</i>. Universität Paderborn.","ama":"Löwen X. <i>Managerial Delegation and Capacity Choices: An Analysis of the Cournot-Nash Equilibrium</i>. Universität Paderborn; 2012.","ieee":"X. Löwen, <i>Managerial Delegation and Capacity Choices: An Analysis of the Cournot-Nash Equilibrium</i>. Universität Paderborn, 2012.","chicago":"Löwen, Xenia. <i>Managerial Delegation and Capacity Choices: An Analysis of the Cournot-Nash Equilibrium</i>. Universität Paderborn, 2012."},"title":"Managerial Delegation and Capacity Choices: An Analysis of the Cournot-Nash Equilibrium","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:02:49Z","date_created":"2017-10-17T12:42:48Z","author":[{"first_name":"Xenia","last_name":"Löwen","full_name":"Löwen, Xenia"}],"status":"public","type":"bachelorsthesis","project":[{"_id":"1","name":"SFB 901"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"599","user_id":"15504"},{"citation":{"ama":"Feldkord B. <i>Lokale Swaps und überholte Informationen in Basic Network Creation Games</i>. Universität Paderborn; 2012.","ieee":"B. Feldkord, <i>Lokale Swaps und überholte Informationen in Basic Network Creation Games</i>. Universität Paderborn, 2012.","chicago":"Feldkord, Björn. <i>Lokale Swaps und überholte Informationen in Basic Network Creation Games</i>. Universität Paderborn, 2012.","apa":"Feldkord, B. (2012). <i>Lokale Swaps und überholte Informationen in Basic Network Creation Games</i>. Universität Paderborn.","bibtex":"@book{Feldkord_2012, title={Lokale Swaps und überholte Informationen in Basic Network Creation Games}, publisher={Universität Paderborn}, author={Feldkord, Björn}, year={2012} }","mla":"Feldkord, Björn. <i>Lokale Swaps und überholte Informationen in Basic Network Creation Games</i>. Universität Paderborn, 2012.","short":"B. Feldkord, Lokale Swaps und überholte Informationen in Basic Network Creation Games, Universität Paderborn, 2012."},"year":"2012","title":"Lokale Swaps und überholte Informationen in Basic Network Creation Games","date_created":"2017-10-17T12:42:49Z","author":[{"full_name":"Feldkord, Björn","id":"22704","last_name":"Feldkord","first_name":"Björn"}],"date_updated":"2022-01-06T07:02:49Z","publisher":"Universität Paderborn","status":"public","type":"bachelorsthesis","language":[{"iso":"ger"}],"user_id":"477","project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"600"},{"year":"2012","title":"Local strategies for robot formation problems","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","date_created":"2017-10-17T12:42:49Z","abstract":[{"text":"Wir betrachten eine Gruppe von mobilen, autonomen Robotern in einem ebenen Gel{\\\"a}nde. Es gibt keine zentrale Steuerung und die Roboter m{\\\"u}ssen sich selbst koordinieren. Zentrale Herausforderung dabei ist, dass jeder Roboter nur seine unmittelbare Nachbarschaft sieht und auch nur mit Robotern in seiner unmittelbaren Nachbarschaft kommunizieren kann. Daraus ergeben sich viele algorithmische Fragestellungen. In dieser Arbeit wird untersucht, unter welchen Voraussetzungen die Roboter sich auf einem Punkt versammeln bzw. eine Linie zwischen zwei festen Stationen bilden k{\\\"o}nnen. Daf{\\\"u}r werden mehrere Roboter-Strategien in verschiedenen Bewegungsmodellen vorgestellt. Diese Strategien werden auf ihre Effizienz hin untersucht. Es werden obere und untere Schranken f{\\\"u}r die ben{\\\"o}tigte Anzahl Runden und die Bewegungsdistanz gezeigt. In einigen F{\\\"a}llen wird außerdem die ben{\\\"o}tigte Bewegungsdistanz mit derjenigen Bewegungsdistanz verglichen, die eine optimale globale Strategie auf der gleichen Instanz ben{\\\"o}tigen w{\\\"u}rde. So werden kompetititve Faktoren hergeleitet.","lang":"eng"}],"file":[{"content_type":"application/pdf","relation":"main_file","success":1,"creator":"florida","date_created":"2018-03-15T08:16:44Z","date_updated":"2018-03-15T08:16:44Z","file_id":"1252","access_level":"closed","file_name":"601-Kempkes-PhD.pdf","file_size":3805310}],"ddc":["040"],"language":[{"iso":"eng"}],"intvolume":"       302","citation":{"apa":"Kempkes, B. (2012). <i>Local strategies for robot formation problems</i> (Vol. 302). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","short":"B. Kempkes, Local Strategies for Robot Formation Problems, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2012.","bibtex":"@book{Kempkes_2012, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Local strategies for robot formation problems}, volume={302}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Kempkes, Barbara}, year={2012}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","mla":"Kempkes, Barbara. <i>Local Strategies for Robot Formation Problems</i>. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2012.","ieee":"B. Kempkes, <i>Local strategies for robot formation problems</i>, vol. 302. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2012.","chicago":"Kempkes, Barbara. <i>Local Strategies for Robot Formation Problems</i>. Vol. 302. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2012.","ama":"Kempkes B. <i>Local Strategies for Robot Formation Problems</i>. Vol 302. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2012."},"has_accepted_license":"1","publication_identifier":{"isbn":["978-3-942647-21-2"]},"date_updated":"2022-01-06T07:02:50Z","volume":302,"author":[{"full_name":"Kempkes, Barbara","last_name":"Kempkes","first_name":"Barbara"}],"supervisor":[{"full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"status":"public","type":"dissertation","file_date_updated":"2018-03-15T08:16:44Z","_id":"601","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"department":[{"_id":"63"},{"_id":"26"}],"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","user_id":"5786"},{"has_accepted_license":"1","citation":{"apa":"Brangewitz, S. (2012). <i>Learning by Trading in Infinite Horizon Strategic Market Games with Default</i>. Universität Paderborn.","mla":"Brangewitz, Sonja. <i>Learning by Trading in Infinite Horizon Strategic Market Games with Default</i>. Universität Paderborn, 2012.","short":"S. Brangewitz, Learning by Trading in Infinite Horizon Strategic Market Games with Default, Universität Paderborn, 2012.","bibtex":"@book{Brangewitz_2012, title={Learning by Trading in Infinite Horizon Strategic Market Games with Default}, publisher={Universität Paderborn}, author={Brangewitz, Sonja}, year={2012} }","ieee":"S. Brangewitz, <i>Learning by Trading in Infinite Horizon Strategic Market Games with Default</i>. Universität Paderborn, 2012.","chicago":"Brangewitz, Sonja. <i>Learning by Trading in Infinite Horizon Strategic Market Games with Default</i>. Universität Paderborn, 2012.","ama":"Brangewitz S. <i>Learning by Trading in Infinite Horizon Strategic Market Games with Default</i>. Universität Paderborn; 2012."},"year":"2012","date_created":"2017-10-17T12:42:49Z","author":[{"last_name":"Brangewitz","full_name":"Brangewitz, Sonja","first_name":"Sonja"}],"date_updated":"2022-01-06T07:02:51Z","publisher":"Universität Paderborn","title":"Learning by Trading in Infinite Horizon Strategic Market Games with Default","type":"report","status":"public","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":1284802,"access_level":"closed","file_name":"602-12062_01.pdf","file_id":"1251","date_updated":"2018-03-15T08:16:08Z","date_created":"2018-03-15T08:16:08Z","creator":"florida"}],"abstract":[{"text":"We study the consequences of dropping the perfect competition assumption in a standard infinite horizon model with infinitely-lived traders and real collateralized assets, together with one additional ingredient: information among players is asymmetric and monitoring is incomplete. The key insight is that trading assets is not only a way to hedge oneself against uncertainty and to smooth consumption across time: It also enables learning information. Conversely, defaulting now becomes strategic: Certain players may manipulate prices so as to provoke a default in order to prevent their opponents from learning. We focus on learning equilibria, at the end of which no player has incorrect beliefs — not because those players with heterogeneous beliefs were eliminated from the market (although default is possible at equilibrium) but because they have taken time to update their prior belief. We prove a partial Folk theorem à la Wiseman (2011) of the following form: For any function that maps each state of the world to a sequence of feasible and strongly individually rational allocations, and for any degree of precision, there is a perfect Bayesian equilibrium in which patient players learn the realized state with this degree of precision and achieve a payoff close to the one specified for each state.","lang":"eng"}],"department":[{"_id":"205"}],"user_id":"477","_id":"602","project":[{"name":"SFB 901","_id":"1"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"name":"SFB 901 - Project Area A","_id":"2"}],"file_date_updated":"2018-03-15T08:16:08Z","language":[{"iso":"eng"}],"ddc":["040"]},{"title":"Introducing feedback to preemptive routing and wavelength assignment algorithms for dynamic traffic scenarios","date_created":"2017-10-17T12:42:49Z","author":[{"full_name":"Wette, Philip","last_name":"Wette","first_name":"Philip"},{"first_name":"Holger","last_name":"Karl","id":"126","full_name":"Karl, Holger"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T07:02:51Z","citation":{"mla":"Wette, Philip, and Holger Karl. <i>Introducing Feedback to Preemptive Routing and Wavelength Assignment Algorithms for Dynamic Traffic Scenarios</i>. Universität Paderborn, 2012.","bibtex":"@book{Wette_Karl_2012, title={Introducing feedback to preemptive routing and wavelength assignment algorithms for dynamic traffic scenarios}, publisher={Universität Paderborn}, author={Wette, Philip and Karl, Holger}, year={2012} }","short":"P. Wette, H. Karl, Introducing Feedback to Preemptive Routing and Wavelength Assignment Algorithms for Dynamic Traffic Scenarios, Universität Paderborn, 2012.","apa":"Wette, P., &#38; Karl, H. (2012). <i>Introducing feedback to preemptive routing and wavelength assignment algorithms for dynamic traffic scenarios</i>. Universität Paderborn.","ama":"Wette P, Karl H. <i>Introducing Feedback to Preemptive Routing and Wavelength Assignment Algorithms for Dynamic Traffic Scenarios</i>. Universität Paderborn; 2012.","chicago":"Wette, Philip, and Holger Karl. <i>Introducing Feedback to Preemptive Routing and Wavelength Assignment Algorithms for Dynamic Traffic Scenarios</i>. Universität Paderborn, 2012.","ieee":"P. Wette and H. Karl, <i>Introducing feedback to preemptive routing and wavelength assignment algorithms for dynamic traffic scenarios</i>. Universität Paderborn, 2012."},"year":"2012","has_accepted_license":"1","file_date_updated":"2018-03-09T09:57:26Z","ddc":["000"],"department":[{"_id":"75"}],"user_id":"126","_id":"603","project":[{"_id":"1","name":"SFB 901"},{"_id":"6","name":"SFB 901 - Subprojekt A2"},{"name":"SFB 901 - Project Area A","_id":"2"}],"status":"public","file":[{"relation":"main_file","success":1,"content_type":"application/pdf","file_id":"1205","access_level":"closed","file_name":"underlayMod2.pdf","file_size":717326,"date_created":"2018-03-09T09:57:26Z","creator":"hkarl","date_updated":"2018-03-09T09:57:26Z"}],"abstract":[{"lang":"eng","text":"Preemptive Routing and Wavelength Assignment (RWA) algorithms preempt established lightpaths in case not enough resources are available to setup a new lightpath in a Wavelength Division Multiplexing (WDM) network. The selection of lightpaths to be preempted relies on internal decisions of the RWA algorithm. Thus, if dedicated properties of the network topology are required by the applications running on the network, these requirements have to be known by the RWA algorithm. Otherwise it might happen that by preempting a particular lightpath these requirements are violated. If, however, these requirements include parameters only known at the nodes running the application, the RWA algorithm cannot evaluate the requirements. For this reason a RWA algorithm is needed which involves its users in the preemption decisions. We present a family of preemptive RWA algorithms for WDM networks. These algorithms have two distinguishing features: a) they can handle dynamic traffic by on-the-fly reconfiguration, and b) users can give feedback for reconfiguration decisions and thus influence the preemption decision of the RWA algorithm, leading to networks which adapt directly to application needs. This is different from traffic engineering where the network is (slowly) adapted to observed traffic patterns. Our algorithms handle various WDM network configurations including networks consisting of heterogeneous WDM hardware. To this end, we are using the layered graph approach together with a newly developed graph model that is used to determine conflicting lightpaths."}],"type":"report"},{"status":"public","type":"mastersthesis","language":[{"iso":"ger"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C3","_id":"15"},{"name":"SFB 901 - Project Area C","_id":"4"}],"_id":"604","user_id":"477","year":"2012","citation":{"ieee":"H. Seier, <i>Implementierung eines Branch-and-Bound-Algorithmus für nichtkonvexe gemischt-ganzzahlige Optimierungsprobleme mit quadratischen Nebenbedingungen</i>. Universität Paderborn, 2012.","chicago":"Seier, Henrik. <i>Implementierung eines Branch-and-Bound-Algorithmus für nichtkonvexe gemischt-ganzzahlige Optimierungsprobleme mit quadratischen Nebenbedingungen</i>. Universität Paderborn, 2012.","ama":"Seier H. <i>Implementierung eines Branch-and-Bound-Algorithmus für nichtkonvexe gemischt-ganzzahlige Optimierungsprobleme mit quadratischen Nebenbedingungen</i>. Universität Paderborn; 2012.","mla":"Seier, Henrik. <i>Implementierung eines Branch-and-Bound-Algorithmus für nichtkonvexe gemischt-ganzzahlige Optimierungsprobleme mit quadratischen Nebenbedingungen</i>. Universität Paderborn, 2012.","short":"H. Seier, Implementierung eines Branch-and-Bound-Algorithmus für nichtkonvexe gemischt-ganzzahlige Optimierungsprobleme mit quadratischen Nebenbedingungen, Universität Paderborn, 2012.","bibtex":"@book{Seier_2012, title={Implementierung eines Branch-and-Bound-Algorithmus für nichtkonvexe gemischt-ganzzahlige Optimierungsprobleme mit quadratischen Nebenbedingungen}, publisher={Universität Paderborn}, author={Seier, Henrik}, year={2012} }","apa":"Seier, H. (2012). <i>Implementierung eines Branch-and-Bound-Algorithmus für nichtkonvexe gemischt-ganzzahlige Optimierungsprobleme mit quadratischen Nebenbedingungen</i>. Universität Paderborn."},"title":"Implementierung eines Branch-and-Bound-Algorithmus für nichtkonvexe gemischt-ganzzahlige Optimierungsprobleme mit quadratischen Nebenbedingungen","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:02:51Z","author":[{"first_name":"Henrik","full_name":"Seier, Henrik","last_name":"Seier"}],"date_created":"2017-10-17T12:42:49Z"},{"status":"public","type":"mastersthesis","language":[{"iso":"ger"}],"user_id":"477","_id":"605","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C3","_id":"15"},{"name":"SFB 901 - Project Area C","_id":"4"}],"citation":{"apa":"Isenberg, F. (2012). <i>Implementierung eines adaptiven Verfahrens zur Linearisierung von nicht-konvexen, nichtlinearen Wassernetzmodellen mit Hilfe einer Fehlerabschätzung</i>. Universität Paderborn.","mla":"Isenberg, Florian. <i>Implementierung eines adaptiven Verfahrens zur Linearisierung von nicht-konvexen, nichtlinearen Wassernetzmodellen mit Hilfe einer Fehlerabschätzung</i>. Universität Paderborn, 2012.","bibtex":"@book{Isenberg_2012, title={Implementierung eines adaptiven Verfahrens zur Linearisierung von nicht-konvexen, nichtlinearen Wassernetzmodellen mit Hilfe einer Fehlerabschätzung}, publisher={Universität Paderborn}, author={Isenberg, Florian}, year={2012} }","short":"F. Isenberg, Implementierung eines adaptiven Verfahrens zur Linearisierung von nicht-konvexen, nichtlinearen Wassernetzmodellen mit Hilfe einer Fehlerabschätzung, Universität Paderborn, 2012.","ieee":"F. Isenberg, <i>Implementierung eines adaptiven Verfahrens zur Linearisierung von nicht-konvexen, nichtlinearen Wassernetzmodellen mit Hilfe einer Fehlerabschätzung</i>. Universität Paderborn, 2012.","chicago":"Isenberg, Florian. <i>Implementierung eines adaptiven Verfahrens zur Linearisierung von nicht-konvexen, nichtlinearen Wassernetzmodellen mit Hilfe einer Fehlerabschätzung</i>. Universität Paderborn, 2012.","ama":"Isenberg F. <i>Implementierung eines adaptiven Verfahrens zur Linearisierung von nicht-konvexen, nichtlinearen Wassernetzmodellen mit Hilfe einer Fehlerabschätzung</i>. Universität Paderborn; 2012."},"year":"2012","title":"Implementierung eines adaptiven Verfahrens zur Linearisierung von nicht-konvexen, nichtlinearen Wassernetzmodellen mit Hilfe einer Fehlerabschätzung","author":[{"last_name":"Isenberg","full_name":"Isenberg, Florian","first_name":"Florian"}],"date_created":"2017-10-17T12:42:50Z","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:02:51Z"},{"publication":"Neural Networks","type":"journal_article","status":"public","department":[{"_id":"115"}],"user_id":"59649","_id":"6055","language":[{"iso":"eng"}],"extern":"1","publication_identifier":{"issn":["0893-6080"]},"publication_status":"published","intvolume":"        32","page":"159-164","citation":{"ieee":"A. Mehler, A. Lücking, and P. Menke, “Assessing cognitive alignment in different types of dialog by means of a network model,” <i>Neural Networks</i>, vol. 32, pp. 159–164, 2012.","chicago":"Mehler, Alexander, Andy Lücking, and Peter Menke. “Assessing Cognitive Alignment in Different Types of Dialog by Means of a Network Model.” <i>Neural Networks</i> 32 (2012): 159–64. <a href=\"https://doi.org/10.1016/j.neunet.2012.02.013\">https://doi.org/10.1016/j.neunet.2012.02.013</a>.","ama":"Mehler A, Lücking A, Menke P. Assessing cognitive alignment in different types of dialog by means of a network model. <i>Neural Networks</i>. 2012;32:159-164. doi:<a href=\"https://doi.org/10.1016/j.neunet.2012.02.013\">10.1016/j.neunet.2012.02.013</a>","apa":"Mehler, A., Lücking, A., &#38; Menke, P. (2012). Assessing cognitive alignment in different types of dialog by means of a network model. <i>Neural Networks</i>, <i>32</i>, 159–164. <a href=\"https://doi.org/10.1016/j.neunet.2012.02.013\">https://doi.org/10.1016/j.neunet.2012.02.013</a>","bibtex":"@article{Mehler_Lücking_Menke_2012, title={Assessing cognitive alignment in different types of dialog by means of a network model}, volume={32}, DOI={<a href=\"https://doi.org/10.1016/j.neunet.2012.02.013\">10.1016/j.neunet.2012.02.013</a>}, journal={Neural Networks}, publisher={Elsevier BV}, author={Mehler, Alexander and Lücking, Andy and Menke, Peter}, year={2012}, pages={159–164} }","short":"A. Mehler, A. Lücking, P. Menke, Neural Networks 32 (2012) 159–164.","mla":"Mehler, Alexander, et al. “Assessing Cognitive Alignment in Different Types of Dialog by Means of a Network Model.” <i>Neural Networks</i>, vol. 32, Elsevier BV, 2012, pp. 159–64, doi:<a href=\"https://doi.org/10.1016/j.neunet.2012.02.013\">10.1016/j.neunet.2012.02.013</a>."},"year":"2012","volume":32,"date_created":"2018-12-07T15:17:39Z","author":[{"last_name":"Mehler","full_name":"Mehler, Alexander","first_name":"Alexander"},{"first_name":"Andy","full_name":"Lücking, Andy","last_name":"Lücking"},{"last_name":"Menke","full_name":"Menke, Peter","id":"59649","first_name":"Peter"}],"date_updated":"2022-01-06T07:02:51Z","publisher":"Elsevier BV","doi":"10.1016/j.neunet.2012.02.013","title":"Assessing cognitive alignment in different types of dialog by means of a network model"},{"type":"book_chapter","publication":"Handbook of Technical Communication","status":"public","_id":"6057","series_title":"Handbooks of Applied Linguistics","user_id":"59649","department":[{"_id":"115"}],"language":[{"iso":"eng"}],"extern":"1","publication_status":"published","publication_identifier":{"isbn":["978-3-11-018834-9"]},"year":"2012","citation":{"short":"P. Menke, in: Handbook of Technical Communication, de Gruyter, 2012, pp. 285–314.","mla":"Menke, Peter. “Evaluation of Technical Communication.” <i>Handbook of Technical Communication</i>, vol. 8, de Gruyter, 2012, pp. 285–314.","bibtex":"@inbook{Menke_2012, series={Handbooks of Applied Linguistics}, title={Evaluation of Technical Communication}, volume={8}, booktitle={Handbook of Technical Communication}, publisher={de Gruyter}, author={Menke, Peter}, year={2012}, pages={285–314}, collection={Handbooks of Applied Linguistics} }","apa":"Menke, P. (2012). Evaluation of Technical Communication. In <i>Handbook of Technical Communication</i> (Vol. 8, pp. 285–314). de Gruyter.","ama":"Menke P. Evaluation of Technical Communication. In: <i>Handbook of Technical Communication</i>. Vol 8. Handbooks of Applied Linguistics. de Gruyter; 2012:285–314.","ieee":"P. Menke, “Evaluation of Technical Communication,” in <i>Handbook of Technical Communication</i>, vol. 8, de Gruyter, 2012, pp. 285–314.","chicago":"Menke, Peter. “Evaluation of Technical Communication.” In <i>Handbook of Technical Communication</i>, 8:285–314. Handbooks of Applied Linguistics. de Gruyter, 2012."},"page":"285–314","intvolume":"         8","publisher":"de Gruyter","date_updated":"2022-01-06T07:02:51Z","date_created":"2018-12-07T15:22:25Z","author":[{"first_name":"Peter","id":"59649","full_name":"Menke, Peter","last_name":"Menke"}],"volume":8,"title":"Evaluation of Technical Communication"},{"date_created":"2017-10-17T12:42:50Z","author":[{"last_name":"Löken","id":"13703","full_name":"Löken, Nils","first_name":"Nils"}],"supervisor":[{"id":"23","full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T07:02:51Z","title":"Identitätsbasierte Signaturen - Ein Sicherheitsbeweis für Signaturen auf Grundlage von Gap-Diffie-Hellman-Gruppen mit Hilfe des Forking-Lemmas","citation":{"bibtex":"@book{Löken_2012, title={Identitätsbasierte Signaturen - Ein Sicherheitsbeweis für Signaturen auf Grundlage von Gap-Diffie-Hellman-Gruppen mit Hilfe des Forking-Lemmas}, publisher={Universität Paderborn}, author={Löken, Nils}, year={2012} }","short":"N. Löken, Identitätsbasierte Signaturen - Ein Sicherheitsbeweis für Signaturen auf Grundlage von Gap-Diffie-Hellman-Gruppen mit Hilfe des Forking-Lemmas, Universität Paderborn, 2012.","mla":"Löken, Nils. <i>Identitätsbasierte Signaturen - Ein Sicherheitsbeweis für Signaturen auf Grundlage von Gap-Diffie-Hellman-Gruppen mit Hilfe des Forking-Lemmas</i>. Universität Paderborn, 2012.","apa":"Löken, N. (2012). <i>Identitätsbasierte Signaturen - Ein Sicherheitsbeweis für Signaturen auf Grundlage von Gap-Diffie-Hellman-Gruppen mit Hilfe des Forking-Lemmas</i>. Universität Paderborn.","ieee":"N. Löken, <i>Identitätsbasierte Signaturen - Ein Sicherheitsbeweis für Signaturen auf Grundlage von Gap-Diffie-Hellman-Gruppen mit Hilfe des Forking-Lemmas</i>. Universität Paderborn, 2012.","chicago":"Löken, Nils. <i>Identitätsbasierte Signaturen - Ein Sicherheitsbeweis für Signaturen auf Grundlage von Gap-Diffie-Hellman-Gruppen mit Hilfe des Forking-Lemmas</i>. Universität Paderborn, 2012.","ama":"Löken N. <i>Identitätsbasierte Signaturen - Ein Sicherheitsbeweis für Signaturen auf Grundlage von Gap-Diffie-Hellman-Gruppen mit Hilfe des Forking-Lemmas</i>. Universität Paderborn; 2012."},"year":"2012","department":[{"_id":"64"}],"user_id":"13703","_id":"606","project":[{"_id":"1","name":"SFB 901"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"4","name":"SFB 901 - Project Area C"}],"language":[{"iso":"ger"}],"type":"bachelorsthesis","status":"public"},{"type":"bachelorsthesis","status":"public","department":[{"_id":"64"}],"user_id":"477","_id":"607","project":[{"_id":"1","name":"SFB 901"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"4","name":"SFB 901 - Project Area C"}],"language":[{"iso":"ger"}],"citation":{"ama":"Haarhoff T. <i>Identitätsbasierte Kryptographie - Implementierung von Paarungen für Körper der Charakteristik 2</i>. Universität Paderborn; 2012.","ieee":"T. Haarhoff, <i>Identitätsbasierte Kryptographie - Implementierung von Paarungen für Körper der Charakteristik 2</i>. Universität Paderborn, 2012.","chicago":"Haarhoff, Thomas. <i>Identitätsbasierte Kryptographie - Implementierung von Paarungen für Körper der Charakteristik 2</i>. Universität Paderborn, 2012.","bibtex":"@book{Haarhoff_2012, title={Identitätsbasierte Kryptographie - Implementierung von Paarungen für Körper der Charakteristik 2}, publisher={Universität Paderborn}, author={Haarhoff, Thomas}, year={2012} }","mla":"Haarhoff, Thomas. <i>Identitätsbasierte Kryptographie - Implementierung von Paarungen für Körper der Charakteristik 2</i>. Universität Paderborn, 2012.","short":"T. Haarhoff, Identitätsbasierte Kryptographie - Implementierung von Paarungen für Körper der Charakteristik 2, Universität Paderborn, 2012.","apa":"Haarhoff, T. (2012). <i>Identitätsbasierte Kryptographie - Implementierung von Paarungen für Körper der Charakteristik 2</i>. Universität Paderborn."},"year":"2012","date_created":"2017-10-17T12:42:50Z","supervisor":[{"last_name":"Blömer","id":"23","full_name":"Blömer, Johannes","first_name":"Johannes"}],"author":[{"last_name":"Haarhoff","full_name":"Haarhoff, Thomas","first_name":"Thomas"}],"date_updated":"2022-01-06T07:02:51Z","publisher":"Universität Paderborn","title":"Identitätsbasierte Kryptographie - Implementierung von Paarungen für Körper der Charakteristik 2"},{"citation":{"short":"N. Timm, H. Wehrheim, M. Czech, in: Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM), 2012, pp. 348–363.","bibtex":"@inproceedings{Timm_Wehrheim_Czech_2012, series={LNCS}, title={Heuristic-Guided Abstraction Refinement for Concurrent Systems}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-34281-3_25\">10.1007/978-3-642-34281-3_25</a>}, booktitle={Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM)}, author={Timm, Nils and Wehrheim, Heike and Czech, Mike}, year={2012}, pages={348–363}, collection={LNCS} }","mla":"Timm, Nils, et al. “Heuristic-Guided Abstraction Refinement for Concurrent Systems.” <i>Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM)</i>, 2012, pp. 348–63, doi:<a href=\"https://doi.org/10.1007/978-3-642-34281-3_25\">10.1007/978-3-642-34281-3_25</a>.","apa":"Timm, N., Wehrheim, H., &#38; Czech, M. (2012). Heuristic-Guided Abstraction Refinement for Concurrent Systems. In <i>Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM)</i> (pp. 348–363). <a href=\"https://doi.org/10.1007/978-3-642-34281-3_25\">https://doi.org/10.1007/978-3-642-34281-3_25</a>","ieee":"N. Timm, H. Wehrheim, and M. Czech, “Heuristic-Guided Abstraction Refinement for Concurrent Systems,” in <i>Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM)</i>, 2012, pp. 348–363.","chicago":"Timm, Nils, Heike Wehrheim, and Mike Czech. “Heuristic-Guided Abstraction Refinement for Concurrent Systems.” In <i>Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM)</i>, 348–63. LNCS, 2012. <a href=\"https://doi.org/10.1007/978-3-642-34281-3_25\">https://doi.org/10.1007/978-3-642-34281-3_25</a>.","ama":"Timm N, Wehrheim H, Czech M. Heuristic-Guided Abstraction Refinement for Concurrent Systems. In: <i>Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM)</i>. LNCS. ; 2012:348-363. doi:<a href=\"https://doi.org/10.1007/978-3-642-34281-3_25\">10.1007/978-3-642-34281-3_25</a>"},"page":"348-363","has_accepted_license":"1","doi":"10.1007/978-3-642-34281-3_25","author":[{"first_name":"Nils","last_name":"Timm","full_name":"Timm, Nils"},{"first_name":"Heike","full_name":"Wehrheim, Heike","id":"573","last_name":"Wehrheim"},{"last_name":"Czech","full_name":"Czech, Mike","first_name":"Mike"}],"date_updated":"2022-01-06T07:02:52Z","status":"public","type":"conference","file_date_updated":"2018-03-15T08:15:33Z","user_id":"477","series_title":"LNCS","department":[{"_id":"77"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"12","name":"SFB 901 - Subprojekt B4"},{"_id":"3","name":"SFB 901 - Project Area B"}],"_id":"608","year":"2012","title":"Heuristic-Guided Abstraction Refinement for Concurrent Systems","date_created":"2017-10-17T12:42:50Z","file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-03-15T08:15:33Z","date_created":"2018-03-15T08:15:33Z","creator":"florida","file_size":396337,"file_id":"1250","access_level":"closed","file_name":"608-Timm2013-0main.pdf"}],"abstract":[{"lang":"eng","text":"Predicate abstraction is an established technique in software verification. It inherently includes an abstraction refinement loop successively adding predicates until the right level of abstraction is found. For concurrent systems, predicate abstraction can be combined with spotlight abstraction, further reducing the state space by abstracting away certain processes. Refinement then has to decide whether to add a new predicate or a new process. Selecting the right predicates and processes is a crucial task: The positive effect of abstraction may be compromised by unfavourable refinement decisions. Here we present a heuristic approach to abstraction refinement. The basis for a decision is a set of refinement candidates, derived by multiple counterexample-generation. Candidates are evaluated with respect to their influence on other components in the system. Experimental results show that our technique can significantly speed up verification as compared to a naive abstraction refinement."}],"publication":"Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM)","language":[{"iso":"eng"}],"ddc":["040"]},{"file":[{"file_size":1270467,"file_id":"1248","access_level":"closed","file_name":"610-MA_Mohr_2012_final.pdf","date_updated":"2018-03-15T08:13:40Z","date_created":"2018-03-15T08:13:40Z","creator":"florida","success":1,"relation":"main_file","content_type":"application/pdf"}],"status":"public","type":"mastersthesis","file_date_updated":"2018-03-15T08:13:40Z","ddc":["040"],"user_id":"15504","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt B3","_id":"11"},{"name":"SFB 901 - Project Area B","_id":"3"}],"_id":"610","citation":{"ieee":"M. Mohr, <i>Generating Prototypes of Adaptive Component-based Software Systems for Performance Analysis</i>. Universität Paderborn, 2012.","chicago":"Mohr, Mario. <i>Generating Prototypes of Adaptive Component-Based Software Systems for Performance Analysis</i>. Universität Paderborn, 2012.","ama":"Mohr M. <i>Generating Prototypes of Adaptive Component-Based Software Systems for Performance Analysis</i>. Universität Paderborn; 2012.","apa":"Mohr, M. (2012). <i>Generating Prototypes of Adaptive Component-based Software Systems for Performance Analysis</i>. Universität Paderborn.","bibtex":"@book{Mohr_2012, title={Generating Prototypes of Adaptive Component-based Software Systems for Performance Analysis}, publisher={Universität Paderborn}, author={Mohr, Mario}, year={2012} }","short":"M. Mohr, Generating Prototypes of Adaptive Component-Based Software Systems for Performance Analysis, Universität Paderborn, 2012.","mla":"Mohr, Mario. <i>Generating Prototypes of Adaptive Component-Based Software Systems for Performance Analysis</i>. Universität Paderborn, 2012."},"year":"2012","has_accepted_license":"1","title":"Generating Prototypes of Adaptive Component-based Software Systems for Performance Analysis","author":[{"first_name":"Mario","full_name":"Mohr, Mario","last_name":"Mohr"}],"date_created":"2017-10-17T12:42:51Z","date_updated":"2022-01-06T07:02:52Z","publisher":"Universität Paderborn"},{"issue":"1","citation":{"ieee":"H. Steinmetz, C. Schwens, M. Wehner, and R. Kabst, “Das Cranet-Projekt: Kreuzkulturelle Vergleiche im HR-Management.,” <i>PERSONALquartely</i>, vol. 64, no. 1, pp. 34–39, 2012.","chicago":"Steinmetz, Holger, C Schwens, M Wehner, and Rüdiger Kabst. “Das Cranet-Projekt: Kreuzkulturelle Vergleiche Im HR-Management.” <i>PERSONALquartely</i> 64, no. 1 (2012): 34–39.","ama":"Steinmetz H, Schwens C, Wehner M, Kabst R. Das Cranet-Projekt: Kreuzkulturelle Vergleiche im HR-Management. <i>PERSONALquartely</i>. 2012;64(1):34-39.","bibtex":"@article{Steinmetz_Schwens_Wehner_Kabst_2012, title={Das Cranet-Projekt: Kreuzkulturelle Vergleiche im HR-Management.}, volume={64}, number={1}, journal={PERSONALquartely}, author={Steinmetz, Holger and Schwens, C and Wehner, M and Kabst, Rüdiger}, year={2012}, pages={34–39} }","short":"H. Steinmetz, C. Schwens, M. Wehner, R. Kabst, PERSONALquartely 64 (2012) 34–39.","mla":"Steinmetz, Holger, et al. “Das Cranet-Projekt: Kreuzkulturelle Vergleiche Im HR-Management.” <i>PERSONALquartely</i>, vol. 64, no. 1, 2012, pp. 34–39.","apa":"Steinmetz, H., Schwens, C., Wehner, M., &#38; Kabst, R. (2012). Das Cranet-Projekt: Kreuzkulturelle Vergleiche im HR-Management. <i>PERSONALquartely</i>, <i>64</i>(1), 34–39."},"page":"34-39","intvolume":"        64","year":"2012","date_created":"2018-12-10T11:09:13Z","author":[{"last_name":"Steinmetz","full_name":"Steinmetz, Holger","id":"43261","first_name":"Holger"},{"first_name":"C","full_name":"Schwens, C","last_name":"Schwens"},{"last_name":"Wehner","full_name":"Wehner, M","first_name":"M"},{"first_name":"Rüdiger","id":"42362","full_name":"Kabst, Rüdiger","last_name":"Kabst"}],"volume":64,"date_updated":"2022-01-06T07:02:53Z","title":"Das Cranet-Projekt: Kreuzkulturelle Vergleiche im HR-Management.","type":"journal_article","publication":"PERSONALquartely","status":"public","user_id":"46632","department":[{"_id":"274"}],"_id":"6102","language":[{"iso":"eng"}]},{"author":[{"first_name":"Rüdiger","id":"42362","full_name":"Kabst, Rüdiger","last_name":"Kabst"},{"full_name":"Baum, M","last_name":"Baum","first_name":"M"}],"date_created":"2018-12-10T11:39:27Z","volume":64,"date_updated":"2022-01-06T07:02:53Z","title":"Editorial: Employer Branding: Strategie, Instrumente, Umsetzung","issue":"3","citation":{"apa":"Kabst, R., &#38; Baum, M. (2012). Editorial: Employer Branding: Strategie, Instrumente, Umsetzung. <i>PERSONALquartely</i>, <i>64</i>(3), 3.","mla":"Kabst, Rüdiger, and M. Baum. “Editorial: Employer Branding: Strategie, Instrumente, Umsetzung.” <i>PERSONALquartely</i>, vol. 64, no. 3, 2012, p. 3.","short":"R. Kabst, M. Baum, PERSONALquartely 64 (2012) 3.","bibtex":"@article{Kabst_Baum_2012, title={Editorial: Employer Branding: Strategie, Instrumente, Umsetzung}, volume={64}, number={3}, journal={PERSONALquartely}, author={Kabst, Rüdiger and Baum, M}, year={2012}, pages={3} }","chicago":"Kabst, Rüdiger, and M Baum. “Editorial: Employer Branding: Strategie, Instrumente, Umsetzung.” <i>PERSONALquartely</i> 64, no. 3 (2012): 3.","ieee":"R. Kabst and M. Baum, “Editorial: Employer Branding: Strategie, Instrumente, Umsetzung,” <i>PERSONALquartely</i>, vol. 64, no. 3, p. 3, 2012.","ama":"Kabst R, Baum M. Editorial: Employer Branding: Strategie, Instrumente, Umsetzung. <i>PERSONALquartely</i>. 2012;64(3):3."},"intvolume":"        64","page":"3","year":"2012","user_id":"46632","department":[{"_id":"274"}],"_id":"6103","language":[{"iso":"eng"}],"type":"journal_article","publication":"PERSONALquartely","status":"public"},{"status":"public","type":"bachelorsthesis","user_id":"15504","_id":"611","project":[{"_id":"1","name":"SFB 901"},{"_id":"14","name":"SFB 901 - Subprojekt C2"},{"_id":"4","name":"SFB 901 - Project Area C"}],"citation":{"bibtex":"@book{Hangmann_2012, title={Generating Adjustable Temperature Gradients on modern FPGAs}, publisher={Universität Paderborn}, author={Hangmann, Hendrik}, year={2012} }","mla":"Hangmann, Hendrik. <i>Generating Adjustable Temperature Gradients on Modern FPGAs</i>. Universität Paderborn, 2012.","short":"H. Hangmann, Generating Adjustable Temperature Gradients on Modern FPGAs, Universität Paderborn, 2012.","apa":"Hangmann, H. (2012). <i>Generating Adjustable Temperature Gradients on modern FPGAs</i>. Universität Paderborn.","ama":"Hangmann H. <i>Generating Adjustable Temperature Gradients on Modern FPGAs</i>. Universität Paderborn; 2012.","ieee":"H. Hangmann, <i>Generating Adjustable Temperature Gradients on modern FPGAs</i>. Universität Paderborn, 2012.","chicago":"Hangmann, Hendrik. <i>Generating Adjustable Temperature Gradients on Modern FPGAs</i>. Universität Paderborn, 2012."},"year":"2012","title":"Generating Adjustable Temperature Gradients on modern FPGAs","author":[{"full_name":"Hangmann, Hendrik","last_name":"Hangmann","first_name":"Hendrik"}],"date_created":"2017-10-17T12:42:51Z","date_updated":"2022-01-06T07:02:53Z","publisher":"Universität Paderborn"}]