@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}}, } @article{6055, author = {{Mehler, Alexander and Lücking, Andy and Menke, Peter}}, issn = {{0893-6080}}, journal = {{Neural Networks}}, pages = {{159--164}}, publisher = {{Elsevier BV}}, title = {{{Assessing cognitive alignment in different types of dialog by means of a network model}}}, doi = {{10.1016/j.neunet.2012.02.013}}, volume = {{32}}, year = {{2012}}, } @inbook{6057, author = {{Menke, Peter}}, booktitle = {{Handbook of Technical Communication}}, isbn = {{978-3-11-018834-9}}, pages = {{285–314}}, publisher = {{de Gruyter}}, title = {{{Evaluation of Technical Communication}}}, volume = {{8}}, year = {{2012}}, } @misc{606, author = {{Löken, Nils}}, publisher = {{Universität Paderborn}}, title = {{{Identitätsbasierte Signaturen - Ein Sicherheitsbeweis für Signaturen auf Grundlage von Gap-Diffie-Hellman-Gruppen mit Hilfe des Forking-Lemmas}}}, year = {{2012}}, } @misc{607, author = {{Haarhoff, Thomas}}, publisher = {{Universität Paderborn}}, title = {{{Identitätsbasierte Kryptographie - Implementierung von Paarungen für Körper der Charakteristik 2}}}, year = {{2012}}, } @inproceedings{608, abstract = {{Predicate abstraction is an established technique in software verification. It inherently includes an abstraction refinement loop successively adding predicates until the right level of abstraction is found. For concurrent systems, predicate abstraction can be combined with spotlight abstraction, further reducing the state space by abstracting away certain processes. Refinement then has to decide whether to add a new predicate or a new process. Selecting the right predicates and processes is a crucial task: The positive effect of abstraction may be compromised by unfavourable refinement decisions. Here we present a heuristic approach to abstraction refinement. The basis for a decision is a set of refinement candidates, derived by multiple counterexample-generation. Candidates are evaluated with respect to their influence on other components in the system. Experimental results show that our technique can significantly speed up verification as compared to a naive abstraction refinement.}}, author = {{Timm, Nils and Wehrheim, Heike and Czech, Mike}}, booktitle = {{Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM)}}, pages = {{348--363}}, title = {{{Heuristic-Guided Abstraction Refinement for Concurrent Systems}}}, doi = {{10.1007/978-3-642-34281-3_25}}, year = {{2012}}, } @misc{610, author = {{Mohr, Mario}}, publisher = {{Universität Paderborn}}, title = {{{Generating Prototypes of Adaptive Component-based Software Systems for Performance Analysis}}}, year = {{2012}}, } @article{6102, author = {{Steinmetz, Holger and Schwens, C and Wehner, M and Kabst, Rüdiger}}, journal = {{PERSONALquartely}}, number = {{1}}, pages = {{34--39}}, title = {{{Das Cranet-Projekt: Kreuzkulturelle Vergleiche im HR-Management.}}}, volume = {{64}}, year = {{2012}}, } @article{6103, author = {{Kabst, Rüdiger and Baum, M}}, journal = {{PERSONALquartely}}, number = {{3}}, pages = {{3}}, title = {{{Editorial: Employer Branding: Strategie, Instrumente, Umsetzung}}}, volume = {{64}}, year = {{2012}}, } @misc{611, author = {{Hangmann, Hendrik}}, publisher = {{Universität Paderborn}}, title = {{{Generating Adjustable Temperature Gradients on modern FPGAs}}}, year = {{2012}}, } @misc{613, author = {{Wohlfarth, Stefan}}, publisher = {{Universität Paderborn}}, title = {{{Erweiterung von d3fact um die Domäne Wasserversorgung in Verbindung mit der Analyse und Implementierung eines hydraulischen Simulationsverfahrens}}}, year = {{2012}}, } @book{6138, author = {{Weber, W and Kabst, Rüdiger}}, isbn = {{978-3-8349-1994-6}}, title = {{{Einführung in die Betriebswirtschaftslehre}}}, year = {{2012}}, } @misc{614, author = {{Lehrig, Sebastian}}, publisher = {{Universität Paderborn}}, title = {{{Empirischer, quantitativer Vergleich von Modelltransformationssprachen}}}, year = {{2012}}, } @inbook{6148, author = {{Baum, M and Schwens, C and Kabst, R}}, booktitle = {{Handbook of Research on Born Globals}}, editor = {{Gabrielsson, M and Kirpalani, M}}, pages = {{36--45}}, publisher = {{Edward Elgar Publishing Ltd.}}, title = {{{Determinants of Different Types of Born Globals.}}}, year = {{2012}}, } @inbook{6149, author = {{Isidor, R and Schwens, C and Kabst, R}}, booktitle = {{Markteintrittsstrategien - Dynamik und Komplexität}}, editor = {{Zentes, J}}, isbn = {{978-3-8349-3503-8}}, pages = {{193--205}}, title = {{{Die Messung von Joint-Venture Erfolg}}}, year = {{2012}}, } @misc{616, author = {{Kluczniok, Sven}}, publisher = {{Universität Paderborn}}, title = {{{Effiziente Paketbildung in mehrdimensionalen Verhandlungsproblemen}}}, 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{618, author = {{Kurras, Sven}}, publisher = {{Universität Paderborn}}, title = {{{Distributed Sampling of Regular Graphs}}}, year = {{2012}}, } @inproceedings{619, abstract = {{Dynamics in networks is caused by a variety of reasons, like nodes moving in 2D (or 3D) in multihop cellphone networks, joins and leaves in peer-to-peer networks, evolution in social networks, and many others. In order to understand such kinds of dynamics, and to design distributed algorithms that behave well under dynamics, many ways to model dynamics are introduced and analyzed w.r.t. correctness and eciency of distributed algorithms. In [16], Kuhn, Lynch, and Oshman have introduced a very general, worst case type model of dynamics: The edge set of the network may change arbitrarily from step to step, the only restriction is that it is connected at all times and the set of nodes does not change. An extended model demands that a xed connected subnetwork is maintained over each time interval of length T (T-interval dynamics). They have presented, among others, algorithms for counting the number of nodes under such general models of dynamics.In this paper, we generalize their models and algorithms by adding random edge faults, i.e., we consider fault-prone dynamic networks: We assume that an edge currently existing may fail to transmit data with some probability p. We rst observe that strong counting, i.e., each node knows the correct count and stops, is not possible in a model with random edge faults. Our main two positive results are feasibility and runtime bounds for weak counting, i.e., stopping is no longer required (but still a correct count in each node), and for strong counting with an upper bound, i.e., an upper bound N on n is known to all nodes.}}, author = {{Brandes, Philipp and Meyer auf der Heide, Friedhelm}}, booktitle = {{Proceedings of the 4th Workshop on Theoretical Aspects of Dynamic Distributed Systems (TADDS)}}, pages = {{9--14}}, title = {{{Distributed Computing in Fault-Prone Dynamic Networks}}}, doi = {{10.1145/2414815.2414818}}, year = {{2012}}, } @misc{620, author = {{Mittendorf, Robert}}, publisher = {{Universität Paderborn}}, title = {{{Datenschutzgerechtes DRM im Cloud Computing}}}, year = {{2012}}, }