TY - JOUR AU - Büchter, K. AU - Gramlinger, F. AU - Kremer, H.-Hugo AU - Tenberg , R. AU - Tramm, T. ID - 6474 JF - bwp@ Berufs- und Wirtschaftspädagogik - online, Jubiläumsausgabe TI - bwp@ Berufs- und Wirtschaftspädagogik - online 2011-2011: Verortung, Selbstverständnis und Entwicklung ER - TY - GEN AU - Brandes, Philipp ID - 648 TI - Robust Distributed Computation in Dynamic Networks ER - TY - JOUR AB - Today, the concept of service oriented architectures provides a way of building integrated solutions out of existing services. To this end, services from different providers are composed using advanced orchestration and choreography techniques. However, while this principle allows for greater flexibility at a smaller cost, the use of third party services also includes a risk: Deployed services might not work as claimed by their providers. In this paper, we propose a technique for analyzing the expected reliability of service compositions based on ratings given by (previous) service users. Every service thereby comes with a reputation, and the analysis computes an overall reliability of a service composition from the reputations of its constituent services. The proposed model-driven approach proceeds by translating statechart models of service compositions into input for a probabilistic model checker (PRISM) using state-of-the-art model transformations techniques. The approach has been implemented as an Eclipse plug-in and is fully compliant with UML. AU - Besova, Galina AU - Wehrheim, Heike AU - Wagner, Annika ID - 649 IS - 2 JF - Electronic Notes in Theoretical Computer Science TI - Reputation-based Reliability Prediction of Service Compositions ER - TY - GEN AU - Platenius, Marie Christin ID - 650 TI - Reengineering of Design Deficiencies in Component-Based Software Architectures ER - TY - GEN AU - Stroh-Maraun, Nadja ID - 651 TI - Prozedurale Ansätze zur Lösung mehrdimensionaler Verhandlungsprobleme ER - TY - CONF AB - In the development process of service-oriented systems, business process models are used at different levels. Typically, high-level business process models that describe business requirements and needs are stepwise refined to the IT level by different business modelers and software architects. As a result, different process model versions must be compared and merged by means of model version control. An important prerequisite for process model version control is an elaborated matching approach that results in precise mappings between different process model versions. The challenge of such an approach is to deal with syntactically different process models that are semantically equivalent. For that purpose, matching techniques must consider the semantics of process modeling languages.In this paper, we present a matching approach for process models in a versioning scenario. Based on a term formalization of process models, we enable an efficient and effective way to match syntactically different but semantically equivalent process models resulting in precise mappings. AU - Gerth, Christian AU - Luckey, Markus AU - Küster, Jochen AU - Engels, Gregor ID - 652 T2 - Proceedings of the IEEE 8th International Conference on Service Computingt (SCC) TI - Precise Mappings between Business Process Models in Versioning Scenarios ER - TY - CONF AB - Performance prototyping is an often used technique to assess the performance of software architectures early in the development process without relying on models of the system under study. ProtoCom is a prototype generator for the PCM realised as model-2-text transformation for which no experience report in a larger, virtualised setting exists. In this paper, we report on four case studies performed with an improved version of ProtoCom and report on the results gained with respect to analysis accuracy and usability. Our results demonstrate that the new version is much easier to use than previous versions and that results gained in our virtualised execution environment help in early assessments of performance under realistic conditions. AU - Lehrig, Sebastian AU - Zolynski, Thomas ID - 653 T2 - Proceedings of the Palladio Days 2011 TI - Performance Prototyping with ProtoCom in a Virtualised Environment: A Case Study ER - TY - CONF AB - Research on peer-to-peer (p2p) and distributed systems needs evaluation tools to predict and observe the behavior of protocols and mechanisms in large scale networks. PeerfactSim.KOM is a simulator for large scale distributed/p2p systems aiming at the evaluation of interdependencies in multi-layered p2p systems. The simulator is written in Java, is event-based and mainly used in p2p research projects. The main development of PeerfactSim.KOM started in 2005 and is driven since 2006 by the project “QuaP2P”,which aims at the systematic improvement and benchmarking of p2p systems. Further users of the simulator are working in the project “On-the-fly Computing” aiming at researching p2p-based service oriented architectures. Both projects state severe requirements on the evaluation of multi-layered and large-scale distributed systems. We describe the architecture of PeerfactSim.KOM supporting these requirements in Section II, present the workflow, selected experiences and lessons learned in Section III and conclude the overview in Section IV. AU - Graffi, Kalman ID - 654 T2 - Proceedings of the IEEE International Conference on Peer-to-Peer Computing (IEEE PsP) TI - PeerfactSim.KOM: A PSP System Simulator - Experiences and Lessons Learned ER - TY - GEN AU - Meyer, Joachim ID - 655 TI - Modellgetriebene Skalierbarkeitsanalyse von selbst-adaptiven Komponentenbasierten Softwaresystemen in der Cloud ER - TY - CONF AB - We present two distributed, constant factor approximation algorithms for the metric facility location problem. Both algorithms have been designed with a strong emphasis on applicability in the area of wireless sensor networks: in order to execute them, each sensor node only requires limited local knowledge and simple computations. Also, the algorithms can cope with measurement errors and take into account that communication costs between sensor nodes do not necessarily increase linearly with the distance, but can be represented by a polynomial. Since it cannot always be expected that sensor nodes execute algorithms in a synchronized way, our algorithms are executed in an asynchronous model (but they are still able to break symmetry that might occur when two neighboring nodes act at exactly the same time). Furthermore, they can deal with dynamic scenarios: if a node moves, the solution is updated and the update affects only nodes in the local neighborhood. Finally, the algorithms are robust in the sense that incorrect behavior of some nodes during some round will, in the end, still result in a good approximation. The first algorithm runs in expected O(log_{1+\epsilon} n) communication rounds and yields a \my^4(1+4\my^2(1+\epsilon)^{1/p})^p approximation, while the second has a running time of expected O(log^2_{1+\epsilon} n) communication rounds and an approximation factor of \my^4(1 + 2(1 + \epsilon)^{1/p})^p. Here, \epsilon > 0 is an arbitrarily small constant, p the exponent of the polynomial representing the communication costs, and \my the relative measurement error. AU - Abshoff, Sebastan AU - Cord-Landwehr, Andreas AU - Degener, Bastian AU - Kempkes, Barbara AU - Pietrzyk, Peter ID - 657 T2 - Proceedings of the 7th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities (ALGOSENSORS) TI - Local Approximation Algorithms for the Uncapacitated Metric Facility Location Problem in Power-Aware Sensor Networks ER - TY - GEN AU - Schremmer, Alexander ID - 658 TI - Function Specification Inference Using Craig Interpolation ER - TY - GEN AU - Liske, Gennadij ID - 659 TI - Fault attacks in pairing-based cryptography ER - TY - GEN AU - Peuster, Manuel ID - 660 TI - Defining and Deploying Complex Applicances in Multi-Site Cloud Environments ER - TY - GEN AU - Arifulina, Svetlana ID - 661 TI - Coverage Criteria for Testing DMM Specifications ER - TY - CONF AB - We present Corona, a deterministic self-stabilizing algorithm for skip list construction in structured overlay networks. Corona operates in the low-atomicity message-passing asynchronous system model. Corona requires constant process memory space for its operation and, therefore, scales well. We prove the general necessary conditions limiting the initial states from which a self-stabilizing structured overlay network in message-passing system can be constructed. The conditions require that initial state information has to form a weakly connected graph and it should only contain identiers that are present in the system. We formally describe Corona and rigorously prove that it stabilizes from an arbitrary initial state subject to the necessary conditions. We extend Corona to construct a skip graph. AU - Nesterenko, Mikhail AU - Mohd, Rizal AU - Scheideler, Christian ID - 662 T2 - Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) TI - Corona: A Stabilizing Deterministic Message-Passing Skip List ER - TY - GEN AU - Swierkot, Kamil ID - 663 TI - Complexity Classes for Local Computation ER - TY - CONF AB - Web Computing is a variant of parallel computing where the idle times of PCs donated by worldwide distributed users are employed to execute parallel programs. The PUB-Web library developed by us supports this kind of usage of computing resources. A major problem for the efficient execution of such parallel programs is load balancing. In the Web Computing context, this problem becomes more difficult because of the dynamic behavior of the underlying "parallel computer": the set of available processors (donated PCs) as well as their availability (idle times) change over time in an unpredictable fashion.In this paper, we experimentally evaluate and compare load balancing algorithms in this scenario, namely a variant of the well-established Work Stealing algorithm and strategies based on a heterogeneous version of distributed hash-tables (DHHTs) introduced recently. In order to run a meaningful experimental evaluation, we employ, in addition to our Web Computing library PUB-Web, realistic data sets for the job input streams and for the dynamics of the availability of the resources.Our experimental evaluations suggest that Work Stealing is the better strategy if the number of processes ready to run matches the number of available processors. But a suitable variant of DHHTs outperforms Work Stealing if there are significantly more processes ready to run than available processors. AU - Gehweiler, Joachim AU - Kling, Peter AU - Meyer auf der Heide, Friedhelm ID - 664 T2 - Proceedings of the 9th International Conference on Parallel Processing and Applied Mathematics (PPAM) TI - An Experimental Comparison of Load Balancing Strategies in a Web Computing Environment ER - TY - GEN AU - Wette, Philip ID - 665 TI - Adaptives Loadbalancing für strukturierte Peer-to-Peer-Netzwerke am Beispiel von Chord ER - TY - CONF AB - Reconfigurable systems on chip are increasingly deployed in security and safety critical contexts. When downloading and configuring new hardware functions, we want to make sure that modules adhere to certain security specifications and do not, for example, contain hardware Trojans. As a possible approach to achieving hardware security we propose and demonstrate the concept of proof-carrying hardware, a concept inspired by previous work on proof-carrying code techniques in the software domain. In this paper, we discuss the hardware trust and threat models behind proof-carrying hardware and then present our experimental setup. We detail the employed open-source tool chain for the runtime verification of combinational equivalence and our bitstream format for an abstract FPGA architecture that allows us to experimentally validate the feasibility of our approach. AU - Drzevitzky, Stephanie AU - Platzner, Marco ID - 666 T2 - Proceedings of the 6th International Workshop on Reconfigurable Communication-centric Systems-on-Chip (ReCoSoC) TI - Achieving Hardware Security for Reconfigurable Systems on Chip by a Proof-Carrying Code Approach ER - TY - GEN ED - Meyer auf der Heide, Friedhelm ED - Rajaraman, Rajmohan ID - 667 TI - 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures ER - TY - GEN AB - The objective of this study is the analysis of movie success mechanisms in a genre-specific context. Instead of the examination of all time box office champions, we focus on the two film genres of computer animated and comic book based films. By introducing the concept of the motion-picture marketing mix, which represents a set of tactical marketing tools in order to strengthen a company’s strategic customer orientation, we are able to systematically identify key movie success factors. We conduct a cross-sectional empirical analysis across regional distinctions based on dataset that covers a time horizon of more than 30 years. We find empirical evidence that actors with ex ante popularity, award nominations and the production budget represent key movie success mechanisms and significantly influence a movie’s commercial appeal. Additionally, word-of-mouth creates reputation effects that also significantly affects box office gross. AU - Kaimann, Daniel ID - 668 TI - "To infinity and beyond!" - A genre-specific film analysis of movie success mechanisms ER - TY - CONF AU - Böttcher, Stefan AU - Bokermann, Dennis AU - Hartel, Rita ID - 6740 T2 - Advances in Databases - 28th British National Conference on Databases, BNCOD 28, Revised Selected Papers TI - Computing Compressed XML Data from Relational Databases VL - 7051 ER - TY - BOOK ED - Tönnies, Merle ED - Flotmann, Christina ID - 6755 TI - Narrative in Drama ER - TY - CONF AU - Bendfeld, Jörg AU - Krauter, Stefan ID - 6833 T2 - Wissenschaftliche Verhandlungen 2011 der Deutschen Physikalischen Gesellschaft, Dresden, März 2011 TI - Meteorological measurements in the Baltic and the North Sea ER - TY - CONF AU - Bendfeld, Jörg AU - Krauter, Stefan ID - 6834 T2 - Wissenschaftliche Verhandlungen 2011 der Deutschen Physikalischen Gesellschaft, Dresden, März 2011 TI - Hybrid measuring devices for evaluation of waves and currents ER - TY - CONF AU - Bendfeld, Jörg ID - 6835 T2 - Proceedings of the Decentralized Power Systems (DPS) 2011, Paderborn, Germany, 2. September 2011 TI - Increased availability of offshore wind power by distributed biogas plants ER - TY - JOUR AU - Kühnle, E. AU - Krauter, Stefan ID - 6840 JF - Forschung & Entwicklung, Photovoltaik TI - Zehn Quadratmeter für die Langstrecke VL - 12 ER - TY - JOUR AU - Krauter, Stefan ID - 6842 IS - 83 JF - Emobile TI - Lektionen aus der WAVE 2011 ER - TY - CONF AU - Wendland, S. AU - Drobisch, A. AU - Krauter, Stefan AU - Grunow, Paul ID - 6843 T2 - Tagungsband des 26. Symposiums für Photovoltaische Solarenergie, Kloster Banz, Bad Staffelstein (Deutschland), 2.-4. März 2011 TI - Hot-Spot-Untersuchungen in unterschiedlichen Arbeitspunkten bei PV-Modulen ER - TY - JOUR AU - Preiss, A. AU - Krauter, Stefan AU - Schoppa, M. AU - Luck, I. ID - 6885 JF - Photovoltaics International TI - PV Module testing – how to ensure PV module quality after PV module certification VL - 13 ER - TY - CONF AU - Koch, S. AU - Kupke, J. AU - Tomow, D. AU - Schoppa, M. AU - Grunow, Paul AU - Krauter, Stefan ID - 6886 T2 - Proceedings of the 26th European Photovoltaic Solar Energy Conference and Exhibition TI - Polarisation Effects and Tests for Crystalline Silicon Cells ER - TY - CONF AU - Böttcher, A. AU - Horstmann, M. AU - Grunow, Paul AU - Pourhashemi, R. AU - Krauter, Stefan ID - 6887 T2 - Proceedings of the 26th European Photovoltaic Solar Energy Conference and Exhibition TI - Spectral Mismatch Correction for Micromorph Tandem Modules. ER - TY - CONF AU - Weber, T. AU - Albert, A. AU - Grunow, Paul AU - Krauter, Stefan ID - 6888 T2 - Proceedings of the 26th European Photovoltaic Solar Energy Conference and Exhibition TI - Electroluminescence Investigation on Thin Film Modules ER - TY - CONF AU - Wendlandt, S. AU - Drobisch, A. AU - Tomow, D. AU - Friedrichs, M. AU - Krauter, Stefan AU - Grunow, Paul ID - 6889 T2 - Proceedings of the ISES Solar Word Congress TI - Operating principle of a shadowed c-Si solar cell in PV modules ER - TY - CONF AB - Gathering n mobile robots in one single point in the Euclidean plane is a widely studied problem from the area of robot formation problems. Classically, the robots are assumed to have no physical extent, and they are able to share a position with other robots. We drop these assumptions and investigate a similar problem for robots with (a spherical) extent: the goal is to gather the robots as close together as possible. More exactly, we want the robots to form a sphere with minimum radius around a predefined point. We propose an algorithm for this problem which synchronously moves the robots towards the center of the sphere unless they block each other. In this case, if possible, the robots spin around the center of the sphere. We analyze this algorithm experimentally in the plane. If R is the distance of the farthest robot to the center of the sphere, the simulations indicate a runtime which is linear in n and R. Additionally, we prove a theoretic upper bound for the runtime of O(nR) for a discrete version of the problem. Simulations also suggest a runtime of O(n + R) for the discrete version. AU - Cord-Landwehr, Andreas AU - Degener, Bastian AU - Fischer, Matthias AU - Hüllmann, Martina AU - Kempkes, Barbara AU - Klaas, Alexander AU - Kling, Peter AU - Kurras, Sven AU - Märtens, Marcus AU - Meyer auf der Heide, Friedhelm AU - Raupach, Christoph AU - Swierkot, Kamil AU - Warner, Daniel AU - Weddemann, Christoph AU - Wonisch, Daniel ID - 16410 IS - 6543 SN - 0302-9743 T2 - 37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2011) TI - Collisionless Gathering of Robots with an Extent ER - TY - CHAP AU - Gehweiler, Joachim AU - Meyer auf der Heide, Friedhelm ID - 16412 SN - 9783642153273 T2 - Algorithms Unplugged TI - Bin Packing - How Do I Get My Stuff into the Boxes ER - TY - CONF AU - Rajaraman, Rajmohan AU - Meyer auf der Heide, Friedhelm ID - 16428 SN - 9781450307437 TI - Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA '11 ER - TY - JOUR AU - Degener, Bastian AU - Fekete, Sándor P. AU - Kempkes, Barbara AU - Meyer auf der Heide, Friedhelm ID - 16447 JF - Computer Science Review SN - 1574-0137 TI - A survey on relay placement with runtime and approximation guarantees ER - TY - CONF AU - Brandes, Philipp AU - Degener, Bastian AU - Kempkes, Barbara AU - Meyer auf der Heide, Friedhelm ID - 16451 T2 - SIROCCO '11: Proc. of the 18th International Colloquium on Structural Information and Communication Complexity TI - Energy-efficient strategies for building short chains of mobile robots locally ER - TY - CONF AU - Degener, Bastian AU - Kempkes, Barbara AU - Langner, Tobias AU - Meyer auf der Heide, Friedhelm AU - Pietrzyk, Peter AU - Wattenhofer, Roger ID - 16453 SN - 9781450307437 T2 - Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA '11 TI - A tight runtime bound for synchronous gathering of autonomous robots with limited visibility ER - TY - CONF AU - Kling, Peter AU - Meyer auf der Heide, Friedhelm ID - 16454 SN - 9781450307437 T2 - Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA '11 TI - Convergence of local communication chain strategies via linear transformations ER - TY - JOUR AU - Degener, Bastian AU - Kempkes, Barbara AU - Meyer auf der Heide, Friedhelm ID - 16455 JF - Procedia Computer Science SN - 1877-0509 TI - Building Simple Formations in Large Societies of Tiny Mobile Robots ER - TY - CHAP AU - Degener, Bastian AU - Kempkes, Barbara AU - Meyer auf der Heide, Friedhelm ID - 16456 SN - 9783034801294 T2 - Organic Computing — A Paradigm Shift for Complex Systems TI - Energy-Awareness in Self-organising Robotic Exploration Teams ER - TY - CHAP AU - Brandes, Philipp AU - Degener, Bastian AU - Kempkes, Barbara AU - Meyer auf der Heide, Friedhelm ID - 16459 SN - 0302-9743 T2 - Structural Information and Communication Complexity TI - Energy-Efficient Strategies for Building Short Chains of Mobile Robots Locally ER - TY - CONF AU - Flaßkamp, Kathrin AU - Ober-Blöbaum, Sina ID - 16588 SN - 9781450306294 T2 - Proceedings of the 14th international conference on Hybrid systems: computation and control - HSCC '11 TI - Variational formulation and optimal control of hybrid lagrangian systems ER - TY - JOUR AU - Klus, Stefan AU - Sahai, Tuhin AU - Liu, Cong AU - Dellnitz, Michael ID - 16624 JF - Journal of Computational and Applied Mathematics SN - 0377-0427 TI - An efficient algorithm for the parallel solution of high-dimensional differential equations ER - TY - JOUR AU - Krüger, Martin AU - Witting, Katrin AU - Trächtler, Ansgar AU - Dellnitz, Michael ID - 16629 JF - IFAC Proceedings Volumes SN - 1474-6670 TI - Parametric Model-Order Reduction in Hierarchical Multiobjective Optimization of Mechatronic Systems* ER - TY - JOUR AU - Meyer, A. AU - Dellnitz, M. AU - Hessel-von Molo, M. ID - 16639 JF - Nonlinear Analysis: Hybrid Systems SN - 1751-570X TI - Symmetries in timed continuous Petri nets ER - TY - CONF AU - Arens, S. AU - Isenberg, T. AU - Bolte, M. AU - Domik, Gitta AU - Weise, R. AU - Holzinger, J. AU - Fricke, H. AU - Burchert, W. ID - 16762 T2 - Tagungsband Jahrestagung Nuklearmedizin TI - Räumliche Wahrnehmung ct-angiographischer Koronararterien in einer Curved Planar Reformation mittels Direct Volume Rendering ER - TY - JOUR AU - Krimphove, Dieter ID - 1678 IS - Heft 1 JF - Horus – Marburger Beiträge zur Integration Blinder und Sehbehinderter TI - Europa blind verstehen : Wie Europarecht entsteht und nationales Recht wird ER - TY - CONF AU - Ebert, Achim AU - Domik, Gitta AU - D. Gershon, Nahum AU - C. van der Veer, Gerrit ED - F. Campos, Pedro ED - C. Nicholas Graham, T. ED - A. Jorge, Joaquim ED - Jardim Nunes, Nuno ED - A. Palanque, Philippe ED - Winckler, Marco ID - 16798 T2 - Human-Computer Interaction - {INTERACT} 2011 - 13th {IFIP} {TC} 13 International Conference, Lisbon, Portugal, September 5-9, 2011, Proceedings, Part {IV} TI - Building Bridges - HCI and Visualization VL - 6949 ER - TY - JOUR AU - Hsu, D. Frank AU - Magga, Bruce M. AU - Ho, Howard C. T. AU - Hromkovic, Juraj AU - Lau, Francis C. M. AU - Meyer auf der Heide, Friedhelm ID - 17009 JF - Journal of Interconnection Networks SN - 0219-2659 TI - EDITORIAL ER - TY - JOUR AU - Hage-Packhäuser, Sebastian AU - Dellnitz, Michael ID - 17034 IS - 1 JF - Discrete & Continuous Dynamical Systems - B TI - Stabilization via symmetry switching in hybrid dynamical systems VL - 16 ER - TY - CONF AU - Janiesch, Christian AU - Matzner, Martin AU - Müller, Oliver AU - Vollmer, Robert AU - Becker, Jörg ID - 17125 SN - 9781450301138 T2 - Proceedings of the ACM Symposium on Applied Computing TI - Slipstream: architecture options for real-time process analytics ER - TY - GEN AU - Becker, Jörg AU - Beverungen, Daniel AU - Knackstedt, Ralf AU - Matzner, Martin AU - Müller, Oliver AU - Pöppelfuß, Jens ID - 17126 TI - Flexible Informationssystem-Architekturen für hybride Wertschöpfungsnetzwerke (Flexnet) : Forschungsprojekt im Rahmen der BMBF-Fördermaßnahme Integration von Produktion und Dienstleistung ER - TY - JOUR AU - Utikal, Tobias AU - Zentgraf, Thomas AU - Tikhodeev, Sergei G. AU - Lippitz, Markus AU - Giessen, Harald ID - 1723 IS - 7 JF - Physical Review B SN - 1098-0121 TI - Tailoring the photonic band splitting in metallodielectric photonic crystal superlattices VL - 84 ER - TY - JOUR AU - Gharghi, Majid AU - Gladden, Christopher AU - Zentgraf, Thomas AU - Liu, Yongmin AU - Yin, Xiaobo AU - Valentine, Jason AU - Zhang, Xiang ID - 1724 IS - 7 JF - Nano Letters SN - 1530-6984 TI - A Carpet Cloak for Visible Light VL - 11 ER - TY - CONF AU - Boschmann, Alexander AU - Kaufmann, Paul AU - Platzner, Marco ID - 10637 T2 - Proc. IEEE Int. Conf. Bioinformatics and Biomedical Technology (ICBBT) TI - Accurate gait phase detection using surface electromyographic signals and support vector machines ER - TY - CONF AU - Boschmann, Alexander AU - Platzner, Marco AU - Robrecht, Michael AU - Hahn, Martin AU - Winkler, Michael ID - 10638 T2 - Proc. MyoElectric Controls Symposium (MEC) TI - Development of a pattern recognition-based myoelectric transhumeral prosthesis with multifunctional simultaneous control using a model-driven ppproach for mechatronic systems ER - TY - GEN AU - Ikonomakis, Nikolaos ID - 10678 TI - PinSim: Schnelle Simulation mit Pintools ER - TY - GEN AU - Kassner, Hendrik ID - 10680 TI - MPI-CUDA Codegenerierung für Nanophoton Simulationen auf Clustern ER - TY - CHAP AU - Kaufmann, Paul AU - Platzner, Marco ED - Müller-Schloer, Christian ED - Schmeck, Hartmut ED - Ungerer, Theo ID - 10687 T2 - Organic Computing---A Paradigm Shift for Complex Systems TI - Multi-objective Intrinsic Evolution of Embedded Systems VL - 1 ER - TY - GEN AU - Schwabe, Arne ID - 10736 TI - Analysis of Algorithmic Approaches for Temporal Partitioning ER - TY - CHAP AU - Sekanina, Lukas AU - Walker, James Alfred AU - Kaufmann, Paul AU - Plessl, Christian AU - Platzner, Marco ID - 10737 T2 - Cartesian Genetic Programming TI - Evolution of Electronic Circuits ER - TY - CHAP AU - Walker, James Alfred AU - Miller, Julian F. AU - Kaufmann, Paul AU - Platzner, Marco ID - 10748 T2 - Cartesian Genetic Programming TI - Problem Decomposition in Cartesian Genetic Programming ER - TY - GEN AU - Welp, Daniel ID - 10750 TI - User Space Scheduling for Heterogeneous Systems ER - TY - GEN AU - Feldotto, Matthias ID - 1092 TI - Parallele Kompression von XML mit XML-Schema-Subtraktion ER - TY - CONF AU - Bevermeier, Maik AU - Flanke, Stephan AU - Haeb-Umbach, Reinhold AU - Stehr, Jan ID - 11721 T2 - International Workshop on Intelligent Transportation (WIT 2011) TI - A Platform for efficient Supply Chain Management Support in Logistics ER - TY - CHAP AB - In this contribution classification rules for HMM-based speech recognition in the presence of a mismatch between training and test data are presented. The observed feature vectors are regarded as corrupted versions of underlying and unobservable clean feature vectors, which have the same statistics as the training data. Optimal classification then consists of two steps. First, the posterior density of the clean feature vector, given the observed feature vectors, has to be determined, and second, this posterior is employed in a modified classification rule, which accounts for imperfect estimates. We discuss different variants of the classification rule and further elaborate on the estimation of the clean speech feature posterior, using conditional Bayesian estimation. It is shown that this concept is fairly general and can be applied to different scenarios, such as noisy or reverberant speech recognition. AU - Haeb-Umbach, Reinhold ED - Haeb-Umbach, Reinhold ED - Kolossa, Dorothea ID - 11774 T2 - Robust Speech Recognition of Uncertain or Missing Data TI - Uncertainty Decoding and Conditional Bayesian Estimation ER - TY - CHAP AU - Haeb-Umbach, Reinhold ID - 11775 T2 - Baustelle Informationsgesellschaft und Universität heute TI - Können Computer sprechen und hören, sollen sie es überhaupt können? Sprachverarbeitung und ambiente Intelligenz ER - TY - JOUR AU - Herbig, Tobias AU - Gerl, Franz AU - Minker, Wolfgang AU - Haeb-Umbach, Reinhold ID - 11807 IS - 3 JF - Evolving Systems TI - Adaptive Systems for Unsupervised Speaker Tracking and Speech Recognition VL - 2 ER - TY - CHAP AB - Employing automatic speech recognition systems in hands-free communication applications is accompanied by perfomance degradation due to background noise and, in particular, due to reverberation. These two kinds of distortion alter the shape of the feature vector trajectory extracted from the microphone signal and consequently lead to a discrepancy between training and testing conditions for the recognizer. In this chapter we present a feature enhancement approach aiming at the joint compensation of noise and reverberation to improve the performance by restoring the training conditions. For the enhancement we concentrate on the logarithmic mel power spectral coefficients as features, which are computed at an intermediate stage to obtain the widely used mel frequency cepstral coefficients. The proposed technique is based on a Bayesian framework, to attempt to infer the posterior distribution of the clean features given the observation of all past corrupted features. It exploits information from a priori models describing the dynamics of clean speech and noise-only feature vector trajectories as well as from an observation model relating the reverberant noisy to the clean features. The observation model relies on a simplified stochastic model of the room impulse response (RIR) between the speaker and the microphone, having only two parameters, namely RIR energy and reverberation time, which can be estimated from the captured microphone signal. The performance of the proposed enhancement technique is finally experimentally studied by means of recognition accuracy obtained for a connected digits recognition task under different noise and reverberation conditions using the Aurora~5 database. AU - Krueger, Alexander AU - Haeb-Umbach, Reinhold ED - Haeb-Umbach, Reinhold ED - Kolossa, Dorothea ID - 11843 T2 - Robust Speech Recognition of Uncertain or Missing Data TI - A Model-Based Approach to Joint Compensation of Noise and Reverberation for Speech Recognition ER - TY - CONF AB - The paper proposes a modification of the standard maximum a posteriori (MAP) method for the estimation of the parameters of a Gaussian process for cases where the process is superposed by additive Gaussian observation errors of known variance. Simulations on artificially generated data demonstrate the superiority of the proposed method. While reducing to the ordinary MAP approach in the absence of observation noise, the improvement becomes the more pronounced the larger the variance of the observation noise. The method is further extended to track the parameters in case of non-stationary Gaussian processes. AU - Krueger, Alexander AU - Haeb-Umbach, Reinhold ID - 11845 KW - Gaussian processes KW - MAP-based estimation KW - maximum a posteriori method KW - maximum likelihood estimation KW - nonstationary Gaussian processes T2 - IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP 2011) TI - MAP-based estimation of the parameters of non-stationary Gaussian processes from noisy observations ER - TY - JOUR AB - In this paper, we present a novel blocking matrix and fixed beamformer design for a generalized sidelobe canceler for speech enhancement in a reverberant enclosure. They are based on a new method for estimating the acoustical transfer function ratios in the presence of stationary noise. The estimation method relies on solving a generalized eigenvalue problem in each frequency bin. An adaptive eigenvector tracking utilizing the power iteration method is employed and shown to achieve a high convergence speed. Simulation results demonstrate that the proposed beamformer leads to better noise and interference reduction and reduced speech distortions compared to other blocking matrix designs from the literature. AU - Krueger, Alexander AU - Warsitz, Ernst AU - Haeb-Umbach, Reinhold ID - 11850 IS - 1 JF - IEEE Transactions on Audio, Speech, and Language Processing KW - acoustical transfer function ratio KW - adaptive eigenvector tracking KW - array signal processing KW - beamformer design KW - blocking matrix KW - eigenvalues and eigenfunctions KW - eigenvector-based transfer function ratios estimation KW - generalized sidelobe canceler KW - interference reduction KW - iterative methods KW - power iteration method KW - reduced speech distortions KW - reverberant enclosure KW - reverberation KW - speech enhancement KW - stationary noise TI - Speech Enhancement With a GSC-Like Structure Employing Eigenvector-Based Transfer Function Ratios Estimation VL - 19 ER - TY - CHAP AB - In this contribution, conditional Bayesian estimation employing a phase-sensitive observation model for noise robust speech recognition will be studied. After a review of speech recognition under the presence of corrupted features, termed uncertainty decoding, the estimation of the posterior distribution of the uncorrupted (clean) feature vector will be shown to be a key element of noise robust speech recognition. The estimation process will be based on three major components: an a priori model of the unobservable data, an observation model relating the unobservable data to the corrupted observation and an inference algorithm, finally allowing for a computationally tractable solution. Special stress will be laid on a detailed derivation of the phase-sensitive observation model and the required moments of the phase factor distribution. Thereby, it will not only be proven analytically that the phase factor distribution is non-Gaussian but also that all central moments can (approximately) be computed solely based on the used mel filter bank, finally rendering the moments independent of noise type and signal-to-noise ratio. The phase-sensitive observation model will then be incorporated into a model-based feature enhancement scheme and recognition experiments will be carried out on the Aurora~2 and Aurora~4 databases. The importance of incorporating phase factor information into the enhancement scheme is pointed out by all recognition results. Application of the proposed scheme under the derived uncertainty decoding framework further leads to significant improvements in both recognition tasks, eventually reaching the performance achieved with the ETSI advanced front-end. AU - Leutnant, Volker AU - Haeb-Umbach, Reinhold ED - Haeb-Umbach, Reinhold ED - Kolossa, Dorothea ID - 11856 T2 - Robust Speech Recognition of Uncertain or Missing Data TI - Conditional Bayesian Estimation Employing a Phase-Sensitive Observation Model for Noise Robust Speech Recognition ER - TY - CONF AB - In this work, a splitting and weighting scheme that allows for splitting a Gaussian density into a Gaussian mixture density (GMM) is extended to allow the mixture components to be arranged along arbitrary directions. The parameters of the Gaussian mixture are chosen such that the GMM and the original Gaussian still exhibit equal central moments up to an order of four. The resulting mixtures{\rq} covariances will have eigenvalues that are smaller than those of the covariance of the original distribution, which is a desirable property in the context of non-linear state estimation, since the underlying assumptions of the extended K ALMAN filter are better justified in this case. Application to speech feature enhancement in the context of noise-robust automatic speech recognition reveals the beneficial properties of the proposed approach in terms of a reduced word error rate on the Aurora 2 recognition task. AU - Leutnant, Volker AU - Krueger, Alexander AU - Haeb-Umbach, Reinhold ID - 11866 T2 - Interspeech 2011 TI - A versatile Gaussian splitting approach to non-linear state estimation and its application to noise-robust ASR ER - TY - CONF AB - In this paper we address the problem of initial seed selection for frequency domain iterative blind speech separation (BSS) algorithms. The derivation of the seeding algorithm is guided by the goal to select samples which are likely to be caused by source activity and not by noise and at the same time originate from different sources. The proposed algorithm has moderate computational complexity and finds better seed values than alternative schemes, as is demonstrated by experiments on the database of the SiSEC2010 challenge. AU - Tran Vu, Dang Hai AU - Haeb-Umbach, Reinhold ID - 11911 T2 - Interspeech 2011 TI - On Initial Seed Selection for Frequency Domain Blind Speech Separation ER - TY - BOOK ED - Kolossa, Dorothea ED - Haeb-Umbach, Reinhold ID - 11945 TI - Robust Speech Recognition of Uncertain or Missing Data --- Theory and Applications ER - TY - CONF AU - Ayaz, Serkan AU - Hoffmann, Felix AU - Sommer, Christoph AU - German, Reinhard AU - Dressler, Falko ID - 11973 SN - 9781424456369 T2 - 2010 IEEE Global Telecommunications Conference GLOBECOM 2010 TI - Performance Evaluation of Network Mobility Handover over Future Aeronautical Data Link ER - TY - JOUR AU - Dressler, Falko AU - Sommer, Christoph AU - Eckhoff, David AU - Tonguz, Ozan ID - 11993 JF - IEEE Vehicular Technology Magazine SN - 1556-6072 TI - Toward Realistic Simulation of Intervehicle Communication ER - TY - CONF AU - Eckhoff, David AU - Sommer, Christoph AU - Gansen, Tobias AU - German, Reinhard AU - Dressler, Falko ID - 11997 SN - 9781424495269 T2 - 2010 IEEE Vehicular Networking Conference TI - Strong and affordable location privacy in VANETs: Identity diffusion using time-slots and swapping ER - TY - CONF AU - Eckhoff, David AU - Gansen, Tobias AU - Manz, Robert AU - Thum, Daniela AU - Klages, Oliver AU - Sommer, Christoph ID - 11999 SN - 9781457708985 T2 - 2011 The 10th IFIP Annual Mediterranean Ad Hoc Networking Workshop TI - Simulative performance evaluation of the simTD Self Organizing Traffic Information System ER - TY - JOUR AU - Eckhoff, David AU - German, Reinhard AU - Sommer, Christoph AU - Dressler, Falko AU - Gansen, Tobias ID - 12000 JF - IEEE Communications Magazine SN - 0163-6804 TI - SlotSwap: strong and affordable location privacy in intelligent transportation systems ER - TY - CONF AU - Sommer, Christoph AU - Tonguz, Ozan K. AU - Dressler, Falko ID - 12056 SN - 9781424495269 T2 - 2010 IEEE Vehicular Networking Conference TI - Adaptive beaconing for delay-sensitive and congestion-aware traffic information systems ER - TY - CONF AU - Sommer, Christoph AU - Eckhoff, D AU - German, R AU - Dressler, F ID - 12062 SN - 9781612841892 T2 - 2011 Eighth International Conference on Wireless On-Demand Network Systems and Services TI - A computationally inexpensive empirical model of IEEE 802.11p radio shadowing in urban environments ER - TY - JOUR AU - Sommer, Christoph AU - Tonguz, Ozan AU - Dressler, Falko ID - 12063 JF - IEEE Communications Magazine SN - 0163-6804 TI - Traffic information systems: efficient message dissemination via adaptive beaconing ER - TY - CONF AU - Cook, Alejandro AU - Hellebrand, Sybille AU - Indlekofer, Thomas AU - Wunderlich, Hans-Joachim ID - 12982 T2 - 20th IEEE Asian Test Symposium (ATS'11) TI - Diagnostic Test of Robust Circuits ER - TY - CONF AU - Polian, Ilia AU - Becker, Bernd AU - Hellebrand, Sybille AU - Wunderlich, Hans-Joachim AU - Maxwell, Peter ID - 12984 T2 - 16th IEEE European Test Symposium Trondheim (ETS'11) TI - Towards Variation-Aware Test Methods ER - TY - CONF AU - Busjahn, Teresa AU - Schulte, Carsten AU - Busjahn, Andreas ID - 15672 T2 - Koli Calling TI - Analysis of code reading to gain more insight in program comprehension ER - TY - CONF AU - Hornung, Malte AU - Schulte, Carsten ID - 15673 T2 - Koli Calling TI - ProspectiveTeachers@Research: CS teacher education revised ER - TY - CONF AU - Kalbitz, Manuela AU - Voss, Hendrik AU - Schulte, Carsten ID - 15674 T2 - INFOS TI - Informatik begreifen - Zur Nutzung von Veranschaulichungen im Informatikunterricht VL - P-189 ER - TY - CONF AU - Schulte, Carsten ID - 15675 T2 - INFOS TI - Das Schülerlabor als Ort der Informatiklehrerbildung VL - P-189 ER - TY - CONF AU - Dembczynski, K. AU - Waegeman, W. AU - Hüllermeier, Eyke ID - 15762 T2 - In Proceedings ECML Workshop on Collective inference and Learning on Structured Data, Athens, Greece TI - Joint mode estimation in multi-label classification by chaining ER - TY - CONF AU - Mernberger, M. AU - Moog, D. AU - Stork, S. AU - Zauner, S. AU - Maier, U. AU - Hüllermeier, Eyke ID - 15764 T2 - In Proceedings GCB-2011 German Conference on Bioinformatics Munich, Germany TI - Prediction of protein localization for specialized compartments using time series kernels ER - TY - CONF AU - Somorovsky, Juraj AU - Heiderich, Mario AU - Jensen, Meiko AU - Schwenk, Jörg AU - Gruschka, Nils AU - Lo Iacono, Luigi ID - 15885 SN - 9781450310048 T2 - Proceedings of the 3rd ACM workshop on Cloud computing security workshop - CCSW '11 TI - All your clouds are belong to us: security analysis of cloud management interfaces ER - TY - CONF AU - Jensen, Meiko AU - Meyer, Christopher AU - Somorovsky, Juraj AU - Schwenk, Jörg ID - 15887 SN - 9781457711855 T2 - 2011 1st International Workshop on Securing Services on the Cloud (IWSSC) TI - On the effectiveness of XML Schema validation for countering XML Signature Wrapping attacks ER - TY - CONF AU - Jager, Tibor AU - Somorovsky, Juraj ID - 15915 SN - 9781450309486 T2 - Proceedings of the 18th ACM conference on Computer and communications security - CCS '11 TI - How to break XML encryption ER - TY - CONF AU - Meyer, Christopher AU - Somorovsky, Juraj AU - Driessen, Benedikt AU - Schwenk, Jörg AU - Tran, Thang AU - Wietfeld, Christian ID - 15916 TI - Sec2: Ein mobiles Nutzer-kontrolliertes Sicherheitskonzept für Cloud-Storage ER - TY - CONF AU - Arens, Stephan AU - Domik, Gitta ID - 15046 IS - 324 SN - 978-88579-286-4 T2 - INFORMATIK 2011 – 41. Jahrestagung der Gesellschaft für Informatik. TI - Volume Studio: Flexible Multi-Volume Ray Casting Pipeline mit nahtlos integriertem Rapid Prototyping von Shadern. ER - TY - CONF AU - Benter, Markus AU - Böttcher, Stefan AU - Hartel, Rita ID - 15097 SN - 0302-9743 T2 - East European Conference on Advances in Databases and Information Systems TI - Mixing Bottom-Up and Top-Down XPath Query Evaluation ER -