--- _id: '5760' author: - first_name: Enes full_name: Yigitbas, Enes id: '8447' last_name: Yigitbas orcid: 0000-0002-5967-833X citation: ama: Yigitbas E. Entwicklung Eines Monitoring- Und Adaptionskonzeptes Für Geschäftsprozesse in Service-Orientierten Systemen.; 2012. apa: Yigitbas, E. (2012). Entwicklung eines Monitoring- und Adaptionskonzeptes für Geschäftsprozesse in service-orientierten Systemen. bibtex: '@book{Yigitbas_2012, title={Entwicklung eines Monitoring- und Adaptionskonzeptes für Geschäftsprozesse in service-orientierten Systemen}, author={Yigitbas, Enes}, year={2012} }' chicago: Yigitbas, Enes. Entwicklung Eines Monitoring- Und Adaptionskonzeptes Für Geschäftsprozesse in Service-Orientierten Systemen, 2012. ieee: E. Yigitbas, Entwicklung eines Monitoring- und Adaptionskonzeptes für Geschäftsprozesse in service-orientierten Systemen. 2012. mla: Yigitbas, Enes. Entwicklung Eines Monitoring- Und Adaptionskonzeptes Für Geschäftsprozesse in Service-Orientierten Systemen. 2012. short: E. Yigitbas, Entwicklung Eines Monitoring- Und Adaptionskonzeptes Für Geschäftsprozesse in Service-Orientierten Systemen, 2012. date_created: 2018-11-19T15:29:59Z date_updated: 2022-01-06T07:02:38Z department: - _id: '66' language: - iso: eng status: public title: Entwicklung eines Monitoring- und Adaptionskonzeptes für Geschäftsprozesse in service-orientierten Systemen type: mastersthesis user_id: '8447' year: '2012' ... --- _id: '577' abstract: - lang: eng text: 'SSS is an international forum for researchers and practitioners in the design and development of distributed systems with self-properties: (classical) self-stabilizing, self-configuring, self-organizing, self-managing, self-repairing, self-healing, self-optimizing, self-adaptive, and self-protecting. Research in distributed systems is now at a crucialpoint in its evolution, marked by the importance of dynamic systems such as peer-to-peer networks, large-scale wireless sensor networks, mobile ad hoc networks, cloud computing, robotic networks, etc. Moreover, new applications such as grid and web services, banking and e-commerce, e-health and robotics, aerospace and avionics, automotive, industrial process control, etc. have joined the traditional applications of distributed systems. The theory of self-stabilization has been enriched in the last 30 years by high quality research contributions in the areas of algorithmic techniques, formal methodologies, model theoretic issues, and composition techniques. All these areas are essential to the understanding and maintenance of self-properties in fault-tolerant distributed systems.' citation: ama: Richa AW, Scheideler C, eds. Stabilization, Safety, and Security of Distributed Systems.; 2012. doi:10.1007/978-3-642-33536-5 apa: Richa, A. W., & Scheideler, C. (Eds.). (2012). Stabilization, Safety, and Security of Distributed Systems. Presented at the Stabilization, Safety, and Security of Distributed Systems (SSS), Paderborn, Germany. https://doi.org/10.1007/978-3-642-33536-5 bibtex: '@book{Richa_Scheideler_2012, title={Stabilization, Safety, and Security of Distributed Systems}, DOI={10.1007/978-3-642-33536-5}, year={2012} }' chicago: Richa, Andrea W., and Christian Scheideler, eds. Stabilization, Safety, and Security of Distributed Systems, 2012. https://doi.org/10.1007/978-3-642-33536-5. ieee: A. W. Richa and C. Scheideler, Eds., Stabilization, Safety, and Security of Distributed Systems. 2012. mla: Richa, Andrea W., and Christian Scheideler, editors. Stabilization, Safety, and Security of Distributed Systems. 2012, doi:10.1007/978-3-642-33536-5. short: A.W. Richa, C. Scheideler, eds., Stabilization, Safety, and Security of Distributed Systems, 2012. conference: end_date: 2012-10-04 location: Paderborn, Germany name: Stabilization, Safety, and Security of Distributed Systems (SSS) start_date: 2012-10-01 date_created: 2017-10-17T12:42:44Z date_updated: 2022-01-06T07:02:39Z ddc: - '040' department: - _id: '79' doi: 10.1007/978-3-642-33536-5 editor: - first_name: Andrea W. full_name: Richa, Andrea W. last_name: Richa - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-21T13:09:19Z date_updated: 2018-03-21T13:09:19Z file_id: '1569' file_name: 577-SSS2012Richa-Scheideler.pdf file_size: 169564 relation: main_file success: 1 file_date_updated: 2018-03-21T13:09:19Z 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 status: public title: Stabilization, Safety, and Security of Distributed Systems type: conference_editor user_id: '15504' year: '2012' ... --- _id: '578' abstract: - lang: eng text: 'This paper analyzes the stability of capital tax harmonization agreements in a stylized model where countries have formed coalitions which set a common tax rate in order to avoid the inefficient fully non-cooperative Nash equilibrium. In particular, for a given coalition structure we study to what extend the stability of tax agreements is affected by the coalitions that have formed. In our set-up, countries are symmetric, but coalitions can be of arbitrary size. We analyze stability by means of a repeated game setting employing simple trigger strategies and we allow a sub-coalition to deviate from the coalitional equilibrium. For a given form of punishment we are able to rank the stability of different coalition structures as long as the size of the largest coalition does not change. Our main results are: (1) singleton regions have the largest incentives to deviate, (2) the stability of cooperation depends on the degree of cooperative behavior ex-ante.' author: - first_name: Sonja full_name: Brangewitz, Sonja last_name: Brangewitz - first_name: Sarah full_name: Brockhoff, Sarah last_name: Brockhoff citation: ama: Brangewitz S, Brockhoff S. Stability of Coalitional Equilibria within Repeated Tax Competition. Universität Paderborn; 2012. apa: Brangewitz, S., & Brockhoff, S. (2012). Stability of Coalitional Equilibria within Repeated Tax Competition. Universität Paderborn. bibtex: '@book{Brangewitz_Brockhoff_2012, title={Stability of Coalitional Equilibria within Repeated Tax Competition}, publisher={Universität Paderborn}, author={Brangewitz, Sonja and Brockhoff, Sarah}, year={2012} }' chicago: Brangewitz, Sonja, and Sarah Brockhoff. Stability of Coalitional Equilibria within Repeated Tax Competition. Universität Paderborn, 2012. ieee: S. Brangewitz and S. Brockhoff, Stability of Coalitional Equilibria within Repeated Tax Competition. Universität Paderborn, 2012. mla: Brangewitz, Sonja, and Sarah Brockhoff. Stability of Coalitional Equilibria within Repeated Tax Competition. Universität Paderborn, 2012. short: S. Brangewitz, S. Brockhoff, Stability of Coalitional Equilibria within Repeated Tax Competition, Universität Paderborn, 2012. date_created: 2017-10-17T12:42:44Z date_updated: 2022-01-06T07:02:40Z ddc: - '040' department: - _id: '205' file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T09:08:24Z date_updated: 2018-03-15T09:08:24Z file_id: '1267' file_name: 578-WP48Brangewitz.pdf file_size: 876927 relation: main_file success: 1 file_date_updated: 2018-03-15T09:08:24Z has_accepted_license: '1' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '7' name: SFB 901 - Subprojekt A3 - _id: '2' name: SFB 901 - Project Area A publisher: Universität Paderborn status: public title: Stability of Coalitional Equilibria within Repeated Tax Competition type: report user_id: '477' year: '2012' ... --- _id: '579' abstract: - lang: eng text: A left-to-right maximum in a sequence of n numbers s_1, …, s_n is a number that is strictly larger than all preceding numbers. In this article we present a smoothed analysis of the number of left-to-right maxima in the presence of additive random noise. We show that for every sequence of n numbers s_i ∈ [0,1] that are perturbed by uniform noise from the interval [-ε,ε], the expected number of left-to-right maxima is Θ(&sqrt;n/ε + log n) for ε>1/n. For Gaussian noise with standard deviation σ we obtain a bound of O((log3/2 n)/σ + log n).We apply our results to the analysis of the smoothed height of binary search trees and the smoothed number of comparisons in the quicksort algorithm and prove bounds of Θ(&sqrt;n/ε + log n) and Θ(n/ε+1&sqrt;n/ε + n log n), respectively, for uniform random noise from the interval [-ε,ε]. Our results can also be applied to bound the smoothed number of points on a convex hull of points in the two-dimensional plane and to smoothed motion complexity, a concept we describe in this article. We bound how often one needs to update a data structure storing the smallest axis-aligned box enclosing a set of points moving in d-dimensional space. author: - first_name: Valentina full_name: Damerow, Valentina last_name: Damerow - first_name: Bodo full_name: Manthey, Bodo last_name: Manthey - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Harald full_name: Räcke, Harald last_name: Räcke - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Christian full_name: Sohler, Christian last_name: Sohler - first_name: Till full_name: Tantau, Till last_name: Tantau citation: ama: Damerow V, Manthey B, Meyer auf der Heide F, et al. Smoothed analysis of left-to-right maxima with applications. Transactions on Algorithms. 2012;(3):30. doi:10.1145/2229163.2229174 apa: Damerow, V., Manthey, B., Meyer auf der Heide, F., Räcke, H., Scheideler, C., Sohler, C., & Tantau, T. (2012). Smoothed analysis of left-to-right maxima with applications. Transactions on Algorithms, (3), 30. https://doi.org/10.1145/2229163.2229174 bibtex: '@article{Damerow_Manthey_Meyer auf der Heide_Räcke_Scheideler_Sohler_Tantau_2012, title={Smoothed analysis of left-to-right maxima with applications}, DOI={10.1145/2229163.2229174}, number={3}, journal={Transactions on Algorithms}, publisher={ACM}, author={Damerow, Valentina and Manthey, Bodo and Meyer auf der Heide, Friedhelm and Räcke, Harald and Scheideler, Christian and Sohler, Christian and Tantau, Till}, year={2012}, pages={30} }' chicago: 'Damerow, Valentina, Bodo Manthey, Friedhelm Meyer auf der Heide, Harald Räcke, Christian Scheideler, Christian Sohler, and Till Tantau. “Smoothed Analysis of Left-to-Right Maxima with Applications.” Transactions on Algorithms, no. 3 (2012): 30. https://doi.org/10.1145/2229163.2229174.' ieee: V. Damerow et al., “Smoothed analysis of left-to-right maxima with applications,” Transactions on Algorithms, no. 3, p. 30, 2012. mla: Damerow, Valentina, et al. “Smoothed Analysis of Left-to-Right Maxima with Applications.” Transactions on Algorithms, no. 3, ACM, 2012, p. 30, doi:10.1145/2229163.2229174. short: V. Damerow, B. Manthey, F. Meyer auf der Heide, H. Räcke, C. Scheideler, C. Sohler, T. Tantau, Transactions on Algorithms (2012) 30. date_created: 2017-10-17T12:42:45Z date_updated: 2022-01-06T07:02:41Z ddc: - '040' department: - _id: '79' - _id: '63' doi: 10.1145/2229163.2229174 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T09:04:58Z date_updated: 2018-03-15T09:04:58Z file_id: '1266' file_name: 579-a30-damerow.pdf file_size: 329282 relation: main_file success: 1 file_date_updated: 2018-03-15T09:04:58Z has_accepted_license: '1' issue: '3' page: '30' project: - _id: '1' name: SFB 901 - _id: '5' name: SFB 901 - Subprojekt A1 - _id: '2' name: SFB 901 - Project Area A publication: Transactions on Algorithms publisher: ACM status: public title: Smoothed analysis of left-to-right maxima with applications type: journal_article user_id: '477' year: '2012' ... --- _id: '580' abstract: - lang: eng text: We present and study a new model for energy-aware and profit-oriented scheduling on a single processor.The processor features dynamic speed scaling as well as suspension to a sleep mode.Jobs arrive over time, are preemptable, and have different sizes, values, and deadlines.On the arrival of a new job, the scheduler may either accept or reject the job.Accepted jobs need a certain energy investment to be finished in time, while rejected jobs cause costs equal to their values.Here, power consumption at speed $s$ is given by $P(s)=s^{\alpha}+\beta$ and the energy investment is power integrated over time.Additionally, the scheduler may decide to suspend the processor to a sleep mode in which no energy is consumed, though awaking entails fixed transition costs $\gamma$.The objective is to minimize the total value of rejected jobs plus the total energy.Our model combines aspects from advanced energy conservation techniques (namely speed scaling and sleep states) and profit-oriented scheduling models.We show that \emph{rejection-oblivious} schedulers (whose rejection decisions are not based on former decisions) have – in contrast to the model without sleep states – an unbounded competitive ratio.It turns out that the jobs' value densities (the ratio between a job's value and its work) are crucial for the performance of such schedulers.We give an algorithm whose competitiveness nearly matches the lower bound w.r.t\text{.} the maximum value density.If the maximum value density is not too large, the competitiveness becomes $\alpha^{\alpha}+2e\alpha$.Also, we show that it suffices to restrict the value density of low-value jobs only.Using a technique from \cite{Chan:2010} we transfer our results to processors with a fixed maximum speed. author: - first_name: Andreas full_name: Cord-Landwehr, Andreas last_name: Cord-Landwehr - first_name: Peter full_name: Kling, Peter last_name: Kling - first_name: Fredrik full_name: Mallmann Trenn, Fredrik last_name: Mallmann Trenn citation: ama: 'Cord-Landwehr A, Kling P, Mallmann Trenn F. Slow Down & Sleep for Profit in Online Deadline Scheduling. In: Even G, Rawitz D, eds. Proceedings of the 1st Mediterranean Conference on Algorithms (MedAlg). LNCS. ; 2012:218-231. doi:10.1007/978-3-642-34862-4_17' apa: Cord-Landwehr, A., Kling, P., & Mallmann Trenn, F. (2012). Slow Down & Sleep for Profit in Online Deadline Scheduling. In G. Even & D. Rawitz (Eds.), Proceedings of the 1st Mediterranean Conference on Algorithms (MedAlg) (pp. 218–231). https://doi.org/10.1007/978-3-642-34862-4_17 bibtex: '@inproceedings{Cord-Landwehr_Kling_Mallmann Trenn_2012, series={LNCS}, title={Slow Down & Sleep for Profit in Online Deadline Scheduling}, DOI={10.1007/978-3-642-34862-4_17}, booktitle={Proceedings of the 1st Mediterranean Conference on Algorithms (MedAlg)}, author={Cord-Landwehr, Andreas and Kling, Peter and Mallmann Trenn, Fredrik}, editor={Even, Guy and Rawitz, DrorEditors}, year={2012}, pages={218–231}, collection={LNCS} }' chicago: Cord-Landwehr, Andreas, Peter Kling, and Fredrik Mallmann Trenn. “Slow Down & Sleep for Profit in Online Deadline Scheduling.” In Proceedings of the 1st Mediterranean Conference on Algorithms (MedAlg), edited by Guy Even and Dror Rawitz, 218–31. LNCS, 2012. https://doi.org/10.1007/978-3-642-34862-4_17. ieee: A. Cord-Landwehr, P. Kling, and F. Mallmann Trenn, “Slow Down & Sleep for Profit in Online Deadline Scheduling,” in Proceedings of the 1st Mediterranean Conference on Algorithms (MedAlg), 2012, pp. 218–231. mla: Cord-Landwehr, Andreas, et al. “Slow Down & Sleep for Profit in Online Deadline Scheduling.” Proceedings of the 1st Mediterranean Conference on Algorithms (MedAlg), edited by Guy Even and Dror Rawitz, 2012, pp. 218–31, doi:10.1007/978-3-642-34862-4_17. short: 'A. Cord-Landwehr, P. Kling, F. Mallmann Trenn, in: G. Even, D. Rawitz (Eds.), Proceedings of the 1st Mediterranean Conference on Algorithms (MedAlg), 2012, pp. 218–231.' date_created: 2017-10-17T12:42:45Z date_updated: 2022-01-06T07:02:42Z ddc: - '040' department: - _id: '63' doi: 10.1007/978-3-642-34862-4_17 editor: - first_name: Guy full_name: Even, Guy last_name: Even - first_name: Dror full_name: Rawitz, Dror last_name: Rawitz file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T09:03:39Z date_updated: 2018-03-15T09:03:39Z file_id: '1265' file_name: 580-P._Kling__F._Mallmann-Trenn__A._Cord-Landwehr_-_Slow_Down___Sleep_for_Profit_in_Online_Deadline_Scheduling.pdf file_size: 325939 relation: main_file success: 1 file_date_updated: 2018-03-15T09:03:39Z has_accepted_license: '1' language: - iso: eng page: 218-231 project: - _id: '1' name: SFB 901 - _id: '14' name: SFB 901 - Subprojekt C2 - _id: '16' name: SFB 901 - Subproject C4 - _id: '4' name: SFB 901 - Project Area C publication: Proceedings of the 1st Mediterranean Conference on Algorithms (MedAlg) series_title: LNCS status: public title: Slow Down & Sleep for Profit in Online Deadline Scheduling type: conference user_id: '477' year: '2012' ... --- _id: '581' abstract: - lang: eng text: 'Nanoparticles are getting more and more in the focus of the scientic community since the potential for the development of very small particles interacting with each other and completing medical and other tasks is getting bigger year by year. In this work we introduce a distributed local algorithm for arranging a set of nanoparticles on the discrete plane into specic geometric shapes, for instance a rectangle. The concept of a particle we use can be seen as a simple mobile robot with the following restrictions: it can only view the state of robots it is physically connected to, is anonymous, has only a constant size memory, can only move by using other particles as an anchor point on which it pulls itself alongside, and it operates in Look-Compute-Move cycles. The main result of this work is the presentation of a random distributed local algorithm which transforms any given connected set of particles into a particular geometric shape. As an example we provide a version of this algorithm for forming a rectangle with an arbitrary predened aspect ratio. To the best of our knowledge this is the rst work that considers arrangement problems for these types of robots.' author: - first_name: Maximilian full_name: Drees, Maximilian last_name: Drees - first_name: Martina full_name: 'Hüllmann (married name: Eikel), Martina' last_name: 'Hüllmann (married name: Eikel)' - first_name: Andreas full_name: Koutsopoulos, Andreas last_name: Koutsopoulos - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: 'Drees M, Hüllmann (married name: Eikel) M, Koutsopoulos A, Scheideler C. Self-Organizing Particle Systems. In: Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS). ; 2012:1272-1283. doi:10.1109/IPDPS.2012.116' apa: 'Drees, M., Hüllmann (married name: Eikel), M., Koutsopoulos, A., & Scheideler, C. (2012). Self-Organizing Particle Systems. In Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS) (pp. 1272–1283). https://doi.org/10.1109/IPDPS.2012.116' bibtex: '@inproceedings{Drees_Hüllmann (married name: Eikel)_Koutsopoulos_Scheideler_2012, title={Self-Organizing Particle Systems}, DOI={10.1109/IPDPS.2012.116}, booktitle={Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS)}, author={Drees, Maximilian and Hüllmann (married name: Eikel), Martina and Koutsopoulos, Andreas and Scheideler, Christian}, year={2012}, pages={1272–1283} }' chicago: 'Drees, Maximilian, Martina Hüllmann (married name: Eikel), Andreas Koutsopoulos, and Christian Scheideler. “Self-Organizing Particle Systems.” In Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 1272–83, 2012. https://doi.org/10.1109/IPDPS.2012.116.' ieee: 'M. Drees, M. Hüllmann (married name: Eikel), A. Koutsopoulos, and C. Scheideler, “Self-Organizing Particle Systems,” in Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2012, pp. 1272–1283.' mla: Drees, Maximilian, et al. “Self-Organizing Particle Systems.” Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2012, pp. 1272–83, doi:10.1109/IPDPS.2012.116. short: 'M. Drees, M. Hüllmann (married name: Eikel), A. Koutsopoulos, C. Scheideler, in: Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2012, pp. 1272–1283.' date_created: 2017-10-17T12:42:45Z date_updated: 2022-01-06T07:02:42Z ddc: - '040' department: - _id: '79' - _id: '63' doi: 10.1109/IPDPS.2012.116 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T08:39:33Z date_updated: 2018-03-15T08:39:33Z file_id: '1263' file_name: 581-IPDPS2012-Scheideler_Huellmann.pdf file_size: 373131 relation: main_file success: 1 file_date_updated: 2018-03-15T08:39:33Z has_accepted_license: '1' language: - iso: eng page: 1272-1283 project: - _id: '1' name: SFB 901 - _id: '13' name: SFB 901 - Subprojekt C1 - _id: '4' name: SFB 901 - Project Area C publication: Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS) status: public title: Self-Organizing Particle Systems type: conference user_id: '14955' year: '2012' ... --- _id: '582' author: - first_name: Thim Frederik full_name: Strothmann, Thim Frederik id: '11319' last_name: Strothmann citation: ama: Strothmann TF. Self-Optimizing Binary Search Trees - A Game Theoretic Approach. Universität Paderborn; 2012. apa: Strothmann, T. F. (2012). Self-Optimizing Binary Search Trees - A Game Theoretic Approach. Universität Paderborn. bibtex: '@book{Strothmann_2012, title={Self-Optimizing Binary Search Trees - A Game Theoretic Approach}, publisher={Universität Paderborn}, author={Strothmann, Thim Frederik}, year={2012} }' chicago: Strothmann, Thim Frederik. Self-Optimizing Binary Search Trees - A Game Theoretic Approach. Universität Paderborn, 2012. ieee: T. F. Strothmann, Self-Optimizing Binary Search Trees - A Game Theoretic Approach. Universität Paderborn, 2012. mla: Strothmann, Thim Frederik. Self-Optimizing Binary Search Trees - A Game Theoretic Approach. Universität Paderborn, 2012. short: T.F. Strothmann, Self-Optimizing Binary Search Trees - A Game Theoretic Approach, Universität Paderborn, 2012. date_created: 2017-10-17T12:42:45Z date_updated: 2022-01-06T07:02:42Z department: - _id: '79' 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 title: Self-Optimizing Binary Search Trees - A Game Theoretic Approach type: mastersthesis user_id: '477' year: '2012' ... --- _id: '583' author: - first_name: Julian full_name: Drücker, Julian last_name: Drücker citation: ama: Drücker J. Revenue-Maximizing Order of Sale in Sequential Auctions. Universität Paderborn; 2012. apa: Drücker, J. (2012). Revenue-maximizing Order of Sale in Sequential Auctions. Universität Paderborn. bibtex: '@book{Drücker_2012, title={Revenue-maximizing Order of Sale in Sequential Auctions}, publisher={Universität Paderborn}, author={Drücker, Julian}, year={2012} }' chicago: Drücker, Julian. Revenue-Maximizing Order of Sale in Sequential Auctions. Universität Paderborn, 2012. ieee: J. Drücker, Revenue-maximizing Order of Sale in Sequential Auctions. Universität Paderborn, 2012. mla: Drücker, Julian. Revenue-Maximizing Order of Sale in Sequential Auctions. Universität Paderborn, 2012. short: J. Drücker, Revenue-Maximizing Order of Sale in Sequential Auctions, Universität Paderborn, 2012. date_created: 2017-10-17T12:42:45Z date_updated: 2022-01-06T07:02:43Z project: - _id: '1' name: SFB 901 - _id: '7' name: SFB 901 - Subprojekt A3 - _id: '2' name: SFB 901 - Project Area A publisher: Universität Paderborn status: public title: Revenue-maximizing Order of Sale in Sequential Auctions type: mastersthesis user_id: '15504' year: '2012' ... --- _id: '584' author: - first_name: Till full_name: Hohenberger, Till last_name: Hohenberger citation: ama: Hohenberger T. Queuing Latency at Cooperative Base Stations. Universität Paderborn; 2012. apa: Hohenberger, T. (2012). Queuing Latency at Cooperative Base Stations. Universität Paderborn. bibtex: '@book{Hohenberger_2012, title={Queuing Latency at Cooperative Base Stations}, publisher={Universität Paderborn}, author={Hohenberger, Till}, year={2012} }' chicago: Hohenberger, Till. Queuing Latency at Cooperative Base Stations. Universität Paderborn, 2012. ieee: T. Hohenberger, Queuing Latency at Cooperative Base Stations. Universität Paderborn, 2012. mla: Hohenberger, Till. Queuing Latency at Cooperative Base Stations. Universität Paderborn, 2012. short: T. Hohenberger, Queuing Latency at Cooperative Base Stations, Universität Paderborn, 2012. date_created: 2017-10-17T12:42:46Z date_updated: 2022-01-06T07:02:43Z 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: Queuing Latency at Cooperative Base Stations type: bachelorsthesis user_id: '15504' year: '2012' ... --- _id: '585' abstract: - lang: eng text: In a cloud-computing scenario where users buy software from software providers and execute it at computing centers, a digital rights management (DRM) system has to be in place to check the software licenses during each software execution. However, the exposure of users to privacy invasion in the presence of DRM systems is problematic.We come up with a concept that unites software providers' and users' demands for a secure and privacy-preserving DRM system for cloud computing. The employment of proxy re-encryption allows for a prevention of profile building (under pseudonym) of users by any party. author: - first_name: Ronald full_name: Petrlic, Ronald last_name: Petrlic citation: ama: 'Petrlic R. Proxy Re-Encryption in a Privacy-Preserving Cloud Computing DRM Scheme. In: Proceedings of 4th International Symposium on Cyberspace Safety and Security (CSS). LNCS. ; 2012:194-211. doi:10.1007/978-3-642-35362-8_16' apa: Petrlic, R. (2012). Proxy Re-Encryption in a Privacy-Preserving Cloud Computing DRM Scheme. In Proceedings of 4th International Symposium on Cyberspace Safety and Security (CSS) (pp. 194–211). https://doi.org/10.1007/978-3-642-35362-8_16 bibtex: '@inproceedings{Petrlic_2012, series={LNCS}, title={Proxy Re-Encryption in a Privacy-Preserving Cloud Computing DRM Scheme}, DOI={10.1007/978-3-642-35362-8_16}, booktitle={Proceedings of 4th International Symposium on Cyberspace Safety and Security (CSS)}, author={Petrlic, Ronald}, year={2012}, pages={194–211}, collection={LNCS} }' chicago: Petrlic, Ronald. “Proxy Re-Encryption in a Privacy-Preserving Cloud Computing DRM Scheme.” In Proceedings of 4th International Symposium on Cyberspace Safety and Security (CSS), 194–211. LNCS, 2012. https://doi.org/10.1007/978-3-642-35362-8_16. ieee: R. Petrlic, “Proxy Re-Encryption in a Privacy-Preserving Cloud Computing DRM Scheme,” in Proceedings of 4th International Symposium on Cyberspace Safety and Security (CSS), 2012, pp. 194–211. mla: Petrlic, Ronald. “Proxy Re-Encryption in a Privacy-Preserving Cloud Computing DRM Scheme.” Proceedings of 4th International Symposium on Cyberspace Safety and Security (CSS), 2012, pp. 194–211, doi:10.1007/978-3-642-35362-8_16. short: 'R. Petrlic, in: Proceedings of 4th International Symposium on Cyberspace Safety and Security (CSS), 2012, pp. 194–211.' date_created: 2017-10-17T12:42:46Z date_updated: 2022-01-06T07:02:43Z ddc: - '040' doi: 10.1007/978-3-642-35362-8_16 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T08:38:58Z date_updated: 2018-03-15T08:38:58Z file_id: '1262' file_name: 585-privacy-drm-cloud-1-css-camera-ready.pdf file_size: 582557 relation: main_file success: 1 file_date_updated: 2018-03-15T08:38:58Z has_accepted_license: '1' page: 194-211 project: - _id: '1' name: SFB 901 - _id: '13' name: SFB 901 - Subprojekt C1 - _id: '4' name: SFB 901 - Project Area C publication: Proceedings of 4th International Symposium on Cyberspace Safety and Security (CSS) series_title: LNCS status: public title: Proxy Re-Encryption in a Privacy-Preserving Cloud Computing DRM Scheme type: conference user_id: '15504' year: '2012' ... --- _id: '586' abstract: - lang: eng text: FPGAs, systems on chip and embedded systems are nowadays irreplaceable. They combine the computational power of application specific hardware with software-like flexibility. At runtime, they can adjust their functionality by downloading new hardware modules and integrating their functionality. Due to their growing capabilities, the demands made to reconfigurable hardware grow. Their deployment in increasingly security critical scenarios requires new ways of enforcing security since a failure in security has severe consequences. Aside from financial losses, a loss of human life and risks to national security are possible. With this work I present the novel and groundbreaking concept of proof-carrying hardware. It is a method for the verification of properties of hardware modules to guarantee security for a target platform at runtime. The producer of a hardware module delivers based on the consumer's safety policy a safety proof in combination with the reconfiguration bitstream. The extensive computation of a proof is a contrast to the comparatively undemanding checking of the proof. I present a prototype based on open-source tools and an abstract FPGA architecture and bitstream format. The proof of the usability of proof-carrying hardware provides the evaluation of the prototype with the exemplary application of securing combinational and bounded sequential equivalence of reference monitor modules for memory safety. - lang: ger text: FPGAs, System on Chips und eingebettete Systeme sind heutzutage kaum mehr wegzudenken. Sie kombinieren die Rechenleistung von spezialisierter Hardware mit einer Software-ähnlichen Flexibilität. Zur Laufzeit können sie ihre Funktionalität anpassen, indem sie online neue Hardware Module beziehen und deren Funktionalität integrieren. Mit der Leistung wachsen auch die Anforderungen an rekonfigurierbare Hardware. Ihr Einsatz in immer sicherheitskritischeren Szenarien erfordert neue Wege um Sicherheit zu gewährleisten, da ein Versagen der Sicherheit gravierende Folgen mit sich bringt. Neben finanziellen Verlusten sind auch der Verlust von Menschenleben oder Einbußen in der nationalen Sicherheit denkbar. In dieser Arbeit stelle ich das neue und wegweisende Konzept der beweistragenden Hardware vor. Es ist eine Methode zur Verifizierung von Eigenschaften von Hardware Modulen um die Sicherheit der Zielplatformen zur Laufzeit zu garantieren. Der Produzent eines Hardware Moduls liefert, basierend auf den Sicherheitsbestimmungen des Konsumenten, einen Beweis der Sicherheit mit dem Rekonfigurierungsbitstrom. Die aufwendige Berechnung des Beweises steht im Kontrast zu der vergleichsweise unaufwendigen Überprüfung durch den Konsumenten. Ich präsentiere einen Prototypen basierend auf Open Source Werkzeugen und einer eigenen abstrakten FPGA Architektur samt Bitstromformat. Den Nachweis über die Nutzbarkeit von beweistragender Hardware erbringt die Evaluierung des Prototypen zur beispielhaften Anwendung der Sicherung von kombinatorischer und begrenzt sequenzieller Äquivalenz von Referenzmonitor-Modulen zur Speichersicherheit. author: - first_name: Stephanie full_name: Drzevitzky, Stephanie last_name: Drzevitzky citation: ama: 'Drzevitzky S. Proof-Carrying Hardware: A Novel Approach to Reconfigurable Hardware Security. Universität Paderborn; 2012.' apa: 'Drzevitzky, S. (2012). Proof-Carrying Hardware: A Novel Approach to Reconfigurable Hardware Security. Universität Paderborn.' bibtex: '@book{Drzevitzky_2012, title={Proof-Carrying Hardware: A Novel Approach to Reconfigurable Hardware Security}, publisher={Universität Paderborn}, author={Drzevitzky, Stephanie}, year={2012} }' chicago: 'Drzevitzky, Stephanie. Proof-Carrying Hardware: A Novel Approach to Reconfigurable Hardware Security. Universität Paderborn, 2012.' ieee: 'S. Drzevitzky, Proof-Carrying Hardware: A Novel Approach to Reconfigurable Hardware Security. Universität Paderborn, 2012.' mla: 'Drzevitzky, Stephanie. Proof-Carrying Hardware: A Novel Approach to Reconfigurable Hardware Security. Universität Paderborn, 2012.' short: 'S. Drzevitzky, Proof-Carrying Hardware: A Novel Approach to Reconfigurable Hardware Security, Universität Paderborn, 2012.' date_created: 2017-10-17T12:42:46Z date_updated: 2022-01-06T07:02:44Z ddc: - '040' department: - _id: '78' file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T08:38:19Z date_updated: 2018-03-15T08:38:19Z file_id: '1261' file_name: 586-Drzevitzky-PhD_01.pdf file_size: 1438436 relation: main_file success: 1 file_date_updated: 2018-03-15T08:38:19Z has_accepted_license: '1' language: - iso: eng main_file_link: - open_access: '1' url: https://nbn-resolving.de/urn:nbn:de:hbz:466:2-10423 oa: '1' page: '114' project: - _id: '12' name: SFB 901 - Subprojekt B4 - _id: '1' name: SFB 901 - _id: '3' name: SFB 901 - Project Area B publication_status: published publisher: Universität Paderborn status: public supervisor: - first_name: Marco full_name: Platzner, Marco id: '398' last_name: Platzner title: 'Proof-Carrying Hardware: A Novel Approach to Reconfigurable Hardware Security' type: dissertation user_id: '477' year: '2012' ... --- _id: '587' author: - first_name: Christian full_name: Plessl, Christian id: '16153' last_name: Plessl orcid: 0000-0001-5728-9982 - first_name: Marco full_name: Platzner, Marco id: '398' last_name: Platzner - first_name: Andreas full_name: Agne, Andreas last_name: Agne - first_name: Markus full_name: Happe, Markus last_name: Happe - first_name: Enno full_name: Lübbers, Enno last_name: Lübbers citation: ama: Plessl C, Platzner M, Agne A, Happe M, Lübbers E. Programming Models for Reconfigurable Heterogeneous Multi-Cores. Awareness Magazine; 2012. apa: Plessl, C., Platzner, M., Agne, A., Happe, M., & Lübbers, E. (2012). Programming models for reconfigurable heterogeneous multi-cores. Awareness Magazine. bibtex: '@book{Plessl_Platzner_Agne_Happe_Lübbers_2012, title={Programming models for reconfigurable heterogeneous multi-cores}, publisher={Awareness Magazine}, author={Plessl, Christian and Platzner, Marco and Agne, Andreas and Happe, Markus and Lübbers, Enno}, year={2012} }' chicago: Plessl, Christian, Marco Platzner, Andreas Agne, Markus Happe, and Enno Lübbers. Programming Models for Reconfigurable Heterogeneous Multi-Cores. Awareness Magazine, 2012. ieee: C. Plessl, M. Platzner, A. Agne, M. Happe, and E. Lübbers, Programming models for reconfigurable heterogeneous multi-cores. Awareness Magazine, 2012. mla: Plessl, Christian, et al. Programming Models for Reconfigurable Heterogeneous Multi-Cores. Awareness Magazine, 2012. short: C. Plessl, M. Platzner, A. Agne, M. Happe, E. Lübbers, Programming Models for Reconfigurable Heterogeneous Multi-Cores, Awareness Magazine, 2012. date_created: 2017-10-17T12:42:46Z date_updated: 2022-01-06T07:02:44Z ddc: - '040' department: - _id: '27' - _id: '518' - _id: '78' file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T08:37:02Z date_updated: 2018-03-15T08:37:02Z file_id: '1260' file_name: 587-2012_plessl_awareness_magazine.pdf file_size: 353057 relation: main_file success: 1 file_date_updated: 2018-03-15T08:37:02Z has_accepted_license: '1' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '14' name: SFB 901 - Subprojekt C2 - _id: '4' name: SFB 901 - Project Area C publisher: Awareness Magazine status: public title: Programming models for reconfigurable heterogeneous multi-cores type: misc user_id: '398' year: '2012' ... --- _id: '588' abstract: - lang: eng text: We come up with a digital rights management (DRM) concept for cloud computing and show how license management for software within the cloud can be achieved in a privacy-friendly manner. In our scenario, users who buy software from software providers stay anonymous. At the same time, our approach guarantees that software licenses are bound to users and their validity is checked before execution. We employ a software re-encryption scheme so that computing centers which execute users’ software are not able to build user profiles—not even under pseudonym—of their users. We combine secret sharing and homomorphic encryption. We make sure that malicious users are unable to relay software to others. DRM constitutes an incentive for software providers to take part in a future cloud computing scenario.We make this scenario more attractive for users by preserving their privacy. author: - first_name: Ronald full_name: Petrlic, Ronald last_name: Petrlic - first_name: Christoph full_name: Sorge, Christoph last_name: Sorge citation: ama: 'Petrlic R, Sorge C. Privacy-Preserving DRM for Cloud Computing. In: Proceedings of the 26th IEEE International Conference on Advanced Information Networking and Applications (AINA). ; 2012:1286-1291. doi:10.1109/WAINA.2012.92' apa: Petrlic, R., & Sorge, C. (2012). Privacy-Preserving DRM for Cloud Computing. In Proceedings of the 26th IEEE International Conference on Advanced Information Networking and Applications (AINA) (pp. 1286–1291). https://doi.org/10.1109/WAINA.2012.92 bibtex: '@inproceedings{Petrlic_Sorge_2012, title={Privacy-Preserving DRM for Cloud Computing}, DOI={10.1109/WAINA.2012.92}, booktitle={Proceedings of the 26th IEEE International Conference on Advanced Information Networking and Applications (AINA)}, author={Petrlic, Ronald and Sorge, Christoph}, year={2012}, pages={1286–1291} }' chicago: Petrlic, Ronald, and Christoph Sorge. “Privacy-Preserving DRM for Cloud Computing.” In Proceedings of the 26th IEEE International Conference on Advanced Information Networking and Applications (AINA), 1286–91, 2012. https://doi.org/10.1109/WAINA.2012.92. ieee: R. Petrlic and C. Sorge, “Privacy-Preserving DRM for Cloud Computing,” in Proceedings of the 26th IEEE International Conference on Advanced Information Networking and Applications (AINA), 2012, pp. 1286–1291. mla: Petrlic, Ronald, and Christoph Sorge. “Privacy-Preserving DRM for Cloud Computing.” Proceedings of the 26th IEEE International Conference on Advanced Information Networking and Applications (AINA), 2012, pp. 1286–91, doi:10.1109/WAINA.2012.92. short: 'R. Petrlic, C. Sorge, in: Proceedings of the 26th IEEE International Conference on Advanced Information Networking and Applications (AINA), 2012, pp. 1286–1291.' date_created: 2017-10-17T12:42:46Z date_updated: 2022-01-06T07:02:45Z ddc: - '040' doi: 10.1109/WAINA.2012.92 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T08:36:16Z date_updated: 2018-03-15T08:36:16Z file_id: '1259' file_name: 588-drm0-published_01.pdf file_size: 194323 relation: main_file success: 1 file_date_updated: 2018-03-15T08:36:16Z has_accepted_license: '1' page: 1286-1291 project: - _id: '1' name: SFB 901 - _id: '13' name: SFB 901 - Subprojekt C1 - _id: '4' name: SFB 901 - Project Area C publication: Proceedings of the 26th IEEE International Conference on Advanced Information Networking and Applications (AINA) status: public title: Privacy-Preserving DRM for Cloud Computing type: conference user_id: '15504' year: '2012' ... --- _id: '589' abstract: - lang: eng text: We present a privacy-preserving DRM scheme for a (future) cloud computing software market. In such a market, applications are packed into virtual machines (VMs) by software providers and the VMs can be executed at any computing center within the cloud. We propose the introduction of a software TPM as a container for VM-specific keys within the VM that moves around with the VM within the cloud. The software TPM is coupled to a virtual TPM at a computing center to constitute the root of trust for a local DRM enforcement system within the VM that checks the license before each application execution. This allows flexible price models, e.g. execute at most n timeslike models. Users have proof that their personally identifiable information, stored and processed within the VM at a computing center, cannot be obtained by the computing center. A feature of our solution is that neither software provider nor computing center are able to build usage profiles of the software executions. author: - first_name: Ronald full_name: Petrlic, Ronald last_name: Petrlic citation: ama: 'Petrlic R. Privacy-Preserving Digital Rights Management in a Trusted Cloud Environment. In: Proceedings of the 11th IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom). ; 2012:958-963. doi:10.1109/TrustCom.2012.225' apa: Petrlic, R. (2012). Privacy-Preserving Digital Rights Management in a Trusted Cloud Environment. In Proceedings of the 11th IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom) (pp. 958–963). https://doi.org/10.1109/TrustCom.2012.225 bibtex: '@inproceedings{Petrlic_2012, title={Privacy-Preserving Digital Rights Management in a Trusted Cloud Environment}, DOI={10.1109/TrustCom.2012.225}, booktitle={Proceedings of the 11th IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)}, author={Petrlic, Ronald}, year={2012}, pages={958–963} }' chicago: Petrlic, Ronald. “Privacy-Preserving Digital Rights Management in a Trusted Cloud Environment.” In Proceedings of the 11th IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom), 958–63, 2012. https://doi.org/10.1109/TrustCom.2012.225. ieee: R. Petrlic, “Privacy-Preserving Digital Rights Management in a Trusted Cloud Environment,” in Proceedings of the 11th IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom), 2012, pp. 958–963. mla: Petrlic, Ronald. “Privacy-Preserving Digital Rights Management in a Trusted Cloud Environment.” Proceedings of the 11th IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom), 2012, pp. 958–63, doi:10.1109/TrustCom.2012.225. short: 'R. Petrlic, in: Proceedings of the 11th IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom), 2012, pp. 958–963.' date_created: 2017-10-17T12:42:47Z date_updated: 2022-01-06T07:02:45Z ddc: - '040' doi: 10.1109/TrustCom.2012.225 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T08:40:15Z date_updated: 2018-03-15T08:40:15Z file_id: '1264' file_name: 589-published-trustcom.pdf file_size: 179985 relation: main_file success: 1 file_date_updated: 2018-03-15T08:40:15Z has_accepted_license: '1' language: - iso: eng page: 958-963 project: - _id: '1' name: SFB 901 - _id: '13' name: SFB 901 - Subprojekt C1 - _id: '4' name: SFB 901 - Project Area C publication: Proceedings of the 11th IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom) status: public title: Privacy-Preserving Digital Rights Management in a Trusted Cloud Environment type: conference user_id: '477' year: '2012' ... --- _id: '590' abstract: - lang: eng text: 'Predicate abstraction is an established technique for reducing the size of the state space during verification. In this paper, we extend predication abstraction with block-abstraction memoization (BAM), which exploits the fact that blocks are often executed several times in a program. The verification can thus benefit from caching the values of previous block analyses and reusing them upon next entry into a block. In addition to function bodies, BAM also performs well for nested loops. To further increase effectiveness, block memoization has been integrated with lazy abstraction adopting a lazy strategy for cache refinement. Together, this achieves significant performance increases: our tool (an implementation within the configurable program analysis framework CPAchecker) has won the Competition on Software Verification 2012 in the category “Overall”.' author: - first_name: Daniel full_name: Wonisch, Daniel last_name: Wonisch - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim citation: ama: 'Wonisch D, Wehrheim H. Predicate Analysis with Block-Abstraction Memoization. In: Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM). LNCS. ; 2012:332-347. doi:10.1007/978-3-642-34281-3_24' apa: Wonisch, D., & Wehrheim, H. (2012). Predicate Analysis with Block-Abstraction Memoization. In Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM) (pp. 332–347). https://doi.org/10.1007/978-3-642-34281-3_24 bibtex: '@inproceedings{Wonisch_Wehrheim_2012, series={LNCS}, title={Predicate Analysis with Block-Abstraction Memoization}, DOI={10.1007/978-3-642-34281-3_24}, booktitle={Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM)}, author={Wonisch, Daniel and Wehrheim, Heike}, year={2012}, pages={332–347}, collection={LNCS} }' chicago: Wonisch, Daniel, and Heike Wehrheim. “Predicate Analysis with Block-Abstraction Memoization.” In Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM), 332–47. LNCS, 2012. https://doi.org/10.1007/978-3-642-34281-3_24. ieee: D. Wonisch and H. Wehrheim, “Predicate Analysis with Block-Abstraction Memoization,” in Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM), 2012, pp. 332–347. mla: Wonisch, Daniel, and Heike Wehrheim. “Predicate Analysis with Block-Abstraction Memoization.” Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM), 2012, pp. 332–47, doi:10.1007/978-3-642-34281-3_24. short: 'D. Wonisch, H. Wehrheim, in: Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM), 2012, pp. 332–347.' date_created: 2017-10-17T12:42:47Z date_updated: 2022-01-06T07:02:46Z ddc: - '040' department: - _id: '77' doi: 10.1007/978-3-642-34281-3_24 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T08:33:56Z date_updated: 2018-03-15T08:33:56Z file_id: '1258' file_name: 590-WonischWehrheim2012.pdf file_size: 320901 relation: main_file success: 1 file_date_updated: 2018-03-15T08:33:56Z has_accepted_license: '1' language: - iso: eng page: 332-347 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 14th International Conference on Formal Engineering Methods (ICFEM) series_title: LNCS status: public title: Predicate Analysis with Block-Abstraction Memoization type: conference user_id: '477' year: '2012' ... --- _id: '592' author: - first_name: Aydin full_name: Celik, Aydin last_name: Celik citation: ama: 'Celik A. Penny Auctions: Design und Strategisches Verhalten. Universität Paderborn; 2012.' apa: 'Celik, A. (2012). Penny Auctions: Design und Strategisches Verhalten. Universität Paderborn.' bibtex: '@book{Celik_2012, title={Penny Auctions: Design und Strategisches Verhalten}, publisher={Universität Paderborn}, author={Celik, Aydin}, year={2012} }' chicago: 'Celik, Aydin. Penny Auctions: Design und Strategisches Verhalten. Universität Paderborn, 2012.' ieee: 'A. Celik, Penny Auctions: Design und Strategisches Verhalten. Universität Paderborn, 2012.' mla: 'Celik, Aydin. Penny Auctions: Design und Strategisches Verhalten. Universität Paderborn, 2012.' short: 'A. Celik, Penny Auctions: Design und Strategisches Verhalten, Universität Paderborn, 2012.' date_created: 2017-10-17T12:42:47Z date_updated: 2022-01-06T07:02:47Z language: - iso: ger project: - _id: '1' name: SFB 901 - _id: '7' name: SFB 901 - Subprojekt A3 - _id: '2' name: SFB 901 - Project Area A publisher: Universität Paderborn status: public title: 'Penny Auctions: Design und Strategisches Verhalten' type: mastersthesis user_id: '477' year: '2012' ... --- _id: '593' author: - first_name: Tobias full_name: Rojahn, Tobias last_name: Rojahn citation: ama: Rojahn T. Optimale Zuteilung von Nutzern zu verteilten Cloud-Standorten. Universität Paderborn; 2012. apa: Rojahn, T. (2012). Optimale Zuteilung von Nutzern zu verteilten Cloud-Standorten. Universität Paderborn. bibtex: '@book{Rojahn_2012, title={Optimale Zuteilung von Nutzern zu verteilten Cloud-Standorten}, publisher={Universität Paderborn}, author={Rojahn, Tobias}, year={2012} }' chicago: Rojahn, Tobias. Optimale Zuteilung von Nutzern zu verteilten Cloud-Standorten. Universität Paderborn, 2012. ieee: T. Rojahn, Optimale Zuteilung von Nutzern zu verteilten Cloud-Standorten. Universität Paderborn, 2012. mla: Rojahn, Tobias. Optimale Zuteilung von Nutzern zu verteilten Cloud-Standorten. Universität Paderborn, 2012. short: T. Rojahn, Optimale Zuteilung von Nutzern zu verteilten Cloud-Standorten, Universität Paderborn, 2012. date_created: 2017-10-17T12:42:47Z date_updated: 2022-01-06T07:02:47Z department: - _id: '75' language: - iso: ger 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: Optimale Zuteilung von Nutzern zu verteilten Cloud-Standorten type: bachelorsthesis user_id: '477' year: '2012' ... --- _id: '594' author: - first_name: Timo full_name: Klerx, Timo last_name: Klerx citation: ama: Klerx T. Online Parameteroptimierung in P2P-Netzwerken mit Hilfe von Neuronalen Netzen. Universität Paderborn; 2012. apa: Klerx, T. (2012). Online Parameteroptimierung in P2P-Netzwerken mit Hilfe von Neuronalen Netzen. Universität Paderborn. bibtex: '@book{Klerx_2012, title={Online Parameteroptimierung in P2P-Netzwerken mit Hilfe von Neuronalen Netzen}, publisher={Universität Paderborn}, author={Klerx, Timo}, year={2012} }' chicago: Klerx, Timo. Online Parameteroptimierung in P2P-Netzwerken mit Hilfe von Neuronalen Netzen. Universität Paderborn, 2012. ieee: T. Klerx, Online Parameteroptimierung in P2P-Netzwerken mit Hilfe von Neuronalen Netzen. Universität Paderborn, 2012. mla: Klerx, Timo. Online Parameteroptimierung in P2P-Netzwerken mit Hilfe von Neuronalen Netzen. Universität Paderborn, 2012. short: T. Klerx, Online Parameteroptimierung in P2P-Netzwerken mit Hilfe von Neuronalen Netzen, Universität Paderborn, 2012. date_created: 2017-10-17T12:42:47Z date_updated: 2022-01-06T07:02:48Z 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 title: Online Parameteroptimierung in P2P-Netzwerken mit Hilfe von Neuronalen Netzen type: mastersthesis user_id: '477' year: '2012' ... --- _id: '595' author: - first_name: Frederik full_name: Mallmann Trenn, Frederik last_name: Mallmann Trenn citation: ama: Mallmann Trenn F. On Scheduling with Multi-Core and Multi-Speed Processors Using Power Down. Universität Paderborn; 2012. apa: Mallmann Trenn, F. (2012). On scheduling with multi-core and multi-speed processors using power down. Universität Paderborn. bibtex: '@book{Mallmann Trenn_2012, title={On scheduling with multi-core and multi-speed processors using power down}, publisher={Universität Paderborn}, author={Mallmann Trenn, Frederik}, year={2012} }' chicago: Mallmann Trenn, Frederik. On Scheduling with Multi-Core and Multi-Speed Processors Using Power Down. Universität Paderborn, 2012. ieee: F. Mallmann Trenn, On scheduling with multi-core and multi-speed processors using power down. Universität Paderborn, 2012. mla: Mallmann Trenn, Frederik. On Scheduling with Multi-Core and Multi-Speed Processors Using Power Down. Universität Paderborn, 2012. short: F. Mallmann Trenn, On Scheduling with Multi-Core and Multi-Speed Processors Using Power Down, Universität Paderborn, 2012. date_created: 2017-10-17T12:42:48Z date_updated: 2022-01-06T07:02:48Z project: - _id: '1' name: SFB 901 - _id: '14' name: SFB 901 - Subprojekt C2 - _id: '4' name: SFB 901 - Project Area C publisher: Universität Paderborn status: public title: On scheduling with multi-core and multi-speed processors using power down type: bachelorsthesis user_id: '15504' year: '2012' ... --- _id: '596' abstract: - lang: eng text: To meet quality-of-service requirements in changing environments, modern software systems adapt themselves. The structure, and correspondingly the behavior, of these systems undergoes continuous change. Model-driven performance engineering, however, assumes static system structures, behavior, and deployment. Hence, self-adaptive systems pose new challenges to model-driven performance engineering. There are a few surveys on self-adaptive systems, performance engineering, and the combination of both in the literature. In contrast to existing work, here we focus on model-driven performance analysis approaches. Based on a systematic literature review, we present a classication, identify open issues, and outline further research. author: - first_name: Matthias full_name: Becker, Matthias last_name: Becker - first_name: Markus full_name: Luckey, Markus last_name: Luckey - first_name: Steffen full_name: Becker, Steffen last_name: Becker citation: ama: 'Becker M, Luckey M, Becker S. Model-Driven Performance Engineering of Self-Adaptive Systems: A Survey. In: Proceedings of the 8th ACM SigSoft International Conference on Quality of Software Architectures (QoSA’12). ; 2012:117-122. doi:10.1145/2304696.2304716' apa: 'Becker, M., Luckey, M., & Becker, S. (2012). Model-Driven Performance Engineering of Self-Adaptive Systems: A Survey. In Proceedings of the 8th ACM SigSoft International Conference on Quality of Software Architectures (QoSA’12) (pp. 117–122). https://doi.org/10.1145/2304696.2304716' bibtex: '@inproceedings{Becker_Luckey_Becker_2012, title={Model-Driven Performance Engineering of Self-Adaptive Systems: A Survey}, DOI={10.1145/2304696.2304716}, booktitle={Proceedings of the 8th ACM SigSoft International Conference on Quality of Software Architectures (QoSA’12)}, author={Becker, Matthias and Luckey, Markus and Becker, Steffen}, year={2012}, pages={117–122} }' chicago: 'Becker, Matthias, Markus Luckey, and Steffen Becker. “Model-Driven Performance Engineering of Self-Adaptive Systems: A Survey.” In Proceedings of the 8th ACM SigSoft International Conference on Quality of Software Architectures (QoSA’12), 117–22, 2012. https://doi.org/10.1145/2304696.2304716.' ieee: 'M. Becker, M. Luckey, and S. Becker, “Model-Driven Performance Engineering of Self-Adaptive Systems: A Survey,” in Proceedings of the 8th ACM SigSoft International Conference on Quality of Software Architectures (QoSA’12), 2012, pp. 117–122.' mla: 'Becker, Matthias, et al. “Model-Driven Performance Engineering of Self-Adaptive Systems: A Survey.” Proceedings of the 8th ACM SigSoft International Conference on Quality of Software Architectures (QoSA’12), 2012, pp. 117–22, doi:10.1145/2304696.2304716.' short: 'M. Becker, M. Luckey, S. Becker, in: Proceedings of the 8th ACM SigSoft International Conference on Quality of Software Architectures (QoSA’12), 2012, pp. 117–122.' date_created: 2017-10-17T12:42:48Z date_updated: 2022-01-06T07:02:48Z ddc: - '040' doi: 10.1145/2304696.2304716 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T08:23:31Z date_updated: 2018-03-15T08:23:31Z file_id: '1256' file_name: 596-qosa25s-becker.pdf file_size: 141651 relation: main_file success: 1 file_date_updated: 2018-03-15T08:23:31Z has_accepted_license: '1' page: 117-122 project: - _id: '1' name: SFB 901 - _id: '11' name: SFB 901 - Subprojekt B3 - _id: '3' name: SFB 901 - Project Area B publication: Proceedings of the 8th ACM SigSoft International Conference on Quality of Software Architectures (QoSA'12) status: public title: 'Model-Driven Performance Engineering of Self-Adaptive Systems: A Survey' type: conference user_id: '15504' year: '2012' ...