@inproceedings{6285, author = {{Paelke, Volker and Nebe, Karsten and Geiger, Christian and Klompmaker, Florian and Fischer, Holger Gerhard}}, booktitle = {{Proceedings of the 5th International Conference on Advances in Computer-Human Interaction (ACHI)}}, pages = {{95--100}}, publisher = {{IARIA}}, title = {{{Designing Multi-Modal Map-Based Interfaces for Disaster Management}}}, 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}}, } @inproceedings{6288, author = {{Fischer, Holger Gerhard}}, booktitle = {{Proceedings of the 4th ACM SIGCHI symposium on Engineering interactive computing systems - EICS '12}}, isbn = {{9781450311687}}, publisher = {{ACM Press}}, title = {{{Integrating usability engineering in the software development lifecycle based on international standards}}}, doi = {{10.1145/2305484.2305541}}, year = {{2012}}, } @misc{629, author = {{Schleiter, Patrick}}, publisher = {{Universität Paderborn}}, title = {{{Attribute-basierte Verschlüsselung}}}, year = {{2012}}, } @inproceedings{6290, author = {{Fischer, Holger Gerhard and Klompmaker, Florian}}, booktitle = {{Proceedings of the 9th International Conference on Information Systems for Crisis Response and Management (ISCRAM)}}, publisher = {{ISCRAM Digital Library}}, title = {{{Enriching Disaster Control Management based on Human-Computer Design}}}, year = {{2012}}, } @inproceedings{6291, author = {{Fischer, Holger Gerhard and Geis, Thomas and Kluge, Oliver and Bogner, Christian and Polkehn, Knut}}, booktitle = {{Jahresband Usability Professionals}}, pages = {{160--165}}, publisher = {{German UPA}}, title = {{{Der Qualitätsstandard für Usability Engineering der German UPA – Aktueller Stand der Arbeiten}}}, year = {{2012}}, } @inproceedings{630, abstract = {{Maintaining software systems requires up-to-date models of these systems to systematically plan, analyse 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. Several approaches exist today for the reverse engineering of component-based systems, however, none of them explicitly integrates a systematic design deficiency removal into the process to improve the quality of the reverse engineered architecture. Therefore, in our Archimetrix approach, we propose to regard the most relevant deficiencies with respect to the reverse engineered component-based architecture and support reengineers by presenting the architectural consequences of removing a given deficiency. We validate our approach on the Common Component Modeling Example and show that we are able to identify relevant deficiencies and that their removal leads to an improved reengineered architecture.}}, author = {{Platenius, Marie Christin and von Detten, Markus and Becker, Steffen}}, booktitle = {{Proceedings of the 16th European Conference on Software Maintenance and Reengineering (CSMR)}}, pages = {{255--264}}, title = {{{Archimetrix: Improved Software Architecture Recovery in the Presence of Design Deficiencies}}}, doi = {{10.1109/CSMR.2012.33}}, 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}}, } @techreport{6312, author = {{Behrenbruch, Kay and Bogner, Christian and Fischer, Holger Gerhard and Geis, Thomas and Geitner, Claudia and Heimgärtner, Rüdiger and Hofmann, Britta and Hunkirchen, Peter and Kluge, Oliver and Litzenberg, Britta and Molich, Rolf and Polkehn, Knut and Pysarenko, Yuliya and Zimmermann, Dirk}}, title = {{{German UPA Qualitätsstandard für Usability Engineering}}}, year = {{2012}}, } @inproceedings{632, abstract = {{Given an integer h, a graph G = (V;E) with arbitrary positive edge capacities and k pairs of vertices (s1; t1); (s2; t2); : : : ; (sk; tk), called terminals, an h-route cut is a set F µ E of edges such that after the removal of the edges in F no pair si ¡ ti is connected by h edge-disjoint paths (i.e., the connectivity of every si ¡ ti pair is at most h ¡ 1 in (V;E n F)). The h-route cut is a natural generalization of the classical cut problem for multicommodity °ows (take h = 1). The main result of this paper is an O(h722h log2 k)-approximation algorithm for the minimum h-route cut problem in the case that s1 = s2 = ¢ ¢ ¢ = sk, called the single source case. As a corollary of it we obtain an approximate duality theorem for multiroute multicom-modity °ows and cuts with a single source. This partially answers an open question posted in several previous papers dealing with cuts for multicommodity multiroute problems.}}, author = {{Kolman, Petr and Scheideler, Christian}}, booktitle = {{Proceedings of the 23th ACM SIAM Symposium on Discrete Algorithms (SODA)}}, pages = {{800--810}}, title = {{{Approximate Duality of Multicommodity Multiroute Flows and Cuts: Single Source Case}}}, doi = {{10.1137/1.9781611973099.64}}, year = {{2012}}, } @misc{633, author = {{Pischel, Daniel}}, publisher = {{Universität Paderborn}}, title = {{{Analyse, Konzeption und Implementierung von Aggregationsverfahren für Trinkwasserversorgungsnetze}}}, year = {{2012}}, } @misc{634, author = {{Kratzmann, Julian}}, publisher = {{Universität Paderborn}}, title = {{{Analyse und Simulation von energieeffizienten Online-Scheduling Algorithmen}}}, year = {{2012}}, } @inproceedings{635, abstract = {{In Germany, the optimization of water supply systems has gained more and more attention due to a growing cost pressure for German municipal utilities. In this work, a model is presented which optimizes the usage of water tanks. On the one hand locations of new tanks are identified, and on the other hand the size of existing tanks is optimized, subject to satisfying the demand of clients and providing the necessary amount of fire water during all time periods. The main difficulty is the consideration of the head loss equation which is required to model the hydraulic properties of a water supply system. As this equation is non-convex and quadratic the optimization model becomes a non-convex Mixed Integer Quadratically Constrained Program (MIQCP). To solve this MIQCP different solution methods are applied.}}, author = {{Dohle (married name: Hallmann) , Corinna and Suhl, Leena}}, booktitle = {{Proceedings of the International Conference on Applied Mathematical Optimization and Modelling (APMOD)}}, pages = {{404--408}}, title = {{{An Optimization Model for the optimal Usage of Water Tanks in Water Supply Systems}}}, 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}}, } @misc{637, author = {{Dawirs, Friederike}}, publisher = {{Universität Paderborn}}, title = {{{Alternative Berechnung der Machtindizes: Banzhaf und Shapley-Shubik Index}}}, year = {{2012}}, } @misc{638, author = {{Eidens, Fabian}}, publisher = {{Universität Paderborn}}, title = {{{Adaptive Verbindungsstrategien in dynamischen Suchnetzwerken}}}, year = {{2012}}, } @inproceedings{639, abstract = {{Service-oriented computing (SOC) emerges as a promising trend solving many issues in distributed software development. Following the essence of SOC, service descriptions are dened by the service partners based on current standards, e.g., WSDL [15]. However, these standards are mostly structural and do not provide any behavioral description, which may lead to inaccurate service discovery results. There is a requirement for a rich service description language for service partners that encompasses the structural as well as behavioral information in the service description. Furthermore, service discovery based on an automatic matching of these comprehensive service descriptions is a complex task, which is further complicated through the heterogeneity of the service partners' domains in terms of dierent underlying ontologies. In this paper, we propose a rich service description language based on UML, which allows the specication of structural and behavioral features of a service. In addition, we also briefly discuss how some existing matching approaches can be extended to dene an automatic matching mechanism for rich service descriptions resolving the underlying heterogeneity.}}, author = {{Huma, Zille and Gerth, Christian and Engels, Gregor and Juwig, Oliver}}, booktitle = {{Proceedings of the Forum at the CAiSE'12 Conference on Advanced Information Systems Engineering}}, pages = {{90----97}}, title = {{{A UML-based Rich Service Description for Automatic Service Discovery}}}, year = {{2012}}, } @inproceedings{640, abstract = {{Small-world networks have received significant attention because of their potential as models for the interaction networks of complex systems. Specifically, neither random networks nor regular lattices seem to be an adequate framework within which to study real-world complex systems such as chemical-reaction networks, neural networks, food webs, social networks, scientific-collaboration networks, and computer networks. Small-world networks provide some desired properties like an expected polylogarithmic distance between two processes in the network, which allows routing in polylogarithmic hops by simple greedy routing, and robustness against attacks or failures. By these properties, small-world networks are possible solutions for large overlay networks comparable to structured overlay networks like CAN, Pastry, Chord, which also provide polylogarithmic routing, but due to their uniform structure, structured overlay networks are more vulnerable to attacks or failures. In this paper we bring together a randomized process converging to a small-world network and a self-stabilization process so that a small-world network is formed out of any weakly connected initial state. To the best of our knowledge this is the first distributed self-stabilization process for building a small-world network.}}, author = {{Kniesburges, Sebastian and Koutsopoulos, Andreas and Scheideler, Christian}}, booktitle = {{Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS)}}, pages = {{1261----1271}}, title = {{{A Self-Stabilization Process for Small-World Networks}}}, doi = {{10.1109/IPDPS.2012.115}}, year = {{2012}}, } @misc{641, author = {{Schluessler, Jonathan}}, publisher = {{Universität Paderborn}}, title = {{{A Forensic Framework for Automatic Information Retrieval in Distributed Systems}}}, year = {{2012}}, } @inbook{6410, author = {{Kremer, H.-Hugo and Beutner, Marc and Zoyke, A.}}, booktitle = {{Individuelle Förderung und berufliche Orientierung im berufsschulischen Übergangssystem - Ergebnisse aus dem Forschungs- und Entwicklungsprojekt InLab}}, editor = {{Kremer, H.-Hugo and Beutner, Marc and Zoyke, A.}}, title = {{{Informationen aus der Lehrer- und Schülerbefragung! Eine empirische Studie zu den Erfahrungen von Lehrkräften und Jugendlichen im beruflichen Übergangssystem}}}, year = {{2012}}, }