[{"type":"conference","publication":"Proceedings of the 8th ACM SigSoft International Conference on Quality of Software Architectures (QoSA'12)","file":[{"creator":"florida","date_created":"2018-03-15T08:23:31Z","date_updated":"2018-03-15T08:23:31Z","access_level":"closed","file_name":"596-qosa25s-becker.pdf","file_id":"1256","file_size":141651,"content_type":"application/pdf","relation":"main_file","success":1}],"status":"public","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."}],"user_id":"15504","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt B3","_id":"11"},{"name":"SFB 901 - Project Area B","_id":"3"}],"_id":"596","file_date_updated":"2018-03-15T08:23:31Z","ddc":["040"],"has_accepted_license":"1","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>.","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} }","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.","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>","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.","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>.","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>"},"page":"117-122","year":"2012","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"}],"date_updated":"2022-01-06T07:02:48Z","doi":"10.1145/2304696.2304716","title":"Model-Driven Performance Engineering of Self-Adaptive Systems: A Survey"},{"page":"239-250","citation":{"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.","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>.","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>","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>.","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} }","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>"},"year":"2012","has_accepted_license":"1","doi":"10.1007/978-3-642-33996-7_21","title":"Minimizing Expectation Plus Variance","author":[{"last_name":"Mavronicolas","full_name":"Mavronicolas, Marios","first_name":"Marios"},{"first_name":"Burkhard","last_name":"Monien","full_name":"Monien, Burkhard"}],"date_created":"2017-10-17T12:42:48Z","date_updated":"2022-01-06T07:02:48Z","status":"public","file":[{"relation":"main_file","success":1,"content_type":"application/pdf","file_id":"1254","access_level":"closed","file_name":"597-newtocs_01.pdf","file_size":345826,"creator":"florida","date_created":"2018-03-15T08:20:53Z","date_updated":"2018-03-15T08:20:53Z"}],"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","file_date_updated":"2018-03-15T08:20:53Z","ddc":["040"],"series_title":"LNCS","user_id":"15504","_id":"597","project":[{"name":"SFB 901","_id":"1"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"_id":"2","name":"SFB 901 - Project Area A"}]},{"title":"Methoden zur Bestimmung von innerbetrieblichen Verrechnungspreisen","author":[{"full_name":"Mammadov, Fuad","last_name":"Mammadov","first_name":"Fuad"}],"date_created":"2017-10-17T12:42:48Z","date_updated":"2022-01-06T07:02:48Z","publisher":"Universität Paderborn","citation":{"ama":"Mammadov F. <i>Methoden zur Bestimmung von innerbetrieblichen Verrechnungspreisen</i>. Universität Paderborn; 2012.","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.","apa":"Mammadov, F. (2012). <i>Methoden zur Bestimmung von innerbetrieblichen Verrechnungspreisen</i>. Universität Paderborn.","mla":"Mammadov, Fuad. <i>Methoden zur Bestimmung von innerbetrieblichen Verrechnungspreisen</i>. Universität Paderborn, 2012.","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."},"year":"2012","language":[{"iso":"ger"}],"user_id":"477","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"598","status":"public","type":"bachelorsthesis"},{"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":[{"last_name":"Löwen","full_name":"Löwen, Xenia","first_name":"Xenia"}],"year":"2012","citation":{"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.","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} }","mla":"Löwen, Xenia. <i>Managerial Delegation and Capacity Choices: An Analysis of the Cournot-Nash Equilibrium</i>. Universität Paderborn, 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."},"project":[{"_id":"1","name":"SFB 901"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"599","user_id":"15504","status":"public","type":"bachelorsthesis"},{"year":"2012","citation":{"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.","chicago":"Feldkord, Björn. <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.","ama":"Feldkord B. <i>Lokale Swaps und überholte Informationen in Basic Network Creation Games</i>. Universität Paderborn; 2012."},"title":"Lokale Swaps und überholte Informationen in Basic Network Creation Games","date_updated":"2022-01-06T07:02:49Z","publisher":"Universität Paderborn","date_created":"2017-10-17T12:42:49Z","author":[{"id":"22704","full_name":"Feldkord, Björn","last_name":"Feldkord","first_name":"Björn"}],"status":"public","type":"bachelorsthesis","language":[{"iso":"ger"}],"_id":"600","project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"user_id":"477"},{"status":"public","type":"dissertation","file_date_updated":"2018-03-15T08:16:44Z","department":[{"_id":"63"},{"_id":"26"}],"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","user_id":"5786","_id":"601","project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"intvolume":"       302","citation":{"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} }","short":"B. Kempkes, Local Strategies for Robot Formation Problems, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2012.","mla":"Kempkes, Barbara. <i>Local Strategies for Robot Formation Problems</i>. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2012.","apa":"Kempkes, B. (2012). <i>Local strategies for robot formation problems</i> (Vol. 302). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","ama":"Kempkes B. <i>Local Strategies for Robot Formation Problems</i>. Vol 302. 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."},"publication_identifier":{"isbn":["978-3-942647-21-2"]},"has_accepted_license":"1","volume":302,"author":[{"full_name":"Kempkes, Barbara","last_name":"Kempkes","first_name":"Barbara"}],"supervisor":[{"last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","first_name":"Friedhelm"}],"date_updated":"2022-01-06T07:02:50Z","file":[{"file_size":3805310,"access_level":"closed","file_id":"1252","file_name":"601-Kempkes-PhD.pdf","date_updated":"2018-03-15T08:16:44Z","date_created":"2018-03-15T08:16:44Z","creator":"florida","success":1,"relation":"main_file","content_type":"application/pdf"}],"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"}],"language":[{"iso":"eng"}],"ddc":["040"],"year":"2012","title":"Local strategies for robot formation problems","date_created":"2017-10-17T12:42:49Z","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn"},{"title":"Learning by Trading in Infinite Horizon Strategic Market Games with Default","date_updated":"2022-01-06T07:02:51Z","publisher":"Universität Paderborn","date_created":"2017-10-17T12:42:49Z","author":[{"last_name":"Brangewitz","full_name":"Brangewitz, Sonja","first_name":"Sonja"}],"year":"2012","citation":{"apa":"Brangewitz, S. (2012). <i>Learning by Trading in Infinite Horizon Strategic Market Games with Default</i>. Universität Paderborn.","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} }","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.","chicago":"Brangewitz, Sonja. <i>Learning by Trading in Infinite Horizon Strategic Market Games with Default</i>. Universität Paderborn, 2012.","ieee":"S. Brangewitz, <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."},"has_accepted_license":"1","ddc":["040"],"file_date_updated":"2018-03-15T08:16:08Z","language":[{"iso":"eng"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"602","user_id":"477","department":[{"_id":"205"}],"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"}],"file":[{"file_size":1284802,"file_id":"1251","access_level":"closed","file_name":"602-12062_01.pdf","date_updated":"2018-03-15T08:16:08Z","date_created":"2018-03-15T08:16:08Z","creator":"florida","success":1,"relation":"main_file","content_type":"application/pdf"}],"status":"public","type":"report"},{"ddc":["000"],"file_date_updated":"2018-03-09T09:57:26Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A2","_id":"6"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"603","user_id":"126","department":[{"_id":"75"}],"abstract":[{"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.","lang":"eng"}],"file":[{"creator":"hkarl","date_created":"2018-03-09T09:57:26Z","date_updated":"2018-03-09T09:57:26Z","access_level":"closed","file_name":"underlayMod2.pdf","file_id":"1205","file_size":717326,"content_type":"application/pdf","relation":"main_file","success":1}],"status":"public","type":"report","title":"Introducing feedback to preemptive routing and wavelength assignment algorithms for dynamic traffic scenarios","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:02:51Z","date_created":"2017-10-17T12:42:49Z","author":[{"first_name":"Philip","last_name":"Wette","full_name":"Wette, Philip"},{"id":"126","full_name":"Karl, Holger","last_name":"Karl","first_name":"Holger"}],"year":"2012","citation":{"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.","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.","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.","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.","ama":"Wette P, Karl H. <i>Introducing Feedback to Preemptive Routing and Wavelength Assignment Algorithms for Dynamic Traffic Scenarios</i>. Universität Paderborn; 2012."},"has_accepted_license":"1"},{"date_created":"2017-10-17T12:42:49Z","author":[{"first_name":"Henrik","last_name":"Seier","full_name":"Seier, Henrik"}],"date_updated":"2022-01-06T07:02:51Z","publisher":"Universität Paderborn","title":"Implementierung eines Branch-and-Bound-Algorithmus für nichtkonvexe gemischt-ganzzahlige Optimierungsprobleme mit quadratischen Nebenbedingungen","citation":{"short":"H. Seier, Implementierung eines Branch-and-Bound-Algorithmus für nichtkonvexe gemischt-ganzzahlige Optimierungsprobleme mit quadratischen Nebenbedingungen, 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.","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.","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."},"year":"2012","user_id":"477","_id":"604","project":[{"name":"SFB 901","_id":"1"},{"_id":"15","name":"SFB 901 - Subprojekt C3"},{"_id":"4","name":"SFB 901 - Project Area C"}],"language":[{"iso":"ger"}],"type":"mastersthesis","status":"public"},{"type":"mastersthesis","status":"public","user_id":"477","_id":"605","project":[{"_id":"1","name":"SFB 901"},{"_id":"15","name":"SFB 901 - Subprojekt C3"},{"name":"SFB 901 - Project Area C","_id":"4"}],"language":[{"iso":"ger"}],"citation":{"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.","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.","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.","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} }","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.","short":"F. Isenberg, Implementierung eines adaptiven Verfahrens zur Linearisierung von nicht-konvexen, nichtlinearen Wassernetzmodellen mit Hilfe einer Fehlerabschätzung, Universität Paderborn, 2012.","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."},"year":"2012","date_created":"2017-10-17T12:42:50Z","author":[{"full_name":"Isenberg, Florian","last_name":"Isenberg","first_name":"Florian"}],"date_updated":"2022-01-06T07:02:51Z","publisher":"Universität Paderborn","title":"Implementierung eines adaptiven Verfahrens zur Linearisierung von nicht-konvexen, nichtlinearen Wassernetzmodellen mit Hilfe einer Fehlerabschätzung"},{"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","date_updated":"2022-01-06T07:02:51Z","date_created":"2017-10-17T12:42:50Z","author":[{"first_name":"Nils","last_name":"Löken","full_name":"Löken, Nils","id":"13703"}],"supervisor":[{"first_name":"Johannes","id":"23","full_name":"Blömer, Johannes","last_name":"Blömer"}],"year":"2012","citation":{"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.","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.","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} }","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.","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.","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."},"language":[{"iso":"ger"}],"_id":"606","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":"13703","status":"public","type":"bachelorsthesis"},{"project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"4","name":"SFB 901 - Project Area C"}],"_id":"607","user_id":"477","department":[{"_id":"64"}],"language":[{"iso":"ger"}],"type":"bachelorsthesis","status":"public","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:02:51Z","supervisor":[{"first_name":"Johannes","last_name":"Blömer","id":"23","full_name":"Blömer, Johannes"}],"date_created":"2017-10-17T12:42:50Z","author":[{"first_name":"Thomas","last_name":"Haarhoff","full_name":"Haarhoff, Thomas"}],"title":"Identitätsbasierte Kryptographie - Implementierung von Paarungen für Körper der Charakteristik 2","year":"2012","citation":{"apa":"Haarhoff, T. (2012). <i>Identitätsbasierte Kryptographie - Implementierung von Paarungen für Körper der Charakteristik 2</i>. Universität Paderborn.","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.","chicago":"Haarhoff, Thomas. <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.","ama":"Haarhoff T. <i>Identitätsbasierte Kryptographie - Implementierung von Paarungen für Körper der Charakteristik 2</i>. Universität Paderborn; 2012."}},{"title":"Heuristic-Guided Abstraction Refinement for Concurrent Systems","date_created":"2017-10-17T12:42:50Z","year":"2012","ddc":["040"],"language":[{"iso":"eng"}],"abstract":[{"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.","lang":"eng"}],"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"}],"publication":"Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM)","doi":"10.1007/978-3-642-34281-3_25","date_updated":"2022-01-06T07:02:52Z","author":[{"first_name":"Nils","last_name":"Timm","full_name":"Timm, Nils"},{"first_name":"Heike","full_name":"Wehrheim, Heike","id":"573","last_name":"Wehrheim"},{"full_name":"Czech, Mike","last_name":"Czech","first_name":"Mike"}],"citation":{"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>","short":"N. Timm, H. Wehrheim, M. Czech, in: Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM), 2012, pp. 348–363.","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>.","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} }","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>","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>."},"page":"348-363","has_accepted_license":"1","file_date_updated":"2018-03-15T08:15:33Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt B4","_id":"12"},{"name":"SFB 901 - Project Area B","_id":"3"}],"_id":"608","user_id":"477","series_title":"LNCS","department":[{"_id":"77"}],"status":"public","type":"conference"},{"title":"Generating Prototypes of Adaptive Component-based Software Systems for Performance Analysis","date_updated":"2022-01-06T07:02:52Z","publisher":"Universität Paderborn","date_created":"2017-10-17T12:42:51Z","author":[{"first_name":"Mario","full_name":"Mohr, Mario","last_name":"Mohr"}],"year":"2012","citation":{"ama":"Mohr M. <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.","ieee":"M. Mohr, <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} }","mla":"Mohr, Mario. <i>Generating Prototypes of Adaptive Component-Based Software Systems for Performance Analysis</i>. Universität Paderborn, 2012.","short":"M. Mohr, Generating Prototypes of Adaptive Component-Based Software Systems for Performance Analysis, Universität Paderborn, 2012."},"has_accepted_license":"1","ddc":["040"],"file_date_updated":"2018-03-15T08:13:40Z","_id":"610","project":[{"_id":"1","name":"SFB 901"},{"_id":"11","name":"SFB 901 - Subprojekt B3"},{"name":"SFB 901 - Project Area B","_id":"3"}],"user_id":"15504","status":"public","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","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"}],"type":"mastersthesis"},{"date_created":"2017-10-17T12:42:51Z","author":[{"first_name":"Hendrik","full_name":"Hangmann, Hendrik","last_name":"Hangmann"}],"date_updated":"2022-01-06T07:02:53Z","publisher":"Universität Paderborn","title":"Generating Adjustable Temperature Gradients on modern FPGAs","citation":{"ama":"Hangmann H. <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.","ieee":"H. Hangmann, <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.","mla":"Hangmann, Hendrik. <i>Generating Adjustable Temperature Gradients on Modern FPGAs</i>. Universität Paderborn, 2012.","bibtex":"@book{Hangmann_2012, title={Generating Adjustable Temperature Gradients on modern FPGAs}, publisher={Universität Paderborn}, author={Hangmann, Hendrik}, year={2012} }","apa":"Hangmann, H. (2012). <i>Generating Adjustable Temperature Gradients on modern FPGAs</i>. Universität Paderborn."},"year":"2012","user_id":"15504","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C2","_id":"14"},{"name":"SFB 901 - Project Area C","_id":"4"}],"_id":"611","type":"bachelorsthesis","status":"public"},{"year":"2012","citation":{"apa":"Wohlfarth, S. (2012). <i>Erweiterung von d3fact um die Domäne Wasserversorgung in Verbindung mit der Analyse und Implementierung eines hydraulischen Simulationsverfahrens</i>. Universität Paderborn.","bibtex":"@book{Wohlfarth_2012, title={Erweiterung von d3fact um die Domäne Wasserversorgung in Verbindung mit der Analyse und Implementierung eines hydraulischen Simulationsverfahrens}, publisher={Universität Paderborn}, author={Wohlfarth, Stefan}, year={2012} }","short":"S. Wohlfarth, Erweiterung von d3fact um die Domäne Wasserversorgung in Verbindung mit der Analyse und Implementierung eines hydraulischen Simulationsverfahrens, Universität Paderborn, 2012.","mla":"Wohlfarth, Stefan. <i>Erweiterung von d3fact um die Domäne Wasserversorgung in Verbindung mit der Analyse und Implementierung eines hydraulischen Simulationsverfahrens</i>. Universität Paderborn, 2012.","ama":"Wohlfarth S. <i>Erweiterung von d3fact um die Domäne Wasserversorgung in Verbindung mit der Analyse und Implementierung eines hydraulischen Simulationsverfahrens</i>. Universität Paderborn; 2012.","ieee":"S. Wohlfarth, <i>Erweiterung von d3fact um die Domäne Wasserversorgung in Verbindung mit der Analyse und Implementierung eines hydraulischen Simulationsverfahrens</i>. Universität Paderborn, 2012.","chicago":"Wohlfarth, Stefan. <i>Erweiterung von d3fact um die Domäne Wasserversorgung in Verbindung mit der Analyse und Implementierung eines hydraulischen Simulationsverfahrens</i>. Universität Paderborn, 2012."},"date_updated":"2022-01-06T07:02:53Z","publisher":"Universität Paderborn","author":[{"first_name":"Stefan","last_name":"Wohlfarth","full_name":"Wohlfarth, Stefan"}],"date_created":"2017-10-17T12:42:51Z","title":"Erweiterung von d3fact um die Domäne Wasserversorgung in Verbindung mit der Analyse und Implementierung eines hydraulischen Simulationsverfahrens","type":"mastersthesis","status":"public","project":[{"_id":"1","name":"SFB 901"},{"_id":"15","name":"SFB 901 - Subprojekt C3"},{"_id":"4","name":"SFB 901 - Project Area C"}],"_id":"613","user_id":"477","language":[{"iso":"ger"}]},{"type":"mastersthesis","status":"public","user_id":"477","_id":"614","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt B3","_id":"11"},{"name":"SFB 901 - Project Area B","_id":"3"}],"language":[{"iso":"ger"}],"citation":{"apa":"Lehrig, S. (2012). <i>Empirischer, quantitativer Vergleich von Modelltransformationssprachen</i>. Universität Paderborn.","bibtex":"@book{Lehrig_2012, title={Empirischer, quantitativer Vergleich von Modelltransformationssprachen}, publisher={Universität Paderborn}, author={Lehrig, Sebastian}, year={2012} }","mla":"Lehrig, Sebastian. <i>Empirischer, quantitativer Vergleich von Modelltransformationssprachen</i>. Universität Paderborn, 2012.","short":"S. Lehrig, Empirischer, quantitativer Vergleich von Modelltransformationssprachen, Universität Paderborn, 2012.","ieee":"S. Lehrig, <i>Empirischer, quantitativer Vergleich von Modelltransformationssprachen</i>. Universität Paderborn, 2012.","chicago":"Lehrig, Sebastian. <i>Empirischer, quantitativer Vergleich von Modelltransformationssprachen</i>. Universität Paderborn, 2012.","ama":"Lehrig S. <i>Empirischer, quantitativer Vergleich von Modelltransformationssprachen</i>. Universität Paderborn; 2012."},"year":"2012","date_created":"2017-10-17T12:42:51Z","author":[{"first_name":"Sebastian","last_name":"Lehrig","full_name":"Lehrig, Sebastian"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T07:02:53Z","title":"Empirischer, quantitativer Vergleich von Modelltransformationssprachen"},{"year":"2012","citation":{"apa":"Kluczniok, S. (2012). <i>Effiziente Paketbildung in mehrdimensionalen Verhandlungsproblemen</i>. Universität Paderborn.","short":"S. Kluczniok, Effiziente Paketbildung in mehrdimensionalen Verhandlungsproblemen, Universität Paderborn, 2012.","bibtex":"@book{Kluczniok_2012, title={Effiziente Paketbildung in mehrdimensionalen Verhandlungsproblemen}, publisher={Universität Paderborn}, author={Kluczniok, Sven}, year={2012} }","mla":"Kluczniok, Sven. <i>Effiziente Paketbildung in mehrdimensionalen Verhandlungsproblemen</i>. Universität Paderborn, 2012.","ama":"Kluczniok S. <i>Effiziente Paketbildung in mehrdimensionalen Verhandlungsproblemen</i>. Universität Paderborn; 2012.","ieee":"S. Kluczniok, <i>Effiziente Paketbildung in mehrdimensionalen Verhandlungsproblemen</i>. Universität Paderborn, 2012.","chicago":"Kluczniok, Sven. <i>Effiziente Paketbildung in mehrdimensionalen Verhandlungsproblemen</i>. Universität Paderborn, 2012."},"date_updated":"2022-01-06T07:02:54Z","publisher":"Universität Paderborn","date_created":"2017-10-17T12:42:52Z","author":[{"last_name":"Kluczniok","full_name":"Kluczniok, Sven","first_name":"Sven"}],"title":"Effiziente Paketbildung in mehrdimensionalen Verhandlungsproblemen","type":"bachelorsthesis","status":"public","_id":"616","project":[{"name":"SFB 901","_id":"1"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"name":"SFB 901 - Project Area A","_id":"2"}],"user_id":"477","language":[{"iso":"ger"}]},{"abstract":[{"lang":"eng","text":"In this paper, a color based feature extraction and classification approach for image processing in embedded systems in presented. The algorithms and data structures developed for this approach pay particular attention to reduce memory consumption and computation power of the entire image processing, since embedded systems usually impose strong restrictions regarding those resources. The feature extraction is realized in terms of an image segmentation algorithm. The criteria of homogeneity for merging pixels and regions is provided by the color classification mechanism, which incorporates appropriate methods for defining, representing and accessing subspaces in the working color space. By doing so, pixels and regions with color values that belong to the same color class can be merged. Furthermore, pixels with redundant color values that do not belong to any pre-defined color class can be completely discarded in order to minimize computational effort. Subsequently, the extracted regions are converted to a more convenient feature representation in terms of statistical moments up to and including second order. For evaluation, the whole image processing approach is applied to a mobile representative of embedded systems within the scope of a simple real-world scenario."}],"status":"public","file":[{"file_size":2787964,"access_level":"closed","file_id":"1245","file_name":"617-INTENSIVE2012-Jungmann.pdf","date_updated":"2018-03-15T06:47:50Z","date_created":"2018-03-15T06:47:50Z","creator":"florida","success":1,"relation":"main_file","content_type":"application/pdf"}],"publication":"Proceedings of the Fourth International Conference on Resource Intensive Applications and Services (INTENSIVE)","type":"conference","ddc":["040"],"file_date_updated":"2018-03-15T06:47:50Z","_id":"617","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt B2","_id":"10"},{"name":"SFB 901 - Project Area B","_id":"3"}],"user_id":"477","year":"2012","page":"22-29","citation":{"mla":"Jungmann, Alexander, et al. “Efficient Color-Based Image Segmentation and Feature Classification for Image Processing in Embedded Systems.” <i>Proceedings of the Fourth International Conference on Resource Intensive Applications and Services (INTENSIVE)</i>, 2012, pp. 22–29.","short":"A. Jungmann, B. Kleinjohann, E. Kleinjohann, M. Bieshaar, in: Proceedings of the Fourth International Conference on Resource Intensive Applications and Services (INTENSIVE), 2012, pp. 22–29.","bibtex":"@inproceedings{Jungmann_Kleinjohann_Kleinjohann_Bieshaar_2012, title={Efficient Color-Based Image Segmentation and Feature Classification for Image Processing in Embedded Systems}, booktitle={Proceedings of the Fourth International Conference on Resource Intensive Applications and Services (INTENSIVE)}, author={Jungmann, Alexander and Kleinjohann, Bernd and Kleinjohann, Elisabeth and Bieshaar, Maarten}, year={2012}, pages={22–29} }","apa":"Jungmann, A., Kleinjohann, B., Kleinjohann, E., &#38; Bieshaar, M. (2012). Efficient Color-Based Image Segmentation and Feature Classification for Image Processing in Embedded Systems. In <i>Proceedings of the Fourth International Conference on Resource Intensive Applications and Services (INTENSIVE)</i> (pp. 22–29).","chicago":"Jungmann, Alexander, Bernd Kleinjohann, Elisabeth Kleinjohann, and Maarten Bieshaar. “Efficient Color-Based Image Segmentation and Feature Classification for Image Processing in Embedded Systems.” In <i>Proceedings of the Fourth International Conference on Resource Intensive Applications and Services (INTENSIVE)</i>, 22–29, 2012.","ieee":"A. Jungmann, B. Kleinjohann, E. Kleinjohann, and M. Bieshaar, “Efficient Color-Based Image Segmentation and Feature Classification for Image Processing in Embedded Systems,” in <i>Proceedings of the Fourth International Conference on Resource Intensive Applications and Services (INTENSIVE)</i>, 2012, pp. 22–29.","ama":"Jungmann A, Kleinjohann B, Kleinjohann E, Bieshaar M. Efficient Color-Based Image Segmentation and Feature Classification for Image Processing in Embedded Systems. In: <i>Proceedings of the Fourth International Conference on Resource Intensive Applications and Services (INTENSIVE)</i>. ; 2012:22-29."},"has_accepted_license":"1","related_material":{"link":[{"url":"http://www.thinkmind.org/index.php?view=article&articleid=intensive_2012_1_50_30031","relation":"confirmation"}]},"title":"Efficient Color-Based Image Segmentation and Feature Classification for Image Processing in Embedded Systems","date_updated":"2022-01-06T07:02:55Z","author":[{"full_name":"Jungmann, Alexander","last_name":"Jungmann","first_name":"Alexander"},{"first_name":"Bernd","full_name":"Kleinjohann, Bernd","last_name":"Kleinjohann"},{"id":"15588","full_name":"Kleinjohann, Elisabeth","last_name":"Kleinjohann","first_name":"Elisabeth"},{"first_name":"Maarten","full_name":"Bieshaar, Maarten","last_name":"Bieshaar"}],"date_created":"2017-10-17T12:42:52Z"},{"type":"mastersthesis","year":"2012","citation":{"ieee":"S. Kurras, <i>Distributed Sampling of Regular Graphs</i>. Universität Paderborn, 2012.","chicago":"Kurras, Sven. <i>Distributed Sampling of Regular Graphs</i>. Universität Paderborn, 2012.","ama":"Kurras S. <i>Distributed Sampling of Regular Graphs</i>. Universität Paderborn; 2012.","mla":"Kurras, Sven. <i>Distributed Sampling of Regular Graphs</i>. Universität Paderborn, 2012.","bibtex":"@book{Kurras_2012, title={Distributed Sampling of Regular Graphs}, publisher={Universität Paderborn}, author={Kurras, Sven}, year={2012} }","short":"S. Kurras, Distributed Sampling of Regular Graphs, Universität Paderborn, 2012.","apa":"Kurras, S. (2012). <i>Distributed Sampling of Regular Graphs</i>. Universität Paderborn."},"status":"public","date_updated":"2022-01-06T07:02:55Z","publisher":"Universität Paderborn","project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"618","author":[{"first_name":"Sven","full_name":"Kurras, Sven","last_name":"Kurras"}],"user_id":"15504","date_created":"2017-10-17T12:42:52Z","title":"Distributed Sampling of Regular Graphs"}]