TY - THES AB - FPGAs, systems on chip and embedded systems are nowadays irreplaceable. They combine the computational power of application specific hardware with software-like flexibility. At runtime, they can adjust their functionality by downloading new hardware modules and integrating their functionality. Due to their growing capabilities, the demands made to reconfigurable hardware grow. Their deployment in increasingly security critical scenarios requires new ways of enforcing security since a failure in security has severe consequences. Aside from financial losses, a loss of human life and risks to national security are possible. With this work I present the novel and groundbreaking concept of proof-carrying hardware. It is a method for the verification of properties of hardware modules to guarantee security for a target platform at runtime. The producer of a hardware module delivers based on the consumer's safety policy a safety proof in combination with the reconfiguration bitstream. The extensive computation of a proof is a contrast to the comparatively undemanding checking of the proof. I present a prototype based on open-source tools and an abstract FPGA architecture and bitstream format. The proof of the usability of proof-carrying hardware provides the evaluation of the prototype with the exemplary application of securing combinational and bounded sequential equivalence of reference monitor modules for memory safety. AU - Drzevitzky, Stephanie ID - 586 TI - Proof-Carrying Hardware: A Novel Approach to Reconfigurable Hardware Security ER - TY - GEN AU - Plessl, Christian AU - Platzner, Marco AU - Agne, Andreas AU - Happe, Markus AU - Lübbers, Enno ID - 587 TI - Programming models for reconfigurable heterogeneous multi-cores ER - TY - CONF AB - We come up with a digital rights management (DRM) concept for cloud computing and show how license management for software within the cloud can be achieved in a privacy-friendly manner. In our scenario, users who buy software from software providers stay anonymous. At the same time, our approach guarantees that software licenses are bound to users and their validity is checked before execution. We employ a software re-encryption scheme so that computing centers which execute users’ software are not able to build user profiles—not even under pseudonym—of their users. We combine secret sharing and homomorphic encryption. We make sure that malicious users are unable to relay software to others. DRM constitutes an incentive for software providers to take part in a future cloud computing scenario.We make this scenario more attractive for users by preserving their privacy. AU - Petrlic, Ronald AU - Sorge, Christoph ID - 588 T2 - Proceedings of the 26th IEEE International Conference on Advanced Information Networking and Applications (AINA) TI - Privacy-Preserving DRM for Cloud Computing ER - TY - CONF AB - We present a privacy-preserving DRM scheme for a (future) cloud computing software market. In such a market, applications are packed into virtual machines (VMs) by software providers and the VMs can be executed at any computing center within the cloud. We propose the introduction of a software TPM as a container for VM-specific keys within the VM that moves around with the VM within the cloud. The software TPM is coupled to a virtual TPM at a computing center to constitute the root of trust for a local DRM enforcement system within the VM that checks the license before each application execution. This allows flexible price models, e.g. execute at most n timeslike models. Users have proof that their personally identifiable information, stored and processed within the VM at a computing center, cannot be obtained by the computing center. A feature of our solution is that neither software provider nor computing center are able to build usage profiles of the software executions. AU - Petrlic, Ronald ID - 589 T2 - Proceedings of the 11th IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom) TI - Privacy-Preserving Digital Rights Management in a Trusted Cloud Environment ER - TY - CONF AB - Predicate abstraction is an established technique for reducing the size of the state space during verification. In this paper, we extend predication abstraction with block-abstraction memoization (BAM), which exploits the fact that blocks are often executed several times in a program. The verification can thus benefit from caching the values of previous block analyses and reusing them upon next entry into a block. In addition to function bodies, BAM also performs well for nested loops. To further increase effectiveness, block memoization has been integrated with lazy abstraction adopting a lazy strategy for cache refinement. Together, this achieves significant performance increases: our tool (an implementation within the configurable program analysis framework CPAchecker) has won the Competition on Software Verification 2012 in the category “Overall”. AU - Wonisch, Daniel AU - Wehrheim, Heike ID - 590 T2 - Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM) TI - Predicate Analysis with Block-Abstraction Memoization ER - TY - GEN AU - Celik, Aydin ID - 592 TI - Penny Auctions: Design und Strategisches Verhalten ER - TY - GEN AU - Rojahn, Tobias ID - 593 TI - Optimale Zuteilung von Nutzern zu verteilten Cloud-Standorten ER - TY - GEN AU - Klerx, Timo ID - 594 TI - Online Parameteroptimierung in P2P-Netzwerken mit Hilfe von Neuronalen Netzen ER - TY - GEN AU - Mallmann Trenn, Frederik ID - 595 TI - On scheduling with multi-core and multi-speed processors using power down ER - TY - CONF AB - To meet quality-of-service requirements in changing environments, modern software systems adapt themselves. The structure, and correspondingly the behavior, of these systems undergoes continuous change. Model-driven performance engineering, however, assumes static system structures, behavior, and deployment. Hence, self-adaptive systems pose new challenges to model-driven performance engineering. There are a few surveys on self-adaptive systems, performance engineering, and the combination of both in the literature. In contrast to existing work, here we focus on model-driven performance analysis approaches. Based on a systematic literature review, we present a classication, identify open issues, and outline further research. AU - Becker, Matthias AU - Luckey, Markus AU - Becker, Steffen ID - 596 T2 - Proceedings of the 8th ACM SigSoft International Conference on Quality of Software Architectures (QoSA'12) TI - Model-Driven Performance Engineering of Self-Adaptive Systems: A Survey ER - TY - CONF AB - 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. AU - Mavronicolas, Marios AU - Monien, Burkhard ID - 597 T2 - Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT) TI - Minimizing Expectation Plus Variance ER - TY - GEN AU - Mammadov, Fuad ID - 598 TI - Methoden zur Bestimmung von innerbetrieblichen Verrechnungspreisen ER - TY - GEN AU - Löwen, Xenia ID - 599 TI - Managerial Delegation and Capacity Choices: An Analysis of the Cournot-Nash Equilibrium ER - TY - GEN AU - Feldkord, Björn ID - 600 TI - Lokale Swaps und überholte Informationen in Basic Network Creation Games ER - TY - THES AB - Wir betrachten eine Gruppe von mobilen, autonomen Robotern in einem ebenen Gel{\"a}nde. Es gibt keine zentrale Steuerung und die Roboter m{\"u}ssen sich selbst koordinieren. Zentrale Herausforderung dabei ist, dass jeder Roboter nur seine unmittelbare Nachbarschaft sieht und auch nur mit Robotern in seiner unmittelbaren Nachbarschaft kommunizieren kann. Daraus ergeben sich viele algorithmische Fragestellungen. In dieser Arbeit wird untersucht, unter welchen Voraussetzungen die Roboter sich auf einem Punkt versammeln bzw. eine Linie zwischen zwei festen Stationen bilden k{\"o}nnen. Daf{\"u}r werden mehrere Roboter-Strategien in verschiedenen Bewegungsmodellen vorgestellt. Diese Strategien werden auf ihre Effizienz hin untersucht. Es werden obere und untere Schranken f{\"u}r die ben{\"o}tigte Anzahl Runden und die Bewegungsdistanz gezeigt. In einigen F{\"a}llen wird außerdem die ben{\"o}tigte Bewegungsdistanz mit derjenigen Bewegungsdistanz verglichen, die eine optimale globale Strategie auf der gleichen Instanz ben{\"o}tigen w{\"u}rde. So werden kompetititve Faktoren hergeleitet. AU - Kempkes, Barbara ID - 601 SN - 978-3-942647-21-2 TI - Local strategies for robot formation problems VL - 302 ER - TY - GEN AB - We study the consequences of dropping the perfect competition assumption in a standard infinite horizon model with infinitely-lived traders and real collateralized assets, together with one additional ingredient: information among players is asymmetric and monitoring is incomplete. The key insight is that trading assets is not only a way to hedge oneself against uncertainty and to smooth consumption across time: It also enables learning information. Conversely, defaulting now becomes strategic: Certain players may manipulate prices so as to provoke a default in order to prevent their opponents from learning. We focus on learning equilibria, at the end of which no player has incorrect beliefs — not because those players with heterogeneous beliefs were eliminated from the market (although default is possible at equilibrium) but because they have taken time to update their prior belief. We prove a partial Folk theorem à la Wiseman (2011) of the following form: For any function that maps each state of the world to a sequence of feasible and strongly individually rational allocations, and for any degree of precision, there is a perfect Bayesian equilibrium in which patient players learn the realized state with this degree of precision and achieve a payoff close to the one specified for each state. AU - Brangewitz, Sonja ID - 602 TI - Learning by Trading in Infinite Horizon Strategic Market Games with Default ER - TY - GEN AB - Preemptive Routing and Wavelength Assignment (RWA) algorithms preempt established lightpaths in case not enough resources are available to setup a new lightpath in a Wavelength Division Multiplexing (WDM) network. The selection of lightpaths to be preempted relies on internal decisions of the RWA algorithm. Thus, if dedicated properties of the network topology are required by the applications running on the network, these requirements have to be known by the RWA algorithm. Otherwise it might happen that by preempting a particular lightpath these requirements are violated. If, however, these requirements include parameters only known at the nodes running the application, the RWA algorithm cannot evaluate the requirements. For this reason a RWA algorithm is needed which involves its users in the preemption decisions. We present a family of preemptive RWA algorithms for WDM networks. These algorithms have two distinguishing features: a) they can handle dynamic traffic by on-the-fly reconfiguration, and b) users can give feedback for reconfiguration decisions and thus influence the preemption decision of the RWA algorithm, leading to networks which adapt directly to application needs. This is different from traffic engineering where the network is (slowly) adapted to observed traffic patterns. Our algorithms handle various WDM network configurations including networks consisting of heterogeneous WDM hardware. To this end, we are using the layered graph approach together with a newly developed graph model that is used to determine conflicting lightpaths. AU - Wette, Philip AU - Karl, Holger ID - 603 TI - Introducing feedback to preemptive routing and wavelength assignment algorithms for dynamic traffic scenarios ER - TY - GEN AU - Seier, Henrik ID - 604 TI - Implementierung eines Branch-and-Bound-Algorithmus für nichtkonvexe gemischt-ganzzahlige Optimierungsprobleme mit quadratischen Nebenbedingungen ER - TY - GEN AU - Isenberg, Florian ID - 605 TI - Implementierung eines adaptiven Verfahrens zur Linearisierung von nicht-konvexen, nichtlinearen Wassernetzmodellen mit Hilfe einer Fehlerabschätzung ER - TY - JOUR AU - Mehler, Alexander AU - Lücking, Andy AU - Menke, Peter ID - 6055 JF - Neural Networks SN - 0893-6080 TI - Assessing cognitive alignment in different types of dialog by means of a network model VL - 32 ER - TY - CHAP AU - Menke, Peter ID - 6057 SN - 978-3-11-018834-9 T2 - Handbook of Technical Communication TI - Evaluation of Technical Communication VL - 8 ER - TY - GEN AU - Löken, Nils ID - 606 TI - Identitätsbasierte Signaturen - Ein Sicherheitsbeweis für Signaturen auf Grundlage von Gap-Diffie-Hellman-Gruppen mit Hilfe des Forking-Lemmas ER - TY - GEN AU - Haarhoff, Thomas ID - 607 TI - Identitätsbasierte Kryptographie - Implementierung von Paarungen für Körper der Charakteristik 2 ER - TY - CONF AB - 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. AU - Timm, Nils AU - Wehrheim, Heike AU - Czech, Mike ID - 608 T2 - Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM) TI - Heuristic-Guided Abstraction Refinement for Concurrent Systems ER - TY - GEN AU - Mohr, Mario ID - 610 TI - Generating Prototypes of Adaptive Component-based Software Systems for Performance Analysis ER - TY - JOUR AU - Steinmetz, Holger AU - Schwens, C AU - Wehner, M AU - Kabst, Rüdiger ID - 6102 IS - 1 JF - PERSONALquartely TI - Das Cranet-Projekt: Kreuzkulturelle Vergleiche im HR-Management. VL - 64 ER - TY - JOUR AU - Kabst, Rüdiger AU - Baum, M ID - 6103 IS - 3 JF - PERSONALquartely TI - Editorial: Employer Branding: Strategie, Instrumente, Umsetzung VL - 64 ER - TY - GEN AU - Hangmann, Hendrik ID - 611 TI - Generating Adjustable Temperature Gradients on modern FPGAs ER - TY - GEN AU - Wohlfarth, Stefan ID - 613 TI - Erweiterung von d3fact um die Domäne Wasserversorgung in Verbindung mit der Analyse und Implementierung eines hydraulischen Simulationsverfahrens ER - TY - BOOK AU - Weber, W AU - Kabst, Rüdiger ID - 6138 SN - 978-3-8349-1994-6 TI - Einführung in die Betriebswirtschaftslehre ER - TY - GEN AU - Lehrig, Sebastian ID - 614 TI - Empirischer, quantitativer Vergleich von Modelltransformationssprachen ER - TY - CHAP AU - Baum, M AU - Schwens, C AU - Kabst, R ED - Gabrielsson, M ED - Kirpalani, M ID - 6148 T2 - Handbook of Research on Born Globals TI - Determinants of Different Types of Born Globals. ER - TY - CHAP AU - Isidor, R AU - Schwens, C AU - Kabst, R ED - Zentes, J ID - 6149 SN - 978-3-8349-3503-8 T2 - Markteintrittsstrategien - Dynamik und Komplexität TI - Die Messung von Joint-Venture Erfolg ER - TY - GEN AU - Kluczniok, Sven ID - 616 TI - Effiziente Paketbildung in mehrdimensionalen Verhandlungsproblemen ER - TY - CONF AB - 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. AU - Jungmann, Alexander AU - Kleinjohann, Bernd AU - Kleinjohann, Elisabeth AU - Bieshaar, Maarten ID - 617 T2 - Proceedings of the Fourth International Conference on Resource Intensive Applications and Services (INTENSIVE) TI - Efficient Color-Based Image Segmentation and Feature Classification for Image Processing in Embedded Systems ER - TY - GEN AU - Kurras, Sven ID - 618 TI - Distributed Sampling of Regular Graphs ER - TY - CONF AB - 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. AU - Brandes, Philipp AU - Meyer auf der Heide, Friedhelm ID - 619 T2 - Proceedings of the 4th Workshop on Theoretical Aspects of Dynamic Distributed Systems (TADDS) TI - Distributed Computing in Fault-Prone Dynamic Networks ER - TY - GEN AU - Mittendorf, Robert ID - 620 TI - Datenschutzgerechtes DRM im Cloud Computing ER - TY - GEN AU - Sekula, Stephan ID - 621 TI - Datenschutzgerechte E-Payment-Schemata im On-The-Fly Computing ER - TY - CONF AB - Behavioral modeling languages are most useful if their behavior is specified formally such that it can e.g. be analyzed and executed automatically. Obviously, the quality of such behavior specifications is crucial. The rule-based semantics specification technique Dynamic Meta Modeling (DMM) honors this by using the approach of Test-driven Semantics Specification (TDSS), which makes sure that the specification at hand at least describes the correct behavior for a suite of test models. However, in its current state TDSS does not provide any means to measure the quality of such a test suite. In this paper, we describe how we have applied the idea of test coverage to TDSS. Similar to common approaches of defining test coverage criteria, we describe a data structure called invocation graph containing possible orders of applications ofDMM rules. Then we define different coverage criteria based on that data structure, taking the rule applications caused by the test suite’s models into account. Our implementation of the described approach gives the language engineer using DMM a means to reason about the quality of the language’s test suite, and also provides hints on how to improve that quality by adding dedicated test models to the test suite. AU - Arifulina, Svetlana AU - Engels, Gregor AU - Soltenborn, Christian ID - 622 T2 - Proceedings of the 11th International Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT) TI - Coverage Criteria for Testing DMM Specifications ER - TY - CONF AB - This paper initiates the formal study of a fundamental problem: How to efficiently allocate a shared communication medium among a set of K co-existing networks in the presence of arbitrary external interference? While most literature on medium access focuses on how to share a medium among nodes, these approaches are often either not directly applicable to co-existing networks as they would violate the independence requirement, or they yield a low throughput if applied to multiple networks. We present the randomized medium access (MAC) protocol COMAC which guarantees that a given communication channel is shared fairly among competing and independent networks, and that the available bandwidth is used efficiently. These performance guarantees hold in the presence of arbitrary external interference or even under adversarial jamming. Concretely, we show that the co-existing networks can use a Ω(ε2 min{ε, 1/poly(K)})-fraction of the non-jammed time steps for successful message transmissions, where ε is the (arbitrarily distributed) fraction of time which is not jammed. AU - Richa, Andrea W. AU - Scheideler, Christian AU - Schmid, Stefan AU - Zhang, Jin ID - 623 T2 - Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC) TI - Competitive and fair throughput for co-existing networks under adversarial interference ER - TY - GEN AU - Jakobs, Marie-Christine ID - 624 TI - Change and Validity Analysis in Deductive Program Verification ER - TY - CONF AB - This paper initiates the study of self-adjusting distributed data structures for networks. In particular, we present SplayNets: a binary search tree based network that is self-adjusting to routing request.We derive entropy bounds on the amortized routing cost and show that our splaying algorithm has some interesting properties. AU - Schmid, Stefan AU - Avin, Chen AU - Scheideler, Christian AU - Häupler, Bernhard AU - Lotker, Zvi ID - 625 T2 - Proceedings of the 26th International Symposium on Distributed Computing (DISC) TI - Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures ER - TY - JOUR AU - Paelke, Volker AU - Nebe, Karsten AU - Geiger, Christian AU - Klompmaker, Florian AU - Fischer, Holger Gerhard ID - 6250 JF - ISPRS - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences SN - 1682-1777 TI - Multi-Modal, Multi-Touch Interaction with Maps in Disaster Management Applications VL - XXXIX-B8 ER - TY - CONF AB - The design of ecient search structures for peer-to-peer systems has attracted a lot of attention in recent years. In this announcement we address the problem of nding the predecessor in a key set and present an ecient data structure called hashed Predecessor Patricia trie. Our hashed Predecessor Patricia trie supports PredecessorSearch(x) and Insert(x) and Delete(x) in O(log log u) hash table accesses when u is the size of the universe of the keys. That is the costs only depend on u and not the size of the data structure. One feature of our approach is that it only uses the lookup interface of the hash table and therefore hash table accesses may be realized by any distributed hash table (DHT). AU - Kniesburges, Sebastian AU - Scheideler, Christian ID - 626 T2 - Proceedings of the 26th International Symposium on Distributed Computing (DISC) TI - Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems ER - TY - CONF AB - Block Abstraction Memoization (ABM) is a technique in software model checking that exploits the modularity of programs during verification by caching. To this end, ABM records the results of block analyses and reuses them if possible when revisiting the same block again. In this paper we present an implementation of ABM into the predicate-analysis component of the software-verification framework CPAchecker. With our participation at the Competition on Software Verification we aim at providing evidence that ABM can not only substantially increase the efficiency of predicate analysis but also enables verification of a wider range of programs. AU - Wonisch, Daniel ID - 627 T2 - Proceedings of the 18th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS) TI - Block Abstraction Memoization for CPAchecker ER - TY - CONF AU - Schneid, M AU - Steinmetz, Holger AU - Isidor, R AU - Kabst, Rüdiger ID - 6275 TI - Diversität, Konflikte und Leistung in Teams: Ein meta-analytisches Strukturgleichungsmodell ER - TY - CONF AU - Kabst, Rüdiger ID - 6277 TI - Endogeneity in the behavioral sciences: An illustration with real data ER - TY - CONF AB - Network creation games model the creation and usage costs of networks formed by a set of selfish peers.Each peer has the ability to change the network in a limited way, e.g., by creating or deleting incident links.In doing so, a peer can reduce its individual communication cost.Typically, these costs are modeled by the maximum or average distance in the network.We introduce a generalized version of the basic network creation game (BNCG).In the BNCG (by Alon et al., SPAA 2010), each peer may replace one of its incident links by a link to an arbitrary peer.This is done in a selfish way in order to minimize either the maximum or average distance to all other peers.That is, each peer works towards a network structure that allows himself to communicate efficiently with all other peers.However, participants of large networks are seldom interested in all peers.Rather, they want to communicate efficiently with a small subset only.Our model incorporates these (communication) interests explicitly.Given peers with interests and a communication network forming a tree, we prove several results on the structure and quality of equilibria in our model.We focus on the MAX-version, i.e., each node tries to minimize the maximum distance to nodes it is interested in, and give an upper bound of O(\sqrt(n)) for the private costs in an equilibrium of n peers.Moreover, we give an equilibrium for a circular interest graph where a node has private cost Omega(\sqrt(n)), showing that our bound is tight.This example can be extended such that we get a tight bound of Theta(\sqrt(n)) for the price of anarchy.For the case of general networks we show the price of anarchy to be Theta(n).Additionally, we prove an interesting connection between a maximum independent set in the interest graph and the private costs of the peers. AU - Cord-Landwehr, Andreas AU - Huellmann (married name: Eikel), Martina AU - Kling, Peter AU - Setzer, Alexander ID - 628 T2 - Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT) TI - Basic Network Creation Games with Communication Interests ER - TY - CONF AU - Wehner, M C AU - Giardini, A AU - Kabst, Rüdiger ID - 6281 TI - Recruitment Process Outsourcing and Applicant Reactions: Does Image Make a Difference? ER - TY - CONF AU - Paelke, Volker AU - Nebe, Karsten AU - Geiger, Christian AU - Klompmaker, Florian AU - Fischer, Holger Gerhard ID - 6285 T2 - Proceedings of the 5th International Conference on Advances in Computer-Human Interaction (ACHI) TI - Designing Multi-Modal Map-Based Interfaces for Disaster Management ER - TY - CONF AU - Klompmaker, Florian AU - Fischer, Holger Gerhard AU - Jung, Helge ID - 6286 T2 - Proceedings of the 5th International Conference on Advances in Computer-Human Interaction (ACHI) TI - Authenticated Tangible Interaction using RFID and Depth-Sensing Cameras - Supporting Collaboration on Interactive Tabletops ER - TY - CONF AU - Fischer, Holger Gerhard ID - 6288 SN - 9781450311687 T2 - Proceedings of the 4th ACM SIGCHI symposium on Engineering interactive computing systems - EICS '12 TI - Integrating usability engineering in the software development lifecycle based on international standards ER - TY - GEN AU - Schleiter, Patrick ID - 629 TI - Attribute-basierte Verschlüsselung ER - TY - CONF AU - Fischer, Holger Gerhard AU - Klompmaker, Florian ID - 6290 T2 - Proceedings of the 9th International Conference on Information Systems for Crisis Response and Management (ISCRAM) TI - Enriching Disaster Control Management based on Human-Computer Design ER - TY - CONF AU - Fischer, Holger Gerhard AU - Geis, Thomas AU - Kluge, Oliver AU - Bogner, Christian AU - Polkehn, Knut ID - 6291 T2 - Jahresband Usability Professionals TI - Der Qualitätsstandard für Usability Engineering der German UPA – Aktueller Stand der Arbeiten ER - TY - CONF AB - 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. AU - Platenius, Marie Christin AU - von Detten, Markus AU - Becker, Steffen ID - 630 T2 - Proceedings of the 16th European Conference on Software Maintenance and Reengineering (CSMR) TI - Archimetrix: Improved Software Architecture Recovery in the Presence of Design Deficiencies ER - TY - CONF AB - 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. AU - von Detten, Markus ID - 631 T2 - Proceedings of the 19th Working Conference on Reverse Engineering (WCRE) TI - Archimetrix: A Tool for Deficiency-Aware Software Architecture Reconstruction ER - TY - GEN AU - Behrenbruch, Kay AU - Bogner, Christian AU - Fischer, Holger Gerhard AU - Geis, Thomas AU - Geitner, Claudia AU - Heimgärtner, Rüdiger AU - Hofmann, Britta AU - Hunkirchen, Peter AU - Kluge, Oliver AU - Litzenberg, Britta AU - Molich, Rolf AU - Polkehn, Knut AU - Pysarenko, Yuliya AU - Zimmermann, Dirk ID - 6312 TI - German UPA Qualitätsstandard für Usability Engineering ER - TY - CONF AB - 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. AU - Kolman, Petr AU - Scheideler, Christian ID - 632 T2 - Proceedings of the 23th ACM SIAM Symposium on Discrete Algorithms (SODA) TI - Approximate Duality of Multicommodity Multiroute Flows and Cuts: Single Source Case ER - TY - GEN AU - Pischel, Daniel ID - 633 TI - Analyse, Konzeption und Implementierung von Aggregationsverfahren für Trinkwasserversorgungsnetze ER - TY - GEN AU - Kratzmann, Julian ID - 634 TI - Analyse und Simulation von energieeffizienten Online-Scheduling Algorithmen ER - TY - CONF AB - 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. AU - Dohle (married name: Hallmann) , Corinna AU - Suhl, Leena ID - 635 T2 - Proceedings of the International Conference on Applied Mathematical Optimization and Modelling (APMOD) TI - An Optimization Model for the optimal Usage of Water Tanks in Water Supply Systems ER - TY - CONF AB - 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. AU - Meyer auf der Heide, Friedhelm AU - Pietrzyk, Peter AU - Kling, Peter ID - 636 T2 - Proceedings of the 19th International Colloquium on Structural Information & Communication Complexity (SIROCCO) TI - An Algorithm for Facility Leasing ER - TY - GEN AU - Dawirs, Friederike ID - 637 TI - Alternative Berechnung der Machtindizes: Banzhaf und Shapley-Shubik Index ER - TY - GEN AU - Eidens, Fabian ID - 638 TI - Adaptive Verbindungsstrategien in dynamischen Suchnetzwerken ER - TY - CONF AB - 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. AU - Huma, Zille AU - Gerth, Christian AU - Engels, Gregor AU - Juwig, Oliver ID - 639 T2 - Proceedings of the Forum at the CAiSE'12 Conference on Advanced Information Systems Engineering TI - A UML-based Rich Service Description for Automatic Service Discovery ER - TY - CONF AB - 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. AU - Kniesburges, Sebastian AU - Koutsopoulos, Andreas AU - Scheideler, Christian ID - 640 T2 - Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS) TI - A Self-Stabilization Process for Small-World Networks ER - TY - GEN AU - Schluessler, Jonathan ID - 641 TI - A Forensic Framework for Automatic Information Retrieval in Distributed Systems ER - TY - CHAP AU - Kremer, H.-Hugo AU - Beutner, Marc AU - Zoyke, A. ED - Kremer, H.-Hugo ED - Beutner, Marc ED - Zoyke, A. ID - 6410 T2 - Individuelle Förderung und berufliche Orientierung im berufsschulischen Übergangssystem - Ergebnisse aus dem Forschungs- und Entwicklungsprojekt InLab TI - Informationen aus der Lehrer- und Schülerbefragung! Eine empirische Studie zu den Erfahrungen von Lehrkräften und Jugendlichen im beruflichen Übergangssystem ER - TY - CHAP AU - Kremer, H.-Hugo AU - Rhode, S. AU - Zoyke, A. ED - Kremer, H.-Hugo ED - Beutner, Marc ED - Zoyke, A. ID - 6412 T2 - Individuelle Förderung und berufliche Orientierung im berufsschulischen Übergangssystem - Ergebnisse aus dem Forschungs- und Entwicklungsprojekt InLab TI - Weiterbildung "Individuelle Förderung in der beruflichen Bildung" - Entwicklungen und Implementation eines Blended Learning Ansatzes im Projekt InLab ER - TY - CHAP AU - Kremer, H.-Hugo AU - Knust, S. ED - Kremer, H.-Hugo ED - Beutner, Marc ED - Zoyke, A. ID - 6413 T2 - Individuelle Förderung und berufliche Orientierung im berufsschulischen Übergangssystem - Ergebnisse aus dem Forschungs- und Entwicklungsprojekt InLab TI - Stärkenbasierte Bildungsarbeit zur individuellen Kompetenzentwicklung im Übergang von Schule zu Berufs- und Arbeitswelt ER - TY - JOUR AU - Kremer, H.-Hugo ID - 6414 IS - 6 JF - Die berufsbildende Schule TI - Berufsorientierung als Herausforderung für berufsbildende Schulen ER - TY - JOUR AB - Mobile Learning liegt in der beruflichen Bildung seit dem Aufkommen von Smartphones, Tablet-PCs1 und speziell entwickelten Applikationen (Mobile Apps) im Trend. Ziel des Beitrags ist es, die didaktischen Potenziale des Mobile Learning durch den Einsatz von Tablet-PCs in der beruflichen Ausbildung zu untersuchen. Als Ausgangspunkt dient dabei das Fallbeispiel des Center for Young Professionals in Banking in der Schweiz, das im Jahr 2011 eine umfassende Pilotstudie durchgeführt hat. Ausgehend vom konkreten Fall werden anschliessend die Potenziale für medienbezogene Kompetenzen sowie eine "didaktische Landkarte" zur Verortung von Mobile-Learning-Szenarien eingeführt, um die verschiedenen pädagogischen Leitvorstellungen dieser Szenarien aufzuzeigen. AU - Seufert, Sabine AU - Jenert, Tobias AU - Kuhn-Senn, Andrea ID - 4429 IS - 41 JF - Berufsbildung in Wissenschaft und Praxis KW - mobile learning KW - tablets KW - tablet learning KW - mobile technologies KW - elearning KW - TEL SN - 0341-4515 TI - Didaktische Potenziale des Mobile Learning für die Berufsbildung: Erfahrungen aus einem Pilotprojekt am Center for Young Professionals in Banking in der Schweiz VL - 4 ER - TY - THES AB - Mit welchen Erwartungen und Anforderungen sehen sich Studierende im Hochschulalltag konfrontiert? Wie muss nach Ansicht der Studierenden gehandelt werden, um das Studium "erfolgreich" zu bewältigen? Wie laufen die Auswahl unterschiedlicher Lernaktivitäten im Studium sowie die Allokation von Ressourcen im Detail ab? Diese und weitere Fragen sind vor allem im Zusammenhang mit der Debatte um die Bologna-Reform stärker in den Mittelpunkt gerückt. Denn während modularisierte Curricula und Credit-Point-Systeme oft nach administrativ-organisatorischen Gesichtspunkten eingeführt wurden, hat die Gestaltung der Studienstrukturen auf Programmebene zwangsweise Auswirkungen auf das Studienhandeln - und damit auch auf das Lernen der Studierenden. Es gibt viele Vermutungen über die "Wirkungen" von Bologna auf das Studieren: Die Rede ist von Verschulung, Entwissenschaftlichung und Arbeitsüberlastung und Studierende stehen im Verdacht, ihren Studienpfad eher im Sinne einer Credit-Point-Jagd denn interessengeleitet zu gestalten. In der Regel bleibt es dabei jedoch bei anekdotischen Beobachtungen - es fehlt bislang an gesicherten Erkenntnissen über Zusammenhänge zwischen Bologna-konformen Studienkontexten und dem Handeln Studierender. Denn obschon Studierende seit langem Gegenstand der Forschung sind, ist bislang wenig darüber bekannt, wie sie den langfristigen Bildungsprozess eines ganzen Studiums gestalten. Stattdessen wurde vorwiegend das Lernen im engeren Sinne, das so genannte "Classroom Learning" untersucht. Diejenigen, die Studienprogramme nach didaktischen Gesichtspunkten gestalten wollen müssen wissen, wie Studierende mit unterschiedlichen Studienstrukturen umgehen. Denn nur so ist eine planvolle Programmgestaltung im Sinne pädagogischer Zielsetzungen und didaktischer Prinzipien möglich. Die vorliegende Arbeit nimmt diese Problemstellung auf und untersucht, welche Zielvorstellungen und Handlungsstrategien Studierende bei der Bewältigung ihres Studienalltags in unterschiedlichen Bologna-konformen Studienprogrammen entwickeln. Im Einzelnen wird gefragt, (1) welche Vorstellungen, Wahrnehmungen und Handlungslogiken das Handeln Studierender in unterschiedlichen Studienprogrammen prägen und (2) welche programmspezifischen Kontextbedingungen die Herausbildung dieser handlungsleitenden Charakteristika beeinflussen. Ausgehend von diesen beiden Fragestellungen wird zunächst ein theoretisch fundierter Analyserahmen für Studienprogramme entwickelt. Darauf aufbauend werden verschiedene Studienprogramme empirisch untersucht, um schliesslich Design-Prinzipien für die Gestaltung von Studienprogrammen zu formulieren. Es wird nicht davon ausgegangen, dass Studienstrukturen das Handeln Studierender im Sinne eines kausalen Wirkungszusammenhangs bestimmen. Vielmehr wird gefragt, was die Studierenden mit den Strukturen, auf die sie treffen, machen. Studienprogramme werden als kulturelle Einheiten verstanden, innerhalb derer sich spezifische handlungsleitende Vorstellungen und Normen entwickeln. Diese impliziten Regeln des Studienhandelns - das so genannte "Hidden Curriculum" - und vor allem auch die dahinterliegenden Konstruktionsprozesse aufzudecken, ist Ziel dieser Arbeit. AU - Jenert, Tobias ID - 4443 KW - Studierverhalten KW - Hochschuldidaktik KW - Lernpsychologie KW - Kulturpsychologie KW - Bologna-Prozess KW - Curriculumentwicklung KW - Hochschulbildung KW - Study programme KW - Bologna-process KW - educational development KW - cultural psychology KW - higher education KW - curriculum development TI - Studienprogramme als didaktische Gestaltungs-und Untersuchungseinheit: Theoretische Grundlegung und empirische Analyse ER - TY - GEN AU - Brahm, Taiga AU - Jenert, Tobias ID - 4446 KW - Hochschulentwicklung KW - Hochschuldidaktik TI - Status Quo von Hochschuldidaktik/-entwicklung: Erhebung im Herbst 2011 ER - TY - CONF AB - In den vergangenen Jahren wurden viele Vermutungen über die "Wirkungen" von Bologna auf das Studieren geäussert: Schlagworte wie Verschulung oder Entwissenschaftlichung sind zu hören und Studierende stehen im Verdacht, ihr Studium eher als Credit-Point-Jagd denn interessengeleitet zu gestalten (z.B. Stegemann, 2007, o. S.; Schultheis, et al. 2008). Meist handelt es sich jedoch um anekdotischen Beschreibungen, bis auf wenige Ausnahmen fehlen empirisch belegte Erkenntnisse.1 Denn obschon Studierende seit langem Gegenstand der Forschung sind, ist bislang wenig darüber bekannt, wie sie den langfristigen Bildungsprozess eines ganzen Studiums gestalten. Vorwiegend wurde Lernen im engeren Sinne, das so genannte "Classroom Learning" untersucht (Aineley, 2008). Forschungsfokus. Die diesem Beitrag zugrunde liegende Studie nimmt diese Forschungslücke auf und untersucht Zielvorstellungen und Handlungsstrategien Studierender bei der Bewältigung ihres Studienalltags in unterschiedlichen Bologna-konformen Studienprogrammen. Im Einzelnen wird gefragt, (1) welche Vorstellungen und Wahrnehmungen das Handeln Studierender prägen und (2) welche programmspezifischen Kontextbedingungen die Herausbildung dieser handlungsleitenden Charakteristika beeinflussen. Als theoretischer Rahmen wurde die so genannte Kulturpsychologie herangezogen, die Handeln als Resultat einer Wechselwirkung von individuell-psychischen Merk-malen und sozio-kulturell vermittelten Vorstellungen versteht (Shweder, 1991; Bruner, 1990). AU - Jenert, Tobias ID - 4482 KW - Hochschulentwicklung KW - Studienprogramme KW - Curriculum Development KW - Higher Education KW - Faculty Development TI - Studienprogramme als hochschuldidaktische Gestaltungs-und Untersuchungseinheit ER - TY - CONF AB - Die Lehrpraxis an Hochschulen breitenwirksam und nachhaltig zu verbessern, gehört zu den schwierigsten Herausforderungen für die Hochschuldidaktik. Ein möglicher Weg besteht darin, als hochschuldidaktische Einrichtung stets mit Blick auf die Gesamtstrategie der Hochschule und Anspruchsgruppen in der Hochschulleitung und -administration zu agieren (Jenert & Brahm, 2010). Es stellt sich die Frage, welche Vorstellungen bezüglich der eigenen Aufgaben und der Wirksamkeit des eigenen Handels hochschuldidaktische Stellen in Deutschland haben. Mit einer Online-Befragung von Leitungspersonen im Bereich Hochschuldidaktik und -entwicklung in Deutschland konnten 35 Personen (72 angeschrieben) erreicht werden, wobei sich ein breiter Querschnitt verschiedener Einrichtungen ergab. Abgefragt wurden (1) Struktur und institutionelle Anbindung der Einrichtung, (2) Wahrnehmung der eigenen Wirksamkeit sowie (3) Aufgabenschwerpunkte und notwendige Kompetenzen. Die Ergebnisse zeigen, dass einerseits ein Bewusstsein für Herausforderungen jenseits didaktischer Aus- und Weiterbildung besteht und die strategische Dimension erkannt ist. Gleichzeitig zeigt die Betonung "traditioneller" Aufgaben und Kompetenzen, dass die strategische Dimension im Tagesgeschäft oft noch keine zentrale Rolle spielt. AU - Jenert, Tobias AU - Brahm, Taiga ID - 4483 KW - Hochschulentwicklung KW - higher education development KW - Hochschuldidaktik TI - " Nur" didaktisch oder auch strategisch?: Strukturelle Verankerung, Aufgaben-und Wirksamkeitswahrnehmungen hochschuldidaktischer Einrichtungen in Deutschland ER - TY - CONF AU - Gebhardt, Anja AU - Jenert, Tobias ID - 4486 KW - learning culture KW - social interaction TI - How to Assess and Study the Cultural Dimension of Social Interactions in Higher Education Institutions (HEI) ER - TY - CONF AB - Hintergrund / Kontext In der Hochschuldidaktik hat sich der traditionelle Ansatz, der sich auf das Individuum bezogene Aus- und Weiterbildungs- sowie Beratungsangebote konzentriert, weitgehend etabliert (Urban & Meister, 2010; Land, 2010; Dany, 2007). Allerdings sind diese Aktivitäten in Bezug auf die Bildungsqualität einer gesamten Hochschule oft wenig wirksam. Der Ansatz schlägt vor, hochschuldidaktische Initiativen auf mehreren Ebenen der Hochschule zu verankern: individuelle, programmbezogene und institutionelle Massnahmen (Jenert & Brahm, 2010; Brahm et al., 2010). Zielsetzung / Fragestellung Der Ansatz einer institutionsweiten Hochschulentwicklung wird vor dem Hintergrund einer aktuellen Erhebung zum Status Quo der Hochschuldidaktik diskutiert. Im Zentrum steht die Frage, wie, didaktische Initiativen in der Hochschule nachhaltig verankert werden können. Untersuchungsdesign / Datenerhebung und -auswertung In einer Online-Befragung wurden 32 Hochschuldidaktiker aus Deutschland und der Schweiz befragt. Zur Vertiefung wurden fünf telefonische Interviews durchgeführt. Die schriftlichen Befragungsdaten wurden mittels SPSS, die Interviews (nach der Transkription) inhaltsanalytisch ausgewertet. Erste Ergebnisse Die meisten hochschuldidaktischen Einrichtungen konzentrieren sich auf die Organisation und Durchführung von Qualifizierungsmassnahmen (für 71,9% der Befragten gehört dies zu den bedeutsamen Aufgaben). Dagegen wird die Unterstützung von Programmverantwortlichen oder der Hochschulleitung nur von einem Viertel der Befragten als wichtige Aufgabe erachtet. In den Interviews wird deutlich, dass nur wenige Ansätze bestehen, wie didaktische Initiativen in die gesamte Hochschule getragen werden können. Berufs- und wirtschaftspädagogische Relevanz Die ersten Ergebnisse der Untersuchung zeigen, dass das Feld der Hochschuldidaktik und -entwicklung bisher noch wenig strukturiert ist. Bestehende Ansätze der Berufs- und Wirtschaftspädagogik (z. B. Euler & Sloane, 1999; Gerholz et al., 2010; Gerholz, 2012) können einen Beitrag dazu leisten, didaktische Veränderungsinitiativen innerhalb der Hochschulen wirksamer und nachhaltiger zu gestalten. AU - Brahm, Taiga AU - Gerholz, Karl-Heinz AU - Jenert, Tobias ID - 4488 KW - Hochschuldidaktik KW - Hochschulentwicklung KW - Neo-Institutionalismus KW - Strategie TI - Institutionsweite Hochschulentwicklung als neo-institutionalistisches Phänomen ER - TY - CHAP AU - Jenert, Tobias ED - Brinker, Tobina ED - Tremp , Peter ID - 4511 SN - 978-3-7639-5052-2 T2 - Einführung in die Studiengangentwicklung TI - Programmgestaltung als professionelle Aufgabe der Hochschulentwicklung: Gestaltungsmodell und Fallstudie ER - TY - CHAP AU - Jenert, Tobias AU - Fust, Alexander ED - Zimmermann, Tobias ED - Zellweger, Franziska ID - 4512 SN - 978-3-03-905-783-2 T2 - Lernendenorientierung: Studierende im Fokus TI - Studierende (als) Kunden?: Zum Umgang mit einer herausfordernden Beziehung zwischen Lehrenden und Lernenden VL - 3 ER - TY - CONF AU - Jenert, Tobias ID - 4536 TI - Service - Forscher - Change Agents?! Rollen und Strategien einer gestaltungsorientierten Hochschulentwicklung: Keynote-Vortrag im Rahmen des Jungen Forums Hochschul-und Mediendidaktik ER - TY - JOUR AU - Feng, Yuanhua ID - 4597 IS - 2 JF - Journal of Applied Statistics SN - 0266-4763 TI - An iterative plug-in algorithm for decomposing seasonal time series using the Berlin Method VL - 40 ER - TY - JOUR AU - Feng, Yuanhua AU - Beran, Jan ID - 4601 IS - 1 JF - Journal of Time Series Analysis SN - 0143-9782 TI - Optimal convergence rates in non-parametric regression with fractional time series errors VL - 34 ER - TY - JOUR AU - Feng, Yuanhua AU - Beran, Jan ID - 4610 IS - 4 JF - Journal of Statistical Theory and Practice SN - 1559-8608 TI - Filtered Log-Periodogram Regression of Long Memory Processes VL - 3 ER - TY - JOUR AU - Beran, Jan AU - Feng, Yuanhua ID - 4611 IS - 2 JF - Journal of Statistical Theory and Practice SN - 1559-8608 TI - Weighted Averages and Local Polynomial Estimation for Fractional Linear ARCH Processes VL - 1 ER - TY - JOUR AU - Beran, Jan AU - Feng, Yuanhua ID - 4612 IS - 2 JF - Journal of Statistical Theory and Practice SN - 1559-8608 TI - Weighted Averages and Local Polynomial Estimation for Fractional Linear ARCH Processes VL - 1 ER - TY - CHAP AU - Feng, Yuanhua AU - Heiler, Siegfried ID - 4631 SN - 9783642470295 T2 - Econometrics in Theory and Practice TI - Locally Weighted Autoregression ER - TY - GEN AU - Feng, Yuanhua AU - Hand, David AU - Yu, Keming ID - 4659 TI - A Multivariate Random Walk Model with Slowly Changing Drift and Cross-correlation Applied to Finance ER - TY - CONF AB - Event-driven Business Process Management (EdBPM) is based upon exchanging and processing business events. As yet, no commonly adopted event format for communicating business events between distributed event producers and consumers has emerged. This paper is an effort to review the status quo of event formats against the requirements of EdBPM. We particularly discuss BPAF, CBE, and XES as promising candidates and identify prospects for development. AU - Becker, Jörg AU - Matzner, Martin AU - Müller, Oliver AU - Walter, Marcel ID - 4704 IS - PART 1 KW - EDA KW - Event Exchange Format KW - edBPM SN - 18651348 T2 - Lecture Notes in Business Information Processing TI - A review of event formats as enablers of event-driven BPM ER - TY - CONF AB - Real-time access to key performance indicators is necessary to ensure timeliness and effectiveness of operational business processes. The concept of Business Activity Monitoring (BAM) refers to the observation, analysis, and presentation of real-time information about business activities across systems' and companies' borders. Designing and maintaining BAM applications is challenging, as the involved concepts (e.g., business processes, audit logs, performance measures) --though being strongly interrelated-- are developed by different communities of practice. Also, they reside on different levels of abstraction, and are handled by different IT systems. Hence, we developed a conceptual modeling language which extends the widely accepted Business Process Modeling Notation (BPMN) by BAM-relevant concepts. The main results presented in this paper are: (1) a meta-model which formally describes the conceptual aspects of the developed BPMN extension (abstract syntax); (2) graphical symbols as an exemplary representation of this abstract syntax (concrete syntax); (3) a demo scenario that illustrates the application of the language in a fictitious scenario. AU - Friedenstab, Jan Philipp AU - Janiesch, Christian AU - Matzner, Martin AU - Müller, Oliver ID - 4705 SN - 15301605 T2 - Hawaii International Conference on System Sciences TI - Extending BPMN for business activity monitoring ER - TY - JOUR AB - Purpose – The purpose of this paper is to show how to employ complex event processing (CEP) for the observation and management of business processes. It proposes a conceptual architecture of BPM event producer, processor, and consumer and describes technical implications for the application with standard software in a perfect order scenario. Design/methodology/approach – The authors discuss business process analytics as the technological background. The capabilities of CEP in a BPM context are outlined an architecture design is proposed. A sophisticated proof-of-concept demonstrates its applicability. Findings – The results overcome the separation and data latency issues of process controlling, monitoring, and simulation. Distinct analyses of past, present, and future blur into a holistic real-time approach. The authors highlight the necessity for configurable event producer in BPM engines, process event support in CEP engines, a common process event format, connectors to visualizers, notifiers and return channels to the BPM engine. Research limitations/implications – Further research will thoroughly evaluate the approach in a variety of business settings. New concepts and standards for the architecture's building blocks will be needed to improve maintainability and operability. Practical implications – Managers learn how CEP can yield insights into business processes' operations. The paper illustrates a path to overcome inflexibility, latency, and missing feedback mechanisms of current process modeling and control solutions. Software vendors might be interested in the conceptualization and the described needs for further development. Originality/value – So far, there is no commercial CEP-based BPM solution which facilitates a round trip from insight to action as outlines. As major software vendors have begun developing solutions (BPM/BPA solutions), this paper will stimulate a debate between research and practice on suitable design and technology. AU - Janiesch, Christian AU - Matzner, Martin AU - Müller, Oliver ID - 4706 IS - 4 JF - Business Process Management Journal KW - Architecture KW - Business activity monitoring KW - Business process management KW - Business process re-engineering KW - Complex event processing KW - Computer software KW - Standard software SN - 14637154 TI - Beyond process monitoring: A proof-of-concept of event-driven business activity management ER - TY - JOUR AU - Frick, Bernd AU - Ocaña, Miguel Ángel Malo AU - Martinez, Pilar Garcia AU - Schneider, Martin ID - 4835 IS - 1 JF - Estudios de economia aplicada TI - The demand for individual grievance procedures in Germany and Spain: Labour law changes versus business cycle ER - TY - JOUR AU - Eggert, Andreas AU - Henseler, J{\ AU - Hollmann, Sabine ID - 4853 IS - 2 JF - Journal of Supply Chain Management TI - Who owns the customer? Disentangling customer loyalty in indirect distribution channels ER - TY - JOUR AU - Terho, Harri AU - Haas, Alexander AU - Eggert, Andreas AU - Ulaga, Wolfgang ID - 4854 IS - 1 JF - Industrial Marketing Management TI - ‘It's almost like taking the sales out of selling’—towards a conceptualization of value-based selling in business markets ER - TY - BOOK ED - Kremer, H.-Hugo ED - Beutner, Marc ED - Zoyke, A. ID - 6987 TI - Individuelle Förderung und berufliche Orientierung im berufsschulischen Übergangssystem - Ergebnisse aus dem Forschungs- und Entwicklungsprojekt InLab ER - TY - JOUR AU - Tramm, T. AU - Seeber, S. AU - Kremer, H.-Hugo ID - 6988 IS - 22 JF - bwp@ Berufs- und Wirtschaftspädagogik - online TI - Funktionen und Erträge pädagogischer Diagnostik im wirtschafts- und berufspädagogischen Bereich ER - TY - JOUR AU - Büchter, K. AU - Frommeberger, D. AU - Kremer, H.-Hugo ID - 6993 IS - 23 JF - bwp@ Berufs- und Wirtschaftspädagogik - online TI - Akademisierung der Berufsbildung ER - TY - JOUR AU - Burke, A. M. AU - Waddington, D. E. J. AU - Carrad, D. J. AU - Lyttleton, R. W. AU - Tan, H. H. AU - Reece, P. J. AU - Klochan, O. AU - Hamilton, A. R. AU - Rai, A. AU - Reuter, Dirk AU - Wieck, A. D. AU - Micolich, A. P. ID - 7300 IS - 16 JF - Physical Review B SN - 1098-0121 TI - Origin of gate hysteresis inp-type Si-doped AlGaAs/GaAs heterostructures VL - 86 ER -