@inproceedings{367,
  abstract     = {{Online social networks are attracting billions of nowadays, both on a global scale as well as in social enterprise networks. Using distributed hash tables and peer-to-peer technology allows online social networks to be operated securely and efficiently only by using the resources of the user devices, thus alleviating censorship or data misuse by a single network operator. In this paper, we address the challenges that arise in implementing reliably and conveniently to use distributed data structures, such as lists or sets, in such a distributed hash-tablebased online social network. We present a secure, distributed list data structure that manages the list entries in several buckets in the distributed hash table. The list entries are authenticated, integrity is maintained and access control for single users and also groups is integrated. The approach for secure distributed lists is also applied for prefix trees and sets, and implemented and evaluated in a peer-to-peer framework for social networks. Evaluation shows that the distributed data structure is convenient and efficient to use and that the requirements on security hold.}},
  author       = {{Janiuk, Jens and Mäcker, Alexander and Graffi, Kalman}},
  booktitle    = {{Proceedings of the International Conference on Collaboration Technologies and Systems (CTS)}},
  pages        = {{396--405}},
  title        = {{{Secure Distributed Data Structures for Peer-to-Peer-based Social Networks}}},
  doi          = {{10.1109/CTS.2014.6867595}},
  year         = {{2014}},
}

@article{378,
  abstract     = {{The Chord peer-to-peer system is considered, together with CAN, Tapestry and Pastry, as one of the pioneering works on peer-to-peer distributed hash tables (DHT) that inspired a large volume of papers and projects on DHTs as well as peer-to-peer systems in general. Chord, in particular, has been studied thoroughly, and many variants of Chord have been presented that optimize various criteria. Also, several implementations of Chord are available on various platforms. Though Chord is known to be very efficient and scalable and it can handle churn quite well, no protocol is known yet that guarantees that Chord is self-stabilizing, i.e., the Chord network can be recovered from any initial state in which the network is still weakly connected. This is not too surprising since it is known that the Chord network is not locally checkable for its current topology. We present a slight extension of the Chord network, called Re-Chord (reactive Chord), that turns out to be locally checkable, and we present a self-stabilizing distributed protocol for it that can recover the Re-Chord network from any initial state, in which the n peers are weakly connected, in O(nlogn) communication rounds. We also show that our protocol allows a new peer to join or an old peer to leave an already stable Re-Chord network so that within O(logn)^2) communication rounds the Re-Chord network is stable again.}},
  author       = {{Kniesburges, Sebastian and Koutsopoulos, Andreas and Scheideler, Christian}},
  journal      = {{Theory of Computing Systems}},
  number       = {{3}},
  pages        = {{591--612}},
  publisher    = {{Springer}},
  title        = {{{Re-Chord: A Self-stabilizing Chord Overlay Network}}},
  doi          = {{10.1007/s00224-012-9431-2}},
  year         = {{2014}},
}

@inproceedings{379,
  abstract     = {{In the leasing variant of Set Cover presented by Anthony et al.[1], elements U arrive over time and must be covered by sets from a familyF of subsets of U. Each set can be leased for K different periods of time.Let |U| = n and |F| = m. Leasing a set S for a period k incurs a cost ckS and allows S to cover its elements for the next lk time steps. The objectiveis to minimize the total cost of the sets leased, such that elements arrivingat any time t are covered by sets which contain them and are leased duringtime t. Anthony et al. [1] gave an optimal O(log n)-approximation forthe problem in the offline setting, unless P = NP [22]. In this paper, wegive randomized algorithms for variants of Set Cover Leasing in the onlinesetting, including a generalization of Online Set Cover with Repetitionspresented by Alon et al. [2], where elements appear multiple times andmust be covered by a different set at each arrival. Our results improve theO(log2(mn)) competitive factor of Online Set Cover with Repetitions [2]to O(log d log(dn)) = O(logmlog(mn)), where d is the maximum numberof sets an element belongs to.}},
  author       = {{Abshoff, Sebastian and Markarian, Christine and Meyer auf der Heide, Friedhelm}},
  booktitle    = {{Proceedings of the 8th Annual International Conference on Combinatorial Optimization and Applications (COCOA)}},
  pages        = {{25--34}},
  title        = {{{Randomized Online Algorithms for Set Cover Leasing Problems}}},
  doi          = {{10.1007/978-3-319-12691-3_3}},
  year         = {{2014}},
}

@inproceedings{380,
  abstract     = {{Network creation games model the creation and usage costs of networks formed by n selfish nodes. Each node v can buy a set of edges, each for a fixed price α > 0. Its goal is to minimize its private costs, i.e., the sum (SUM-game, Fabrikant et al., PODC 2003) or maximum (MAX-game, Demaine et al., PODC 2007) of distances from v to all other nodes plus the prices of the bought edges. The above papers show the existence of Nash equilibria as well as upper and lower bounds for the prices of anarchy and stability. In several subsequent papers, these bounds were improved for a wide range of prices α. In this paper, we extend these models by incorporating quality-of-service aspects: Each edge cannot only be bought at a fixed quality (edge length one) for a fixed price α. Instead, we assume that quality levels (i.e., edge lengths) are varying in a fixed interval [βˇ,β^] , 0 series = {LNCS}}},
  author       = {{Cord-Landwehr, Andreas and Mäcker, Alexander and Meyer auf der Heide, Friedhelm}},
  booktitle    = {{Proceedings of the 10th International Conference on Web and Internet Economics (WINE)}},
  pages        = {{423--428}},
  title        = {{{Quality of Service in Network Creation Games}}},
  doi          = {{10.1007/978-3-319-13129-0_34}},
  year         = {{2014}},
}

@misc{391,
  author       = {{Feldkord, Björn}},
  publisher    = {{Universität Paderborn}},
  title        = {{{On Variants of the Page Migration Problem}}},
  year         = {{2014}},
}

@inproceedings{3172,
  author       = {{Isenberg, Tobias and Wehrheim, Heike}},
  booktitle    = {{Formal Methods and Software Engineering - 16th International Conference on Formal Engineering Methods, {ICFEM} 2014, Luxembourg, Luxembourg, November 3-5, 2014. Proceedings}},
  editor       = {{Merz, Stephan and Pang, Jun}},
  pages        = {{203----218}},
  title        = {{{Timed Automata Verification via {IC3} with Zones}}},
  doi          = {{10.1007/978-3-319-11737-9_14}},
  year         = {{2014}},
}

@article{27059,
  abstract     = {{<jats:p>The present study aimed to investigate the relationships between macronutrient intake and serum lipid profile in adolescents from eight European cities participating in the HELENA (Healthy Lifestyle in Europe by Nutrition in Adolescence) cross-sectional study (2006–7), and to assess the role of body fat-related variables in these associations. Weight, height, waist circumference, skinfold thicknesses, total cholesterol, HDL-cholesterol (HDL-C), LDL-cholesterol, TAG, apoB and apoA1 were measured in 454 adolescents (44 % boys) aged 12·5–17·5 years. Macronutrient intake (g/4180 kJ per d (1000 kcal per d)) was assessed using two non-consecutive 24 h dietary recalls. Associations were evaluated by multi-level analysis and adjusted for sex, age, maternal education, centre, sum of four skinfolds, moderate-to-vigorous physical activity, sedentary behaviours and diet quality index for adolescents. Carbohydrate intake was inversely associated with HDL-C (β = − 0·189, <jats:italic>P</jats:italic>&lt; 0·001). An inverse association was found between fat intake and TAG (β = − 0·319, <jats:italic>P</jats:italic>&lt; 0·001). Associations between macronutrient intake and serum lipids varied according to adiposity levels, i.e. an inverse association between carbohydrate intake and HDL-C was only observed in those adolescents with a higher waist:height ratio. As serum lipids and excess body fat are the major markers of CVD, these findings should be considered when developing strategies to prevent the risk of CVD among adolescents.</jats:p>}},
  author       = {{Bel-Serrat, Silvia and Mouratidou, Theodora and Huybrechts, Inge and Labayen, Idoia and Cuenca-García, Magdalena and Palacios, Gonzalo and Breidenassel, Christina and Molnár, Dénes and Roccaldo, Romana and Widhalm, Kurt and Gottrand, Frederic and Kafatos, Anthony and Manios, Yannis and Vyncke, Krishna and Sjöström, Michael and Libuda, Lars and Gómez-Martínez, Sonia and Moreno, Luis A.}},
  issn         = {{0007-1145}},
  journal      = {{British Journal of Nutrition}},
  pages        = {{2049--2059}},
  title        = {{{Associations between macronutrient intake and serum lipid profile depend on body fat in European adolescents: the Healthy Lifestyle in Europe by Nutrition in Adolescence (HELENA) study}}},
  doi          = {{10.1017/s0007114514003183}},
  year         = {{2014}},
}

@book{19060,
  abstract     = {{Erscheinungsjahr in Klammern: 2015}},
  editor       = {{Assmann, David-Christopher and Eke, Norbert Otto and Geulen, Eva}},
  pages        = {{308}},
  publisher    = {{Erich Schmidt}},
  title        = {{{Entsorgungsprobleme: Müll in der Literatur}}},
  year         = {{2014}},
}

@book{19063,
  editor       = {{Eke, Norbert Otto and Foit, Lioba and Kaerlein, Timo and Künsemöller, Jörn}},
  pages        = {{292}},
  publisher    = {{Fink}},
  title        = {{{Logiken strukturbildender Prozesse: Automatismen}}},
  year         = {{2014}},
}

@book{19064,
  editor       = {{Eke, Norbert Otto and Füllner, Karin and Vidal, Francesca}},
  pages        = {{205}},
  publisher    = {{Aisthesis}},
  title        = {{{„Zuckererbsen für Jedermann“. Literatur und Utopie. Heine und Bloch heute}}},
  year         = {{2014}},
}

@book{19069,
  editor       = {{Brauerhoch, Annette and Eke, Norbert Otto and Wieser, Renate and Zechner, Anke}},
  pages        = {{337}},
  publisher    = {{Fink}},
  title        = {{{Entautomatisierung}}},
  year         = {{2014}},
}

@book{19070,
  editor       = {{Eke, Norbert Otto and Haß, Ulrike and Kaldrack, Irina}},
  pages        = {{393}},
  publisher    = {{Fink}},
  title        = {{{Bühne. Raumbildende Prozesse im Theater}}},
  year         = {{2014}},
}

@inbook{19237,
  author       = {{Eke, Norbert Otto}},
  booktitle    = {{Faszinosum ‚Klang‘. Anthropologie – Medialität – kulturelle Praxis}},
  editor       = {{Schmidt, Wolf Gerhard}},
  pages        = {{200--217}},
  publisher    = {{de Gruyter}},
  title        = {{{„Bis an die unerhörte Grenze“ oder: Der Klang des Schmerzes. Vielstimmigkeit in Anne Dudens Schreibkonzept}}},
  year         = {{2014}},
}

@article{19238,
  author       = {{Eke, Norbert Otto}},
  journal      = {{New German Critique}},
  number       = {{No. 3/123}},
  pages        = {{95--112}},
  title        = {{{In the Image: The Transformation of Cinematic Shoah Representations in Michael Glawogger’s „Kill Daddy Good Night“}}},
  volume       = {{41}},
  year         = {{2014}},
}

@inbook{19239,
  author       = {{Eke, Norbert Otto}},
  booktitle    = {{Logiken strukturbildender Prozesse: Automatismen}},
  editor       = {{Eke, Norbert Otto and Foit, Lioba and Kaerlein, Timo and Künsemöller, Jörn}},
  pages        = {{209--225}},
  publisher    = {{Fink}},
  title        = {{{„Ihr drängt euch zu“. Inszenierungen mnemonischer Automatismen und epiphanischen Erscheinens}}},
  year         = {{2014}},
}

@inbook{19240,
  abstract     = {{Seitenanzahl des Buches: 292}},
  author       = {{Eke, Norbert Otto and Foit, Lioba and Kaerlein, Timo and Künsemöller, Jörn}},
  booktitle    = {{Logiken strukturbildender Prozesse: Automatismen}},
  editor       = {{Eke, Norbert Otto and Foit, Lioba and Kaerlein, Timo and Künsemöller, Jörn}},
  pages        = {{9--15}},
  publisher    = {{Fink}},
  title        = {{{Logiken strukturbildender Prozesse. Automatismen}}},
  year         = {{2014}},
}

@article{19241,
  abstract     = {{Lieu de publication: Paris}},
  author       = {{Eke, Norbert Otto}},
  journal      = {{Revue d’historire de la shoah (La revue du centre de documentation juive contemporaine), Nr. 201: La littérature allemande et la Shoah, 1945-2014}},
  number       = {{Oktober}},
  pages        = {{25--54}},
  title        = {{{La shoah dans la littérature germanophone. Apories de la representation. Passages de Frontières et ponts créateurs de sens les années de l’après-guerre}}},
  year         = {{2014}},
}

@article{19242,
  abstract     = {{Lieu de publication: Paris}},
  author       = {{Eke, Norbert Otto}},
  journal      = {{Revue d’historire de la shoah (La revue du centre de documentation juive contemporaine), Nr. 201: La littérature allemande et la Shoah, 1945-2014}},
  number       = {{Oktober}},
  pages        = {{183--211}},
  title        = {{{La Shoah dans la littérature de la RDA}}},
  year         = {{2014}},
}

@inbook{19243,
  author       = {{Eke, Norbert Otto}},
  booktitle    = {{Schreiben nach Kleist. Literarische, mediale und theoretische Transkriptionen}},
  editor       = {{Fleig, Anne and Moser, Christian and Schneider, Helmut J.}},
  pages        = {{219--236}},
  publisher    = {{Rombach}},
  title        = {{{Müller/Kleist oder: Kleist nachschreiben}}},
  year         = {{2014}},
}

@inbook{19244,
  author       = {{Eke, Norbert Otto and Füllner, Karin and Vidal, Francesca}},
  booktitle    = {{„Zuckererbsen für Jedermann“. Literatur und Utopie. Heine und Bloch heute}},
  editor       = {{Eke, Norbert Otto and Füllner, Karin and Vidal, Francesca}},
  pages        = {{7--13}},
  publisher    = {{Aisthesis}},
  title        = {{{Literatur und Utopie. Heine und Bloch heute}}},
  year         = {{2014}},
}