[{"date_updated":"2022-01-06T07:02:48Z","_id":"597","doi":"10.1007/978-3-642-33996-7_21","series_title":"LNCS","page":"239-250","type":"conference","year":"2012","citation":{"ieee":"M. Mavronicolas and B. Monien, “Minimizing Expectation Plus Variance,” in Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT), 2012, pp. 239–250.","short":"M. Mavronicolas, B. Monien, in: Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT), 2012, pp. 239–250.","bibtex":"@inproceedings{Mavronicolas_Monien_2012, series={LNCS}, title={Minimizing Expectation Plus Variance}, DOI={10.1007/978-3-642-33996-7_21}, 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} }","mla":"Mavronicolas, Marios, and Burkhard Monien. “Minimizing Expectation Plus Variance.” Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT), 2012, pp. 239–50, doi:10.1007/978-3-642-33996-7_21.","apa":"Mavronicolas, M., & Monien, B. (2012). Minimizing Expectation Plus Variance. In Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT) (pp. 239–250). https://doi.org/10.1007/978-3-642-33996-7_21","ama":"Mavronicolas M, Monien B. Minimizing Expectation Plus Variance. In: Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT). LNCS. ; 2012:239-250. doi:10.1007/978-3-642-33996-7_21","chicago":"Mavronicolas, Marios, and Burkhard Monien. “Minimizing Expectation Plus Variance.” In Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT), 239–50. LNCS, 2012. https://doi.org/10.1007/978-3-642-33996-7_21."},"abstract":[{"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.","lang":"eng"}],"title":"Minimizing Expectation Plus Variance","ddc":["040"],"user_id":"15504","publication":"Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT)","file_date_updated":"2018-03-15T08:20:53Z","author":[{"last_name":"Mavronicolas","first_name":"Marios","full_name":"Mavronicolas, Marios"},{"last_name":"Monien","full_name":"Monien, Burkhard","first_name":"Burkhard"}],"file":[{"file_id":"1254","creator":"florida","file_size":345826,"relation":"main_file","success":1,"content_type":"application/pdf","date_updated":"2018-03-15T08:20:53Z","date_created":"2018-03-15T08:20:53Z","file_name":"597-newtocs_01.pdf","access_level":"closed"}],"date_created":"2017-10-17T12:42:48Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"_id":"2","name":"SFB 901 - Project Area A"}],"has_accepted_license":"1","status":"public"},{"title":"Methoden zur Bestimmung von innerbetrieblichen Verrechnungspreisen","user_id":"477","status":"public","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"_id":"2","name":"SFB 901 - Project Area A"}],"date_created":"2017-10-17T12:42:48Z","author":[{"last_name":"Mammadov","full_name":"Mammadov, Fuad","first_name":"Fuad"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T07:02:48Z","_id":"598","citation":{"bibtex":"@book{Mammadov_2012, title={Methoden zur Bestimmung von innerbetrieblichen Verrechnungspreisen}, publisher={Universität Paderborn}, author={Mammadov, Fuad}, year={2012} }","mla":"Mammadov, Fuad. Methoden zur Bestimmung von innerbetrieblichen Verrechnungspreisen. Universität Paderborn, 2012.","ama":"Mammadov F. Methoden zur Bestimmung von innerbetrieblichen Verrechnungspreisen. Universität Paderborn; 2012.","apa":"Mammadov, F. (2012). Methoden zur Bestimmung von innerbetrieblichen Verrechnungspreisen. Universität Paderborn.","chicago":"Mammadov, Fuad. Methoden zur Bestimmung von innerbetrieblichen Verrechnungspreisen. Universität Paderborn, 2012.","ieee":"F. Mammadov, Methoden zur Bestimmung von innerbetrieblichen Verrechnungspreisen. Universität Paderborn, 2012.","short":"F. Mammadov, Methoden zur Bestimmung von innerbetrieblichen Verrechnungspreisen, Universität Paderborn, 2012."},"type":"bachelorsthesis","year":"2012","language":[{"iso":"ger"}]},{"year":"2012","citation":{"ieee":"X. Löwen, Managerial Delegation and Capacity Choices: An Analysis of the Cournot-Nash Equilibrium. Universität Paderborn, 2012.","short":"X. Löwen, Managerial Delegation and Capacity Choices: An Analysis of the Cournot-Nash Equilibrium, 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. Managerial Delegation and Capacity Choices: An Analysis of the Cournot-Nash Equilibrium. Universität Paderborn, 2012.","chicago":"Löwen, Xenia. Managerial Delegation and Capacity Choices: An Analysis of the Cournot-Nash Equilibrium. Universität Paderborn, 2012.","apa":"Löwen, X. (2012). Managerial Delegation and Capacity Choices: An Analysis of the Cournot-Nash Equilibrium. Universität Paderborn.","ama":"Löwen X. Managerial Delegation and Capacity Choices: An Analysis of the Cournot-Nash Equilibrium. Universität Paderborn; 2012."},"type":"bachelorsthesis","date_updated":"2022-01-06T07:02:49Z","_id":"599","status":"public","date_created":"2017-10-17T12:42:48Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"name":"SFB 901 - Project Area A","_id":"2"}],"author":[{"last_name":"Löwen","first_name":"Xenia","full_name":"Löwen, Xenia"}],"publisher":"Universität Paderborn","user_id":"15504","title":"Managerial Delegation and Capacity Choices: An Analysis of the Cournot-Nash Equilibrium"},{"date_updated":"2022-01-06T07:02:49Z","_id":"600","type":"bachelorsthesis","citation":{"chicago":"Feldkord, Björn. Lokale Swaps und überholte Informationen in Basic Network Creation Games. Universität Paderborn, 2012.","ama":"Feldkord B. Lokale Swaps und überholte Informationen in Basic Network Creation Games. Universität Paderborn; 2012.","apa":"Feldkord, B. (2012). Lokale Swaps und überholte Informationen in Basic Network Creation Games. 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. Lokale Swaps und überholte Informationen in Basic Network Creation Games. Universität Paderborn, 2012.","short":"B. Feldkord, Lokale Swaps und überholte Informationen in Basic Network Creation Games, Universität Paderborn, 2012.","ieee":"B. Feldkord, Lokale Swaps und überholte Informationen in Basic Network Creation Games. Universität Paderborn, 2012."},"year":"2012","language":[{"iso":"ger"}],"title":"Lokale Swaps und überholte Informationen in Basic Network Creation Games","user_id":"477","status":"public","date_created":"2017-10-17T12:42:49Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"publisher":"Universität Paderborn","author":[{"full_name":"Feldkord, Björn","first_name":"Björn","id":"22704","last_name":"Feldkord"}]},{"intvolume":" 302","_id":"601","type":"dissertation","year":"2012","citation":{"mla":"Kempkes, Barbara. 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} }","chicago":"Kempkes, Barbara. Local Strategies for Robot Formation Problems. Vol. 302. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2012.","apa":"Kempkes, B. (2012). Local strategies for robot formation problems (Vol. 302). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","ama":"Kempkes B. Local Strategies for Robot Formation Problems. Vol 302. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2012.","ieee":"B. Kempkes, Local strategies for robot formation problems, vol. 302. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2012.","short":"B. Kempkes, Local Strategies for Robot Formation Problems, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2012."},"supervisor":[{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"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"}],"ddc":["040"],"user_id":"5786","file_date_updated":"2018-03-15T08:16:44Z","author":[{"first_name":"Barbara","full_name":"Kempkes, Barbara","last_name":"Kempkes"}],"publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","file":[{"access_level":"closed","file_name":"601-Kempkes-PhD.pdf","date_created":"2018-03-15T08:16:44Z","content_type":"application/pdf","date_updated":"2018-03-15T08:16:44Z","relation":"main_file","success":1,"file_size":3805310,"file_id":"1252","creator":"florida"}],"volume":302,"date_created":"2017-10-17T12:42:49Z","has_accepted_license":"1","status":"public","date_updated":"2022-01-06T07:02:50Z","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","language":[{"iso":"eng"}],"title":"Local strategies for robot formation problems","department":[{"_id":"63"},{"_id":"26"}],"publication_identifier":{"isbn":["978-3-942647-21-2"]},"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}]},{"language":[{"iso":"eng"}],"citation":{"ieee":"S. Brangewitz, Learning by Trading in Infinite Horizon Strategic Market Games with Default. Universität Paderborn, 2012.","short":"S. Brangewitz, Learning by Trading in Infinite Horizon Strategic Market Games with Default, Universität Paderborn, 2012.","mla":"Brangewitz, Sonja. 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} }","chicago":"Brangewitz, Sonja. Learning by Trading in Infinite Horizon Strategic Market Games with Default. Universität Paderborn, 2012.","apa":"Brangewitz, S. (2012). Learning by Trading in Infinite Horizon Strategic Market Games with Default. Universität Paderborn.","ama":"Brangewitz S. Learning by Trading in Infinite Horizon Strategic Market Games with Default. Universität Paderborn; 2012."},"type":"report","year":"2012","_id":"602","date_updated":"2022-01-06T07:02:51Z","file":[{"file_size":1284802,"creator":"florida","file_id":"1251","content_type":"application/pdf","date_updated":"2018-03-15T08:16:08Z","relation":"main_file","success":1,"date_created":"2018-03-15T08:16:08Z","file_name":"602-12062_01.pdf","access_level":"closed"}],"department":[{"_id":"205"}],"file_date_updated":"2018-03-15T08:16:08Z","author":[{"full_name":"Brangewitz, Sonja","first_name":"Sonja","last_name":"Brangewitz"}],"publisher":"Universität Paderborn","date_created":"2017-10-17T12:42:49Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"name":"SFB 901 - Project Area A","_id":"2"}],"has_accepted_license":"1","status":"public","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"}],"user_id":"477","ddc":["040"],"title":"Learning by Trading in Infinite Horizon Strategic Market Games with Default"},{"file_date_updated":"2018-03-09T09:57:26Z","department":[{"_id":"75"}],"author":[{"first_name":"Philip","full_name":"Wette, Philip","last_name":"Wette"},{"id":"126","last_name":"Karl","full_name":"Karl, Holger","first_name":"Holger"}],"publisher":"Universität Paderborn","file":[{"date_updated":"2018-03-09T09:57:26Z","content_type":"application/pdf","relation":"main_file","success":1,"file_size":717326,"file_id":"1205","creator":"hkarl","access_level":"closed","date_created":"2018-03-09T09:57:26Z","file_name":"underlayMod2.pdf"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"6","name":"SFB 901 - Subprojekt A2"},{"_id":"2","name":"SFB 901 - Project Area A"}],"date_created":"2017-10-17T12:42:49Z","has_accepted_license":"1","status":"public","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."}],"ddc":["000"],"title":"Introducing feedback to preemptive routing and wavelength assignment algorithms for dynamic traffic scenarios","user_id":"126","citation":{"short":"P. Wette, H. Karl, Introducing Feedback to Preemptive Routing and Wavelength Assignment Algorithms for Dynamic Traffic Scenarios, Universität Paderborn, 2012.","ieee":"P. Wette and H. Karl, Introducing feedback to preemptive routing and wavelength assignment algorithms for dynamic traffic scenarios. Universität Paderborn, 2012.","apa":"Wette, P., & Karl, H. (2012). Introducing feedback to preemptive routing and wavelength assignment algorithms for dynamic traffic scenarios. Universität Paderborn.","ama":"Wette P, Karl H. Introducing Feedback to Preemptive Routing and Wavelength Assignment Algorithms for Dynamic Traffic Scenarios. Universität Paderborn; 2012.","chicago":"Wette, Philip, and Holger Karl. Introducing Feedback to Preemptive Routing and Wavelength Assignment Algorithms for Dynamic Traffic Scenarios. Universität Paderborn, 2012.","mla":"Wette, Philip, and Holger Karl. Introducing Feedback to Preemptive Routing and Wavelength Assignment Algorithms for Dynamic Traffic Scenarios. 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} }"},"type":"report","year":"2012","_id":"603","date_updated":"2022-01-06T07:02:51Z"},{"title":"Implementierung eines Branch-and-Bound-Algorithmus für nichtkonvexe gemischt-ganzzahlige Optimierungsprobleme mit quadratischen Nebenbedingungen","user_id":"477","publisher":"Universität Paderborn","author":[{"last_name":"Seier","first_name":"Henrik","full_name":"Seier, Henrik"}],"status":"public","date_created":"2017-10-17T12:42:49Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"15","name":"SFB 901 - Subprojekt C3"},{"name":"SFB 901 - Project Area C","_id":"4"}],"date_updated":"2022-01-06T07:02:51Z","_id":"604","type":"mastersthesis","year":"2012","citation":{"ieee":"H. Seier, Implementierung eines Branch-and-Bound-Algorithmus für nichtkonvexe gemischt-ganzzahlige Optimierungsprobleme mit quadratischen Nebenbedingungen. 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.","mla":"Seier, Henrik. 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} }","chicago":"Seier, Henrik. Implementierung eines Branch-and-Bound-Algorithmus für nichtkonvexe gemischt-ganzzahlige Optimierungsprobleme mit quadratischen Nebenbedingungen. Universität Paderborn, 2012.","ama":"Seier H. Implementierung eines Branch-and-Bound-Algorithmus für nichtkonvexe gemischt-ganzzahlige Optimierungsprobleme mit quadratischen Nebenbedingungen. Universität Paderborn; 2012.","apa":"Seier, H. (2012). Implementierung eines Branch-and-Bound-Algorithmus für nichtkonvexe gemischt-ganzzahlige Optimierungsprobleme mit quadratischen Nebenbedingungen. Universität Paderborn."},"language":[{"iso":"ger"}]},{"_id":"605","date_updated":"2022-01-06T07:02:51Z","type":"mastersthesis","citation":{"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, Implementierung eines adaptiven Verfahrens zur Linearisierung von nicht-konvexen, nichtlinearen Wassernetzmodellen mit Hilfe einer Fehlerabschätzung. Universität Paderborn, 2012.","chicago":"Isenberg, Florian. Implementierung eines adaptiven Verfahrens zur Linearisierung von nicht-konvexen, nichtlinearen Wassernetzmodellen mit Hilfe einer Fehlerabschätzung. Universität Paderborn, 2012.","apa":"Isenberg, F. (2012). Implementierung eines adaptiven Verfahrens zur Linearisierung von nicht-konvexen, nichtlinearen Wassernetzmodellen mit Hilfe einer Fehlerabschätzung. Universität Paderborn.","ama":"Isenberg F. Implementierung eines adaptiven Verfahrens zur Linearisierung von nicht-konvexen, nichtlinearen Wassernetzmodellen mit Hilfe einer Fehlerabschätzung. Universität Paderborn; 2012.","mla":"Isenberg, Florian. Implementierung eines adaptiven Verfahrens zur Linearisierung von nicht-konvexen, nichtlinearen Wassernetzmodellen mit Hilfe einer Fehlerabschätzung. 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} }"},"year":"2012","language":[{"iso":"ger"}],"title":"Implementierung eines adaptiven Verfahrens zur Linearisierung von nicht-konvexen, nichtlinearen Wassernetzmodellen mit Hilfe einer Fehlerabschätzung","user_id":"477","project":[{"name":"SFB 901","_id":"1"},{"_id":"15","name":"SFB 901 - Subprojekt C3"},{"name":"SFB 901 - Project Area C","_id":"4"}],"date_created":"2017-10-17T12:42:50Z","status":"public","author":[{"full_name":"Isenberg, Florian","first_name":"Florian","last_name":"Isenberg"}],"publisher":"Universität Paderborn"},{"title":"Assessing cognitive alignment in different types of dialog by means of a network model","department":[{"_id":"115"}],"publication_identifier":{"issn":["0893-6080"]},"publication_status":"published","date_updated":"2022-01-06T07:02:51Z","doi":"10.1016/j.neunet.2012.02.013","language":[{"iso":"eng"}],"extern":"1","user_id":"59649","publication":"Neural Networks","publisher":"Elsevier BV","author":[{"full_name":"Mehler, Alexander","first_name":"Alexander","last_name":"Mehler"},{"last_name":"Lücking","first_name":"Andy","full_name":"Lücking, Andy"},{"id":"59649","last_name":"Menke","full_name":"Menke, Peter","first_name":"Peter"}],"volume":32,"date_created":"2018-12-07T15:17:39Z","status":"public","_id":"6055","intvolume":" 32","page":"159-164","year":"2012","type":"journal_article","citation":{"ieee":"A. Mehler, A. Lücking, and P. Menke, “Assessing cognitive alignment in different types of dialog by means of a network model,” Neural Networks, vol. 32, pp. 159–164, 2012.","short":"A. Mehler, A. Lücking, P. Menke, Neural Networks 32 (2012) 159–164.","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={10.1016/j.neunet.2012.02.013}, journal={Neural Networks}, publisher={Elsevier BV}, author={Mehler, Alexander and Lücking, Andy and Menke, Peter}, year={2012}, pages={159–164} }","mla":"Mehler, Alexander, et al. “Assessing Cognitive Alignment in Different Types of Dialog by Means of a Network Model.” Neural Networks, vol. 32, Elsevier BV, 2012, pp. 159–64, doi:10.1016/j.neunet.2012.02.013.","ama":"Mehler A, Lücking A, Menke P. Assessing cognitive alignment in different types of dialog by means of a network model. Neural Networks. 2012;32:159-164. doi:10.1016/j.neunet.2012.02.013","apa":"Mehler, A., Lücking, A., & Menke, P. (2012). Assessing cognitive alignment in different types of dialog by means of a network model. Neural Networks, 32, 159–164. https://doi.org/10.1016/j.neunet.2012.02.013","chicago":"Mehler, Alexander, Andy Lücking, and Peter Menke. “Assessing Cognitive Alignment in Different Types of Dialog by Means of a Network Model.” Neural Networks 32 (2012): 159–64. https://doi.org/10.1016/j.neunet.2012.02.013."}},{"series_title":"Handbooks of Applied Linguistics","language":[{"iso":"eng"}],"date_updated":"2022-01-06T07:02:51Z","department":[{"_id":"115"}],"publication_status":"published","publication_identifier":{"isbn":["978-3-11-018834-9"]},"title":"Evaluation of Technical Communication","year":"2012","citation":{"short":"P. Menke, in: Handbook of Technical Communication, de Gruyter, 2012, pp. 285–314.","ieee":"P. Menke, “Evaluation of Technical Communication,” in Handbook of Technical Communication, vol. 8, de Gruyter, 2012, pp. 285–314.","chicago":"Menke, Peter. “Evaluation of Technical Communication.” In Handbook of Technical Communication, 8:285–314. Handbooks of Applied Linguistics. de Gruyter, 2012.","ama":"Menke P. Evaluation of Technical Communication. In: Handbook of Technical Communication. Vol 8. Handbooks of Applied Linguistics. de Gruyter; 2012:285–314.","apa":"Menke, P. (2012). Evaluation of Technical Communication. In Handbook of Technical Communication (Vol. 8, pp. 285–314). de Gruyter.","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} }","mla":"Menke, Peter. “Evaluation of Technical Communication.” Handbook of Technical Communication, vol. 8, de Gruyter, 2012, pp. 285–314."},"type":"book_chapter","page":"285–314","intvolume":" 8","_id":"6057","publisher":"de Gruyter","author":[{"id":"59649","last_name":"Menke","full_name":"Menke, Peter","first_name":"Peter"}],"publication":"Handbook of Technical Communication","status":"public","date_created":"2018-12-07T15:22:25Z","volume":8,"extern":"1","user_id":"59649"},{"date_updated":"2022-01-06T07:02:51Z","_id":"606","type":"bachelorsthesis","year":"2012","citation":{"ieee":"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.","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. Identitätsbasierte Signaturen - Ein Sicherheitsbeweis für Signaturen auf Grundlage von Gap-Diffie-Hellman-Gruppen mit Hilfe des Forking-Lemmas. Universität Paderborn, 2012.","chicago":"Löken, Nils. Identitätsbasierte Signaturen - Ein Sicherheitsbeweis für Signaturen auf Grundlage von Gap-Diffie-Hellman-Gruppen mit Hilfe des Forking-Lemmas. Universität Paderborn, 2012.","apa":"Löken, N. (2012). Identitätsbasierte Signaturen - Ein Sicherheitsbeweis für Signaturen auf Grundlage von Gap-Diffie-Hellman-Gruppen mit Hilfe des Forking-Lemmas. Universität Paderborn.","ama":"Löken N. Identitätsbasierte Signaturen - Ein Sicherheitsbeweis für Signaturen auf Grundlage von Gap-Diffie-Hellman-Gruppen mit Hilfe des Forking-Lemmas. Universität Paderborn; 2012."},"supervisor":[{"first_name":"Johannes","full_name":"Blömer, Johannes","last_name":"Blömer","id":"23"}],"language":[{"iso":"ger"}],"title":"Identitätsbasierte Signaturen - Ein Sicherheitsbeweis für Signaturen auf Grundlage von Gap-Diffie-Hellman-Gruppen mit Hilfe des Forking-Lemmas","user_id":"13703","publisher":"Universität Paderborn","author":[{"first_name":"Nils","full_name":"Löken, Nils","last_name":"Löken","id":"13703"}],"department":[{"_id":"64"}],"status":"public","project":[{"_id":"1","name":"SFB 901"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"4","name":"SFB 901 - Project Area C"}],"date_created":"2017-10-17T12:42:50Z"},{"supervisor":[{"full_name":"Blömer, Johannes","first_name":"Johannes","id":"23","last_name":"Blömer"}],"language":[{"iso":"ger"}],"year":"2012","type":"bachelorsthesis","citation":{"ama":"Haarhoff T. Identitätsbasierte Kryptographie - Implementierung von Paarungen für Körper der Charakteristik 2. Universität Paderborn; 2012.","apa":"Haarhoff, T. (2012). Identitätsbasierte Kryptographie - Implementierung von Paarungen für Körper der Charakteristik 2. Universität Paderborn.","chicago":"Haarhoff, Thomas. Identitätsbasierte Kryptographie - Implementierung von Paarungen für Körper der Charakteristik 2. Universität Paderborn, 2012.","mla":"Haarhoff, Thomas. Identitätsbasierte Kryptographie - Implementierung von Paarungen für Körper der Charakteristik 2. 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} }","short":"T. Haarhoff, Identitätsbasierte Kryptographie - Implementierung von Paarungen für Körper der Charakteristik 2, Universität Paderborn, 2012.","ieee":"T. Haarhoff, Identitätsbasierte Kryptographie - Implementierung von Paarungen für Körper der Charakteristik 2. Universität Paderborn, 2012."},"_id":"607","date_updated":"2022-01-06T07:02:51Z","department":[{"_id":"64"}],"publisher":"Universität Paderborn","author":[{"first_name":"Thomas","full_name":"Haarhoff, Thomas","last_name":"Haarhoff"}],"date_created":"2017-10-17T12:42:50Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"name":"SFB 901 - Project Area C","_id":"4"}],"status":"public","user_id":"477","title":"Identitätsbasierte Kryptographie - Implementierung von Paarungen für Körper der Charakteristik 2"},{"status":"public","has_accepted_license":"1","date_created":"2017-10-17T12:42:50Z","author":[{"last_name":"Timm","full_name":"Timm, Nils","first_name":"Nils"},{"first_name":"Heike","full_name":"Wehrheim, Heike","last_name":"Wehrheim","id":"573"},{"full_name":"Czech, Mike","first_name":"Mike","last_name":"Czech"}],"publication":"Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM)","file_date_updated":"2018-03-15T08:15:33Z","file":[{"access_level":"closed","date_created":"2018-03-15T08:15:33Z","file_name":"608-Timm2013-0main.pdf","relation":"main_file","success":1,"content_type":"application/pdf","date_updated":"2018-03-15T08:15:33Z","file_id":"1250","creator":"florida","file_size":396337}],"ddc":["040"],"user_id":"477","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"}],"citation":{"ama":"Timm N, Wehrheim H, Czech M. Heuristic-Guided Abstraction Refinement for Concurrent Systems. In: Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM). LNCS. ; 2012:348-363. doi:10.1007/978-3-642-34281-3_25","apa":"Timm, N., Wehrheim, H., & Czech, M. (2012). Heuristic-Guided Abstraction Refinement for Concurrent Systems. In Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM) (pp. 348–363). https://doi.org/10.1007/978-3-642-34281-3_25","chicago":"Timm, Nils, Heike Wehrheim, and Mike Czech. “Heuristic-Guided Abstraction Refinement for Concurrent Systems.” In Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM), 348–63. LNCS, 2012. https://doi.org/10.1007/978-3-642-34281-3_25.","bibtex":"@inproceedings{Timm_Wehrheim_Czech_2012, series={LNCS}, title={Heuristic-Guided Abstraction Refinement for Concurrent Systems}, DOI={10.1007/978-3-642-34281-3_25}, 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.” Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM), 2012, pp. 348–63, doi:10.1007/978-3-642-34281-3_25.","short":"N. Timm, H. Wehrheim, M. Czech, in: Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM), 2012, pp. 348–363.","ieee":"N. Timm, H. Wehrheim, and M. Czech, “Heuristic-Guided Abstraction Refinement for Concurrent Systems,” in Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM), 2012, pp. 348–363."},"type":"conference","year":"2012","page":"348-363","_id":"608","project":[{"_id":"1","name":"SFB 901"},{"_id":"12","name":"SFB 901 - Subprojekt B4"},{"_id":"3","name":"SFB 901 - Project Area B"}],"department":[{"_id":"77"}],"title":"Heuristic-Guided Abstraction Refinement for Concurrent Systems","language":[{"iso":"eng"}],"series_title":"LNCS","doi":"10.1007/978-3-642-34281-3_25","date_updated":"2022-01-06T07:02:52Z"},{"date_updated":"2022-01-06T07:02:52Z","_id":"610","year":"2012","citation":{"short":"M. Mohr, Generating Prototypes of Adaptive Component-Based Software Systems for Performance Analysis, Universität Paderborn, 2012.","ieee":"M. Mohr, Generating Prototypes of Adaptive Component-based Software Systems for Performance Analysis. Universität Paderborn, 2012.","chicago":"Mohr, Mario. Generating Prototypes of Adaptive Component-Based Software Systems for Performance Analysis. Universität Paderborn, 2012.","apa":"Mohr, M. (2012). Generating Prototypes of Adaptive Component-based Software Systems for Performance Analysis. Universität Paderborn.","ama":"Mohr M. Generating Prototypes of Adaptive Component-Based Software Systems for Performance Analysis. Universität Paderborn; 2012.","mla":"Mohr, Mario. Generating Prototypes of Adaptive Component-Based Software Systems for Performance Analysis. Universität Paderborn, 2012.","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} }"},"type":"mastersthesis","user_id":"15504","ddc":["040"],"title":"Generating Prototypes of Adaptive Component-based Software Systems for Performance Analysis","project":[{"_id":"1","name":"SFB 901"},{"_id":"11","name":"SFB 901 - Subprojekt B3"},{"_id":"3","name":"SFB 901 - Project Area B"}],"date_created":"2017-10-17T12:42:51Z","has_accepted_license":"1","status":"public","file":[{"date_updated":"2018-03-15T08:13:40Z","content_type":"application/pdf","success":1,"relation":"main_file","file_size":1270467,"creator":"florida","file_id":"1248","access_level":"closed","date_created":"2018-03-15T08:13:40Z","file_name":"610-MA_Mohr_2012_final.pdf"}],"file_date_updated":"2018-03-15T08:13:40Z","publisher":"Universität Paderborn","author":[{"full_name":"Mohr, Mario","first_name":"Mario","last_name":"Mohr"}]},{"volume":64,"date_created":"2018-12-10T11:09:13Z","status":"public","department":[{"_id":"274"}],"publication":"PERSONALquartely","author":[{"last_name":"Steinmetz","id":"43261","first_name":"Holger","full_name":"Steinmetz, Holger"},{"full_name":"Schwens, C","first_name":"C","last_name":"Schwens"},{"full_name":"Wehner, M","first_name":"M","last_name":"Wehner"},{"first_name":"Rüdiger","full_name":"Kabst, Rüdiger","last_name":"Kabst","id":"42362"}],"title":"Das Cranet-Projekt: Kreuzkulturelle Vergleiche im HR-Management.","user_id":"46632","page":"34-39","year":"2012","citation":{"short":"H. Steinmetz, C. Schwens, M. Wehner, R. Kabst, PERSONALquartely 64 (2012) 34–39.","ieee":"H. Steinmetz, C. Schwens, M. Wehner, and R. Kabst, “Das Cranet-Projekt: Kreuzkulturelle Vergleiche im HR-Management.,” PERSONALquartely, 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.” PERSONALquartely 64, no. 1 (2012): 34–39.","apa":"Steinmetz, H., Schwens, C., Wehner, M., & Kabst, R. (2012). Das Cranet-Projekt: Kreuzkulturelle Vergleiche im HR-Management. PERSONALquartely, 64(1), 34–39.","ama":"Steinmetz H, Schwens C, Wehner M, Kabst R. Das Cranet-Projekt: Kreuzkulturelle Vergleiche im HR-Management. PERSONALquartely. 2012;64(1):34-39.","mla":"Steinmetz, Holger, et al. “Das Cranet-Projekt: Kreuzkulturelle Vergleiche Im HR-Management.” PERSONALquartely, vol. 64, no. 1, 2012, pp. 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} }"},"type":"journal_article","language":[{"iso":"eng"}],"issue":"1","intvolume":" 64","_id":"6102","date_updated":"2022-01-06T07:02:53Z"},{"language":[{"iso":"eng"}],"page":"3","citation":{"short":"R. Kabst, M. Baum, PERSONALquartely 64 (2012) 3.","ieee":"R. Kabst and M. Baum, “Editorial: Employer Branding: Strategie, Instrumente, Umsetzung,” PERSONALquartely, vol. 64, no. 3, p. 3, 2012.","chicago":"Kabst, Rüdiger, and M Baum. “Editorial: Employer Branding: Strategie, Instrumente, Umsetzung.” PERSONALquartely 64, no. 3 (2012): 3.","ama":"Kabst R, Baum M. Editorial: Employer Branding: Strategie, Instrumente, Umsetzung. PERSONALquartely. 2012;64(3):3.","apa":"Kabst, R., & Baum, M. (2012). Editorial: Employer Branding: Strategie, Instrumente, Umsetzung. PERSONALquartely, 64(3), 3.","mla":"Kabst, Rüdiger, and M. Baum. “Editorial: Employer Branding: Strategie, Instrumente, Umsetzung.” PERSONALquartely, vol. 64, no. 3, 2012, p. 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} }"},"year":"2012","type":"journal_article","intvolume":" 64","_id":"6103","date_updated":"2022-01-06T07:02:53Z","issue":"3","publication":"PERSONALquartely","department":[{"_id":"274"}],"author":[{"first_name":"Rüdiger","full_name":"Kabst, Rüdiger","last_name":"Kabst","id":"42362"},{"last_name":"Baum","first_name":"M","full_name":"Baum, M"}],"date_created":"2018-12-10T11:39:27Z","status":"public","volume":64,"user_id":"46632","title":"Editorial: Employer Branding: Strategie, Instrumente, Umsetzung"},{"year":"2012","type":"bachelorsthesis","citation":{"ieee":"H. Hangmann, Generating Adjustable Temperature Gradients on modern FPGAs. Universität Paderborn, 2012.","short":"H. Hangmann, Generating Adjustable Temperature Gradients on Modern FPGAs, Universität Paderborn, 2012.","mla":"Hangmann, Hendrik. Generating Adjustable Temperature Gradients on Modern FPGAs. 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} }","chicago":"Hangmann, Hendrik. Generating Adjustable Temperature Gradients on Modern FPGAs. Universität Paderborn, 2012.","ama":"Hangmann H. Generating Adjustable Temperature Gradients on Modern FPGAs. Universität Paderborn; 2012.","apa":"Hangmann, H. (2012). Generating Adjustable Temperature Gradients on modern FPGAs. Universität Paderborn."},"date_updated":"2022-01-06T07:02:53Z","_id":"611","status":"public","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C2","_id":"14"},{"_id":"4","name":"SFB 901 - Project Area C"}],"date_created":"2017-10-17T12:42:51Z","publisher":"Universität Paderborn","author":[{"full_name":"Hangmann, Hendrik","first_name":"Hendrik","last_name":"Hangmann"}],"title":"Generating Adjustable Temperature Gradients on modern FPGAs","user_id":"15504"},{"citation":{"ama":"Wohlfarth S. Erweiterung von d3fact um die Domäne Wasserversorgung in Verbindung mit der Analyse und Implementierung eines hydraulischen Simulationsverfahrens. Universität Paderborn; 2012.","apa":"Wohlfarth, S. (2012). Erweiterung von d3fact um die Domäne Wasserversorgung in Verbindung mit der Analyse und Implementierung eines hydraulischen Simulationsverfahrens. Universität Paderborn.","chicago":"Wohlfarth, Stefan. 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. Erweiterung von d3fact um die Domäne Wasserversorgung in Verbindung mit der Analyse und Implementierung eines hydraulischen Simulationsverfahrens. Universität Paderborn, 2012.","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.","ieee":"S. Wohlfarth, Erweiterung von d3fact um die Domäne Wasserversorgung in Verbindung mit der Analyse und Implementierung eines hydraulischen Simulationsverfahrens. Universität Paderborn, 2012."},"year":"2012","type":"mastersthesis","language":[{"iso":"ger"}],"_id":"613","date_updated":"2022-01-06T07:02:53Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"15","name":"SFB 901 - Subprojekt C3"},{"_id":"4","name":"SFB 901 - Project Area C"}],"date_created":"2017-10-17T12:42:51Z","status":"public","author":[{"first_name":"Stefan","full_name":"Wohlfarth, Stefan","last_name":"Wohlfarth"}],"publisher":"Universität Paderborn","title":"Erweiterung von d3fact um die Domäne Wasserversorgung in Verbindung mit der Analyse und Implementierung eines hydraulischen Simulationsverfahrens","user_id":"477"},{"title":"Einführung in die Betriebswirtschaftslehre","user_id":"46632","place":"Wiesbaden","publication_identifier":{"isbn":["978-3-8349-1994-6"]},"status":"public","date_created":"2018-12-11T10:21:09Z","author":[{"last_name":"Weber","first_name":"W","full_name":"Weber, W"},{"full_name":"Kabst, Rüdiger","first_name":"Rüdiger","id":"42362","last_name":"Kabst"}],"department":[{"_id":"274"}],"edition":"8","date_updated":"2022-01-06T07:02:53Z","_id":"6138","year":"2012","type":"book","citation":{"short":"W. Weber, R. Kabst, Einführung in Die Betriebswirtschaftslehre, 8th ed., Wiesbaden, 2012.","ieee":"W. Weber and R. Kabst, Einführung in die Betriebswirtschaftslehre, 8th ed. Wiesbaden, 2012.","chicago":"Weber, W, and Rüdiger Kabst. Einführung in Die Betriebswirtschaftslehre. 8th ed. Wiesbaden, 2012.","apa":"Weber, W., & Kabst, R. (2012). Einführung in die Betriebswirtschaftslehre (8th ed.). Wiesbaden.","ama":"Weber W, Kabst R. Einführung in Die Betriebswirtschaftslehre. 8th ed. Wiesbaden; 2012.","bibtex":"@book{Weber_Kabst_2012, place={Wiesbaden}, edition={8}, title={Einführung in die Betriebswirtschaftslehre}, author={Weber, W and Kabst, Rüdiger}, year={2012} }","mla":"Weber, W., and Rüdiger Kabst. Einführung in Die Betriebswirtschaftslehre. 8th ed., 2012."},"language":[{"iso":"eng"}]},{"date_updated":"2022-01-06T07:02:53Z","_id":"614","language":[{"iso":"ger"}],"year":"2012","citation":{"chicago":"Lehrig, Sebastian. Empirischer, quantitativer Vergleich von Modelltransformationssprachen. Universität Paderborn, 2012.","apa":"Lehrig, S. (2012). Empirischer, quantitativer Vergleich von Modelltransformationssprachen. Universität Paderborn.","ama":"Lehrig S. Empirischer, quantitativer Vergleich von Modelltransformationssprachen. Universität Paderborn; 2012.","bibtex":"@book{Lehrig_2012, title={Empirischer, quantitativer Vergleich von Modelltransformationssprachen}, publisher={Universität Paderborn}, author={Lehrig, Sebastian}, year={2012} }","mla":"Lehrig, Sebastian. Empirischer, quantitativer Vergleich von Modelltransformationssprachen. Universität Paderborn, 2012.","short":"S. Lehrig, Empirischer, quantitativer Vergleich von Modelltransformationssprachen, Universität Paderborn, 2012.","ieee":"S. Lehrig, Empirischer, quantitativer Vergleich von Modelltransformationssprachen. Universität Paderborn, 2012."},"type":"mastersthesis","user_id":"477","title":"Empirischer, quantitativer Vergleich von Modelltransformationssprachen","author":[{"full_name":"Lehrig, Sebastian","first_name":"Sebastian","last_name":"Lehrig"}],"publisher":"Universität Paderborn","date_created":"2017-10-17T12:42:51Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt B3","_id":"11"},{"_id":"3","name":"SFB 901 - Project Area B"}],"status":"public"},{"date_updated":"2022-01-06T07:02:53Z","_id":"6148","language":[{"iso":"eng"}],"citation":{"bibtex":"@inbook{Baum_Schwens_Kabst_2012, place={Cheltenham Glos/Northampton}, title={Determinants of Different Types of Born Globals.}, booktitle={Handbook of Research on Born Globals}, publisher={Edward Elgar Publishing Ltd.}, author={Baum, M and Schwens, C and Kabst, R}, editor={Gabrielsson, M and Kirpalani, MEditors}, year={2012}, pages={36–45} }","mla":"Baum, M., et al. “Determinants of Different Types of Born Globals.” Handbook of Research on Born Globals, edited by M Gabrielsson and M Kirpalani, Edward Elgar Publishing Ltd., 2012, pp. 36–45.","apa":"Baum, M., Schwens, C., & Kabst, R. (2012). Determinants of Different Types of Born Globals. In M. Gabrielsson & M. Kirpalani (Eds.), Handbook of Research on Born Globals (pp. 36–45). Cheltenham Glos/Northampton: Edward Elgar Publishing Ltd.","ama":"Baum M, Schwens C, Kabst R. Determinants of Different Types of Born Globals. In: Gabrielsson M, Kirpalani M, eds. Handbook of Research on Born Globals. Cheltenham Glos/Northampton: Edward Elgar Publishing Ltd.; 2012:36-45.","chicago":"Baum, M, C Schwens, and R Kabst. “Determinants of Different Types of Born Globals.” In Handbook of Research on Born Globals, edited by M Gabrielsson and M Kirpalani, 36–45. Cheltenham Glos/Northampton: Edward Elgar Publishing Ltd., 2012.","ieee":"M. Baum, C. Schwens, and R. Kabst, “Determinants of Different Types of Born Globals.,” in Handbook of Research on Born Globals, M. Gabrielsson and M. Kirpalani, Eds. Cheltenham Glos/Northampton: Edward Elgar Publishing Ltd., 2012, pp. 36–45.","short":"M. Baum, C. Schwens, R. Kabst, in: M. Gabrielsson, M. Kirpalani (Eds.), Handbook of Research on Born Globals, Edward Elgar Publishing Ltd., Cheltenham Glos/Northampton, 2012, pp. 36–45."},"year":"2012","type":"book_chapter","page":"36-45","user_id":"46632","title":"Determinants of Different Types of Born Globals.","place":"Cheltenham Glos/Northampton","status":"public","date_created":"2018-12-11T11:02:56Z","editor":[{"first_name":"M","full_name":"Gabrielsson, M","last_name":"Gabrielsson"},{"last_name":"Kirpalani","full_name":"Kirpalani, M","first_name":"M"}],"author":[{"last_name":"Baum","full_name":"Baum, M","first_name":"M"},{"last_name":"Schwens","full_name":"Schwens, C","first_name":"C"},{"full_name":"Kabst, R","first_name":"R","last_name":"Kabst"}],"publisher":"Edward Elgar Publishing Ltd.","department":[{"_id":"274"}],"publication":"Handbook of Research on Born Globals"},{"date_updated":"2022-01-06T07:02:53Z","_id":"6149","language":[{"iso":"eng"}],"type":"book_chapter","citation":{"short":"R. Isidor, C. Schwens, R. Kabst, in: J. Zentes (Ed.), Markteintrittsstrategien - Dynamik Und Komplexität, 2012, pp. 193–205.","ieee":"R. Isidor, C. Schwens, and R. Kabst, “Die Messung von Joint-Venture Erfolg,” in Markteintrittsstrategien - Dynamik und Komplexität, J. Zentes, Ed. 2012, pp. 193–205.","apa":"Isidor, R., Schwens, C., & Kabst, R. (2012). Die Messung von Joint-Venture Erfolg. In J. Zentes (Ed.), Markteintrittsstrategien - Dynamik und Komplexität (pp. 193–205).","ama":"Isidor R, Schwens C, Kabst R. Die Messung von Joint-Venture Erfolg. In: Zentes J, ed. Markteintrittsstrategien - Dynamik Und Komplexität. ; 2012:193-205.","chicago":"Isidor, R, C Schwens, and R Kabst. “Die Messung von Joint-Venture Erfolg.” In Markteintrittsstrategien - Dynamik Und Komplexität, edited by J Zentes, 193–205, 2012.","bibtex":"@inbook{Isidor_Schwens_Kabst_2012, title={Die Messung von Joint-Venture Erfolg}, booktitle={Markteintrittsstrategien - Dynamik und Komplexität}, author={Isidor, R and Schwens, C and Kabst, R}, editor={Zentes, JEditor}, year={2012}, pages={193–205} }","mla":"Isidor, R., et al. “Die Messung von Joint-Venture Erfolg.” Markteintrittsstrategien - Dynamik Und Komplexität, edited by J Zentes, 2012, pp. 193–205."},"year":"2012","page":"193-205","user_id":"46632","title":"Die Messung von Joint-Venture Erfolg","author":[{"last_name":"Isidor","first_name":"R","full_name":"Isidor, R"},{"first_name":"C","full_name":"Schwens, C","last_name":"Schwens"},{"full_name":"Kabst, R","first_name":"R","last_name":"Kabst"}],"department":[{"_id":"274"}],"publication":"Markteintrittsstrategien - Dynamik und Komplexität","status":"public","date_created":"2018-12-11T11:06:03Z","editor":[{"first_name":"J","full_name":"Zentes, J","last_name":"Zentes"}],"publication_identifier":{"isbn":["978-3-8349-3503-8"]}},{"year":"2012","citation":{"mla":"Kluczniok, Sven. 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} }","ama":"Kluczniok S. Effiziente Paketbildung in mehrdimensionalen Verhandlungsproblemen. Universität Paderborn; 2012.","apa":"Kluczniok, S. (2012). Effiziente Paketbildung in mehrdimensionalen Verhandlungsproblemen. Universität Paderborn.","chicago":"Kluczniok, Sven. Effiziente Paketbildung in mehrdimensionalen Verhandlungsproblemen. Universität Paderborn, 2012.","ieee":"S. Kluczniok, Effiziente Paketbildung in mehrdimensionalen Verhandlungsproblemen. Universität Paderborn, 2012.","short":"S. Kluczniok, Effiziente Paketbildung in mehrdimensionalen Verhandlungsproblemen, Universität Paderborn, 2012."},"type":"bachelorsthesis","language":[{"iso":"ger"}],"date_updated":"2022-01-06T07:02:54Z","_id":"616","publisher":"Universität Paderborn","author":[{"last_name":"Kluczniok","first_name":"Sven","full_name":"Kluczniok, Sven"}],"status":"public","date_created":"2017-10-17T12:42:52Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"_id":"2","name":"SFB 901 - Project Area A"}],"title":"Effiziente Paketbildung in mehrdimensionalen Verhandlungsproblemen","user_id":"477"},{"ddc":["040"],"title":"Efficient Color-Based Image Segmentation and Feature Classification for Image Processing in Embedded Systems","related_material":{"link":[{"url":"http://www.thinkmind.org/index.php?view=article&articleid=intensive_2012_1_50_30031","relation":"confirmation"}]},"user_id":"477","abstract":[{"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.","lang":"eng"}],"status":"public","has_accepted_license":"1","date_created":"2017-10-17T12:42:52Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"10","name":"SFB 901 - Subprojekt B2"},{"_id":"3","name":"SFB 901 - Project Area B"}],"author":[{"last_name":"Jungmann","first_name":"Alexander","full_name":"Jungmann, Alexander"},{"last_name":"Kleinjohann","full_name":"Kleinjohann, Bernd","first_name":"Bernd"},{"last_name":"Kleinjohann","id":"15588","first_name":"Elisabeth","full_name":"Kleinjohann, Elisabeth"},{"full_name":"Bieshaar, Maarten","first_name":"Maarten","last_name":"Bieshaar"}],"publication":"Proceedings of the Fourth International Conference on Resource Intensive Applications and Services (INTENSIVE)","file_date_updated":"2018-03-15T06:47:50Z","file":[{"file_id":"1245","creator":"florida","file_size":2787964,"relation":"main_file","success":1,"content_type":"application/pdf","date_updated":"2018-03-15T06:47:50Z","file_name":"617-INTENSIVE2012-Jungmann.pdf","date_created":"2018-03-15T06:47:50Z","access_level":"closed"}],"_id":"617","date_updated":"2022-01-06T07:02:55Z","year":"2012","type":"conference","citation":{"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} }","mla":"Jungmann, Alexander, et al. “Efficient Color-Based Image Segmentation and Feature Classification for Image Processing in Embedded Systems.” Proceedings of the Fourth International Conference on Resource Intensive Applications and Services (INTENSIVE), 2012, 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 Proceedings of the Fourth International Conference on Resource Intensive Applications and Services (INTENSIVE), 22–29, 2012.","apa":"Jungmann, A., Kleinjohann, B., Kleinjohann, E., & Bieshaar, M. (2012). Efficient Color-Based Image Segmentation and Feature Classification for Image Processing in Embedded Systems. In Proceedings of the Fourth International Conference on Resource Intensive Applications and Services (INTENSIVE) (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: Proceedings of the Fourth International Conference on Resource Intensive Applications and Services (INTENSIVE). ; 2012:22-29.","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 Proceedings of the Fourth International Conference on Resource Intensive Applications and Services (INTENSIVE), 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."},"page":"22-29"},{"title":"Distributed Sampling of Regular Graphs","user_id":"15504","date_created":"2017-10-17T12:42:52Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"status":"public","author":[{"first_name":"Sven","full_name":"Kurras, Sven","last_name":"Kurras"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T07:02:55Z","_id":"618","type":"mastersthesis","citation":{"ieee":"S. Kurras, Distributed Sampling of Regular Graphs. Universität Paderborn, 2012.","short":"S. Kurras, Distributed Sampling of Regular Graphs, Universität Paderborn, 2012.","bibtex":"@book{Kurras_2012, title={Distributed Sampling of Regular Graphs}, publisher={Universität Paderborn}, author={Kurras, Sven}, year={2012} }","mla":"Kurras, Sven. Distributed Sampling of Regular Graphs. Universität Paderborn, 2012.","ama":"Kurras S. Distributed Sampling of Regular Graphs. Universität Paderborn; 2012.","apa":"Kurras, S. (2012). Distributed Sampling of Regular Graphs. Universität Paderborn.","chicago":"Kurras, Sven. Distributed Sampling of Regular Graphs. Universität Paderborn, 2012."},"year":"2012"},{"abstract":[{"text":"Dynamics in networks is caused by a variety of reasons, like nodes moving in 2D (or 3D) in multihop cellphone networks, joins and leaves in peer-to-peer networks, evolution in social networks, and many others. In order to understand such kinds of dynamics, and to design distributed algorithms that behave well under dynamics, many ways to model dynamics are introduced and analyzed w.r.t. correctness and eciency of distributed algorithms. In [16], Kuhn, Lynch, and Oshman have introduced a very general, worst case type model of dynamics: The edge set of the network may change arbitrarily from step to step, the only restriction is that it is connected at all times and the set of nodes does not change. An extended model demands that a xed connected subnetwork is maintained over each time interval of length T (T-interval dynamics). They have presented, among others, algorithms for counting the number of nodes under such general models of dynamics.In this paper, we generalize their models and algorithms by adding random edge faults, i.e., we consider fault-prone dynamic networks: We assume that an edge currently existing may fail to transmit data with some probability p. We rst observe that strong counting, i.e., each node knows the correct count and stops, is not possible in a model with random edge faults. Our main two positive results are feasibility and runtime bounds for weak counting, i.e., stopping is no longer required (but still a correct count in each node), and for strong counting with an upper bound, i.e., an upper bound N on n is known to all nodes.","lang":"eng"}],"ddc":["040"],"user_id":"15504","author":[{"full_name":"Brandes, Philipp","first_name":"Philipp","last_name":"Brandes"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"publication":"Proceedings of the 4th Workshop on Theoretical Aspects of Dynamic Distributed Systems (TADDS)","file_date_updated":"2018-03-15T06:47:15Z","file":[{"creator":"florida","file_id":"1244","file_size":346044,"relation":"main_file","success":1,"content_type":"application/pdf","date_updated":"2018-03-15T06:47:15Z","date_created":"2018-03-15T06:47:15Z","file_name":"619-Brandes_MadHTADDS12_01.pdf","access_level":"closed"}],"status":"public","has_accepted_license":"1","date_created":"2017-10-17T12:42:52Z","_id":"619","citation":{"ama":"Brandes P, Meyer auf der Heide F. Distributed Computing in Fault-Prone Dynamic Networks. In: Proceedings of the 4th Workshop on Theoretical Aspects of Dynamic Distributed Systems (TADDS). ICPS. ; 2012:9-14. doi:10.1145/2414815.2414818","apa":"Brandes, P., & Meyer auf der Heide, F. (2012). Distributed Computing in Fault-Prone Dynamic Networks. In Proceedings of the 4th Workshop on Theoretical Aspects of Dynamic Distributed Systems (TADDS) (pp. 9–14). https://doi.org/10.1145/2414815.2414818","chicago":"Brandes, Philipp, and Friedhelm Meyer auf der Heide. “Distributed Computing in Fault-Prone Dynamic Networks.” In Proceedings of the 4th Workshop on Theoretical Aspects of Dynamic Distributed Systems (TADDS), 9–14. ICPS, 2012. https://doi.org/10.1145/2414815.2414818.","bibtex":"@inproceedings{Brandes_Meyer auf der Heide_2012, series={ICPS}, title={Distributed Computing in Fault-Prone Dynamic Networks}, DOI={10.1145/2414815.2414818}, booktitle={Proceedings of the 4th Workshop on Theoretical Aspects of Dynamic Distributed Systems (TADDS)}, author={Brandes, Philipp and Meyer auf der Heide, Friedhelm}, year={2012}, pages={9–14}, collection={ICPS} }","mla":"Brandes, Philipp, and Friedhelm Meyer auf der Heide. “Distributed Computing in Fault-Prone Dynamic Networks.” Proceedings of the 4th Workshop on Theoretical Aspects of Dynamic Distributed Systems (TADDS), 2012, pp. 9–14, doi:10.1145/2414815.2414818.","short":"P. Brandes, F. Meyer auf der Heide, in: Proceedings of the 4th Workshop on Theoretical Aspects of Dynamic Distributed Systems (TADDS), 2012, pp. 9–14.","ieee":"P. Brandes and F. Meyer auf der Heide, “Distributed Computing in Fault-Prone Dynamic Networks,” in Proceedings of the 4th Workshop on Theoretical Aspects of Dynamic Distributed Systems (TADDS), 2012, pp. 9–14."},"type":"conference","year":"2012","page":"9-14","title":"Distributed Computing in Fault-Prone Dynamic Networks","department":[{"_id":"63"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"date_updated":"2022-01-06T07:02:56Z","doi":"10.1145/2414815.2414818","series_title":"ICPS"},{"title":"Datenschutzgerechtes DRM im Cloud Computing","user_id":"477","author":[{"last_name":"Mittendorf","first_name":"Robert","full_name":"Mittendorf, Robert"}],"publisher":"Universität Paderborn","status":"public","date_created":"2017-10-17T12:42:52Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"4","name":"SFB 901 - Project Area C"}],"date_updated":"2022-01-06T07:02:56Z","_id":"620","year":"2012","citation":{"ieee":"R. Mittendorf, Datenschutzgerechtes DRM im Cloud Computing. Universität Paderborn, 2012.","short":"R. Mittendorf, Datenschutzgerechtes DRM im Cloud Computing, Universität Paderborn, 2012.","bibtex":"@book{Mittendorf_2012, title={Datenschutzgerechtes DRM im Cloud Computing}, publisher={Universität Paderborn}, author={Mittendorf, Robert}, year={2012} }","mla":"Mittendorf, Robert. Datenschutzgerechtes DRM im Cloud Computing. Universität Paderborn, 2012.","ama":"Mittendorf R. Datenschutzgerechtes DRM im Cloud Computing. Universität Paderborn; 2012.","apa":"Mittendorf, R. (2012). Datenschutzgerechtes DRM im Cloud Computing. Universität Paderborn.","chicago":"Mittendorf, Robert. Datenschutzgerechtes DRM im Cloud Computing. Universität Paderborn, 2012."},"type":"bachelorsthesis","language":[{"iso":"ger"}]},{"year":"2012","type":"bachelorsthesis","citation":{"short":"S. Sekula, Datenschutzgerechte E-Payment-Schemata im On-The-Fly Computing, Universität Paderborn, 2012.","ieee":"S. Sekula, Datenschutzgerechte E-Payment-Schemata im On-The-Fly Computing. Universität Paderborn, 2012.","chicago":"Sekula, Stephan. Datenschutzgerechte E-Payment-Schemata im On-The-Fly Computing. Universität Paderborn, 2012.","apa":"Sekula, S. (2012). Datenschutzgerechte E-Payment-Schemata im On-The-Fly Computing. Universität Paderborn.","ama":"Sekula S. Datenschutzgerechte E-Payment-Schemata im On-The-Fly Computing. Universität Paderborn; 2012.","mla":"Sekula, Stephan. Datenschutzgerechte E-Payment-Schemata im On-The-Fly Computing. Universität Paderborn, 2012.","bibtex":"@book{Sekula_2012, title={Datenschutzgerechte E-Payment-Schemata im On-The-Fly Computing}, publisher={Universität Paderborn}, author={Sekula, Stephan}, year={2012} }"},"language":[{"iso":"ger"}],"_id":"621","date_updated":"2022-01-06T07:02:57Z","author":[{"first_name":"Stephan","full_name":"Sekula, Stephan","last_name":"Sekula"}],"publisher":"Universität Paderborn","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"_id":"4","name":"SFB 901 - Project Area C"}],"date_created":"2017-10-17T12:42:53Z","status":"public","title":"Datenschutzgerechte E-Payment-Schemata im On-The-Fly Computing","user_id":"477"},{"department":[{"_id":"66"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"9","name":"SFB 901 - Subprojekt B1"},{"name":"SFB 901 - Project Area B","_id":"3"}],"title":"Coverage Criteria for Testing DMM Specifications","series_title":"Electronic Communications of the EASST","language":[{"iso":"eng"}],"date_updated":"2022-01-06T07:02:57Z","doi":"10.14279/tuj.eceasst.47.718","author":[{"last_name":"Arifulina","first_name":"Svetlana","full_name":"Arifulina, Svetlana"},{"id":"107","last_name":"Engels","full_name":"Engels, Gregor","first_name":"Gregor"},{"orcid":"0000-0002-0342-8227","full_name":"Soltenborn, Christian","first_name":"Christian","id":"1737","last_name":"Soltenborn"}],"file_date_updated":"2018-03-15T06:46:40Z","publication":"Proceedings of the 11th International Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT)","file":[{"date_created":"2018-03-15T06:46:40Z","file_name":"622-gtvmt2012-Arifulina_01.pdf","access_level":"closed","file_size":301602,"creator":"florida","file_id":"1243","date_updated":"2018-03-15T06:46:40Z","content_type":"application/pdf","relation":"main_file","success":1}],"has_accepted_license":"1","status":"public","date_created":"2017-10-17T12:42:53Z","abstract":[{"lang":"eng","text":"Behavioral modeling languages are most useful if their behavior is specified formally such that it can e.g. be analyzed and executed automatically. Obviously, the quality of such behavior specifications is crucial. The rule-based semantics specification technique Dynamic Meta Modeling (DMM) honors this by using the approach of Test-driven Semantics Specification (TDSS), which makes sure that the specification at hand at least describes the correct behavior for a suite of test models. However, in its current state TDSS does not provide any means to measure the quality of such a test suite. In this paper, we describe how we have applied the idea of test coverage to TDSS. Similar to common approaches of defining test coverage criteria, we describe a data structure called invocation graph containing possible orders of applications ofDMM rules. Then we define different coverage criteria based on that data structure, taking the rule applications caused by the test suite’s models into account. Our implementation of the described approach gives the language engineer using DMM a means to reason about the quality of the language’s test suite, and also provides hints on how to improve that quality by adding dedicated test models to the test suite."}],"ddc":["040"],"user_id":"14955","type":"conference","citation":{"bibtex":"@inproceedings{Arifulina_Engels_Soltenborn_2012, series={Electronic Communications of the EASST}, title={Coverage Criteria for Testing DMM Specifications}, DOI={10.14279/tuj.eceasst.47.718}, booktitle={Proceedings of the 11th International Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT)}, author={Arifulina, Svetlana and Engels, Gregor and Soltenborn, Christian}, year={2012}, collection={Electronic Communications of the EASST} }","mla":"Arifulina, Svetlana, et al. “Coverage Criteria for Testing DMM Specifications.” Proceedings of the 11th International Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT), 2012, doi:10.14279/tuj.eceasst.47.718.","apa":"Arifulina, S., Engels, G., & Soltenborn, C. (2012). Coverage Criteria for Testing DMM Specifications. In Proceedings of the 11th International Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT). https://doi.org/10.14279/tuj.eceasst.47.718","ama":"Arifulina S, Engels G, Soltenborn C. Coverage Criteria for Testing DMM Specifications. In: Proceedings of the 11th International Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT). Electronic Communications of the EASST. ; 2012. doi:10.14279/tuj.eceasst.47.718","chicago":"Arifulina, Svetlana, Gregor Engels, and Christian Soltenborn. “Coverage Criteria for Testing DMM Specifications.” In Proceedings of the 11th International Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT). Electronic Communications of the EASST, 2012. https://doi.org/10.14279/tuj.eceasst.47.718.","ieee":"S. Arifulina, G. Engels, and C. Soltenborn, “Coverage Criteria for Testing DMM Specifications,” in Proceedings of the 11th International Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT), 2012.","short":"S. Arifulina, G. Engels, C. Soltenborn, in: Proceedings of the 11th International Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT), 2012."},"year":"2012","_id":"622"},{"abstract":[{"lang":"eng","text":"This paper initiates the formal study of a fundamental problem: How to efficiently allocate a shared communication medium among a set of K co-existing networks in the presence of arbitrary external interference? While most literature on medium access focuses on how to share a medium among nodes, these approaches are often either not directly applicable to co-existing networks as they would violate the independence requirement, or they yield a low throughput if applied to multiple networks. We present the randomized medium access (MAC) protocol COMAC which guarantees that a given communication channel is shared fairly among competing and independent networks, and that the available bandwidth is used efficiently. These performance guarantees hold in the presence of arbitrary external interference or even under adversarial jamming. Concretely, we show that the co-existing networks can use a Ω(ε2 min{ε, 1/poly(K)})-fraction of the non-jammed time steps for successful message transmissions, where ε is the (arbitrarily distributed) fraction of time which is not jammed."}],"user_id":"15504","title":"Competitive and fair throughput for co-existing networks under adversarial interference","ddc":["040"],"file":[{"access_level":"closed","date_created":"2018-03-15T06:45:25Z","file_name":"623-PODC-2012_01.pdf","date_updated":"2018-03-15T06:45:25Z","content_type":"application/pdf","relation":"main_file","success":1,"file_size":210382,"file_id":"1241","creator":"florida"}],"publication":"Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC)","department":[{"_id":"79"}],"file_date_updated":"2018-03-15T06:45:25Z","author":[{"full_name":"Richa, Andrea W.","first_name":"Andrea W.","last_name":"Richa"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"},{"last_name":"Schmid","full_name":"Schmid, Stefan","first_name":"Stefan"},{"full_name":"Zhang, Jin ","first_name":"Jin ","last_name":"Zhang"}],"date_created":"2017-10-17T12:42:53Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"name":"SFB 901 - Project Area C","_id":"4"}],"status":"public","has_accepted_license":"1","date_updated":"2022-01-06T07:02:58Z","_id":"623","doi":"10.1145/2332432.2332488","page":"291-300","citation":{"short":"A.W. Richa, C. Scheideler, S. Schmid, J. Zhang, in: Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC), 2012, pp. 291–300.","ieee":"A. W. Richa, C. Scheideler, S. Schmid, and J. Zhang, “Competitive and fair throughput for co-existing networks under adversarial interference,” in Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC), 2012, pp. 291–300.","chicago":"Richa, Andrea W., Christian Scheideler, Stefan Schmid, and Jin Zhang. “Competitive and Fair Throughput for Co-Existing Networks under Adversarial Interference.” In Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC), 291–300, 2012. https://doi.org/10.1145/2332432.2332488.","apa":"Richa, A. W., Scheideler, C., Schmid, S., & Zhang, J. (2012). Competitive and fair throughput for co-existing networks under adversarial interference. In Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC) (pp. 291–300). https://doi.org/10.1145/2332432.2332488","ama":"Richa AW, Scheideler C, Schmid S, Zhang J. Competitive and fair throughput for co-existing networks under adversarial interference. In: Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC). ; 2012:291-300. doi:10.1145/2332432.2332488","bibtex":"@inproceedings{Richa_Scheideler_Schmid_Zhang_2012, title={Competitive and fair throughput for co-existing networks under adversarial interference}, DOI={10.1145/2332432.2332488}, booktitle={Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC)}, author={Richa, Andrea W. and Scheideler, Christian and Schmid, Stefan and Zhang, Jin }, year={2012}, pages={291–300} }","mla":"Richa, Andrea W., et al. “Competitive and Fair Throughput for Co-Existing Networks under Adversarial Interference.” Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC), 2012, pp. 291–300, doi:10.1145/2332432.2332488."},"type":"conference","year":"2012"},{"citation":{"mla":"Jakobs, Marie-Christine. Change and Validity Analysis in Deductive Program Verification. Universität Paderborn, 2012.","bibtex":"@book{Jakobs_2012, title={Change and Validity Analysis in Deductive Program Verification}, publisher={Universität Paderborn}, author={Jakobs, Marie-Christine}, year={2012} }","chicago":"Jakobs, Marie-Christine. Change and Validity Analysis in Deductive Program Verification. Universität Paderborn, 2012.","ama":"Jakobs M-C. Change and Validity Analysis in Deductive Program Verification. Universität Paderborn; 2012.","apa":"Jakobs, M.-C. (2012). Change and Validity Analysis in Deductive Program Verification. Universität Paderborn.","ieee":"M.-C. Jakobs, Change and Validity Analysis in Deductive Program Verification. Universität Paderborn, 2012.","short":"M.-C. Jakobs, Change and Validity Analysis in Deductive Program Verification, Universität Paderborn, 2012."},"type":"mastersthesis","year":"2012","date_updated":"2022-01-06T07:02:58Z","_id":"624","publisher":"Universität Paderborn","author":[{"first_name":"Marie-Christine","full_name":"Jakobs, Marie-Christine","last_name":"Jakobs"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"12","name":"SFB 901 - Subprojekt B4"},{"name":"SFB 901 - Project Area B","_id":"3"}],"date_created":"2017-10-17T12:42:53Z","status":"public","user_id":"15504","title":"Change and Validity Analysis in Deductive Program Verification"},{"series_title":"LNCS","date_updated":"2022-01-06T07:02:58Z","doi":"10.1007/978-3-642-33651-5_47","department":[{"_id":"79"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"title":"Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures","page":"439-440","citation":{"apa":"Schmid, S., Avin, C., Scheideler, C., Häupler, B., & Lotker, Z. (2012). Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures. In Proceedings of the 26th International Symposium on Distributed Computing (DISC) (pp. 439–440). https://doi.org/10.1007/978-3-642-33651-5_47","ama":"Schmid S, Avin C, Scheideler C, Häupler B, Lotker Z. Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures. In: Proceedings of the 26th International Symposium on Distributed Computing (DISC). LNCS. ; 2012:439-440. doi:10.1007/978-3-642-33651-5_47","chicago":"Schmid, Stefan, Chen Avin, Christian Scheideler, Bernhard Häupler, and Zvi Lotker. “Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures.” In Proceedings of the 26th International Symposium on Distributed Computing (DISC), 439–40. LNCS, 2012. https://doi.org/10.1007/978-3-642-33651-5_47.","mla":"Schmid, Stefan, et al. “Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures.” Proceedings of the 26th International Symposium on Distributed Computing (DISC), 2012, pp. 439–40, doi:10.1007/978-3-642-33651-5_47.","bibtex":"@inproceedings{Schmid_Avin_Scheideler_Häupler_Lotker_2012, series={LNCS}, title={Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures}, DOI={10.1007/978-3-642-33651-5_47}, booktitle={Proceedings of the 26th International Symposium on Distributed Computing (DISC)}, author={Schmid, Stefan and Avin, Chen and Scheideler, Christian and Häupler, Bernhard and Lotker, Zvi}, year={2012}, pages={439–440}, collection={LNCS} }","short":"S. Schmid, C. Avin, C. Scheideler, B. Häupler, Z. Lotker, in: Proceedings of the 26th International Symposium on Distributed Computing (DISC), 2012, pp. 439–440.","ieee":"S. Schmid, C. Avin, C. Scheideler, B. Häupler, and Z. Lotker, “Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures,” in Proceedings of the 26th International Symposium on Distributed Computing (DISC), 2012, pp. 439–440."},"year":"2012","type":"conference","_id":"625","file":[{"access_level":"closed","file_name":"625-disc12adjBAshort.pdf","date_created":"2018-03-15T06:44:09Z","success":1,"relation":"main_file","content_type":"application/pdf","date_updated":"2018-03-15T06:44:09Z","file_id":"1240","creator":"florida","file_size":717284}],"file_date_updated":"2018-03-15T06:44:09Z","publication":"Proceedings of the 26th International Symposium on Distributed Computing (DISC)","author":[{"last_name":"Schmid","full_name":"Schmid, Stefan","first_name":"Stefan"},{"last_name":"Avin","full_name":"Avin, Chen","first_name":"Chen"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"},{"full_name":"Häupler, Bernhard","first_name":"Bernhard","last_name":"Häupler"},{"full_name":"Lotker, Zvi","first_name":"Zvi","last_name":"Lotker"}],"date_created":"2017-10-17T12:42:53Z","status":"public","has_accepted_license":"1","abstract":[{"text":"This paper initiates the study of self-adjusting distributed data structures for networks. In particular, we present SplayNets: a binary search tree based network that is self-adjusting to routing request.We derive entropy bounds on the amortized routing cost and show that our splaying algorithm has some interesting properties.","lang":"eng"}],"user_id":"15504","ddc":["040"]},{"title":"Multi-Modal, Multi-Touch Interaction with Maps in Disaster Management Applications","user_id":"30457","department":[{"_id":"66"},{"_id":"534"},{"_id":"221"}],"publication":"ISPRS - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences","publisher":"Copernicus GmbH","author":[{"first_name":"Volker","full_name":"Paelke, Volker","last_name":"Paelke"},{"last_name":"Nebe","first_name":"Karsten","full_name":"Nebe, Karsten"},{"last_name":"Geiger","full_name":"Geiger, Christian","first_name":"Christian"},{"last_name":"Klompmaker","full_name":"Klompmaker, Florian","first_name":"Florian"},{"last_name":"Fischer","id":"30457","first_name":"Holger Gerhard","full_name":"Fischer, Holger Gerhard"}],"publication_status":"published","publication_identifier":{"issn":["1682-1777"]},"volume":"XXXIX-B8","date_created":"2018-12-18T10:18:13Z","status":"public","_id":"6250","date_updated":"2022-01-06T07:02:58Z","doi":"10.5194/isprsarchives-xxxix-b8-55-2012","page":"55-60","citation":{"bibtex":"@article{Paelke_Nebe_Geiger_Klompmaker_Fischer_2012, title={Multi-Modal, Multi-Touch Interaction with Maps in Disaster Management Applications}, volume={XXXIX-B8}, DOI={10.5194/isprsarchives-xxxix-b8-55-2012}, journal={ISPRS - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences}, publisher={Copernicus GmbH}, author={Paelke, Volker and Nebe, Karsten and Geiger, Christian and Klompmaker, Florian and Fischer, Holger Gerhard}, year={2012}, pages={55–60} }","mla":"Paelke, Volker, et al. “Multi-Modal, Multi-Touch Interaction with Maps in Disaster Management Applications.” ISPRS - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences, vol. XXXIX-B8, Copernicus GmbH, 2012, pp. 55–60, doi:10.5194/isprsarchives-xxxix-b8-55-2012.","chicago":"Paelke, Volker, Karsten Nebe, Christian Geiger, Florian Klompmaker, and Holger Gerhard Fischer. “Multi-Modal, Multi-Touch Interaction with Maps in Disaster Management Applications.” ISPRS - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences XXXIX-B8 (2012): 55–60. https://doi.org/10.5194/isprsarchives-xxxix-b8-55-2012.","apa":"Paelke, V., Nebe, K., Geiger, C., Klompmaker, F., & Fischer, H. G. (2012). Multi-Modal, Multi-Touch Interaction with Maps in Disaster Management Applications. ISPRS - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences, XXXIX-B8, 55–60. https://doi.org/10.5194/isprsarchives-xxxix-b8-55-2012","ama":"Paelke V, Nebe K, Geiger C, Klompmaker F, Fischer HG. Multi-Modal, Multi-Touch Interaction with Maps in Disaster Management Applications. ISPRS - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences. 2012;XXXIX-B8:55-60. doi:10.5194/isprsarchives-xxxix-b8-55-2012","ieee":"V. Paelke, K. Nebe, C. Geiger, F. Klompmaker, and H. G. Fischer, “Multi-Modal, Multi-Touch Interaction with Maps in Disaster Management Applications,” ISPRS - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences, vol. XXXIX-B8, pp. 55–60, 2012.","short":"V. Paelke, K. Nebe, C. Geiger, F. Klompmaker, H.G. Fischer, ISPRS - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences XXXIX-B8 (2012) 55–60."},"type":"journal_article","year":"2012","language":[{"iso":"eng"}]},{"department":[{"_id":"79"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"title":"Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems","series_title":"LNCS","date_updated":"2022-01-06T07:02:59Z","doi":"10.1007/978-3-642-33651-5_45","file":[{"file_id":"1239","creator":"florida","file_size":184095,"relation":"main_file","success":1,"content_type":"application/pdf","date_updated":"2018-03-15T06:42:40Z","file_name":"626-Predecessor-Kniesburges_Scheideler.pdf","date_created":"2018-03-15T06:42:40Z","access_level":"closed"}],"publication":"Proceedings of the 26th International Symposium on Distributed Computing (DISC)","file_date_updated":"2018-03-15T06:42:40Z","author":[{"full_name":"Kniesburges, Sebastian","first_name":"Sebastian","last_name":"Kniesburges"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"date_created":"2017-10-17T12:42:54Z","has_accepted_license":"1","status":"public","abstract":[{"lang":"eng","text":"The design of ecient search structures for peer-to-peer systems has attracted a lot of attention in recent years. In this announcement we address the problem of nding the predecessor in a key set and present an ecient data structure called hashed Predecessor Patricia trie. Our hashed Predecessor Patricia trie supports PredecessorSearch(x) and Insert(x) and Delete(x) in O(log log u) hash table accesses when u is the size of the universe of the keys. That is the costs only depend on u and not the size of the data structure. One feature of our approach is that it only uses the lookup interface of the hash table and therefore hash table accesses may be realized by any distributed hash table (DHT)."}],"user_id":"15504","ddc":["040"],"page":"435-436","type":"conference","citation":{"mla":"Kniesburges, Sebastian, and Christian Scheideler. “Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems.” Proceedings of the 26th International Symposium on Distributed Computing (DISC), 2012, pp. 435–36, doi:10.1007/978-3-642-33651-5_45.","bibtex":"@inproceedings{Kniesburges_Scheideler_2012, series={LNCS}, title={Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems}, DOI={10.1007/978-3-642-33651-5_45}, booktitle={Proceedings of the 26th International Symposium on Distributed Computing (DISC)}, author={Kniesburges, Sebastian and Scheideler, Christian}, year={2012}, pages={435–436}, collection={LNCS} }","chicago":"Kniesburges, Sebastian, and Christian Scheideler. “Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems.” In Proceedings of the 26th International Symposium on Distributed Computing (DISC), 435–36. LNCS, 2012. https://doi.org/10.1007/978-3-642-33651-5_45.","ama":"Kniesburges S, Scheideler C. Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems. In: Proceedings of the 26th International Symposium on Distributed Computing (DISC). LNCS. ; 2012:435-436. doi:10.1007/978-3-642-33651-5_45","apa":"Kniesburges, S., & Scheideler, C. (2012). Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems. In Proceedings of the 26th International Symposium on Distributed Computing (DISC) (pp. 435–436). https://doi.org/10.1007/978-3-642-33651-5_45","ieee":"S. Kniesburges and C. Scheideler, “Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems,” in Proceedings of the 26th International Symposium on Distributed Computing (DISC), 2012, pp. 435–436.","short":"S. Kniesburges, C. Scheideler, in: Proceedings of the 26th International Symposium on Distributed Computing (DISC), 2012, pp. 435–436."},"year":"2012","_id":"626"},{"title":"Block Abstraction Memoization for CPAchecker","department":[{"_id":"77"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt B4","_id":"12"},{"_id":"3","name":"SFB 901 - Project Area B"}],"date_updated":"2022-01-06T07:02:59Z","doi":"10.1007/978-3-642-28756-5_41","series_title":"LNCS","language":[{"iso":"eng"}],"abstract":[{"text":"Block Abstraction Memoization (ABM) is a technique in software model checking that exploits the modularity of programs during verification by caching. To this end, ABM records the results of block analyses and reuses them if possible when revisiting the same block again. In this paper we present an implementation of ABM into the predicate-analysis component of the software-verification framework CPAchecker. With our participation at the Competition on Software Verification we aim at providing evidence that ABM can not only substantially increase the efficiency of predicate analysis but also enables verification of a wider range of programs.","lang":"eng"}],"user_id":"477","ddc":["040"],"file":[{"date_created":"2018-03-15T06:46:05Z","file_name":"627-WonischSV-Comp2012_01.pdf","access_level":"closed","file_size":184000,"file_id":"1242","creator":"florida","date_updated":"2018-03-15T06:46:05Z","content_type":"application/pdf","relation":"main_file","success":1}],"author":[{"full_name":"Wonisch, Daniel","first_name":"Daniel","last_name":"Wonisch"}],"file_date_updated":"2018-03-15T06:46:05Z","publication":"Proceedings of the 18th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS)","has_accepted_license":"1","status":"public","date_created":"2017-10-17T12:42:54Z","_id":"627","year":"2012","citation":{"mla":"Wonisch, Daniel. “Block Abstraction Memoization for CPAchecker.” Proceedings of the 18th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), 2012, pp. 531–33, doi:10.1007/978-3-642-28756-5_41.","bibtex":"@inproceedings{Wonisch_2012, series={LNCS}, title={Block Abstraction Memoization for CPAchecker}, DOI={10.1007/978-3-642-28756-5_41}, booktitle={Proceedings of the 18th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS)}, author={Wonisch, Daniel}, year={2012}, pages={531–533}, collection={LNCS} }","chicago":"Wonisch, Daniel. “Block Abstraction Memoization for CPAchecker.” In Proceedings of the 18th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), 531–33. LNCS, 2012. https://doi.org/10.1007/978-3-642-28756-5_41.","ama":"Wonisch D. Block Abstraction Memoization for CPAchecker. In: Proceedings of the 18th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS). LNCS. ; 2012:531-533. doi:10.1007/978-3-642-28756-5_41","apa":"Wonisch, D. (2012). Block Abstraction Memoization for CPAchecker. In Proceedings of the 18th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS) (pp. 531–533). https://doi.org/10.1007/978-3-642-28756-5_41","ieee":"D. Wonisch, “Block Abstraction Memoization for CPAchecker,” in Proceedings of the 18th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), 2012, pp. 531–533.","short":"D. Wonisch, in: Proceedings of the 18th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), 2012, pp. 531–533."},"type":"conference","page":"531-533"},{"date_updated":"2022-01-06T07:02:59Z","_id":"6275","citation":{"ieee":"M. Schneid, H. Steinmetz, R. Isidor, and R. Kabst, “Diversität, Konflikte und Leistung in Teams: Ein meta-analytisches Strukturgleichungsmodell,” 2012.","short":"M. Schneid, H. Steinmetz, R. Isidor, R. Kabst, in: 2012.","mla":"Schneid, M., et al. Diversität, Konflikte Und Leistung in Teams: Ein Meta-Analytisches Strukturgleichungsmodell. 2012.","bibtex":"@inproceedings{Schneid_Steinmetz_Isidor_Kabst_2012, title={Diversität, Konflikte und Leistung in Teams: Ein meta-analytisches Strukturgleichungsmodell}, author={Schneid, M and Steinmetz, Holger and Isidor, R and Kabst, Rüdiger}, year={2012} }","chicago":"Schneid, M, Holger Steinmetz, R Isidor, and Rüdiger Kabst. “Diversität, Konflikte Und Leistung in Teams: Ein Meta-Analytisches Strukturgleichungsmodell,” 2012.","apa":"Schneid, M., Steinmetz, H., Isidor, R., & Kabst, R. (2012). Diversität, Konflikte und Leistung in Teams: Ein meta-analytisches Strukturgleichungsmodell.","ama":"Schneid M, Steinmetz H, Isidor R, Kabst R. Diversität, Konflikte und Leistung in Teams: Ein meta-analytisches Strukturgleichungsmodell. In: ; 2012."},"type":"conference","year":"2012","language":[{"iso":"eng"}],"title":"Diversität, Konflikte und Leistung in Teams: Ein meta-analytisches Strukturgleichungsmodell","user_id":"46632","status":"public","date_created":"2018-12-18T12:42:54Z","author":[{"last_name":"Schneid","full_name":"Schneid, M","first_name":"M"},{"last_name":"Steinmetz","id":"43261","first_name":"Holger","full_name":"Steinmetz, Holger"},{"first_name":"R","full_name":"Isidor, R","last_name":"Isidor"},{"last_name":"Kabst","id":"42362","first_name":"Rüdiger","full_name":"Kabst, Rüdiger"}],"department":[{"_id":"274"}]},{"title":"Endogeneity in the behavioral sciences: An illustration with real data","user_id":"46632","place":"Amsterdam","date_created":"2018-12-18T12:43:58Z","status":"public","department":[{"_id":"274"}],"author":[{"full_name":"Kabst, Rüdiger","first_name":"Rüdiger","id":"42362","last_name":"Kabst"}],"_id":"6277","date_updated":"2022-01-06T07:02:59Z","year":"2012","type":"conference","citation":{"short":"R. Kabst, in: Amsterdam, 2012.","ieee":"R. Kabst, “Endogeneity in the behavioral sciences: An illustration with real data,” 2012.","ama":"Kabst R. Endogeneity in the behavioral sciences: An illustration with real data. In: Amsterdam; 2012.","apa":"Kabst, R. (2012). Endogeneity in the behavioral sciences: An illustration with real data. Amsterdam.","chicago":"Kabst, Rüdiger. “Endogeneity in the Behavioral Sciences: An Illustration with Real Data.” Amsterdam, 2012.","mla":"Kabst, Rüdiger. Endogeneity in the Behavioral Sciences: An Illustration with Real Data. 2012.","bibtex":"@inproceedings{Kabst_2012, place={Amsterdam}, title={Endogeneity in the behavioral sciences: An illustration with real data}, author={Kabst, Rüdiger}, year={2012} }"},"language":[{"iso":"eng"}]},{"page":"72--83","type":"conference","year":"2012","citation":{"short":"A. Cord-Landwehr, M. Huellmann (married name: Eikel), P. Kling, A. Setzer, in: Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT), 2012, pp. 72--83.","ieee":"A. Cord-Landwehr, M. Huellmann (married name: Eikel), P. Kling, and A. Setzer, “Basic Network Creation Games with Communication Interests,” in Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT), 2012, pp. 72--83.","chicago":"Cord-Landwehr, Andreas, Martina Huellmann (married name: Eikel), Peter Kling, and Alexander Setzer. “Basic Network Creation Games with Communication Interests.” In Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT), 72--83. LNCS, 2012. https://doi.org/10.1007/978-3-642-33996-7_7.","ama":"Cord-Landwehr A, Huellmann (married name: Eikel) M, Kling P, Setzer A. Basic Network Creation Games with Communication Interests. In: Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT). LNCS. ; 2012:72--83. doi:10.1007/978-3-642-33996-7_7","apa":"Cord-Landwehr, A., Huellmann (married name: Eikel), M., Kling, P., & Setzer, A. (2012). Basic Network Creation Games with Communication Interests. In Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT) (pp. 72--83). https://doi.org/10.1007/978-3-642-33996-7_7","mla":"Cord-Landwehr, Andreas, et al. “Basic Network Creation Games with Communication Interests.” Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT), 2012, pp. 72--83, doi:10.1007/978-3-642-33996-7_7.","bibtex":"@inproceedings{Cord-Landwehr_Huellmann (married name: Eikel)_Kling_Setzer_2012, series={LNCS}, title={Basic Network Creation Games with Communication Interests}, DOI={10.1007/978-3-642-33996-7_7}, booktitle={Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT)}, author={Cord-Landwehr, Andreas and Huellmann (married name: Eikel), Martina and Kling, Peter and Setzer, Alexander}, year={2012}, pages={72--83}, collection={LNCS} }"},"_id":"628","date_created":"2017-10-17T12:42:54Z","status":"public","has_accepted_license":"1","file":[{"access_level":"closed","file_name":"628-FULL_paper_bncs_with_interests.pdf","date_created":"2018-03-15T06:42:01Z","content_type":"application/pdf","date_updated":"2018-03-15T06:42:01Z","relation":"main_file","success":1,"file_size":300591,"file_id":"1238","creator":"florida"}],"file_date_updated":"2018-03-15T06:42:01Z","publication":"Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT)","author":[{"last_name":"Cord-Landwehr","full_name":"Cord-Landwehr, Andreas","first_name":"Andreas"},{"last_name":"Huellmann (married name: Eikel)","first_name":"Martina","full_name":"Huellmann (married name: Eikel), Martina"},{"last_name":"Kling","full_name":"Kling, Peter","first_name":"Peter"},{"last_name":"Setzer","id":"11108","first_name":"Alexander","full_name":"Setzer, Alexander"}],"user_id":"477","ddc":["040"],"abstract":[{"lang":"eng","text":"Network creation games model the creation and usage costs of networks formed by a set of selfish peers.Each peer has the ability to change the network in a limited way, e.g., by creating or deleting incident links.In doing so, a peer can reduce its individual communication cost.Typically, these costs are modeled by the maximum or average distance in the network.We introduce a generalized version of the basic network creation game (BNCG).In the BNCG (by Alon et al., SPAA 2010), each peer may replace one of its incident links by a link to an arbitrary peer.This is done in a selfish way in order to minimize either the maximum or average distance to all other peers.That is, each peer works towards a network structure that allows himself to communicate efficiently with all other peers.However, participants of large networks are seldom interested in all peers.Rather, they want to communicate efficiently with a small subset only.Our model incorporates these (communication) interests explicitly.Given peers with interests and a communication network forming a tree, we prove several results on the structure and quality of equilibria in our model.We focus on the MAX-version, i.e., each node tries to minimize the maximum distance to nodes it is interested in, and give an upper bound of O(\\sqrt(n)) for the private costs in an equilibrium of n peers.Moreover, we give an equilibrium for a circular interest graph where a node has private cost Omega(\\sqrt(n)), showing that our bound is tight.This example can be extended such that we get a tight bound of Theta(\\sqrt(n)) for the price of anarchy.For the case of general networks we show the price of anarchy to be Theta(n).Additionally, we prove an interesting connection between a maximum independent set in the interest graph and the private costs of the peers."}],"language":[{"iso":"eng"}],"series_title":"LNCS","doi":"10.1007/978-3-642-33996-7_7","date_updated":"2022-01-06T07:02:59Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"department":[{"_id":"79"},{"_id":"63"}],"title":"Basic Network Creation Games with Communication Interests"},{"date_updated":"2022-01-06T07:02:59Z","_id":"6281","citation":{"apa":"Wehner, M. C., Giardini, A., & Kabst, R. (2012). Recruitment Process Outsourcing and Applicant Reactions: Does Image Make a Difference? University of Limerick, Ireland.","ama":"Wehner MC, Giardini A, Kabst R. Recruitment Process Outsourcing and Applicant Reactions: Does Image Make a Difference? In: University of Limerick, Ireland; 2012.","chicago":"Wehner, M C, A Giardini, and Rüdiger Kabst. “Recruitment Process Outsourcing and Applicant Reactions: Does Image Make a Difference?” University of Limerick, Ireland, 2012.","bibtex":"@inproceedings{Wehner_Giardini_Kabst_2012, place={University of Limerick, Ireland}, title={Recruitment Process Outsourcing and Applicant Reactions: Does Image Make a Difference?}, author={Wehner, M C and Giardini, A and Kabst, Rüdiger}, year={2012} }","mla":"Wehner, M. C., et al. Recruitment Process Outsourcing and Applicant Reactions: Does Image Make a Difference? 2012.","short":"M.C. Wehner, A. Giardini, R. Kabst, in: University of Limerick, Ireland, 2012.","ieee":"M. C. Wehner, A. Giardini, and R. Kabst, “Recruitment Process Outsourcing and Applicant Reactions: Does Image Make a Difference?,” 2012."},"year":"2012","type":"conference","language":[{"iso":"eng"}],"title":"Recruitment Process Outsourcing and Applicant Reactions: Does Image Make a Difference?","user_id":"46632","place":"University of Limerick, Ireland","date_created":"2018-12-18T12:47:28Z","status":"public","department":[{"_id":"274"}],"author":[{"last_name":"Wehner","full_name":"Wehner, M C","first_name":"M C"},{"first_name":"A","full_name":"Giardini, A","last_name":"Giardini"},{"last_name":"Kabst","id":"42362","first_name":"Rüdiger","full_name":"Kabst, Rüdiger"}]},{"title":"Designing Multi-Modal Map-Based Interfaces for Disaster Management","user_id":"30457","date_created":"2018-12-18T12:49:38Z","status":"public","department":[{"_id":"66"},{"_id":"534"},{"_id":"221"}],"publication":"Proceedings of the 5th International Conference on Advances in Computer-Human Interaction (ACHI)","publisher":"IARIA","author":[{"full_name":"Paelke, Volker","first_name":"Volker","last_name":"Paelke"},{"last_name":"Nebe","first_name":"Karsten","full_name":"Nebe, Karsten"},{"last_name":"Geiger","first_name":"Christian","full_name":"Geiger, Christian"},{"last_name":"Klompmaker","first_name":"Florian","full_name":"Klompmaker, Florian"},{"last_name":"Fischer","id":"30457","first_name":"Holger Gerhard","full_name":"Fischer, Holger Gerhard"}],"date_updated":"2022-01-06T07:02:59Z","_id":"6285","page":"95-100","type":"conference","year":"2012","citation":{"ieee":"V. Paelke, K. Nebe, C. Geiger, F. Klompmaker, and H. G. Fischer, “Designing Multi-Modal Map-Based Interfaces for Disaster Management,” in Proceedings of the 5th International Conference on Advances in Computer-Human Interaction (ACHI), 2012, pp. 95–100.","short":"V. Paelke, K. Nebe, C. Geiger, F. Klompmaker, H.G. Fischer, in: Proceedings of the 5th International Conference on Advances in Computer-Human Interaction (ACHI), IARIA, 2012, pp. 95–100.","bibtex":"@inproceedings{Paelke_Nebe_Geiger_Klompmaker_Fischer_2012, title={Designing Multi-Modal Map-Based Interfaces for Disaster Management}, booktitle={Proceedings of the 5th International Conference on Advances in Computer-Human Interaction (ACHI)}, publisher={IARIA}, author={Paelke, Volker and Nebe, Karsten and Geiger, Christian and Klompmaker, Florian and Fischer, Holger Gerhard}, year={2012}, pages={95–100} }","mla":"Paelke, Volker, et al. “Designing Multi-Modal Map-Based Interfaces for Disaster Management.” Proceedings of the 5th International Conference on Advances in Computer-Human Interaction (ACHI), IARIA, 2012, pp. 95–100.","chicago":"Paelke, Volker, Karsten Nebe, Christian Geiger, Florian Klompmaker, and Holger Gerhard Fischer. “Designing Multi-Modal Map-Based Interfaces for Disaster Management.” In Proceedings of the 5th International Conference on Advances in Computer-Human Interaction (ACHI), 95–100. IARIA, 2012.","ama":"Paelke V, Nebe K, Geiger C, Klompmaker F, Fischer HG. Designing Multi-Modal Map-Based Interfaces for Disaster Management. In: Proceedings of the 5th International Conference on Advances in Computer-Human Interaction (ACHI). IARIA; 2012:95-100.","apa":"Paelke, V., Nebe, K., Geiger, C., Klompmaker, F., & Fischer, H. G. (2012). Designing Multi-Modal Map-Based Interfaces for Disaster Management. In Proceedings of the 5th International Conference on Advances in Computer-Human Interaction (ACHI) (pp. 95–100). IARIA."},"language":[{"iso":"eng"}]},{"language":[{"iso":"eng"}],"page":"141-144","type":"conference","year":"2012","citation":{"mla":"Klompmaker, Florian, et al. “Authenticated Tangible Interaction Using RFID and Depth-Sensing Cameras - Supporting Collaboration on Interactive Tabletops.” Proceedings of the 5th International Conference on Advances in Computer-Human Interaction (ACHI), IARIA, 2012, pp. 141–44.","bibtex":"@inproceedings{Klompmaker_Fischer_Jung_2012, title={Authenticated Tangible Interaction using RFID and Depth-Sensing Cameras - Supporting Collaboration on Interactive Tabletops}, booktitle={Proceedings of the 5th International Conference on Advances in Computer-Human Interaction (ACHI)}, publisher={IARIA}, author={Klompmaker, Florian and Fischer, Holger Gerhard and Jung, Helge}, year={2012}, pages={141–144} }","chicago":"Klompmaker, Florian, Holger Gerhard Fischer, and Helge Jung. “Authenticated Tangible Interaction Using RFID and Depth-Sensing Cameras - Supporting Collaboration on Interactive Tabletops.” In Proceedings of the 5th International Conference on Advances in Computer-Human Interaction (ACHI), 141–44. IARIA, 2012.","apa":"Klompmaker, F., Fischer, H. G., & Jung, H. (2012). Authenticated Tangible Interaction using RFID and Depth-Sensing Cameras - Supporting Collaboration on Interactive Tabletops. In Proceedings of the 5th International Conference on Advances in Computer-Human Interaction (ACHI) (pp. 141–144). IARIA.","ama":"Klompmaker F, Fischer HG, Jung H. Authenticated Tangible Interaction using RFID and Depth-Sensing Cameras - Supporting Collaboration on Interactive Tabletops. In: Proceedings of the 5th International Conference on Advances in Computer-Human Interaction (ACHI). IARIA; 2012:141-144.","ieee":"F. Klompmaker, H. G. Fischer, and H. Jung, “Authenticated Tangible Interaction using RFID and Depth-Sensing Cameras - Supporting Collaboration on Interactive Tabletops,” in Proceedings of the 5th International Conference on Advances in Computer-Human Interaction (ACHI), 2012, pp. 141–144.","short":"F. Klompmaker, H.G. Fischer, H. Jung, in: Proceedings of the 5th International Conference on Advances in Computer-Human Interaction (ACHI), IARIA, 2012, pp. 141–144."},"date_updated":"2022-01-06T07:02:59Z","_id":"6286","date_created":"2018-12-18T12:50:15Z","status":"public","publication":"Proceedings of the 5th International Conference on Advances in Computer-Human Interaction (ACHI)","department":[{"_id":"66"},{"_id":"534"},{"_id":"221"}],"author":[{"first_name":"Florian","full_name":"Klompmaker, Florian","last_name":"Klompmaker"},{"id":"30457","last_name":"Fischer","full_name":"Fischer, Holger Gerhard","first_name":"Holger Gerhard"},{"first_name":"Helge","full_name":"Jung, Helge","last_name":"Jung"}],"publisher":"IARIA","user_id":"30457","title":"Authenticated Tangible Interaction using RFID and Depth-Sensing Cameras - Supporting Collaboration on Interactive Tabletops"},{"title":"Integrating usability engineering in the software development lifecycle based on international standards","user_id":"30457","author":[{"full_name":"Fischer, Holger Gerhard","first_name":"Holger Gerhard","id":"30457","last_name":"Fischer"}],"publisher":"ACM Press","publication":"Proceedings of the 4th ACM SIGCHI symposium on Engineering interactive computing systems - EICS '12","department":[{"_id":"66"},{"_id":"534"},{"_id":"221"}],"publication_status":"published","publication_identifier":{"isbn":["9781450311687"]},"status":"public","date_created":"2018-12-18T12:52:11Z","date_updated":"2022-01-06T07:03:00Z","_id":"6288","doi":"10.1145/2305484.2305541","citation":{"short":"H.G. Fischer, in: Proceedings of the 4th ACM SIGCHI Symposium on Engineering Interactive Computing Systems - EICS ’12, ACM Press, 2012.","ieee":"H. G. Fischer, “Integrating usability engineering in the software development lifecycle based on international standards,” in Proceedings of the 4th ACM SIGCHI symposium on Engineering interactive computing systems - EICS ’12, 2012.","chicago":"Fischer, Holger Gerhard. “Integrating Usability Engineering in the Software Development Lifecycle Based on International Standards.” In Proceedings of the 4th ACM SIGCHI Symposium on Engineering Interactive Computing Systems - EICS ’12. ACM Press, 2012. https://doi.org/10.1145/2305484.2305541.","ama":"Fischer HG. Integrating usability engineering in the software development lifecycle based on international standards. In: Proceedings of the 4th ACM SIGCHI Symposium on Engineering Interactive Computing Systems - EICS ’12. ACM Press; 2012. doi:10.1145/2305484.2305541","apa":"Fischer, H. G. (2012). Integrating usability engineering in the software development lifecycle based on international standards. In Proceedings of the 4th ACM SIGCHI symposium on Engineering interactive computing systems - EICS ’12. ACM Press. https://doi.org/10.1145/2305484.2305541","mla":"Fischer, Holger Gerhard. “Integrating Usability Engineering in the Software Development Lifecycle Based on International Standards.” Proceedings of the 4th ACM SIGCHI Symposium on Engineering Interactive Computing Systems - EICS ’12, ACM Press, 2012, doi:10.1145/2305484.2305541.","bibtex":"@inproceedings{Fischer_2012, title={Integrating usability engineering in the software development lifecycle based on international standards}, DOI={10.1145/2305484.2305541}, booktitle={Proceedings of the 4th ACM SIGCHI symposium on Engineering interactive computing systems - EICS ’12}, publisher={ACM Press}, author={Fischer, Holger Gerhard}, year={2012} }"},"year":"2012","type":"conference","language":[{"iso":"eng"}]},{"date_updated":"2022-01-06T07:03:00Z","_id":"629","year":"2012","type":"bachelorsthesis","citation":{"ieee":"P. Schleiter, Attribute-basierte Verschlüsselung. Universität Paderborn, 2012.","short":"P. Schleiter, Attribute-basierte Verschlüsselung, Universität Paderborn, 2012.","mla":"Schleiter, Patrick. Attribute-basierte Verschlüsselung. Universität Paderborn, 2012.","bibtex":"@book{Schleiter_2012, title={Attribute-basierte Verschlüsselung}, publisher={Universität Paderborn}, author={Schleiter, Patrick}, year={2012} }","apa":"Schleiter, P. (2012). Attribute-basierte Verschlüsselung. Universität Paderborn.","ama":"Schleiter P. Attribute-basierte Verschlüsselung. Universität Paderborn; 2012.","chicago":"Schleiter, Patrick. Attribute-basierte Verschlüsselung. Universität Paderborn, 2012."},"language":[{"iso":"ger"}],"supervisor":[{"last_name":"Blömer","id":"23","first_name":"Johannes","full_name":"Blömer, Johannes"}],"title":"Attribute-basierte Verschlüsselung","user_id":"477","status":"public","project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"Securing the Financial Cloud","_id":"43"}],"date_created":"2017-10-17T12:42:54Z","publisher":"Universität Paderborn","author":[{"full_name":"Schleiter, Patrick","first_name":"Patrick","last_name":"Schleiter"}],"department":[{"_id":"64"}]},{"_id":"6290","date_updated":"2022-01-06T07:03:00Z","language":[{"iso":"eng"}],"year":"2012","type":"conference","citation":{"mla":"Fischer, Holger Gerhard, and Florian Klompmaker. “Enriching Disaster Control Management Based on Human-Computer Design.” Proceedings of the 9th International Conference on Information Systems for Crisis Response and Management (ISCRAM), ISCRAM Digital Library, 2012.","bibtex":"@inproceedings{Fischer_Klompmaker_2012, title={Enriching Disaster Control Management based on Human-Computer Design}, booktitle={Proceedings of the 9th International Conference on Information Systems for Crisis Response and Management (ISCRAM)}, publisher={ISCRAM Digital Library}, author={Fischer, Holger Gerhard and Klompmaker, Florian}, year={2012} }","ama":"Fischer HG, Klompmaker F. Enriching Disaster Control Management based on Human-Computer Design. In: Proceedings of the 9th International Conference on Information Systems for Crisis Response and Management (ISCRAM). ISCRAM Digital Library; 2012.","apa":"Fischer, H. G., & Klompmaker, F. (2012). Enriching Disaster Control Management based on Human-Computer Design. In Proceedings of the 9th International Conference on Information Systems for Crisis Response and Management (ISCRAM). ISCRAM Digital Library.","chicago":"Fischer, Holger Gerhard, and Florian Klompmaker. “Enriching Disaster Control Management Based on Human-Computer Design.” In Proceedings of the 9th International Conference on Information Systems for Crisis Response and Management (ISCRAM). ISCRAM Digital Library, 2012.","ieee":"H. G. Fischer and F. Klompmaker, “Enriching Disaster Control Management based on Human-Computer Design,” in Proceedings of the 9th International Conference on Information Systems for Crisis Response and Management (ISCRAM), 2012.","short":"H.G. Fischer, F. Klompmaker, in: Proceedings of the 9th International Conference on Information Systems for Crisis Response and Management (ISCRAM), ISCRAM Digital Library, 2012."},"user_id":"30457","title":"Enriching Disaster Control Management based on Human-Computer Design","department":[{"_id":"66"},{"_id":"534"},{"_id":"221"}],"publication":"Proceedings of the 9th International Conference on Information Systems for Crisis Response and Management (ISCRAM)","publisher":"ISCRAM Digital Library","author":[{"id":"30457","last_name":"Fischer","full_name":"Fischer, Holger Gerhard","first_name":"Holger Gerhard"},{"first_name":"Florian","full_name":"Klompmaker, Florian","last_name":"Klompmaker"}],"date_created":"2018-12-18T12:52:45Z","status":"public"},{"title":"Der Qualitätsstandard für Usability Engineering der German UPA – Aktueller Stand der Arbeiten","user_id":"30457","department":[{"_id":"66"},{"_id":"534"},{"_id":"221"}],"publication":"Jahresband Usability Professionals","author":[{"id":"30457","last_name":"Fischer","full_name":"Fischer, Holger Gerhard","first_name":"Holger Gerhard"},{"first_name":"Thomas","full_name":"Geis, Thomas","last_name":"Geis"},{"full_name":"Kluge, Oliver","first_name":"Oliver","last_name":"Kluge"},{"last_name":"Bogner","first_name":"Christian","full_name":"Bogner, Christian"},{"last_name":"Polkehn","full_name":"Polkehn, Knut","first_name":"Knut"}],"publisher":"German UPA","date_created":"2018-12-18T12:53:45Z","status":"public","date_updated":"2022-01-06T07:03:00Z","_id":"6291","page":"160-165","citation":{"ieee":"H. G. Fischer, T. Geis, O. Kluge, C. Bogner, and K. Polkehn, “Der Qualitätsstandard für Usability Engineering der German UPA – Aktueller Stand der Arbeiten,” in Jahresband Usability Professionals, 2012, pp. 160–165.","short":"H.G. Fischer, T. Geis, O. Kluge, C. Bogner, K. Polkehn, in: Jahresband Usability Professionals, German UPA, 2012, pp. 160–165.","bibtex":"@inproceedings{Fischer_Geis_Kluge_Bogner_Polkehn_2012, title={Der Qualitätsstandard für Usability Engineering der German UPA – Aktueller Stand der Arbeiten}, booktitle={Jahresband Usability Professionals}, publisher={German UPA}, author={Fischer, Holger Gerhard and Geis, Thomas and Kluge, Oliver and Bogner, Christian and Polkehn, Knut}, year={2012}, pages={160–165} }","mla":"Fischer, Holger Gerhard, et al. “Der Qualitätsstandard Für Usability Engineering Der German UPA – Aktueller Stand Der Arbeiten.” Jahresband Usability Professionals, German UPA, 2012, pp. 160–65.","ama":"Fischer HG, Geis T, Kluge O, Bogner C, Polkehn K. Der Qualitätsstandard für Usability Engineering der German UPA – Aktueller Stand der Arbeiten. In: Jahresband Usability Professionals. German UPA; 2012:160-165.","apa":"Fischer, H. G., Geis, T., Kluge, O., Bogner, C., & Polkehn, K. (2012). Der Qualitätsstandard für Usability Engineering der German UPA – Aktueller Stand der Arbeiten. In Jahresband Usability Professionals (pp. 160–165). German UPA.","chicago":"Fischer, Holger Gerhard, Thomas Geis, Oliver Kluge, Christian Bogner, and Knut Polkehn. “Der Qualitätsstandard Für Usability Engineering Der German UPA – Aktueller Stand Der Arbeiten.” In Jahresband Usability Professionals, 160–65. German UPA, 2012."},"year":"2012","type":"conference","language":[{"iso":"eng"}]},{"title":"Archimetrix: Improved Software Architecture Recovery in the Presence of Design Deficiencies","project":[{"_id":"1","name":"SFB 901"},{"_id":"9","name":"SFB 901 - Subprojekt B1"},{"_id":"3","name":"SFB 901 - Project Area B"}],"department":[{"_id":"76"}],"doi":"10.1109/CSMR.2012.33","date_updated":"2022-01-06T07:03:00Z","language":[{"iso":"eng"}],"ddc":["040"],"user_id":"477","abstract":[{"text":"Maintaining software systems requires up-to-date models of these systems to systematically plan, analyse and execute the necessary reengineering steps. Often, no or only outdated models of such systems exist. Thus, a reverse engineering step is needed that recovers the system’s components, subsystems and connectors. However, reverse engineering methods are severely impacted by design deficiencies in the system’s code base, e.g., they lead to wrong component structures. Several approaches exist today for the reverse engineering of component-based systems, however, none of them explicitly integrates a systematic design deficiency removal into the process to improve the quality of the reverse engineered architecture. Therefore, in our Archimetrix approach, we propose to regard the most relevant deficiencies with respect to the reverse engineered component-based architecture and support reengineers by presenting the architectural consequences of removing a given deficiency. We validate our approach on the Common Component Modeling Example and show that we are able to identify relevant deficiencies and that their removal leads to an improved reengineered architecture.","lang":"eng"}],"status":"public","has_accepted_license":"1","date_created":"2017-10-17T12:42:54Z","author":[{"full_name":"Platenius, Marie Christin","first_name":"Marie Christin","last_name":"Platenius"},{"full_name":"von Detten, Markus","first_name":"Markus","last_name":"von Detten"},{"last_name":"Becker","first_name":"Steffen","full_name":"Becker, Steffen"}],"publication":"Proceedings of the 16th European Conference on Software Maintenance and Reengineering (CSMR)","file_date_updated":"2018-03-15T06:37:13Z","file":[{"content_type":"application/pdf","date_updated":"2018-03-15T06:37:13Z","success":1,"relation":"main_file","file_size":723739,"file_id":"1236","creator":"florida","access_level":"closed","date_created":"2018-03-15T06:37:13Z","file_name":"630-CSMR2012-PlateniusDettenBecker.pdf"}],"_id":"630","citation":{"ama":"Platenius MC, von Detten M, Becker S. Archimetrix: Improved Software Architecture Recovery in the Presence of Design Deficiencies. In: Proceedings of the 16th European Conference on Software Maintenance and Reengineering (CSMR). ; 2012:255-264. doi:10.1109/CSMR.2012.33","apa":"Platenius, M. C., von Detten, M., & Becker, S. (2012). Archimetrix: Improved Software Architecture Recovery in the Presence of Design Deficiencies. In Proceedings of the 16th European Conference on Software Maintenance and Reengineering (CSMR) (pp. 255–264). https://doi.org/10.1109/CSMR.2012.33","chicago":"Platenius, Marie Christin, Markus von Detten, and Steffen Becker. “Archimetrix: Improved Software Architecture Recovery in the Presence of Design Deficiencies.” In Proceedings of the 16th European Conference on Software Maintenance and Reengineering (CSMR), 255–64, 2012. https://doi.org/10.1109/CSMR.2012.33.","bibtex":"@inproceedings{Platenius_von Detten_Becker_2012, title={Archimetrix: Improved Software Architecture Recovery in the Presence of Design Deficiencies}, DOI={10.1109/CSMR.2012.33}, booktitle={Proceedings of the 16th European Conference on Software Maintenance and Reengineering (CSMR)}, author={Platenius, Marie Christin and von Detten, Markus and Becker, Steffen}, year={2012}, pages={255–264} }","mla":"Platenius, Marie Christin, et al. “Archimetrix: Improved Software Architecture Recovery in the Presence of Design Deficiencies.” Proceedings of the 16th European Conference on Software Maintenance and Reengineering (CSMR), 2012, pp. 255–64, doi:10.1109/CSMR.2012.33.","short":"M.C. Platenius, M. von Detten, S. Becker, in: Proceedings of the 16th European Conference on Software Maintenance and Reengineering (CSMR), 2012, pp. 255–264.","ieee":"M. C. Platenius, M. von Detten, and S. Becker, “Archimetrix: Improved Software Architecture Recovery in the Presence of Design Deficiencies,” in Proceedings of the 16th European Conference on Software Maintenance and Reengineering (CSMR), 2012, pp. 255–264."},"year":"2012","type":"conference","page":"255-264"},{"user_id":"15504","ddc":["040"],"title":"Archimetrix: A Tool for Deficiency-Aware Software Architecture Reconstruction","abstract":[{"text":"Maintaining software systems requires up-to-date models of these systems to systematically plan, analyze, and execute the necessary reengineering steps. Often, no or only outdated models of such systems exist.Thus, a reverse engineering step is needed that recovers the system's components, subsystems, and connectors. However, reverse engineering methods are severely impacted by design deficiencies in the system's code base, e.g., they lead to wrong component structures.Therefore, Archimetrix enables the reengineer to detect the most relevant deficiencies with respect to a reverseengineered component-based architecture and supports him by presenting the architectural consequences of removinga given deficiency.","lang":"eng"}],"date_created":"2017-10-17T12:42:55Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt B1","_id":"9"},{"_id":"3","name":"SFB 901 - Project Area B"}],"has_accepted_license":"1","status":"public","file":[{"file_name":"631-WCRE2012-vonDetten.pdf","date_created":"2018-03-15T06:36:37Z","access_level":"closed","file_id":"1235","creator":"florida","file_size":258563,"relation":"main_file","success":1,"content_type":"application/pdf","date_updated":"2018-03-15T06:36:37Z"}],"file_date_updated":"2018-03-15T06:36:37Z","publication":"Proceedings of the 19th Working Conference on Reverse Engineering (WCRE)","author":[{"last_name":"von Detten","full_name":"von Detten, Markus","first_name":"Markus"}],"doi":"10.1109/WCRE.2012.61","date_updated":"2022-01-06T07:03:01Z","_id":"631","page":"503 - 504 ","citation":{"apa":"von Detten, M. (2012). Archimetrix: A Tool for Deficiency-Aware Software Architecture Reconstruction. In Proceedings of the 19th Working Conference on Reverse Engineering (WCRE) (pp. 503–504). https://doi.org/10.1109/WCRE.2012.61","ama":"von Detten M. Archimetrix: A Tool for Deficiency-Aware Software Architecture Reconstruction. In: Proceedings of the 19th Working Conference on Reverse Engineering (WCRE). ; 2012:503-504. doi:10.1109/WCRE.2012.61","chicago":"Detten, Markus von. “Archimetrix: A Tool for Deficiency-Aware Software Architecture Reconstruction.” In Proceedings of the 19th Working Conference on Reverse Engineering (WCRE), 503–4, 2012. https://doi.org/10.1109/WCRE.2012.61.","mla":"von Detten, Markus. “Archimetrix: A Tool for Deficiency-Aware Software Architecture Reconstruction.” Proceedings of the 19th Working Conference on Reverse Engineering (WCRE), 2012, pp. 503–04, doi:10.1109/WCRE.2012.61.","bibtex":"@inproceedings{von Detten_2012, title={Archimetrix: A Tool for Deficiency-Aware Software Architecture Reconstruction}, DOI={10.1109/WCRE.2012.61}, booktitle={Proceedings of the 19th Working Conference on Reverse Engineering (WCRE)}, author={von Detten, Markus}, year={2012}, pages={503–504} }","short":"M. von Detten, in: Proceedings of the 19th Working Conference on Reverse Engineering (WCRE), 2012, pp. 503–504.","ieee":"M. von Detten, “Archimetrix: A Tool for Deficiency-Aware Software Architecture Reconstruction,” in Proceedings of the 19th Working Conference on Reverse Engineering (WCRE), 2012, pp. 503–504."},"type":"conference","year":"2012"},{"status":"public","date_created":"2018-12-18T13:15:22Z","author":[{"last_name":"Behrenbruch","full_name":"Behrenbruch, Kay","first_name":"Kay"},{"last_name":"Bogner","full_name":"Bogner, Christian","first_name":"Christian"},{"first_name":"Holger Gerhard","full_name":"Fischer, Holger Gerhard","last_name":"Fischer","id":"30457"},{"last_name":"Geis","first_name":"Thomas","full_name":"Geis, Thomas"},{"first_name":"Claudia","full_name":"Geitner, Claudia","last_name":"Geitner"},{"first_name":"Rüdiger","full_name":"Heimgärtner, Rüdiger","last_name":"Heimgärtner"},{"last_name":"Hofmann","full_name":"Hofmann, Britta","first_name":"Britta"},{"last_name":"Hunkirchen","first_name":"Peter","full_name":"Hunkirchen, Peter"},{"last_name":"Kluge","first_name":"Oliver","full_name":"Kluge, Oliver"},{"last_name":"Litzenberg","full_name":"Litzenberg, Britta","first_name":"Britta"},{"first_name":"Rolf","full_name":"Molich, Rolf","last_name":"Molich"},{"last_name":"Polkehn","full_name":"Polkehn, Knut","first_name":"Knut"},{"full_name":"Pysarenko, Yuliya","first_name":"Yuliya","last_name":"Pysarenko"},{"last_name":"Zimmermann","full_name":"Zimmermann, Dirk","first_name":"Dirk"}],"department":[{"_id":"66"},{"_id":"534"},{"_id":"221"}],"title":"German UPA Qualitätsstandard für Usability Engineering","user_id":"30457","year":"2012","type":"report","citation":{"mla":"Behrenbruch, Kay, et al. German UPA Qualitätsstandard für Usability Engineering. 2012.","bibtex":"@book{Behrenbruch_Bogner_Fischer_Geis_Geitner_Heimgärtner_Hofmann_Hunkirchen_Kluge_Litzenberg_et al._2012, title={German UPA Qualitätsstandard für Usability Engineering}, author={Behrenbruch, Kay and Bogner, Christian and Fischer, Holger Gerhard and Geis, Thomas and Geitner, Claudia and Heimgärtner, Rüdiger and Hofmann, Britta and Hunkirchen, Peter and Kluge, Oliver and Litzenberg, Britta and et al.}, year={2012} }","apa":"Behrenbruch, K., Bogner, C., Fischer, H. G., Geis, T., Geitner, C., Heimgärtner, R., … Zimmermann, D. (2012). German UPA Qualitätsstandard für Usability Engineering.","ama":"Behrenbruch K, Bogner C, Fischer HG, et al. German UPA Qualitätsstandard für Usability Engineering.; 2012.","chicago":"Behrenbruch, Kay, Christian Bogner, Holger Gerhard Fischer, Thomas Geis, Claudia Geitner, Rüdiger Heimgärtner, Britta Hofmann, et al. German UPA Qualitätsstandard für Usability Engineering, 2012.","ieee":"K. Behrenbruch et al., German UPA Qualitätsstandard für Usability Engineering. 2012.","short":"K. Behrenbruch, C. Bogner, H.G. Fischer, T. Geis, C. Geitner, R. Heimgärtner, B. Hofmann, P. Hunkirchen, O. Kluge, B. Litzenberg, R. Molich, K. Polkehn, Y. Pysarenko, D. Zimmermann, German UPA Qualitätsstandard für Usability Engineering, 2012."},"language":[{"iso":"ger"}],"_id":"6312","date_updated":"2022-01-06T07:03:01Z"},{"date_updated":"2022-01-06T07:03:01Z","_id":"632","doi":"10.1137/1.9781611973099.64","year":"2012","type":"conference","citation":{"ieee":"P. Kolman and C. Scheideler, “Approximate Duality of Multicommodity Multiroute Flows and Cuts: Single Source Case,” in Proceedings of the 23th ACM SIAM Symposium on Discrete Algorithms (SODA), 2012, pp. 800–810.","short":"P. Kolman, C. Scheideler, in: Proceedings of the 23th ACM SIAM Symposium on Discrete Algorithms (SODA), 2012, pp. 800–810.","bibtex":"@inproceedings{Kolman_Scheideler_2012, title={Approximate Duality of Multicommodity Multiroute Flows and Cuts: Single Source Case}, DOI={10.1137/1.9781611973099.64}, booktitle={Proceedings of the 23th ACM SIAM Symposium on Discrete Algorithms (SODA)}, author={Kolman, Petr and Scheideler, Christian}, year={2012}, pages={800–810} }","mla":"Kolman, Petr, and Christian Scheideler. “Approximate Duality of Multicommodity Multiroute Flows and Cuts: Single Source Case.” Proceedings of the 23th ACM SIAM Symposium on Discrete Algorithms (SODA), 2012, pp. 800–10, doi:10.1137/1.9781611973099.64.","ama":"Kolman P, Scheideler C. Approximate Duality of Multicommodity Multiroute Flows and Cuts: Single Source Case. In: Proceedings of the 23th ACM SIAM Symposium on Discrete Algorithms (SODA). ; 2012:800-810. doi:10.1137/1.9781611973099.64","apa":"Kolman, P., & Scheideler, C. (2012). Approximate Duality of Multicommodity Multiroute Flows and Cuts: Single Source Case. In Proceedings of the 23th ACM SIAM Symposium on Discrete Algorithms (SODA) (pp. 800–810). https://doi.org/10.1137/1.9781611973099.64","chicago":"Kolman, Petr, and Christian Scheideler. “Approximate Duality of Multicommodity Multiroute Flows and Cuts: Single Source Case.” In Proceedings of the 23th ACM SIAM Symposium on Discrete Algorithms (SODA), 800–810, 2012. https://doi.org/10.1137/1.9781611973099.64."},"page":"800-810","abstract":[{"text":"Given an integer h, a graph G = (V;E) with arbitrary positive edge capacities and k pairs of vertices (s1; t1); (s2; t2); : : : ; (sk; tk), called terminals, an h-route cut is a set F µ E of edges such that after the removal of the edges in F no pair si ¡ ti is connected by h edge-disjoint paths (i.e., the connectivity of every si ¡ ti pair is at most h ¡ 1 in (V;E n F)). The h-route cut is a natural generalization of the classical cut problem for multicommodity °ows (take h = 1). The main result of this paper is an O(h722h log2 k)-approximation algorithm for the minimum h-route cut problem in the case that s1 = s2 = ¢ ¢ ¢ = sk, called the single source case. As a corollary of it we obtain an approximate duality theorem for multiroute multicom-modity °ows and cuts with a single source. This partially answers an open question posted in several previous papers dealing with cuts for multicommodity multiroute problems.","lang":"eng"}],"title":"Approximate Duality of Multicommodity Multiroute Flows and Cuts: Single Source Case","ddc":["040"],"user_id":"15504","author":[{"last_name":"Kolman","full_name":"Kolman, Petr","first_name":"Petr"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"file_date_updated":"2018-03-15T06:35:58Z","publication":"Proceedings of the 23th ACM SIAM Symposium on Discrete Algorithms (SODA)","department":[{"_id":"79"}],"file":[{"access_level":"closed","file_name":"632-SODA2012-Scheideler_01.pdf","date_created":"2018-03-15T06:35:58Z","relation":"main_file","success":1,"content_type":"application/pdf","date_updated":"2018-03-15T06:35:58Z","creator":"florida","file_id":"1234","file_size":220213}],"status":"public","has_accepted_license":"1","date_created":"2017-10-17T12:42:55Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"}]}]