[{"type":"conference","department":[{"_id":"79"}],"file":[{"creator":"florida","date_created":"2018-03-15T06:45:25Z","access_level":"closed","file_size":210382,"file_name":"623-PODC-2012_01.pdf","date_updated":"2018-03-15T06:45:25Z","relation":"main_file","content_type":"application/pdf","success":1,"file_id":"1241"}],"date_created":"2017-10-17T12:42:53Z","abstract":[{"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.","lang":"eng"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"name":"SFB 901 - Project Area C","_id":"4"}],"file_date_updated":"2018-03-15T06:45:25Z","publication":"Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC)","citation":{"chicago":"Richa, Andrea W., Christian Scheideler, Stefan Schmid, and Jin  Zhang. “Competitive and Fair Throughput for Co-Existing Networks under Adversarial Interference.” In <i>Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC)</i>, 291–300, 2012. <a href=\"https://doi.org/10.1145/2332432.2332488\">https://doi.org/10.1145/2332432.2332488</a>.","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.","apa":"Richa, A. W., Scheideler, C., Schmid, S., &#38; Zhang, J. (2012). Competitive and fair throughput for co-existing networks under adversarial interference. In <i>Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC)</i> (pp. 291–300). <a href=\"https://doi.org/10.1145/2332432.2332488\">https://doi.org/10.1145/2332432.2332488</a>","ieee":"A. W. Richa, C. Scheideler, S. Schmid, and J. Zhang, “Competitive and fair throughput for co-existing networks under adversarial interference,” in <i>Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC)</i>, 2012, pp. 291–300.","ama":"Richa AW, Scheideler C, Schmid S, Zhang J. Competitive and fair throughput for co-existing networks under adversarial interference. In: <i>Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC)</i>. ; 2012:291-300. doi:<a href=\"https://doi.org/10.1145/2332432.2332488\">10.1145/2332432.2332488</a>","bibtex":"@inproceedings{Richa_Scheideler_Schmid_Zhang_2012, title={Competitive and fair throughput for co-existing networks under adversarial interference}, DOI={<a href=\"https://doi.org/10.1145/2332432.2332488\">10.1145/2332432.2332488</a>}, 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.” <i>Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC)</i>, 2012, pp. 291–300, doi:<a href=\"https://doi.org/10.1145/2332432.2332488\">10.1145/2332432.2332488</a>."},"user_id":"15504","doi":"10.1145/2332432.2332488","ddc":["040"],"page":"291-300","_id":"623","date_updated":"2022-01-06T07:02:58Z","has_accepted_license":"1","status":"public","year":"2012","title":"Competitive and fair throughput for co-existing networks under adversarial interference","author":[{"full_name":"Richa, Andrea W.","first_name":"Andrea W.","last_name":"Richa"},{"full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler","id":"20792"},{"full_name":"Schmid, Stefan","first_name":"Stefan","last_name":"Schmid"},{"full_name":"Zhang, Jin ","last_name":"Zhang","first_name":"Jin "}]},{"_id":"624","publisher":"Universität Paderborn","user_id":"15504","status":"public","title":"Change and Validity Analysis in Deductive Program Verification","year":"2012","author":[{"last_name":"Jakobs","first_name":"Marie-Christine","full_name":"Jakobs, Marie-Christine"}],"date_updated":"2022-01-06T07:02:58Z","date_created":"2017-10-17T12:42:53Z","type":"mastersthesis","citation":{"bibtex":"@book{Jakobs_2012, title={Change and Validity Analysis in Deductive Program Verification}, publisher={Universität Paderborn}, author={Jakobs, Marie-Christine}, year={2012} }","ama":"Jakobs M-C. <i>Change and Validity Analysis in Deductive Program Verification</i>. Universität Paderborn; 2012.","mla":"Jakobs, Marie-Christine. <i>Change and Validity Analysis in Deductive Program Verification</i>. Universität Paderborn, 2012.","chicago":"Jakobs, Marie-Christine. <i>Change and Validity Analysis in Deductive Program Verification</i>. Universität Paderborn, 2012.","short":"M.-C. Jakobs, Change and Validity Analysis in Deductive Program Verification, Universität Paderborn, 2012.","ieee":"M.-C. Jakobs, <i>Change and Validity Analysis in Deductive Program Verification</i>. Universität Paderborn, 2012.","apa":"Jakobs, M.-C. (2012). <i>Change and Validity Analysis in Deductive Program Verification</i>. Universität Paderborn."},"project":[{"_id":"1","name":"SFB 901"},{"_id":"12","name":"SFB 901 - Subprojekt B4"},{"name":"SFB 901 - Project Area B","_id":"3"}]},{"has_accepted_license":"1","status":"public","ddc":["040"],"user_id":"15504","_id":"625","page":"439-440","project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"citation":{"mla":"Schmid, Stefan, et al. “Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures.” <i>Proceedings of the 26th International Symposium on Distributed Computing (DISC)</i>, 2012, pp. 439–40, doi:<a href=\"https://doi.org/10.1007/978-3-642-33651-5_47\">10.1007/978-3-642-33651-5_47</a>.","ama":"Schmid S, Avin C, Scheideler C, Häupler B, Lotker Z. Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures. In: <i>Proceedings of the 26th International Symposium on Distributed Computing (DISC)</i>. LNCS. ; 2012:439-440. doi:<a href=\"https://doi.org/10.1007/978-3-642-33651-5_47\">10.1007/978-3-642-33651-5_47</a>","bibtex":"@inproceedings{Schmid_Avin_Scheideler_Häupler_Lotker_2012, series={LNCS}, title={Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-33651-5_47\">10.1007/978-3-642-33651-5_47</a>}, 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} }","apa":"Schmid, S., Avin, C., Scheideler, C., Häupler, B., &#38; Lotker, Z. (2012). Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures. In <i>Proceedings of the 26th International Symposium on Distributed Computing (DISC)</i> (pp. 439–440). <a href=\"https://doi.org/10.1007/978-3-642-33651-5_47\">https://doi.org/10.1007/978-3-642-33651-5_47</a>","ieee":"S. Schmid, C. Avin, C. Scheideler, B. Häupler, and Z. Lotker, “Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures,” in <i>Proceedings of the 26th International Symposium on Distributed Computing (DISC)</i>, 2012, pp. 439–440.","chicago":"Schmid, Stefan, Chen Avin, Christian Scheideler, Bernhard Häupler, and Zvi Lotker. “Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures.” In <i>Proceedings of the 26th International Symposium on Distributed Computing (DISC)</i>, 439–40. LNCS, 2012. <a href=\"https://doi.org/10.1007/978-3-642-33651-5_47\">https://doi.org/10.1007/978-3-642-33651-5_47</a>.","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."},"file_date_updated":"2018-03-15T06:44:09Z","date_updated":"2022-01-06T07:02:58Z","author":[{"full_name":"Schmid, Stefan","last_name":"Schmid","first_name":"Stefan"},{"first_name":"Chen","last_name":"Avin","full_name":"Avin, Chen"},{"id":"20792","full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler"},{"full_name":"Häupler, Bernhard","last_name":"Häupler","first_name":"Bernhard"},{"last_name":"Lotker","first_name":"Zvi","full_name":"Lotker, Zvi"}],"title":"Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures","year":"2012","doi":"10.1007/978-3-642-33651-5_47","series_title":"LNCS","abstract":[{"lang":"eng","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."}],"publication":"Proceedings of the 26th International Symposium on Distributed Computing (DISC)","department":[{"_id":"79"}],"type":"conference","date_created":"2017-10-17T12:42:53Z","file":[{"success":1,"content_type":"application/pdf","file_id":"1240","file_size":717284,"access_level":"closed","file_name":"625-disc12adjBAshort.pdf","date_updated":"2018-03-15T06:44:09Z","relation":"main_file","date_created":"2018-03-15T06:44:09Z","creator":"florida"}]},{"date_created":"2018-12-18T10:18:13Z","type":"journal_article","department":[{"_id":"66"},{"_id":"534"},{"_id":"221"}],"publication":"ISPRS - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences","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={<a href=\"https://doi.org/10.5194/isprsarchives-xxxix-b8-55-2012\">10.5194/isprsarchives-xxxix-b8-55-2012</a>}, 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} }","ama":"Paelke V, Nebe K, Geiger C, Klompmaker F, Fischer HG. Multi-Modal, Multi-Touch Interaction with Maps in Disaster Management Applications. <i>ISPRS - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences</i>. 2012;XXXIX-B8:55-60. doi:<a href=\"https://doi.org/10.5194/isprsarchives-xxxix-b8-55-2012\">10.5194/isprsarchives-xxxix-b8-55-2012</a>","mla":"Paelke, Volker, et al. “Multi-Modal, Multi-Touch Interaction with Maps in Disaster Management Applications.” <i>ISPRS - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences</i>, vol. XXXIX-B8, Copernicus GmbH, 2012, pp. 55–60, doi:<a href=\"https://doi.org/10.5194/isprsarchives-xxxix-b8-55-2012\">10.5194/isprsarchives-xxxix-b8-55-2012</a>.","chicago":"Paelke, Volker, Karsten Nebe, Christian Geiger, Florian Klompmaker, and Holger Gerhard Fischer. “Multi-Modal, Multi-Touch Interaction with Maps in Disaster Management Applications.” <i>ISPRS - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences</i> XXXIX-B8 (2012): 55–60. <a href=\"https://doi.org/10.5194/isprsarchives-xxxix-b8-55-2012\">https://doi.org/10.5194/isprsarchives-xxxix-b8-55-2012</a>.","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.","ieee":"V. Paelke, K. Nebe, C. Geiger, F. Klompmaker, and H. G. Fischer, “Multi-Modal, Multi-Touch Interaction with Maps in Disaster Management Applications,” <i>ISPRS - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences</i>, vol. XXXIX-B8, pp. 55–60, 2012.","apa":"Paelke, V., Nebe, K., Geiger, C., Klompmaker, F., &#38; Fischer, H. G. (2012). Multi-Modal, Multi-Touch Interaction with Maps in Disaster Management Applications. <i>ISPRS - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences</i>, <i>XXXIX</i>-<i>B8</i>, 55–60. <a href=\"https://doi.org/10.5194/isprsarchives-xxxix-b8-55-2012\">https://doi.org/10.5194/isprsarchives-xxxix-b8-55-2012</a>"},"page":"55-60","publisher":"Copernicus GmbH","_id":"6250","language":[{"iso":"eng"}],"doi":"10.5194/isprsarchives-xxxix-b8-55-2012","user_id":"30457","volume":"XXXIX-B8","title":"Multi-Modal, Multi-Touch Interaction with Maps in Disaster Management Applications","status":"public","year":"2012","author":[{"last_name":"Paelke","first_name":"Volker","full_name":"Paelke, Volker"},{"last_name":"Nebe","first_name":"Karsten","full_name":"Nebe, Karsten"},{"last_name":"Geiger","first_name":"Christian","full_name":"Geiger, Christian"},{"full_name":"Klompmaker, Florian","first_name":"Florian","last_name":"Klompmaker"},{"full_name":"Fischer, Holger Gerhard","first_name":"Holger Gerhard","last_name":"Fischer","id":"30457"}],"publication_identifier":{"issn":["1682-1777"]},"date_updated":"2022-01-06T07:02:58Z","publication_status":"published"},{"project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"file_date_updated":"2018-03-15T06:42:40Z","citation":{"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 <i>Proceedings of the 26th International Symposium on Distributed Computing (DISC)</i>, 435–36. LNCS, 2012. <a href=\"https://doi.org/10.1007/978-3-642-33651-5_45\">https://doi.org/10.1007/978-3-642-33651-5_45</a>.","short":"S. Kniesburges, C. Scheideler, in: Proceedings of the 26th International Symposium on Distributed Computing (DISC), 2012, pp. 435–436.","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 <i>Proceedings of the 26th International Symposium on Distributed Computing (DISC)</i>, 2012, pp. 435–436.","apa":"Kniesburges, S., &#38; Scheideler, C. (2012). Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems. In <i>Proceedings of the 26th International Symposium on Distributed Computing (DISC)</i> (pp. 435–436). <a href=\"https://doi.org/10.1007/978-3-642-33651-5_45\">https://doi.org/10.1007/978-3-642-33651-5_45</a>","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={<a href=\"https://doi.org/10.1007/978-3-642-33651-5_45\">10.1007/978-3-642-33651-5_45</a>}, booktitle={Proceedings of the 26th International Symposium on Distributed Computing (DISC)}, author={Kniesburges, Sebastian and Scheideler, Christian}, year={2012}, pages={435–436}, collection={LNCS} }","ama":"Kniesburges S, Scheideler C. Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems. In: <i>Proceedings of the 26th International Symposium on Distributed Computing (DISC)</i>. LNCS. ; 2012:435-436. doi:<a href=\"https://doi.org/10.1007/978-3-642-33651-5_45\">10.1007/978-3-642-33651-5_45</a>","mla":"Kniesburges, Sebastian, and Christian Scheideler. “Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems.” <i>Proceedings of the 26th International Symposium on Distributed Computing (DISC)</i>, 2012, pp. 435–36, doi:<a href=\"https://doi.org/10.1007/978-3-642-33651-5_45\">10.1007/978-3-642-33651-5_45</a>."},"has_accepted_license":"1","status":"public","user_id":"15504","ddc":["040"],"page":"435-436","_id":"626","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)."}],"publication":"Proceedings of the 26th International Symposium on Distributed Computing (DISC)","type":"conference","department":[{"_id":"79"}],"file":[{"date_updated":"2018-03-15T06:42:40Z","relation":"main_file","file_size":184095,"access_level":"closed","file_name":"626-Predecessor-Kniesburges_Scheideler.pdf","success":1,"content_type":"application/pdf","file_id":"1239","creator":"florida","date_created":"2018-03-15T06:42:40Z"}],"date_created":"2017-10-17T12:42:54Z","date_updated":"2022-01-06T07:02:59Z","year":"2012","title":"Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems","author":[{"full_name":"Kniesburges, Sebastian","first_name":"Sebastian","last_name":"Kniesburges"},{"id":"20792","full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler"}],"doi":"10.1007/978-3-642-33651-5_45","series_title":"LNCS"},{"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt B4","_id":"12"},{"name":"SFB 901 - Project Area B","_id":"3"}],"file_date_updated":"2018-03-15T06:46:05Z","citation":{"ieee":"D. Wonisch, “Block Abstraction Memoization for CPAchecker,” in <i>Proceedings of the 18th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS)</i>, 2012, pp. 531–533.","apa":"Wonisch, D. (2012). Block Abstraction Memoization for CPAchecker. In <i>Proceedings of the 18th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS)</i> (pp. 531–533). <a href=\"https://doi.org/10.1007/978-3-642-28756-5_41\">https://doi.org/10.1007/978-3-642-28756-5_41</a>","mla":"Wonisch, Daniel. “Block Abstraction Memoization for CPAchecker.” <i>Proceedings of the 18th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS)</i>, 2012, pp. 531–33, doi:<a href=\"https://doi.org/10.1007/978-3-642-28756-5_41\">10.1007/978-3-642-28756-5_41</a>.","bibtex":"@inproceedings{Wonisch_2012, series={LNCS}, title={Block Abstraction Memoization for CPAchecker}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-28756-5_41\">10.1007/978-3-642-28756-5_41</a>}, 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} }","ama":"Wonisch D. Block Abstraction Memoization for CPAchecker. In: <i>Proceedings of the 18th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS)</i>. LNCS. ; 2012:531-533. doi:<a href=\"https://doi.org/10.1007/978-3-642-28756-5_41\">10.1007/978-3-642-28756-5_41</a>","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.","chicago":"Wonisch, Daniel. “Block Abstraction Memoization for CPAchecker.” In <i>Proceedings of the 18th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS)</i>, 531–33. LNCS, 2012. <a href=\"https://doi.org/10.1007/978-3-642-28756-5_41\">https://doi.org/10.1007/978-3-642-28756-5_41</a>."},"user_id":"477","ddc":["040"],"page":"531-533","_id":"627","has_accepted_license":"1","status":"public","type":"conference","department":[{"_id":"77"}],"file":[{"creator":"florida","date_created":"2018-03-15T06:46:05Z","date_updated":"2018-03-15T06:46:05Z","relation":"main_file","access_level":"closed","file_size":184000,"file_name":"627-WonischSV-Comp2012_01.pdf","success":1,"content_type":"application/pdf","file_id":"1242"}],"date_created":"2017-10-17T12:42:54Z","abstract":[{"lang":"eng","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."}],"publication":"Proceedings of the 18th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS)","doi":"10.1007/978-3-642-28756-5_41","language":[{"iso":"eng"}],"series_title":"LNCS","date_updated":"2022-01-06T07:02:59Z","year":"2012","title":"Block Abstraction Memoization for CPAchecker","author":[{"full_name":"Wonisch, Daniel","last_name":"Wonisch","first_name":"Daniel"}]},{"citation":{"chicago":"Schneid, M, Holger Steinmetz, R Isidor, and Rüdiger Kabst. “Diversität, Konflikte Und Leistung in Teams: Ein Meta-Analytisches Strukturgleichungsmodell,” 2012.","short":"M. Schneid, H. Steinmetz, R. Isidor, R. Kabst, in: 2012.","apa":"Schneid, M., Steinmetz, H., Isidor, R., &#38; Kabst, R. (2012). Diversität, Konflikte und Leistung in Teams: Ein meta-analytisches Strukturgleichungsmodell.","ieee":"M. Schneid, H. Steinmetz, R. Isidor, and R. Kabst, “Diversität, Konflikte und Leistung in Teams: Ein meta-analytisches Strukturgleichungsmodell,” 2012.","ama":"Schneid M, Steinmetz H, Isidor R, Kabst R. Diversität, Konflikte und Leistung in Teams: Ein meta-analytisches Strukturgleichungsmodell. In: ; 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} }","mla":"Schneid, M., et al. <i>Diversität, Konflikte Und Leistung in Teams: Ein Meta-Analytisches Strukturgleichungsmodell</i>. 2012."},"date_created":"2018-12-18T12:42:54Z","department":[{"_id":"274"}],"type":"conference","author":[{"last_name":"Schneid","first_name":"M","full_name":"Schneid, M"},{"id":"43261","last_name":"Steinmetz","first_name":"Holger","full_name":"Steinmetz, Holger"},{"last_name":"Isidor","first_name":"R","full_name":"Isidor, R"},{"last_name":"Kabst","first_name":"Rüdiger","full_name":"Kabst, Rüdiger","id":"42362"}],"title":"Diversität, Konflikte und Leistung in Teams: Ein meta-analytisches Strukturgleichungsmodell","status":"public","year":"2012","date_updated":"2022-01-06T07:02:59Z","_id":"6275","language":[{"iso":"eng"}],"user_id":"46632"},{"type":"conference","department":[{"_id":"274"}],"place":"Amsterdam","date_created":"2018-12-18T12:43:58Z","citation":{"ama":"Kabst R. Endogeneity in the behavioral sciences: An illustration with real data. In: Amsterdam; 2012.","bibtex":"@inproceedings{Kabst_2012, place={Amsterdam}, title={Endogeneity in the behavioral sciences: An illustration with real data}, author={Kabst, Rüdiger}, year={2012} }","mla":"Kabst, Rüdiger. <i>Endogeneity in the Behavioral Sciences: An Illustration with Real Data</i>. 2012.","chicago":"Kabst, Rüdiger. “Endogeneity in the Behavioral Sciences: An Illustration with Real Data.” Amsterdam, 2012.","short":"R. Kabst, in: Amsterdam, 2012.","apa":"Kabst, R. (2012). Endogeneity in the behavioral sciences: An illustration with real data. Amsterdam.","ieee":"R. Kabst, “Endogeneity in the behavioral sciences: An illustration with real data,” 2012."},"user_id":"46632","_id":"6277","language":[{"iso":"eng"}],"date_updated":"2022-01-06T07:02:59Z","year":"2012","status":"public","title":"Endogeneity in the behavioral sciences: An illustration with real data","author":[{"id":"42362","first_name":"Rüdiger","last_name":"Kabst","full_name":"Kabst, Rüdiger"}]},{"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."}],"publication":"Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT)","department":[{"_id":"79"},{"_id":"63"}],"type":"conference","date_created":"2017-10-17T12:42:54Z","file":[{"creator":"florida","date_created":"2018-03-15T06:42:01Z","file_name":"628-FULL_paper_bncs_with_interests.pdf","access_level":"closed","file_size":300591,"relation":"main_file","date_updated":"2018-03-15T06:42:01Z","file_id":"1238","content_type":"application/pdf","success":1}],"date_updated":"2022-01-06T07:02:59Z","author":[{"last_name":"Cord-Landwehr","first_name":"Andreas","full_name":"Cord-Landwehr, Andreas"},{"full_name":"Huellmann (married name: Eikel), Martina","last_name":"Huellmann (married name: Eikel)","first_name":"Martina"},{"full_name":"Kling, Peter","last_name":"Kling","first_name":"Peter"},{"id":"11108","full_name":"Setzer, Alexander","first_name":"Alexander","last_name":"Setzer"}],"year":"2012","title":"Basic Network Creation Games with Communication Interests","doi":"10.1007/978-3-642-33996-7_7","language":[{"iso":"eng"}],"series_title":"LNCS","project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"citation":{"apa":"Cord-Landwehr, A., Huellmann (married name: Eikel), M., Kling, P., &#38; Setzer, A. (2012). Basic Network Creation Games with Communication Interests. In <i>Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT)</i> (pp. 72--83). <a href=\"https://doi.org/10.1007/978-3-642-33996-7_7\">https://doi.org/10.1007/978-3-642-33996-7_7</a>","ieee":"A. Cord-Landwehr, M. Huellmann (married name: Eikel), P. Kling, and A. Setzer, “Basic Network Creation Games with Communication Interests,” in <i>Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT)</i>, 2012, pp. 72--83.","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.","chicago":"Cord-Landwehr, Andreas, Martina Huellmann (married name: Eikel), Peter Kling, and Alexander Setzer. “Basic Network Creation Games with Communication Interests.” In <i>Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT)</i>, 72--83. LNCS, 2012. <a href=\"https://doi.org/10.1007/978-3-642-33996-7_7\">https://doi.org/10.1007/978-3-642-33996-7_7</a>.","mla":"Cord-Landwehr, Andreas, et al. “Basic Network Creation Games with Communication Interests.” <i>Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT)</i>, 2012, pp. 72--83, doi:<a href=\"https://doi.org/10.1007/978-3-642-33996-7_7\">10.1007/978-3-642-33996-7_7</a>.","ama":"Cord-Landwehr A, Huellmann (married name: Eikel) M, Kling P, Setzer A. Basic Network Creation Games with Communication Interests. In: <i>Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT)</i>. LNCS. ; 2012:72--83. doi:<a href=\"https://doi.org/10.1007/978-3-642-33996-7_7\">10.1007/978-3-642-33996-7_7</a>","bibtex":"@inproceedings{Cord-Landwehr_Huellmann (married name: Eikel)_Kling_Setzer_2012, series={LNCS}, title={Basic Network Creation Games with Communication Interests}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-33996-7_7\">10.1007/978-3-642-33996-7_7</a>}, 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} }"},"file_date_updated":"2018-03-15T06:42:01Z","has_accepted_license":"1","status":"public","ddc":["040"],"user_id":"477","_id":"628","page":"72--83"},{"citation":{"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.","short":"M.C. Wehner, A. Giardini, R. Kabst, in: University of Limerick, Ireland, 2012.","apa":"Wehner, M. C., Giardini, A., &#38; Kabst, R. (2012). Recruitment Process Outsourcing and Applicant Reactions: Does Image Make a Difference? University of Limerick, Ireland.","ieee":"M. C. Wehner, A. Giardini, and R. Kabst, “Recruitment Process Outsourcing and Applicant Reactions: Does Image Make a Difference?,” 2012.","ama":"Wehner MC, Giardini A, Kabst R. Recruitment Process Outsourcing and Applicant Reactions: Does Image Make a Difference? In: 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. <i>Recruitment Process Outsourcing and Applicant Reactions: Does Image Make a Difference?</i> 2012."},"place":"University of Limerick, Ireland","date_created":"2018-12-18T12:47:28Z","department":[{"_id":"274"}],"type":"conference","author":[{"first_name":"M C","last_name":"Wehner","full_name":"Wehner, M C"},{"full_name":"Giardini, A","last_name":"Giardini","first_name":"A"},{"full_name":"Kabst, Rüdiger","first_name":"Rüdiger","last_name":"Kabst","id":"42362"}],"year":"2012","title":"Recruitment Process Outsourcing and Applicant Reactions: Does Image Make a Difference?","status":"public","date_updated":"2022-01-06T07:02:59Z","_id":"6281","language":[{"iso":"eng"}],"user_id":"46632"},{"language":[{"iso":"eng"}],"_id":"6285","publisher":"IARIA","page":"95-100","user_id":"30457","author":[{"first_name":"Volker","last_name":"Paelke","full_name":"Paelke, Volker"},{"full_name":"Nebe, Karsten","last_name":"Nebe","first_name":"Karsten"},{"full_name":"Geiger, Christian","last_name":"Geiger","first_name":"Christian"},{"full_name":"Klompmaker, Florian","last_name":"Klompmaker","first_name":"Florian"},{"id":"30457","last_name":"Fischer","first_name":"Holger Gerhard","full_name":"Fischer, Holger Gerhard"}],"title":"Designing Multi-Modal Map-Based Interfaces for Disaster Management","status":"public","year":"2012","date_updated":"2022-01-06T07:02:59Z","date_created":"2018-12-18T12:49:38Z","department":[{"_id":"66"},{"_id":"534"},{"_id":"221"}],"type":"conference","citation":{"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.","chicago":"Paelke, Volker, Karsten Nebe, Christian Geiger, Florian Klompmaker, and Holger Gerhard Fischer. “Designing Multi-Modal Map-Based Interfaces for Disaster Management.” In <i>Proceedings of the 5th International Conference on Advances in Computer-Human Interaction (ACHI)</i>, 95–100. IARIA, 2012.","ieee":"V. Paelke, K. Nebe, C. Geiger, F. Klompmaker, and H. G. Fischer, “Designing Multi-Modal Map-Based Interfaces for Disaster Management,” in <i>Proceedings of the 5th International Conference on Advances in Computer-Human Interaction (ACHI)</i>, 2012, pp. 95–100.","apa":"Paelke, V., Nebe, K., Geiger, C., Klompmaker, F., &#38; Fischer, H. G. (2012). Designing Multi-Modal Map-Based Interfaces for Disaster Management. In <i>Proceedings of the 5th International Conference on Advances in Computer-Human Interaction (ACHI)</i> (pp. 95–100). IARIA.","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} }","ama":"Paelke V, Nebe K, Geiger C, Klompmaker F, Fischer HG. Designing Multi-Modal Map-Based Interfaces for Disaster Management. In: <i>Proceedings of the 5th International Conference on Advances in Computer-Human Interaction (ACHI)</i>. IARIA; 2012:95-100.","mla":"Paelke, Volker, et al. “Designing Multi-Modal Map-Based Interfaces for Disaster Management.” <i>Proceedings of the 5th International Conference on Advances in Computer-Human Interaction (ACHI)</i>, IARIA, 2012, pp. 95–100."},"publication":"Proceedings of the 5th International Conference on Advances in Computer-Human Interaction (ACHI)"},{"date_updated":"2022-01-06T07:02:59Z","author":[{"full_name":"Klompmaker, Florian","last_name":"Klompmaker","first_name":"Florian"},{"id":"30457","full_name":"Fischer, Holger Gerhard","last_name":"Fischer","first_name":"Holger Gerhard"},{"first_name":"Helge","last_name":"Jung","full_name":"Jung, Helge"}],"status":"public","year":"2012","title":"Authenticated Tangible Interaction using RFID and Depth-Sensing Cameras - Supporting Collaboration on Interactive Tabletops","user_id":"30457","_id":"6286","publisher":"IARIA","language":[{"iso":"eng"}],"page":"141-144","citation":{"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 <i>Proceedings of the 5th International Conference on Advances in Computer-Human Interaction (ACHI)</i>, 141–44. IARIA, 2012.","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.","ama":"Klompmaker F, Fischer HG, Jung H. Authenticated Tangible Interaction using RFID and Depth-Sensing Cameras - Supporting Collaboration on Interactive Tabletops. In: <i>Proceedings of the 5th International Conference on Advances in Computer-Human Interaction (ACHI)</i>. 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 <i>Proceedings of the 5th International Conference on Advances in Computer-Human Interaction (ACHI)</i>, 2012, pp. 141–144.","apa":"Klompmaker, F., Fischer, H. G., &#38; Jung, H. (2012). Authenticated Tangible Interaction using RFID and Depth-Sensing Cameras - Supporting Collaboration on Interactive Tabletops. In <i>Proceedings of the 5th International Conference on Advances in Computer-Human Interaction (ACHI)</i> (pp. 141–144). IARIA.","mla":"Klompmaker, Florian, et al. “Authenticated Tangible Interaction Using RFID and Depth-Sensing Cameras - Supporting Collaboration on Interactive Tabletops.” <i>Proceedings of the 5th International Conference on Advances in Computer-Human Interaction (ACHI)</i>, IARIA, 2012, pp. 141–44."},"publication":"Proceedings of the 5th International Conference on Advances in Computer-Human Interaction (ACHI)","department":[{"_id":"66"},{"_id":"534"},{"_id":"221"}],"type":"conference","date_created":"2018-12-18T12:50:15Z"},{"publication_identifier":{"isbn":["9781450311687"]},"author":[{"id":"30457","first_name":"Holger Gerhard","last_name":"Fischer","full_name":"Fischer, Holger Gerhard"}],"title":"Integrating usability engineering in the software development lifecycle based on international standards","status":"public","year":"2012","publication_status":"published","date_updated":"2022-01-06T07:03:00Z","_id":"6288","language":[{"iso":"eng"}],"publisher":"ACM Press","user_id":"30457","doi":"10.1145/2305484.2305541","citation":{"bibtex":"@inproceedings{Fischer_2012, title={Integrating usability engineering in the software development lifecycle based on international standards}, DOI={<a href=\"https://doi.org/10.1145/2305484.2305541\">10.1145/2305484.2305541</a>}, booktitle={Proceedings of the 4th ACM SIGCHI symposium on Engineering interactive computing systems - EICS ’12}, publisher={ACM Press}, author={Fischer, Holger Gerhard}, year={2012} }","ama":"Fischer HG. Integrating usability engineering in the software development lifecycle based on international standards. In: <i>Proceedings of the 4th ACM SIGCHI Symposium on Engineering Interactive Computing Systems - EICS ’12</i>. ACM Press; 2012. doi:<a href=\"https://doi.org/10.1145/2305484.2305541\">10.1145/2305484.2305541</a>","mla":"Fischer, Holger Gerhard. “Integrating Usability Engineering in the Software Development Lifecycle Based on International Standards.” <i>Proceedings of the 4th ACM SIGCHI Symposium on Engineering Interactive Computing Systems - EICS ’12</i>, ACM Press, 2012, doi:<a href=\"https://doi.org/10.1145/2305484.2305541\">10.1145/2305484.2305541</a>.","chicago":"Fischer, Holger Gerhard. “Integrating Usability Engineering in the Software Development Lifecycle Based on International Standards.” In <i>Proceedings of the 4th ACM SIGCHI Symposium on Engineering Interactive Computing Systems - EICS ’12</i>. ACM Press, 2012. <a href=\"https://doi.org/10.1145/2305484.2305541\">https://doi.org/10.1145/2305484.2305541</a>.","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 <i>Proceedings of the 4th ACM SIGCHI symposium on Engineering interactive computing systems - EICS ’12</i>, 2012.","apa":"Fischer, H. G. (2012). Integrating usability engineering in the software development lifecycle based on international standards. In <i>Proceedings of the 4th ACM SIGCHI symposium on Engineering interactive computing systems - EICS ’12</i>. ACM Press. <a href=\"https://doi.org/10.1145/2305484.2305541\">https://doi.org/10.1145/2305484.2305541</a>"},"publication":"Proceedings of the 4th ACM SIGCHI symposium on Engineering interactive computing systems - EICS '12","date_created":"2018-12-18T12:52:11Z","department":[{"_id":"66"},{"_id":"534"},{"_id":"221"}],"type":"conference"},{"status":"public","year":"2012","title":"Attribute-basierte Verschlüsselung","author":[{"full_name":"Schleiter, Patrick","first_name":"Patrick","last_name":"Schleiter"}],"date_updated":"2022-01-06T07:03:00Z","publisher":"Universität Paderborn","_id":"629","language":[{"iso":"ger"}],"user_id":"477","supervisor":[{"id":"23","full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes"}],"citation":{"mla":"Schleiter, Patrick. <i>Attribute-basierte Verschlüsselung</i>. Universität Paderborn, 2012.","bibtex":"@book{Schleiter_2012, title={Attribute-basierte Verschlüsselung}, publisher={Universität Paderborn}, author={Schleiter, Patrick}, year={2012} }","ama":"Schleiter P. <i>Attribute-basierte Verschlüsselung</i>. Universität Paderborn; 2012.","ieee":"P. Schleiter, <i>Attribute-basierte Verschlüsselung</i>. Universität Paderborn, 2012.","apa":"Schleiter, P. (2012). <i>Attribute-basierte Verschlüsselung</i>. Universität Paderborn.","chicago":"Schleiter, Patrick. <i>Attribute-basierte Verschlüsselung</i>. Universität Paderborn, 2012.","short":"P. Schleiter, Attribute-basierte Verschlüsselung, Universität Paderborn, 2012."},"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"Securing the Financial Cloud","_id":"43"}],"date_created":"2017-10-17T12:42:54Z","type":"bachelorsthesis","department":[{"_id":"64"}]},{"type":"conference","department":[{"_id":"66"},{"_id":"534"},{"_id":"221"}],"date_created":"2018-12-18T12:52:45Z","publication":"Proceedings of the 9th International Conference on Information Systems for Crisis Response and Management (ISCRAM)","citation":{"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: <i>Proceedings of the 9th International Conference on Information Systems for Crisis Response and Management (ISCRAM)</i>. ISCRAM Digital Library; 2012.","mla":"Fischer, Holger Gerhard, and Florian Klompmaker. “Enriching Disaster Control Management Based on Human-Computer Design.” <i>Proceedings of the 9th International Conference on Information Systems for Crisis Response and Management (ISCRAM)</i>, ISCRAM Digital Library, 2012.","chicago":"Fischer, Holger Gerhard, and Florian Klompmaker. “Enriching Disaster Control Management Based on Human-Computer Design.” In <i>Proceedings of the 9th International Conference on Information Systems for Crisis Response and Management (ISCRAM)</i>. ISCRAM Digital Library, 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.","ieee":"H. G. Fischer and F. Klompmaker, “Enriching Disaster Control Management based on Human-Computer Design,” in <i>Proceedings of the 9th International Conference on Information Systems for Crisis Response and Management (ISCRAM)</i>, 2012.","apa":"Fischer, H. G., &#38; Klompmaker, F. (2012). Enriching Disaster Control Management based on Human-Computer Design. In <i>Proceedings of the 9th International Conference on Information Systems for Crisis Response and Management (ISCRAM)</i>. ISCRAM Digital Library."},"user_id":"30457","_id":"6290","language":[{"iso":"eng"}],"publisher":"ISCRAM Digital Library","date_updated":"2022-01-06T07:03:00Z","title":"Enriching Disaster Control Management based on Human-Computer Design","year":"2012","status":"public","author":[{"first_name":"Holger Gerhard","last_name":"Fischer","full_name":"Fischer, Holger Gerhard","id":"30457"},{"full_name":"Klompmaker, Florian","last_name":"Klompmaker","first_name":"Florian"}]},{"user_id":"30457","page":"160-165","language":[{"iso":"eng"}],"_id":"6291","publisher":"German UPA","date_updated":"2022-01-06T07:03:00Z","year":"2012","title":"Der Qualitätsstandard für Usability Engineering der German UPA – Aktueller Stand der Arbeiten","status":"public","author":[{"id":"30457","full_name":"Fischer, Holger Gerhard","first_name":"Holger Gerhard","last_name":"Fischer"},{"last_name":"Geis","first_name":"Thomas","full_name":"Geis, Thomas"},{"full_name":"Kluge, Oliver","last_name":"Kluge","first_name":"Oliver"},{"full_name":"Bogner, Christian","first_name":"Christian","last_name":"Bogner"},{"full_name":"Polkehn, Knut","first_name":"Knut","last_name":"Polkehn"}],"type":"conference","department":[{"_id":"66"},{"_id":"534"},{"_id":"221"}],"date_created":"2018-12-18T12:53:45Z","publication":"Jahresband Usability Professionals","citation":{"mla":"Fischer, Holger Gerhard, et al. “Der Qualitätsstandard Für Usability Engineering Der German UPA – Aktueller Stand Der Arbeiten.” <i>Jahresband Usability Professionals</i>, 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: <i>Jahresband Usability Professionals</i>. German UPA; 2012: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} }","apa":"Fischer, H. G., Geis, T., Kluge, O., Bogner, C., &#38; Polkehn, K. (2012). Der Qualitätsstandard für Usability Engineering der German UPA – Aktueller Stand der Arbeiten. In <i>Jahresband Usability Professionals</i> (pp. 160–165). German UPA.","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 <i>Jahresband Usability Professionals</i>, 2012, pp. 160–165.","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 <i>Jahresband Usability Professionals</i>, 160–65. German UPA, 2012.","short":"H.G. Fischer, T. Geis, O. Kluge, C. Bogner, K. Polkehn, in: Jahresband Usability Professionals, German UPA, 2012, pp. 160–165."}},{"publication":"Proceedings of the 16th European Conference on Software Maintenance and Reengineering (CSMR)","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"}],"date_created":"2017-10-17T12:42:54Z","file":[{"creator":"florida","date_created":"2018-03-15T06:37:13Z","file_name":"630-CSMR2012-PlateniusDettenBecker.pdf","file_size":723739,"access_level":"closed","relation":"main_file","date_updated":"2018-03-15T06:37:13Z","file_id":"1236","success":1,"content_type":"application/pdf"}],"department":[{"_id":"76"}],"type":"conference","author":[{"last_name":"Platenius","first_name":"Marie Christin","full_name":"Platenius, Marie Christin"},{"full_name":"von Detten, Markus","last_name":"von Detten","first_name":"Markus"},{"first_name":"Steffen","last_name":"Becker","full_name":"Becker, Steffen"}],"title":"Archimetrix: Improved Software Architecture Recovery in the Presence of Design Deficiencies","year":"2012","date_updated":"2022-01-06T07:03:00Z","language":[{"iso":"eng"}],"doi":"10.1109/CSMR.2012.33","citation":{"apa":"Platenius, M. C., von Detten, M., &#38; Becker, S. (2012). Archimetrix: Improved Software Architecture Recovery in the Presence of Design Deficiencies. In <i>Proceedings of the 16th European Conference on Software Maintenance and Reengineering (CSMR)</i> (pp. 255–264). <a href=\"https://doi.org/10.1109/CSMR.2012.33\">https://doi.org/10.1109/CSMR.2012.33</a>","ieee":"M. C. Platenius, M. von Detten, and S. Becker, “Archimetrix: Improved Software Architecture Recovery in the Presence of Design Deficiencies,” in <i>Proceedings of the 16th European Conference on Software Maintenance and Reengineering (CSMR)</i>, 2012, pp. 255–264.","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.","chicago":"Platenius, Marie Christin, Markus von Detten, and Steffen Becker. “Archimetrix: Improved Software Architecture Recovery in the Presence of Design Deficiencies.” In <i>Proceedings of the 16th European Conference on Software Maintenance and Reengineering (CSMR)</i>, 255–64, 2012. <a href=\"https://doi.org/10.1109/CSMR.2012.33\">https://doi.org/10.1109/CSMR.2012.33</a>.","mla":"Platenius, Marie Christin, et al. “Archimetrix: Improved Software Architecture Recovery in the Presence of Design Deficiencies.” <i>Proceedings of the 16th European Conference on Software Maintenance and Reengineering (CSMR)</i>, 2012, pp. 255–64, doi:<a href=\"https://doi.org/10.1109/CSMR.2012.33\">10.1109/CSMR.2012.33</a>.","ama":"Platenius MC, von Detten M, Becker S. Archimetrix: Improved Software Architecture Recovery in the Presence of Design Deficiencies. In: <i>Proceedings of the 16th European Conference on Software Maintenance and Reengineering (CSMR)</i>. ; 2012:255-264. doi:<a href=\"https://doi.org/10.1109/CSMR.2012.33\">10.1109/CSMR.2012.33</a>","bibtex":"@inproceedings{Platenius_von Detten_Becker_2012, title={Archimetrix: Improved Software Architecture Recovery in the Presence of Design Deficiencies}, DOI={<a href=\"https://doi.org/10.1109/CSMR.2012.33\">10.1109/CSMR.2012.33</a>}, 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} }"},"file_date_updated":"2018-03-15T06:37:13Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt B1","_id":"9"},{"_id":"3","name":"SFB 901 - Project Area B"}],"status":"public","has_accepted_license":"1","_id":"630","page":"255-264","user_id":"477","ddc":["040"]},{"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"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"9","name":"SFB 901 - Subprojekt B1"},{"name":"SFB 901 - Project Area B","_id":"3"}],"file_date_updated":"2018-03-15T06:36:37Z","publication":"Proceedings of the 19th Working Conference on Reverse Engineering (WCRE)","citation":{"ieee":"M. von Detten, “Archimetrix: A Tool for Deficiency-Aware Software Architecture Reconstruction,” in <i>Proceedings of the 19th Working Conference on Reverse Engineering (WCRE)</i>, 2012, pp. 503–504.","apa":"von Detten, M. (2012). Archimetrix: A Tool for Deficiency-Aware Software Architecture Reconstruction. In <i>Proceedings of the 19th Working Conference on Reverse Engineering (WCRE)</i> (pp. 503–504). <a href=\"https://doi.org/10.1109/WCRE.2012.61\">https://doi.org/10.1109/WCRE.2012.61</a>","chicago":"Detten, Markus von. “Archimetrix: A Tool for Deficiency-Aware Software Architecture Reconstruction.” In <i>Proceedings of the 19th Working Conference on Reverse Engineering (WCRE)</i>, 503–4, 2012. <a href=\"https://doi.org/10.1109/WCRE.2012.61\">https://doi.org/10.1109/WCRE.2012.61</a>.","short":"M. von Detten, in: Proceedings of the 19th Working Conference on Reverse Engineering (WCRE), 2012, pp. 503–504.","mla":"von Detten, Markus. “Archimetrix: A Tool for Deficiency-Aware Software Architecture Reconstruction.” <i>Proceedings of the 19th Working Conference on Reverse Engineering (WCRE)</i>, 2012, pp. 503–04, doi:<a href=\"https://doi.org/10.1109/WCRE.2012.61\">10.1109/WCRE.2012.61</a>.","bibtex":"@inproceedings{von Detten_2012, title={Archimetrix: A Tool for Deficiency-Aware Software Architecture Reconstruction}, DOI={<a href=\"https://doi.org/10.1109/WCRE.2012.61\">10.1109/WCRE.2012.61</a>}, booktitle={Proceedings of the 19th Working Conference on Reverse Engineering (WCRE)}, author={von Detten, Markus}, year={2012}, pages={503–504} }","ama":"von Detten M. Archimetrix: A Tool for Deficiency-Aware Software Architecture Reconstruction. In: <i>Proceedings of the 19th Working Conference on Reverse Engineering (WCRE)</i>. ; 2012:503-504. doi:<a href=\"https://doi.org/10.1109/WCRE.2012.61\">10.1109/WCRE.2012.61</a>"},"type":"conference","file":[{"creator":"florida","date_created":"2018-03-15T06:36:37Z","date_updated":"2018-03-15T06:36:37Z","relation":"main_file","file_size":258563,"access_level":"closed","file_name":"631-WCRE2012-vonDetten.pdf","success":1,"content_type":"application/pdf","file_id":"1235"}],"date_created":"2017-10-17T12:42:55Z","date_updated":"2022-01-06T07:03:01Z","has_accepted_license":"1","year":"2012","status":"public","title":"Archimetrix: A Tool for Deficiency-Aware Software Architecture Reconstruction","author":[{"full_name":"von Detten, Markus","first_name":"Markus","last_name":"von Detten"}],"user_id":"15504","doi":"10.1109/WCRE.2012.61","ddc":["040"],"page":"503 - 504 ","_id":"631"},{"date_created":"2018-12-18T13:15:22Z","type":"report","department":[{"_id":"66"},{"_id":"534"},{"_id":"221"}],"citation":{"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} }","ama":"Behrenbruch K, Bogner C, Fischer HG, et al. <i>German UPA Qualitätsstandard für Usability Engineering</i>.; 2012.","mla":"Behrenbruch, Kay, et al. <i>German UPA Qualitätsstandard für Usability Engineering</i>. 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.","chicago":"Behrenbruch, Kay, Christian Bogner, Holger Gerhard Fischer, Thomas Geis, Claudia Geitner, Rüdiger Heimgärtner, Britta Hofmann, et al. <i>German UPA Qualitätsstandard für Usability Engineering</i>, 2012.","ieee":"K. Behrenbruch <i>et al.</i>, <i>German UPA Qualitätsstandard für Usability Engineering</i>. 2012.","apa":"Behrenbruch, K., Bogner, C., Fischer, H. G., Geis, T., Geitner, C., Heimgärtner, R., … Zimmermann, D. (2012). <i>German UPA Qualitätsstandard für Usability Engineering</i>."},"language":[{"iso":"ger"}],"_id":"6312","user_id":"30457","status":"public","title":"German UPA Qualitätsstandard für Usability Engineering","year":"2012","author":[{"first_name":"Kay","last_name":"Behrenbruch","full_name":"Behrenbruch, Kay"},{"first_name":"Christian","last_name":"Bogner","full_name":"Bogner, Christian"},{"first_name":"Holger Gerhard","last_name":"Fischer","full_name":"Fischer, Holger Gerhard","id":"30457"},{"full_name":"Geis, Thomas","first_name":"Thomas","last_name":"Geis"},{"full_name":"Geitner, Claudia","first_name":"Claudia","last_name":"Geitner"},{"last_name":"Heimgärtner","first_name":"Rüdiger","full_name":"Heimgärtner, Rüdiger"},{"full_name":"Hofmann, Britta","last_name":"Hofmann","first_name":"Britta"},{"last_name":"Hunkirchen","first_name":"Peter","full_name":"Hunkirchen, Peter"},{"full_name":"Kluge, Oliver","first_name":"Oliver","last_name":"Kluge"},{"first_name":"Britta","last_name":"Litzenberg","full_name":"Litzenberg, Britta"},{"full_name":"Molich, Rolf","first_name":"Rolf","last_name":"Molich"},{"full_name":"Polkehn, Knut","last_name":"Polkehn","first_name":"Knut"},{"last_name":"Pysarenko","first_name":"Yuliya","full_name":"Pysarenko, Yuliya"},{"first_name":"Dirk","last_name":"Zimmermann","full_name":"Zimmermann, Dirk"}],"date_updated":"2022-01-06T07:03:01Z"},{"author":[{"full_name":"Kolman, Petr","last_name":"Kolman","first_name":"Petr"},{"id":"20792","full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler"}],"status":"public","title":"Approximate Duality of Multicommodity Multiroute Flows and Cuts: Single Source Case","year":"2012","has_accepted_license":"1","date_updated":"2022-01-06T07:03:01Z","_id":"632","page":"800-810","user_id":"15504","ddc":["040"],"doi":"10.1137/1.9781611973099.64","citation":{"apa":"Kolman, P., &#38; Scheideler, C. (2012). Approximate Duality of Multicommodity Multiroute Flows and Cuts: Single Source Case. In <i>Proceedings of the 23th ACM SIAM Symposium on Discrete Algorithms (SODA)</i> (pp. 800–810). <a href=\"https://doi.org/10.1137/1.9781611973099.64\">https://doi.org/10.1137/1.9781611973099.64</a>","ieee":"P. Kolman and C. Scheideler, “Approximate Duality of Multicommodity Multiroute Flows and Cuts: Single Source Case,” in <i>Proceedings of the 23th ACM SIAM Symposium on Discrete Algorithms (SODA)</i>, 2012, pp. 800–810.","chicago":"Kolman, Petr, and Christian Scheideler. “Approximate Duality of Multicommodity Multiroute Flows and Cuts: Single Source Case.” In <i>Proceedings of the 23th ACM SIAM Symposium on Discrete Algorithms (SODA)</i>, 800–810, 2012. <a href=\"https://doi.org/10.1137/1.9781611973099.64\">https://doi.org/10.1137/1.9781611973099.64</a>.","short":"P. Kolman, C. Scheideler, in: Proceedings of the 23th ACM SIAM Symposium on Discrete Algorithms (SODA), 2012, pp. 800–810.","mla":"Kolman, Petr, and Christian Scheideler. “Approximate Duality of Multicommodity Multiroute Flows and Cuts: Single Source Case.” <i>Proceedings of the 23th ACM SIAM Symposium on Discrete Algorithms (SODA)</i>, 2012, pp. 800–10, doi:<a href=\"https://doi.org/10.1137/1.9781611973099.64\">10.1137/1.9781611973099.64</a>.","ama":"Kolman P, Scheideler C. Approximate Duality of Multicommodity Multiroute Flows and Cuts: Single Source Case. In: <i>Proceedings of the 23th ACM SIAM Symposium on Discrete Algorithms (SODA)</i>. ; 2012:800-810. doi:<a href=\"https://doi.org/10.1137/1.9781611973099.64\">10.1137/1.9781611973099.64</a>","bibtex":"@inproceedings{Kolman_Scheideler_2012, title={Approximate Duality of Multicommodity Multiroute Flows and Cuts: Single Source Case}, DOI={<a href=\"https://doi.org/10.1137/1.9781611973099.64\">10.1137/1.9781611973099.64</a>}, booktitle={Proceedings of the 23th ACM SIAM Symposium on Discrete Algorithms (SODA)}, author={Kolman, Petr and Scheideler, Christian}, year={2012}, pages={800–810} }"},"file_date_updated":"2018-03-15T06:35:58Z","publication":"Proceedings of the 23th ACM SIAM Symposium on Discrete Algorithms (SODA)","project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"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"}],"date_created":"2017-10-17T12:42:55Z","file":[{"file_id":"1234","success":1,"content_type":"application/pdf","relation":"main_file","date_updated":"2018-03-15T06:35:58Z","file_name":"632-SODA2012-Scheideler_01.pdf","file_size":220213,"access_level":"closed","date_created":"2018-03-15T06:35:58Z","creator":"florida"}],"department":[{"_id":"79"}],"type":"conference"}]