@inproceedings{5753,
  author       = {{Nagel, Benjamin and Gerth, Christian and Yigitbas, Enes and Christ, Fabian and Engels, Gregor}},
  booktitle    = {{Proceedings of the 1st International Workshop on Model-Driven Engineering for High Performance and CLoud computing co-located with 15th International Conference on Model Driven Engineering Languages and Systems {(MODELS} 2012), Innsbruck, Austria, October 01 - 05, 2012}},
  pages        = {{4}},
  title        = {{{Model-driven specification of adaptive cloud-based systems}}},
  doi          = {{10.1145/2446224.2446228}},
  year         = {{2012}},
}

@misc{576,
  author       = {{Schmitz, Henning}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Stereo Matching on a Convey HC-1 Hybrid Core Computer}}},
  year         = {{2012}},
}

@misc{5760,
  author       = {{Yigitbas, Enes}},
  title        = {{{Entwicklung eines Monitoring- und Adaptionskonzeptes für Geschäftsprozesse in service-orientierten Systemen}}},
  year         = {{2012}},
}

@proceedings{577,
  abstract     = {{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.}},
  editor       = {{Richa, Andrea W. and Scheideler, Christian}},
  location     = {{Paderborn, Germany}},
  title        = {{{Stabilization, Safety, and Security of Distributed Systems}}},
  doi          = {{10.1007/978-3-642-33536-5}},
  year         = {{2012}},
}

@techreport{578,
  abstract     = {{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       = {{Brangewitz, Sonja and Brockhoff, Sarah}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Stability of Coalitional Equilibria within Repeated Tax Competition}}},
  year         = {{2012}},
}

@article{579,
  abstract     = {{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       = {{Damerow, Valentina and Manthey, Bodo and Meyer auf der Heide, Friedhelm and Räcke, Harald and Scheideler, Christian and Sohler, Christian and Tantau, Till}},
  journal      = {{Transactions on Algorithms}},
  number       = {{3}},
  pages        = {{30}},
  publisher    = {{ACM}},
  title        = {{{Smoothed analysis of left-to-right maxima with applications}}},
  doi          = {{10.1145/2229163.2229174}},
  year         = {{2012}},
}

@inproceedings{580,
  abstract     = {{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       = {{Cord-Landwehr, Andreas and Kling, Peter and Mallmann Trenn, Fredrik}},
  booktitle    = {{Proceedings of the 1st Mediterranean Conference on Algorithms (MedAlg)}},
  editor       = {{Even, Guy and Rawitz, Dror}},
  pages        = {{218--231}},
  title        = {{{Slow Down & Sleep for Profit in Online Deadline Scheduling}}},
  doi          = {{10.1007/978-3-642-34862-4_17}},
  year         = {{2012}},
}

@inproceedings{581,
  abstract     = {{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       = {{Drees, Maximilian and Hüllmann (married name: Eikel), Martina and Koutsopoulos, Andreas and Scheideler, Christian}},
  booktitle    = {{Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS)}},
  pages        = {{1272--1283}},
  title        = {{{Self-Organizing Particle Systems}}},
  doi          = {{10.1109/IPDPS.2012.116}},
  year         = {{2012}},
}

@misc{582,
  author       = {{Strothmann, Thim Frederik}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Self-Optimizing Binary Search Trees - A Game Theoretic Approach}}},
  year         = {{2012}},
}

@misc{583,
  author       = {{Drücker, Julian}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Revenue-maximizing Order of Sale in Sequential Auctions}}},
  year         = {{2012}},
}

@misc{584,
  author       = {{Hohenberger, Till}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Queuing Latency at Cooperative Base Stations}}},
  year         = {{2012}},
}

@inproceedings{585,
  abstract     = {{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       = {{Petrlic, Ronald}},
  booktitle    = {{Proceedings of 4th International Symposium on Cyberspace Safety and Security (CSS)}},
  pages        = {{194--211}},
  title        = {{{Proxy Re-Encryption in a Privacy-Preserving Cloud Computing DRM Scheme}}},
  doi          = {{10.1007/978-3-642-35362-8_16}},
  year         = {{2012}},
}

@phdthesis{586,
  abstract     = {{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.}},
  author       = {{Drzevitzky, Stephanie}},
  pages        = {{114}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Proof-Carrying Hardware: A Novel Approach to Reconfigurable Hardware Security}}},
  year         = {{2012}},
}

@misc{587,
  author       = {{Plessl, Christian and Platzner, Marco and Agne, Andreas and Happe, Markus and Lübbers, Enno}},
  publisher    = {{Awareness Magazine}},
  title        = {{{Programming models for reconfigurable heterogeneous multi-cores}}},
  year         = {{2012}},
}

@inproceedings{588,
  abstract     = {{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       = {{Petrlic, Ronald and Sorge, Christoph}},
  booktitle    = {{Proceedings of the 26th IEEE International Conference on Advanced Information Networking and Applications (AINA)}},
  pages        = {{1286--1291}},
  title        = {{{Privacy-Preserving DRM for Cloud Computing}}},
  doi          = {{10.1109/WAINA.2012.92}},
  year         = {{2012}},
}

@inproceedings{589,
  abstract     = {{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       = {{Petrlic, Ronald}},
  booktitle    = {{Proceedings of the 11th IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)}},
  pages        = {{958--963}},
  title        = {{{Privacy-Preserving Digital Rights Management in a Trusted Cloud Environment}}},
  doi          = {{10.1109/TrustCom.2012.225}},
  year         = {{2012}},
}

@inproceedings{590,
  abstract     = {{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       = {{Wonisch, Daniel and Wehrheim, Heike}},
  booktitle    = {{Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM)}},
  pages        = {{332--347}},
  title        = {{{Predicate Analysis with Block-Abstraction Memoization}}},
  doi          = {{10.1007/978-3-642-34281-3_24}},
  year         = {{2012}},
}

@misc{592,
  author       = {{Celik, Aydin}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Penny Auctions: Design und Strategisches Verhalten}}},
  year         = {{2012}},
}

@misc{593,
  author       = {{Rojahn, Tobias}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Optimale Zuteilung von Nutzern zu verteilten Cloud-Standorten}}},
  year         = {{2012}},
}

@misc{594,
  author       = {{Klerx, Timo}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Online Parameteroptimierung in P2P-Netzwerken mit Hilfe von Neuronalen Netzen}}},
  year         = {{2012}},
}