---
_id: '247'
abstract:
- lang: eng
text: 'Multi-rooted trees are becoming the norm for modern data-center networks.
In these networks, scalable flow routing is challenging owing to vast number of
flows. Current approaches either employ a central controller that can have scalability
issues or a scalable decentralized algorithm only considering local information.
In this paper we present a new decentralized approach to least-congested path
routing in software-defined data center networks that has neither of these issues:
By duplicating the initial (or SYN) packet of a flow and estimating the data rate
of multiple flows in parallel, we exploit TCP’s habit to fill buffers to find
the least congested path. We show that our algorithm significantly improves flow
completion time without the need for a central controller or specialized hardware.'
author:
- first_name: Arne
full_name: Schwabe, Arne
last_name: Schwabe
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: 'Schwabe A, Karl H. SynRace: Decentralized Load-Adaptive Multi-path Routing
without Collecting Statistics. In: Proceedings of the 4th European Workshop
on Software Defined Networks (EWSDN 2015). ; 2015:37-42. doi:10.1109/EWSDN.2015.58'
apa: 'Schwabe, A., & Karl, H. (2015). SynRace: Decentralized Load-Adaptive Multi-path
Routing without Collecting Statistics. In Proceedings of the 4th European Workshop
on Software Defined Networks (EWSDN 2015) (pp. 37–42). https://doi.org/10.1109/EWSDN.2015.58'
bibtex: '@inproceedings{Schwabe_Karl_2015, title={SynRace: Decentralized Load-Adaptive
Multi-path Routing without Collecting Statistics}, DOI={10.1109/EWSDN.2015.58},
booktitle={Proceedings of the 4th European Workshop on Software Defined Networks
(EWSDN 2015)}, author={Schwabe, Arne and Karl, Holger}, year={2015}, pages={37–42}
}'
chicago: 'Schwabe, Arne, and Holger Karl. “SynRace: Decentralized Load-Adaptive
Multi-Path Routing without Collecting Statistics.” In Proceedings of the 4th
European Workshop on Software Defined Networks (EWSDN 2015), 37–42, 2015.
https://doi.org/10.1109/EWSDN.2015.58.'
ieee: 'A. Schwabe and H. Karl, “SynRace: Decentralized Load-Adaptive Multi-path
Routing without Collecting Statistics,” in Proceedings of the 4th European
Workshop on Software Defined Networks (EWSDN 2015), 2015, pp. 37–42.'
mla: 'Schwabe, Arne, and Holger Karl. “SynRace: Decentralized Load-Adaptive Multi-Path
Routing without Collecting Statistics.” Proceedings of the 4th European Workshop
on Software Defined Networks (EWSDN 2015), 2015, pp. 37–42, doi:10.1109/EWSDN.2015.58.'
short: 'A. Schwabe, H. Karl, in: Proceedings of the 4th European Workshop on Software
Defined Networks (EWSDN 2015), 2015, pp. 37–42.'
date_created: 2017-10-17T12:41:40Z
date_updated: 2022-01-06T06:56:32Z
ddc:
- '040'
department:
- _id: '75'
doi: 10.1109/EWSDN.2015.58
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T09:46:21Z
date_updated: 2018-03-21T09:46:21Z
file_id: '1491'
file_name: 247-07313613.pdf
file_size: 277574
relation: main_file
success: 1
file_date_updated: 2018-03-21T09:46:21Z
has_accepted_license: '1'
page: 37-42
project:
- _id: '1'
name: SFB 901
- _id: '6'
name: SFB 901 - Subprojekt A2
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 4th European Workshop on Software Defined Networks
(EWSDN 2015)
status: public
title: 'SynRace: Decentralized Load-Adaptive Multi-path Routing without Collecting
Statistics'
type: conference
user_id: '15504'
year: '2015'
...
---
_id: '261'
author:
- first_name: Thorsten
full_name: Eisenhofer, Thorsten
last_name: Eisenhofer
citation:
ama: Eisenhofer T. Protokolle zur authentifizierten Schüsselvereinbarung.
Universität Paderborn; 2015.
apa: Eisenhofer, T. (2015). Protokolle zur authentifizierten Schüsselvereinbarung.
Universität Paderborn.
bibtex: '@book{Eisenhofer_2015, title={Protokolle zur authentifizierten Schüsselvereinbarung},
publisher={Universität Paderborn}, author={Eisenhofer, Thorsten}, year={2015}
}'
chicago: Eisenhofer, Thorsten. Protokolle zur authentifizierten Schüsselvereinbarung.
Universität Paderborn, 2015.
ieee: T. Eisenhofer, Protokolle zur authentifizierten Schüsselvereinbarung.
Universität Paderborn, 2015.
mla: Eisenhofer, Thorsten. Protokolle zur authentifizierten Schüsselvereinbarung.
Universität Paderborn, 2015.
short: T. Eisenhofer, Protokolle zur authentifizierten Schüsselvereinbarung, Universität
Paderborn, 2015.
date_created: 2017-10-17T12:41:43Z
date_updated: 2022-01-06T06:57:16Z
department:
- _id: '64'
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
title: Protokolle zur authentifizierten Schüsselvereinbarung
type: bachelorsthesis
user_id: '477'
year: '2015'
...
---
_id: '262'
abstract:
- lang: eng
text: Programs from Proofs" is a generic method which generates new programs out
of correctness proofs of given programs. The technique ensures that the new and
given program are behaviorally equivalent and that the new program is easily verifiable,
thus serving as an alternative to proof-carrying code concepts. So far, this generic
method has one instantiation that verifies type-state properties of programs.
In this paper, we present a whole range of new instantiations, all based on data
ow analyses. More precisely, we show how an imprecise but fast data ow analysis
can be enhanced with a predicate analysis as to yield a precise but expensive
analysis. Out of the safety proofs of this analysis, we generate new programs,
again behaviorally equivalent to the given ones, which are easily verifiable"
in the sense that now the data ow analysis alone can yield precise results. An
experimental evaluation practically supports our claim of easy verification.
author:
- first_name: Marie-Christine
full_name: Jakobs, Marie-Christine
last_name: Jakobs
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Jakobs M-C, Wehrheim H. Programs from Proofs of Predicated Dataflow Analyses.
In: Proceedings of the 30th Annual ACM Symposium on Applied Computing.
SAC ’15. ; 2015:1729-1736. doi:10.1145/2695664.2695690'
apa: Jakobs, M.-C., & Wehrheim, H. (2015). Programs from Proofs of Predicated
Dataflow Analyses. In Proceedings of the 30th Annual ACM Symposium on Applied
Computing (pp. 1729–1736). https://doi.org/10.1145/2695664.2695690
bibtex: '@inproceedings{Jakobs_Wehrheim_2015, series={SAC ’15}, title={Programs
from Proofs of Predicated Dataflow Analyses}, DOI={10.1145/2695664.2695690},
booktitle={Proceedings of the 30th Annual ACM Symposium on Applied Computing},
author={Jakobs, Marie-Christine and Wehrheim, Heike}, year={2015}, pages={1729–1736},
collection={SAC ’15} }'
chicago: Jakobs, Marie-Christine, and Heike Wehrheim. “Programs from Proofs of Predicated
Dataflow Analyses.” In Proceedings of the 30th Annual ACM Symposium on Applied
Computing, 1729–36. SAC ’15, 2015. https://doi.org/10.1145/2695664.2695690.
ieee: M.-C. Jakobs and H. Wehrheim, “Programs from Proofs of Predicated Dataflow
Analyses,” in Proceedings of the 30th Annual ACM Symposium on Applied Computing,
2015, pp. 1729–1736.
mla: Jakobs, Marie-Christine, and Heike Wehrheim. “Programs from Proofs of Predicated
Dataflow Analyses.” Proceedings of the 30th Annual ACM Symposium on Applied
Computing, 2015, pp. 1729–36, doi:10.1145/2695664.2695690.
short: 'M.-C. Jakobs, H. Wehrheim, in: Proceedings of the 30th Annual ACM Symposium
on Applied Computing, 2015, pp. 1729–1736.'
date_created: 2017-10-17T12:41:43Z
date_updated: 2022-01-06T06:57:18Z
ddc:
- '040'
department:
- _id: '77'
doi: 10.1145/2695664.2695690
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T09:35:34Z
date_updated: 2018-03-21T09:35:34Z
file_id: '1483'
file_name: 262-mainSACfinal.pdf
file_size: 554583
relation: main_file
success: 1
file_date_updated: 2018-03-21T09:35:34Z
has_accepted_license: '1'
language:
- iso: eng
page: 1729-1736
project:
- _id: '1'
name: SFB 901
- _id: '12'
name: SFB 901 - Subprojekt B4
- _id: '3'
name: SFB 901 - Project Area B
publication: Proceedings of the 30th Annual ACM Symposium on Applied Computing
series_title: SAC '15
status: public
title: Programs from Proofs of Predicated Dataflow Analyses
type: conference
user_id: '477'
year: '2015'
...
---
_id: '264'
author:
- first_name: Philip
full_name: Wette, Philip
last_name: Wette
citation:
ama: Wette P. Optimizing Software-Defined Networks Using Application-Layer Knowledge.
Universität Paderborn; 2015.
apa: Wette, P. (2015). Optimizing Software-Defined Networks using Application-Layer
Knowledge. Universität Paderborn.
bibtex: '@book{Wette_2015, title={Optimizing Software-Defined Networks using Application-Layer
Knowledge}, publisher={Universität Paderborn}, author={Wette, Philip}, year={2015}
}'
chicago: Wette, Philip. Optimizing Software-Defined Networks Using Application-Layer
Knowledge. Universität Paderborn, 2015.
ieee: P. Wette, Optimizing Software-Defined Networks using Application-Layer
Knowledge. Universität Paderborn, 2015.
mla: Wette, Philip. Optimizing Software-Defined Networks Using Application-Layer
Knowledge. Universität Paderborn, 2015.
short: P. Wette, Optimizing Software-Defined Networks Using Application-Layer Knowledge,
Universität Paderborn, 2015.
date_created: 2017-10-17T12:41:43Z
date_updated: 2022-01-06T06:57:20Z
ddc:
- '040'
department:
- _id: '75'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T09:34:36Z
date_updated: 2018-03-21T09:34:36Z
file_id: '1481'
file_name: 264-Dissertation_-_Wette.pdf
file_size: 8031107
relation: main_file
success: 1
file_date_updated: 2018-03-21T09:34:36Z
has_accepted_license: '1'
project:
- _id: '1'
name: SFB 901
- _id: '6'
name: SFB 901 - Subprojekt A2
- _id: '16'
name: SFB 901 - Subprojekt C4
- _id: '2'
name: SFB 901 - Project Area A
- _id: '4'
name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
title: Optimizing Software-Defined Networks using Application-Layer Knowledge
type: dissertation
user_id: '477'
year: '2015'
...
---
_id: '26446'
author:
- first_name: Hans
full_name: Pongratz, Hans
last_name: Pongratz
- first_name: Reinhard
full_name: Keil, Reinhard
last_name: Keil
citation:
ama: Pongratz H, Keil R. DeLFI 2015 - The 13th e-Learning Conference on Computer
Science of the E-Learning Section of the Society for Computer Science EV.
Koellen Druck + Verlag GmbH; 2015.
apa: Pongratz, H., & Keil, R. (2015). DeLFI 2015 - The 13th e-Learning Conference
on Computer Science of the E-Learning Section of the Society for Computer Science
eV. Koellen Druck + Verlag GmbH.
bibtex: '@book{Pongratz_Keil_2015, series={GI-Edition Lecture Notes in Informatics
(LNI)}, title={DeLFI 2015 - The 13th e-Learning Conference on Computer Science
of the E-Learning Section of the Society for Computer Science eV}, publisher={Koellen
Druck + Verlag GmbH}, author={Pongratz, Hans and Keil, Reinhard}, year={2015},
collection={GI-Edition Lecture Notes in Informatics (LNI)} }'
chicago: Pongratz, Hans, and Reinhard Keil. DeLFI 2015 - The 13th e-Learning
Conference on Computer Science of the E-Learning Section of the Society for Computer
Science EV. GI-Edition Lecture Notes in Informatics (LNI). Koellen Druck +
Verlag GmbH, 2015.
ieee: H. Pongratz and R. Keil, DeLFI 2015 - The 13th e-Learning Conference on
Computer Science of the E-Learning Section of the Society for Computer Science
eV. Koellen Druck + Verlag GmbH, 2015.
mla: Pongratz, Hans, and Reinhard Keil. DeLFI 2015 - The 13th e-Learning Conference
on Computer Science of the E-Learning Section of the Society for Computer Science
EV. Koellen Druck + Verlag GmbH, 2015.
short: H. Pongratz, R. Keil, DeLFI 2015 - The 13th e-Learning Conference on Computer
Science of the E-Learning Section of the Society for Computer Science EV, Koellen
Druck + Verlag GmbH, 2015.
date_created: 2021-10-18T20:52:45Z
date_updated: 2022-01-06T06:57:21Z
department:
- _id: '71'
language:
- iso: eng
publication_status: published
publisher: Koellen Druck + Verlag GmbH
series_title: GI-Edition Lecture Notes in Informatics (LNI)
status: public
title: DeLFI 2015 - The 13th e-Learning Conference on Computer Science of the E-Learning
Section of the Society for Computer Science eV
type: book
user_id: '71124'
year: '2015'
...
---
_id: '26449'
alternative_title:
- 20 years of learning with the World Wide Web - technology and education in dialogue
author:
- first_name: Felix
full_name: Winkelnkemper, Felix
id: '3117'
last_name: Winkelnkemper
- first_name: Andreas
full_name: Oberhoff, Andreas
last_name: Oberhoff
citation:
ama: 'Winkelnkemper F, Oberhoff A. WebArena - R {\ “a} spacious structures for {\”
u} r the learning locations of the future. In: wedge R, Selke H, eds. Vol 330.
Publication series of the Heinz Nixdorf Institute, Paderborn; 2015:103-117.'
apa: Winkelnkemper, F., & Oberhoff, A. (2015). WebArena - R {\ “a} spacious
structures for {\” u} r the learning locations of the future (R. wedge &
H. Selke, Eds.; Vol. 330, pp. 103–117). Publication series of the Heinz Nixdorf
Institute, Paderborn.
bibtex: '@inproceedings{Winkelnkemper_Oberhoff_2015, title={WebArena - R {\ “a}
spacious structures for {\” u} r the learning locations of the future}, volume={330},
publisher={Publication series of the Heinz Nixdorf Institute, Paderborn}, author={Winkelnkemper,
Felix and Oberhoff, Andreas}, editor={wedge, Reinhard and Selke, Harald}, year={2015},
pages={103–117} }'
chicago: Winkelnkemper, Felix, and Andreas Oberhoff. “WebArena - R {\ ‘A} Spacious
Structures for {\’ U} r the Learning Locations of the Future.” edited by Reinhard wedge
and Harald Selke, 330:103–17. Publication series of the Heinz Nixdorf Institute,
Paderborn, 2015.
ieee: F. Winkelnkemper and A. Oberhoff, “WebArena - R {\ ‘a} spacious structures
for {\’ u} r the learning locations of the future,” 2015, vol. 330, pp. 103–117.
mla: Winkelnkemper, Felix, and Andreas Oberhoff. WebArena - R {\ “A} Spacious
Structures for {\” U} r the Learning Locations of the Future. Edited by Reinhard wedge
and Harald Selke, vol. 330, Publication series of the Heinz Nixdorf Institute,
Paderborn, 2015, pp. 103–17.
short: 'F. Winkelnkemper, A. Oberhoff, in: R. wedge, H. Selke (Eds.), Publication
series of the Heinz Nixdorf Institute, Paderborn, 2015, pp. 103–117.'
date_created: 2021-10-18T20:56:42Z
date_updated: 2022-01-06T06:57:21Z
department:
- _id: '71'
editor:
- first_name: 'Reinhard '
full_name: 'wedge, Reinhard '
last_name: wedge
- first_name: Harald
full_name: Selke, Harald
last_name: Selke
intvolume: ' 330'
language:
- iso: eng
page: 103-117
publication_status: published
publisher: Publication series of the Heinz Nixdorf Institute, Paderborn
status: public
title: WebArena - R {\ "a} spacious structures for {\" u} r the learning locations
of the future
type: conference
user_id: '71124'
volume: 330
year: '2015'
...
---
_id: '26531'
citation:
ama: Keil R, Selke H, eds. 20 Years of Learning with the World Wide Web - Technology
and Education in Dialogue. Vol 330. publishing series of the Heinz Nixdorf
Institute, Paderborn; 2015.
apa: Keil, R., & Selke, H. (Eds.). (2015). 20 years of learning with the
World Wide Web - technology and education in dialogue (Vol. 330). publishing
series of the Heinz Nixdorf Institute, Paderborn.
bibtex: '@book{Keil_Selke_2015, series={Heinz publishing house series Nixdorf Institute,
Paderborn}, title={20 years of learning with the World Wide Web - technology and
education in dialogue}, volume={330}, publisher={publishing series of the Heinz
Nixdorf Institute, Paderborn}, year={2015}, collection={Heinz publishing house
series Nixdorf Institute, Paderborn} }'
chicago: Keil, Reinhard, and Harald Selke, eds. 20 Years of Learning with the
World Wide Web - Technology and Education in Dialogue. Vol. 330. Heinz Publishing
House Series Nixdorf Institute, Paderborn. publishing series of the Heinz Nixdorf
Institute, Paderborn, 2015.
ieee: R. Keil and H. Selke, Eds., 20 years of learning with the World Wide Web
- technology and education in dialogue, vol. 330. publishing series of the
Heinz Nixdorf Institute, Paderborn, 2015.
mla: Keil, Reinhard, and Harald Selke, editors. 20 Years of Learning with the
World Wide Web - Technology and Education in Dialogue. publishing series of
the Heinz Nixdorf Institute, Paderborn, 2015.
short: R. Keil, H. Selke, eds., 20 Years of Learning with the World Wide Web - Technology
and Education in Dialogue, publishing series of the Heinz Nixdorf Institute, Paderborn,
2015.
date_created: 2021-10-19T14:09:39Z
date_updated: 2022-01-06T06:57:22Z
department:
- _id: '71'
editor:
- first_name: Reinhard
full_name: Keil, Reinhard
last_name: Keil
- first_name: Harald
full_name: Selke, Harald
id: '497'
last_name: Selke
intvolume: ' 330'
language:
- iso: eng
publication_status: published
publisher: publishing series of the Heinz Nixdorf Institute, Paderborn
series_title: Heinz publishing house series Nixdorf Institute, Paderborn
status: public
title: 20 years of learning with the World Wide Web - technology and education in
dialogue
type: book_editor
user_id: '71124'
volume: 330
year: '2015'
...
---
_id: '26532'
alternative_title:
- 20 years of learning with the World Wide Web - technology and education in dialogue
author:
- first_name: 'Reinhard '
full_name: 'Keil, Reinhard '
last_name: Keil
- first_name: Harald
full_name: Selke, Harald
id: '497'
last_name: Selke
citation:
ama: 'Keil R, Selke H. Learn with, through and {\ "about the WWW. In: Keil R, Selke
H, eds. Vol 330. Publishing series of the Heinz Nixdorf Institute, Paderborn;
2015:1-7.'
apa: Keil, R., & Selke, H. (2015). Learn with, through and {\ "about the
WWW (R. Keil & H. Selke, Eds.; Vol. 330, pp. 1–7). Publishing series
of the Heinz Nixdorf Institute, Paderborn.
bibtex: '@inproceedings{Keil_Selke_2015, title={Learn with, through and {\ "about
the WWW}, volume={330}, publisher={Publishing series of the Heinz Nixdorf Institute,
Paderborn}, author={Keil, Reinhard and Selke, Harald}, editor={Keil, Reinhard
and Selke, Harald}, year={2015}, pages={1–7} }'
chicago: Keil, Reinhard , and Harald Selke. “Learn with, through and {\ "about the
WWW.” edited by Reinhard Keil and Harald Selke, 330:1–7. Publishing series of
the Heinz Nixdorf Institute, Paderborn, 2015.
ieee: R. Keil and H. Selke, “Learn with, through and {\ "about the WWW,” 2015, vol.
330, pp. 1–7.
mla: Keil, Reinhard, and Harald Selke. Learn with, through and {\ "about the
WWW. Edited by Reinhard Keil and Harald Selke, vol. 330, Publishing series
of the Heinz Nixdorf Institute, Paderborn, 2015, pp. 1–7.
short: 'R. Keil, H. Selke, in: R. Keil, H. Selke (Eds.), Publishing series of the
Heinz Nixdorf Institute, Paderborn, 2015, pp. 1–7.'
date_created: 2021-10-19T14:13:08Z
date_updated: 2022-01-06T06:57:22Z
department:
- _id: '71'
editor:
- first_name: Reinhard
full_name: Keil, Reinhard
last_name: Keil
- first_name: Harald
full_name: ' Selke, Harald'
last_name: ' Selke'
intvolume: ' 330'
language:
- iso: eng
page: 1-7
publication_status: published
publisher: Publishing series of the Heinz Nixdorf Institute, Paderborn
status: public
title: Learn with, through and {\ "about the WWW
type: conference
user_id: '71124'
volume: 330
year: '2015'
...
---
_id: '26533'
alternative_title:
- 20 years of learning with the World Wide Web - technology and education in dialogue
author:
- first_name: 'Reinhard '
full_name: 'Keil, Reinhard '
last_name: Keil
- first_name: Harald
full_name: Selke, Harald
id: '497'
last_name: Selke
citation:
ama: 'Keil R, Selke H. Virtual knowledge {\ “a} ume - From the presentation of content
to virtual learning {\” a} tten. In: Keil R, Selke H, eds. Vol 330. publishing
series of the Heinz Nixdorf Institute, Paderborn; 2015:39-53.'
apa: Keil, R., & Selke, H. (2015). Virtual knowledge {\ “a} ume - From the
presentation of content to virtual learning {\” a} tten (R. Keil & H.
Selke, Eds.; Vol. 330, pp. 39–53). publishing series of the Heinz Nixdorf Institute,
Paderborn.
bibtex: '@inproceedings{Keil_Selke_2015, title={Virtual knowledge {\ “a} ume - From
the presentation of content to virtual learning {\” a} tten}, volume={330}, publisher={publishing
series of the Heinz Nixdorf Institute, Paderborn}, author={Keil, Reinhard and
Selke, Harald}, editor={Keil, Reinhard and Selke, Harald}, year={2015}, pages={39–53}
}'
chicago: Keil, Reinhard , and Harald Selke. “Virtual Knowledge {\ ‘A} Ume - From
the Presentation of Content to Virtual Learning {\’ A} Tten.” edited by Reinhard
Keil and Harald Selke, 330:39–53. publishing series of the Heinz Nixdorf Institute,
Paderborn, 2015.
ieee: R. Keil and H. Selke, “Virtual knowledge {\ ‘a} ume - From the presentation
of content to virtual learning {\’ a} tten,” 2015, vol. 330, pp. 39–53.
mla: Keil, Reinhard, and Harald Selke. Virtual Knowledge {\ “A} Ume - From the
Presentation of Content to Virtual Learning {\” A} Tten. Edited by Reinhard
Keil and Harald Selke, vol. 330, publishing series of the Heinz Nixdorf Institute,
Paderborn, 2015, pp. 39–53.
short: 'R. Keil, H. Selke, in: R. Keil, H. Selke (Eds.), publishing series of the
Heinz Nixdorf Institute, Paderborn, 2015, pp. 39–53.'
date_created: 2021-10-19T14:19:23Z
date_updated: 2022-01-06T06:57:22Z
department:
- _id: '71'
editor:
- first_name: Reinhard
full_name: Keil, Reinhard
last_name: Keil
- first_name: Harald
full_name: Selke, Harald
last_name: Selke
intvolume: ' 330'
language:
- iso: eng
page: 39-53
publication_status: published
publisher: publishing series of the Heinz Nixdorf Institute, Paderborn
status: public
title: Virtual knowledge {\ "a} ume - From the presentation of content to virtual
learning {\" a} tten
type: conference
user_id: '71124'
volume: 330
year: '2015'
...
---
_id: '26534'
author:
- first_name: Florian
full_name: Klompmaker, Florian
last_name: Klompmaker
citation:
ama: Klompmaker F. Development of a Structured Process of Interaction Design
for {\ “U} r Nat {\” U} Local User Interfaces. Universitaetsbibliothek Paderborn;
2015.
apa: Klompmaker, F. (2015). Development of a structured process of interaction
design for {\ “u} r nat {\” u} local user interfaces. Universitaetsbibliothek
Paderborn.
bibtex: '@book{Klompmaker_2015, place={Universit {\ "a} t Paderborn, Heinz Nixdorf
Institute, Contextual Computer Science}, title={Development of a structured process
of interaction design for {\ “u} r nat {\” u} local user interfaces}, publisher={Universitaetsbibliothek
Paderborn}, author={Klompmaker, Florian}, year={2015} }'
chicago: 'Klompmaker, Florian. Development of a Structured Process of Interaction
Design for {\ “U} r Nat {\” U} Local User Interfaces. Universit {\ "a} t Paderborn,
Heinz Nixdorf Institute, Contextual Computer Science: Universitaetsbibliothek
Paderborn, 2015.'
ieee: 'F. Klompmaker, Development of a structured process of interaction design
for {\ “u} r nat {\” u} local user interfaces. Universit {\ "a} t Paderborn,
Heinz Nixdorf Institute, Contextual Computer Science: Universitaetsbibliothek
Paderborn, 2015.'
mla: Klompmaker, Florian. Development of a Structured Process of Interaction
Design for {\ “U} r Nat {\” U} Local User Interfaces. Universitaetsbibliothek
Paderborn, 2015.
short: F. Klompmaker, Development of a Structured Process of Interaction Design
for {\ “U} r Nat {\” U} Local User Interfaces, Universitaetsbibliothek Paderborn,
Universit {\ "a} t Paderborn, Heinz Nixdorf Institute, Contextual Computer Science,
2015.
date_created: 2021-10-19T14:22:28Z
date_updated: 2022-01-06T06:57:22Z
department:
- _id: '71'
language:
- iso: eng
place: Universit {\ "a} t Paderborn, Heinz Nixdorf Institute, Contextual Computer
Science
publication_status: published
publisher: Universitaetsbibliothek Paderborn
status: public
title: Development of a structured process of interaction design for {\ "u} r nat
{\" u} local user interfaces
type: dissertation
user_id: '71124'
year: '2015'
...
---
_id: '26536'
abstract:
- lang: eng
text: "Patterns serve to codify design knowledge. By embedding them in a hypothesis-driven
design, it is possible to develop them further into sample languages. For this
it is necessary to resolve the underlying conflicts in the form of design hypotheses
and to validate them empirically in order to enable further use and generalization.
In this article, an experiment is presented that describes this procedure and
demonstrates the interplay between theory formation and codification of design
knowledge using two examples.\r\n"
author:
- first_name: Christian
full_name: Schild, Christian
last_name: Schild
- first_name: Vanessa
full_name: Petrausch, Vanessa
last_name: Petrausch
citation:
ama: 'Schild C, Petrausch V. Empirical validation of design patterns. In: Human
and Computer 2015 - Proceedings. De Gruyter Oldenbourg; 2015:173-182.'
apa: Schild, C., & Petrausch, V. (2015). Empirical validation of design patterns.
Human and Computer 2015 - Proceedings, 173–182.
bibtex: '@inproceedings{Schild_Petrausch_2015, place={Berlin}, title={Empirical
validation of design patterns}, booktitle={Human and Computer 2015 - Proceedings},
publisher={De Gruyter Oldenbourg}, author={Schild, Christian and Petrausch, Vanessa},
year={2015}, pages={173–182} }'
chicago: 'Schild, Christian, and Vanessa Petrausch. “Empirical Validation of Design
Patterns.” In Human and Computer 2015 - Proceedings, 173–82. Berlin: De
Gruyter Oldenbourg, 2015.'
ieee: C. Schild and V. Petrausch, “Empirical validation of design patterns,” in
Human and Computer 2015 - Proceedings, 2015, pp. 173–182.
mla: Schild, Christian, and Vanessa Petrausch. “Empirical Validation of Design Patterns.”
Human and Computer 2015 - Proceedings, De Gruyter Oldenbourg, 2015, pp.
173–82.
short: 'C. Schild, V. Petrausch, in: Human and Computer 2015 - Proceedings, De Gruyter
Oldenbourg, Berlin, 2015, pp. 173–182.'
date_created: 2021-10-19T14:28:44Z
date_updated: 2022-01-06T06:57:22Z
department:
- _id: '71'
language:
- iso: eng
page: 173-182
place: Berlin
publication: Human and Computer 2015 - Proceedings
publication_status: published
publisher: De Gruyter Oldenbourg
status: public
title: Empirical validation of design patterns
type: conference
user_id: '71124'
year: '2015'
...
---
_id: '266'
abstract:
- lang: eng
text: 'Many markets have seen a shift from the idea of buying and moved to leasing
instead. Arguably, the latter has been the major catalyst for their success. Ten
years ago, research realized this shift and initiated the study of "online leasing
problems" by introducing leasing to online optimization problems. Resources required
to provide a service in an "online leasing problem" are no more bought but leased
for different durations. In this paper, we provide an overview of results that
contribute to the understanding of "online resource leasing problems". '
author:
- 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
citation:
ama: 'Markarian C, Meyer auf der Heide F. Online Resource Leasing. In: Proceedings
of the 2015 ACM Symposium on Principles of Distributed Computing (PODC). ;
2015:343-344. doi:10.1145/2767386.2767454'
apa: Markarian, C., & Meyer auf der Heide, F. (2015). Online Resource Leasing.
In Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing
(PODC) (pp. 343–344). https://doi.org/10.1145/2767386.2767454
bibtex: '@inproceedings{Markarian_Meyer auf der Heide_2015, title={Online Resource
Leasing}, DOI={10.1145/2767386.2767454},
booktitle={Proceedings of the 2015 ACM Symposium on Principles of Distributed
Computing (PODC)}, author={Markarian, Christine and Meyer auf der Heide, Friedhelm},
year={2015}, pages={343–344} }'
chicago: Markarian, Christine, and Friedhelm Meyer auf der Heide. “Online Resource
Leasing.” In Proceedings of the 2015 ACM Symposium on Principles of Distributed
Computing (PODC), 343–44, 2015. https://doi.org/10.1145/2767386.2767454.
ieee: C. Markarian and F. Meyer auf der Heide, “Online Resource Leasing,” in Proceedings
of the 2015 ACM Symposium on Principles of Distributed Computing (PODC), 2015,
pp. 343–344.
mla: Markarian, Christine, and Friedhelm Meyer auf der Heide. “Online Resource Leasing.”
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing
(PODC), 2015, pp. 343–44, doi:10.1145/2767386.2767454.
short: 'C. Markarian, F. Meyer auf der Heide, in: Proceedings of the 2015 ACM Symposium
on Principles of Distributed Computing (PODC), 2015, pp. 343–344.'
date_created: 2017-10-17T12:41:44Z
date_updated: 2022-01-06T06:57:22Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1145/2767386.2767454
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T09:33:11Z
date_updated: 2018-03-21T09:33:11Z
file_id: '1478'
file_name: 266-p343-markarian.pdf
file_size: 679580
relation: main_file
success: 1
file_date_updated: 2018-03-21T09:33:11Z
has_accepted_license: '1'
page: 343-344
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: Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing
(PODC)
status: public
title: Online Resource Leasing
type: conference
user_id: '15504'
year: '2015'
...
---
_id: '267'
author:
- first_name: Christine
full_name: Markarian, Christine
id: '37612'
last_name: Markarian
citation:
ama: Markarian C. Online Resource Leasing. Universität Paderborn; 2015.
apa: Markarian, C. (2015). Online Resource Leasing. Universität Paderborn.
bibtex: '@book{Markarian_2015, title={Online Resource Leasing}, publisher={Universität
Paderborn}, author={Markarian, Christine}, year={2015} }'
chicago: Markarian, Christine. Online Resource Leasing. Universität Paderborn,
2015.
ieee: C. Markarian, Online Resource Leasing. Universität Paderborn, 2015.
mla: Markarian, Christine. Online Resource Leasing. Universität Paderborn,
2015.
short: C. Markarian, Online Resource Leasing, Universität Paderborn, 2015.
date_created: 2017-10-17T12:41:44Z
date_updated: 2022-01-06T06:57:26Z
ddc:
- '040'
department:
- _id: '63'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T09:33:41Z
date_updated: 2018-03-21T09:33:41Z
file_id: '1479'
file_name: 267-Dissertation_-_Markarian.pdf
file_size: 1328685
relation: main_file
success: 1
file_date_updated: 2018-03-21T09:33:41Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '16'
name: SFB 901 - Subprojekt C4
- _id: '4'
name: SFB 901 - Project Area C
publisher: Universität Paderborn
related_material:
link:
- relation: confirmation
url: http://nbn-resolving.de/urn:nbn:de:hbz:466:2-16656
status: public
supervisor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
title: Online Resource Leasing
type: dissertation
user_id: '15415'
year: '2015'
...
---
_id: '269'
abstract:
- lang: eng
text: Proof-carrying hardware is an approach that has recently been proposed for
the efficient verification of reconfigurable modules. We present an application
of proof-carrying hardware to guarantee the correct functionality of dynamically
reconfigured image processing modules. Our prototype comprises a reconfigurable-system-on-chip
with an embedded virtual FPGA fabric. This setup allows us to leverage open source
FPGA synthesis and backend tools to produce FPGA configuration bitstreams with
an open format and, thus, to demonstrate and experimentally evaluate proof-carrying
hardware at the bitstream level.
author:
- first_name: Tobias
full_name: Wiersema, Tobias
id: '3118'
last_name: Wiersema
- first_name: Sen
full_name: Wu, Sen
last_name: Wu
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
citation:
ama: 'Wiersema T, Wu S, Platzner M. On-The-Fly Verification of Reconfigurable Image
Processing Modules based on a Proof-Carrying Hardware Approach. In: Proceedings
of the International Symposium in Reconfigurable Computing (ARC). LNCS. ;
2015:365--372. doi:10.1007/978-3-319-16214-0_32'
apa: Wiersema, T., Wu, S., & Platzner, M. (2015). On-The-Fly Verification of
Reconfigurable Image Processing Modules based on a Proof-Carrying Hardware Approach.
In Proceedings of the International Symposium in Reconfigurable Computing (ARC)
(pp. 365--372). https://doi.org/10.1007/978-3-319-16214-0_32
bibtex: '@inproceedings{Wiersema_Wu_Platzner_2015, series={LNCS}, title={On-The-Fly
Verification of Reconfigurable Image Processing Modules based on a Proof-Carrying
Hardware Approach}, DOI={10.1007/978-3-319-16214-0_32},
booktitle={Proceedings of the International Symposium in Reconfigurable Computing
(ARC)}, author={Wiersema, Tobias and Wu, Sen and Platzner, Marco}, year={2015},
pages={365--372}, collection={LNCS} }'
chicago: Wiersema, Tobias, Sen Wu, and Marco Platzner. “On-The-Fly Verification
of Reconfigurable Image Processing Modules Based on a Proof-Carrying Hardware
Approach.” In Proceedings of the International Symposium in Reconfigurable
Computing (ARC), 365--372. LNCS, 2015. https://doi.org/10.1007/978-3-319-16214-0_32.
ieee: T. Wiersema, S. Wu, and M. Platzner, “On-The-Fly Verification of Reconfigurable
Image Processing Modules based on a Proof-Carrying Hardware Approach,” in Proceedings
of the International Symposium in Reconfigurable Computing (ARC), 2015, pp.
365--372.
mla: Wiersema, Tobias, et al. “On-The-Fly Verification of Reconfigurable Image Processing
Modules Based on a Proof-Carrying Hardware Approach.” Proceedings of the International
Symposium in Reconfigurable Computing (ARC), 2015, pp. 365--372, doi:10.1007/978-3-319-16214-0_32.
short: 'T. Wiersema, S. Wu, M. Platzner, in: Proceedings of the International Symposium
in Reconfigurable Computing (ARC), 2015, pp. 365--372.'
date_created: 2017-10-17T12:41:44Z
date_updated: 2022-01-06T06:57:30Z
ddc:
- '040'
department:
- _id: '78'
doi: 10.1007/978-3-319-16214-0_32
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T09:32:42Z
date_updated: 2018-03-21T09:32:42Z
file_id: '1477'
file_name: 269-paper_53.pdf
file_size: 344309
relation: main_file
success: 1
file_date_updated: 2018-03-21T09:32:42Z
has_accepted_license: '1'
language:
- iso: eng
page: 365--372
project:
- _id: '1'
name: SFB 901
- _id: '12'
name: SFB 901 - Subprojekt B4
- _id: '3'
name: SFB 901 - Project Area B
publication: Proceedings of the International Symposium in Reconfigurable Computing
(ARC)
series_title: LNCS
status: public
title: On-The-Fly Verification of Reconfigurable Image Processing Modules based on
a Proof-Carrying Hardware Approach
type: conference
user_id: '477'
year: '2015'
...
---
_id: '320'
abstract:
- lang: eng
text: 'We consider structural and algorithmic questions related to the Nash dynamics
of weighted congestion games. In weighted congestion games with linear latency
functions, the existence of pure Nash equilibria is guaranteed by a potential
function argument. Unfortunately, this proof of existence is inefficient and computing
pure Nash equilibria in such games is a PLS-hard problem even when all players
have unit weights. The situation gets worse when superlinear (e.g., quadratic)
latency functions come into play; in this case, the Nash dynamics of the game
may contain cycles and pure Nash equilibria may not even exist. Given these obstacles,
we consider approximate pure Nash equilibria as alternative solution concepts.
A ρ--approximate pure Nash equilibrium is a state of a (weighted congestion) game
from which no player has any incentive to deviate in order to improve her cost
by a multiplicative factor higher than ρ. Do such equilibria exist for small values
of ρ? And if so, can we compute them efficiently?We provide positive answers to
both questions for weighted congestion games with polynomial latency functions
by exploiting an “approximation” of such games by a new class of potential games
that we call Ψ-games. This allows us to show that these games have d!-approximate
pure Nash equilibria, where d is the maximum degree of the latency functions.
Our main technical contribution is an efficient algorithm for computing O(1)-approximate
pure Nash equilibria when d is a constant. For games with linear latency functions,
the approximation guarantee is 3+√5/2 + Oγ for arbitrarily small γ > 0; for latency
functions with maximum degree d≥ 2, it is d2d+o(d). The running time is polynomial
in the number of bits in the representation of the game and 1/γ. As a byproduct
of our techniques, we also show the following interesting structural statement
for weighted congestion games with polynomial latency functions of maximum degree
d ≥ 2: polynomially-long sequences of best-response moves from any initial state
to a dO(d2)-approximate pure Nash equilibrium exist and can be efficiently identified
in such games as long as d is a constant.To the best of our knowledge, these are
the first positive algorithmic results for approximate pure Nash equilibria in
weighted congestion games. Our techniques significantly extend our recent work
on unweighted congestion games through the use of Ψ-games. The concept of approximating
nonpotential games by potential ones is interesting in itself and might have further
applications.'
article_number: '2'
author:
- first_name: Ioannis
full_name: Caragiannis, Ioannis
last_name: Caragiannis
- first_name: Angelo
full_name: Fanelli, Angelo
last_name: Fanelli
- first_name: Nick
full_name: Gravin, Nick
last_name: Gravin
- first_name: Alexander
full_name: Skopalik, Alexander
id: '40384'
last_name: Skopalik
citation:
ama: 'Caragiannis I, Fanelli A, Gravin N, Skopalik A. Approximate Pure Nash Equilibria
in Weighted Congestion Games: Existence, Efficient Computation, and Structure.
Transactions on Economics and Computation. 2015;3(1). doi:10.1145/2614687'
apa: 'Caragiannis, I., Fanelli, A., Gravin, N., & Skopalik, A. (2015). Approximate
Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation,
and Structure. Transactions on Economics and Computation, 3(1).
https://doi.org/10.1145/2614687'
bibtex: '@article{Caragiannis_Fanelli_Gravin_Skopalik_2015, title={Approximate Pure
Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation,
and Structure}, volume={3}, DOI={10.1145/2614687},
number={12}, journal={Transactions on Economics and Computation}, publisher={ACM},
author={Caragiannis, Ioannis and Fanelli, Angelo and Gravin, Nick and Skopalik,
Alexander}, year={2015} }'
chicago: 'Caragiannis, Ioannis, Angelo Fanelli, Nick Gravin, and Alexander Skopalik.
“Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient
Computation, and Structure.” Transactions on Economics and Computation
3, no. 1 (2015). https://doi.org/10.1145/2614687.'
ieee: 'I. Caragiannis, A. Fanelli, N. Gravin, and A. Skopalik, “Approximate Pure
Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation,
and Structure,” Transactions on Economics and Computation, vol. 3, no.
1, 2015.'
mla: 'Caragiannis, Ioannis, et al. “Approximate Pure Nash Equilibria in Weighted
Congestion Games: Existence, Efficient Computation, and Structure.” Transactions
on Economics and Computation, vol. 3, no. 1, 2, ACM, 2015, doi:10.1145/2614687.'
short: I. Caragiannis, A. Fanelli, N. Gravin, A. Skopalik, Transactions on Economics
and Computation 3 (2015).
date_created: 2017-10-17T12:41:54Z
date_updated: 2022-01-06T06:59:04Z
ddc:
- '040'
department:
- _id: '63'
- _id: '541'
doi: 10.1145/2614687
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:40:55Z
date_updated: 2018-03-20T07:40:55Z
file_id: '1433'
file_name: 320-a2-caragiannis.pdf
file_size: 260503
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:40:55Z
has_accepted_license: '1'
intvolume: ' 3'
issue: '1'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '7'
name: SFB 901 - Subprojekt A3
- _id: '2'
name: SFB 901 - Project Area A
publication: Transactions on Economics and Computation
publisher: ACM
status: public
title: 'Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence,
Efficient Computation, and Structure'
type: journal_article
user_id: '477'
volume: 3
year: '2015'
...
---
_id: '321'
author:
- first_name: Fabian
full_name: Eidens, Fabian
id: '25078'
last_name: Eidens
citation:
ama: Eidens F. Anonymous Credential System Based on Q-Strong Diffie-Hellman Assumption.
Universität Paderborn; 2015.
apa: Eidens, F. (2015). Anonymous credential system based on q-Strong Diffie-Hellman
Assumption. Universität Paderborn.
bibtex: '@book{Eidens_2015, title={Anonymous credential system based on q-Strong
Diffie-Hellman Assumption}, publisher={Universität Paderborn}, author={Eidens,
Fabian}, year={2015} }'
chicago: Eidens, Fabian. Anonymous Credential System Based on Q-Strong Diffie-Hellman
Assumption. Universität Paderborn, 2015.
ieee: F. Eidens, Anonymous credential system based on q-Strong Diffie-Hellman
Assumption. Universität Paderborn, 2015.
mla: Eidens, Fabian. Anonymous Credential System Based on Q-Strong Diffie-Hellman
Assumption. Universität Paderborn, 2015.
short: F. Eidens, Anonymous Credential System Based on Q-Strong Diffie-Hellman Assumption,
Universität Paderborn, 2015.
date_created: 2017-10-17T12:41:54Z
date_updated: 2022-01-06T06:59:05Z
ddc:
- '040'
department:
- _id: '64'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:40:22Z
date_updated: 2018-03-20T07:40:22Z
file_id: '1432'
file_name: 321-eidens_masterthesis_01.pdf
file_size: 879285
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:40:22Z
has_accepted_license: '1'
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
title: Anonymous credential system based on q-Strong Diffie-Hellman Assumption
type: mastersthesis
user_id: '477'
year: '2015'
...
---
_id: '322'
abstract:
- lang: eng
text: Reputation systems are used to compute and publish reputation scores for services
or products. We consider reputation systems where users are allowed to rate products
that they purchased previously. To obtain trustworthy reputations, they are allowed
to rate these products only once. As long as users rate products once, they stay
anonymous. Everybody is able to detect users deviating from the rate-products-only-once
policy and the anonymity of such dishonest users can be revoked by a system manager.
In this paper we present formal models for such reputation systems and their security.
Based on group signatures presented by Boneh, Boyen, and Shacham we design an
efficient reputation system that meets all our requirements.
author:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
- first_name: Jakob
full_name: Juhnke, Jakob
id: '48090'
last_name: Juhnke
- first_name: Christina
full_name: Kolb, Christina
id: '43647'
last_name: Kolb
citation:
ama: 'Blömer J, Juhnke J, Kolb C. Anonymous and Publicly Linkable Reputation Systems.
In: Proceedings of the 18th International Conference on Financial Cryptography
and Data Security (FC). LNCS. ; 2015:478--488. doi:10.1007/978-3-662-47854-7_29'
apa: Blömer, J., Juhnke, J., & Kolb, C. (2015). Anonymous and Publicly Linkable
Reputation Systems. In Proceedings of the 18th International Conference on
Financial Cryptography and Data Security (FC) (pp. 478--488). https://doi.org/10.1007/978-3-662-47854-7_29
bibtex: '@inproceedings{Blömer_Juhnke_Kolb_2015, series={LNCS}, title={Anonymous
and Publicly Linkable Reputation Systems}, DOI={10.1007/978-3-662-47854-7_29},
booktitle={Proceedings of the 18th International Conference on Financial Cryptography
and Data Security (FC)}, author={Blömer, Johannes and Juhnke, Jakob and Kolb,
Christina}, year={2015}, pages={478--488}, collection={LNCS} }'
chicago: Blömer, Johannes, Jakob Juhnke, and Christina Kolb. “Anonymous and Publicly
Linkable Reputation Systems.” In Proceedings of the 18th International Conference
on Financial Cryptography and Data Security (FC), 478--488. LNCS, 2015. https://doi.org/10.1007/978-3-662-47854-7_29.
ieee: J. Blömer, J. Juhnke, and C. Kolb, “Anonymous and Publicly Linkable Reputation
Systems,” in Proceedings of the 18th International Conference on Financial
Cryptography and Data Security (FC), 2015, pp. 478--488.
mla: Blömer, Johannes, et al. “Anonymous and Publicly Linkable Reputation Systems.”
Proceedings of the 18th International Conference on Financial Cryptography
and Data Security (FC), 2015, pp. 478--488, doi:10.1007/978-3-662-47854-7_29.
short: 'J. Blömer, J. Juhnke, C. Kolb, in: Proceedings of the 18th International
Conference on Financial Cryptography and Data Security (FC), 2015, pp. 478--488.'
date_created: 2017-10-17T12:41:54Z
date_updated: 2022-01-06T06:59:05Z
ddc:
- '040'
department:
- _id: '64'
doi: 10.1007/978-3-662-47854-7_29
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:39:54Z
date_updated: 2018-03-20T07:39:54Z
file_id: '1431'
file_name: 322-546_01.pdf
file_size: 499568
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:39:54Z
has_accepted_license: '1'
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2014/546
oa: '1'
page: 478--488
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the 18th International Conference on Financial Cryptography
and Data Security (FC)
series_title: LNCS
status: public
title: Anonymous and Publicly Linkable Reputation Systems
type: conference
user_id: '48090'
year: '2015'
...
---
_id: '323'
abstract:
- lang: eng
text: On-the-fly composition of service-based software solutions is still a challenging
task. Even more challenges emerge when facing automatic service composition in
markets of composed services for end users. In this paper, we focus on the functional
discrepancy between “what a user wants” specified in terms of a request and “what
a user gets” when executing a composed service. To meet the challenge of functional
discrepancy, we propose the combination of existing symbolic composition approaches
with machine learning techniques. We developed a learning recommendation system
that expands the capabilities of existing composition algorithms to facilitate
adaptivity and consequently reduces functional discrepancy. As a representative
of symbolic techniques, an Artificial Intelligence planning based approach produces
solutions that are correct with respect to formal specifications. Our learning
recommendation system supports the symbolic approach in decision-making. Reinforcement
Learning techniques enable the recommendation system to adjust its recommendation
strategy over time based on user ratings. We implemented the proposed functionality
in terms of a prototypical composition framework. Preliminary results from experiments
conducted in the image processing domain illustrate the benefit of combining both
complementary techniques.
author:
- first_name: Alexander
full_name: Jungmann, Alexander
last_name: Jungmann
- first_name: Felix
full_name: Mohr, Felix
last_name: Mohr
citation:
ama: Jungmann A, Mohr F. An approach towards adaptive service composition in markets
of composed services. Journal of Internet Services and Applications. 2015;(1):1-18.
doi:10.1186/s13174-015-0022-8
apa: Jungmann, A., & Mohr, F. (2015). An approach towards adaptive service composition
in markets of composed services. Journal of Internet Services and Applications,
(1), 1–18. https://doi.org/10.1186/s13174-015-0022-8
bibtex: '@article{Jungmann_Mohr_2015, title={An approach towards adaptive service
composition in markets of composed services}, DOI={10.1186/s13174-015-0022-8},
number={1}, journal={Journal of Internet Services and Applications}, publisher={Springer},
author={Jungmann, Alexander and Mohr, Felix}, year={2015}, pages={1–18} }'
chicago: 'Jungmann, Alexander, and Felix Mohr. “An Approach towards Adaptive Service
Composition in Markets of Composed Services.” Journal of Internet Services
and Applications, no. 1 (2015): 1–18. https://doi.org/10.1186/s13174-015-0022-8.'
ieee: A. Jungmann and F. Mohr, “An approach towards adaptive service composition
in markets of composed services,” Journal of Internet Services and Applications,
no. 1, pp. 1–18, 2015.
mla: Jungmann, Alexander, and Felix Mohr. “An Approach towards Adaptive Service
Composition in Markets of Composed Services.” Journal of Internet Services
and Applications, no. 1, Springer, 2015, pp. 1–18, doi:10.1186/s13174-015-0022-8.
short: A. Jungmann, F. Mohr, Journal of Internet Services and Applications (2015)
1–18.
date_created: 2017-10-17T12:41:55Z
date_updated: 2022-01-06T06:59:06Z
ddc:
- '040'
department:
- _id: '355'
doi: 10.1186/s13174-015-0022-8
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:39:17Z
date_updated: 2018-03-20T07:39:17Z
file_id: '1429'
file_name: 323-An_approach_towards_adaptive_service_composition_in_markets_of_composed_services.pdf
file_size: 2842281
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:39:17Z
has_accepted_license: '1'
issue: '1'
language:
- iso: eng
page: 1-18
project:
- _id: '1'
name: SFB 901
- _id: '10'
name: SFB 901 - Subprojekt B2
- _id: '3'
name: SFB 901 - Project Area B
publication: Journal of Internet Services and Applications
publisher: Springer
status: public
title: An approach towards adaptive service composition in markets of composed services
type: journal_article
user_id: '477'
year: '2015'
...
---
_id: '324'
abstract:
- lang: eng
text: Services are self-contained software components that can beused platform independent
and that aim at maximizing software reuse. Abasic concern in service oriented
architectures is to measure the reusabilityof services. One of the most important
qualities is the functionalreusability, which indicates how relevant the task
is that a service solves.Current metrics for functional reusability of software,
however, have verylittle explanatory power and do not accomplish this goal.This
paper presents a new approach to estimate the functional reusabilityof services
based on their relevance. To this end, it denes the degreeto which a service enables
the execution of other services as its contri-bution. Based on the contribution,
relevance of services is dened as anestimation for their functional reusability.
Explanatory power is obtainedby normalizing relevance values with a reference
service. The applicationof the metric to a service test set conrms its supposed
capabilities.
author:
- first_name: Felix
full_name: Mohr, Felix
last_name: Mohr
citation:
ama: 'Mohr F. A Metric for Functional Reusability of Services. In: Proceedings
of the 14th International Conference on Software Reuse (ICSR). LNCS. ; 2015:298--313.
doi:10.1007/978-3-319-14130-5_21'
apa: Mohr, F. (2015). A Metric for Functional Reusability of Services. In Proceedings
of the 14th International Conference on Software Reuse (ICSR) (pp. 298--313).
https://doi.org/10.1007/978-3-319-14130-5_21
bibtex: '@inproceedings{Mohr_2015, series={LNCS}, title={A Metric for Functional
Reusability of Services}, DOI={10.1007/978-3-319-14130-5_21},
booktitle={Proceedings of the 14th International Conference on Software Reuse
(ICSR)}, author={Mohr, Felix}, year={2015}, pages={298--313}, collection={LNCS}
}'
chicago: Mohr, Felix. “A Metric for Functional Reusability of Services.” In Proceedings
of the 14th International Conference on Software Reuse (ICSR), 298--313. LNCS,
2015. https://doi.org/10.1007/978-3-319-14130-5_21.
ieee: F. Mohr, “A Metric for Functional Reusability of Services,” in Proceedings
of the 14th International Conference on Software Reuse (ICSR), 2015, pp. 298--313.
mla: Mohr, Felix. “A Metric for Functional Reusability of Services.” Proceedings
of the 14th International Conference on Software Reuse (ICSR), 2015, pp. 298--313,
doi:10.1007/978-3-319-14130-5_21.
short: 'F. Mohr, in: Proceedings of the 14th International Conference on Software
Reuse (ICSR), 2015, pp. 298--313.'
date_created: 2017-10-17T12:41:55Z
date_updated: 2022-01-06T06:59:07Z
ddc:
- '040'
department:
- _id: '355'
doi: 10.1007/978-3-319-14130-5_21
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:38:44Z
date_updated: 2018-03-20T07:38:44Z
file_id: '1428'
file_name: 324-ICSR-Mohr-15.pdf
file_size: 569475
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:38:44Z
has_accepted_license: '1'
language:
- iso: eng
page: 298--313
project:
- _id: '1'
name: SFB 901
- _id: '10'
name: SFB 901 - Subprojekt B2
- _id: '3'
name: SFB 901 - Project Area B
publication: Proceedings of the 14th International Conference on Software Reuse (ICSR)
series_title: LNCS
status: public
title: A Metric for Functional Reusability of Services
type: conference
user_id: '477'
year: '2015'
...
---
_id: '325'
author:
- first_name: Nils
full_name: Löken, Nils
id: '13703'
last_name: Löken
citation:
ama: Löken N. A Group Signature Scheme with Distributed Group Management - An
Application of Threshold Encryption. Universität Paderborn; 2015.
apa: Löken, N. (2015). A Group Signature Scheme with Distributed Group Management
- An Application of Threshold Encryption. Universität Paderborn.
bibtex: '@book{Löken_2015, title={A Group Signature Scheme with Distributed Group
Management - An Application of Threshold Encryption}, publisher={Universität Paderborn},
author={Löken, Nils}, year={2015} }'
chicago: Löken, Nils. A Group Signature Scheme with Distributed Group Management
- An Application of Threshold Encryption. Universität Paderborn, 2015.
ieee: N. Löken, A Group Signature Scheme with Distributed Group Management -
An Application of Threshold Encryption. Universität Paderborn, 2015.
mla: Löken, Nils. A Group Signature Scheme with Distributed Group Management
- An Application of Threshold Encryption. Universität Paderborn, 2015.
short: N. Löken, A Group Signature Scheme with Distributed Group Management - An
Application of Threshold Encryption, Universität Paderborn, 2015.
date_created: 2017-10-17T12:41:55Z
date_updated: 2022-01-06T06:59:07Z
department:
- _id: '64'
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
publisher: Universität Paderborn
related_material:
record:
- id: '253'
relation: other
status: public
status: public
supervisor:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
title: A Group Signature Scheme with Distributed Group Management - An Application
of Threshold Encryption
type: mastersthesis
user_id: '477'
year: '2015'
...