---
_id: '19250'
author:
- first_name: Norbert Otto
full_name: Eke, Norbert Otto
id: '104'
last_name: Eke
citation:
ama: 'Eke NO. Bühne als Wahrnehmungsraum. Stimme, Klang und Präsenz. In: Eke NO,
Haß U, Kaldrack I, eds. Bühne. Raumbildende Prozesse im Theater. München:
Fink; 2014:29-46.'
apa: 'Eke, N. O. (2014). Bühne als Wahrnehmungsraum. Stimme, Klang und Präsenz.
In N. O. Eke, U. Haß, & I. Kaldrack (Eds.), Bühne. Raumbildende Prozesse
im Theater (pp. 29–46). München: Fink.'
bibtex: '@inbook{Eke_2014, place={München}, title={Bühne als Wahrnehmungsraum. Stimme,
Klang und Präsenz}, booktitle={Bühne. Raumbildende Prozesse im Theater}, publisher={Fink},
author={Eke, Norbert Otto}, editor={Eke, Norbert Otto and Haß, Ulrike and Kaldrack,
IrinaEditors}, year={2014}, pages={29–46} }'
chicago: 'Eke, Norbert Otto. “Bühne als Wahrnehmungsraum. Stimme, Klang und Präsenz.”
In Bühne. Raumbildende Prozesse im Theater, edited by Norbert Otto Eke,
Ulrike Haß, and Irina Kaldrack, 29–46. München: Fink, 2014.'
ieee: 'N. O. Eke, “Bühne als Wahrnehmungsraum. Stimme, Klang und Präsenz,” in Bühne.
Raumbildende Prozesse im Theater, N. O. Eke, U. Haß, and I. Kaldrack, Eds.
München: Fink, 2014, pp. 29–46.'
mla: Eke, Norbert Otto. “Bühne als Wahrnehmungsraum. Stimme, Klang und Präsenz.”
Bühne. Raumbildende Prozesse im Theater, edited by Norbert Otto Eke et
al., Fink, 2014, pp. 29–46.
short: 'N.O. Eke, in: N.O. Eke, U. Haß, I. Kaldrack (Eds.), Bühne. Raumbildende
Prozesse im Theater, Fink, München, 2014, pp. 29–46.'
date_created: 2020-09-10T08:55:55Z
date_updated: 2022-01-06T06:54:00Z
department:
- _id: '465'
editor:
- first_name: Norbert Otto
full_name: Eke, Norbert Otto
last_name: Eke
- first_name: Ulrike
full_name: Haß, Ulrike
last_name: Haß
- first_name: Irina
full_name: Kaldrack, Irina
last_name: Kaldrack
language:
- iso: ger
page: 29-46
place: München
publication: Bühne. Raumbildende Prozesse im Theater
publisher: Fink
status: public
title: Bühne als Wahrnehmungsraum. Stimme, Klang und Präsenz
type: book_chapter
user_id: '14932'
year: '2014'
...
---
_id: '19251'
author:
- first_name: Norbert Otto
full_name: Eke, Norbert Otto
id: '104'
last_name: Eke
- first_name: Ulrike
full_name: Haß, Ulrike
last_name: Haß
- first_name: Irina
full_name: Kaldrack, Irina
last_name: Kaldrack
citation:
ama: 'Eke NO, Haß U, Kaldrack I. Bühne: Raumbildende Prozesse im Theater. In: Eke
NO, Haß U, Kaldrack I, eds. Bühne. Raumbildende Prozesse im Theater. München:
Fink; 2014:9-12.'
apa: 'Eke, N. O., Haß, U., & Kaldrack, I. (2014). Bühne: Raumbildende Prozesse
im Theater. In N. O. Eke, U. Haß, & I. Kaldrack (Eds.), Bühne. Raumbildende
Prozesse im Theater (pp. 9–12). München: Fink.'
bibtex: '@inbook{Eke_Haß_Kaldrack_2014, place={München}, title={Bühne: Raumbildende
Prozesse im Theater}, booktitle={Bühne. Raumbildende Prozesse im Theater}, publisher={Fink},
author={Eke, Norbert Otto and Haß, Ulrike and Kaldrack, Irina}, editor={Eke, Norbert
Otto and Haß, Ulrike and Kaldrack, IrinaEditors}, year={2014}, pages={9–12} }'
chicago: 'Eke, Norbert Otto, Ulrike Haß, and Irina Kaldrack. “Bühne: Raumbildende
Prozesse im Theater.” In Bühne. Raumbildende Prozesse im Theater, edited
by Norbert Otto Eke, Ulrike Haß, and Irina Kaldrack, 9–12. München: Fink, 2014.'
ieee: 'N. O. Eke, U. Haß, and I. Kaldrack, “Bühne: Raumbildende Prozesse im Theater,”
in Bühne. Raumbildende Prozesse im Theater, N. O. Eke, U. Haß, and I. Kaldrack,
Eds. München: Fink, 2014, pp. 9–12.'
mla: 'Eke, Norbert Otto, et al. “Bühne: Raumbildende Prozesse im Theater.” Bühne.
Raumbildende Prozesse im Theater, edited by Norbert Otto Eke et al., Fink,
2014, pp. 9–12.'
short: 'N.O. Eke, U. Haß, I. Kaldrack, in: N.O. Eke, U. Haß, I. Kaldrack (Eds.),
Bühne. Raumbildende Prozesse im Theater, Fink, München, 2014, pp. 9–12.'
date_created: 2020-09-10T09:00:15Z
date_updated: 2022-01-06T06:54:00Z
department:
- _id: '465'
editor:
- first_name: Norbert Otto
full_name: Eke, Norbert Otto
last_name: Eke
- first_name: Ulrike
full_name: Haß, Ulrike
last_name: Haß
- first_name: Irina
full_name: Kaldrack, Irina
last_name: Kaldrack
language:
- iso: ger
page: 9-12
place: München
publication: Bühne. Raumbildende Prozesse im Theater
publisher: Fink
status: public
title: 'Bühne: Raumbildende Prozesse im Theater'
type: book_chapter
user_id: '14932'
year: '2014'
...
---
_id: '19252'
author:
- first_name: Norbert Otto
full_name: Eke, Norbert Otto
id: '104'
last_name: Eke
citation:
ama: 'Eke NO. „Man kann auch auf die Deutschen nicht wirken, wenn sie in Schauspielhäusern
sitzen.“ Mediale Konstellierungen von Öffentlichkeit im Zeitalter der Revolutionen.
In: Wagner M, ed. Agenten der Öffentlichkeit. Theater und Medien im frühen
19. Jahrhundert. Bielefeld: Aisthesis; 2014:29-59.'
apa: 'Eke, N. O. (2014). „Man kann auch auf die Deutschen nicht wirken, wenn sie
in Schauspielhäusern sitzen.“ Mediale Konstellierungen von Öffentlichkeit im Zeitalter
der Revolutionen. In M. Wagner (Ed.), Agenten der Öffentlichkeit. Theater und
Medien im frühen 19. Jahrhundert (pp. 29–59). Bielefeld: Aisthesis.'
bibtex: '@inbook{Eke_2014, place={Bielefeld}, title={„Man kann auch auf die Deutschen
nicht wirken, wenn sie in Schauspielhäusern sitzen.“ Mediale Konstellierungen
von Öffentlichkeit im Zeitalter der Revolutionen}, booktitle={Agenten der Öffentlichkeit.
Theater und Medien im frühen 19. Jahrhundert}, publisher={Aisthesis}, author={Eke,
Norbert Otto}, editor={Wagner, MeikeEditor}, year={2014}, pages={29–59} }'
chicago: 'Eke, Norbert Otto. “„Man kann auch auf die Deutschen nicht wirken, wenn
sie in Schauspielhäusern sitzen.“ Mediale Konstellierungen von Öffentlichkeit
im Zeitalter der Revolutionen.” In Agenten der Öffentlichkeit. Theater und
Medien im frühen 19. Jahrhundert, edited by Meike Wagner, 29–59. Bielefeld:
Aisthesis, 2014.'
ieee: 'N. O. Eke, “„Man kann auch auf die Deutschen nicht wirken, wenn sie in Schauspielhäusern
sitzen.“ Mediale Konstellierungen von Öffentlichkeit im Zeitalter der Revolutionen,”
in Agenten der Öffentlichkeit. Theater und Medien im frühen 19. Jahrhundert,
M. Wagner, Ed. Bielefeld: Aisthesis, 2014, pp. 29–59.'
mla: Eke, Norbert Otto. “„Man kann auch auf die Deutschen nicht wirken, wenn sie
in Schauspielhäusern sitzen.“ Mediale Konstellierungen von Öffentlichkeit im Zeitalter
der Revolutionen.” Agenten der Öffentlichkeit. Theater und Medien im frühen
19. Jahrhundert, edited by Meike Wagner, Aisthesis, 2014, pp. 29–59.
short: 'N.O. Eke, in: M. Wagner (Ed.), Agenten der Öffentlichkeit. Theater und Medien
im frühen 19. Jahrhundert, Aisthesis, Bielefeld, 2014, pp. 29–59.'
date_created: 2020-09-10T09:52:01Z
date_updated: 2022-01-06T06:54:00Z
department:
- _id: '465'
editor:
- first_name: Meike
full_name: Wagner, Meike
last_name: Wagner
language:
- iso: ger
page: 29-59
place: Bielefeld
publication: Agenten der Öffentlichkeit. Theater und Medien im frühen 19. Jahrhundert
publisher: Aisthesis
status: public
title: „Man kann auch auf die Deutschen nicht wirken, wenn sie in Schauspielhäusern
sitzen.“ Mediale Konstellierungen von Öffentlichkeit im Zeitalter der Revolutionen
type: book_chapter
user_id: '14932'
year: '2014'
...
---
_id: '19253'
author:
- first_name: Norbert Otto
full_name: Eke, Norbert Otto
id: '104'
last_name: Eke
citation:
ama: 'Eke NO. „Es gibt keinen Sieger außer Gott“. Dialog im Raum der Schrift: Thomas
Lehrs Roman September. Fata Morgana. In: Dunker A, Hofmann M, eds. Morgenland
und Moderne. Orient-Diskurse in der deutschsprachigen Literatur von 1890 bis zur
Gegenwart. Frankfurt a. M.: Lang; 2014:205-220.'
apa: 'Eke, N. O. (2014). „Es gibt keinen Sieger außer Gott“. Dialog im Raum der
Schrift: Thomas Lehrs Roman September. Fata Morgana. In A. Dunker & M. Hofmann
(Eds.), Morgenland und Moderne. Orient-Diskurse in der deutschsprachigen Literatur
von 1890 bis zur Gegenwart (pp. 205–220). Frankfurt a. M.: Lang.'
bibtex: '@inbook{Eke_2014, place={Frankfurt a. M.}, title={„Es gibt keinen Sieger
außer Gott“. Dialog im Raum der Schrift: Thomas Lehrs Roman September. Fata Morgana},
booktitle={Morgenland und Moderne. Orient-Diskurse in der deutschsprachigen Literatur
von 1890 bis zur Gegenwart}, publisher={Lang}, author={Eke, Norbert Otto}, editor={Dunker,
Axel and Hofmann, MichaelEditors}, year={2014}, pages={205–220} }'
chicago: 'Eke, Norbert Otto. “„Es gibt keinen Sieger außer Gott“. Dialog im Raum
der Schrift: Thomas Lehrs Roman September. Fata Morgana.” In Morgenland und
Moderne. Orient-Diskurse in der deutschsprachigen Literatur von 1890 bis zur Gegenwart,
edited by Axel Dunker and Michael Hofmann, 205–20. Frankfurt a. M.: Lang, 2014.'
ieee: 'N. O. Eke, “„Es gibt keinen Sieger außer Gott“. Dialog im Raum der Schrift:
Thomas Lehrs Roman September. Fata Morgana,” in Morgenland und Moderne. Orient-Diskurse
in der deutschsprachigen Literatur von 1890 bis zur Gegenwart, A. Dunker and
M. Hofmann, Eds. Frankfurt a. M.: Lang, 2014, pp. 205–220.'
mla: 'Eke, Norbert Otto. “„Es gibt keinen Sieger außer Gott“. Dialog im Raum der
Schrift: Thomas Lehrs Roman September. Fata Morgana.” Morgenland und Moderne.
Orient-Diskurse in der deutschsprachigen Literatur von 1890 bis zur Gegenwart,
edited by Axel Dunker and Michael Hofmann, Lang, 2014, pp. 205–20.'
short: 'N.O. Eke, in: A. Dunker, M. Hofmann (Eds.), Morgenland und Moderne. Orient-Diskurse
in der deutschsprachigen Literatur von 1890 bis zur Gegenwart, Lang, Frankfurt
a. M., 2014, pp. 205–220.'
date_created: 2020-09-10T09:55:55Z
date_updated: 2022-01-06T06:54:00Z
department:
- _id: '465'
editor:
- first_name: Axel
full_name: Dunker, Axel
last_name: Dunker
- first_name: Michael
full_name: Hofmann, Michael
last_name: Hofmann
language:
- iso: ger
page: 205-220
place: Frankfurt a. M.
publication: Morgenland und Moderne. Orient-Diskurse in der deutschsprachigen Literatur
von 1890 bis zur Gegenwart
publisher: Lang
status: public
title: '„Es gibt keinen Sieger außer Gott“. Dialog im Raum der Schrift: Thomas Lehrs
Roman September. Fata Morgana'
type: book_chapter
user_id: '14932'
year: '2014'
...
---
_id: '22387'
author:
- first_name: Christian
full_name: Lessmeier, Christian
last_name: Lessmeier
- first_name: Olaf
full_name: Enge-Rosenblatt, Olaf
last_name: Enge-Rosenblatt
- first_name: Christian
full_name: Bayer, Christian
last_name: Bayer
- first_name: Detmar
full_name: Zimmer, Detmar
id: '604'
last_name: Zimmer
citation:
ama: 'Lessmeier C, Enge-Rosenblatt O, Bayer C, Zimmer D. Data Acquisition and Signal
Analysis from Measured Motor Currents for Defect Detection in Electromechanical
Drive Systems. In: European Conference of the PHM Society 2014 (EPHM14).
Prognostics and Health Management Society ; 2014.'
apa: Lessmeier, C., Enge-Rosenblatt, O., Bayer, C., & Zimmer, D. (2014). Data
Acquisition and Signal Analysis from Measured Motor Currents for Defect Detection
in Electromechanical Drive Systems. In European Conference of the PHM Society
2014 (EPHM14). Prognostics and Health Management Society .
bibtex: '@inproceedings{Lessmeier_Enge-Rosenblatt_Bayer_Zimmer_2014, title={Data
Acquisition and Signal Analysis from Measured Motor Currents for Defect Detection
in Electromechanical Drive Systems}, booktitle={European Conference of the PHM
Society 2014 (EPHM14)}, publisher={Prognostics and Health Management Society },
author={Lessmeier, Christian and Enge-Rosenblatt, Olaf and Bayer, Christian and
Zimmer, Detmar}, year={2014} }'
chicago: Lessmeier, Christian, Olaf Enge-Rosenblatt, Christian Bayer, and Detmar
Zimmer. “Data Acquisition and Signal Analysis from Measured Motor Currents for
Defect Detection in Electromechanical Drive Systems.” In European Conference
of the PHM Society 2014 (EPHM14). Prognostics and Health Management Society
, 2014.
ieee: C. Lessmeier, O. Enge-Rosenblatt, C. Bayer, and D. Zimmer, “Data Acquisition
and Signal Analysis from Measured Motor Currents for Defect Detection in Electromechanical
Drive Systems,” in European Conference of the PHM Society 2014 (EPHM14),
2014.
mla: Lessmeier, Christian, et al. “Data Acquisition and Signal Analysis from Measured
Motor Currents for Defect Detection in Electromechanical Drive Systems.” European
Conference of the PHM Society 2014 (EPHM14), Prognostics and Health Management
Society , 2014.
short: 'C. Lessmeier, O. Enge-Rosenblatt, C. Bayer, D. Zimmer, in: European Conference
of the PHM Society 2014 (EPHM14), Prognostics and Health Management Society ,
2014.'
date_created: 2021-06-15T11:09:12Z
date_updated: 2022-01-06T06:55:32Z
department:
- _id: '9'
- _id: '146'
language:
- iso: eng
publication: European Conference of the PHM Society 2014 (EPHM14)
publication_identifier:
isbn:
- 978-1-936263-16-5
publisher: 'Prognostics and Health Management Society '
status: public
title: Data Acquisition and Signal Analysis from Measured Motor Currents for Defect
Detection in Electromechanical Drive Systems
type: conference
user_id: '38077'
year: '2014'
...
---
_id: '22389'
author:
- first_name: Malte
full_name: Strop, Malte
last_name: Strop
- first_name: Christian
full_name: Hölscher, Christian
last_name: Hölscher
- first_name: Detmar
full_name: Zimmer, Detmar
id: '604'
last_name: Zimmer
citation:
ama: 'Strop M, Hölscher C, Zimmer D. Intelligent Operating Strategies for Multi-Motor
Drive Systems. In: OPT-i 2014. 1st International Conference on Engineering
and Applied Sciences Optimization. Vol 1. Institute of Structural Analyses
and Antiseismic Research; 2014:626-663.'
apa: Strop, M., Hölscher, C., & Zimmer, D. (2014). Intelligent Operating Strategies
for Multi-Motor Drive Systems. In OPT-i 2014. 1st International Conference
on Engineering and Applied Sciences Optimization (Vol. 1, pp. 626–663). Institute
of Structural Analyses and Antiseismic Research.
bibtex: '@inproceedings{Strop_Hölscher_Zimmer_2014, title={Intelligent Operating
Strategies for Multi-Motor Drive Systems}, volume={1}, booktitle={OPT-i 2014.
1st International Conference on Engineering and Applied Sciences Optimization},
publisher={Institute of Structural Analyses and Antiseismic Research}, author={Strop,
Malte and Hölscher, Christian and Zimmer, Detmar}, year={2014}, pages={626–663}
}'
chicago: Strop, Malte, Christian Hölscher, and Detmar Zimmer. “Intelligent Operating
Strategies for Multi-Motor Drive Systems.” In OPT-i 2014. 1st International
Conference on Engineering and Applied Sciences Optimization, 1:626–63. Institute
of Structural Analyses and Antiseismic Research, 2014.
ieee: M. Strop, C. Hölscher, and D. Zimmer, “Intelligent Operating Strategies for
Multi-Motor Drive Systems,” in OPT-i 2014. 1st International Conference on
Engineering and Applied Sciences Optimization, 2014, vol. 1, pp. 626–663.
mla: Strop, Malte, et al. “Intelligent Operating Strategies for Multi-Motor Drive
Systems.” OPT-i 2014. 1st International Conference on Engineering and Applied
Sciences Optimization, vol. 1, Institute of Structural Analyses and Antiseismic
Research, 2014, pp. 626–63.
short: 'M. Strop, C. Hölscher, D. Zimmer, in: OPT-i 2014. 1st International Conference
on Engineering and Applied Sciences Optimization, Institute of Structural Analyses
and Antiseismic Research, 2014, pp. 626–663.'
date_created: 2021-06-15T11:09:14Z
date_updated: 2022-01-06T06:55:32Z
department:
- _id: '9'
- _id: '146'
intvolume: ' 1'
language:
- iso: eng
page: 626-663
publication: OPT-i 2014. 1st International Conference on Engineering and Applied Sciences
Optimization
publication_identifier:
isbn:
- 978-960-99994-6-5
publisher: Institute of Structural Analyses and Antiseismic Research
status: public
title: Intelligent Operating Strategies for Multi-Motor Drive Systems
type: conference
user_id: '38077'
volume: 1
year: '2014'
...
---
_id: '452'
abstract:
- lang: eng
text: Today's networks, like the Internet, do not consist of one but a mixture of
several interconnected networks. Each has individual qualities and hence the performance
of a network node results from the networks' interplay.We introduce a new game
theoretic model capturing the interplay between a high-speed backbone network
and a low-speed general purpose network. In our model, n nodes are connected by
a static network and each node can decide individually to become a gateway node.
A gateway node pays a fixed price for its connection to the high-speed network,
but can utilize the high-speed network to gain communication distance 0 to all
other gateways. Communication distances in the low-speed network are given by
the hop distances. The effective communication distance between any two nodes
then is given by the shortest path, which is possibly improved by using gateways
as shortcuts.Every node v has the objective to minimize its communication costs,
given by the sum (SUM-game) or maximum (MAX-game) of the effective communication
distances from v to all other nodes plus a fixed price \alpha > 0, if it decides
to be a gateway. For both games and different ranges of \alpha, we study the existence
of equilibria, the price of anarchy, and convergence properties of best-response
dynamics.
author:
- first_name: Sebastian
full_name: Abshoff, Sebastian
last_name: Abshoff
- first_name: Andreas
full_name: Cord-Landwehr, Andreas
last_name: Cord-Landwehr
- first_name: Daniel
full_name: Jung, Daniel
id: '37827'
last_name: Jung
- first_name: Alexander
full_name: Skopalik, Alexander
id: '40384'
last_name: Skopalik
citation:
ama: 'Abshoff S, Cord-Landwehr A, Jung D, Skopalik A. Brief Announcement: A Model
for Multilevel Network Games. In: Lavi R, ed. Proceedings of the 7th International
Symposium on Algorithmic Game Theory (SAGT). LNCS. ; 2014:294.'
apa: 'Abshoff, S., Cord-Landwehr, A., Jung, D., & Skopalik, A. (2014). Brief
Announcement: A Model for Multilevel Network Games. In R. Lavi (Ed.), Proceedings
of the 7th International Symposium on Algorithmic Game Theory (SAGT) (p. 294).'
bibtex: '@inproceedings{Abshoff_Cord-Landwehr_Jung_Skopalik_2014, series={LNCS},
title={Brief Announcement: A Model for Multilevel Network Games}, booktitle={Proceedings
of the 7th International Symposium on Algorithmic Game Theory (SAGT)}, author={Abshoff,
Sebastian and Cord-Landwehr, Andreas and Jung, Daniel and Skopalik, Alexander},
editor={Lavi, RonEditor}, year={2014}, pages={294}, collection={LNCS} }'
chicago: 'Abshoff, Sebastian, Andreas Cord-Landwehr, Daniel Jung, and Alexander
Skopalik. “Brief Announcement: A Model for Multilevel Network Games.” In Proceedings
of the 7th International Symposium on Algorithmic Game Theory (SAGT), edited
by Ron Lavi, 294. LNCS, 2014.'
ieee: 'S. Abshoff, A. Cord-Landwehr, D. Jung, and A. Skopalik, “Brief Announcement:
A Model for Multilevel Network Games,” in Proceedings of the 7th International
Symposium on Algorithmic Game Theory (SAGT), 2014, p. 294.'
mla: 'Abshoff, Sebastian, et al. “Brief Announcement: A Model for Multilevel Network
Games.” Proceedings of the 7th International Symposium on Algorithmic Game
Theory (SAGT), edited by Ron Lavi, 2014, p. 294.'
short: 'S. Abshoff, A. Cord-Landwehr, D. Jung, A. Skopalik, in: R. Lavi (Ed.), Proceedings
of the 7th International Symposium on Algorithmic Game Theory (SAGT), 2014, p.
294.'
date_created: 2017-10-17T12:42:20Z
date_updated: 2022-01-06T07:01:08Z
ddc:
- '040'
department:
- _id: '63'
- _id: '541'
editor:
- first_name: Ron
full_name: Lavi, Ron
last_name: Lavi
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-16T11:24:40Z
date_updated: 2018-03-16T11:24:40Z
file_id: '1343'
file_name: 452-title_multilevel-sagt.pdf
file_size: 84783
relation: main_file
success: 1
file_date_updated: 2018-03-16T11:24:40Z
has_accepted_license: '1'
language:
- iso: eng
page: '294'
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subproject A1
- _id: '7'
name: SFB 901 - Subproject A3
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 7th International Symposium on Algorithmic Game Theory
(SAGT)
series_title: LNCS
status: public
title: 'Brief Announcement: A Model for Multilevel Network Games'
type: conference
user_id: '15415'
year: '2014'
...
---
_id: '459'
abstract:
- lang: eng
text: In this survey article, we discuss two algorithmic research areas that emerge
from problems that arise when resources are offered in the cloud. The first area,
online leasing, captures problems arising from the fact that resources in the
cloud are not bought, but leased by cloud vendors. The second area, Distributed
Storage Systems, deals with problems arising from so-called cloud federations,
i.e., when several cloud providers are needed to fulfill a given task.
author:
- first_name: Sebastian
full_name: Kniesburges, Sebastian
last_name: Kniesburges
- first_name: Christine
full_name: Markarian, Christine
id: '37612'
last_name: Markarian
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Kniesburges S, Markarian C, Meyer auf der Heide F, Scheideler C. Algorithmic
Aspects of Resource Management in the Cloud. In: Proceedings of the 21st International
Colloquium on Structural Information and Communication Complexity (SIROCCO).
LNCS. ; 2014:1-13. doi:10.1007/978-3-319-09620-9_1'
apa: Kniesburges, S., Markarian, C., Meyer auf der Heide, F., & Scheideler,
C. (2014). Algorithmic Aspects of Resource Management in the Cloud. In Proceedings
of the 21st International Colloquium on Structural Information and Communication
Complexity (SIROCCO) (pp. 1–13). https://doi.org/10.1007/978-3-319-09620-9_1
bibtex: '@inproceedings{Kniesburges_Markarian_Meyer auf der Heide_Scheideler_2014,
series={LNCS}, title={Algorithmic Aspects of Resource Management in the Cloud},
DOI={10.1007/978-3-319-09620-9_1},
booktitle={Proceedings of the 21st International Colloquium on Structural Information
and Communication Complexity (SIROCCO)}, author={Kniesburges, Sebastian and Markarian,
Christine and Meyer auf der Heide, Friedhelm and Scheideler, Christian}, year={2014},
pages={1–13}, collection={LNCS} }'
chicago: Kniesburges, Sebastian, Christine Markarian, Friedhelm Meyer auf der Heide,
and Christian Scheideler. “Algorithmic Aspects of Resource Management in the Cloud.”
In Proceedings of the 21st International Colloquium on Structural Information
and Communication Complexity (SIROCCO), 1–13. LNCS, 2014. https://doi.org/10.1007/978-3-319-09620-9_1.
ieee: S. Kniesburges, C. Markarian, F. Meyer auf der Heide, and C. Scheideler, “Algorithmic
Aspects of Resource Management in the Cloud,” in Proceedings of the 21st International
Colloquium on Structural Information and Communication Complexity (SIROCCO),
2014, pp. 1–13.
mla: Kniesburges, Sebastian, et al. “Algorithmic Aspects of Resource Management
in the Cloud.” Proceedings of the 21st International Colloquium on Structural
Information and Communication Complexity (SIROCCO), 2014, pp. 1–13, doi:10.1007/978-3-319-09620-9_1.
short: 'S. Kniesburges, C. Markarian, F. Meyer auf der Heide, C. Scheideler, in:
Proceedings of the 21st International Colloquium on Structural Information and
Communication Complexity (SIROCCO), 2014, pp. 1–13.'
date_created: 2017-10-17T12:42:21Z
date_updated: 2022-01-06T07:01:14Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
doi: 10.1007/978-3-319-09620-9_1
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-16T11:21:54Z
date_updated: 2018-03-16T11:21:54Z
file_id: '1338'
file_name: 459-SIROCCO2014.pdf
file_size: 274496
relation: main_file
success: 1
file_date_updated: 2018-03-16T11:21:54Z
has_accepted_license: '1'
page: 1-13
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 21st International Colloquium on Structural Information
and Communication Complexity (SIROCCO)
series_title: LNCS
status: public
title: Algorithmic Aspects of Resource Management in the Cloud
type: conference
user_id: '477'
year: '2014'
...
---
_id: '464'
abstract:
- lang: eng
text: Topological self-stabilization is an important concept to build robust open
distributed systems (such as peer-to-peer systems) where nodes can organize themselves
into meaningful network topologies. The goal is to devise distributed algorithms
where nodes forward, insert, and delete links to neighboring nodes, and that converge
quickly to such a desirable topology, independently of the initial network configuration.
This article proposes a new model to study the parallel convergence time. Our
model sheds light on the achievable parallelism by avoiding bottlenecks of existing
models that can yield a distorted picture. As a case study, we consider local
graph linearization—i.e., how to build a sorted list of the nodes of a connected
graph in a distributed and self-stabilizing manner. In order to study the main
structure and properties of our model, we propose two variants of a most simple
local linearization algorithm. For each of these variants, we present analyses
of the worst-case and bestcase parallel time complexities, as well as the performance
under a greedy selection of the actions to be executed. It turns out that the
analysis is non-trivial despite the simple setting, and to complement our formal
insights we report on our experiments which indicate that the runtimes may be
better in the average case.
author:
- first_name: Dominik
full_name: Gall, Dominik
last_name: Gall
- first_name: Riko
full_name: Jacob, Riko
last_name: Jacob
- first_name: Andrea W.
full_name: Richa, Andrea W.
last_name: Richa
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Stefan
full_name: Schmid, Stefan
last_name: Schmid
- first_name: 'Hanjo '
full_name: 'Täubig, Hanjo '
last_name: Täubig
citation:
ama: Gall D, Jacob R, Richa AW, Scheideler C, Schmid S, Täubig H. A Note on the
Parallel Runtime of Self-Stabilizing Graph Linearization. Theory of Computing
Systems. 2014;(1):110-135. doi:10.1007/s00224-013-9504-x
apa: Gall, D., Jacob, R., Richa, A. W., Scheideler, C., Schmid, S., & Täubig,
H. (2014). A Note on the Parallel Runtime of Self-Stabilizing Graph Linearization.
Theory of Computing Systems, (1), 110–135. https://doi.org/10.1007/s00224-013-9504-x
bibtex: '@article{Gall_Jacob_Richa_Scheideler_Schmid_Täubig_2014, title={A Note
on the Parallel Runtime of Self-Stabilizing Graph Linearization}, DOI={10.1007/s00224-013-9504-x},
number={1}, journal={Theory of Computing Systems}, publisher={Springer}, author={Gall,
Dominik and Jacob, Riko and Richa, Andrea W. and Scheideler, Christian and Schmid,
Stefan and Täubig, Hanjo }, year={2014}, pages={110–135} }'
chicago: 'Gall, Dominik, Riko Jacob, Andrea W. Richa, Christian Scheideler, Stefan
Schmid, and Hanjo Täubig. “A Note on the Parallel Runtime of Self-Stabilizing
Graph Linearization.” Theory of Computing Systems, no. 1 (2014): 110–35.
https://doi.org/10.1007/s00224-013-9504-x.'
ieee: D. Gall, R. Jacob, A. W. Richa, C. Scheideler, S. Schmid, and H. Täubig, “A
Note on the Parallel Runtime of Self-Stabilizing Graph Linearization,” Theory
of Computing Systems, no. 1, pp. 110–135, 2014.
mla: Gall, Dominik, et al. “A Note on the Parallel Runtime of Self-Stabilizing Graph
Linearization.” Theory of Computing Systems, no. 1, Springer, 2014, pp.
110–35, doi:10.1007/s00224-013-9504-x.
short: D. Gall, R. Jacob, A.W. Richa, C. Scheideler, S. Schmid, H. Täubig, Theory
of Computing Systems (2014) 110–135.
date_created: 2017-10-17T12:42:22Z
date_updated: 2022-01-06T07:01:16Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1007/s00224-013-9504-x
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-16T11:19:45Z
date_updated: 2018-03-16T11:19:45Z
file_id: '1334'
file_name: 464-GJRSST2014.pdf
file_size: 947484
relation: main_file
success: 1
file_date_updated: 2018-03-16T11:19:45Z
has_accepted_license: '1'
issue: '1'
page: 110-135
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Theory of Computing Systems
publisher: Springer
status: public
title: A Note on the Parallel Runtime of Self-Stabilizing Graph Linearization
type: journal_article
user_id: '477'
year: '2014'
...
---
_id: '760'
author:
- first_name: Sebastien
full_name: Auroux, Sebastien
last_name: Auroux
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: 'Auroux S, Karl H. Flow processing-aware controller placement in wireless DenseNets.
In: 25th IEEE Annual International Symposium on Personal, Indoor, and Mobile
Radio Communication, {PIMRC} 2014, Washington DC, USA, September 2-5, 2014.
; 2014:1294--1299. doi:10.1109/PIMRC.2014.7136368'
apa: Auroux, S., & Karl, H. (2014). Flow processing-aware controller placement
in wireless DenseNets. In 25th IEEE Annual International Symposium on Personal,
Indoor, and Mobile Radio Communication, {PIMRC} 2014, Washington DC, USA, September
2-5, 2014 (pp. 1294--1299). https://doi.org/10.1109/PIMRC.2014.7136368
bibtex: '@inproceedings{Auroux_Karl_2014, title={Flow processing-aware controller
placement in wireless DenseNets}, DOI={10.1109/PIMRC.2014.7136368},
booktitle={25th IEEE Annual International Symposium on Personal, Indoor, and Mobile
Radio Communication, {PIMRC} 2014, Washington DC, USA, September 2-5, 2014}, author={Auroux,
Sebastien and Karl, Holger}, year={2014}, pages={1294--1299} }'
chicago: Auroux, Sebastien, and Holger Karl. “Flow Processing-Aware Controller Placement
in Wireless DenseNets.” In 25th IEEE Annual International Symposium on Personal,
Indoor, and Mobile Radio Communication, {PIMRC} 2014, Washington DC, USA, September
2-5, 2014, 1294--1299, 2014. https://doi.org/10.1109/PIMRC.2014.7136368.
ieee: S. Auroux and H. Karl, “Flow processing-aware controller placement in wireless
DenseNets,” in 25th IEEE Annual International Symposium on Personal, Indoor,
and Mobile Radio Communication, {PIMRC} 2014, Washington DC, USA, September 2-5,
2014, 2014, pp. 1294--1299.
mla: Auroux, Sebastien, and Holger Karl. “Flow Processing-Aware Controller Placement
in Wireless DenseNets.” 25th IEEE Annual International Symposium on Personal,
Indoor, and Mobile Radio Communication, {PIMRC} 2014, Washington DC, USA, September
2-5, 2014, 2014, pp. 1294--1299, doi:10.1109/PIMRC.2014.7136368.
short: 'S. Auroux, H. Karl, in: 25th IEEE Annual International Symposium on Personal,
Indoor, and Mobile Radio Communication, {PIMRC} 2014, Washington DC, USA, September
2-5, 2014, 2014, pp. 1294--1299.'
date_created: 2017-11-27T10:22:25Z
date_updated: 2022-01-06T07:03:40Z
department:
- _id: '75'
doi: 10.1109/PIMRC.2014.7136368
ec_funded: '1'
page: 1294--1299
project:
- _id: '22'
call_identifier: FP7-ICT-2011-C
grant_number: '318115'
name: Connectivity management for eneRgy Optimised Wireless Dense works
publication: 25th IEEE Annual International Symposium on Personal, Indoor, and Mobile
Radio Communication, {PIMRC} 2014, Washington DC, USA, September 2-5, 2014
status: public
title: Flow processing-aware controller placement in wireless DenseNets
type: conference
user_id: '15572'
year: '2014'
...
---
_id: '9879'
abstract:
- lang: eng
text: Application of prognostics and health management (PHM) in the field of Proton
Exchange Membrane (PEM) fuel cells is emerging as an important tool in increasing
the reliability and availability of these systems. Though a lot of work is currently
being conducted to develop PHM systems for fuel cells, various challenges have
been encountered including the self-healing effect after characterization as well
as accelerated degradation due to dynamic loading, all which make RUL predictions
a difficult task. In this study, a prognostic approach based on adaptive particle
filter algorithm is proposed. The novelty of the proposed method lies in the introduction
of a self-healing factor after each characterization and the adaption of the degradation
model parameters to fit to the changing degradation trend. An ensemble of five
different state models based on weighted mean is then developed. The results show
that the method is effective in estimating the remaining useful life of PEM fuel
cells, with majority of the predictions falling within 5\% error. The method was
employed in the IEEE 2014 PHM Data Challenge and led to our team emerging the
winner of the RUL category of the challenge.
author:
- first_name: 'James Kuria '
full_name: 'Kimotho, James Kuria '
last_name: Kimotho
- first_name: Tobias
full_name: Meyer, Tobias
last_name: Meyer
- first_name: Walter
full_name: Sextro, Walter
id: '21220'
last_name: Sextro
citation:
ama: 'Kimotho JK, Meyer T, Sextro W. PEM fuel cell prognostics using particle filter
with model parameter adaptation. In: Prognostics and Health Management (PHM),
2014 IEEE Conference On. ; 2014:1-6. doi:10.1109/ICPHM.2014.7036406'
apa: Kimotho, J. K., Meyer, T., & Sextro, W. (2014). PEM fuel cell prognostics
using particle filter with model parameter adaptation. In Prognostics and Health
Management (PHM), 2014 IEEE Conference on (pp. 1–6). https://doi.org/10.1109/ICPHM.2014.7036406
bibtex: '@inproceedings{Kimotho_Meyer_Sextro_2014, title={PEM fuel cell prognostics
using particle filter with model parameter adaptation}, DOI={10.1109/ICPHM.2014.7036406},
booktitle={Prognostics and Health Management (PHM), 2014 IEEE Conference on},
author={Kimotho, James Kuria and Meyer, Tobias and Sextro, Walter}, year={2014},
pages={1–6} }'
chicago: Kimotho, James Kuria , Tobias Meyer, and Walter Sextro. “PEM Fuel Cell
Prognostics Using Particle Filter with Model Parameter Adaptation.” In Prognostics
and Health Management (PHM), 2014 IEEE Conference On, 1–6, 2014. https://doi.org/10.1109/ICPHM.2014.7036406.
ieee: J. K. Kimotho, T. Meyer, and W. Sextro, “PEM fuel cell prognostics using particle
filter with model parameter adaptation,” in Prognostics and Health Management
(PHM), 2014 IEEE Conference on, 2014, pp. 1–6.
mla: Kimotho, James Kuria, et al. “PEM Fuel Cell Prognostics Using Particle Filter
with Model Parameter Adaptation.” Prognostics and Health Management (PHM),
2014 IEEE Conference On, 2014, pp. 1–6, doi:10.1109/ICPHM.2014.7036406.
short: 'J.K. Kimotho, T. Meyer, W. Sextro, in: Prognostics and Health Management
(PHM), 2014 IEEE Conference On, 2014, pp. 1–6.'
date_created: 2019-05-20T13:11:02Z
date_updated: 2019-05-20T13:12:27Z
department:
- _id: '151'
doi: 10.1109/ICPHM.2014.7036406
keyword:
- ageing
- particle filtering (numerical methods)
- proton exchange membrane fuel cells
- remaining life assessment
- PEM fuel cell prognostics
- PHM
- RUL predictions
- accelerated degradation
- adaptive particle filter algorithm
- dynamic loading
- model parameter adaptation
- prognostics and health management
- proton exchange membrane fuel cells
- remaining useful life estimation
- self-healing effect
- Adaptation models
- Data models
- Degradation
- Estimation
- Fuel cells
- Mathematical model
- Prognostics and health management
language:
- iso: eng
page: 1-6
publication: Prognostics and Health Management (PHM), 2014 IEEE Conference on
status: public
title: PEM fuel cell prognostics using particle filter with model parameter adaptation
type: conference
user_id: '55222'
year: '2014'
...
---
_id: '393'
abstract:
- lang: eng
text: 'A fundamental problem for peer-to-peer systems is to maintain connectivity
while nodes are leaving, i.e., the nodes requesting to leave the peer-to-peer
system are excluded from the overlay network without affecting its connectivity.
There are a number of studies for safe node exclusion if the overlay is in a well-defined
state initially. Surprisingly, the problem is not formally studied yet for the
case in which the overlay network is in an arbitrary initial state, i.e., when
looking for a self-stabilizing solution for excluding leaving nodes. We study
this problem in two variants: the Finite Departure Problem (FDP) ) and the Finite
Sleep Problem (FSP). In the FDP the leaving nodes have to irrevocably decide when
it is safe to leave the network, whereas in the FSP, this leaving decision does
not have to be final: the nodes may resume computation if necessary. We show that
there is no self-stabilizing distributed algorithm for the FDP, even in a synchronous
message passing model. To allow a solution, we introduce an oracle called NIDEC
and show that it is sufficient even for the asynchronous message passing model
by proposing an algorithm that can solve the FDP using NIDEC. We also show that
a solution to the FSP does not require an oracle.'
author:
- first_name: Dianne
full_name: Foreback, Dianne
last_name: Foreback
- first_name: Andreas
full_name: Koutsopoulos, Andreas
last_name: Koutsopoulos
- first_name: Mikhail
full_name: Nesterenko, Mikhail
last_name: Nesterenko
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Thim Frederik
full_name: Strothmann, Thim Frederik
id: '11319'
last_name: Strothmann
citation:
ama: 'Foreback D, Koutsopoulos A, Nesterenko M, Scheideler C, Strothmann TF. On
Stabilizing Departures in Overlay Networks. In: Proceedings of the 16th International
Symposium on Stabilization, Safety, and Security of Distributed Systems. LNCS.
; 2014:48--62. doi:10.1007/978-3-319-11764-5_4'
apa: Foreback, D., Koutsopoulos, A., Nesterenko, M., Scheideler, C., & Strothmann,
T. F. (2014). On Stabilizing Departures in Overlay Networks. In Proceedings
of the 16th International Symposium on Stabilization, Safety, and Security of
Distributed Systems (pp. 48--62). https://doi.org/10.1007/978-3-319-11764-5_4
bibtex: '@inproceedings{Foreback_Koutsopoulos_Nesterenko_Scheideler_Strothmann_2014,
series={LNCS}, title={On Stabilizing Departures in Overlay Networks}, DOI={10.1007/978-3-319-11764-5_4},
booktitle={Proceedings of the 16th International Symposium on Stabilization, Safety,
and Security of Distributed Systems}, author={Foreback, Dianne and Koutsopoulos,
Andreas and Nesterenko, Mikhail and Scheideler, Christian and Strothmann, Thim
Frederik}, year={2014}, pages={48--62}, collection={LNCS} }'
chicago: Foreback, Dianne, Andreas Koutsopoulos, Mikhail Nesterenko, Christian Scheideler,
and Thim Frederik Strothmann. “On Stabilizing Departures in Overlay Networks.”
In Proceedings of the 16th International Symposium on Stabilization, Safety,
and Security of Distributed Systems, 48--62. LNCS, 2014. https://doi.org/10.1007/978-3-319-11764-5_4.
ieee: D. Foreback, A. Koutsopoulos, M. Nesterenko, C. Scheideler, and T. F. Strothmann,
“On Stabilizing Departures in Overlay Networks,” in Proceedings of the 16th
International Symposium on Stabilization, Safety, and Security of Distributed
Systems, 2014, pp. 48--62.
mla: Foreback, Dianne, et al. “On Stabilizing Departures in Overlay Networks.” Proceedings
of the 16th International Symposium on Stabilization, Safety, and Security of
Distributed Systems, 2014, pp. 48--62, doi:10.1007/978-3-319-11764-5_4.
short: 'D. Foreback, A. Koutsopoulos, M. Nesterenko, C. Scheideler, T.F. Strothmann,
in: Proceedings of the 16th International Symposium on Stabilization, Safety,
and Security of Distributed Systems, 2014, pp. 48--62.'
date_created: 2017-10-17T12:42:08Z
date_updated: 2022-01-06T06:59:56Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1007/978-3-319-11764-5_4
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:00:28Z
date_updated: 2018-03-20T07:00:28Z
file_id: '1384'
file_name: 393-departures.pdf
file_size: 287539
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:00:28Z
has_accepted_license: '1'
language:
- iso: eng
page: 48--62
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 16th International Symposium on Stabilization, Safety,
and Security of Distributed Systems
series_title: LNCS
status: public
title: On Stabilizing Departures in Overlay Networks
type: conference
user_id: '477'
year: '2014'
...
---
_id: '395'
abstract:
- lang: eng
text: We consider a multilevel network game, where nodes can improvetheir communication
costs by connecting to a high-speed network.The n nodes are connected by a static
network and each node can decideindividually to become a gateway to the high-speed
network. The goalof a node v is to minimize its private costs, i.e., the sum (SUM-game)
ormaximum (MAX-game) of communication distances from v to all othernodes plus
a fixed price α > 0 if it decides to be a gateway. Between gatewaysthe communication
distance is 0, and gateways also improve othernodes’ distances by behaving as
shortcuts. For the SUM-game, we showthat for α ≤ n − 1, the price of anarchy is
Θ (n/√α) and in this rangeequilibria always exist. In range α ∈ (n−1, n(n−1))
the price of anarchyis Θ(√α), and for α ≥ n(n − 1) it is constant. For the MAX-game,
weshow that the price of anarchy is either Θ (1 + n/√α), for α ≥ 1, orelse 1.
Given a graph with girth of at least 4α, equilibria always exist.Concerning the
dynamics, both games are not potential games. For theSUM-game, we even show that
it is not weakly acyclic.
author:
- first_name: Sebastian
full_name: Abshoff, Sebastian
last_name: Abshoff
- first_name: Andreas
full_name: Cord-Landwehr, Andreas
last_name: Cord-Landwehr
- first_name: Daniel
full_name: Jung, Daniel
id: '37827'
last_name: Jung
- first_name: Alexander
full_name: Skopalik, Alexander
id: '40384'
last_name: Skopalik
citation:
ama: 'Abshoff S, Cord-Landwehr A, Jung D, Skopalik A. Multilevel Network Games.
In: Proceedings of the 10th International Conference on Web and Internet Economics
(WINE). LNCS. ; 2014:435-440. doi:10.1007/978-3-319-13129-0_36'
apa: Abshoff, S., Cord-Landwehr, A., Jung, D., & Skopalik, A. (2014). Multilevel
Network Games. In Proceedings of the 10th International Conference on Web and
Internet Economics (WINE) (pp. 435–440). https://doi.org/10.1007/978-3-319-13129-0_36
bibtex: '@inproceedings{Abshoff_Cord-Landwehr_Jung_Skopalik_2014, series={LNCS},
title={Multilevel Network Games}, DOI={10.1007/978-3-319-13129-0_36},
booktitle={Proceedings of the 10th International Conference on Web and Internet
Economics (WINE)}, author={Abshoff, Sebastian and Cord-Landwehr, Andreas and Jung,
Daniel and Skopalik, Alexander}, year={2014}, pages={435–440}, collection={LNCS}
}'
chicago: Abshoff, Sebastian, Andreas Cord-Landwehr, Daniel Jung, and Alexander Skopalik.
“Multilevel Network Games.” In Proceedings of the 10th International Conference
on Web and Internet Economics (WINE), 435–40. LNCS, 2014. https://doi.org/10.1007/978-3-319-13129-0_36.
ieee: S. Abshoff, A. Cord-Landwehr, D. Jung, and A. Skopalik, “Multilevel Network
Games,” in Proceedings of the 10th International Conference on Web and Internet
Economics (WINE), 2014, pp. 435–440.
mla: Abshoff, Sebastian, et al. “Multilevel Network Games.” Proceedings of the
10th International Conference on Web and Internet Economics (WINE), 2014,
pp. 435–40, doi:10.1007/978-3-319-13129-0_36.
short: 'S. Abshoff, A. Cord-Landwehr, D. Jung, A. Skopalik, in: Proceedings of the
10th International Conference on Web and Internet Economics (WINE), 2014, pp.
435–440.'
date_created: 2017-10-17T12:42:09Z
date_updated: 2022-01-06T06:59:59Z
ddc:
- '040'
department:
- _id: '63'
- _id: '541'
doi: 10.1007/978-3-319-13129-0_36
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T06:59:20Z
date_updated: 2018-03-20T06:59:20Z
file_id: '1382'
file_name: 395-WINE2014ACJS.pdf
file_size: 161479
relation: main_file
success: 1
file_date_updated: 2018-03-20T06:59:20Z
has_accepted_license: '1'
language:
- iso: eng
page: 435-440
project:
- _id: '1'
name: SFB 901
- _id: '7'
name: SFB 901 - Subprojekt A3
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 10th International Conference on Web and Internet
Economics (WINE)
series_title: LNCS
status: public
title: Multilevel Network Games
type: conference
user_id: '15415'
year: '2014'
...
---
_id: '397'
abstract:
- lang: eng
text: We present a factor $14D^2$ approximation algorithm for the minimum linear
arrangement problem on series-parallel graphs, where $D$ is the maximum degree
in the graph. Given a suitable decomposition of the graph, our algorithm runs
in time $O(|E|)$ and is very easy to implement. Its divide-and-conquer approach
allows for an effective parallelization. Note that a suitable decomposition can
also be computed in time $O(|E|\log{|E|})$ (or even $O(\log{|E|}\log^*{|E|})$
on an EREW PRAM using $O(|E|)$ processors). For the proof of the approximation
ratio, we use a sophisticated charging method that uses techniques similar to
amortized analysis in advanced data structures. On general graphs, the minimum
linear arrangement problem is known to be NP-hard. To the best of our knowledge,
the minimum linear arrangement problem on series-parallel graphs has not been
studied before.
author:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Martina
full_name: Eikel, Martina
last_name: Eikel
- first_name: Alexander
full_name: Setzer, Alexander
id: '11108'
last_name: Setzer
citation:
ama: 'Scheideler C, Eikel M, Setzer A. Minimum Linear Arrangement of Series-Parallel
Graphs. In: Proceedings of the 12th Workshop on Approximation and Online Algorithms
(WAOA). LNCS. ; 2014:168--180.'
apa: Scheideler, C., Eikel, M., & Setzer, A. (2014). Minimum Linear Arrangement
of Series-Parallel Graphs. In Proceedings of the 12th Workshop on Approximation
and Online Algorithms (WAOA) (pp. 168--180).
bibtex: '@inproceedings{Scheideler_Eikel_Setzer_2014, series={LNCS}, title={Minimum
Linear Arrangement of Series-Parallel Graphs}, booktitle={Proceedings of the 12th
Workshop on Approximation and Online Algorithms (WAOA)}, author={Scheideler, Christian
and Eikel, Martina and Setzer, Alexander}, year={2014}, pages={168--180}, collection={LNCS}
}'
chicago: Scheideler, Christian, Martina Eikel, and Alexander Setzer. “Minimum Linear
Arrangement of Series-Parallel Graphs.” In Proceedings of the 12th Workshop
on Approximation and Online Algorithms (WAOA), 168--180. LNCS, 2014.
ieee: C. Scheideler, M. Eikel, and A. Setzer, “Minimum Linear Arrangement of Series-Parallel
Graphs,” in Proceedings of the 12th Workshop on Approximation and Online Algorithms
(WAOA), 2014, pp. 168--180.
mla: Scheideler, Christian, et al. “Minimum Linear Arrangement of Series-Parallel
Graphs.” Proceedings of the 12th Workshop on Approximation and Online Algorithms
(WAOA), 2014, pp. 168--180.
short: 'C. Scheideler, M. Eikel, A. Setzer, in: Proceedings of the 12th Workshop
on Approximation and Online Algorithms (WAOA), 2014, pp. 168--180.'
date_created: 2017-10-17T12:42:09Z
date_updated: 2022-01-06T07:00:02Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T06:58:44Z
date_updated: 2018-03-20T06:58:44Z
file_id: '1381'
file_name: 397-WAOA14_01.pdf
file_size: 365818
relation: main_file
success: 1
file_date_updated: 2018-03-20T06:58:44Z
has_accepted_license: '1'
page: 168--180
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 12th Workshop on Approximation and Online Algorithms
(WAOA)
series_title: LNCS
status: public
title: Minimum Linear Arrangement of Series-Parallel Graphs
type: conference
user_id: '15504'
year: '2014'
...
---
_id: '412'
abstract:
- lang: eng
text: In this paper we present and analyze HSkip+, a self-stabilizing overlay network
for nodes with arbitrary heterogeneous bandwidths. HSkip+ has the same topology
as the Skip+ graph proposed by Jacob et al. [PODC 2009] but its self-stabilization
mechanism significantly outperforms the self-stabilization mechanism proposed
for Skip+. Also, the nodes are now ordered according to their bandwidths and not
according to their identifiers. Various other solutions have already been proposed
for overlay networks with heterogeneous bandwidths, but they are not self-stabilizing.
In addition to HSkip+ being self-stabilizing, its performance is on par with the
best previous bounds on the time and work for joining or leaving a network of
peers of logarithmic diameter and degree and arbitrary bandwidths. Also, the dilation
and congestion for routing messages is on par with the best previous bounds for
such networks, so that HSkip+ combines the advantages of both worlds. Our theoretical
investigations are backed by simulations demonstrating that HSkip+ is indeed performing
much better than Skip+ and working correctly under high churn rates.
author:
- first_name: Matthias
full_name: Feldotto, Matthias
id: '14052'
last_name: Feldotto
orcid: 0000-0003-1348-6516
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Kalman
full_name: Graffi, Kalman
last_name: Graffi
citation:
ama: 'Feldotto M, Scheideler C, Graffi K. HSkip+: A Self-Stabilizing Overlay Network
for Nodes with Heterogeneous Bandwidths. In: Proceedings of the 14th IEEE International
Conference on Peer-to-Peer Computing (P2P). ; 2014:1-10. doi:10.1109/P2P.2014.6934300'
apa: 'Feldotto, M., Scheideler, C., & Graffi, K. (2014). HSkip+: A Self-Stabilizing
Overlay Network for Nodes with Heterogeneous Bandwidths. In Proceedings of
the 14th IEEE International Conference on Peer-to-Peer Computing (P2P) (pp.
1–10). https://doi.org/10.1109/P2P.2014.6934300'
bibtex: '@inproceedings{Feldotto_Scheideler_Graffi_2014, title={HSkip+: A Self-Stabilizing
Overlay Network for Nodes with Heterogeneous Bandwidths}, DOI={10.1109/P2P.2014.6934300},
booktitle={Proceedings of the 14th IEEE International Conference on Peer-to-Peer
Computing (P2P)}, author={Feldotto, Matthias and Scheideler, Christian and Graffi,
Kalman}, year={2014}, pages={1–10} }'
chicago: 'Feldotto, Matthias, Christian Scheideler, and Kalman Graffi. “HSkip+:
A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths.” In
Proceedings of the 14th IEEE International Conference on Peer-to-Peer Computing
(P2P), 1–10, 2014. https://doi.org/10.1109/P2P.2014.6934300.'
ieee: 'M. Feldotto, C. Scheideler, and K. Graffi, “HSkip+: A Self-Stabilizing Overlay
Network for Nodes with Heterogeneous Bandwidths,” in Proceedings of the 14th
IEEE International Conference on Peer-to-Peer Computing (P2P), 2014, pp. 1–10.'
mla: 'Feldotto, Matthias, et al. “HSkip+: A Self-Stabilizing Overlay Network for
Nodes with Heterogeneous Bandwidths.” Proceedings of the 14th IEEE International
Conference on Peer-to-Peer Computing (P2P), 2014, pp. 1–10, doi:10.1109/P2P.2014.6934300.'
short: 'M. Feldotto, C. Scheideler, K. Graffi, in: Proceedings of the 14th IEEE
International Conference on Peer-to-Peer Computing (P2P), 2014, pp. 1–10.'
date_created: 2017-10-17T12:42:12Z
date_updated: 2022-01-06T07:00:20Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
- _id: '541'
doi: 10.1109/P2P.2014.6934300
external_id:
arxiv:
- '1408.0395'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-16T11:34:00Z
date_updated: 2018-03-16T11:34:00Z
file_id: '1361'
file_name: 412-FSG2014P2P.pdf
file_size: 472321
relation: main_file
success: 1
file_date_updated: 2018-03-16T11:34:00Z
has_accepted_license: '1'
page: 1-10
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
publication: Proceedings of the 14th IEEE International Conference on Peer-to-Peer
Computing (P2P)
status: public
title: 'HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths'
type: conference
user_id: '14052'
year: '2014'
...
---
_id: '431'
abstract:
- lang: eng
text: In meiner Dissertation besch{\"a}ftige ich mich mit dem Entwurf und der Analyse
energieeffizienter Schedulingalgorithmen, insbesondere f{\"u}r sogenannte Speed-Scaling
Modelle. Diese stellen das theoretische Pendant von Techniken wie AMDs PowerNOW!
und Intels SpeedStep dar, welche es erlauben die Geschwindigkeit von Prozessoren
zur Laufzeit an die derzeitigen Bedingungen anzupassen. Theoretische Untersuchungen
solcher Modelle sind auf eine Arbeit von Yao, Demers und Shenker (FOCS'95) zur{\"u}ckzuf{\"u}hren.
Hier kombinieren die Autoren klassisches Deadline-Scheduling mit einem Prozessor
der Speed-Scaling beherrscht. Es gilt Jobs verschiedener Gr{\"o}ße fristgerecht
abzuarbeiten und die dabei verwendete Energie zu minimieren. Der Energieverbrauch
des Prozessors wird durch eine konvexe Funktion $\POW\colon\R_{\geq0}\to\R_{\geq0}$
modelliert, welche die Geschwindigkeit auf den Energieverbrauch abbildet.Meine
Dissertation betrachtet verschiedene Varianten des urspr{\"u}nglichen Speed-Scaling
Modells. Forschungsrelevante Ergebnisse sind in den Kapiteln 3 bis 6 zu finden
und erstrecken sich {\"u}ber die im Folgenden beschriebenen Aspekte:- Kapitel
3 und 4 betrachten verschiedene \emph{Price-Collecting} Varianten des Originalproblems.
Hier d{\"u}rfen einzelne Deadlines verfehlt werden, sofern eine jobabh{\"a}ngige
Strafe gezahlt wird. Ich entwerfe insbesondere Online-Algorithmen mit einer beweisbar
guten Competitiveness. Dabei liefern meine Ergebnisse substantielle Verbesserungen
bestehender Arbeiten und erweitern diese unter Anderem auf Szenarien mit mehreren
Prozessoren.- In Kapitel 5 wird statt des klassischen Deadline-Schedulings eine
Linearkombination der durchschnittlichen Antwortzeit und des Energieverbrauchs
betrachtet. Die Frage, ob dieses Problem NP-schwer ist, stellt eine der zentralen
Forschungsfragen in diesem Gebiet dar. F{\"u}r eine relaxierte Form dieser Frage
entwerfe ich einen effizienter Algorithmus und beweise seine Optimalit{\"a}t.-
Das letzte Kapitel betrachtet ein Modell, welches – auf den ersten Blick – nicht
direkt zur Speed-Scaling Literatur z{\"a}hlt. Hier geht es stattdessen um ein
allgemeines Resource-Constrained Scheduling, in dem sich die Prozessoren zusammen
eine gemeinsame, beliebig aufteilbare Ressource teilen. Ich untersuche die Komplexit{\"a}t
des Problems und entwerfe verschiedene Approximationsalgorithmen.
author:
- first_name: Peter
full_name: Kling, Peter
last_name: Kling
citation:
ama: Kling P. Energy-Efficient Scheduling Algorithms. Universität Paderborn;
2014.
apa: Kling, P. (2014). Energy-efficient Scheduling Algorithms. Universität
Paderborn.
bibtex: '@book{Kling_2014, title={Energy-efficient Scheduling Algorithms}, publisher={Universität
Paderborn}, author={Kling, Peter}, year={2014} }'
chicago: Kling, Peter. Energy-Efficient Scheduling Algorithms. Universität
Paderborn, 2014.
ieee: P. Kling, Energy-efficient Scheduling Algorithms. Universität Paderborn,
2014.
mla: Kling, Peter. Energy-Efficient Scheduling Algorithms. Universität Paderborn,
2014.
short: P. Kling, Energy-Efficient Scheduling Algorithms, Universität Paderborn,
2014.
date_created: 2017-10-17T12:42:15Z
date_updated: 2022-01-06T07:00:52Z
ddc:
- '040'
department:
- _id: '63'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-16T11:31:29Z
date_updated: 2018-03-16T11:31:29Z
file_id: '1356'
file_name: 431-Peter_Kling_PhDThesis_01.pdf
file_size: 792106
relation: main_file
success: 1
file_date_updated: 2018-03-16T11:31:29Z
has_accepted_license: '1'
project:
- _id: '1'
name: SFB 901
- _id: '14'
name: SFB 901 - Subprojekt C2
- _id: '4'
name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
title: Energy-efficient Scheduling Algorithms
type: dissertation
user_id: '477'
year: '2014'
...
---
_id: '434'
author:
- first_name: Linghui
full_name: Luo, Linghui
last_name: Luo
citation:
ama: Luo L. Ein selbst-stabilisierender Algorithmus für das Finite Sleep Problem
in Skip+ Graphen. Universität Paderborn; 2014.
apa: Luo, L. (2014). Ein selbst-stabilisierender Algorithmus für das Finite Sleep
Problem in Skip+ Graphen. Universität Paderborn.
bibtex: '@book{Luo_2014, title={Ein selbst-stabilisierender Algorithmus für das
Finite Sleep Problem in Skip+ Graphen}, publisher={Universität Paderborn}, author={Luo,
Linghui}, year={2014} }'
chicago: Luo, Linghui. Ein selbst-stabilisierender Algorithmus für das Finite
Sleep Problem in Skip+ Graphen. Universität Paderborn, 2014.
ieee: L. Luo, Ein selbst-stabilisierender Algorithmus für das Finite Sleep Problem
in Skip+ Graphen. Universität Paderborn, 2014.
mla: Luo, Linghui. Ein selbst-stabilisierender Algorithmus für das Finite Sleep
Problem in Skip+ Graphen. Universität Paderborn, 2014.
short: L. Luo, Ein selbst-stabilisierender Algorithmus für das Finite Sleep Problem
in Skip+ Graphen, Universität Paderborn, 2014.
date_created: 2017-10-17T12:42:16Z
date_updated: 2022-01-06T07:00:57Z
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
title: Ein selbst-stabilisierender Algorithmus für das Finite Sleep Problem in Skip+
Graphen
type: bachelorsthesis
user_id: '477'
year: '2014'
...
---
_id: '16870'
citation:
ama: 'Flocchini P, Gao J, Kranakis E, Meyer auf der Heide F, eds. Algorithms
for Sensor Systems - 9th International Symposium on Algorithms and Experiments
for Sensor Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS}
2013. Vol 8243. Berlin, Heidelberg: Springer; 2014. doi:10.1007/978-3-642-45346-5'
apa: 'Flocchini, P., Gao, J., Kranakis, E., & Meyer auf der Heide, F. (Eds.).
(2014). Algorithms for Sensor Systems - 9th International Symposium on Algorithms
and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics,
{ALGOSENSORS} 2013 (Vol. 8243). Berlin, Heidelberg: Springer. https://doi.org/10.1007/978-3-642-45346-5'
bibtex: '@book{Flocchini_Gao_Kranakis_Meyer auf der Heide_2014, place={Berlin, Heidelberg},
series={Lecture Notes in Computer Science}, title={Algorithms for Sensor Systems
- 9th International Symposium on Algorithms and Experiments for Sensor Systems,
Wireless Networks and Distributed Robotics, {ALGOSENSORS} 2013}, volume={8243},
DOI={10.1007/978-3-642-45346-5},
publisher={Springer}, year={2014}, collection={Lecture Notes in Computer Science}
}'
chicago: 'Flocchini, Paola, Jie Gao, Evangelos Kranakis, and Friedhelm Meyer auf
der Heide, eds. Algorithms for Sensor Systems - 9th International Symposium
on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed
Robotics, {ALGOSENSORS} 2013. Vol. 8243. Lecture Notes in Computer Science.
Berlin, Heidelberg: Springer, 2014. https://doi.org/10.1007/978-3-642-45346-5.'
ieee: 'P. Flocchini, J. Gao, E. Kranakis, and F. Meyer auf der Heide, Eds., Algorithms
for Sensor Systems - 9th International Symposium on Algorithms and Experiments
for Sensor Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS}
2013, vol. 8243. Berlin, Heidelberg: Springer, 2014.'
mla: Flocchini, Paola, et al., editors. Algorithms for Sensor Systems - 9th International
Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks
and Distributed Robotics, {ALGOSENSORS} 2013. Vol. 8243, Springer, 2014, doi:10.1007/978-3-642-45346-5.
short: P. Flocchini, J. Gao, E. Kranakis, F. Meyer auf der Heide, eds., Algorithms
for Sensor Systems - 9th International Symposium on Algorithms and Experiments
for Sensor Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS}
2013, Springer, Berlin, Heidelberg, 2014.
date_created: 2020-04-27T10:31:57Z
date_updated: 2022-01-06T06:52:58Z
department:
- _id: '63'
doi: 10.1007/978-3-642-45346-5
editor:
- first_name: Paola
full_name: Flocchini, Paola
last_name: Flocchini
- first_name: Jie
full_name: Gao, Jie
last_name: Gao
- first_name: Evangelos
full_name: Kranakis, Evangelos
last_name: Kranakis
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
intvolume: ' 8243'
language:
- iso: eng
place: Berlin, Heidelberg
publication_identifier:
isbn:
- '9783642453458'
- '9783642453465'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: Algorithms for Sensor Systems - 9th International Symposium on Algorithms and
Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS}
2013
type: book_editor
user_id: '15415'
volume: 8243
year: '2014'
...
---
_id: '11867'
abstract:
- lang: eng
text: 'New waves of consumer-centric applications, such as voice search and voice
interaction with mobile devices and home entertainment systems, increasingly require
automatic speech recognition (ASR) to be robust to the full range of real-world
noise and other acoustic distorting conditions. Despite its practical importance,
however, the inherent links between and distinctions among the myriad of methods
for noise-robust ASR have yet to be carefully studied in order to advance the
field further. To this end, it is critical to establish a solid, consistent, and
common mathematical foundation for noise-robust ASR, which is lacking at present.
This article is intended to fill this gap and to provide a thorough overview of
modern noise-robust techniques for ASR developed over the past 30 years. We emphasize
methods that are proven to be successful and that are likely to sustain or expand
their future applicability. We distill key insights from our comprehensive overview
in this field and take a fresh look at a few old problems, which nevertheless
are still highly relevant today. Specifically, we have analyzed and categorized
a wide range of noise-robust techniques using five different criteria: 1) feature-domain
vs. model-domain processing, 2) the use of prior knowledge about the acoustic
environment distortion, 3) the use of explicit environment-distortion models,
4) deterministic vs. uncertainty processing, and 5) the use of acoustic models
trained jointly with the same feature enhancement or model adaptation process
used in the testing stage. With this taxonomy-oriented review, we equip the reader
with the insight to choose among techniques and with the awareness of the performance-complexity
tradeoffs. The pros and cons of using different noise-robust ASR techniques in
practical application scenarios are provided as a guide to interested practitioners.
The current challenges and future research directions in this field is also carefully
analyzed.'
author:
- first_name: Jinyu
full_name: Li, Jinyu
last_name: Li
- first_name: Li
full_name: Deng, Li
last_name: Deng
- first_name: Yifan
full_name: Gong, Yifan
last_name: Gong
- first_name: Reinhold
full_name: Haeb-Umbach, Reinhold
id: '242'
last_name: Haeb-Umbach
citation:
ama: Li J, Deng L, Gong Y, Haeb-Umbach R. An Overview of Noise-Robust Automatic
Speech Recognition. IEEE Transactions on Audio, Speech and Language Processing.
2014;22(4):745-777. doi:10.1109/TASLP.2014.2304637
apa: Li, J., Deng, L., Gong, Y., & Haeb-Umbach, R. (2014). An Overview of Noise-Robust
Automatic Speech Recognition. IEEE Transactions on Audio, Speech and Language
Processing, 22(4), 745–777. https://doi.org/10.1109/TASLP.2014.2304637
bibtex: '@article{Li_Deng_Gong_Haeb-Umbach_2014, title={An Overview of Noise-Robust
Automatic Speech Recognition}, volume={22}, DOI={10.1109/TASLP.2014.2304637},
number={4}, journal={IEEE Transactions on Audio, Speech and Language Processing},
author={Li, Jinyu and Deng, Li and Gong, Yifan and Haeb-Umbach, Reinhold}, year={2014},
pages={745–777} }'
chicago: 'Li, Jinyu, Li Deng, Yifan Gong, and Reinhold Haeb-Umbach. “An Overview
of Noise-Robust Automatic Speech Recognition.” IEEE Transactions on Audio,
Speech and Language Processing 22, no. 4 (2014): 745–77. https://doi.org/10.1109/TASLP.2014.2304637.'
ieee: J. Li, L. Deng, Y. Gong, and R. Haeb-Umbach, “An Overview of Noise-Robust
Automatic Speech Recognition,” IEEE Transactions on Audio, Speech and Language
Processing, vol. 22, no. 4, pp. 745–777, 2014.
mla: Li, Jinyu, et al. “An Overview of Noise-Robust Automatic Speech Recognition.”
IEEE Transactions on Audio, Speech and Language Processing, vol. 22, no.
4, 2014, pp. 745–77, doi:10.1109/TASLP.2014.2304637.
short: J. Li, L. Deng, Y. Gong, R. Haeb-Umbach, IEEE Transactions on Audio, Speech
and Language Processing 22 (2014) 745–777.
date_created: 2019-07-12T05:29:47Z
date_updated: 2022-01-06T06:51:11Z
department:
- _id: '54'
doi: 10.1109/TASLP.2014.2304637
intvolume: ' 22'
issue: '4'
keyword:
- Speech recognition
- compensation
- distortion modeling
- joint model training
- noise
- robustness
- uncertainty processing
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6732927
oa: '1'
page: 745-777
publication: IEEE Transactions on Audio, Speech and Language Processing
status: public
title: An Overview of Noise-Robust Automatic Speech Recognition
type: journal_article
user_id: '44006'
volume: 22
year: '2014'
...
---
_id: '15663'
citation:
ama: Schulte C, E. Caspersen M, Gal-Ezer J, eds. Proceedings of the 9th Workshop
in Primary and Secondary Computing Education, WiPSCE 2014, Berlin, Germany, November
5-7, 2014. ACM; 2014.
apa: Schulte, C., E. Caspersen, M., & Gal-Ezer, J. (Eds.). (2014). Proceedings
of the 9th Workshop in Primary and Secondary Computing Education, WiPSCE 2014,
Berlin, Germany, November 5-7, 2014. ACM.
bibtex: '@book{Schulte_E. Caspersen_Gal-Ezer_2014, title={Proceedings of the 9th
Workshop in Primary and Secondary Computing Education, WiPSCE 2014, Berlin, Germany,
November 5-7, 2014}, publisher={ACM}, year={2014} }'
chicago: Schulte, Carsten, Michael E. Caspersen, and Judith Gal-Ezer, eds. Proceedings
of the 9th Workshop in Primary and Secondary Computing Education, WiPSCE 2014,
Berlin, Germany, November 5-7, 2014. ACM, 2014.
ieee: C. Schulte, M. E. Caspersen, and J. Gal-Ezer, Eds., Proceedings of the
9th Workshop in Primary and Secondary Computing Education, WiPSCE 2014, Berlin,
Germany, November 5-7, 2014. ACM, 2014.
mla: Schulte, Carsten, et al., editors. Proceedings of the 9th Workshop in Primary
and Secondary Computing Education, WiPSCE 2014, Berlin, Germany, November 5-7,
2014. ACM, 2014.
short: C. Schulte, M. E. Caspersen, J. Gal-Ezer, eds., Proceedings of the 9th Workshop
in Primary and Secondary Computing Education, WiPSCE 2014, Berlin, Germany, November
5-7, 2014, ACM, 2014.
date_created: 2020-01-28T10:29:02Z
date_updated: 2022-01-06T06:52:31Z
department:
- _id: '67'
editor:
- first_name: Carsten
full_name: Schulte, Carsten
id: '60311'
last_name: Schulte
- first_name: Michael
full_name: E. Caspersen, Michael
last_name: E. Caspersen
- first_name: Judith
full_name: Gal-Ezer, Judith
last_name: Gal-Ezer
language:
- iso: eng
publisher: ACM
status: public
title: Proceedings of the 9th Workshop in Primary and Secondary Computing Education,
WiPSCE 2014, Berlin, Germany, November 5-7, 2014
type: conference_editor
user_id: '21145'
year: '2014'
...