@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{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},
}
@inproceedings{597,
abstract = {We consider strategic games in which each player seeks a mixed strategy to minimize her cost evaluated by a concave valuation V (mapping probability distributions to reals); such valuations are used to model risk. In contrast to games with expectation-optimizer players where mixed equilibria always exist [15, 16], a mixed equilibrium for such games, called a V -equilibrium, may fail to exist, even though pure equilibria (if any) transfer over. What is the impact of such valuations on the existence, structure and complexity of mixed equilibria? We address this fundamental question for a particular concave valuation: expectation plus variance, denoted as RA, which stands for risk-averse; so, variance enters as a measure of risk and it is used as an additive adjustment to expectation. We obtain the following results about RA-equilibria:- A collection of general structural properties of RA-equilibria connecting to (i) E-equilibria and Var-equilibria, which correspond to the expectation and variance valuations E and Var, respectively, and to (ii) other weaker or incomparable equilibrium properties.- A second collection of (i) existence, (ii) equivalence and separation (with respect to E-equilibria), and (iii) characterization results for RA-equilibria in the new class of player-specific scheduling games. Using examples, we provide the first demonstration that going from E to RA may as well create new mixed (RA-)equilibria.- A purification technique to transform a player-specific scheduling game on identical links into a player-specific scheduling game so that all non-pure RA-equilibria are eliminated while new pure equilibria cannot be created; so, a particular game on two identical links yields one with no RA-equilibrium. As a by-product, the first-completeness result for the computation of RA-equilibria follows.},
author = {Mavronicolas, Marios and Monien, Burkhard},
booktitle = {Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT)},
pages = {239--250},
title = {{Minimizing Expectation Plus Variance}},
doi = {10.1007/978-3-642-33996-7_21},
year = {2012},
}
@misc{600,
author = {Feldkord, Björn},
publisher = {Universität Paderborn},
title = {{Lokale Swaps und überholte Informationen in Basic Network Creation Games}},
year = {2012},
}
@misc{605,
author = {Isenberg, Florian},
publisher = {Universität Paderborn},
title = {{Implementierung eines adaptiven Verfahrens zur Linearisierung von nicht-konvexen, nichtlinearen Wassernetzmodellen mit Hilfe einer Fehlerabschätzung}},
year = {2012},
}
@misc{566,
author = {Hilger, Ina},
publisher = {Universität Paderborn},
title = {{Untersuchung von Modellen zur operativen Planung in Trinkwasserversorgungsnetzwerken}},
year = {2012},
}
@article{5497,
author = {Maekelburger, B and Schwens, C and Kabst, Rüdiger},
journal = {Journal of International Business Studies (JIBS).},
number = {5},
pages = {458--476},
title = {{Asset Specificity and Foreign Market Entry Mode Choice of Small and Medium-Sized Enterprises: The Moderating Influence of Knowledge Safeguards and Institutional Safeguards.}},
volume = {42},
year = {2012},
}
@article{5512,
author = {Frese, M and Bausch, A and Schmidt, P and Rauch, A and Kabst, Rüdiger},
journal = {Foundations and Trends in Entrepreneurship. },
number = {1},
pages = {1--62},
title = {{Evidence-based entrepreneurship (EBE): Cumulative science, action principles, and bridging the gap between science and practice.}},
volume = {8},
year = {2012},
}
@inproceedings{5579,
author = {Wex, Felix and Schryen, Guido and Neumann, Dirk},
booktitle = {International Conference on Information Systems for Crisis Response and Management (ISCRAM) 2012},
title = {{Operational Emergency Response under Informational Uncertainty: A Fuzzy Optimization Model for Scheduling and Allocating Rescue Units}},
year = {2012},
}
@misc{592,
author = {Celik, Aydin},
publisher = {Universität Paderborn},
title = {{Penny Auctions: Design und Strategisches Verhalten}},
year = {2012},
}
@inproceedings{617,
abstract = {In this paper, a color based feature extraction and classification approach for image processing in embedded systems in presented. The algorithms and data structures developed for this approach pay particular attention to reduce memory consumption and computation power of the entire image processing, since embedded systems usually impose strong restrictions regarding those resources. The feature extraction is realized in terms of an image segmentation algorithm. The criteria of homogeneity for merging pixels and regions is provided by the color classification mechanism, which incorporates appropriate methods for defining, representing and accessing subspaces in the working color space. By doing so, pixels and regions with color values that belong to the same color class can be merged. Furthermore, pixels with redundant color values that do not belong to any pre-defined color class can be completely discarded in order to minimize computational effort. Subsequently, the extracted regions are converted to a more convenient feature representation in terms of statistical moments up to and including second order. For evaluation, the whole image processing approach is applied to a mobile representative of embedded systems within the scope of a simple real-world scenario.},
author = {Jungmann, Alexander and Kleinjohann, Bernd and Kleinjohann, Elisabeth and Bieshaar, Maarten},
booktitle = {Proceedings of the Fourth International Conference on Resource Intensive Applications and Services (INTENSIVE)},
pages = {22--29},
title = {{Efficient Color-Based Image Segmentation and Feature Classification for Image Processing in Embedded Systems}},
year = {2012},
}
@misc{624,
author = {Jakobs, Marie-Christine},
publisher = {Universität Paderborn},
title = {{Change and Validity Analysis in Deductive Program Verification}},
year = {2012},
}
@article{6250,
author = {Paelke, Volker and Nebe, Karsten and Geiger, Christian and Klompmaker, Florian and Fischer, Holger Gerhard},
issn = {1682-1777},
journal = {ISPRS - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences},
pages = {55--60},
publisher = {Copernicus GmbH},
title = {{Multi-Modal, Multi-Touch Interaction with Maps in Disaster Management Applications}},
doi = {10.5194/isprsarchives-xxxix-b8-55-2012},
volume = {XXXIX-B8},
year = {2012},
}
@inproceedings{6281,
author = {Wehner, M C and Giardini, A and Kabst, Rüdiger},
title = {{Recruitment Process Outsourcing and Applicant Reactions: Does Image Make a Difference?}},
year = {2012},
}
@inproceedings{6286,
author = {Klompmaker, Florian and Fischer, Holger Gerhard and Jung, Helge},
booktitle = {Proceedings of the 5th International Conference on Advances in Computer-Human Interaction (ACHI)},
pages = {141--144},
publisher = {IARIA},
title = {{Authenticated Tangible Interaction using RFID and Depth-Sensing Cameras - Supporting Collaboration on Interactive Tabletops}},
year = {2012},
}
@misc{629,
author = {Schleiter, Patrick},
publisher = {Universität Paderborn},
title = {{Attribute-basierte Verschlüsselung}},
year = {2012},
}
@article{6988,
author = {Tramm, T. and Seeber, S. and Kremer, H.-Hugo},
journal = {bwp@ Berufs- und Wirtschaftspädagogik - online},
number = {22},
title = {{Funktionen und Erträge pädagogischer Diagnostik im wirtschafts- und berufspädagogischen Bereich}},
year = {2012},
}
@inproceedings{612,
abstract = {While numerous publications have presented ring oscillator designs for temperature measurements a detailed study of the ring oscillator's design space is still missing. In this work, we introduce metrics for comparing the performance and area efficiency of ring oscillators and a methodology for determining these metrics. As a result, we present a systematic study of the design space for ring oscillators for a Xilinx Virtex-5 platform FPGA.},
author = {Rüthing, Christoph and Happe, Markus and Agne, Andreas and Plessl, Christian},
booktitle = {Proceedings of the International Conference on Field Programmable Logic and Applications (FPL)},
pages = {559--562},
publisher = {IEEE},
title = {{Exploration of Ring Oscillator Design Space for Temperature Measurements on FPGAs}},
doi = {10.1109/FPL.2012.6339370},
year = {2012},
}
@inproceedings{631,
abstract = {Maintaining software systems requires up-to-date models of these systems to systematically plan, analyze, and execute the necessary reengineering steps. Often, no or only outdated models of such systems exist.Thus, a reverse engineering step is needed that recovers the system's components, subsystems, and connectors. However, reverse engineering methods are severely impacted by design deficiencies in the system's code base, e.g., they lead to wrong component structures.Therefore, Archimetrix enables the reengineer to detect the most relevant deficiencies with respect to a reverseengineered component-based architecture and supports him by presenting the architectural consequences of removinga given deficiency.},
author = {von Detten, Markus},
booktitle = {Proceedings of the 19th Working Conference on Reverse Engineering (WCRE)},
pages = {503 -- 504 },
title = {{Archimetrix: A Tool for Deficiency-Aware Software Architecture Reconstruction}},
doi = {10.1109/WCRE.2012.61},
year = {2012},
}
@inproceedings{636,
abstract = {We consider an online facility location problem where clients arrive over time and their demands have to be served by opening facilities and assigning the clients to opened facilities. When opening a facility we must choose one of K different lease types to use. A lease type k has a certain lease length lk. Opening a facility i using lease type k causes a cost of f k i and ensures that i is open for the next lk time steps. In addition to costs for opening facilities, we have to take connection costs ci j into account when assigning a client j to facility i. We develop and analyze the first online algorithm for this problem that has a time-independent competitive factor.This variant of the online facility location problem was introduced by Nagarajan and Williamson [7] and is strongly related to both the online facility problem by Meyerson [5] and the parking permit problem by Meyerson [6]. Nagarajan and Williamson gave a 3-approximation algorithm for the offline problem and an O(Klogn)-competitive algorithm for the online variant. Here, n denotes the total number of clients arriving over time. We extend their result by removing the dependency on n (and thereby on the time). In general, our algorithm is O(lmax log(lmax))-competitive. Here lmax denotes the maximum lease length. Moreover, we prove that it is O(log2(lmax))-competitive for many “natural” cases. Such cases include, for example, situations where the number of clients arriving in each time step does not vary too much, or is non-increasing, or is polynomially bounded in lmax.},
author = {Meyer auf der Heide, Friedhelm and Pietrzyk, Peter and Kling, Peter},
booktitle = {Proceedings of the 19th International Colloquium on Structural Information & Communication Complexity (SIROCCO)},
pages = {61--72},
title = {{An Algorithm for Facility Leasing}},
doi = {10.1007/978-3-642-31104-8_6},
year = {2012},
}