--- _id: '658' author: - first_name: Alexander full_name: Schremmer, Alexander last_name: Schremmer citation: ama: Schremmer A. Function Specification Inference Using Craig Interpolation. Universität Paderborn; 2011. apa: Schremmer, A. (2011). Function Specification Inference Using Craig Interpolation. Universität Paderborn. bibtex: '@book{Schremmer_2011, title={Function Specification Inference Using Craig Interpolation}, publisher={Universität Paderborn}, author={Schremmer, Alexander}, year={2011} }' chicago: Schremmer, Alexander. Function Specification Inference Using Craig Interpolation. Universität Paderborn, 2011. ieee: A. Schremmer, Function Specification Inference Using Craig Interpolation. Universität Paderborn, 2011. mla: Schremmer, Alexander. Function Specification Inference Using Craig Interpolation. Universität Paderborn, 2011. short: A. Schremmer, Function Specification Inference Using Craig Interpolation, Universität Paderborn, 2011. date_created: 2017-10-17T12:43:00Z date_updated: 2022-01-06T07:03:12Z department: - _id: '77' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '12' name: SFB 901 - Subprojekt B4 - _id: '3' name: SFB 901 - Project Area B publisher: Universität Paderborn status: public supervisor: - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim title: Function Specification Inference Using Craig Interpolation type: mastersthesis user_id: '477' year: '2011' ... --- _id: '659' author: - first_name: Gennadij full_name: Liske, Gennadij last_name: Liske citation: ama: Liske G. Fault Attacks in Pairing-Based Cryptography. Universität Paderborn; 2011. apa: Liske, G. (2011). Fault attacks in pairing-based cryptography. Universität Paderborn. bibtex: '@book{Liske_2011, title={Fault attacks in pairing-based cryptography}, publisher={Universität Paderborn}, author={Liske, Gennadij}, year={2011} }' chicago: Liske, Gennadij. Fault Attacks in Pairing-Based Cryptography. Universität Paderborn, 2011. ieee: G. Liske, Fault attacks in pairing-based cryptography. Universität Paderborn, 2011. mla: Liske, Gennadij. Fault Attacks in Pairing-Based Cryptography. Universität Paderborn, 2011. short: G. Liske, Fault Attacks in Pairing-Based Cryptography, Universität Paderborn, 2011. date_created: 2017-10-17T12:43:00Z date_updated: 2022-01-06T07:03:13Z ddc: - '040' department: - _id: '64' file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-14T13:47:44Z date_updated: 2018-03-14T13:47:44Z file_id: '1218' file_name: 659-MA_Fault_attacks_in_pairing-based_cryptography_01.pdf file_size: 1795920 relation: main_file success: 1 file_date_updated: 2018-03-14T13:47:44Z has_accepted_license: '1' project: - _id: '1' name: SFB 901 - _id: '13' name: SFB 901 - Subprojekt C1 - _id: '4' name: SFB 901 - Project Area C - _id: '43' name: Securing the Financial Cloud publisher: Universität Paderborn status: public supervisor: - first_name: Johannes full_name: Blömer, Johannes id: '23' last_name: Blömer title: Fault attacks in pairing-based cryptography type: mastersthesis user_id: '25078' year: '2011' ... --- _id: '660' author: - first_name: Manuel full_name: Peuster, Manuel id: '13271' last_name: Peuster citation: ama: Peuster M. Defining and Deploying Complex Applicances in Multi-Site Cloud Environments. Universität Paderborn; 2011. apa: Peuster, M. (2011). Defining and Deploying Complex Applicances in Multi-Site Cloud Environments. Universität Paderborn. bibtex: '@book{Peuster_2011, title={Defining and Deploying Complex Applicances in Multi-Site Cloud Environments}, publisher={Universität Paderborn}, author={Peuster, Manuel}, year={2011} }' chicago: Peuster, Manuel. Defining and Deploying Complex Applicances in Multi-Site Cloud Environments. Universität Paderborn, 2011. ieee: M. Peuster, Defining and Deploying Complex Applicances in Multi-Site Cloud Environments. Universität Paderborn, 2011. mla: Peuster, Manuel. Defining and Deploying Complex Applicances in Multi-Site Cloud Environments. Universität Paderborn, 2011. short: M. Peuster, Defining and Deploying Complex Applicances in Multi-Site Cloud Environments, Universität Paderborn, 2011. date_created: 2017-10-17T12:43:00Z date_updated: 2022-01-06T07:03:13Z department: - _id: '75' project: - _id: '1' name: SFB 901 - _id: '6' name: SFB 901 - Subprojekt A2 - _id: '2' name: SFB 901 - Project Area A publisher: Universität Paderborn status: public title: Defining and Deploying Complex Applicances in Multi-Site Cloud Environments type: bachelorsthesis user_id: '15504' year: '2011' ... --- _id: '661' author: - first_name: Svetlana full_name: Arifulina, Svetlana last_name: Arifulina citation: ama: Arifulina S. Coverage Criteria for Testing DMM Specifications. Universität Paderborn; 2011. apa: Arifulina, S. (2011). Coverage Criteria for Testing DMM Specifications. Universität Paderborn. bibtex: '@book{Arifulina_2011, title={Coverage Criteria for Testing DMM Specifications}, publisher={Universität Paderborn}, author={Arifulina, Svetlana}, year={2011} }' chicago: Arifulina, Svetlana. Coverage Criteria for Testing DMM Specifications. Universität Paderborn, 2011. ieee: S. Arifulina, Coverage Criteria for Testing DMM Specifications. Universität Paderborn, 2011. mla: Arifulina, Svetlana. Coverage Criteria for Testing DMM Specifications. Universität Paderborn, 2011. short: S. Arifulina, Coverage Criteria for Testing DMM Specifications, Universität Paderborn, 2011. date_created: 2017-10-17T12:43:00Z date_updated: 2022-01-06T07:03:13Z department: - _id: '66' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '9' name: SFB 901 - Subprojekt B1 - _id: '3' name: SFB 901 - Project Area B publisher: Universität Paderborn status: public supervisor: - first_name: Gregor full_name: Engels, Gregor id: '107' last_name: Engels title: Coverage Criteria for Testing DMM Specifications type: mastersthesis user_id: '477' year: '2011' ... --- _id: '662' abstract: - lang: eng text: We present Corona, a deterministic self-stabilizing algorithm for skip list construction in structured overlay networks. Corona operates in the low-atomicity message-passing asynchronous system model. Corona requires constant process memory space for its operation and, therefore, scales well. We prove the general necessary conditions limiting the initial states from which a self-stabilizing structured overlay network in message-passing system can be constructed. The conditions require that initial state information has to form a weakly connected graph and it should only contain identiers that are present in the system. We formally describe Corona and rigorously prove that it stabilizes from an arbitrary initial state subject to the necessary conditions. We extend Corona to construct a skip graph. author: - first_name: Mikhail full_name: Nesterenko, Mikhail last_name: Nesterenko - first_name: Rizal full_name: Mohd, Rizal last_name: Mohd - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: 'Nesterenko M, Mohd R, Scheideler C. Corona: A Stabilizing Deterministic Message-Passing Skip List. In: Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS). LNCS. ; 2011:356--370. doi:10.1007/978-3-642-24550-3_27' apa: 'Nesterenko, M., Mohd, R., & Scheideler, C. (2011). Corona: A Stabilizing Deterministic Message-Passing Skip List. In Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) (pp. 356--370). https://doi.org/10.1007/978-3-642-24550-3_27' bibtex: '@inproceedings{Nesterenko_Mohd_Scheideler_2011, series={LNCS}, title={Corona: A Stabilizing Deterministic Message-Passing Skip List}, DOI={10.1007/978-3-642-24550-3_27}, booktitle={Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)}, author={Nesterenko, Mikhail and Mohd, Rizal and Scheideler, Christian}, year={2011}, pages={356--370}, collection={LNCS} }' chicago: 'Nesterenko, Mikhail, Rizal Mohd, and Christian Scheideler. “Corona: A Stabilizing Deterministic Message-Passing Skip List.” In Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 356--370. LNCS, 2011. https://doi.org/10.1007/978-3-642-24550-3_27.' ieee: 'M. Nesterenko, R. Mohd, and C. Scheideler, “Corona: A Stabilizing Deterministic Message-Passing Skip List,” in Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 2011, pp. 356--370.' mla: 'Nesterenko, Mikhail, et al. “Corona: A Stabilizing Deterministic Message-Passing Skip List.” Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 2011, pp. 356--370, doi:10.1007/978-3-642-24550-3_27.' short: 'M. Nesterenko, R. Mohd, C. Scheideler, in: Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 2011, pp. 356--370.' date_created: 2017-10-17T12:43:01Z date_updated: 2022-01-06T07:03:13Z ddc: - '040' department: - _id: '79' doi: 10.1007/978-3-642-24550-3_27 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-14T13:46:48Z date_updated: 2018-03-14T13:46:48Z file_id: '1217' file_name: 662-SSS2011-Corona-Scheideler.pdf file_size: 305543 relation: main_file success: 1 file_date_updated: 2018-03-14T13:46:48Z has_accepted_license: '1' page: 356--370 project: - _id: '1' name: SFB 901 - _id: '5' name: SFB 901 - Subprojekt A1 - _id: '2' name: SFB 901 - Project Area A publication: Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) series_title: LNCS status: public title: 'Corona: A Stabilizing Deterministic Message-Passing Skip List' type: conference user_id: '15504' year: '2011' ... --- _id: '663' author: - first_name: Kamil full_name: Swierkot, Kamil last_name: Swierkot citation: ama: Swierkot K. Complexity Classes for Local Computation. Universität Paderborn; 2011. apa: Swierkot, K. (2011). Complexity Classes for Local Computation. Universität Paderborn. bibtex: '@book{Swierkot_2011, title={Complexity Classes for Local Computation}, publisher={Universität Paderborn}, author={Swierkot, Kamil}, year={2011} }' chicago: Swierkot, Kamil. Complexity Classes for Local Computation. Universität Paderborn, 2011. ieee: K. Swierkot, Complexity Classes for Local Computation. Universität Paderborn, 2011. mla: Swierkot, Kamil. Complexity Classes for Local Computation. Universität Paderborn, 2011. short: K. Swierkot, Complexity Classes for Local Computation, Universität Paderborn, 2011. date_created: 2017-10-17T12:43:01Z date_updated: 2022-01-06T07:03:13Z department: - _id: '63' language: - iso: eng 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 status: public supervisor: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide title: Complexity Classes for Local Computation type: mastersthesis user_id: '477' year: '2011' ... --- _id: '664' abstract: - lang: eng text: 'Web Computing is a variant of parallel computing where the idle times of PCs donated by worldwide distributed users are employed to execute parallel programs. The PUB-Web library developed by us supports this kind of usage of computing resources. A major problem for the efficient execution of such parallel programs is load balancing. In the Web Computing context, this problem becomes more difficult because of the dynamic behavior of the underlying "parallel computer": the set of available processors (donated PCs) as well as their availability (idle times) change over time in an unpredictable fashion.In this paper, we experimentally evaluate and compare load balancing algorithms in this scenario, namely a variant of the well-established Work Stealing algorithm and strategies based on a heterogeneous version of distributed hash-tables (DHHTs) introduced recently. In order to run a meaningful experimental evaluation, we employ, in addition to our Web Computing library PUB-Web, realistic data sets for the job input streams and for the dynamics of the availability of the resources.Our experimental evaluations suggest that Work Stealing is the better strategy if the number of processes ready to run matches the number of available processors. But a suitable variant of DHHTs outperforms Work Stealing if there are significantly more processes ready to run than available processors.' author: - first_name: Joachim full_name: Gehweiler, Joachim last_name: Gehweiler - first_name: Peter full_name: Kling, Peter last_name: Kling - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: 'Gehweiler J, Kling P, Meyer auf der Heide F. An Experimental Comparison of Load Balancing Strategies in a Web Computing Environment. In: Proceedings of the 9th International Conference on Parallel Processing and Applied Mathematics (PPAM). LNCS. ; 2011:31--40. doi:10.1007/978-3-642-31500-8_4' apa: Gehweiler, J., Kling, P., & Meyer auf der Heide, F. (2011). An Experimental Comparison of Load Balancing Strategies in a Web Computing Environment. In Proceedings of the 9th International Conference on Parallel Processing and Applied Mathematics (PPAM) (pp. 31--40). https://doi.org/10.1007/978-3-642-31500-8_4 bibtex: '@inproceedings{Gehweiler_Kling_Meyer auf der Heide_2011, series={LNCS}, title={An Experimental Comparison of Load Balancing Strategies in a Web Computing Environment}, DOI={10.1007/978-3-642-31500-8_4}, booktitle={Proceedings of the 9th International Conference on Parallel Processing and Applied Mathematics (PPAM)}, author={Gehweiler, Joachim and Kling, Peter and Meyer auf der Heide, Friedhelm}, year={2011}, pages={31--40}, collection={LNCS} }' chicago: Gehweiler, Joachim, Peter Kling, and Friedhelm Meyer auf der Heide. “An Experimental Comparison of Load Balancing Strategies in a Web Computing Environment.” In Proceedings of the 9th International Conference on Parallel Processing and Applied Mathematics (PPAM), 31--40. LNCS, 2011. https://doi.org/10.1007/978-3-642-31500-8_4. ieee: J. Gehweiler, P. Kling, and F. Meyer auf der Heide, “An Experimental Comparison of Load Balancing Strategies in a Web Computing Environment,” in Proceedings of the 9th International Conference on Parallel Processing and Applied Mathematics (PPAM), 2011, pp. 31--40. mla: Gehweiler, Joachim, et al. “An Experimental Comparison of Load Balancing Strategies in a Web Computing Environment.” Proceedings of the 9th International Conference on Parallel Processing and Applied Mathematics (PPAM), 2011, pp. 31--40, doi:10.1007/978-3-642-31500-8_4. short: 'J. Gehweiler, P. Kling, F. Meyer auf der Heide, in: Proceedings of the 9th International Conference on Parallel Processing and Applied Mathematics (PPAM), 2011, pp. 31--40.' date_created: 2017-10-17T12:43:01Z date_updated: 2022-01-06T07:03:14Z ddc: - '040' department: - _id: '63' doi: 10.1007/978-3-642-31500-8_4 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-14T13:45:57Z date_updated: 2018-03-14T13:45:57Z file_id: '1216' file_name: 664-PPAM11GKM_01.pdf file_size: 333335 relation: main_file success: 1 file_date_updated: 2018-03-14T13:45:57Z has_accepted_license: '1' page: 31--40 project: - _id: '1' name: SFB 901 - _id: '16' name: SFB 901 - Subprojekt C4 - _id: '14' name: SFB 901 - Subproject C2 - _id: '4' name: SFB 901 - Project Area C publication: Proceedings of the 9th International Conference on Parallel Processing and Applied Mathematics (PPAM) series_title: LNCS status: public title: An Experimental Comparison of Load Balancing Strategies in a Web Computing Environment type: conference user_id: '15504' year: '2011' ... --- _id: '665' author: - first_name: Philip full_name: Wette, Philip last_name: Wette citation: ama: Wette P. Adaptives Loadbalancing für strukturierte Peer-to-Peer-Netzwerke am Beispiel von Chord. Universität Paderborn; 2011. apa: Wette, P. (2011). Adaptives Loadbalancing für strukturierte Peer-to-Peer-Netzwerke am Beispiel von Chord. Universität Paderborn. bibtex: '@book{Wette_2011, title={Adaptives Loadbalancing für strukturierte Peer-to-Peer-Netzwerke am Beispiel von Chord}, publisher={Universität Paderborn}, author={Wette, Philip}, year={2011} }' chicago: Wette, Philip. Adaptives Loadbalancing für strukturierte Peer-to-Peer-Netzwerke am Beispiel von Chord. Universität Paderborn, 2011. ieee: P. Wette, Adaptives Loadbalancing für strukturierte Peer-to-Peer-Netzwerke am Beispiel von Chord. Universität Paderborn, 2011. mla: Wette, Philip. Adaptives Loadbalancing für strukturierte Peer-to-Peer-Netzwerke am Beispiel von Chord. Universität Paderborn, 2011. short: P. Wette, Adaptives Loadbalancing für strukturierte Peer-to-Peer-Netzwerke am Beispiel von Chord, Universität Paderborn, 2011. date_created: 2017-10-17T12:43:01Z date_updated: 2022-01-06T07:03:14Z department: - _id: '79' language: - iso: ger 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 status: public supervisor: - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler title: Adaptives Loadbalancing für strukturierte Peer-to-Peer-Netzwerke am Beispiel von Chord type: mastersthesis user_id: '477' year: '2011' ... --- _id: '666' abstract: - lang: eng text: Reconfigurable systems on chip are increasingly deployed in security and safety critical contexts. When downloading and configuring new hardware functions, we want to make sure that modules adhere to certain security specifications and do not, for example, contain hardware Trojans. As a possible approach to achieving hardware security we propose and demonstrate the concept of proof-carrying hardware, a concept inspired by previous work on proof-carrying code techniques in the software domain. In this paper, we discuss the hardware trust and threat models behind proof-carrying hardware and then present our experimental setup. We detail the employed open-source tool chain for the runtime verification of combinational equivalence and our bitstream format for an abstract FPGA architecture that allows us to experimentally validate the feasibility of our approach. author: - first_name: Stephanie full_name: Drzevitzky, Stephanie last_name: Drzevitzky - first_name: Marco full_name: Platzner, Marco id: '398' last_name: Platzner citation: ama: 'Drzevitzky S, Platzner M. Achieving Hardware Security for Reconfigurable Systems on Chip by a Proof-Carrying Code Approach. In: Proceedings of the 6th International Workshop on Reconfigurable Communication-Centric Systems-on-Chip (ReCoSoC). ; 2011:58-65. doi:10.1109/ReCoSoC.2011.5981499' apa: Drzevitzky, S., & Platzner, M. (2011). Achieving Hardware Security for Reconfigurable Systems on Chip by a Proof-Carrying Code Approach. In Proceedings of the 6th International Workshop on Reconfigurable Communication-centric Systems-on-Chip (ReCoSoC) (pp. 58–65). https://doi.org/10.1109/ReCoSoC.2011.5981499 bibtex: '@inproceedings{Drzevitzky_Platzner_2011, title={Achieving Hardware Security for Reconfigurable Systems on Chip by a Proof-Carrying Code Approach}, DOI={10.1109/ReCoSoC.2011.5981499}, booktitle={Proceedings of the 6th International Workshop on Reconfigurable Communication-centric Systems-on-Chip (ReCoSoC)}, author={Drzevitzky, Stephanie and Platzner, Marco}, year={2011}, pages={58–65} }' chicago: Drzevitzky, Stephanie, and Marco Platzner. “Achieving Hardware Security for Reconfigurable Systems on Chip by a Proof-Carrying Code Approach.” In Proceedings of the 6th International Workshop on Reconfigurable Communication-Centric Systems-on-Chip (ReCoSoC), 58–65, 2011. https://doi.org/10.1109/ReCoSoC.2011.5981499. ieee: S. Drzevitzky and M. Platzner, “Achieving Hardware Security for Reconfigurable Systems on Chip by a Proof-Carrying Code Approach,” in Proceedings of the 6th International Workshop on Reconfigurable Communication-centric Systems-on-Chip (ReCoSoC), 2011, pp. 58–65. mla: Drzevitzky, Stephanie, and Marco Platzner. “Achieving Hardware Security for Reconfigurable Systems on Chip by a Proof-Carrying Code Approach.” Proceedings of the 6th International Workshop on Reconfigurable Communication-Centric Systems-on-Chip (ReCoSoC), 2011, pp. 58–65, doi:10.1109/ReCoSoC.2011.5981499. short: 'S. Drzevitzky, M. Platzner, in: Proceedings of the 6th International Workshop on Reconfigurable Communication-Centric Systems-on-Chip (ReCoSoC), 2011, pp. 58–65.' date_created: 2017-10-17T12:43:01Z date_updated: 2022-01-06T07:03:14Z ddc: - '040' department: - _id: '78' doi: 10.1109/ReCoSoC.2011.5981499 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-14T13:40:48Z date_updated: 2018-03-14T13:40:48Z file_id: '1214' file_name: 666-drzevitzky11_recosoc.pdf file_size: 666039 relation: main_file success: 1 file_date_updated: 2018-03-14T13:40:48Z has_accepted_license: '1' language: - iso: eng page: 58-65 project: - _id: '1' name: SFB 901 - _id: '12' name: SFB 901 - Subprojekt B4 - _id: '3' name: SFB 901 - Project Area B publication: Proceedings of the 6th International Workshop on Reconfigurable Communication-centric Systems-on-Chip (ReCoSoC) status: public title: Achieving Hardware Security for Reconfigurable Systems on Chip by a Proof-Carrying Code Approach type: conference user_id: '477' year: '2011' ... --- _id: '667' citation: ama: Meyer auf der Heide F, Rajaraman R, eds. 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures.; 2011. doi:10.1145/1989493 apa: Meyer auf der Heide, F., & Rajaraman, R. (Eds.). (2011). 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures. https://doi.org/10.1145/1989493 bibtex: '@book{Meyer auf der Heide_Rajaraman_2011, title={23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures}, DOI={10.1145/1989493}, year={2011} }' chicago: Meyer auf der Heide, Friedhelm, and Rajmohan Rajaraman, eds. 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2011. https://doi.org/10.1145/1989493. ieee: F. Meyer auf der Heide and R. Rajaraman, Eds., 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures. 2011. mla: Meyer auf der Heide, Friedhelm, and Rajmohan Rajaraman, editors. 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures. 2011, doi:10.1145/1989493. short: F. Meyer auf der Heide, R. Rajaraman, eds., 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2011. date_created: 2017-10-17T12:43:02Z date_updated: 2022-01-06T07:03:14Z department: - _id: '63' doi: 10.1145/1989493 editor: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: 'Rajmohan ' full_name: 'Rajaraman, Rajmohan ' last_name: Rajaraman language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '5' name: SFB 901 - Subprojekt A1 - _id: '2' name: SFB 901 - Project Area A status: public title: 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures type: conference_editor user_id: '477' year: '2011' ...