TY - JOUR
AB - This article studies the construction of self-stabilizing topologies for distributed systems. While recent research has focused on chain topologies where nodes need to be linearized with respect to their identiers, we explore a natural and relevant 2-dimensional generalization. In particular, we present a local self-stabilizing algorithm DStab which is based on the concept of \local Delaunay graphs" and which forwards temporary edges in greedy fashion reminiscent of compass routing. DStab constructs a Delaunay graph from any initial connected topology and in a distributed manner in time O(n3) in the worst-case; if the initial network contains the Delaunay graph, the convergence time is only O(n) rounds. DStab also ensures that individual node joins and leaves aect a small part of the network only. Such self-stabilizing Delaunay networks have interesting applications and our construction gives insights into the necessary geometric reasoning that is required for higherdimensional linearization problems.Keywords: Distributed Algorithms, Topology Control, Social Networks
AU - Jacob, Riko
AU - Ritscher, Stephan
AU - Scheideler, Christian
AU - Schmid, Stefan
ID - 570
JF - Theoretical Computer Science
TI - Towards higher-dimensional topological self-stabilization: A distributed algorithm for Delaunay graphs
ER -
TY - JOUR
AB - The tendency of managers to focus on short-term results rather than on sustained company success is of particular importance to retail marketing managers, because marketing activities involve expenditures which may only pay off in the longer term. To address the issue of myopic management, our study shows how the complexity of the service profit chain (SPC) can cause managers to make suboptimal decisions. Hence, our paper departs from past research by recognizing that understanding the temporal interplay between operational investments, employee satisfaction, customer satisfaction, and operating profit is essential to achieving sustained success. In particular, we intend to improve understanding of the functioning of the SPC with respect to time lags and feedback loops. Results of our large-scale longitudinal study set in a multi-outlet retail chain reveal time-lag effects between operational investments and employee satisfaction, as well as between customer satisfaction and performance. These findings, along with evidence of a negative interaction effect of employee satisfaction on the relationship between current performance and future investments, show the substantial risk of mismanaging the SPC. We identify specific situations in which the dynamic approach leads to superior marketing investment decisions, when compared to the conventional static view of the SCP. These insights provide valuable managerial guidance for effectively managing the SPC over time.
AU - Evanschitzky, Heiner
AU - Wangenheim, Florian v
AU - Wünderlich, Nancy
ID - 5716
IS - 3
JF - Journal of Retailing
KW - Employee satisfaction
KW - Customer satisfaction
KW - Performance
KW - Service profit chain
KW - Feedback loops
KW - Time lags
KW - Myopic marketing management
TI - Perils of Managing the Service Profit Chain: The Role of Time Lags and Feedback Loops.
VL - 88
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 - Sekula, Stephan
ID - 621
TI - Datenschutzgerechte E-Payment-Schemata im On-The-Fly Computing
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
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 - 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 - 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 - JOUR
AU - Baum, M
AU - Gsell, L
AU - Kabst, Rüdiger
ID - 5494
IS - 3
JF - Die Betriebswirtschaft (ZfB).
TI - Determinanten des Employer Branding in deutschen Unternehmen: Ein neoinstitutionalistischer Erklärungsansatz.
VL - 72
ER -
TY - JOUR
AU - Steinmetz, Holger
AU - Isidor, R
AU - Bäuerle, N
ID - 5519
IS - 1
JF - Survey Research Methods
TI - Testing the Circular Structure of Human Values: A Meta-Analytical Structural Equation Modelling Approach.
VL - 6
ER -
TY - CONF
AU - Schryen, Guido
AU - Wex, Felix
ID - 5615
T2 - 45th Hawaii International Conference on System Sciences
TI - IS Design Thinking in Disaster Management Research
ER -
TY - GEN
AU - Bremer, Lars
ID - 575
TI - Symbiotic Coupling of Peer-to-Peer and Cloud Systems
ER -
TY - GEN
AU - Strothmann, Thim Frederik
ID - 582
TI - Self-Optimizing Binary Search Trees - A Game Theoretic Approach
ER -
TY - GEN
AU - Haarhoff, Thomas
ID - 607
TI - Identitätsbasierte Kryptographie - Implementierung von Paarungen für Körper der Charakteristik 2
ER -
TY - GEN
AU - Lehrig, Sebastian
ID - 614
TI - Empirischer, quantitativer Vergleich von Modelltransformationssprachen
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 - Klerx, Timo
ID - 594
TI - Online Parameteroptimierung in P2P-Netzwerken mit Hilfe von Neuronalen Netzen
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
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 - 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 -