@misc{416, author = {{Bemmann, Pascal}}, publisher = {{Universität Paderborn}}, title = {{{Group Signature Schemes with Strong Exculpability}}}, year = {{2014}}, } @inproceedings{417, abstract = {{Model transformation is a key concept in modeldrivensoftware engineering. The definition of model transformationsis usually based on meta-models describing the abstractsyntax of languages. While meta-models are thereby able to abstractfrom superfluous details of concrete syntax, they often loosestructural information inherent in languages, like information onmodel elements always occurring together in particular shapes.As a consequence, model transformations cannot naturally re-uselanguage structures, thus leading to unnecessary complexity intheir development as well as analysis.In this paper, we propose a new approach to model transformationdevelopment which allows to simplify and improve thequality of the developed transformations via the exploitation ofthe languages’ structures. The approach is based on context-freegrammars and transformations defined by pairing productions ofsource and target grammars. We show that such transformationsexhibit three important characteristics: they are sound, completeand deterministic.}}, author = {{Besova, Galina and Steenke, Dominik and Wehrheim, Heike}}, booktitle = {{Proceedings 3rd Workshop on Model Driven Approaches in System Development (MDASD)}}, pages = {{1601--1610}}, title = {{{Grammar-based model transformations}}}, doi = {{10.1016/j.cl.2015.05.003}}, year = {{2014}}, } @misc{418, author = {{Pauck, Felix}}, publisher = {{Universität Paderborn}}, title = {{{Generierung von Eigenschaftsprüfern in einem Hardware/Software-Co-Verifikationsverfahren}}}, year = {{2014}}, } @misc{421, author = {{Lippert, Jan}}, publisher = {{Universität Paderborn}}, title = {{{Fujisaki-Okamoto Transformation}}}, year = {{2014}}, } @misc{426, author = {{Dornseifer, Veit}}, publisher = {{Universität Paderborn}}, title = {{{Evaluation of a Hybrid Packet-/Circuit-Switched Data Center Network}}}, year = {{2014}}, } @inproceedings{428, abstract = {{Services are self-contained software components that can be used platform independent and that aim at maximizing software reuse. A basic concern in service oriented architectures is to measure the reusability of services. One of the most important qualities is the functional reusability, which indicates how relevant the task is that a service solves. Current metrics for functional reusability of software, however, either require source code analysis or have very little explanatory power. This paper gives a formally described vision statement for the estimation of functional reusability of services and sketches an exemplary reusability metric that is based on the service descriptions.}}, author = {{Mohr, Felix}}, booktitle = {{Proceedings of the 12th International Conference on Service Oriented Computing (ICSOC)}}, pages = {{411--418}}, title = {{{Estimating Functional Reusability of Services}}}, year = {{2014}}, } @phdthesis{431, abstract = {{In meiner Dissertation besch{\"a}ftige ich mich mit dem Entwurf und der Analyse energieeffizienter Schedulingalgorithmen, insbesondere f{\"u}r sogenannte Speed-Scaling Modelle. Diese stellen das theoretische Pendant von Techniken wie AMDs PowerNOW! und Intels SpeedStep dar, welche es erlauben die Geschwindigkeit von Prozessoren zur Laufzeit an die derzeitigen Bedingungen anzupassen. Theoretische Untersuchungen solcher Modelle sind auf eine Arbeit von Yao, Demers und Shenker (FOCS'95) zur{\"u}ckzuf{\"u}hren. Hier kombinieren die Autoren klassisches Deadline-Scheduling mit einem Prozessor der Speed-Scaling beherrscht. Es gilt Jobs verschiedener Gr{\"o}ße fristgerecht abzuarbeiten und die dabei verwendete Energie zu minimieren. Der Energieverbrauch des Prozessors wird durch eine konvexe Funktion $\POW\colon\R_{\geq0}\to\R_{\geq0}$ modelliert, welche die Geschwindigkeit auf den Energieverbrauch abbildet.Meine Dissertation betrachtet verschiedene Varianten des urspr{\"u}nglichen Speed-Scaling Modells. Forschungsrelevante Ergebnisse sind in den Kapiteln 3 bis 6 zu finden und erstrecken sich {\"u}ber die im Folgenden beschriebenen Aspekte:- Kapitel 3 und 4 betrachten verschiedene \emph{Price-Collecting} Varianten des Originalproblems. Hier d{\"u}rfen einzelne Deadlines verfehlt werden, sofern eine jobabh{\"a}ngige Strafe gezahlt wird. Ich entwerfe insbesondere Online-Algorithmen mit einer beweisbar guten Competitiveness. Dabei liefern meine Ergebnisse substantielle Verbesserungen bestehender Arbeiten und erweitern diese unter Anderem auf Szenarien mit mehreren Prozessoren.- In Kapitel 5 wird statt des klassischen Deadline-Schedulings eine Linearkombination der durchschnittlichen Antwortzeit und des Energieverbrauchs betrachtet. Die Frage, ob dieses Problem NP-schwer ist, stellt eine der zentralen Forschungsfragen in diesem Gebiet dar. F{\"u}r eine relaxierte Form dieser Frage entwerfe ich einen effizienter Algorithmus und beweise seine Optimalit{\"a}t.- Das letzte Kapitel betrachtet ein Modell, welches – auf den ersten Blick – nicht direkt zur Speed-Scaling Literatur z{\"a}hlt. Hier geht es stattdessen um ein allgemeines Resource-Constrained Scheduling, in dem sich die Prozessoren zusammen eine gemeinsame, beliebig aufteilbare Ressource teilen. Ich untersuche die Komplexit{\"a}t des Problems und entwerfe verschiedene Approximationsalgorithmen.}}, author = {{Kling, Peter}}, publisher = {{Universität Paderborn}}, title = {{{Energy-efficient Scheduling Algorithms}}}, year = {{2014}}, } @misc{432, author = {{Bredenbals, Nico}}, publisher = {{Universität Paderborn}}, title = {{{Energy-Efficient Queuing with Delayed Deactivation}}}, year = {{2014}}, } @inproceedings{433, abstract = {{Virtual FPGAs are overlay architectures realized on top of physical FPGAs. They are proposed to enhance or abstract away from the physical FPGA for experimenting with novel architectures and design tool flows. In this paper, we present an embedding of a ZUMA-based virtual FPGA fabric into a complete configurable system-on-chip. Such an embedding is required to fully harness the potential of virtual FPGAs, in particular to give the virtual circuits access to main memory and operating system services, and to enable a concurrent operation of virtualized and non-virtualized circuitry. We discuss our extension to ZUMA and its embedding into the ReconOS operating system for hardware/software systems. Furthermore, we present an open source tool flow to synthesize configurations for the virtual FPGA.}}, author = {{Wiersema, Tobias and Bockhorn, Arne and Platzner, Marco}}, booktitle = {{Proceedings of the International Conference on ReConFigurable Computing and FPGAs (ReConFig)}}, pages = {{1--6 }}, title = {{{Embedding FPGA Overlays into Configurable Systems-on-Chip: ReconOS meets ZUMA}}}, doi = {{10.1109/ReConFig.2014.7032514}}, year = {{2014}}, } @inproceedings{435, abstract = {{We give a polynomial time algorithm to compute an optimal energy and fractional weighted flow trade-off schedule for a speed-scalable processor with discrete speeds.Our algorithm uses a geometric approach that is based on structural properties obtained from a primal-dual formulation of the problem.}}, author = {{Antoniadis, Antonios and Barcelo, Neal and Consuegra, Mario and Kling, Peer and Nugent, Michael and Pruhs, Kirk and Scquizzato, Michele}}, booktitle = {{Proceedings of the 31st Symposium on Theoretical Aspects of Computer Science (STACS)}}, pages = {{63----74}}, title = {{{Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-off Schedules}}}, doi = {{10.4230/LIPIcs.STACS.2014.63}}, year = {{2014}}, } @inproceedings{5189, author = {{Arzt, Steven and Rasthofer, Siegfried and Fritz, Christian and Bodden, Eric and Bartel, Alexandre and Klein, Jacques and Le Traon, Yves and Octeau, Damien and McDaniel, Patrick}}, booktitle = {{Proceedings of the 35th ACM SIGPLAN Conference on Programming Language Design and Implementation - PLDI '14}}, isbn = {{9781450327848}}, publisher = {{ACM Press}}, title = {{{FlowDroid: Precise Context, Flow, Field, Object-sensitive and Lifecycle-aware Taint Analysis for Android Apps}}}, doi = {{10.1145/2594291.2594299}}, year = {{2014}}, } @inproceedings{5190, author = {{Arzt, Steven and Rasthofer, Siegfried and Lovat, Enrico and Bodden, Eric}}, booktitle = {{International Conference on Availability, Reliability and Security (ARES 2014)}}, pages = {{40--49}}, publisher = {{IEEE}}, title = {{{DroidForce: Enforcing Complex, Data-Centric, System-Wide Policies in Android}}}, year = {{2014}}, } @phdthesis{6727, author = {{van Rooijen, Lorijn}}, publisher = {{University of Bordeaux, France}}, title = {{{A combinatorial approach to the separation problem for regular languages. (Une approche combinatoire du problème de séparation pour les langages réguliers)}}}, year = {{2014}}, } @article{6728, author = {{Place, Thomas and van Rooijen, Lorijn and Zeitoun, Marc}}, issn = {{1860-5974}}, journal = {{Logical Methods in Computer Science}}, number = {{3}}, publisher = {{Logical Methods in Computer Science e.V.}}, title = {{{On Separation by Locally Testable and Locally Threshold Testable Languages}}}, doi = {{10.2168/lmcs-10(3:24)2014}}, volume = {{10}}, year = {{2014}}, } @inproceedings{6741, author = {{Bokermann, Dennis and Gerth, Christian and Engels, Gregor}}, booktitle = {{12th International Conference on Business Process Management (BPM 2014)}}, isbn = {{9783319101712}}, issn = {{0302-9743}}, pages = {{357--365}}, publisher = {{Springer International Publishing}}, title = {{{Use Your Best Device! Enabling Device Changes at Runtime}}}, doi = {{10.1007/978-3-319-10172-9_23}}, volume = {{8659}}, year = {{2014}}, } @inproceedings{1647, author = {{Dräxler, Martin and Karl, Holger}}, booktitle = {{Proceedings of 20th European Wireless Conference }}, title = {{{Feasibility of Base Station Coordination and Dynamic Backhaul Network Configuration in Backhaul Networks with Limited Capacity}}}, year = {{2014}}, } @inproceedings{1654, author = {{Herlich, Matthias and Karl, Holger}}, booktitle = {{12th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt) 2014}}, isbn = {{9783901882630}}, publisher = {{IEEE}}, title = {{{Analytic quantification of outage probability and radiated power of cooperative base stations}}}, doi = {{10.1109/wiopt.2014.6850365}}, year = {{2014}}, } @inproceedings{16760, author = {{Arens, S. and Domik, Gitta and Weise, R. and Holzinger, J. and Burchert, W.}}, location = {{Hannover}}, title = {{{Optimierte 3D Morphologiedarstellung tomographischer Datensätze des Herzens}}}, year = {{2014}}, } @book{16870, editor = {{Flocchini, Paola and Gao, Jie and Kranakis, Evangelos and Meyer auf der Heide, Friedhelm}}, isbn = {{9783642453458}}, issn = {{0302-9743}}, publisher = {{Springer}}, title = {{{Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS} 2013}}}, doi = {{10.1007/978-3-642-45346-5}}, volume = {{8243}}, year = {{2014}}, } @article{10602, author = {{Schaefers, Lars and Platzner, Marco}}, journal = {{IEEE Transactions on Computational Intelligence and AI in Games}}, number = {{3}}, pages = {{361--374}}, title = {{{A Novel Technique and its Application to Computer Go}}}, doi = {{10.1109/TCIAIG.2014.2346997}}, volume = {{6}}, year = {{2014}}, }