---
_id: '7758'
citation:
ama: Van Gorp P, Engels G, eds. Theory and Practice of Model Transformations
- 9th International Conference ICMT 2016, Held as Part of STAF 2016, Vienna, Austria,
July 4-5, 2016, Proceedings. Vol 9765. Springer; 2016.
apa: Van Gorp, P., & Engels, G. (Eds.). (2016). Theory and Practice of Model
Transformations - 9th International Conference ICMT 2016, Held as Part of STAF
2016, Vienna, Austria, July 4-5, 2016, Proceedings (Vol. 9765). Springer.
bibtex: '@book{Van Gorp_Engels_2016, title={Theory and Practice of Model Transformations
- 9th International Conference ICMT 2016, Held as Part of STAF 2016, Vienna, Austria,
July 4-5, 2016, Proceedings}, volume={9765}, publisher={Springer}, year={2016}
}'
chicago: Van Gorp, Pieter, and Gregor Engels, eds. Theory and Practice of Model
Transformations - 9th International Conference ICMT 2016, Held as Part of STAF
2016, Vienna, Austria, July 4-5, 2016, Proceedings. Vol. 9765. Springer, 2016.
ieee: P. Van Gorp and G. Engels, Eds., Theory and Practice of Model Transformations
- 9th International Conference ICMT 2016, Held as Part of STAF 2016, Vienna, Austria,
July 4-5, 2016, Proceedings, vol. 9765. Springer, 2016.
mla: Van Gorp, Pieter, and Gregor Engels, editors. Theory and Practice of Model
Transformations - 9th International Conference ICMT 2016, Held as Part of STAF
2016, Vienna, Austria, July 4-5, 2016, Proceedings. Vol. 9765, Springer, 2016.
short: P. Van Gorp, G. Engels, eds., Theory and Practice of Model Transformations
- 9th International Conference ICMT 2016, Held as Part of STAF 2016, Vienna, Austria,
July 4-5, 2016, Proceedings, Springer, 2016.
date_created: 2019-02-19T11:54:25Z
date_updated: 2022-01-06T07:03:45Z
department:
- _id: '66'
editor:
- first_name: Pieter
full_name: Van Gorp, Pieter
last_name: Van Gorp
- first_name: Gregor
full_name: Engels, Gregor
id: '107'
last_name: Engels
intvolume: ' 9765'
language:
- iso: eng
publisher: Springer
status: public
title: Theory and Practice of Model Transformations - 9th International Conference
ICMT 2016, Held as Part of STAF 2016, Vienna, Austria, July 4-5, 2016, Proceedings
type: conference_editor
user_id: '52534'
volume: 9765
year: '2016'
...
---
_id: '5762'
abstract:
- lang: eng
text: "This paper introduces the problem of communication pattern adaption for a
distributed self-adjusting binary search tree. We propose a simple local algorithm
that is closely related to the over thirty-year-old idea of splay trees and evaluate
its adaption performance in the distributed scenario if different communication
patterns are provided. \r\nTo do so, the process of self-adjustment is modeled
similarly to a basic network creation game in which the nodes want to communicate
with only a certain subset of all nodes. \r\nWe show that, in general, the game
(i.e., the process of local adjustments) does not converge, and that convergence
is related to certain structures of the communication interests, which we call
conflicts. \r\nWe classify conflicts and show that for two communication scenarios
in which convergence is guaranteed, the self-adjusting tree performs well. \r\nFurthermore,
we investigate the different classes of conflicts separately and show that, for
a certain class of conflicts, the performance of the tree network is asymptotically
as good as the performance for converging instances.\r\nHowever, for the other
conflict classes, a distributed self-adjusting binary search tree adapts poorly."
author:
- first_name: Thim Frederik
full_name: Strothmann, Thim Frederik
id: '11319'
last_name: Strothmann
citation:
ama: Strothmann TF. The Impact of Communication Patterns on Distributed Self-Adjusting
Binary Search Tree. Journal of Graph Algorithms and Applications. 2016;20(1):79-100.
doi:10.7155/jgaa.00385
apa: Strothmann, T. F. (2016). The Impact of Communication Patterns on Distributed
Self-Adjusting Binary Search Tree. Journal of Graph Algorithms and Applications,
20(1), 79–100. https://doi.org/10.7155/jgaa.00385
bibtex: '@article{Strothmann_2016, title={The Impact of Communication Patterns on
Distributed Self-Adjusting Binary Search Tree}, volume={20}, DOI={10.7155/jgaa.00385},
number={1}, journal={Journal of Graph Algorithms and Applications}, publisher={Journal
of Graph Algorithms and Applications}, author={Strothmann, Thim Frederik}, year={2016},
pages={79–100} }'
chicago: 'Strothmann, Thim Frederik. “The Impact of Communication Patterns on Distributed
Self-Adjusting Binary Search Tree.” Journal of Graph Algorithms and Applications
20, no. 1 (2016): 79–100. https://doi.org/10.7155/jgaa.00385.'
ieee: T. F. Strothmann, “The Impact of Communication Patterns on Distributed Self-Adjusting
Binary Search Tree,” Journal of Graph Algorithms and Applications, vol.
20, no. 1, pp. 79–100, 2016.
mla: Strothmann, Thim Frederik. “The Impact of Communication Patterns on Distributed
Self-Adjusting Binary Search Tree.” Journal of Graph Algorithms and Applications,
vol. 20, no. 1, Journal of Graph Algorithms and Applications, 2016, pp. 79–100,
doi:10.7155/jgaa.00385.
short: T.F. Strothmann, Journal of Graph Algorithms and Applications 20 (2016) 79–100.
date_created: 2018-11-19T15:33:50Z
date_updated: 2022-01-06T07:02:38Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.7155/jgaa.00385
file:
- access_level: closed
content_type: application/pdf
creator: thim
date_created: 2018-11-27T11:58:08Z
date_updated: 2018-11-27T11:58:08Z
file_id: '5912'
file_name: Strothmann2016.20.1.pdf
file_size: 2324066
relation: main_file
success: 1
file_date_updated: 2018-11-27T11:58:08Z
has_accepted_license: '1'
intvolume: ' 20'
issue: '1'
language:
- iso: eng
page: 79-100
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
publication: Journal of Graph Algorithms and Applications
publication_identifier:
issn:
- 1526-1719
publication_status: published
publisher: Journal of Graph Algorithms and Applications
quality_controlled: '1'
status: public
title: The Impact of Communication Patterns on Distributed Self-Adjusting Binary Search
Tree
type: journal_article
user_id: '477'
volume: 20
year: '2016'
...
---
_id: '7054'
article_number: '056201'
author:
- first_name: J
full_name: Schuster, J
last_name: Schuster
- first_name: T Y
full_name: Kim, T Y
last_name: Kim
- first_name: E
full_name: Batke, E
last_name: Batke
- first_name: Dirk
full_name: Reuter, Dirk
id: '37763'
last_name: Reuter
- first_name: A D
full_name: Wieck, A D
last_name: Wieck
citation:
ama: Schuster J, Kim TY, Batke E, Reuter D, Wieck AD. Electric field distribution
and exciton recombination line shape in GaAs. Materials Research Express.
2016;3(5). doi:10.1088/2053-1591/3/5/056201
apa: Schuster, J., Kim, T. Y., Batke, E., Reuter, D., & Wieck, A. D. (2016).
Electric field distribution and exciton recombination line shape in GaAs. Materials
Research Express, 3(5). https://doi.org/10.1088/2053-1591/3/5/056201
bibtex: '@article{Schuster_Kim_Batke_Reuter_Wieck_2016, title={Electric field distribution
and exciton recombination line shape in GaAs}, volume={3}, DOI={10.1088/2053-1591/3/5/056201},
number={5056201}, journal={Materials Research Express}, publisher={IOP Publishing},
author={Schuster, J and Kim, T Y and Batke, E and Reuter, Dirk and Wieck, A D},
year={2016} }'
chicago: Schuster, J, T Y Kim, E Batke, Dirk Reuter, and A D Wieck. “Electric Field
Distribution and Exciton Recombination Line Shape in GaAs.” Materials Research
Express 3, no. 5 (2016). https://doi.org/10.1088/2053-1591/3/5/056201.
ieee: J. Schuster, T. Y. Kim, E. Batke, D. Reuter, and A. D. Wieck, “Electric field
distribution and exciton recombination line shape in GaAs,” Materials Research
Express, vol. 3, no. 5, 2016.
mla: Schuster, J., et al. “Electric Field Distribution and Exciton Recombination
Line Shape in GaAs.” Materials Research Express, vol. 3, no. 5, 056201,
IOP Publishing, 2016, doi:10.1088/2053-1591/3/5/056201.
short: J. Schuster, T.Y. Kim, E. Batke, D. Reuter, A.D. Wieck, Materials Research
Express 3 (2016).
date_created: 2019-01-29T09:16:45Z
date_updated: 2022-01-06T07:03:27Z
department:
- _id: '15'
- _id: '230'
doi: 10.1088/2053-1591/3/5/056201
intvolume: ' 3'
issue: '5'
language:
- iso: eng
publication: Materials Research Express
publication_identifier:
issn:
- 2053-1591
publication_status: published
publisher: IOP Publishing
status: public
title: Electric field distribution and exciton recombination line shape in GaAs
type: journal_article
user_id: '42514'
volume: 3
year: '2016'
...
---
_id: '688'
author:
- first_name: Damian
full_name: Kutzias, Damian
last_name: Kutzias
citation:
ama: Kutzias D. Friendship Processes in Network Creation Games. Universität
Paderborn; 2016.
apa: Kutzias, D. (2016). Friendship Processes in Network Creation Games.
Universität Paderborn.
bibtex: '@book{Kutzias_2016, title={Friendship Processes in Network Creation Games},
publisher={Universität Paderborn}, author={Kutzias, Damian}, year={2016} }'
chicago: Kutzias, Damian. Friendship Processes in Network Creation Games.
Universität Paderborn, 2016.
ieee: D. Kutzias, Friendship Processes in Network Creation Games. Universität
Paderborn, 2016.
mla: Kutzias, Damian. Friendship Processes in Network Creation Games. Universität
Paderborn, 2016.
short: D. Kutzias, Friendship Processes in Network Creation Games, Universität Paderborn,
2016.
date_created: 2017-11-14T06:50:35Z
date_updated: 2022-01-06T07:03:23Z
department:
- _id: '63'
language:
- iso: eng
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
supervisor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
title: Friendship Processes in Network Creation Games
type: mastersthesis
user_id: '477'
year: '2016'
...
---
_id: '689'
author:
- first_name: Johannes Sebastian
full_name: Schaefer, Johannes Sebastian
id: '30291'
last_name: Schaefer
citation:
ama: Schaefer JS. Routing Algorithms on Delayed Networks for Disaster Management
Support. Universität Paderborn; 2016.
apa: Schaefer, J. S. (2016). Routing Algorithms on Delayed Networks for Disaster
Management Support. Universität Paderborn.
bibtex: '@book{Schaefer_2016, title={Routing Algorithms on Delayed Networks for
Disaster Management Support}, publisher={Universität Paderborn}, author={Schaefer,
Johannes Sebastian}, year={2016} }'
chicago: Schaefer, Johannes Sebastian. Routing Algorithms on Delayed Networks
for Disaster Management Support. Universität Paderborn, 2016.
ieee: J. S. Schaefer, Routing Algorithms on Delayed Networks for Disaster Management
Support. Universität Paderborn, 2016.
mla: Schaefer, Johannes Sebastian. Routing Algorithms on Delayed Networks for
Disaster Management Support. Universität Paderborn, 2016.
short: J.S. Schaefer, Routing Algorithms on Delayed Networks for Disaster Management
Support, Universität Paderborn, 2016.
date_created: 2017-11-14T06:51:37Z
date_updated: 2022-01-06T07:03:23Z
department:
- _id: '63'
language:
- iso: eng
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
supervisor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
title: Routing Algorithms on Delayed Networks for Disaster Management Support
type: mastersthesis
user_id: '477'
year: '2016'
...
---
_id: '11908'
abstract:
- lang: eng
text: 'This paper describes automatic speech recognition (ASR) systems developed
jointly by RWTH, UPB and FORTH for the 1ch, 2ch and 6ch track of the 4th CHiME
Challenge. In the 2ch and 6ch tracks the final system output is obtained by a
Confusion Network Combination (CNC) of multiple systems. The Acoustic Model (AM)
is a deep neural network based on Bidirectional Long Short-Term Memory (BLSTM)
units. The systems differ by front ends and training sets used for the acoustic
training. The model for the 1ch track is trained without any preprocessing. For
each front end we trained and evaluated individual acoustic models. We compare
the ASR performance of different beamforming approaches: a conventional superdirective
beamformer [1] and an MVDR beamformer as in [2], where the steering vector is
estimated based on [3]. Furthermore we evaluated a BLSTM supported Generalized
Eigenvalue beamformer using NN-GEV [4]. The back end is implemented using RWTH?s
open-source toolkits RASR [5], RETURNN [6] and rwthlm [7]. We rescore lattices
with a Long Short-Term Memory (LSTM) based language model. The overall best results
are obtained by a system combination that includes the lattices from the system
of UPB?s submission [8]. Our final submission scored second in each of the three
tracks of the 4th CHiME Challenge.'
author:
- first_name: Tobias
full_name: Menne, Tobias
last_name: Menne
- first_name: Jahn
full_name: Heymann, Jahn
id: '9168'
last_name: Heymann
- first_name: Anastasios
full_name: Alexandridis, Anastasios
last_name: Alexandridis
- first_name: Kazuki
full_name: Irie, Kazuki
last_name: Irie
- first_name: Albert
full_name: Zeyer, Albert
last_name: Zeyer
- first_name: Markus
full_name: Kitza, Markus
last_name: Kitza
- first_name: Pavel
full_name: Golik, Pavel
last_name: Golik
- first_name: Ilia
full_name: Kulikov, Ilia
last_name: Kulikov
- first_name: Lukas
full_name: Drude, Lukas
id: '11213'
last_name: Drude
- first_name: Ralf
full_name: Schlüter, Ralf
last_name: Schlüter
- first_name: Hermann
full_name: Ney, Hermann
last_name: Ney
- first_name: Reinhold
full_name: Haeb-Umbach, Reinhold
id: '242'
last_name: Haeb-Umbach
- first_name: Athanasios
full_name: Mouchtaris, Athanasios
last_name: Mouchtaris
citation:
ama: 'Menne T, Heymann J, Alexandridis A, et al. The RWTH/UPB/FORTH System Combination
for the 4th CHiME Challenge Evaluation. In: Computer Speech and Language.
; 2016.'
apa: Menne, T., Heymann, J., Alexandridis, A., Irie, K., Zeyer, A., Kitza, M., …
Mouchtaris, A. (2016). The RWTH/UPB/FORTH System Combination for the 4th CHiME
Challenge Evaluation. In Computer Speech and Language.
bibtex: '@inproceedings{Menne_Heymann_Alexandridis_Irie_Zeyer_Kitza_Golik_Kulikov_Drude_Schlüter_et
al._2016, title={The RWTH/UPB/FORTH System Combination for the 4th CHiME Challenge
Evaluation}, booktitle={Computer Speech and Language}, author={Menne, Tobias and
Heymann, Jahn and Alexandridis, Anastasios and Irie, Kazuki and Zeyer, Albert
and Kitza, Markus and Golik, Pavel and Kulikov, Ilia and Drude, Lukas and Schlüter,
Ralf and et al.}, year={2016} }'
chicago: Menne, Tobias, Jahn Heymann, Anastasios Alexandridis, Kazuki Irie, Albert
Zeyer, Markus Kitza, Pavel Golik, et al. “The RWTH/UPB/FORTH System Combination
for the 4th CHiME Challenge Evaluation.” In Computer Speech and Language,
2016.
ieee: T. Menne et al., “The RWTH/UPB/FORTH System Combination for the 4th
CHiME Challenge Evaluation,” in Computer Speech and Language, 2016.
mla: Menne, Tobias, et al. “The RWTH/UPB/FORTH System Combination for the 4th CHiME
Challenge Evaluation.” Computer Speech and Language, 2016.
short: 'T. Menne, J. Heymann, A. Alexandridis, K. Irie, A. Zeyer, M. Kitza, P. Golik,
I. Kulikov, L. Drude, R. Schlüter, H. Ney, R. Haeb-Umbach, A. Mouchtaris, in:
Computer Speech and Language, 2016.'
date_created: 2019-07-12T05:30:35Z
date_updated: 2022-01-06T06:51:12Z
department:
- _id: '54'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://groups.uni-paderborn.de/nt/pubs/2016/chime4_rwthupbforth_paper.pdf
oa: '1'
publication: Computer Speech and Language
status: public
title: The RWTH/UPB/FORTH System Combination for the 4th CHiME Challenge Evaluation
type: conference
user_id: '44006'
year: '2016'
...
---
_id: '154'
author:
- first_name: Andreas
full_name: Cord-Landwehr, Andreas
last_name: Cord-Landwehr
citation:
ama: Cord-Landwehr A. Selfish Network Creation - On Variants of Network Creation
Games. Vol 353. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn;
2016.
apa: Cord-Landwehr, A. (2016). Selfish Network Creation - On Variants of Network
Creation Games (Vol. 353). Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn.
bibtex: '@book{Cord-Landwehr_2016, series={Verlagsschriftenreihe des Heinz Nixdorf
Instituts, Paderborn}, title={Selfish Network Creation - On Variants of Network
Creation Games}, volume={353}, publisher={Verlagsschriftenreihe des Heinz Nixdorf
Instituts, Paderborn}, author={Cord-Landwehr, Andreas}, year={2016}, collection={Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn} }'
chicago: Cord-Landwehr, Andreas. Selfish Network Creation - On Variants of Network
Creation Games. Vol. 353. Verlagsschriftenreihe Des Heinz Nixdorf Instituts,
Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2016.
ieee: A. Cord-Landwehr, Selfish Network Creation - On Variants of Network Creation
Games, vol. 353. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn,
2016.
mla: Cord-Landwehr, Andreas. Selfish Network Creation - On Variants of Network
Creation Games. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn,
2016.
short: A. Cord-Landwehr, Selfish Network Creation - On Variants of Network Creation
Games, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2016.
date_created: 2017-10-17T12:41:22Z
date_updated: 2022-01-06T06:52:23Z
ddc:
- '040'
department:
- _id: '63'
- _id: '26'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T12:52:03Z
date_updated: 2018-03-21T12:52:03Z
file_id: '1551'
file_name: 154-dissertation.pdf
file_size: 800101
relation: main_file
success: 1
file_date_updated: 2018-03-21T12:52:03Z
has_accepted_license: '1'
intvolume: ' 353'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication_identifier:
isbn:
- 978-3-942647-72-4
publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
related_material:
link:
- relation: confirmation
url: http://nbn-resolving.de/urn:nbn:de:hbz:466:2-24089
series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
status: public
supervisor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
title: Selfish Network Creation - On Variants of Network Creation Games
type: dissertation
user_id: '5786'
volume: 353
year: '2016'
...
---
_id: '157'
abstract:
- lang: eng
text: Consider a scheduling problem in which a set of jobs with interjob communication,
canonically represented by a weighted tree, needs to be scheduled on m parallel
processors interconnected by a shared communication channel. In each time step,
we may allow any processed job to use a certain capacity of the channel in order
to satisfy (parts of) its communication demands to adjacent jobs processed in
parallel. The goal is to find a schedule that minimizes the makespan and in which
communication demands of all jobs are satisfied.We show that this problem is NP-hard
in the strong sense even if the number of processors and the maximum degree of
the underlying tree is constant.Consequently, we design and analyze simple approximation
algorithms with asymptotic approximation ratio 2-2/m in case of paths and a ratio
of 5/2 in case of arbitrary trees.
author:
- first_name: Jürgen
full_name: König, Jürgen
last_name: König
- first_name: Alexander
full_name: Mäcker, Alexander
id: '13536'
last_name: Mäcker
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Sören
full_name: Riechers, Sören
last_name: Riechers
citation:
ama: 'König J, Mäcker A, Meyer auf der Heide F, Riechers S. Scheduling with Interjob
Communication on Parallel Processors. In: Proceedings of the 10th Annual International
Conference on Combinatorial Optimization and Applications (COCOA). LNCS. ;
2016:563--577. doi:10.1007/978-3-319-48749-6_41'
apa: König, J., Mäcker, A., Meyer auf der Heide, F., & Riechers, S. (2016).
Scheduling with Interjob Communication on Parallel Processors. In Proceedings
of the 10th Annual International Conference on Combinatorial Optimization and
Applications (COCOA) (pp. 563--577). https://doi.org/10.1007/978-3-319-48749-6_41
bibtex: '@inproceedings{König_Mäcker_Meyer auf der Heide_Riechers_2016, series={LNCS},
title={Scheduling with Interjob Communication on Parallel Processors}, DOI={10.1007/978-3-319-48749-6_41},
booktitle={Proceedings of the 10th Annual International Conference on Combinatorial
Optimization and Applications (COCOA)}, author={König, Jürgen and Mäcker, Alexander
and Meyer auf der Heide, Friedhelm and Riechers, Sören}, year={2016}, pages={563--577},
collection={LNCS} }'
chicago: König, Jürgen, Alexander Mäcker, Friedhelm Meyer auf der Heide, and Sören
Riechers. “Scheduling with Interjob Communication on Parallel Processors.” In
Proceedings of the 10th Annual International Conference on Combinatorial Optimization
and Applications (COCOA), 563--577. LNCS, 2016. https://doi.org/10.1007/978-3-319-48749-6_41.
ieee: J. König, A. Mäcker, F. Meyer auf der Heide, and S. Riechers, “Scheduling
with Interjob Communication on Parallel Processors,” in Proceedings of the
10th Annual International Conference on Combinatorial Optimization and Applications
(COCOA), 2016, pp. 563--577.
mla: König, Jürgen, et al. “Scheduling with Interjob Communication on Parallel Processors.”
Proceedings of the 10th Annual International Conference on Combinatorial Optimization
and Applications (COCOA), 2016, pp. 563--577, doi:10.1007/978-3-319-48749-6_41.
short: 'J. König, A. Mäcker, F. Meyer auf der Heide, S. Riechers, in: Proceedings
of the 10th Annual International Conference on Combinatorial Optimization and
Applications (COCOA), 2016, pp. 563--577.'
date_created: 2017-10-17T12:41:22Z
date_updated: 2022-01-06T06:52:32Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1007/978-3-319-48749-6_41
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T12:50:29Z
date_updated: 2018-03-21T12:50:29Z
file_id: '1549'
file_name: 157-chp_3A10.1007_2F978-3-319-48749-6_41.pdf
file_size: 753147
relation: main_file
success: 1
file_date_updated: 2018-03-21T12:50:29Z
has_accepted_license: '1'
page: 563--577
project:
- _id: '1'
name: SFB 901
- _id: '16'
name: SFB 901 - Subprojekt C4
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the 10th Annual International Conference on Combinatorial
Optimization and Applications (COCOA)
series_title: LNCS
status: public
title: Scheduling with Interjob Communication on Parallel Processors
type: conference
user_id: '15504'
year: '2016'
...
---
_id: '149'
abstract:
- lang: eng
text: 'In this paper we consider a strategic variant of the online facility location
problem. Given is a graph in which each node serves two roles: it is a strategic
client stating requests as well as a potential location for a facility. In each
time step one client states a request which induces private costs equal to the
distance to the closest facility. Before serving, the clients may collectively
decide to open new facilities, sharing the corresponding price. Instead of optimizing
the global costs, each client acts selfishly. The prices of new facilities vary
between nodes and also change over time, but are always bounded by some fixed
value α. Both the requests as well as the facility prices are given by an online
sequence and are not known in advance.We characterize the optimal strategies of
the clients and analyze their overall performance in comparison to a centralized
offline solution. If all players optimize their own competitiveness, the global
performance of the system is O(√α⋅α) times worse than the offline optimum. A restriction
to a natural subclass of strategies improves this result to O(α). We also show
that for fixed facility costs, we can find strategies such that this bound further
improves to O(√α).'
author:
- first_name: Maximilian
full_name: Drees, Maximilian
last_name: Drees
- first_name: Björn
full_name: Feldkord, Björn
id: '22704'
last_name: Feldkord
- first_name: Alexander
full_name: Skopalik, Alexander
id: '40384'
last_name: Skopalik
citation:
ama: 'Drees M, Feldkord B, Skopalik A. Strategic Online Facility Location. In: Proceedings
of the 10th Annual International Conference on Combinatorial Optimization and
Applications (COCOA). LNCS. ; 2016:593--607. doi:10.1007/978-3-319-48749-6_43'
apa: Drees, M., Feldkord, B., & Skopalik, A. (2016). Strategic Online Facility
Location. In Proceedings of the 10th Annual International Conference on Combinatorial
Optimization and Applications (COCOA) (pp. 593--607). https://doi.org/10.1007/978-3-319-48749-6_43
bibtex: '@inproceedings{Drees_Feldkord_Skopalik_2016, series={LNCS}, title={Strategic
Online Facility Location}, DOI={10.1007/978-3-319-48749-6_43},
booktitle={Proceedings of the 10th Annual International Conference on Combinatorial
Optimization and Applications (COCOA)}, author={Drees, Maximilian and Feldkord,
Björn and Skopalik, Alexander}, year={2016}, pages={593--607}, collection={LNCS}
}'
chicago: Drees, Maximilian, Björn Feldkord, and Alexander Skopalik. “Strategic Online
Facility Location.” In Proceedings of the 10th Annual International Conference
on Combinatorial Optimization and Applications (COCOA), 593--607. LNCS, 2016.
https://doi.org/10.1007/978-3-319-48749-6_43.
ieee: M. Drees, B. Feldkord, and A. Skopalik, “Strategic Online Facility Location,”
in Proceedings of the 10th Annual International Conference on Combinatorial
Optimization and Applications (COCOA), 2016, pp. 593--607.
mla: Drees, Maximilian, et al. “Strategic Online Facility Location.” Proceedings
of the 10th Annual International Conference on Combinatorial Optimization and
Applications (COCOA), 2016, pp. 593--607, doi:10.1007/978-3-319-48749-6_43.
short: 'M. Drees, B. Feldkord, A. Skopalik, in: Proceedings of the 10th Annual International
Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 593--607.'
date_created: 2017-10-17T12:41:21Z
date_updated: 2022-01-06T06:52:10Z
ddc:
- '040'
department:
- _id: '63'
- _id: '541'
doi: 10.1007/978-3-319-48749-6_43
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T12:55:43Z
date_updated: 2018-03-21T12:55:43Z
file_id: '1553'
file_name: 149-chp_3A10.1007_2F978-3-319-48749-6_43.pdf
file_size: 236253
relation: main_file
success: 1
file_date_updated: 2018-03-21T12:55:43Z
has_accepted_license: '1'
language:
- iso: eng
page: 593--607
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '7'
name: SFB 901 - Subproject A3
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 10th Annual International Conference on Combinatorial
Optimization and Applications (COCOA)
series_title: LNCS
status: public
title: Strategic Online Facility Location
type: conference
user_id: '477'
year: '2016'
...
---
_id: '16146'
author:
- first_name: Volker
full_name: Grienitz, Volker
last_name: Grienitz
- first_name: Thomas
full_name: Tröster, Thomas
id: '553'
last_name: Tröster
- first_name: Stefan
full_name: Meiners, Stefan
last_name: Meiners
citation:
ama: Grienitz V, Tröster T, Meiners S. Technikevaluation für die generative Fertigung
eines Serien-Radträgers. ATZ - Automobiltechnische Zeitschrift. 2016:36-41.
doi:10.1007/s35148-016-0090-5
apa: Grienitz, V., Tröster, T., & Meiners, S. (2016). Technikevaluation für
die generative Fertigung eines Serien-Radträgers. ATZ - Automobiltechnische
Zeitschrift, 36–41. https://doi.org/10.1007/s35148-016-0090-5
bibtex: '@article{Grienitz_Tröster_Meiners_2016, title={Technikevaluation für die
generative Fertigung eines Serien-Radträgers}, DOI={10.1007/s35148-016-0090-5},
journal={ATZ - Automobiltechnische Zeitschrift}, author={Grienitz, Volker and
Tröster, Thomas and Meiners, Stefan}, year={2016}, pages={36–41} }'
chicago: Grienitz, Volker, Thomas Tröster, and Stefan Meiners. “Technikevaluation
für die generative Fertigung eines Serien-Radträgers.” ATZ - Automobiltechnische
Zeitschrift, 2016, 36–41. https://doi.org/10.1007/s35148-016-0090-5.
ieee: V. Grienitz, T. Tröster, and S. Meiners, “Technikevaluation für die generative
Fertigung eines Serien-Radträgers,” ATZ - Automobiltechnische Zeitschrift,
pp. 36–41, 2016.
mla: Grienitz, Volker, et al. “Technikevaluation für die generative Fertigung eines
Serien-Radträgers.” ATZ - Automobiltechnische Zeitschrift, 2016, pp. 36–41,
doi:10.1007/s35148-016-0090-5.
short: V. Grienitz, T. Tröster, S. Meiners, ATZ - Automobiltechnische Zeitschrift
(2016) 36–41.
date_created: 2020-02-27T16:05:23Z
date_updated: 2022-01-06T06:52:44Z
department:
- _id: '9'
- _id: '321'
- _id: '149'
doi: 10.1007/s35148-016-0090-5
language:
- iso: ger
page: 36-41
publication: ATZ - Automobiltechnische Zeitschrift
publication_identifier:
issn:
- 0001-2785
- 2192-8800
publication_status: published
status: public
title: Technikevaluation für die generative Fertigung eines Serien-Radträgers
type: journal_article
user_id: '72008'
year: '2016'
...
---
_id: '139'
abstract:
- lang: eng
text: 'We consider online optimization problems in which certain goods have to be
acquired in order to provide a service or infrastructure. Classically, decisions
for such problems are considered as final: one buys the goods. However, in many
real world applications, there is a shift away from the idea of buying goods.
Instead, leasing is often a more flexible and lucrative business model. Research
has realized this shift and recently initiated the theoretical study of leasing
models (Anthony and Gupta in Proceedings of the integer programming and combinatorial
optimization: 12th International IPCO Conference, Ithaca, NY, USA, June 25–27,
2007; Meyerson in Proceedings of the 46th Annual IEEE Symposium on Foundations
of Computer Science (FOCS 2005), 23–25 Oct 2005, Pittsburgh, PA, USA, 2005; Nagarajan
and Williamson in Discret Optim 10(4):361–370, 2013) We extend this line of work
and suggest a more systematic study of leasing aspects for a class of online optimization
problems. We provide two major technical results. We introduce the leasing variant
of online set multicover and give an O(log(mK)logn)-competitive algorithm (with
n, m, and K being the number of elements, sets, and leases, respectively). Our
results also imply improvements for the non-leasing variant of online set cover.
Moreover, we extend results for the leasing variant of online facility location.
Nagarajan and Williamson (Discret Optim 10(4):361–370, 2013) gave an O(Klogn)-competitive
algorithm for this problem (with n and K being the number of clients and leases,
respectively). We remove the dependency on n (and, thereby, on time). In general,
this leads to a bound of O(lmaxloglmax) (with the maximal lease length lmax).
For many natural problem instances, the bound improves to O(K2).'
author:
- first_name: Sebastian
full_name: Abshoff, Sebastian
last_name: Abshoff
- first_name: Peter
full_name: Kling, Peter
last_name: Kling
- 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: 'Peter '
full_name: 'Pietrzyk, Peter '
last_name: Pietrzyk
citation:
ama: Abshoff S, Kling P, Markarian C, Meyer auf der Heide F, Pietrzyk P. Towards
the price of leasing online. Journal of Combinatorial Optimization. 2016;(4):1197--1216.
doi:10.1007/s10878-015-9915-5
apa: Abshoff, S., Kling, P., Markarian, C., Meyer auf der Heide, F., & Pietrzyk,
P. (2016). Towards the price of leasing online. Journal of Combinatorial Optimization,
(4), 1197--1216. https://doi.org/10.1007/s10878-015-9915-5
bibtex: '@article{Abshoff_Kling_Markarian_Meyer auf der Heide_Pietrzyk_2016, title={Towards
the price of leasing online}, DOI={10.1007/s10878-015-9915-5},
number={4}, journal={Journal of Combinatorial Optimization}, publisher={Springer},
author={Abshoff, Sebastian and Kling, Peter and Markarian, Christine and Meyer
auf der Heide, Friedhelm and Pietrzyk, Peter }, year={2016}, pages={1197--1216}
}'
chicago: 'Abshoff, Sebastian, Peter Kling, Christine Markarian, Friedhelm Meyer
auf der Heide, and Peter Pietrzyk. “Towards the Price of Leasing Online.” Journal
of Combinatorial Optimization, no. 4 (2016): 1197--1216. https://doi.org/10.1007/s10878-015-9915-5.'
ieee: S. Abshoff, P. Kling, C. Markarian, F. Meyer auf der Heide, and P. Pietrzyk,
“Towards the price of leasing online,” Journal of Combinatorial Optimization,
no. 4, pp. 1197--1216, 2016.
mla: Abshoff, Sebastian, et al. “Towards the Price of Leasing Online.” Journal
of Combinatorial Optimization, no. 4, Springer, 2016, pp. 1197--1216, doi:10.1007/s10878-015-9915-5.
short: S. Abshoff, P. Kling, C. Markarian, F. Meyer auf der Heide, P. Pietrzyk,
Journal of Combinatorial Optimization (2016) 1197--1216.
date_created: 2017-10-17T12:41:18Z
date_updated: 2022-01-06T06:51:46Z
ddc:
- '000'
department:
- _id: '63'
doi: 10.1007/s10878-015-9915-5
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T15:57:25Z
date_updated: 2018-11-02T15:57:25Z
file_id: '5318'
file_name: Abshoff-TowardsThePriceOfLeasingOnline.pdf
file_size: 654903
relation: main_file
success: 1
file_date_updated: 2018-11-02T15:57:25Z
has_accepted_license: '1'
issue: '4'
language:
- iso: eng
page: ' 1197--1216'
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '16'
name: SFB 901 - Subprojekt C4
- _id: '2'
name: SFB 901 - Project Area A
- _id: '4'
name: SFB 901 - Project Area C
publication: Journal of Combinatorial Optimization
publisher: Springer
status: public
title: Towards the price of leasing online
type: journal_article
user_id: '477'
year: '2016'
...
---
_id: '142'
abstract:
- lang: eng
text: For overlay networks, the ability to recover from a variety of problems like
membership changes or faults is a key element to preserve their functionality.
In recent years, various self-stabilizing overlay networks have been proposed
that have the advantage of being able to recover from any illegal state. However,
the vast majority of these networks cannot give any guarantees on its functionality
while the recovery process is going on. We are especially interested in searchability,
i.e., the functionality that search messages for a specific identifier are answered
successfully if a node with that identifier exists in the network. We investigate
overlay networks that are not only self-stabilizing but that also ensure that
monotonic searchability is maintained while the recovery process is going on,
as long as there are no corrupted messages in the system. More precisely, once
a search message from node u to another node v is successfully delivered, all
future search messages from u to v succeed as well. Monotonic searchability was
recently introduced in OPODIS 2015, in which the authors provide a solution for
a simple line topology.We present the first universal approach to maintain monotonic
searchability that is applicable to a wide range of topologies. As the base for
our approach, we introduce a set of primitives for manipulating overlay networks
that allows us to maintain searchability and show how existing protocols can be
transformed to use theses primitives.We complement this result with a generic
search protocol that together with the use of our primitives guarantees monotonic
searchability.As an additional feature, searching existing nodes with the generic
search protocol is as fast as searching a node with any other fixed routing protocol
once the topology has stabilized.
author:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Alexander
full_name: Setzer, Alexander
id: '11108'
last_name: Setzer
- first_name: Thim Frederik
full_name: Strothmann, Thim Frederik
id: '11319'
last_name: Strothmann
citation:
ama: 'Scheideler C, Setzer A, Strothmann TF. Towards a Universal Approach for Monotonic
Searchability in Self-stabilizing Overlay Networks. In: Proceedings of the
30th International Symposium on Distributed Computing (DISC). LNCS. ; 2016:71--84.
doi:10.1007/978-3-662-53426-7_6'
apa: Scheideler, C., Setzer, A., & Strothmann, T. F. (2016). Towards a Universal
Approach for Monotonic Searchability in Self-stabilizing Overlay Networks. In
Proceedings of the 30th International Symposium on Distributed Computing (DISC)
(pp. 71--84). https://doi.org/10.1007/978-3-662-53426-7_6
bibtex: '@inproceedings{Scheideler_Setzer_Strothmann_2016, series={LNCS}, title={Towards
a Universal Approach for Monotonic Searchability in Self-stabilizing Overlay Networks},
DOI={10.1007/978-3-662-53426-7_6},
booktitle={Proceedings of the 30th International Symposium on Distributed Computing
(DISC)}, author={Scheideler, Christian and Setzer, Alexander and Strothmann, Thim
Frederik}, year={2016}, pages={71--84}, collection={LNCS} }'
chicago: Scheideler, Christian, Alexander Setzer, and Thim Frederik Strothmann.
“Towards a Universal Approach for Monotonic Searchability in Self-Stabilizing
Overlay Networks.” In Proceedings of the 30th International Symposium on Distributed
Computing (DISC), 71--84. LNCS, 2016. https://doi.org/10.1007/978-3-662-53426-7_6.
ieee: C. Scheideler, A. Setzer, and T. F. Strothmann, “Towards a Universal Approach
for Monotonic Searchability in Self-stabilizing Overlay Networks,” in Proceedings
of the 30th International Symposium on Distributed Computing (DISC), 2016,
pp. 71--84.
mla: Scheideler, Christian, et al. “Towards a Universal Approach for Monotonic Searchability
in Self-Stabilizing Overlay Networks.” Proceedings of the 30th International
Symposium on Distributed Computing (DISC), 2016, pp. 71--84, doi:10.1007/978-3-662-53426-7_6.
short: 'C. Scheideler, A. Setzer, T.F. Strothmann, in: Proceedings of the 30th International
Symposium on Distributed Computing (DISC), 2016, pp. 71--84.'
date_created: 2017-10-17T12:41:19Z
date_updated: 2022-01-06T06:51:56Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1007/978-3-662-53426-7_6
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T12:59:29Z
date_updated: 2018-03-21T12:59:29Z
file_id: '1558'
file_name: 142-SchSetStrDISC16.pdf
file_size: 209638
relation: main_file
success: 1
file_date_updated: 2018-03-21T12:59:29Z
has_accepted_license: '1'
language:
- iso: eng
page: 71--84
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 30th International Symposium on Distributed Computing
(DISC)
series_title: LNCS
status: public
title: Towards a Universal Approach for Monotonic Searchability in Self-stabilizing
Overlay Networks
type: conference
user_id: '477'
year: '2016'
...
---
_id: '143'
abstract:
- lang: eng
text: 'We present an efficient parallel algorithm for the general Monotone Circuit
Value Problem (MCVP) with n gates and an underlying graph of bounded genus k.
Our algorithm generalizes a recent result by Limaye et al. who showed that MCVP
with toroidal embedding (genus 1) is in NC when the input contains a toroidal
embedding of the circuit. In addition to extending this result from genus 1 to
any bounded genus k, and unlike the work reported by Limaye et al., we do not
require a precomputed embedding to be given. Most importantly, our results imply
that given a P-complete problem, it is possible to find an algorithm that makes
the problem fall into NC by fixing one or more parameters. Hence, we deduce the
interesting analogy: Fixed Parameter Parallelizable (FPP) is with respect to P-complete
what Fixed Parameter Tractable (FPT) is with respect to NP-complete. Similar work
that uses treewidth as parameter was also presented by Elberfeld et al. in [6].'
author:
- first_name: 'Faisal N. '
full_name: 'Abu-Khzam, Faisal N. '
last_name: Abu-Khzam
- first_name: Shouwei
full_name: Li, Shouwei
last_name: Li
- 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: Pavel
full_name: Podlipyan, Pavel
last_name: Podlipyan
citation:
ama: 'Abu-Khzam FN, Li S, Markarian C, Meyer auf der Heide F, Podlipyan P. The Monotone
Circuit Value Problem with Bounded Genus Is in NC. In: Proceedings of the 22nd
International Conference on Computing and Combinatorics (COCOON). LNCS. ;
2016:92-102. doi:10.1007/978-3-319-42634-1_8'
apa: Abu-Khzam, F. N., Li, S., Markarian, C., Meyer auf der Heide, F., & Podlipyan,
P. (2016). The Monotone Circuit Value Problem with Bounded Genus Is in NC. In
Proceedings of the 22nd International Conference on Computing and Combinatorics
(COCOON) (pp. 92–102). https://doi.org/10.1007/978-3-319-42634-1_8
bibtex: '@inproceedings{Abu-Khzam_Li_Markarian_Meyer auf der Heide_Podlipyan_2016,
series={LNCS}, title={The Monotone Circuit Value Problem with Bounded Genus Is
in NC}, DOI={10.1007/978-3-319-42634-1_8},
booktitle={Proceedings of the 22nd International Conference on Computing and Combinatorics
(COCOON)}, author={Abu-Khzam, Faisal N. and Li, Shouwei and Markarian, Christine
and Meyer auf der Heide, Friedhelm and Podlipyan, Pavel}, year={2016}, pages={92–102},
collection={LNCS} }'
chicago: Abu-Khzam, Faisal N. , Shouwei Li, Christine Markarian, Friedhelm Meyer
auf der Heide, and Pavel Podlipyan. “The Monotone Circuit Value Problem with Bounded
Genus Is in NC.” In Proceedings of the 22nd International Conference on Computing
and Combinatorics (COCOON), 92–102. LNCS, 2016. https://doi.org/10.1007/978-3-319-42634-1_8.
ieee: F. N. Abu-Khzam, S. Li, C. Markarian, F. Meyer auf der Heide, and P. Podlipyan,
“The Monotone Circuit Value Problem with Bounded Genus Is in NC,” in Proceedings
of the 22nd International Conference on Computing and Combinatorics (COCOON),
2016, pp. 92–102.
mla: Abu-Khzam, Faisal N., et al. “The Monotone Circuit Value Problem with Bounded
Genus Is in NC.” Proceedings of the 22nd International Conference on Computing
and Combinatorics (COCOON), 2016, pp. 92–102, doi:10.1007/978-3-319-42634-1_8.
short: 'F.N. Abu-Khzam, S. Li, C. Markarian, F. Meyer auf der Heide, P. Podlipyan,
in: Proceedings of the 22nd International Conference on Computing and Combinatorics
(COCOON), 2016, pp. 92–102.'
date_created: 2017-10-17T12:41:19Z
date_updated: 2022-01-06T06:51:57Z
ddc:
- '000'
department:
- _id: '63'
doi: 10.1007/978-3-319-42634-1_8
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T14:20:45Z
date_updated: 2018-11-02T14:20:45Z
file_id: '5269'
file_name: TheMonotoneCircuitValueProblem.pdf
file_size: 234587
relation: main_file
success: 1
file_date_updated: 2018-11-02T14:20:45Z
has_accepted_license: '1'
language:
- iso: eng
page: 92-102
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 22nd International Conference on Computing and Combinatorics
(COCOON)
series_title: LNCS
status: public
title: The Monotone Circuit Value Problem with Bounded Genus Is in NC
type: conference
user_id: '477'
year: '2016'
...
---
_id: '145'
abstract:
- lang: eng
text: 'Comparative evaluations of peer-to-peer protocols through simulations are
a viable approach to judge the performance and costs of the individual protocols
in large-scale networks. In order to support this work, we present the peer-to-peer
system simulator PeerfactSim.KOM, which we extended over the last years. PeerfactSim.KOM
comes with an extensive layer model to support various facets and protocols of
peer-to-peer networking. In this article, we describe PeerfactSim.KOM and show
how it can be used for detailed measurements of large-scale peer-to-peer networks.
We enhanced PeerfactSim.KOM with a fine-grained analyzer concept, with exhaustive
automated measurements and gnuplot generators as well as a coordination control
to evaluate sets of experiment setups in parallel. Thus, by configuring all experiments
and protocols only once and starting the simulator, all desired measurements are
performed, analyzed, evaluated, and combined, resulting in a holistic environment
for the comparative evaluation of peer-to-peer systems. An immediate comparison
of different configurations and overlays under different aspects is possible directly
after the execution without any manual post-processing. '
author:
- first_name: Matthias
full_name: Feldotto, Matthias
id: '14052'
last_name: Feldotto
orcid: 0000-0003-1348-6516
- first_name: Kalman
full_name: Graffi, Kalman
last_name: Graffi
citation:
ama: 'Feldotto M, Graffi K. Systematic evaluation of peer-to-peer systems using
PeerfactSim.KOM. Concurrency and Computation: Practice and Experience.
2016;28(5):1655-1677. doi:10.1002/cpe.3716'
apa: 'Feldotto, M., & Graffi, K. (2016). Systematic evaluation of peer-to-peer
systems using PeerfactSim.KOM. Concurrency and Computation: Practice and Experience,
28(5), 1655–1677. https://doi.org/10.1002/cpe.3716'
bibtex: '@article{Feldotto_Graffi_2016, title={Systematic evaluation of peer-to-peer
systems using PeerfactSim.KOM}, volume={28}, DOI={10.1002/cpe.3716},
number={5}, journal={Concurrency and Computation: Practice and Experience}, publisher={Wiley
Online Library}, author={Feldotto, Matthias and Graffi, Kalman}, year={2016},
pages={1655–1677} }'
chicago: 'Feldotto, Matthias, and Kalman Graffi. “Systematic Evaluation of Peer-to-Peer
Systems Using PeerfactSim.KOM.” Concurrency and Computation: Practice and Experience
28, no. 5 (2016): 1655–77. https://doi.org/10.1002/cpe.3716.'
ieee: 'M. Feldotto and K. Graffi, “Systematic evaluation of peer-to-peer systems
using PeerfactSim.KOM,” Concurrency and Computation: Practice and Experience,
vol. 28, no. 5, pp. 1655–1677, 2016.'
mla: 'Feldotto, Matthias, and Kalman Graffi. “Systematic Evaluation of Peer-to-Peer
Systems Using PeerfactSim.KOM.” Concurrency and Computation: Practice and Experience,
vol. 28, no. 5, Wiley Online Library, 2016, pp. 1655–77, doi:10.1002/cpe.3716.'
short: 'M. Feldotto, K. Graffi, Concurrency and Computation: Practice and Experience
28 (2016) 1655–1677.'
date_created: 2017-10-17T12:41:20Z
date_updated: 2022-01-06T06:52:00Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
- _id: '541'
doi: 10.1002/cpe.3716
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T12:57:57Z
date_updated: 2018-03-21T12:57:57Z
file_id: '1556'
file_name: 145-Feldotto_et_al-2016-Concurrency_and_Computation-_Practice_and_Experience.pdf
file_size: 3121363
relation: main_file
success: 1
file_date_updated: 2018-03-21T12:57:57Z
has_accepted_license: '1'
intvolume: ' 28'
issue: '5'
page: 1655-1677
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: 'Concurrency and Computation: Practice and Experience'
publication_status: published
publisher: Wiley Online Library
status: public
title: Systematic evaluation of peer-to-peer systems using PeerfactSim.KOM
type: journal_article
user_id: '14052'
volume: 28
year: '2016'
...
---
_id: '31800'
author:
- first_name: Uta
full_name: Häsel-Weide, Uta
id: '60267'
last_name: Häsel-Weide
citation:
ama: Häsel-Weide U. “Merit hat 4 von 5 Subtraktionsaufgaben durch Rückwärtszählen
gelöst”. Leistungsbeurteilung im inklusiven Mathematikunterricht. Sonderpädagogische
Förderung heute. 2016;4(61):356-368.
apa: Häsel-Weide, U. (2016). “Merit hat 4 von 5 Subtraktionsaufgaben durch Rückwärtszählen
gelöst”. Leistungsbeurteilung im inklusiven Mathematikunterricht. Sonderpädagogische
Förderung heute, 4(61), 356–368.
bibtex: '@article{Häsel-Weide_2016, title={“Merit hat 4 von 5 Subtraktionsaufgaben
durch Rückwärtszählen gelöst”. Leistungsbeurteilung im inklusiven Mathematikunterricht},
volume={4}, number={61}, journal={Sonderpädagogische Förderung heute}, author={Häsel-Weide,
Uta}, year={2016}, pages={356–368} }'
chicago: 'Häsel-Weide, Uta. “‘Merit hat 4 von 5 Subtraktionsaufgaben durch Rückwärtszählen
gelöst’. Leistungsbeurteilung im inklusiven Mathematikunterricht.” Sonderpädagogische
Förderung heute 4, no. 61 (2016): 356–68.'
ieee: U. Häsel-Weide, “‘Merit hat 4 von 5 Subtraktionsaufgaben durch Rückwärtszählen
gelöst’. Leistungsbeurteilung im inklusiven Mathematikunterricht,” Sonderpädagogische
Förderung heute, vol. 4, no. 61, pp. 356–368, 2016.
mla: Häsel-Weide, Uta. “‘Merit hat 4 von 5 Subtraktionsaufgaben durch Rückwärtszählen
gelöst’. Leistungsbeurteilung im inklusiven Mathematikunterricht.” Sonderpädagogische
Förderung heute, vol. 4, no. 61, 2016, pp. 356–68.
short: U. Häsel-Weide, Sonderpädagogische Förderung heute 4 (2016) 356–368.
date_created: 2022-06-08T07:48:03Z
date_updated: 2022-06-08T07:48:08Z
department:
- _id: '98'
- _id: '543'
intvolume: ' 4'
issue: '61'
language:
- iso: ger
page: 356-368
publication: Sonderpädagogische Förderung heute
publication_status: published
status: public
title: '"Merit hat 4 von 5 Subtraktionsaufgaben durch Rückwärtszählen gelöst". Leistungsbeurteilung
im inklusiven Mathematikunterricht'
type: journal_article
user_id: '85821'
volume: 4
year: '2016'
...
---
_id: '31825'
author:
- first_name: Sandra
full_name: Ballweg, Sandra
id: '94512'
last_name: Ballweg
- first_name: Carmen
full_name: Kuhn, Carmen
last_name: Kuhn
- first_name: Lisa
full_name: Hertweck, Lisa
last_name: Hertweck
citation:
ama: 'Ballweg S, Kuhn C, Hertweck L. Schreiberfahrung von Studierenden aus verschiedenen
Fächergruppen und deren wahrgenommener Unterstützungsbedarf beim akademischen
Schreiben. Ergebnisse einer Querschnittsstudie. In: Ballweg S, ed. Schreibberatung
und Schreibförderung. Impulse aus Theorie, Empirie und Praxis. Lang; 2016:137-172.'
apa: Ballweg, S., Kuhn, C., & Hertweck, L. (2016). Schreiberfahrung von Studierenden
aus verschiedenen Fächergruppen und deren wahrgenommener Unterstützungsbedarf
beim akademischen Schreiben. Ergebnisse einer Querschnittsstudie. In S. Ballweg
(Ed.), Schreibberatung und Schreibförderung. Impulse aus Theorie, Empirie und
Praxis (pp. 137–172). Lang.
bibtex: '@inbook{Ballweg_Kuhn_Hertweck_2016, place={Frankfurt}, title={Schreiberfahrung
von Studierenden aus verschiedenen Fächergruppen und deren wahrgenommener Unterstützungsbedarf
beim akademischen Schreiben. Ergebnisse einer Querschnittsstudie}, booktitle={Schreibberatung
und Schreibförderung. Impulse aus Theorie, Empirie und Praxis}, publisher={Lang},
author={Ballweg, Sandra and Kuhn, Carmen and Hertweck, Lisa}, editor={Ballweg,
Sandra}, year={2016}, pages={137–172} }'
chicago: 'Ballweg, Sandra, Carmen Kuhn, and Lisa Hertweck. “Schreiberfahrung von
Studierenden aus verschiedenen Fächergruppen und deren wahrgenommener Unterstützungsbedarf
beim akademischen Schreiben. Ergebnisse einer Querschnittsstudie.” In Schreibberatung
und Schreibförderung. Impulse aus Theorie, Empirie und Praxis, edited by Sandra
Ballweg, 137–72. Frankfurt: Lang, 2016.'
ieee: 'S. Ballweg, C. Kuhn, and L. Hertweck, “Schreiberfahrung von Studierenden
aus verschiedenen Fächergruppen und deren wahrgenommener Unterstützungsbedarf
beim akademischen Schreiben. Ergebnisse einer Querschnittsstudie,” in Schreibberatung
und Schreibförderung. Impulse aus Theorie, Empirie und Praxis, S. Ballweg,
Ed. Frankfurt: Lang, 2016, pp. 137–172.'
mla: Ballweg, Sandra, et al. “Schreiberfahrung von Studierenden aus verschiedenen
Fächergruppen und deren wahrgenommener Unterstützungsbedarf beim akademischen
Schreiben. Ergebnisse einer Querschnittsstudie.” Schreibberatung und Schreibförderung.
Impulse aus Theorie, Empirie und Praxis, edited by Sandra Ballweg, Lang, 2016,
pp. 137–72.
short: 'S. Ballweg, C. Kuhn, L. Hertweck, in: S. Ballweg (Ed.), Schreibberatung
und Schreibförderung. Impulse aus Theorie, Empirie und Praxis, Lang, Frankfurt,
2016, pp. 137–172.'
date_created: 2022-06-08T12:24:10Z
date_updated: 2022-06-08T12:24:29Z
department:
- _id: '468'
editor:
- first_name: Sandra
full_name: Ballweg, Sandra
last_name: Ballweg
language:
- iso: ger
page: 137-172
place: Frankfurt
publication: Schreibberatung und Schreibförderung. Impulse aus Theorie, Empirie und
Praxis
publisher: Lang
status: public
title: Schreiberfahrung von Studierenden aus verschiedenen Fächergruppen und deren
wahrgenommener Unterstützungsbedarf beim akademischen Schreiben. Ergebnisse einer
Querschnittsstudie
type: book_chapter
user_id: '21240'
year: '2016'
...
---
_id: '31824'
author:
- first_name: Sandra
full_name: Ballweg, Sandra
id: '94512'
last_name: Ballweg
citation:
ama: 'Ballweg S. Portfolios as a means of developing and assessing writing skills.
In: Göpferich S, Neumann I, Sing C, eds. Developing and Assessing Academic
Writing Skills. Lang; 2016:143-172.'
apa: Ballweg, S. (2016). Portfolios as a means of developing and assessing writing
skills. In S. Göpferich, I. Neumann, & C. Sing (Eds.), Developing and Assessing
Academic Writing Skills (pp. 143–172). Lang.
bibtex: '@inbook{Ballweg_2016, place={Frankfurt}, title={Portfolios as a means of
developing and assessing writing skills}, booktitle={Developing and Assessing
Academic Writing Skills}, publisher={Lang}, author={Ballweg, Sandra}, editor={Göpferich,
Susanne and Neumann, Imke and Sing, Christine}, year={2016}, pages={143–172} }'
chicago: 'Ballweg, Sandra. “Portfolios as a Means of Developing and Assessing Writing
Skills.” In Developing and Assessing Academic Writing Skills, edited by
Susanne Göpferich, Imke Neumann, and Christine Sing, 143–72. Frankfurt: Lang,
2016.'
ieee: 'S. Ballweg, “Portfolios as a means of developing and assessing writing skills,”
in Developing and Assessing Academic Writing Skills, S. Göpferich, I. Neumann,
and C. Sing, Eds. Frankfurt: Lang, 2016, pp. 143–172.'
mla: Ballweg, Sandra. “Portfolios as a Means of Developing and Assessing Writing
Skills.” Developing and Assessing Academic Writing Skills, edited by Susanne
Göpferich et al., Lang, 2016, pp. 143–72.
short: 'S. Ballweg, in: S. Göpferich, I. Neumann, C. Sing (Eds.), Developing and
Assessing Academic Writing Skills, Lang, Frankfurt, 2016, pp. 143–172.'
date_created: 2022-06-08T11:01:26Z
date_updated: 2022-06-08T11:01:40Z
department:
- _id: '468'
editor:
- first_name: Susanne
full_name: Göpferich, Susanne
last_name: Göpferich
- first_name: Imke
full_name: Neumann, Imke
last_name: Neumann
- first_name: Christine
full_name: Sing, Christine
last_name: Sing
language:
- iso: eng
page: 143-172
place: Frankfurt
publication: Developing and Assessing Academic Writing Skills
publisher: Lang
status: public
title: Portfolios as a means of developing and assessing writing skills
type: book_chapter
user_id: '21240'
year: '2016'
...
---
_id: '32054'
citation:
ama: Benholz C, Frank M, Niederhaus C, eds. Neu zugewanderte Schülerinnen und
Schüler – eine Gruppe mit besonderen Potentialen. Beiträge aus Forschung und Schulpraxis.
Waxmann Verlag; 2016.
apa: Benholz, C., Frank, M., & Niederhaus, C. (Eds.). (2016). Neu zugewanderte
Schülerinnen und Schüler – eine Gruppe mit besonderen Potentialen. Beiträge aus
Forschung und Schulpraxis. Waxmann Verlag.
bibtex: '@book{Benholz_Frank_Niederhaus_2016, place={Münster}, title={Neu zugewanderte
Schülerinnen und Schüler – eine Gruppe mit besonderen Potentialen. Beiträge aus
Forschung und Schulpraxis}, publisher={Waxmann Verlag}, year={2016} }'
chicago: 'Benholz, Claudia, Magnus Frank, and Constanze Niederhaus, eds. Neu
zugewanderte Schülerinnen und Schüler – eine Gruppe mit besonderen Potentialen.
Beiträge aus Forschung und Schulpraxis. Münster: Waxmann Verlag, 2016.'
ieee: 'C. Benholz, M. Frank, and C. Niederhaus, Eds., Neu zugewanderte Schülerinnen
und Schüler – eine Gruppe mit besonderen Potentialen. Beiträge aus Forschung und
Schulpraxis. Münster: Waxmann Verlag, 2016.'
mla: Benholz, Claudia, et al., editors. Neu zugewanderte Schülerinnen und Schüler
– eine Gruppe mit besonderen Potentialen. Beiträge aus Forschung und Schulpraxis.
Waxmann Verlag, 2016.
short: C. Benholz, M. Frank, C. Niederhaus, eds., Neu zugewanderte Schülerinnen
und Schüler – eine Gruppe mit besonderen Potentialen. Beiträge aus Forschung und
Schulpraxis, Waxmann Verlag, Münster, 2016.
date_created: 2022-06-20T09:40:46Z
date_updated: 2022-06-20T09:40:54Z
department:
- _id: '468'
editor:
- first_name: Claudia
full_name: Benholz, Claudia
last_name: Benholz
- first_name: Magnus
full_name: Frank, Magnus
last_name: Frank
- first_name: Constanze
full_name: Niederhaus, Constanze
id: '54999'
last_name: Niederhaus
language:
- iso: ger
place: Münster
publisher: Waxmann Verlag
status: public
title: Neu zugewanderte Schülerinnen und Schüler – eine Gruppe mit besonderen Potentialen.
Beiträge aus Forschung und Schulpraxis
type: book_editor
user_id: '21240'
year: '2016'
...
---
_id: '32076'
author:
- first_name: Beate
full_name: Frenzel, Beate
last_name: Frenzel
- first_name: Constanze
full_name: Niederhaus, Constanze
id: '54999'
last_name: Niederhaus
citation:
ama: Frenzel B, Niederhaus C. Unterrichten in Internationalen Förderklassen am Berufskolleg
in Nordrhein-Westfalen (NRW). Die berufsbildende Schule (68). Published
online 2016:181-184.
apa: Frenzel, B., & Niederhaus, C. (2016). Unterrichten in Internationalen Förderklassen
am Berufskolleg in Nordrhein-Westfalen (NRW). Die berufsbildende Schule (68),
181–184.
bibtex: '@article{Frenzel_Niederhaus_2016, title={Unterrichten in Internationalen
Förderklassen am Berufskolleg in Nordrhein-Westfalen (NRW)}, journal={Die berufsbildende
Schule (68)}, author={Frenzel, Beate and Niederhaus, Constanze}, year={2016},
pages={181–184} }'
chicago: Frenzel, Beate, and Constanze Niederhaus. “Unterrichten in Internationalen
Förderklassen am Berufskolleg in Nordrhein-Westfalen (NRW).” Die berufsbildende
Schule (68), 2016, 181–84.
ieee: B. Frenzel and C. Niederhaus, “Unterrichten in Internationalen Förderklassen
am Berufskolleg in Nordrhein-Westfalen (NRW),” Die berufsbildende Schule (68),
pp. 181–184, 2016.
mla: Frenzel, Beate, and Constanze Niederhaus. “Unterrichten in Internationalen
Förderklassen am Berufskolleg in Nordrhein-Westfalen (NRW).” Die berufsbildende
Schule (68), 2016, pp. 181–84.
short: B. Frenzel, C. Niederhaus, Die berufsbildende Schule (68) (2016) 181–184.
date_created: 2022-06-20T12:28:45Z
date_updated: 2022-06-20T12:28:51Z
department:
- _id: '468'
language:
- iso: ger
page: 181-184
publication: Die berufsbildende Schule (68)
status: public
title: Unterrichten in Internationalen Förderklassen am Berufskolleg in Nordrhein-Westfalen
(NRW)
type: journal_article
user_id: '21240'
year: '2016'
...
---
_id: '32077'
author:
- first_name: Beate
full_name: Frenzel, Beate
last_name: Frenzel
- first_name: Constanze
full_name: Niederhaus, Constanze
id: '54999'
last_name: Niederhaus
- first_name: Corinna
full_name: Peschel, Corinna
last_name: Peschel
- first_name: Ann-Kristin
full_name: Rüther, Ann-Kristin
last_name: Rüther
citation:
ama: 'Frenzel B, Niederhaus C, Peschel C, Rüther A-K. „In unserer Schule sind alle
im Grunde ins kalte Wasser gesprungen und alle sind nach ´ner Weile belohnt worden
durch große Erfolge.“ Interviews mit Lehrerinnen und Lehrern zu den Besonderheiten
des Unterrichtens neu zugewanderter Schülerinnen und Schüler. In: Benholz C, Frank
M, Niederhaus C, eds. Neu zugewanderte Schülerinnen und Schüler – eine Gruppe
mit besonderen Potentialen. Beiträge aus Forschung und Schulpraxis. Waxmann
Verlag; 2016:171-196.'
apa: Frenzel, B., Niederhaus, C., Peschel, C., & Rüther, A.-K. (2016). „In unserer
Schule sind alle im Grunde ins kalte Wasser gesprungen und alle sind nach ´ner
Weile belohnt worden durch große Erfolge.“ Interviews mit Lehrerinnen und Lehrern
zu den Besonderheiten des Unterrichtens neu zugewanderter Schülerinnen und Schüler.
In C. Benholz, M. Frank, & C. Niederhaus (Eds.), Neu zugewanderte Schülerinnen
und Schüler – eine Gruppe mit besonderen Potentialen. Beiträge aus Forschung und
Schulpraxis (pp. 171–196). Waxmann Verlag.
bibtex: '@inbook{Frenzel_Niederhaus_Peschel_Rüther_2016, place={Münster}, title={„In
unserer Schule sind alle im Grunde ins kalte Wasser gesprungen und alle sind nach
´ner Weile belohnt worden durch große Erfolge.“ Interviews mit Lehrerinnen und
Lehrern zu den Besonderheiten des Unterrichtens neu zugewanderter Schülerinnen
und Schüler}, booktitle={Neu zugewanderte Schülerinnen und Schüler – eine Gruppe
mit besonderen Potentialen. Beiträge aus Forschung und Schulpraxis}, publisher={Waxmann
Verlag}, author={Frenzel, Beate and Niederhaus, Constanze and Peschel, Corinna
and Rüther, Ann-Kristin}, editor={Benholz, Claudia and Frank, Magnus and Niederhaus,
Constanze}, year={2016}, pages={171–196} }'
chicago: 'Frenzel, Beate, Constanze Niederhaus, Corinna Peschel, and Ann-Kristin
Rüther. “„In unserer Schule sind alle im Grunde ins kalte Wasser gesprungen und
alle sind nach ´ner Weile belohnt worden durch große Erfolge.“ Interviews mit
Lehrerinnen und Lehrern zu den Besonderheiten des Unterrichtens neu zugewanderter
Schülerinnen und Schüler.” In Neu zugewanderte Schülerinnen und Schüler – eine
Gruppe mit besonderen Potentialen. Beiträge aus Forschung und Schulpraxis,
edited by Claudia Benholz, Magnus Frank, and Constanze Niederhaus, 171–96. Münster:
Waxmann Verlag, 2016.'
ieee: 'B. Frenzel, C. Niederhaus, C. Peschel, and A.-K. Rüther, “„In unserer Schule
sind alle im Grunde ins kalte Wasser gesprungen und alle sind nach ´ner Weile
belohnt worden durch große Erfolge.“ Interviews mit Lehrerinnen und Lehrern zu
den Besonderheiten des Unterrichtens neu zugewanderter Schülerinnen und Schüler,”
in Neu zugewanderte Schülerinnen und Schüler – eine Gruppe mit besonderen Potentialen.
Beiträge aus Forschung und Schulpraxis, C. Benholz, M. Frank, and C. Niederhaus,
Eds. Münster: Waxmann Verlag, 2016, pp. 171–196.'
mla: Frenzel, Beate, et al. “„In unserer Schule sind alle im Grunde ins kalte Wasser
gesprungen und alle sind nach ´ner Weile belohnt worden durch große Erfolge.“
Interviews mit Lehrerinnen und Lehrern zu den Besonderheiten des Unterrichtens
neu zugewanderter Schülerinnen und Schüler.” Neu zugewanderte Schülerinnen
und Schüler – eine Gruppe mit besonderen Potentialen. Beiträge aus Forschung und
Schulpraxis, edited by Claudia Benholz et al., Waxmann Verlag, 2016, pp. 171–96.
short: 'B. Frenzel, C. Niederhaus, C. Peschel, A.-K. Rüther, in: C. Benholz, M.
Frank, C. Niederhaus (Eds.), Neu zugewanderte Schülerinnen und Schüler – eine
Gruppe mit besonderen Potentialen. Beiträge aus Forschung und Schulpraxis, Waxmann
Verlag, Münster, 2016, pp. 171–196.'
date_created: 2022-06-20T12:32:16Z
date_updated: 2022-06-20T12:32:32Z
department:
- _id: '468'
editor:
- first_name: Claudia
full_name: Benholz, Claudia
last_name: Benholz
- first_name: Magnus
full_name: Frank, Magnus
last_name: Frank
- first_name: Constanze
full_name: Niederhaus, Constanze
last_name: Niederhaus
language:
- iso: ger
page: 171-196
place: Münster
publication: Neu zugewanderte Schülerinnen und Schüler – eine Gruppe mit besonderen
Potentialen. Beiträge aus Forschung und Schulpraxis
publisher: Waxmann Verlag
status: public
title: „In unserer Schule sind alle im Grunde ins kalte Wasser gesprungen und alle
sind nach ´ner Weile belohnt worden durch große Erfolge.“ Interviews mit Lehrerinnen
und Lehrern zu den Besonderheiten des Unterrichtens neu zugewanderter Schülerinnen
und Schüler
type: book_chapter
user_id: '21240'
year: '2016'
...