---
_id: '200'
author:
- first_name: Maximilian
full_name: Drees, Maximilian
last_name: Drees
citation:
ama: Drees M. Existence and Properties of Pure Nash Equilibria in Budget Games.
Universität Paderborn; 2016.
apa: Drees, M. (2016). Existence and Properties of Pure Nash Equilibria in Budget
Games. Universität Paderborn.
bibtex: '@book{Drees_2016, title={Existence and Properties of Pure Nash Equilibria
in Budget Games}, publisher={Universität Paderborn}, author={Drees, Maximilian},
year={2016} }'
chicago: Drees, Maximilian. Existence and Properties of Pure Nash Equilibria
in Budget Games. Universität Paderborn, 2016.
ieee: M. Drees, Existence and Properties of Pure Nash Equilibria in Budget Games.
Universität Paderborn, 2016.
mla: Drees, Maximilian. Existence and Properties of Pure Nash Equilibria in Budget
Games. Universität Paderborn, 2016.
short: M. Drees, Existence and Properties of Pure Nash Equilibria in Budget Games,
Universität Paderborn, 2016.
date_created: 2017-10-17T12:41:31Z
date_updated: 2022-01-06T06:54:18Z
ddc:
- '040'
department:
- _id: '63'
- _id: '541'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T10:45:57Z
date_updated: 2018-03-21T10:45:57Z
file_id: '1525'
file_name: 200-thesis.pdf
file_size: 880390
relation: main_file
success: 1
file_date_updated: 2018-03-21T10:45:57Z
has_accepted_license: '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
publisher: Universität Paderborn
related_material:
link:
- relation: confirmation
url: https://nbn-resolving.de/urn:nbn:de:hbz:466:2-24915
status: public
supervisor:
- first_name: Alexander
full_name: Skopalik, Alexander
id: '40384'
last_name: Skopalik
title: Existence and Properties of Pure Nash Equilibria in Budget Games
type: dissertation
user_id: '15415'
year: '2016'
...
---
_id: '201'
author:
- first_name: Henrik
full_name: Bröcher, Henrik
last_name: Bröcher
citation:
ama: Bröcher H. Evaluation von Graphpartitionierungsalgorithmen im Kontext von
Konfigurierbarer Softwarezertifizierung. Universität Paderborn; 2016.
apa: Bröcher, H. (2016). Evaluation von Graphpartitionierungsalgorithmen im Kontext
von Konfigurierbarer Softwarezertifizierung. Universität Paderborn.
bibtex: '@book{Bröcher_2016, title={Evaluation von Graphpartitionierungsalgorithmen
im Kontext von Konfigurierbarer Softwarezertifizierung}, publisher={Universität
Paderborn}, author={Bröcher, Henrik}, year={2016} }'
chicago: Bröcher, Henrik. Evaluation von Graphpartitionierungsalgorithmen im
Kontext von Konfigurierbarer Softwarezertifizierung. Universität Paderborn,
2016.
ieee: H. Bröcher, Evaluation von Graphpartitionierungsalgorithmen im Kontext
von Konfigurierbarer Softwarezertifizierung. Universität Paderborn, 2016.
mla: Bröcher, Henrik. Evaluation von Graphpartitionierungsalgorithmen im Kontext
von Konfigurierbarer Softwarezertifizierung. Universität Paderborn, 2016.
short: H. Bröcher, Evaluation von Graphpartitionierungsalgorithmen im Kontext von
Konfigurierbarer Softwarezertifizierung, Universität Paderborn, 2016.
date_created: 2017-10-17T12:41:31Z
date_updated: 2022-01-06T06:54:18Z
department:
- _id: '77'
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '12'
name: SFB 901 - Subprojekt B4
- _id: '3'
name: SFB 901 - Project Area B
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Heike
full_name: Wehrheim, Heike
last_name: Wehrheim
title: Evaluation von Graphpartitionierungsalgorithmen im Kontext von Konfigurierbarer
Softwarezertifizierung
type: bachelorsthesis
user_id: '15504'
year: '2016'
...
---
_id: '202'
author:
- first_name: Eugen
full_name: Dimant, Eugen
last_name: Dimant
citation:
ama: 'Dimant E. Economics of Corruption and Crime: An Interdisciplinary Approach
to Behavioral Ethics. Universität Paderborn; 2016.'
apa: 'Dimant, E. (2016). Economics of Corruption and Crime: An Interdisciplinary
Approach to Behavioral Ethics. Universität Paderborn.'
bibtex: '@book{Dimant_2016, title={Economics of Corruption and Crime: An Interdisciplinary
Approach to Behavioral Ethics}, publisher={Universität Paderborn}, author={Dimant,
Eugen}, year={2016} }'
chicago: 'Dimant, Eugen. Economics of Corruption and Crime: An Interdisciplinary
Approach to Behavioral Ethics. Universität Paderborn, 2016.'
ieee: 'E. Dimant, Economics of Corruption and Crime: An Interdisciplinary Approach
to Behavioral Ethics. Universität Paderborn, 2016.'
mla: 'Dimant, Eugen. Economics of Corruption and Crime: An Interdisciplinary
Approach to Behavioral Ethics. Universität Paderborn, 2016.'
short: 'E. Dimant, Economics of Corruption and Crime: An Interdisciplinary Approach
to Behavioral Ethics, Universität Paderborn, 2016.'
date_created: 2017-10-17T12:41:31Z
date_updated: 2022-01-06T06:54:22Z
ddc:
- '040'
department:
- _id: '280'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T10:45:23Z
date_updated: 2018-03-21T10:45:23Z
file_id: '1524'
file_name: 202-Dissertation_Final.pdf
file_size: 8752559
relation: main_file
success: 1
file_date_updated: 2018-03-21T10:45:23Z
has_accepted_license: '1'
project:
- _id: '1'
name: SFB 901
- _id: '7'
name: SFB 901 - Subprojekt A3
- _id: '2'
name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Burkhard
full_name: Hehenkamp, Burkhard
id: '37339'
last_name: Hehenkamp
title: 'Economics of Corruption and Crime: An Interdisciplinary Approach to Behavioral
Ethics'
type: dissertation
user_id: '42447'
year: '2016'
...
---
_id: '2570'
abstract:
- lang: eng
text: On an intermediate goods market we consider vertical and horizontal product
differentiation and analyze the impact of simultaneous competition for resources
and the demand of customers on the market outcome. Asymmetries between intermediaries
may arise due to distinct product qualities as well as by reasons of different
production technologies. The intermediaries compete on the output market by choosing
production quantities sequentially and for the supplies of a monopolistic input
supplier on the input market. It turns out that there exist differences in product
quality and productivities such that an intermediary being the Stackelberg leader
has no incentive to procure inputs, whereas in the role of the Stackelberg follower
will participate in the market. Moreover, we find that given an intermediary is
more competitive, his equilibrium output quantity is higher when being the leader
than when being the follower. Interestingly, if the intermediary is less competitive
and goods are complements, there may exist asymmetries such that an intermediary
being in the position of the Stackelberg follower offers higher output quantities
in equilibrium than when being in the position of the Stackelberg leader.
author:
- first_name: Jochen
full_name: Manegold, Jochen
last_name: Manegold
citation:
ama: Manegold J. Stackelberg Competition among Intermediaries in a Differentiated
Duopoly with Product Innovation. Vol 98. CIE Working Paper Series, Paderborn
University; 2016.
apa: Manegold, J. (2016). Stackelberg Competition among Intermediaries in a Differentiated
Duopoly with Product Innovation (Vol. 98). CIE Working Paper Series, Paderborn
University.
bibtex: '@book{Manegold_2016, series={Working Papers CIE}, title={Stackelberg Competition
among Intermediaries in a Differentiated Duopoly with Product Innovation}, volume={98},
publisher={CIE Working Paper Series, Paderborn University}, author={Manegold,
Jochen}, year={2016}, collection={Working Papers CIE} }'
chicago: Manegold, Jochen. Stackelberg Competition among Intermediaries in a
Differentiated Duopoly with Product Innovation. Vol. 98. Working Papers CIE.
CIE Working Paper Series, Paderborn University, 2016.
ieee: J. Manegold, Stackelberg Competition among Intermediaries in a Differentiated
Duopoly with Product Innovation, vol. 98. CIE Working Paper Series, Paderborn
University, 2016.
mla: Manegold, Jochen. Stackelberg Competition among Intermediaries in a Differentiated
Duopoly with Product Innovation. Vol. 98, CIE Working Paper Series, Paderborn
University, 2016.
short: J. Manegold, Stackelberg Competition among Intermediaries in a Differentiated
Duopoly with Product Innovation, CIE Working Paper Series, Paderborn University,
2016.
date_created: 2018-05-03T08:06:05Z
date_updated: 2022-01-06T06:57:11Z
ddc:
- '040'
department:
- _id: '205'
- _id: '475'
file:
- access_level: closed
content_type: application/pdf
creator: stela
date_created: 2018-10-31T09:16:36Z
date_updated: 2018-10-31T09:16:36Z
file_id: '5145'
file_name: WP - Stackelberg Competition among Intermediaries in a Differentiated
Duopoly with Product Innovation.pdf
file_size: 776029
relation: main_file
success: 1
file_date_updated: 2018-10-31T09:16:36Z
has_accepted_license: '1'
intvolume: ' 98'
keyword:
- Input Market
- Product Quality
- Quantity Competition
- Stackelberg Competition
- Product Innovation
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '7'
name: SFB 901 - Subproject A3
publisher: CIE Working Paper Series, Paderborn University
series_title: Working Papers CIE
status: public
title: Stackelberg Competition among Intermediaries in a Differentiated Duopoly with
Product Innovation
type: working_paper
user_id: '65453'
volume: 98
year: '2016'
...
---
_id: '3308'
author:
- first_name: 'Robin '
full_name: 'Breuer, Robin '
last_name: Breuer
citation:
ama: 'Breuer R. Monitoring in Franchise-Netzwerken: Eine ökonomische Analyse.
Universität Paderborn; 2016.'
apa: 'Breuer, R. (2016). Monitoring in Franchise-Netzwerken: Eine ökonomische
Analyse. Universität Paderborn.'
bibtex: '@book{Breuer_2016, title={Monitoring in Franchise-Netzwerken: Eine ökonomische
Analyse}, publisher={Universität Paderborn}, author={Breuer, Robin }, year={2016}
}'
chicago: 'Breuer, Robin . Monitoring in Franchise-Netzwerken: Eine ökonomische
Analyse. Universität Paderborn, 2016.'
ieee: 'R. Breuer, Monitoring in Franchise-Netzwerken: Eine ökonomische Analyse.
Universität Paderborn, 2016.'
mla: 'Breuer, Robin. Monitoring in Franchise-Netzwerken: Eine ökonomische Analyse.
Universität Paderborn, 2016.'
short: 'R. Breuer, Monitoring in Franchise-Netzwerken: Eine ökonomische Analyse,
Universität Paderborn, 2016.'
date_created: 2018-06-22T11:46:37Z
date_updated: 2022-01-06T06:59:10Z
department:
- _id: '183'
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
supervisor:
- first_name: Bernd
full_name: Frick, Bernd
last_name: Frick
title: 'Monitoring in Franchise-Netzwerken: Eine ökonomische Analyse'
type: bachelorsthesis
user_id: '477'
year: '2016'
...
---
_id: '3311'
author:
- first_name: Michaela
full_name: Amedick, Michaela
last_name: Amedick
citation:
ama: 'Amedick M. Informationsasymmetrien auf dem Spendenmarkt und Möglichkeiten
ihrer Reduktion: Eine Prinzipal-Agenten-Perspektive von Online Spenden. Universität
Paderborn; 2016.'
apa: 'Amedick, M. (2016). Informationsasymmetrien auf dem Spendenmarkt und Möglichkeiten
ihrer Reduktion: Eine Prinzipal-Agenten-Perspektive von Online Spenden. Universität
Paderborn.'
bibtex: '@book{Amedick_2016, title={Informationsasymmetrien auf dem Spendenmarkt
und Möglichkeiten ihrer Reduktion: Eine Prinzipal-Agenten-Perspektive von Online
Spenden}, publisher={Universität Paderborn}, author={Amedick, Michaela}, year={2016}
}'
chicago: 'Amedick, Michaela. Informationsasymmetrien auf dem Spendenmarkt und
Möglichkeiten ihrer Reduktion: Eine Prinzipal-Agenten-Perspektive von Online Spenden.
Universität Paderborn, 2016.'
ieee: 'M. Amedick, Informationsasymmetrien auf dem Spendenmarkt und Möglichkeiten
ihrer Reduktion: Eine Prinzipal-Agenten-Perspektive von Online Spenden. Universität
Paderborn, 2016.'
mla: 'Amedick, Michaela. Informationsasymmetrien auf dem Spendenmarkt und Möglichkeiten
ihrer Reduktion: Eine Prinzipal-Agenten-Perspektive von Online Spenden. Universität
Paderborn, 2016.'
short: 'M. Amedick, Informationsasymmetrien auf dem Spendenmarkt und Möglichkeiten
ihrer Reduktion: Eine Prinzipal-Agenten-Perspektive von Online Spenden, Universität
Paderborn, 2016.'
date_created: 2018-06-22T12:01:15Z
date_updated: 2022-01-06T06:59:10Z
department:
- _id: '183'
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
supervisor:
- first_name: Bernd
full_name: Frick, Bernd
last_name: Frick
title: 'Informationsasymmetrien auf dem Spendenmarkt und Möglichkeiten ihrer Reduktion:
Eine Prinzipal-Agenten-Perspektive von Online Spenden'
type: mastersthesis
user_id: '477'
year: '2016'
...
---
_id: '3318'
author:
- first_name: Vitalik
full_name: Melnikov, Vitalik
last_name: Melnikov
- first_name: Eyke
full_name: Hüllermeier, Eyke
id: '48129'
last_name: Hüllermeier
- first_name: Daniel
full_name: Kaimann, Daniel
id: '18949'
last_name: Kaimann
- first_name: 'Bernd '
full_name: 'Frick, Bernd '
last_name: Frick
- first_name: ' Pritha '
full_name: 'Gupta, Pritha '
last_name: Gupta
citation:
ama: 'Melnikov V, Hüllermeier E, Kaimann D, Frick B, Gupta Pritha . Pairwise versus
Pointwise Ranking: A Case Study. Schedae Informaticae. 2016;25. doi:10.4467/20838476si.16.006.6187'
apa: 'Melnikov, V., Hüllermeier, E., Kaimann, D., Frick, B., & Gupta, Pritha
. (2016). Pairwise versus Pointwise Ranking: A Case Study. Schedae Informaticae,
25. https://doi.org/10.4467/20838476si.16.006.6187'
bibtex: '@article{Melnikov_Hüllermeier_Kaimann_Frick_Gupta_2016, title={Pairwise
versus Pointwise Ranking: A Case Study}, volume={25}, DOI={10.4467/20838476si.16.006.6187},
journal={Schedae Informaticae}, publisher={Uniwersytet Jagiellonski - Wydawnictwo
Uniwersytetu Jagiellonskiego}, author={Melnikov, Vitalik and Hüllermeier, Eyke
and Kaimann, Daniel and Frick, Bernd and Gupta, Pritha }, year={2016} }'
chicago: 'Melnikov, Vitalik, Eyke Hüllermeier, Daniel Kaimann, Bernd Frick, and Pritha Gupta.
“Pairwise versus Pointwise Ranking: A Case Study.” Schedae Informaticae
25 (2016). https://doi.org/10.4467/20838476si.16.006.6187.'
ieee: 'V. Melnikov, E. Hüllermeier, D. Kaimann, B. Frick, and Pritha Gupta, “Pairwise
versus Pointwise Ranking: A Case Study,” Schedae Informaticae, vol. 25,
2016.'
mla: 'Melnikov, Vitalik, et al. “Pairwise versus Pointwise Ranking: A Case Study.”
Schedae Informaticae, vol. 25, Uniwersytet Jagiellonski - Wydawnictwo Uniwersytetu
Jagiellonskiego, 2016, doi:10.4467/20838476si.16.006.6187.'
short: V. Melnikov, E. Hüllermeier, D. Kaimann, B. Frick, Pritha Gupta, Schedae
Informaticae 25 (2016).
date_created: 2018-06-22T14:49:40Z
date_updated: 2022-01-06T06:59:10Z
ddc:
- '000'
department:
- _id: '355'
- _id: '183'
doi: 10.4467/20838476si.16.006.6187
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T15:54:38Z
date_updated: 2018-11-02T15:54:38Z
file_id: '5317'
file_name: roz-6-Melnikov.pdf
file_size: 1002478
relation: main_file
success: 1
file_date_updated: 2018-11-02T15:54:38Z
has_accepted_license: '1'
intvolume: ' 25'
language:
- iso: eng
project:
- _id: '3'
name: SFB 901 - Project Area B
- _id: '11'
name: SFB 901 - Subproject B3
- _id: '8'
name: SFB 901 - Subproject A4
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
publication: Schedae Informaticae
publication_identifier:
issn:
- 2083-8476
publication_status: published
publisher: Uniwersytet Jagiellonski - Wydawnictwo Uniwersytetu Jagiellonskiego
status: public
title: 'Pairwise versus Pointwise Ranking: A Case Study'
type: journal_article
user_id: '15504'
volume: 25
year: '2016'
...
---
_id: '3157'
author:
- first_name: Steffen
full_name: Beringer, Steffen
last_name: Beringer
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Beringer S, Wehrheim H. Verification of AUTOSAR Software Architectures with
Timed Automata. In: H. ter Beek M, Gnesi S, Knapp A, eds. Critical Systems:
Formal Methods and Automated Verification - Joint 21st International Workshop
on Formal Methods for Industrial Critical Systems and 16th International Workshop
on Automated Verification of Critical Systems, FMICS-AVoCS 2016, Pisa, Italy,
September 26-28, 2016, Proceedings. Lecture Notes in Computer Science. ; 2016:189--204.
doi:10.1007/978-3-319-45943-1_13'
apa: 'Beringer, S., & Wehrheim, H. (2016). Verification of AUTOSAR Software
Architectures with Timed Automata. In M. H. ter Beek, S. Gnesi, & A. Knapp
(Eds.), Critical Systems: Formal Methods and Automated Verification - Joint
21st International Workshop on Formal Methods for Industrial Critical Systems
and 16th International Workshop on Automated Verification of Critical Systems,
FMICS-AVoCS 2016, Pisa, Italy, September 26-28, 2016, Proceedings (pp. 189--204).
https://doi.org/10.1007/978-3-319-45943-1_13'
bibtex: '@inproceedings{Beringer_Wehrheim_2016, series={Lecture Notes in Computer
Science}, title={Verification of AUTOSAR Software Architectures with Timed Automata},
DOI={10.1007/978-3-319-45943-1_13},
booktitle={Critical Systems: Formal Methods and Automated Verification - Joint
21st International Workshop on Formal Methods for Industrial Critical Systems
and 16th International Workshop on Automated Verification of Critical Systems,
FMICS-AVoCS 2016, Pisa, Italy, September 26-28, 2016, Proceedings}, author={Beringer,
Steffen and Wehrheim, Heike}, editor={H. ter Beek, Maurice and Gnesi, Stefania
and Knapp, AlexanderEditors}, year={2016}, pages={189--204}, collection={Lecture
Notes in Computer Science} }'
chicago: 'Beringer, Steffen, and Heike Wehrheim. “Verification of AUTOSAR Software
Architectures with Timed Automata.” In Critical Systems: Formal Methods and
Automated Verification - Joint 21st International Workshop on Formal Methods for
Industrial Critical Systems and 16th International Workshop on Automated Verification
of Critical Systems, FMICS-AVoCS 2016, Pisa, Italy, September 26-28, 2016, Proceedings,
edited by Maurice H. ter Beek, Stefania Gnesi, and Alexander Knapp, 189--204.
Lecture Notes in Computer Science, 2016. https://doi.org/10.1007/978-3-319-45943-1_13.'
ieee: 'S. Beringer and H. Wehrheim, “Verification of AUTOSAR Software Architectures
with Timed Automata,” in Critical Systems: Formal Methods and Automated Verification
- Joint 21st International Workshop on Formal Methods for Industrial Critical
Systems and 16th International Workshop on Automated Verification of Critical
Systems, FMICS-AVoCS 2016, Pisa, Italy, September 26-28, 2016, Proceedings,
2016, pp. 189--204.'
mla: 'Beringer, Steffen, and Heike Wehrheim. “Verification of AUTOSAR Software Architectures
with Timed Automata.” Critical Systems: Formal Methods and Automated Verification
- Joint 21st International Workshop on Formal Methods for Industrial Critical
Systems and 16th International Workshop on Automated Verification of Critical
Systems, FMICS-AVoCS 2016, Pisa, Italy, September 26-28, 2016, Proceedings,
edited by Maurice H. ter Beek et al., 2016, pp. 189--204, doi:10.1007/978-3-319-45943-1_13.'
short: 'S. Beringer, H. Wehrheim, in: M. H. ter Beek, S. Gnesi, A. Knapp (Eds.),
Critical Systems: Formal Methods and Automated Verification - Joint 21st International
Workshop on Formal Methods for Industrial Critical Systems and 16th International
Workshop on Automated Verification of Critical Systems, FMICS-AVoCS 2016, Pisa,
Italy, September 26-28, 2016, Proceedings, 2016, pp. 189--204.'
date_created: 2018-06-13T07:39:35Z
date_updated: 2022-01-06T06:59:01Z
ddc:
- '000'
department:
- _id: '77'
doi: 10.1007/978-3-319-45943-1_13
editor:
- first_name: Maurice
full_name: H. ter Beek, Maurice
last_name: H. ter Beek
- first_name: Stefania
full_name: Gnesi, Stefania
last_name: Gnesi
- first_name: Alexander
full_name: Knapp, Alexander
last_name: Knapp
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T14:17:13Z
date_updated: 2018-11-02T14:17:13Z
file_id: '5267'
file_name: VerificationOfAUTOSARSoftwareA.pdf
file_size: 2640695
relation: main_file
success: 1
file_date_updated: 2018-11-02T14:17:13Z
has_accepted_license: '1'
language:
- iso: eng
page: 189--204
project:
- _id: '3'
name: SFB 901 - Project Area B
- _id: '1'
name: SFB 901
- _id: '11'
name: SFB 901 - Subproject B3
publication: 'Critical Systems: Formal Methods and Automated Verification - Joint
21st International Workshop on Formal Methods for Industrial Critical Systems and
16th International Workshop on Automated Verification of Critical Systems, FMICS-AVoCS
2016, Pisa, Italy, September 26-28, 2016, Proceedings'
series_title: Lecture Notes in Computer Science
status: public
title: Verification of AUTOSAR Software Architectures with Timed Automata
type: conference
user_id: '477'
year: '2016'
...
---
_id: '210'
author:
- first_name: Lennart
full_name: Leder, Lennart
last_name: Leder
citation:
ama: Leder L. Congestion Games with Mixed Objectives. Universität Paderborn;
2016.
apa: Leder, L. (2016). Congestion Games with Mixed Objectives. Universität
Paderborn.
bibtex: '@book{Leder_2016, title={Congestion Games with Mixed Objectives}, publisher={Universität
Paderborn}, author={Leder, Lennart}, year={2016} }'
chicago: Leder, Lennart. Congestion Games with Mixed Objectives. Universität
Paderborn, 2016.
ieee: L. Leder, Congestion Games with Mixed Objectives. Universität Paderborn,
2016.
mla: Leder, Lennart. Congestion Games with Mixed Objectives. Universität
Paderborn, 2016.
short: L. Leder, Congestion Games with Mixed Objectives, Universität Paderborn,
2016.
date_created: 2017-10-17T12:41:33Z
date_updated: 2022-01-06T06:54:42Z
department:
- _id: '63'
- _id: '541'
project:
- _id: '1'
name: SFB 901
- _id: '7'
name: SFB 901 - Subprojekt A3
- _id: '2'
name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Alexander
full_name: Skopalik, Alexander
id: '40384'
last_name: Skopalik
title: Congestion Games with Mixed Objectives
type: mastersthesis
user_id: '14052'
year: '2016'
...
---
_id: '211'
abstract:
- lang: eng
text: On an intermediate goods market with asymmetric production technologies as
well as vertical and horizontal product differentiation we analyze the influence
of simultaneous competition for resources and customers. The intermediaries face
either price or quantity competition on the output market and a monopolistic,
strategically acting supplier on the input market. We find that there exist quality
and productivity differences such that for quantity competition only one intermediary
is willing to procure inputs from the input supplier, while for price competition
both intermediaries are willing to purchase inputs. Moreover, the well-known welfare
advantage of price competition can in general be no longer confirmed in our model
with an endogenous input market and asymmetric intermediaries.
author:
- first_name: Sonja
full_name: Brangewitz, Sonja
last_name: Brangewitz
- first_name: Jochen
full_name: Manegold, Jochen
last_name: Manegold
citation:
ama: Brangewitz S, Manegold J. Competition of Intermediaries in a Differentiated
Duopoly. Theoretical Economics Letters. 2016;6(6):1341-1362. doi:10.4236/tel.2016.66124
apa: Brangewitz, S., & Manegold, J. (2016). Competition of Intermediaries in
a Differentiated Duopoly. Theoretical Economics Letters, 6(6), 1341–1362.
https://doi.org/10.4236/tel.2016.66124
bibtex: '@article{Brangewitz_Manegold_2016, title={Competition of Intermediaries
in a Differentiated Duopoly}, volume={6}, DOI={10.4236/tel.2016.66124},
number={6}, journal={Theoretical Economics Letters}, publisher={Scientific Research
Publishing (SCIRP)}, author={Brangewitz, Sonja and Manegold, Jochen}, year={2016},
pages={1341–1362} }'
chicago: 'Brangewitz, Sonja, and Jochen Manegold. “Competition of Intermediaries
in a Differentiated Duopoly.” Theoretical Economics Letters 6, no. 6 (2016):
1341–62. https://doi.org/10.4236/tel.2016.66124.'
ieee: S. Brangewitz and J. Manegold, “Competition of Intermediaries in a Differentiated
Duopoly,” Theoretical Economics Letters, vol. 6, no. 6, pp. 1341–1362,
2016.
mla: Brangewitz, Sonja, and Jochen Manegold. “Competition of Intermediaries in a
Differentiated Duopoly.” Theoretical Economics Letters, vol. 6, no. 6,
Scientific Research Publishing (SCIRP), 2016, pp. 1341–62, doi:10.4236/tel.2016.66124.
short: S. Brangewitz, J. Manegold, Theoretical Economics Letters 6 (2016) 1341–1362.
date_created: 2017-10-17T12:41:33Z
date_updated: 2022-01-06T06:54:45Z
ddc:
- '040'
department:
- _id: '475'
- _id: '205'
doi: 10.4236/tel.2016.66124
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T10:42:53Z
date_updated: 2018-03-21T10:42:53Z
file_id: '1520'
file_name: 211-Brangewitz_and_Manegold__2016__TEL_2016122917254130.pdf
file_size: 597343
relation: main_file
success: 1
file_date_updated: 2018-03-21T10:42:53Z
has_accepted_license: '1'
intvolume: ' 6'
issue: '6'
language:
- iso: eng
page: 1341-1362
project:
- _id: '1'
name: SFB 901
- _id: '7'
name: SFB 901 - Subprojekt A3
- _id: '2'
name: SFB 901 - Project Area A
publication: Theoretical Economics Letters
publication_identifier:
unknown:
- 2162-2078
- 2162-2086
publication_status: published
publisher: Scientific Research Publishing (SCIRP)
status: public
title: Competition of Intermediaries in a Differentiated Duopoly
type: journal_article
user_id: '65453'
volume: 6
year: '2016'
...
---
_id: '212'
author:
- first_name: Jochen
full_name: Manegold, Jochen
last_name: Manegold
citation:
ama: Manegold J. Competition in Markets with Intermediaries. Universität
Paderborn; 2016.
apa: Manegold, J. (2016). Competition in Markets with Intermediaries. Universität
Paderborn.
bibtex: '@book{Manegold_2016, title={Competition in Markets with Intermediaries},
publisher={Universität Paderborn}, author={Manegold, Jochen}, year={2016} }'
chicago: Manegold, Jochen. Competition in Markets with Intermediaries. Universität
Paderborn, 2016.
ieee: J. Manegold, Competition in Markets with Intermediaries. Universität
Paderborn, 2016.
mla: Manegold, Jochen. Competition in Markets with Intermediaries. Universität
Paderborn, 2016.
short: J. Manegold, Competition in Markets with Intermediaries, Universität Paderborn,
2016.
date_created: 2017-10-17T12:41:33Z
date_updated: 2022-01-06T06:54:49Z
ddc:
- '040'
department:
- _id: '19'
- _id: '205'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T10:42:14Z
date_updated: 2018-03-21T10:42:14Z
file_id: '1519'
file_name: 212-Dissertation_-_Jochen_Manegold.pdf
file_size: 1130436
relation: main_file
success: 1
file_date_updated: 2018-03-21T10:42:14Z
has_accepted_license: '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
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Claus-Jochen
full_name: Haake, Claus-Jochen
id: '20801'
last_name: Haake
title: Competition in Markets with Intermediaries
type: dissertation
user_id: '477'
year: '2016'
...
---
_id: '213'
author:
- first_name: Laurens
full_name: Porzenheim, Laurens
last_name: Porzenheim
citation:
ama: Porzenheim L. Comparison of Different Definitions of Chosen-Ciphertext Security
in Encryption Schemes. Universität Paderborn; 2016.
apa: Porzenheim, L. (2016). Comparison of different Definitions of Chosen-Ciphertext
Security in Encryption schemes. Universität Paderborn.
bibtex: '@book{Porzenheim_2016, title={Comparison of different Definitions of Chosen-Ciphertext
Security in Encryption schemes}, publisher={Universität Paderborn}, author={Porzenheim,
Laurens}, year={2016} }'
chicago: Porzenheim, Laurens. Comparison of Different Definitions of Chosen-Ciphertext
Security in Encryption Schemes. Universität Paderborn, 2016.
ieee: L. Porzenheim, Comparison of different Definitions of Chosen-Ciphertext
Security in Encryption schemes. Universität Paderborn, 2016.
mla: Porzenheim, Laurens. Comparison of Different Definitions of Chosen-Ciphertext
Security in Encryption Schemes. Universität Paderborn, 2016.
short: L. Porzenheim, Comparison of Different Definitions of Chosen-Ciphertext Security
in Encryption Schemes, Universität Paderborn, 2016.
date_created: 2017-10-17T12:41:33Z
date_updated: 2022-01-06T06:54:53Z
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
status: public
supervisor:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
title: Comparison of different Definitions of Chosen-Ciphertext Security in Encryption
schemes
type: bachelorsthesis
user_id: '477'
year: '2016'
...
---
_id: '214'
author:
- first_name: Kai Sören
full_name: Bemmann, Kai Sören
last_name: Bemmann
citation:
ama: Bemmann KS. Commitment Schemes - Definitions, Variants, and Security.
Universität Paderborn; 2016.
apa: Bemmann, K. S. (2016). Commitment Schemes - Definitions, Variants, and Security.
Universität Paderborn.
bibtex: '@book{Bemmann_2016, title={Commitment Schemes - Definitions, Variants,
and Security}, publisher={Universität Paderborn}, author={Bemmann, Kai Sören},
year={2016} }'
chicago: Bemmann, Kai Sören. Commitment Schemes - Definitions, Variants, and
Security. Universität Paderborn, 2016.
ieee: K. S. Bemmann, Commitment Schemes - Definitions, Variants, and Security.
Universität Paderborn, 2016.
mla: Bemmann, Kai Sören. Commitment Schemes - Definitions, Variants, and Security.
Universität Paderborn, 2016.
short: K.S. Bemmann, Commitment Schemes - Definitions, Variants, and Security, Universität
Paderborn, 2016.
date_created: 2017-10-17T12:41:33Z
date_updated: 2022-01-06T06:54:58Z
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
status: public
supervisor:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
title: Commitment Schemes - Definitions, Variants, and Security
type: bachelorsthesis
user_id: '477'
year: '2016'
...
---
_id: '215'
abstract:
- lang: eng
text: 'We present three robust overlay networks: First, we present a network that
organizes the nodes into an expander and is resistant to even massive adversarial
churn. Second, we develop a network based on the hypercube that maintains connectivity
under adversarial DoS-attacks. For the DoS-attacks we use the notion of a Omega(log
log n)-late adversary which only has access to topological information that is
at least Omega(log log n) rounds old. Finally, we develop a network that combines
both churn- and DoS-resistance. The networks gain their robustness through constant
network reconfiguration, i.e., the topology of the networks changes constantly.
Our reconguration algorithms are based on node sampling primitives for expanders
and hypercubes that allow each node to sample a logarithmic number of nodes uniformly
at random in O(log log n) communication rounds. These primitives are specific
to overlay networks and their optimal runtime represents an exponential improvement
over known techniques. Our results have a wide range of applications, for example
in the area of scalable and robust peer-to-peer systems.'
author:
- first_name: Maximilian
full_name: Drees, Maximilian
last_name: Drees
- first_name: Robert
full_name: Gmyr, Robert
last_name: Gmyr
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Drees M, Gmyr R, Scheideler C. Churn- and DoS-resistant Overlay Networks Based
on Network Reconfiguration. In: Proceedings of the 28th ACM Symposium on Parallelism
in Algorithms and Architectures (SPAA). ; 2016:417--427. doi:10.1145/2935764.2935783'
apa: Drees, M., Gmyr, R., & Scheideler, C. (2016). Churn- and DoS-resistant
Overlay Networks Based on Network Reconfiguration. In Proceedings of the 28th
ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) (pp. 417--427).
https://doi.org/10.1145/2935764.2935783
bibtex: '@inproceedings{Drees_Gmyr_Scheideler_2016, title={Churn- and DoS-resistant
Overlay Networks Based on Network Reconfiguration}, DOI={10.1145/2935764.2935783},
booktitle={Proceedings of the 28th ACM Symposium on Parallelism in Algorithms
and Architectures (SPAA)}, author={Drees, Maximilian and Gmyr, Robert and Scheideler,
Christian}, year={2016}, pages={417--427} }'
chicago: Drees, Maximilian, Robert Gmyr, and Christian Scheideler. “Churn- and DoS-Resistant
Overlay Networks Based on Network Reconfiguration.” In Proceedings of the 28th
ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 417--427,
2016. https://doi.org/10.1145/2935764.2935783.
ieee: M. Drees, R. Gmyr, and C. Scheideler, “Churn- and DoS-resistant Overlay Networks
Based on Network Reconfiguration,” in Proceedings of the 28th ACM Symposium
on Parallelism in Algorithms and Architectures (SPAA), 2016, pp. 417--427.
mla: Drees, Maximilian, et al. “Churn- and DoS-Resistant Overlay Networks Based
on Network Reconfiguration.” Proceedings of the 28th ACM Symposium on Parallelism
in Algorithms and Architectures (SPAA), 2016, pp. 417--427, doi:10.1145/2935764.2935783.
short: 'M. Drees, R. Gmyr, C. Scheideler, in: Proceedings of the 28th ACM Symposium
on Parallelism in Algorithms and Architectures (SPAA), 2016, pp. 417--427.'
date_created: 2017-10-17T12:41:33Z
date_updated: 2022-01-06T06:55:02Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
doi: 10.1145/2935764.2935783
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T10:41:40Z
date_updated: 2018-03-21T10:41:40Z
file_id: '1518'
file_name: 215-SPAA16-Drees_Gmyr_Scheideler.pdf
file_size: 352996
relation: main_file
success: 1
file_date_updated: 2018-03-21T10:41:40Z
has_accepted_license: '1'
language:
- iso: eng
page: 417--427
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 28th ACM Symposium on Parallelism in Algorithms and
Architectures (SPAA)
status: public
title: Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration
type: conference
user_id: '14955'
year: '2016'
...
---
_id: '216'
abstract:
- lang: eng
text: We empirically investigate the impact of successful goal achievement on future
effort to attain the next goal in a recurring goal framework. We use data from
a popular German Question & Answer community where goals are represented in the
form of badges. In particular, our analysis of this data hinges on the fact, that
in this Question & Answer community, badges in a hierarchical badge system are
in-creasingly challenging to attain up to a certain badge. After this certain
badge, the difficulty level sud-denly drops and remains constant throughout up
to the last badge in the hierarchy. Our findings indi-cate that after successful
badge achievement users increase their subsequent effort to attain the next badge,
but only as long as badges represent a challenge to the user. According to our
analysis, we identify self-learning to be the key driver of this behavior.
author:
- first_name: Tobias
full_name: von Rechenberg, Tobias
last_name: von Rechenberg
- first_name: Dominik
full_name: Gutt, Dominik
id: '14368'
last_name: Gutt
citation:
ama: 'von Rechenberg T, Gutt D. Challenge Accepted! - The Impcat of Goal Achievement
on Subsequent User Effort and Implications of a Goal’s Difficulty. In: Proceedings
of the 24th Conference on Information Systems (ECIS), Istanbul. ; 2016.'
apa: von Rechenberg, T., & Gutt, D. (2016). Challenge Accepted! - The Impcat
of Goal Achievement on Subsequent User Effort and Implications of a Goal’s Difficulty.
In Proceedings of the 24th Conference on Information Systems (ECIS), Istanbul.
Istanbul, Turkey.
bibtex: '@inproceedings{von Rechenberg_Gutt_2016, title={Challenge Accepted! - The
Impcat of Goal Achievement on Subsequent User Effort and Implications of a Goal’s
Difficulty}, booktitle={Proceedings of the 24th Conference on Information Systems
(ECIS), Istanbul}, author={von Rechenberg, Tobias and Gutt, Dominik}, year={2016}
}'
chicago: Rechenberg, Tobias von, and Dominik Gutt. “Challenge Accepted! - The Impcat
of Goal Achievement on Subsequent User Effort and Implications of a Goal’s Difficulty.”
In Proceedings of the 24th Conference on Information Systems (ECIS), Istanbul,
2016.
ieee: T. von Rechenberg and D. Gutt, “Challenge Accepted! - The Impcat of Goal Achievement
on Subsequent User Effort and Implications of a Goal’s Difficulty,” in Proceedings
of the 24th Conference on Information Systems (ECIS), Istanbul, Istanbul,
Turkey, 2016.
mla: von Rechenberg, Tobias, and Dominik Gutt. “Challenge Accepted! - The Impcat
of Goal Achievement on Subsequent User Effort and Implications of a Goal’s Difficulty.”
Proceedings of the 24th Conference on Information Systems (ECIS), Istanbul,
2016.
short: 'T. von Rechenberg, D. Gutt, in: Proceedings of the 24th Conference on Information
Systems (ECIS), Istanbul, 2016.'
conference:
location: Istanbul, Turkey
name: 24th Conference on Information Systems (ECIS)
date_created: 2017-10-17T12:41:34Z
date_updated: 2022-01-06T06:55:07Z
ddc:
- '040'
department:
- _id: '276'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T10:40:27Z
date_updated: 2018-03-21T10:40:27Z
file_id: '1517'
file_name: 216-ECIS2016_Challenge_Accepted_2315_final.pdf
file_size: 565109
relation: main_file
success: 1
file_date_updated: 2018-03-21T10:40:27Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '8'
name: SFB 901 - Subprojekt A4
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 24th Conference on Information Systems (ECIS), Istanbul
status: public
title: Challenge Accepted! - The Impcat of Goal Achievement on Subsequent User Effort
and Implications of a Goal's Difficulty
type: conference
user_id: '16205'
year: '2016'
...
---
_id: '173'
author:
- first_name: Eduard
full_name: Heck, Eduard
last_name: Heck
citation:
ama: Heck E. Ontologie-Erstellung mittels Text-Mining aus App-Marktplätzen am
Beispiel des Google Marketplace. Universität Paderborn; 2016.
apa: Heck, E. (2016). Ontologie-Erstellung mittels Text-Mining aus App-Marktplätzen
am Beispiel des Google Marketplace. Universität Paderborn.
bibtex: '@book{Heck_2016, title={Ontologie-Erstellung mittels Text-Mining aus App-Marktplätzen
am Beispiel des Google Marketplace}, publisher={Universität Paderborn}, author={Heck,
Eduard}, year={2016} }'
chicago: Heck, Eduard. Ontologie-Erstellung mittels Text-Mining aus App-Marktplätzen
am Beispiel des Google Marketplace. Universität Paderborn, 2016.
ieee: E. Heck, Ontologie-Erstellung mittels Text-Mining aus App-Marktplätzen
am Beispiel des Google Marketplace. Universität Paderborn, 2016.
mla: Heck, Eduard. Ontologie-Erstellung mittels Text-Mining aus App-Marktplätzen
am Beispiel des Google Marketplace. Universität Paderborn, 2016.
short: E. Heck, Ontologie-Erstellung mittels Text-Mining aus App-Marktplätzen am
Beispiel des Google Marketplace, Universität Paderborn, 2016.
date_created: 2017-10-17T12:41:25Z
date_updated: 2022-01-06T06:53:07Z
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '9'
name: SFB 901 - Subprojekt B1
- _id: '3'
name: SFB 901 - Project Area B
publisher: Universität Paderborn
status: public
title: Ontologie-Erstellung mittels Text-Mining aus App-Marktplätzen am Beispiel des
Google Marketplace
type: bachelorsthesis
user_id: '477'
year: '2016'
...
---
_id: '174'
author:
- first_name: Christoph
full_name: Schwentker, Christoph
last_name: Schwentker
citation:
ama: Schwentker C. Ontologie-basierte Extraktion funktionaler Softwareanforderungen
am Fallbeispiel mobiler Kommunikationsapplikationen. Universität Paderborn;
2016.
apa: Schwentker, C. (2016). Ontologie-basierte Extraktion funktionaler Softwareanforderungen
am Fallbeispiel mobiler Kommunikationsapplikationen. Universität Paderborn.
bibtex: '@book{Schwentker_2016, title={Ontologie-basierte Extraktion funktionaler
Softwareanforderungen am Fallbeispiel mobiler Kommunikationsapplikationen}, publisher={Universität
Paderborn}, author={Schwentker, Christoph}, year={2016} }'
chicago: Schwentker, Christoph. Ontologie-basierte Extraktion funktionaler Softwareanforderungen
am Fallbeispiel mobiler Kommunikationsapplikationen. Universität Paderborn,
2016.
ieee: C. Schwentker, Ontologie-basierte Extraktion funktionaler Softwareanforderungen
am Fallbeispiel mobiler Kommunikationsapplikationen. Universität Paderborn,
2016.
mla: Schwentker, Christoph. Ontologie-basierte Extraktion funktionaler Softwareanforderungen
am Fallbeispiel mobiler Kommunikationsapplikationen. Universität Paderborn,
2016.
short: C. Schwentker, Ontologie-basierte Extraktion funktionaler Softwareanforderungen
am Fallbeispiel mobiler Kommunikationsapplikationen, Universität Paderborn, 2016.
date_created: 2017-10-17T12:41:25Z
date_updated: 2022-01-06T06:53:10Z
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '9'
name: SFB 901 - Subprojekt B1
- _id: '3'
name: SFB 901 - Project Area B
publisher: Universität Paderborn
status: public
title: Ontologie-basierte Extraktion funktionaler Softwareanforderungen am Fallbeispiel
mobiler Kommunikationsapplikationen
type: bachelorsthesis
user_id: '477'
year: '2016'
...
---
_id: '175'
abstract:
- lang: eng
text: Today, service compositions often need to be assembled or changed on-the-fly,
which leaves only little time for quality assurance. Moreover, quality assurance
is complicated by service providers only giving information on their services
in terms of domain specific concepts with only limited semantic meaning.In this
paper, we propose a method for constructing service compositions based on pre-verified
templates. Templates, given as workflow descriptions, are typed over a (domain-independent)
template ontology defining concepts and predicates. Their meaning is defined by
an abstract semantics, leaving the specific meaning of ontology concepts open,
however, only up to given ontology rules. Templates are proven correct using a
Hoare-style proof calculus, extended by a specific rule for service calls. Construction
of service compositions amounts to instantiation of templates with domain-specific
services. Correctness of an instantiation can then simply be checked by verifying
that the domain ontology (a) adheres to the rules of the template ontology, and
(b) fulfills the constraints of the employed template.
author:
- first_name: Sven
full_name: Walther, Sven
last_name: Walther
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: Walther S, Wehrheim H. On-The-Fly Construction of Provably Correct Service
Compositions - Templates and Proofs. Science of Computer Programming. 2016:2--23.
doi:10.1016/j.scico.2016.04.002
apa: Walther, S., & Wehrheim, H. (2016). On-The-Fly Construction of Provably
Correct Service Compositions - Templates and Proofs. Science of Computer Programming,
2--23. https://doi.org/10.1016/j.scico.2016.04.002
bibtex: '@article{Walther_Wehrheim_2016, title={On-The-Fly Construction of Provably
Correct Service Compositions - Templates and Proofs}, DOI={10.1016/j.scico.2016.04.002},
journal={Science of Computer Programming}, publisher={Elsevier}, author={Walther,
Sven and Wehrheim, Heike}, year={2016}, pages={2--23} }'
chicago: Walther, Sven, and Heike Wehrheim. “On-The-Fly Construction of Provably
Correct Service Compositions - Templates and Proofs.” Science of Computer Programming,
2016, 2--23. https://doi.org/10.1016/j.scico.2016.04.002.
ieee: S. Walther and H. Wehrheim, “On-The-Fly Construction of Provably Correct Service
Compositions - Templates and Proofs,” Science of Computer Programming,
pp. 2--23, 2016.
mla: Walther, Sven, and Heike Wehrheim. “On-The-Fly Construction of Provably Correct
Service Compositions - Templates and Proofs.” Science of Computer Programming,
Elsevier, 2016, pp. 2--23, doi:10.1016/j.scico.2016.04.002.
short: S. Walther, H. Wehrheim, Science of Computer Programming (2016) 2--23.
date_created: 2017-10-17T12:41:26Z
date_updated: 2022-01-06T06:53:13Z
ddc:
- '040'
department:
- _id: '77'
doi: 10.1016/j.scico.2016.04.002
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T12:38:40Z
date_updated: 2018-03-21T12:38:40Z
file_id: '1536'
file_name: 175-1-s2.0-S0167642316300028-main.pdf
file_size: 630739
relation: main_file
success: 1
file_date_updated: 2018-03-21T12:38:40Z
has_accepted_license: '1'
language:
- iso: eng
page: 2--23
project:
- _id: '1'
name: SFB 901
- _id: '11'
name: SFB 901 - Subprojekt B3
- _id: '3'
name: SFB 901 - Project Area B
publication: Science of Computer Programming
publisher: Elsevier
status: public
title: On-The-Fly Construction of Provably Correct Service Compositions - Templates
and Proofs
type: journal_article
user_id: '477'
year: '2016'
...
---
_id: '176'
abstract:
- lang: eng
text: Users prefer natural language software requirements because of their usability
and accessibility. When they describe their wishes for software development, they
often provide off-topic information. We therefore present an automated approach
for identifying and semantically annotating the on-topic parts of the given descriptions.
It is designed to support requirement engineers in the requirement elicitation
process on detecting and analyzing requirements in user-generated content. Since
no lexical resources with domain-specific information about requirements are available,
we created a corpus of requirements written in controlled language by instructed
users and uncontrolled language by uninstructed users. We annotated these requirements
regarding predicate-argument structures, conditions, priorities, motivations and
semantic roles and used this information to train classifiers for information
extraction purposes. The approach achieves an accuracy of 92% for the on- and
off-topic classification task and an F1-measure of 72% for the semantic annotation.
author:
- first_name: Markus
full_name: Dollmann, Markus
id: '27578'
last_name: Dollmann
- first_name: Michaela
full_name: Geierhos, Michaela
id: '42496'
last_name: Geierhos
orcid: 0000-0002-8180-5606
citation:
ama: 'Dollmann M, Geierhos M. On- and Off-Topic Classification and Semantic Annotation
of User-Generated Software Requirements. In: Proceedings of the 2016 Conference
on Empirical Methods in Natural Language Processing (EMNLP). Austin, TX, USA:
Association for Computational Linguistics (ACL); 2016:1807-1816.'
apa: 'Dollmann, M., & Geierhos, M. (2016). On- and Off-Topic Classification
and Semantic Annotation of User-Generated Software Requirements. In Proceedings
of the 2016 Conference on Empirical Methods in Natural Language Processing (EMNLP)
(pp. 1807–1816). Austin, TX, USA: Association for Computational Linguistics (ACL).'
bibtex: '@inproceedings{Dollmann_Geierhos_2016, place={Austin, TX, USA}, title={On-
and Off-Topic Classification and Semantic Annotation of User-Generated Software
Requirements}, booktitle={Proceedings of the 2016 Conference on Empirical Methods
in Natural Language Processing (EMNLP)}, publisher={Association for Computational
Linguistics (ACL)}, author={Dollmann, Markus and Geierhos, Michaela}, year={2016},
pages={1807–1816} }'
chicago: 'Dollmann, Markus, and Michaela Geierhos. “On- and Off-Topic Classification
and Semantic Annotation of User-Generated Software Requirements.” In Proceedings
of the 2016 Conference on Empirical Methods in Natural Language Processing (EMNLP),
1807–16. Austin, TX, USA: Association for Computational Linguistics (ACL), 2016.'
ieee: M. Dollmann and M. Geierhos, “On- and Off-Topic Classification and Semantic
Annotation of User-Generated Software Requirements,” in Proceedings of the
2016 Conference on Empirical Methods in Natural Language Processing (EMNLP),
Austin, TX, USA, 2016, pp. 1807–1816.
mla: Dollmann, Markus, and Michaela Geierhos. “On- and Off-Topic Classification
and Semantic Annotation of User-Generated Software Requirements.” Proceedings
of the 2016 Conference on Empirical Methods in Natural Language Processing (EMNLP),
Association for Computational Linguistics (ACL), 2016, pp. 1807–16.
short: 'M. Dollmann, M. Geierhos, in: Proceedings of the 2016 Conference on Empirical
Methods in Natural Language Processing (EMNLP), Association for Computational
Linguistics (ACL), Austin, TX, USA, 2016, pp. 1807–1816.'
conference:
end_date: 2016-11-05
location: Austin, TX, USA
name: Conference on Empirical Methods in Natural Language Processing (EMNLP 2016)
start_date: 2016-11-01
date_created: 2017-10-17T12:41:26Z
date_updated: 2022-01-06T06:53:15Z
ddc:
- '040'
department:
- _id: '36'
- _id: '1'
- _id: '579'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T12:33:48Z
date_updated: 2018-03-21T12:33:48Z
file_id: '1535'
file_name: 176-D16-1186.pdf
file_size: 259495
relation: main_file
success: 1
file_date_updated: 2018-03-21T12:33:48Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.aclweb.org/anthology/D16-1186
oa: '1'
page: 1807-1816
place: Austin, TX, USA
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 2016 Conference on Empirical Methods in Natural Language
Processing (EMNLP)
publication_status: published
publisher: Association for Computational Linguistics (ACL)
quality_controlled: '1'
status: public
title: On- and Off-Topic Classification and Semantic Annotation of User-Generated
Software Requirements
type: conference
user_id: '15504'
year: '2016'
...
---
_id: '177'
abstract:
- lang: eng
text: 'Efficiently parallelizable parameterized problems have been classified as
being either in the class FPP (fixed-parameter parallelizable) or the class PNC
(parameterized analog of NC), which contains FPP as a subclass. In this paper,
we propose a more restrictive class of parallelizable parameterized problems called
fixed-parameter parallel-tractable (FPPT). For a problem to be in FPPT, it should
possess an efficient parallel algorithm not only from a theoretical standpoint
but in practice as well. The primary distinction between FPPT and FPP is the parallel
processor utilization, which is bounded by a polynomial function in the case of
FPPT. We initiate the study of FPPT with the well-known k-vertex cover problem.
In particular, we present a parallel algorithm that outperforms the best known
parallel algorithm for this problem: using O(m) instead of O(n2) parallel processors,
the running time improves from 4logn+O(kk) to O(k⋅log3n), where m is the number
of edges, n is the number of vertices of the input graph, and k is an upper bound
of the size of the sought vertex cover. We also note that a few P-complete problems
fall into FPPT including the monotone circuit value problem (MCV) when the underlying
graphs are bounded by a constant Euler genus.'
author:
- first_name: Faisal N.
full_name: Abu-Khzam, Faisal N.
last_name: Abu-Khzam
- first_name: Shouwei
full_name: Li, Shouwei
last_name: Li
- first_name: Christine
full_name: Markarian, Christine
id: '37612'
last_name: Markarian
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Pavel
full_name: Podlipyan, Pavel
last_name: Podlipyan
citation:
ama: 'Abu-Khzam FN, Li S, Markarian C, Meyer auf der Heide F, Podlipyan P. On the
Parameterized Parallel Complexity and the Vertex Cover Problem. In: Proceedings
of the 10th International Conference on Combinatorial Optimization and Applications
(COCOA). LNCS. ; 2016:477-488. doi:10.1007/978-3-319-48749-6_35'
apa: Abu-Khzam, F. N., Li, S., Markarian, C., Meyer auf der Heide, F., & Podlipyan,
P. (2016). On the Parameterized Parallel Complexity and the Vertex Cover Problem.
In Proceedings of the 10th International Conference on Combinatorial Optimization
and Applications (COCOA) (pp. 477–488). https://doi.org/10.1007/978-3-319-48749-6_35
bibtex: '@inproceedings{Abu-Khzam_Li_Markarian_Meyer auf der Heide_Podlipyan_2016,
series={LNCS}, title={On the Parameterized Parallel Complexity and the Vertex
Cover Problem}, DOI={10.1007/978-3-319-48749-6_35},
booktitle={Proceedings of the 10th International Conference on Combinatorial Optimization
and Applications (COCOA)}, author={Abu-Khzam, Faisal N. and Li, Shouwei and Markarian,
Christine and Meyer auf der Heide, Friedhelm and Podlipyan, Pavel}, year={2016},
pages={477–488}, collection={LNCS} }'
chicago: Abu-Khzam, Faisal N., Shouwei Li, Christine Markarian, Friedhelm Meyer
auf der Heide, and Pavel Podlipyan. “On the Parameterized Parallel Complexity
and the Vertex Cover Problem.” In Proceedings of the 10th International Conference
on Combinatorial Optimization and Applications (COCOA), 477–88. LNCS, 2016.
https://doi.org/10.1007/978-3-319-48749-6_35.
ieee: F. N. Abu-Khzam, S. Li, C. Markarian, F. Meyer auf der Heide, and P. Podlipyan,
“On the Parameterized Parallel Complexity and the Vertex Cover Problem,” in Proceedings
of the 10th International Conference on Combinatorial Optimization and Applications
(COCOA), 2016, pp. 477–488.
mla: Abu-Khzam, Faisal N., et al. “On the Parameterized Parallel Complexity and
the Vertex Cover Problem.” Proceedings of the 10th International Conference
on Combinatorial Optimization and Applications (COCOA), 2016, pp. 477–88,
doi:10.1007/978-3-319-48749-6_35.
short: 'F.N. Abu-Khzam, S. Li, C. Markarian, F. Meyer auf der Heide, P. Podlipyan,
in: Proceedings of the 10th International Conference on Combinatorial Optimization
and Applications (COCOA), 2016, pp. 477–488.'
date_created: 2017-10-17T12:41:26Z
date_updated: 2022-01-06T06:53:17Z
ddc:
- '000'
department:
- _id: '63'
doi: 10.1007/978-3-319-48749-6_35
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T14:15:18Z
date_updated: 2018-11-02T14:15:18Z
file_id: '5266'
file_name: OnTheParameterizedParallelComp.pdf
file_size: 293345
relation: main_file
success: 1
file_date_updated: 2018-11-02T14:15:18Z
has_accepted_license: '1'
language:
- iso: eng
page: 477-488
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 10th International Conference on Combinatorial Optimization
and Applications (COCOA)
series_title: LNCS
status: public
title: On the Parameterized Parallel Complexity and the Vertex Cover Problem
type: conference
user_id: '477'
year: '2016'
...