---
_id: '44'
abstract:
- lang: eng
text: Natural language software requirements descriptions enable end users to formulate
their wishes and expectations for a future software product without much prior
knowledge in requirements engineering. However, these descriptions are susceptible
to linguistic inaccuracies such as ambiguities and incompleteness that can harm
the development process. There is a number of software solutions that can detect
deficits in requirements descriptions and partially solve them, but they are often
hard to use and not suitable for end users. For this reason, we develop a software
system that helps end-users to create unambiguous and complete requirements descriptions
by combining existing expert tools and controlling them using automatic compensation
strategies. In order to recognize the necessity of individual compensation methods
in the descriptions, we have developed linguistic indicators, which we present
in this paper. Based on these indicators, the whole text analysis pipeline is
ad-hoc configured and thus adapted to the individual circumstances of a requirements
description.
author:
- first_name: Frederik Simon
full_name: Bäumer, Frederik Simon
id: '38837'
last_name: Bäumer
- first_name: Michaela
full_name: Geierhos, Michaela
id: '42496'
last_name: Geierhos
orcid: 0000-0002-8180-5606
citation:
ama: 'Bäumer FS, Geierhos M. Flexible Ambiguity Resolution and Incompleteness Detection
in Requirements Descriptions via an Indicator-based Configuration of Text Analysis
Pipelines. In: Proceedings of the 51st Hawaii International Conference on System
Sciences. ; 2018:5746-5755. doi:10125/50609'
apa: Bäumer, F. S., & Geierhos, M. (2018). Flexible Ambiguity Resolution and
Incompleteness Detection in Requirements Descriptions via an Indicator-based Configuration
of Text Analysis Pipelines. In Proceedings of the 51st Hawaii International
Conference on System Sciences (pp. 5746–5755). Big Island, Waikoloa Village.
https://doi.org/10125/50609
bibtex: '@inproceedings{Bäumer_Geierhos_2018, title={Flexible Ambiguity Resolution
and Incompleteness Detection in Requirements Descriptions via an Indicator-based
Configuration of Text Analysis Pipelines}, DOI={10125/50609},
booktitle={Proceedings of the 51st Hawaii International Conference on System Sciences},
author={Bäumer, Frederik Simon and Geierhos, Michaela}, year={2018}, pages={5746–5755}
}'
chicago: Bäumer, Frederik Simon, and Michaela Geierhos. “Flexible Ambiguity Resolution
and Incompleteness Detection in Requirements Descriptions via an Indicator-Based
Configuration of Text Analysis Pipelines.” In Proceedings of the 51st Hawaii
International Conference on System Sciences, 5746–55, 2018. https://doi.org/10125/50609.
ieee: F. S. Bäumer and M. Geierhos, “Flexible Ambiguity Resolution and Incompleteness
Detection in Requirements Descriptions via an Indicator-based Configuration of
Text Analysis Pipelines,” in Proceedings of the 51st Hawaii International Conference
on System Sciences, Big Island, Waikoloa Village, 2018, pp. 5746–5755.
mla: Bäumer, Frederik Simon, and Michaela Geierhos. “Flexible Ambiguity Resolution
and Incompleteness Detection in Requirements Descriptions via an Indicator-Based
Configuration of Text Analysis Pipelines.” Proceedings of the 51st Hawaii International
Conference on System Sciences, 2018, pp. 5746–55, doi:10125/50609.
short: 'F.S. Bäumer, M. Geierhos, in: Proceedings of the 51st Hawaii International
Conference on System Sciences, 2018, pp. 5746–5755.'
conference:
end_date: 2018-01-06
location: Big Island, Waikoloa Village
name: 51st Hawaii International Conference on System Sciences (HICSS 2018)
start_date: 2018-01-03
date_created: 2017-10-17T12:40:59Z
date_updated: 2022-01-06T07:01:01Z
ddc:
- '000'
department:
- _id: '36'
- _id: '1'
- _id: '579'
doi: 10125/50609
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T14:32:35Z
date_updated: 2018-11-02T14:32:35Z
file_id: '5274'
file_name: paper0722.pdf
file_size: 753693
relation: main_file
success: 1
file_date_updated: 2018-11-02T14:32:35Z
has_accepted_license: '1'
keyword:
- 'Software Product Lines: Engineering'
- Services
- and Management
- Ambiguities
- Incompleteness
- Natural Language Processing
- Software Requirements
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://scholarspace.manoa.hawaii.edu/bitstream/10125/50609/1/paper0722.pdf
oa: '1'
page: 5746-5755
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '9'
name: SFB 901 - Subproject B1
publication: Proceedings of the 51st Hawaii International Conference on System Sciences
publication_identifier:
isbn:
- 978-0-9981331-1-9
publication_status: published
quality_controlled: '1'
status: public
title: Flexible Ambiguity Resolution and Incompleteness Detection in Requirements
Descriptions via an Indicator-based Configuration of Text Analysis Pipelines
type: conference
user_id: '477'
year: '2018'
...
---
_id: '4999'
author:
- first_name: Felix
full_name: Pauck, Felix
id: '22398'
last_name: Pauck
- first_name: Eric
full_name: Bodden, Eric
id: '59256'
last_name: Bodden
orcid: 0000-0003-3470-3647
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Pauck F, Bodden E, Wehrheim H. Do Android taint analysis tools keep their
promises? In: Proceedings of the 2018 26th ACM Joint Meeting on European Software
Engineering Conference and Symposium on the Foundations of Software Engineering
- ESEC/FSE 2018. ACM Press; 2018. doi:10.1145/3236024.3236029'
apa: Pauck, F., Bodden, E., & Wehrheim, H. (2018). Do Android taint analysis
tools keep their promises? In Proceedings of the 2018 26th ACM Joint Meeting
on European Software Engineering Conference and Symposium on the Foundations of
Software Engineering - ESEC/FSE 2018. ACM Press. https://doi.org/10.1145/3236024.3236029
bibtex: '@inproceedings{Pauck_Bodden_Wehrheim_2018, title={Do Android taint analysis
tools keep their promises?}, DOI={10.1145/3236024.3236029},
booktitle={Proceedings of the 2018 26th ACM Joint Meeting on European Software
Engineering Conference and Symposium on the Foundations of Software Engineering
- ESEC/FSE 2018}, publisher={ACM Press}, author={Pauck, Felix and Bodden, Eric
and Wehrheim, Heike}, year={2018} }'
chicago: Pauck, Felix, Eric Bodden, and Heike Wehrheim. “Do Android Taint Analysis
Tools Keep Their Promises?” In Proceedings of the 2018 26th ACM Joint Meeting
on European Software Engineering Conference and Symposium on the Foundations of
Software Engineering - ESEC/FSE 2018. ACM Press, 2018. https://doi.org/10.1145/3236024.3236029.
ieee: F. Pauck, E. Bodden, and H. Wehrheim, “Do Android taint analysis tools keep
their promises?,” in Proceedings of the 2018 26th ACM Joint Meeting on European
Software Engineering Conference and Symposium on the Foundations of Software Engineering
- ESEC/FSE 2018, 2018.
mla: Pauck, Felix, et al. “Do Android Taint Analysis Tools Keep Their Promises?”
Proceedings of the 2018 26th ACM Joint Meeting on European Software Engineering
Conference and Symposium on the Foundations of Software Engineering - ESEC/FSE
2018, ACM Press, 2018, doi:10.1145/3236024.3236029.
short: 'F. Pauck, E. Bodden, H. Wehrheim, in: Proceedings of the 2018 26th ACM Joint
Meeting on European Software Engineering Conference and Symposium on the Foundations
of Software Engineering - ESEC/FSE 2018, ACM Press, 2018.'
date_created: 2018-10-30T08:03:17Z
date_updated: 2022-01-06T07:01:34Z
ddc:
- '004'
department:
- _id: '77'
- _id: '76'
doi: 10.1145/3236024.3236029
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T13:37:38Z
date_updated: 2018-11-02T13:37:38Z
file_id: '5251'
file_name: fse18main-id76-p.pdf
file_size: 524169
relation: main_file
success: 1
file_date_updated: 2018-11-02T13:37:38Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '3'
name: SFB 901 - Project Area B
- _id: '12'
name: SFB 901 - Subproject B4
- _id: '1'
name: SFB 901
publication: Proceedings of the 2018 26th ACM Joint Meeting on European Software Engineering
Conference and Symposium on the Foundations of Software Engineering - ESEC/FSE
2018
publication_identifier:
isbn:
- '9781450355735'
publication_status: published
publisher: ACM Press
status: public
title: Do Android taint analysis tools keep their promises?
type: conference
user_id: '477'
year: '2018'
...
---
_id: '5203'
author:
- first_name: Stefan
full_name: Krüger, Stefan
last_name: Krüger
- first_name: Johannes
full_name: Späth, Johannes
last_name: Späth
- first_name: Karim
full_name: Ali, Karim
last_name: Ali
- first_name: Eric
full_name: Bodden, Eric
id: '59256'
last_name: Bodden
orcid: 0000-0003-3470-3647
- first_name: Mira
full_name: Mezini, Mira
last_name: Mezini
citation:
ama: 'Krüger S, Späth J, Ali K, Bodden E, Mezini M. CrySL: An Extensible Approach
to Validating the Correct Usage of Cryptographic APIs. In: European Conference
on Object-Oriented Programming (ECOOP). ; 2018:10:1-10:27.'
apa: 'Krüger, S., Späth, J., Ali, K., Bodden, E., & Mezini, M. (2018). CrySL:
An Extensible Approach to Validating the Correct Usage of Cryptographic APIs.
In European Conference on Object-Oriented Programming (ECOOP) (pp. 10:1-10:27).'
bibtex: '@inproceedings{Krüger_Späth_Ali_Bodden_Mezini_2018, title={CrySL: An Extensible
Approach to Validating the Correct Usage of Cryptographic APIs}, booktitle={European
Conference on Object-Oriented Programming (ECOOP)}, author={Krüger, Stefan and
Späth, Johannes and Ali, Karim and Bodden, Eric and Mezini, Mira}, year={2018},
pages={10:1-10:27} }'
chicago: 'Krüger, Stefan, Johannes Späth, Karim Ali, Eric Bodden, and Mira Mezini.
“CrySL: An Extensible Approach to Validating the Correct Usage of Cryptographic
APIs.” In European Conference on Object-Oriented Programming (ECOOP), 10:1-10:27,
2018.'
ieee: 'S. Krüger, J. Späth, K. Ali, E. Bodden, and M. Mezini, “CrySL: An Extensible
Approach to Validating the Correct Usage of Cryptographic APIs,” in European
Conference on Object-Oriented Programming (ECOOP), 2018, pp. 10:1-10:27.'
mla: 'Krüger, Stefan, et al. “CrySL: An Extensible Approach to Validating the Correct
Usage of Cryptographic APIs.” European Conference on Object-Oriented Programming
(ECOOP), 2018, pp. 10:1-10:27.'
short: 'S. Krüger, J. Späth, K. Ali, E. Bodden, M. Mezini, in: European Conference
on Object-Oriented Programming (ECOOP), 2018, pp. 10:1-10:27.'
date_created: 2018-10-31T12:37:29Z
date_updated: 2022-01-06T07:01:44Z
ddc:
- '000'
department:
- _id: '76'
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T13:51:05Z
date_updated: 2018-11-02T13:51:05Z
file_id: '5255'
file_name: ksa+18crysl.pdf
file_size: 747259
relation: main_file
success: 1
file_date_updated: 2018-11-02T13:51:05Z
has_accepted_license: '1'
keyword:
- ITSECWEBSITE
- CROSSING
language:
- iso: eng
main_file_link:
- url: http://bodden.de/pubs/ksa+18crysl.pdf
page: 10:1-10:27
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '12'
name: SFB 901 - Subproject B4
publication: European Conference on Object-Oriented Programming (ECOOP)
status: public
title: 'CrySL: An Extensible Approach to Validating the Correct Usage of Cryptographic
APIs'
type: conference
user_id: '477'
year: '2018'
...
---
_id: '5216'
abstract:
- lang: eng
text: A fundamental problem for overlay networks is to safely exclude leaving nodes,
i.e., the nodes requesting to leave the overlay network are excluded from it without
affecting its connectivity. To rigorously study self-stabilizing solutions to
this problem, the Finite Departure Problem (FDP) has been proposed [9]. In the
FDP we are given a network of processes in an arbitrary state, and the goal is
to eventually arrive at (and stay in) a state in which all leaving processes irrevocably
decided to leave the system while for all weakly-connected components in the initial
overlay network, all staying processes in that component will still form a weakly
connected component. In the standard interconnection model, the FDP is known to
be unsolvable by local control protocols, so oracles have been investigated that
allow the problem to be solved [9]. To avoid the use of oracles, we introduce
a new interconnection model based on relays. Despite the relay model appearing
to be rather restrictive, we show that it is universal, i.e., it is possible to
transform any weakly-connected topology into any other weakly-connected topology,
which is important for being a useful interconnection model for overlay networks.
Apart from this, our model allows processes to grant and revoke access rights,
which is why we believe it to be of interest beyond the scope of this paper. We
show how to implement the relay layer in a self-stabilizing way and identify properties
protocols need to satisfy so that the relay layer can recover while serving protocol
requests.
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
citation:
ama: 'Scheideler C, Setzer A. Relays: A New Approach for the Finite Departure Problem
in Overlay Networks. In: Proceedings of the 20th International Symposium on
Stabilization, Safety, and Security of Distributed Systems (SSS 2018). ; 2018.
doi:10.1007/978-3-030-03232-6_16'
apa: 'Scheideler, C., & Setzer, A. (2018). Relays: A New Approach for the Finite
Departure Problem in Overlay Networks. In Proceedings of the 20th International
Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018).
Tokyo, Japan. https://doi.org/10.1007/978-3-030-03232-6_16'
bibtex: '@inproceedings{Scheideler_Setzer_2018, title={Relays: A New Approach for
the Finite Departure Problem in Overlay Networks}, DOI={10.1007/978-3-030-03232-6_16},
booktitle={Proceedings of the 20th International Symposium on Stabilization, Safety,
and Security of Distributed Systems (SSS 2018)}, author={Scheideler, Christian
and Setzer, Alexander}, year={2018} }'
chicago: 'Scheideler, Christian, and Alexander Setzer. “Relays: A New Approach for
the Finite Departure Problem in Overlay Networks.” In Proceedings of the 20th
International Symposium on Stabilization, Safety, and Security of Distributed
Systems (SSS 2018), 2018. https://doi.org/10.1007/978-3-030-03232-6_16.'
ieee: 'C. Scheideler and A. Setzer, “Relays: A New Approach for the Finite Departure
Problem in Overlay Networks,” in Proceedings of the 20th International Symposium
on Stabilization, Safety, and Security of Distributed Systems (SSS 2018),
Tokyo, Japan, 2018.'
mla: 'Scheideler, Christian, and Alexander Setzer. “Relays: A New Approach for the
Finite Departure Problem in Overlay Networks.” Proceedings of the 20th International
Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018),
2018, doi:10.1007/978-3-030-03232-6_16.'
short: 'C. Scheideler, A. Setzer, in: Proceedings of the 20th International Symposium
on Stabilization, Safety, and Security of Distributed Systems (SSS 2018), 2018.'
conference:
location: Tokyo, Japan
name: 20th International Symposium on Stabilization, Safety, and Security of Distributed
Systems (SSS 2018)
date_created: 2018-10-31T13:33:05Z
date_updated: 2022-01-06T07:01:47Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1007/978-3-030-03232-6_16
file:
- access_level: closed
content_type: application/pdf
creator: asetzer
date_created: 2018-10-31T15:51:45Z
date_updated: 2018-10-31T16:09:48Z
file_id: '5223'
file_name: Scheideler-Setzer2018_Chapter_RelaysANewApproachForTheFinite.pdf
file_size: 369818
relation: main_file
file_date_updated: 2018-10-31T16:09:48Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '13'
name: SFB 901 - Subproject C1
publication: Proceedings of the 20th International Symposium on Stabilization, Safety,
and Security of Distributed Systems (SSS 2018)
publication_status: published
status: public
title: 'Relays: A New Approach for the Finite Departure Problem in Overlay Networks'
type: conference
user_id: '11108'
year: '2018'
...
---
_id: '5222'
abstract:
- lang: eng
text: 'We present a self-stabilizing protocol for an overlay network that constructs
the Minimum Spanning Tree (MST) for an underlay that is modeled by a weighted
tree. The weight of an overlay edge between two nodes is the weighted length of
their shortest path in the tree. We rigorously prove that our protocol works correctly
under asynchronous and non-FIFO message delivery. Further, the protocol stabilizes
after O(N^2) asynchronous rounds where N is the number of nodes in the overlay. '
author:
- first_name: Thorsten
full_name: Götte, Thorsten
id: '34727'
last_name: Götte
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Alexander
full_name: Setzer, Alexander
id: '11108'
last_name: Setzer
citation:
ama: 'Götte T, Scheideler C, Setzer A. On Underlay-Aware Self-Stabilizing Overlay
Networks. In: Proceedings of the 20th International Symposium on Stabilization,
Safety, and Security of Distributed Systems (SSS 2018). Vol 11201. Lecture
Notes in Computer Science. Springer; 2018:50-64.'
apa: 'Götte, T., Scheideler, C., & Setzer, A. (2018). On Underlay-Aware Self-Stabilizing
Overlay Networks. In Proceedings of the 20th International Symposium on Stabilization,
Safety, and Security of Distributed Systems (SSS 2018) (Vol. 11201, pp. 50–64).
Tokyo, Japan: Springer.'
bibtex: '@inproceedings{Götte_Scheideler_Setzer_2018, series={Lecture Notes in Computer
Science}, title={On Underlay-Aware Self-Stabilizing Overlay Networks}, volume={11201},
booktitle={Proceedings of the 20th International Symposium on Stabilization, Safety,
and Security of Distributed Systems (SSS 2018)}, publisher={Springer}, author={Götte,
Thorsten and Scheideler, Christian and Setzer, Alexander}, year={2018}, pages={50–64},
collection={Lecture Notes in Computer Science} }'
chicago: Götte, Thorsten, Christian Scheideler, and Alexander Setzer. “On Underlay-Aware
Self-Stabilizing Overlay Networks.” In Proceedings of the 20th International
Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018),
11201:50–64. Lecture Notes in Computer Science. Springer, 2018.
ieee: T. Götte, C. Scheideler, and A. Setzer, “On Underlay-Aware Self-Stabilizing
Overlay Networks,” in Proceedings of the 20th International Symposium on Stabilization,
Safety, and Security of Distributed Systems (SSS 2018), Tokyo, Japan, 2018,
vol. 11201, pp. 50–64.
mla: Götte, Thorsten, et al. “On Underlay-Aware Self-Stabilizing Overlay Networks.”
Proceedings of the 20th International Symposium on Stabilization, Safety, and
Security of Distributed Systems (SSS 2018), vol. 11201, Springer, 2018, pp.
50–64.
short: 'T. Götte, C. Scheideler, A. Setzer, in: Proceedings of the 20th International
Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018),
Springer, 2018, pp. 50–64.'
conference:
location: Tokyo, Japan
name: ' 20th International Symposium on Stabilization, Safety, and Security of Distributed
Systems (SSS 2018)'
date_created: 2018-10-31T15:44:30Z
date_updated: 2022-01-06T07:01:47Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: closed
content_type: application/pdf
creator: thgoette
date_created: 2018-10-31T15:59:26Z
date_updated: 2018-10-31T15:59:26Z
file_id: '5224'
file_name: sss18_camera.pdf
file_size: 367812
relation: main_file
success: 1
file_date_updated: 2018-10-31T15:59:26Z
has_accepted_license: '1'
intvolume: ' 11201'
language:
- iso: eng
page: 50-64
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
publication: Proceedings of the 20th International Symposium on Stabilization, Safety,
and Security of Distributed Systems (SSS 2018)
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: On Underlay-Aware Self-Stabilizing Overlay Networks
type: conference
user_id: '477'
volume: 11201
year: '2018'
...
---
_id: '5330'
abstract:
- lang: eng
text: "In Internet transactions, customers and service providers often interact
once and anonymously.\r\nTo prevent deceptive behavior a reputation system is
particularly important to\r\nreduce information asymmetries about the quality
of the offered product or service. In this\r\nstudy we examine the effectiveness
of a reputation system to reduce information asymmetries\r\nwhen customers may
make mistakes in judging the provided service quality. In our model,\r\na service
provider makes strategic quality choices and short-lived customers are asked to\r\nevaluate
the observed quality by providing ratings to a reputation system. The customer
is\r\nnot able to always evaluate the service quality correctly and possibly submits
an erroneous\r\nrating according to a predefined probability. Considering reputation
profiles of the last three\r\nsales, within the theoretical model we derive that
the service provider’s dichotomous quality\r\ndecisions are independent of the
reputation profile and depend only on the probabilities of\r\nreceiving positive
and negative ratings when providing low or high quality. Thus, a service\r\nprovider
optimally either maintains a good reputation or completely refrains from any reputation\r\nbuilding
process. However, when mapping our theoretical model to an experimental\r\ndesign
we find that a significant share of subjects in the role of the service provider
deviates\r\nfrom optimal behavior and chooses actions which are conditional on
the current reputation\r\nprofile. With respect to these individual quality choices
we see that subjects use milking\r\nstrategies which means that they exploit a
good reputation. In particular, if the sales price\r\nis high, low quality is
delivered until the price drops below a certain threshold, and then\r\nhigh quality
is chosen until the price increases again."
article_number: e0207172
article_type: review
author:
- first_name: Behnud
full_name: Mir Djawadi, Behnud
id: '26032'
last_name: Mir Djawadi
orcid: 0000-0002-6271-5912
- first_name: Rene
full_name: Fahr, Rene
id: '111'
last_name: Fahr
- first_name: Claus-Jochen
full_name: Haake, Claus-Jochen
id: '20801'
last_name: Haake
- first_name: Sonja
full_name: Recker, Sonja
last_name: Recker
citation:
ama: Mir Djawadi B, Fahr R, Haake C-J, Recker S. Maintaining vs. Milking Good Reputation
when Customer Feedback is Inaccurate. PLoS ONE. 2018;13(11). doi:10.1371/journal.pone.0207172
apa: Mir Djawadi, B., Fahr, R., Haake, C.-J., & Recker, S. (2018). Maintaining
vs. Milking Good Reputation when Customer Feedback is Inaccurate. PLoS ONE,
13(11). https://doi.org/10.1371/journal.pone.0207172
bibtex: '@article{Mir Djawadi_Fahr_Haake_Recker_2018, title={Maintaining vs. Milking
Good Reputation when Customer Feedback is Inaccurate}, volume={13}, DOI={10.1371/journal.pone.0207172},
number={11e0207172}, journal={PLoS ONE}, publisher={Public Library of Science},
author={Mir Djawadi, Behnud and Fahr, Rene and Haake, Claus-Jochen and Recker,
Sonja}, year={2018} }'
chicago: Mir Djawadi, Behnud, Rene Fahr, Claus-Jochen Haake, and Sonja Recker. “Maintaining
vs. Milking Good Reputation When Customer Feedback Is Inaccurate.” PLoS ONE
13, no. 11 (2018). https://doi.org/10.1371/journal.pone.0207172.
ieee: B. Mir Djawadi, R. Fahr, C.-J. Haake, and S. Recker, “Maintaining vs. Milking
Good Reputation when Customer Feedback is Inaccurate,” PLoS ONE, vol. 13,
no. 11, 2018.
mla: Mir Djawadi, Behnud, et al. “Maintaining vs. Milking Good Reputation When Customer
Feedback Is Inaccurate.” PLoS ONE, vol. 13, no. 11, e0207172, Public Library
of Science, 2018, doi:10.1371/journal.pone.0207172.
short: B. Mir Djawadi, R. Fahr, C.-J. Haake, S. Recker, PLoS ONE 13 (2018).
date_created: 2018-11-03T11:51:48Z
date_updated: 2022-01-06T07:01:50Z
ddc:
- '330'
department:
- _id: '205'
- _id: '475'
doi: 10.1371/journal.pone.0207172
file:
- access_level: closed
content_type: application/pdf
creator: cjhaake
date_created: 2018-11-13T20:51:34Z
date_updated: 2018-11-13T20:51:34Z
file_id: '5542'
file_name: Maintaining_vs_Milking.pdf
file_size: 1107189
relation: main_file
success: 1
file_date_updated: 2018-11-13T20:51:34Z
funded_apc: '1'
has_accepted_license: '1'
intvolume: ' 13'
issue: '11'
language:
- iso: eng
project:
- _id: '7'
name: SFB 901 - Subproject A3
- _id: '8'
name: SFB 901 - Subproject A4
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
publication: PLoS ONE
publication_identifier:
eissn:
- 1932-6203
publication_status: published
publisher: Public Library of Science
status: public
title: Maintaining vs. Milking Good Reputation when Customer Feedback is Inaccurate
type: journal_article
user_id: '477'
volume: 13
year: '2018'
...
---
_id: '5368'
author:
- first_name: Moritz
full_name: Jochmaring, Moritz
last_name: Jochmaring
citation:
ama: Jochmaring M. Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen
Build-List Und Build-Multilist Mit Systemverlassenden Knoten. Universität
Paderborn; 2018.
apa: Jochmaring, M. (2018). Monotone Suchbarkeit bei den selbststabilisierenden
Protokollen Build-List und Build-Multilist mit systemverlassenden Knoten.
Universität Paderborn.
bibtex: '@book{Jochmaring_2018, title={Monotone Suchbarkeit bei den selbststabilisierenden
Protokollen Build-List und Build-Multilist mit systemverlassenden Knoten}, publisher={Universität
Paderborn}, author={Jochmaring, Moritz}, year={2018} }'
chicago: Jochmaring, Moritz. Monotone Suchbarkeit Bei Den Selbststabilisierenden
Protokollen Build-List Und Build-Multilist Mit Systemverlassenden Knoten.
Universität Paderborn, 2018.
ieee: M. Jochmaring, Monotone Suchbarkeit bei den selbststabilisierenden Protokollen
Build-List und Build-Multilist mit systemverlassenden Knoten. Universität
Paderborn, 2018.
mla: Jochmaring, Moritz. Monotone Suchbarkeit Bei Den Selbststabilisierenden
Protokollen Build-List Und Build-Multilist Mit Systemverlassenden Knoten.
Universität Paderborn, 2018.
short: M. Jochmaring, Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen
Build-List Und Build-Multilist Mit Systemverlassenden Knoten, Universität Paderborn,
2018.
date_created: 2018-11-06T06:21:37Z
date_updated: 2022-01-06T07:01:50Z
department:
- _id: '79'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: Monotone Suchbarkeit bei den selbststabilisierenden Protokollen Build-List
und Build-Multilist mit systemverlassenden Knoten
type: bachelorsthesis
user_id: '477'
year: '2018'
...
---
_id: '5403'
author:
- first_name: Marcel
full_name: Geromel, Marcel
last_name: Geromel
citation:
ama: Geromel M. Mobile Facility Leasing. Universität Paderborn; 2018.
apa: Geromel, M. (2018). Mobile Facility Leasing. Universität Paderborn.
bibtex: '@book{Geromel_2018, title={Mobile Facility Leasing}, publisher={Universität
Paderborn}, author={Geromel, Marcel}, year={2018} }'
chicago: Geromel, Marcel. Mobile Facility Leasing. Universität Paderborn,
2018.
ieee: M. Geromel, Mobile Facility Leasing. Universität Paderborn, 2018.
mla: Geromel, Marcel. Mobile Facility Leasing. Universität Paderborn, 2018.
short: M. Geromel, Mobile Facility Leasing, Universität Paderborn, 2018.
date_created: 2018-11-07T09:20:59Z
date_updated: 2022-01-06T07:01:51Z
department:
- _id: '63'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
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: Mobile Facility Leasing
type: bachelorsthesis
user_id: '477'
year: '2018'
...
---
_id: '5404'
author:
- first_name: Patrick Irenäus
full_name: Kolpaczki, Patrick Irenäus
last_name: Kolpaczki
citation:
ama: Kolpaczki PI. Online Algorithmen Für Das K-Page Migration Problem. Universität
Paderborn; 2018.
apa: Kolpaczki, P. I. (2018). Online Algorithmen für das k-Page Migration Problem.
Universität Paderborn.
bibtex: '@book{Kolpaczki_2018, title={Online Algorithmen für das k-Page Migration
Problem}, publisher={Universität Paderborn}, author={Kolpaczki, Patrick Irenäus},
year={2018} }'
chicago: Kolpaczki, Patrick Irenäus. Online Algorithmen Für Das K-Page Migration
Problem. Universität Paderborn, 2018.
ieee: P. I. Kolpaczki, Online Algorithmen für das k-Page Migration Problem.
Universität Paderborn, 2018.
mla: Kolpaczki, Patrick Irenäus. Online Algorithmen Für Das K-Page Migration
Problem. Universität Paderborn, 2018.
short: P.I. Kolpaczki, Online Algorithmen Für Das K-Page Migration Problem, Universität
Paderborn, 2018.
date_created: 2018-11-07T09:23:17Z
date_updated: 2022-01-06T07:01:51Z
department:
- _id: '63'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
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: Online Algorithmen für das k-Page Migration Problem
type: bachelorsthesis
user_id: '477'
year: '2018'
...
---
_id: '5414'
author:
- first_name: Tasneem
full_name: Filmwala, Tasneem
last_name: Filmwala
citation:
ama: Filmwala T. Study Effects of Approximation on Conjugate Gradient Algorithm
and Accelerate It on FPGA Platform. Universität Paderborn; 2018.
apa: Filmwala, T. (2018). Study Effects of Approximation on Conjugate Gradient
Algorithm and Accelerate it on FPGA Platform. Universität Paderborn.
bibtex: '@book{Filmwala_2018, title={Study Effects of Approximation on Conjugate
Gradient Algorithm and Accelerate it on FPGA Platform}, publisher={Universität
Paderborn}, author={Filmwala, Tasneem}, year={2018} }'
chicago: Filmwala, Tasneem. Study Effects of Approximation on Conjugate Gradient
Algorithm and Accelerate It on FPGA Platform. Universität Paderborn, 2018.
ieee: T. Filmwala, Study Effects of Approximation on Conjugate Gradient Algorithm
and Accelerate it on FPGA Platform. Universität Paderborn, 2018.
mla: Filmwala, Tasneem. Study Effects of Approximation on Conjugate Gradient
Algorithm and Accelerate It on FPGA Platform. Universität Paderborn, 2018.
short: T. Filmwala, Study Effects of Approximation on Conjugate Gradient Algorithm
and Accelerate It on FPGA Platform, Universität Paderborn, 2018.
date_created: 2018-11-07T15:14:26Z
date_updated: 2022-01-06T07:01:52Z
department:
- _id: '27'
- _id: '518'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '14'
name: SFB 901 - Subproject C2
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
full_name: Plessl, Christian
id: '16153'
last_name: Plessl
orcid: 0000-0001-5728-9982
title: Study Effects of Approximation on Conjugate Gradient Algorithm and Accelerate
it on FPGA Platform
type: mastersthesis
user_id: '477'
year: '2018'
...
---
_id: '5421'
author:
- first_name: Onkar
full_name: Gadewar, Onkar
last_name: Gadewar
citation:
ama: Gadewar O. Programmable Programs? - Designing FPGA Overlay Architectures
with OpenCL. Universität Paderborn; 2018.
apa: Gadewar, O. (2018). Programmable Programs? - Designing FPGA Overlay Architectures
with OpenCL. Universität Paderborn.
bibtex: '@book{Gadewar_2018, title={Programmable Programs? - Designing FPGA Overlay
Architectures with OpenCL}, publisher={Universität Paderborn}, author={Gadewar,
Onkar}, year={2018} }'
chicago: Gadewar, Onkar. Programmable Programs? - Designing FPGA Overlay Architectures
with OpenCL. Universität Paderborn, 2018.
ieee: O. Gadewar, Programmable Programs? - Designing FPGA Overlay Architectures
with OpenCL. Universität Paderborn, 2018.
mla: Gadewar, Onkar. Programmable Programs? - Designing FPGA Overlay Architectures
with OpenCL. Universität Paderborn, 2018.
short: O. Gadewar, Programmable Programs? - Designing FPGA Overlay Architectures
with OpenCL, Universität Paderborn, 2018.
date_created: 2018-11-07T16:16:56Z
date_updated: 2022-01-06T07:01:53Z
department:
- _id: '27'
- _id: '518'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '14'
name: SFB 901 - Subproject C2
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
full_name: Plessl, Christian
id: '16153'
last_name: Plessl
orcid: 0000-0001-5728-9982
title: Programmable Programs? - Designing FPGA Overlay Architectures with OpenCL
type: mastersthesis
user_id: '477'
year: '2018'
...
---
_id: '5422'
author:
- first_name: Viktoria
full_name: Diemke, Viktoria
last_name: Diemke
citation:
ama: Diemke V. Vertrauen und Vertrauenswürdigkeit - Akteure auf Cloud-basierten
Plattformen. Universität Paderborn; 2018.
apa: Diemke, V. (2018). Vertrauen und Vertrauenswürdigkeit - Akteure auf Cloud-basierten
Plattformen. Universität Paderborn.
bibtex: '@book{Diemke_2018, title={Vertrauen und Vertrauenswürdigkeit - Akteure
auf Cloud-basierten Plattformen}, publisher={Universität Paderborn}, author={Diemke,
Viktoria}, year={2018} }'
chicago: Diemke, Viktoria. Vertrauen und Vertrauenswürdigkeit - Akteure auf Cloud-basierten
Plattformen. Universität Paderborn, 2018.
ieee: V. Diemke, Vertrauen und Vertrauenswürdigkeit - Akteure auf Cloud-basierten
Plattformen. Universität Paderborn, 2018.
mla: Diemke, Viktoria. Vertrauen und Vertrauenswürdigkeit - Akteure auf Cloud-basierten
Plattformen. Universität Paderborn, 2018.
short: V. Diemke, Vertrauen und Vertrauenswürdigkeit - Akteure auf Cloud-basierten
Plattformen, Universität Paderborn, 2018.
date_created: 2018-11-07T16:36:06Z
date_updated: 2022-01-06T07:01:53Z
department:
- _id: '19'
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '8'
name: SFB 901 - Subproject A4
publisher: Universität Paderborn
status: public
title: Vertrauen und Vertrauenswürdigkeit - Akteure auf Cloud-basierten Plattformen
type: bachelorsthesis
user_id: '477'
year: '2018'
...
---
_id: '5530'
abstract:
- lang: eng
text: Software companies nowadays create ecosystems of users and third-party providers
around their platforms. They often provide online stores so that the third-party
developments can be exposed to users directly. The resulting ecosystems differ
significantly from each other in their architectural designs because their providers
differ in terms of business goals and contexts. Until now, this architectural
diversity and rationale behind it are not well-understood. Therefore, it is not
clear which software features contribute to ecosystem’s success with respect to
certain business goals and context. This hinders systematic creation of ecosystems
in the future. Thus, decision-making becomes too risky; for future ecosystem providers,
which may lead to creation of inefficient ecosystems that lack critical features,
and for third-party providers to rely on ad-hoc choices while deciding on suitability
of an ecosystem for their future career. In this paper, we introduce three design
patterns for store- oriented software ecosystems by classifying the design decisions,
business goals, and context of 111 store-oriented software ecosystems. Each design
pattern provides an architectural solution to achieve a different business goal
while supporting a different context. We discuss how the design patterns are applied
together in order to achieve more business goals. Our work supports ecosystem
and third-party providers by sharing practice-proven architectural solutions,
helping them to take informed architectural decisions and reduce technical risks.
author:
- first_name: Bahar
full_name: Jazayeri, Bahar
id: '36399'
last_name: Jazayeri
- first_name: Olaf
full_name: Zimmermann, Olaf
last_name: Zimmermann
- first_name: Jochen
full_name: Küster, Jochen
last_name: Küster
- first_name: Gregor
full_name: Engels, Gregor
id: '107'
last_name: Engels
- first_name: Dennis
full_name: Kundisch, Dennis
id: '21117'
last_name: Kundisch
- first_name: Daniel
full_name: Szopinski, Daniel
id: '36372'
last_name: Szopinski
citation:
ama: 'Jazayeri B, Zimmermann O, Küster J, Engels G, Kundisch D, Szopinski D. Patterns
of Store-oriented Software Ecosystems: Detection, Classification, and Analysis
of Design Options. In: The Latin American Conference on Pattern Languages of
Programs (SLPLoP). To appear. Valparaíso, Chile: ACM. To appear; 2018.'
apa: 'Jazayeri, B., Zimmermann, O., Küster, J., Engels, G., Kundisch, D., &
Szopinski, D. (2018). Patterns of Store-oriented Software Ecosystems: Detection,
Classification, and Analysis of Design Options. In The Latin American Conference
on Pattern Languages of Programs (SLPLoP). Valparaíso, Chile: ACM. To appear.'
bibtex: '@inproceedings{Jazayeri_Zimmermann_Küster_Engels_Kundisch_Szopinski_2018,
place={Valparaíso, Chile}, series={To appear}, title={Patterns of Store-oriented
Software Ecosystems: Detection, Classification, and Analysis of Design Options},
booktitle={The Latin American Conference on Pattern Languages of Programs (SLPLoP)},
publisher={ACM. To appear}, author={Jazayeri, Bahar and Zimmermann, Olaf and Küster,
Jochen and Engels, Gregor and Kundisch, Dennis and Szopinski, Daniel}, year={2018},
collection={To appear} }'
chicago: 'Jazayeri, Bahar, Olaf Zimmermann, Jochen Küster, Gregor Engels, Dennis
Kundisch, and Daniel Szopinski. “Patterns of Store-Oriented Software Ecosystems:
Detection, Classification, and Analysis of Design Options.” In The Latin American
Conference on Pattern Languages of Programs (SLPLoP). To Appear. Valparaíso,
Chile: ACM. To appear, 2018.'
ieee: 'B. Jazayeri, O. Zimmermann, J. Küster, G. Engels, D. Kundisch, and D. Szopinski,
“Patterns of Store-oriented Software Ecosystems: Detection, Classification, and
Analysis of Design Options,” in The Latin American Conference on Pattern Languages
of Programs (SLPLoP), 2018.'
mla: 'Jazayeri, Bahar, et al. “Patterns of Store-Oriented Software Ecosystems: Detection,
Classification, and Analysis of Design Options.” The Latin American Conference
on Pattern Languages of Programs (SLPLoP), ACM. To appear, 2018.'
short: 'B. Jazayeri, O. Zimmermann, J. Küster, G. Engels, D. Kundisch, D. Szopinski,
in: The Latin American Conference on Pattern Languages of Programs (SLPLoP), ACM.
To appear, Valparaíso, Chile, 2018.'
conference:
end_date: 2018-11-23
start_date: 2018-11-20
date_created: 2018-11-12T16:02:14Z
date_updated: 2022-01-06T07:01:57Z
ddc:
- '000'
department:
- _id: '66'
- _id: '276'
file:
- access_level: closed
content_type: application/pdf
creator: bahareh
date_created: 2018-11-29T23:41:07Z
date_updated: 2018-11-29T23:41:07Z
file_id: '5983'
file_name: Jazayerietal-SLPLoP18.pdf
file_size: 514038
relation: main_file
success: 1
file_date_updated: 2018-11-29T23:41:07Z
has_accepted_license: '1'
language:
- iso: eng
place: Valparaíso, Chile
project:
- _id: '1'
name: SFB 901
- _id: '17'
name: SFB 901 - Subproject C5
- _id: '4'
name: SFB 901 - Project Area C
publication: The Latin American Conference on Pattern Languages of Programs (SLPLoP)
publisher: ACM. To appear
series_title: To appear
status: public
title: 'Patterns of Store-oriented Software Ecosystems: Detection, Classification,
and Analysis of Design Options'
type: conference
user_id: '36399'
year: '2018'
...
---
_id: '5547'
author:
- first_name: Achim
full_name: Lösch, Achim
id: '43646'
last_name: Lösch
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
citation:
ama: 'Lösch A, Platzner M. A Highly Accurate Energy Model for Task Execution on
Heterogeneous Compute Nodes. In: 2018 IEEE 29th International Conference on
Application-Specific Systems, Architectures and Processors (ASAP). IEEE; 2018.
doi:10.1109/asap.2018.8445098'
apa: 'Lösch, A., & Platzner, M. (2018). A Highly Accurate Energy Model for Task
Execution on Heterogeneous Compute Nodes. In 2018 IEEE 29th International Conference
on Application-specific Systems, Architectures and Processors (ASAP). Milan,
Italy: IEEE. https://doi.org/10.1109/asap.2018.8445098'
bibtex: '@inproceedings{Lösch_Platzner_2018, title={A Highly Accurate Energy Model
for Task Execution on Heterogeneous Compute Nodes}, DOI={10.1109/asap.2018.8445098},
booktitle={2018 IEEE 29th International Conference on Application-specific Systems,
Architectures and Processors (ASAP)}, publisher={IEEE}, author={Lösch, Achim and
Platzner, Marco}, year={2018} }'
chicago: Lösch, Achim, and Marco Platzner. “A Highly Accurate Energy Model for Task
Execution on Heterogeneous Compute Nodes.” In 2018 IEEE 29th International
Conference on Application-Specific Systems, Architectures and Processors (ASAP).
IEEE, 2018. https://doi.org/10.1109/asap.2018.8445098.
ieee: A. Lösch and M. Platzner, “A Highly Accurate Energy Model for Task Execution
on Heterogeneous Compute Nodes,” in 2018 IEEE 29th International Conference
on Application-specific Systems, Architectures and Processors (ASAP), Milan,
Italy, 2018.
mla: Lösch, Achim, and Marco Platzner. “A Highly Accurate Energy Model for Task
Execution on Heterogeneous Compute Nodes.” 2018 IEEE 29th International Conference
on Application-Specific Systems, Architectures and Processors (ASAP), IEEE,
2018, doi:10.1109/asap.2018.8445098.
short: 'A. Lösch, M. Platzner, in: 2018 IEEE 29th International Conference on Application-Specific
Systems, Architectures and Processors (ASAP), IEEE, 2018.'
conference:
end_date: 2018-07-12
location: Milan, Italy
name: The 29th Annual IEEE International Conference on Application-specific Systems,
Architectures and Processors
start_date: 2018-07-10
date_created: 2018-11-14T09:26:53Z
date_updated: 2022-01-06T07:01:59Z
ddc:
- '040'
department:
- _id: '78'
doi: 10.1109/asap.2018.8445098
file:
- access_level: closed
content_type: application/pdf
creator: aloesch
date_created: 2018-11-14T09:40:42Z
date_updated: 2018-11-14T09:40:42Z
file_id: '5552'
file_name: loesch_asap2018.pdf
file_size: 2464949
relation: main_file
success: 1
file_date_updated: 2018-11-14T09:40:42Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '14'
name: SFB 901 - Subproject C2
- _id: '4'
name: SFB 901 - Project Area C
- _id: '1'
name: SFB 901
publication: 2018 IEEE 29th International Conference on Application-specific Systems,
Architectures and Processors (ASAP)
publication_identifier:
isbn:
- '9781538674796'
publication_status: published
publisher: IEEE
status: public
title: A Highly Accurate Energy Model for Task Execution on Heterogeneous Compute
Nodes
type: conference
user_id: '43646'
year: '2018'
...
---
_id: '6483'
author:
- first_name: Manuel
full_name: Peuster, Manuel
id: '13271'
last_name: Peuster
- first_name: Stefan Balthasar
full_name: Schneider, Stefan Balthasar
id: '35343'
last_name: Schneider
orcid: 0000-0001-8210-4011
- first_name: Frederic
full_name: Christ, Frederic
last_name: Christ
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: 'Peuster M, Schneider SB, Christ F, Karl H. A Prototyping Platform to Validate
and Verify Network Service Header-based Service Chains. In: IEEE Conference
on Network Function Virtualisation and Software Defined Networks (NFV-SDN) 5GNetApp.
Verona: IEEE; 2018.'
apa: 'Peuster, M., Schneider, S. B., Christ, F., & Karl, H. (2018). A Prototyping
Platform to Validate and Verify Network Service Header-based Service Chains. In
IEEE Conference on Network Function Virtualisation and Software Defined Networks
(NFV-SDN) 5GNetApp. Verona: IEEE.'
bibtex: '@inproceedings{Peuster_Schneider_Christ_Karl_2018, place={Verona}, title={A
Prototyping Platform to Validate and Verify Network Service Header-based Service
Chains}, booktitle={IEEE Conference on Network Function Virtualisation and Software
Defined Networks (NFV-SDN) 5GNetApp}, publisher={IEEE}, author={Peuster, Manuel
and Schneider, Stefan Balthasar and Christ, Frederic and Karl, Holger}, year={2018}
}'
chicago: 'Peuster, Manuel, Stefan Balthasar Schneider, Frederic Christ, and Holger
Karl. “A Prototyping Platform to Validate and Verify Network Service Header-Based
Service Chains.” In IEEE Conference on Network Function Virtualisation and
Software Defined Networks (NFV-SDN) 5GNetApp. Verona: IEEE, 2018.'
ieee: M. Peuster, S. B. Schneider, F. Christ, and H. Karl, “A Prototyping Platform
to Validate and Verify Network Service Header-based Service Chains,” in IEEE
Conference on Network Function Virtualisation and Software Defined Networks (NFV-SDN)
5GNetApp, Verona, 2018.
mla: Peuster, Manuel, et al. “A Prototyping Platform to Validate and Verify Network
Service Header-Based Service Chains.” IEEE Conference on Network Function Virtualisation
and Software Defined Networks (NFV-SDN) 5GNetApp, IEEE, 2018.
short: 'M. Peuster, S.B. Schneider, F. Christ, H. Karl, in: IEEE Conference on Network
Function Virtualisation and Software Defined Networks (NFV-SDN) 5GNetApp, IEEE,
Verona, 2018.'
conference:
end_date: 2018-11-29
location: Verona
name: IEEE Conference on Network Function Virtualisation and Software Defined Networks
(NFV-SDN) 5GNetApp
start_date: 2018-11-27
date_created: 2019-01-04T07:47:19Z
date_updated: 2022-01-06T07:03:07Z
ddc:
- '000'
department:
- _id: '75'
file:
- access_level: open_access
content_type: application/pdf
creator: peuster
date_created: 2019-01-04T07:46:21Z
date_updated: 2019-01-04T07:46:21Z
file_id: '6484'
file_name: main_for_ris.pdf
file_size: 541469
relation: main_file
file_date_updated: 2019-01-04T07:46:21Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
place: Verona
project:
- _id: '28'
grant_number: '761493'
name: 5G Development and validation platform for global industry-specific network
services and Apps
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '16'
name: SFB 901 - Subproject C4
publication: IEEE Conference on Network Function Virtualisation and Software Defined
Networks (NFV-SDN) 5GNetApp
publisher: IEEE
status: public
title: A Prototyping Platform to Validate and Verify Network Service Header-based
Service Chains
type: conference
user_id: '35343'
year: '2018'
...
---
_id: '6597'
author:
- first_name: Jakob
full_name: Juhnke, Jakob
id: '48090'
last_name: Juhnke
citation:
ama: Juhnke J. Models and Constructions for Secure Reputation Systems. Universität
Paderborn; 2018. doi:10.17619/UNIPB/1-570
apa: Juhnke, J. (2018). Models and Constructions for Secure Reputation Systems.
Universität Paderborn. https://doi.org/10.17619/UNIPB/1-570
bibtex: '@book{Juhnke_2018, title={Models and Constructions for Secure Reputation
Systems}, DOI={10.17619/UNIPB/1-570},
publisher={Universität Paderborn}, author={Juhnke, Jakob}, year={2018} }'
chicago: Juhnke, Jakob. Models and Constructions for Secure Reputation Systems.
Universität Paderborn, 2018. https://doi.org/10.17619/UNIPB/1-570.
ieee: J. Juhnke, Models and Constructions for Secure Reputation Systems.
Universität Paderborn, 2018.
mla: Juhnke, Jakob. Models and Constructions for Secure Reputation Systems.
Universität Paderborn, 2018, doi:10.17619/UNIPB/1-570.
short: J. Juhnke, Models and Constructions for Secure Reputation Systems, Universität
Paderborn, 2018.
date_created: 2019-01-10T07:51:07Z
date_updated: 2022-01-06T07:03:13Z
department:
- _id: '64'
doi: 10.17619/UNIPB/1-570
language:
- iso: eng
project:
- _id: '13'
name: SFB 901 - Subproject C1
- _id: '4'
name: SFB 901 - Project Area C
- _id: '1'
name: SFB 901
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
title: Models and Constructions for Secure Reputation Systems
type: dissertation
user_id: '477'
year: '2018'
...
---
_id: '669'
abstract:
- lang: eng
text: We study a new class of games which generalizes congestion games andits bottleneck
variant. We introduce congestion games with mixed objectives to modelnetwork scenarios
in which players seek to optimize for latency and bandwidths alike.We characterize
the (non-)existence of pure Nash equilibria (PNE), the convergenceof improvement
dynamics, the quality of equilibria and show the complexity of thedecision problem.
For games that do not possess PNE we give bounds on the approx-imation ratio of
approximate pure Nash equilibria.
author:
- first_name: Matthias
full_name: Feldotto, Matthias
id: '14052'
last_name: Feldotto
orcid: 0000-0003-1348-6516
- first_name: Lennart
full_name: Leder, Lennart
last_name: Leder
- first_name: Alexander
full_name: Skopalik, Alexander
id: '40384'
last_name: Skopalik
citation:
ama: Feldotto M, Leder L, Skopalik A. Congestion games with mixed objectives. Journal
of Combinatorial Optimization. 2018;36(4):1145-1167. doi:10.1007/s10878-017-0189-y
apa: Feldotto, M., Leder, L., & Skopalik, A. (2018). Congestion games with mixed
objectives. Journal of Combinatorial Optimization, 36(4), 1145–1167.
https://doi.org/10.1007/s10878-017-0189-y
bibtex: '@article{Feldotto_Leder_Skopalik_2018, title={Congestion games with mixed
objectives}, volume={36}, DOI={10.1007/s10878-017-0189-y},
number={4}, journal={Journal of Combinatorial Optimization}, publisher={Springer
Nature}, author={Feldotto, Matthias and Leder, Lennart and Skopalik, Alexander},
year={2018}, pages={1145–1167} }'
chicago: 'Feldotto, Matthias, Lennart Leder, and Alexander Skopalik. “Congestion
Games with Mixed Objectives.” Journal of Combinatorial Optimization 36,
no. 4 (2018): 1145–67. https://doi.org/10.1007/s10878-017-0189-y.'
ieee: M. Feldotto, L. Leder, and A. Skopalik, “Congestion games with mixed objectives,”
Journal of Combinatorial Optimization, vol. 36, no. 4, pp. 1145–1167, 2018.
mla: Feldotto, Matthias, et al. “Congestion Games with Mixed Objectives.” Journal
of Combinatorial Optimization, vol. 36, no. 4, Springer Nature, 2018, pp.
1145–67, doi:10.1007/s10878-017-0189-y.
short: M. Feldotto, L. Leder, A. Skopalik, Journal of Combinatorial Optimization
36 (2018) 1145–1167.
date_created: 2017-10-26T14:11:04Z
date_updated: 2022-01-06T07:03:15Z
ddc:
- '000'
department:
- _id: '63'
- _id: '541'
doi: 10.1007/s10878-017-0189-y
external_id:
arxiv:
- '1607.05143'
file:
- access_level: closed
content_type: application/pdf
creator: feldi
date_created: 2018-10-31T16:57:32Z
date_updated: 2018-10-31T16:57:32Z
file_id: '5226'
file_name: Feldotto2018_Article_CongestionGamesWithMixedObject.pdf
file_size: 605207
relation: main_file
success: 1
file_date_updated: 2018-10-31T16:57:32Z
has_accepted_license: '1'
intvolume: ' 36'
issue: '4'
language:
- iso: eng
page: 1145-1167
project:
- _id: '1'
name: SFB 901
- _id: '7'
name: SFB 901 - Subprojekt A3
- _id: '2'
name: SFB 901 - Project Area A
publication: Journal of Combinatorial Optimization
publication_identifier:
issn:
- 1382-6905
- 1573-2886
publication_status: published
publisher: Springer Nature
status: public
title: Congestion games with mixed objectives
type: journal_article
user_id: '14052'
volume: 36
year: '2018'
...
---
_id: '6970'
abstract:
- lang: eng
text: "Dynamic allocation of resources is a key feature in network function virtualization
(NFV), enabling flexible adjustment of slices and contained network services to
ever-changing service demands. \r\nConsidering resource allocation across the
entire network, many authors have proposed approaches to optimize the placement
and chaining of virtual network function (VNF) instances and the allocation of
resources to these VNF instances. In doing so, various optimization objectives
are conceivable, e.g., minimizing certain required resources or the end-to-end
delay of the placed services.\r\n\r\nIn this paper, we investigate the relationship
between four typical optimization objectives when coordinating the placement and
resource allocation of chained VNF instances. We observe an interesting trade-off
between minimizing the overhead of starting/stopping VNF instances and all other
objectives when adapting to changed service demands."
author:
- first_name: Stefan Balthasar
full_name: Schneider, Stefan Balthasar
id: '35343'
last_name: Schneider
orcid: 0000-0001-8210-4011
- first_name: Sevil
full_name: Dräxler, Sevil
id: '31764'
last_name: Dräxler
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: 'Schneider SB, Dräxler S, Karl H. Trade-offs in Dynamic Resource Allocation
in Network Function Virtualization. In: IEEE Global Communications Conference
(GLOBECOM 2018). IEEE; 2018.'
apa: 'Schneider, S. B., Dräxler, S., & Karl, H. (2018). Trade-offs in Dynamic
Resource Allocation in Network Function Virtualization. In IEEE Global Communications
Conference (GLOBECOM 2018). Abu Dhabi, UAE: IEEE.'
bibtex: '@inproceedings{Schneider_Dräxler_Karl_2018, title={Trade-offs in Dynamic
Resource Allocation in Network Function Virtualization}, booktitle={IEEE Global
Communications Conference (GLOBECOM 2018)}, publisher={IEEE}, author={Schneider,
Stefan Balthasar and Dräxler, Sevil and Karl, Holger}, year={2018} }'
chicago: Schneider, Stefan Balthasar, Sevil Dräxler, and Holger Karl. “Trade-Offs
in Dynamic Resource Allocation in Network Function Virtualization.” In IEEE
Global Communications Conference (GLOBECOM 2018). IEEE, 2018.
ieee: S. B. Schneider, S. Dräxler, and H. Karl, “Trade-offs in Dynamic Resource
Allocation in Network Function Virtualization,” in IEEE Global Communications
Conference (GLOBECOM 2018), Abu Dhabi, UAE, 2018.
mla: Schneider, Stefan Balthasar, et al. “Trade-Offs in Dynamic Resource Allocation
in Network Function Virtualization.” IEEE Global Communications Conference
(GLOBECOM 2018), IEEE, 2018.
short: 'S.B. Schneider, S. Dräxler, H. Karl, in: IEEE Global Communications Conference
(GLOBECOM 2018), IEEE, 2018.'
conference:
location: Abu Dhabi, UAE
name: IEEE Global Communications Conference (GLOBECOM 2018)
date_created: 2019-01-24T13:53:22Z
date_updated: 2022-01-06T07:03:24Z
ddc:
- '040'
department:
- _id: '75'
file:
- access_level: open_access
content_type: application/pdf
creator: stschn
date_created: 2019-01-24T13:53:16Z
date_updated: 2019-01-24T13:53:16Z
file_id: '6971'
file_name: preprint_ris.pdf
file_size: 422196
relation: main_file
file_date_updated: 2019-01-24T13:53:16Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
project:
- _id: '28'
grant_number: '761493'
name: 5G Development and validation platform for global industry-specific network
services and Apps
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '16'
name: SFB 901 - Subproject C4
publication: IEEE Global Communications Conference (GLOBECOM 2018)
publisher: IEEE
status: public
title: Trade-offs in Dynamic Resource Allocation in Network Function Virtualization
type: conference
user_id: '35343'
year: '2018'
...
---
_id: '6972'
abstract:
- lang: eng
text: "In recent years, a variety of different approaches\r\nhave been proposed
to tackle the problem of scaling and placing\r\nnetwork services, consisting of
interconnected virtual network\r\nfunctions (VNFs). This paper presents a placement
abstraction\r\nlayer (PAL) that provides a clear and simple northbound interface\r\nfor
using such algorithms while hiding their internal\r\nfunctionality and implementation.
Through its southbound interface,\r\nPAL can connect to different back ends that
evaluate\r\nthe calculated placements, e.g., using simulations, emulations, or\r\ntestbed
approaches. As an example for such evaluation back ends,\r\nwe introduce a novel
placement emulation framework (PEF)\r\nthat allows executing calculated placements
using real, containerbased\r\nVNFs on real-world network topologies. In a case
study,\r\nwe show how PAL and PEF facilitate reusing and evaluating\r\nplacement
algorithms as well as validating their underlying\r\nmodels and performance claims."
author:
- first_name: Stefan Balthasar
full_name: Schneider, Stefan Balthasar
id: '35343'
last_name: Schneider
orcid: 0000-0001-8210-4011
- first_name: Manuel
full_name: Peuster, Manuel
id: '13271'
last_name: Peuster
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: 'Schneider SB, Peuster M, Karl H. A Generic Emulation Framework for Reusing
and Evaluating VNF Placement Algorithms. In: IEEE Conference on Network Function
Virtualization and Software Defined Networks (NFV-SDN 2018). IEEE; 2018. doi:10.1109/NFV-SDN.2018.8725795'
apa: 'Schneider, S. B., Peuster, M., & Karl, H. (2018). A Generic Emulation
Framework for Reusing and Evaluating VNF Placement Algorithms. In IEEE Conference
on Network Function Virtualization and Software Defined Networks (NFV-SDN 2018).
Verona, Italy: IEEE. https://doi.org/10.1109/NFV-SDN.2018.8725795'
bibtex: '@inproceedings{Schneider_Peuster_Karl_2018, title={A Generic Emulation
Framework for Reusing and Evaluating VNF Placement Algorithms}, DOI={10.1109/NFV-SDN.2018.8725795},
booktitle={IEEE Conference on Network Function Virtualization and Software Defined
Networks (NFV-SDN 2018)}, publisher={IEEE}, author={Schneider, Stefan Balthasar
and Peuster, Manuel and Karl, Holger}, year={2018} }'
chicago: Schneider, Stefan Balthasar, Manuel Peuster, and Holger Karl. “A Generic
Emulation Framework for Reusing and Evaluating VNF Placement Algorithms.” In IEEE
Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN
2018). IEEE, 2018. https://doi.org/10.1109/NFV-SDN.2018.8725795.
ieee: S. B. Schneider, M. Peuster, and H. Karl, “A Generic Emulation Framework for
Reusing and Evaluating VNF Placement Algorithms,” in IEEE Conference on Network
Function Virtualization and Software Defined Networks (NFV-SDN 2018), Verona,
Italy, 2018.
mla: Schneider, Stefan Balthasar, et al. “A Generic Emulation Framework for Reusing
and Evaluating VNF Placement Algorithms.” IEEE Conference on Network Function
Virtualization and Software Defined Networks (NFV-SDN 2018), IEEE, 2018, doi:10.1109/NFV-SDN.2018.8725795.
short: 'S.B. Schneider, M. Peuster, H. Karl, in: IEEE Conference on Network Function
Virtualization and Software Defined Networks (NFV-SDN 2018), IEEE, 2018.'
conference:
location: Verona, Italy
name: IEEE Conference on Network Function Virtualization and Software Defined Networks
(NFV-SDN 2018)
date_created: 2019-01-24T14:10:17Z
date_updated: 2022-01-06T07:03:24Z
ddc:
- '040'
department:
- _id: '75'
doi: 10.1109/NFV-SDN.2018.8725795
file:
- access_level: open_access
content_type: application/pdf
creator: stschn
date_created: 2019-01-24T14:10:08Z
date_updated: 2019-01-24T14:25:23Z
file_id: '6973'
file_name: preprint_ris.pdf
file_size: 468396
relation: main_file
file_date_updated: 2019-01-24T14:25:23Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- url: https://ieeexplore.ieee.org/abstract/document/8725795
oa: '1'
project:
- _id: '28'
grant_number: '761493'
name: 5G Development and validation platform for global industry-specific network
services and Apps
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '16'
name: SFB 901 - Subproject C4
publication: IEEE Conference on Network Function Virtualization and Software Defined
Networks (NFV-SDN 2018)
publisher: IEEE
status: public
title: A Generic Emulation Framework for Reusing and Evaluating VNF Placement Algorithms
type: conference
user_id: '35343'
year: '2018'
...
---
_id: '6974'
abstract:
- lang: eng
text: "A key challenge of network function virtualization\r\n(NFV) is the complexity
of developing and deploying new\r\nnetwork services. Currently, development requires
many manual\r\nsteps that are time-consuming and error-prone (e.g., for creating\r\nservice
descriptors). Furthermore, existing management and\r\norchestration (MANO) platforms
only offer limited support of\r\nstandardized descriptor models or package formats,
limiting the\r\nre-usability of network services.\r\n\r\nTo this end, we introduce
a fully integrated, open-source\r\nNFV service development kit (SDK) with multi-MANO
platform\r\nsupport. Our SDK simplifies many NFV service development\r\nsteps
by offering initial generation of descriptors, advanced\r\nproject management,
as well as fully automated packaging and\r\nsubmission for on-boarding. To achieve
multi-platform support,\r\nwe present a package format that extends ETSI’s VNF
package\r\nformat. In this demonstration, we present the end-to-end workflow\r\nto
develop an NFV service that is then packaged for multiple\r\nplatforms, i.e.,
5GTANGO and OSM."
author:
- first_name: Stefan Balthasar
full_name: Schneider, Stefan Balthasar
id: '35343'
last_name: Schneider
orcid: 0000-0001-8210-4011
- first_name: Manuel
full_name: Peuster, Manuel
id: '13271'
last_name: Peuster
- first_name: Wouter
full_name: Tavernier, Wouter
last_name: Tavernier
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: 'Schneider SB, Peuster M, Tavernier W, Karl H. A Fully Integrated Multi-Platform
NFV SDK. In: IEEE Conference on Network Function Virtualization and Software
Defined Networks (NFV-SDN 2018). IEEE; 2018. doi:10.1109/NFV-SDN.2018.8725794'
apa: 'Schneider, S. B., Peuster, M., Tavernier, W., & Karl, H. (2018). A Fully
Integrated Multi-Platform NFV SDK. In IEEE Conference on Network Function Virtualization
and Software Defined Networks (NFV-SDN 2018). Verona, Italy: IEEE. https://doi.org/10.1109/NFV-SDN.2018.8725794'
bibtex: '@inproceedings{Schneider_Peuster_Tavernier_Karl_2018, title={A Fully Integrated
Multi-Platform NFV SDK}, DOI={10.1109/NFV-SDN.2018.8725794},
booktitle={IEEE Conference on Network Function Virtualization and Software Defined
Networks (NFV-SDN 2018)}, publisher={IEEE}, author={Schneider, Stefan Balthasar
and Peuster, Manuel and Tavernier, Wouter and Karl, Holger}, year={2018} }'
chicago: Schneider, Stefan Balthasar, Manuel Peuster, Wouter Tavernier, and Holger
Karl. “A Fully Integrated Multi-Platform NFV SDK.” In IEEE Conference on Network
Function Virtualization and Software Defined Networks (NFV-SDN 2018). IEEE,
2018. https://doi.org/10.1109/NFV-SDN.2018.8725794.
ieee: S. B. Schneider, M. Peuster, W. Tavernier, and H. Karl, “A Fully Integrated
Multi-Platform NFV SDK,” in IEEE Conference on Network Function Virtualization
and Software Defined Networks (NFV-SDN 2018), Verona, Italy, 2018.
mla: Schneider, Stefan Balthasar, et al. “A Fully Integrated Multi-Platform NFV
SDK.” IEEE Conference on Network Function Virtualization and Software Defined
Networks (NFV-SDN 2018), IEEE, 2018, doi:10.1109/NFV-SDN.2018.8725794.
short: 'S.B. Schneider, M. Peuster, W. Tavernier, H. Karl, in: IEEE Conference on
Network Function Virtualization and Software Defined Networks (NFV-SDN 2018),
IEEE, 2018.'
conference:
location: Verona, Italy
name: IEEE Conference on Network Function Virtualization and Software Defined Networks
(NFV-SDN 2018)
date_created: 2019-01-24T14:17:58Z
date_updated: 2022-01-06T07:03:25Z
ddc:
- '040'
department:
- _id: '75'
doi: 10.1109/NFV-SDN.2018.8725794
file:
- access_level: open_access
content_type: application/pdf
creator: stschn
date_created: 2019-01-24T14:17:29Z
date_updated: 2019-01-24T14:26:23Z
file_id: '6975'
file_name: Pre-print.pdf
file_size: 475022
relation: main_file
file_date_updated: 2019-01-24T14:26:23Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- url: https://ieeexplore.ieee.org/abstract/document/8725794
oa: '1'
project:
- _id: '28'
grant_number: '761493'
name: 5G Development and validation platform for global industry-specific network
services and Apps
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '16'
name: SFB 901 - Subproject C4
publication: IEEE Conference on Network Function Virtualization and Software Defined
Networks (NFV-SDN 2018)
publisher: IEEE
status: public
title: A Fully Integrated Multi-Platform NFV SDK
type: conference
user_id: '35343'
year: '2018'
...