---
_id: '18006'
author:
- first_name: Jannik
full_name: Sundermeier, Jannik
id: '38705'
last_name: Sundermeier
citation:
ama: Sundermeier J. Implementierung Eines Selbststabilisierenden Verteilten Stacks.
Universität Paderborn; 2015.
apa: Sundermeier, J. (2015). Implementierung eines selbststabilisierenden verteilten
Stacks. Universität Paderborn.
bibtex: '@book{Sundermeier_2015, title={Implementierung eines selbststabilisierenden
verteilten Stacks}, publisher={Universität Paderborn}, author={Sundermeier, Jannik},
year={2015} }'
chicago: Sundermeier, Jannik. Implementierung Eines Selbststabilisierenden Verteilten
Stacks. Universität Paderborn, 2015.
ieee: J. Sundermeier, Implementierung eines selbststabilisierenden verteilten
Stacks. Universität Paderborn, 2015.
mla: Sundermeier, Jannik. Implementierung Eines Selbststabilisierenden Verteilten
Stacks. Universität Paderborn, 2015.
short: J. Sundermeier, Implementierung Eines Selbststabilisierenden Verteilten Stacks,
Universität Paderborn, 2015.
date_created: 2020-08-17T08:20:59Z
date_updated: 2022-01-06T06:53:25Z
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: Implementierung eines selbststabilisierenden verteilten Stacks
type: bachelorsthesis
user_id: '477'
year: '2015'
...
---
_id: '18024'
author:
- first_name: Till
full_name: Knollmann, Till
id: '39241'
last_name: Knollmann
orcid: 0000-0003-2014-4696
citation:
ama: Knollmann T. Implementierung Einer Selbststabilisierenden Datenstruktur
Für Das Längste Gemeinsame Präfix. Universität Paderborn; 2015.
apa: Knollmann, T. (2015). Implementierung einer selbststabilisierenden Datenstruktur
für das längste gemeinsame Präfix. Universität Paderborn.
bibtex: '@book{Knollmann_2015, title={Implementierung einer selbststabilisierenden
Datenstruktur für das längste gemeinsame Präfix}, publisher={Universität Paderborn},
author={Knollmann, Till}, year={2015} }'
chicago: Knollmann, Till. Implementierung Einer Selbststabilisierenden Datenstruktur
Für Das Längste Gemeinsame Präfix. Universität Paderborn, 2015.
ieee: T. Knollmann, Implementierung einer selbststabilisierenden Datenstruktur
für das längste gemeinsame Präfix. Universität Paderborn, 2015.
mla: Knollmann, Till. Implementierung Einer Selbststabilisierenden Datenstruktur
Für Das Längste Gemeinsame Präfix. Universität Paderborn, 2015.
short: T. Knollmann, Implementierung Einer Selbststabilisierenden Datenstruktur
Für Das Längste Gemeinsame Präfix, Universität Paderborn, 2015.
date_created: 2020-08-18T08:37:33Z
date_updated: 2022-01-06T06:53:25Z
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: Implementierung einer selbststabilisierenden Datenstruktur für das längste
gemeinsame Präfix
type: bachelorsthesis
user_id: '477'
year: '2015'
...
---
_id: '228'
abstract:
- lang: eng
text: 'We investigate the pervasiveness of lying in professional contexts such as
insurance fraud, tax evasion and untrue job applications. We argue that lying
in professional contexts share three characterizing features: (1) the gain from
the dishonest behavior is uncertain, (2) the harm that lying may cause to the
other party is only indirect and (3) lies are more indirect lies by action or
written statements. Conducted as a field experiment with a heterogenous group
of participants during a University ‘‘Open House Day’’, our ‘‘gumball-machineexperiment’’
provides field evidence on how preferences for lying are shaped in situations
typically found in professional contexts which we consider to be particularly
prone to lying behavior compared to other contexts. As a key innovation, our experimental
design allows measuring exact levels of cheating behavior under anonymous conditions.
We find clean evidence that cheating is prevalent across all sub groups and that
more than 32% of the population cheats for their own gain. However, an analysis
of the cheating rates with respect to highest educational degree and professional
status reveals that students cheat more than non-students. This finding warrants
a careful interpretation of generalizing laboratory findings with student subjects
about the prevalence of cheating in the population.'
author:
- first_name: Rene
full_name: Fahr, Rene
id: '111'
last_name: Fahr
- first_name: Behnud
full_name: Mir Djawadi, Behnud
id: '26032'
last_name: Mir Djawadi
orcid: 0000-0002-6271-5912
citation:
ama: 'Fahr R, Mir Djawadi B. “…and they are really lying”: Clean Evidence on the
Pervasiveness of Cheating in Professional Contexts from a Field Experiment. Journal
of Economic Psychology. 2015:48-59. doi:10.1016/j.joep.2015.03.002'
apa: 'Fahr, R., & Mir Djawadi, B. (2015). “…and they are really lying”: Clean
Evidence on the Pervasiveness of Cheating in Professional Contexts from a Field
Experiment. Journal of Economic Psychology, 48–59. https://doi.org/10.1016/j.joep.2015.03.002'
bibtex: '@article{Fahr_Mir Djawadi_2015, title={“…and they are really lying”: Clean
Evidence on the Pervasiveness of Cheating in Professional Contexts from a Field
Experiment.}, DOI={10.1016/j.joep.2015.03.002},
journal={Journal of Economic Psychology}, publisher={Elsevier}, author={Fahr,
Rene and Mir Djawadi, Behnud}, year={2015}, pages={48–59} }'
chicago: 'Fahr, Rene, and Behnud Mir Djawadi. “‘…and They Are Really Lying’: Clean
Evidence on the Pervasiveness of Cheating in Professional Contexts from a Field
Experiment.” Journal of Economic Psychology, 2015, 48–59. https://doi.org/10.1016/j.joep.2015.03.002.'
ieee: 'R. Fahr and B. Mir Djawadi, “‘…and they are really lying’: Clean Evidence
on the Pervasiveness of Cheating in Professional Contexts from a Field Experiment.,”
Journal of Economic Psychology, pp. 48–59, 2015.'
mla: 'Fahr, Rene, and Behnud Mir Djawadi. “‘…and They Are Really Lying’: Clean Evidence
on the Pervasiveness of Cheating in Professional Contexts from a Field Experiment.”
Journal of Economic Psychology, Elsevier, 2015, pp. 48–59, doi:10.1016/j.joep.2015.03.002.'
short: R. Fahr, B. Mir Djawadi, Journal of Economic Psychology (2015) 48–59.
date_created: 2017-10-17T12:41:36Z
date_updated: 2022-01-06T06:55:41Z
ddc:
- '040'
department:
- _id: '179'
doi: 10.1016/j.joep.2015.03.002
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T10:33:10Z
date_updated: 2018-03-21T10:33:10Z
file_id: '1505'
file_name: 228-1-s2.0-S016748701500029X-main.pdf
file_size: 1341791
relation: main_file
success: 1
file_date_updated: 2018-03-21T10:33:10Z
has_accepted_license: '1'
language:
- iso: eng
page: 48-59
project:
- _id: '1'
name: SFB 901
- _id: '8'
name: SFB 901 - Subprojekt A4
- _id: '2'
name: SFB 901 - Project Area A
publication: Journal of Economic Psychology
publisher: Elsevier
status: public
title: '“…and they are really lying”: Clean Evidence on the Pervasiveness of Cheating
in Professional Contexts from a Field Experiment.'
type: journal_article
user_id: '477'
year: '2015'
...
---
_id: '229'
author:
- first_name: Hannah
full_name: Schulz, Hannah
last_name: Schulz
citation:
ama: Schulz H. Zur Verbreitung von Informationen in sozialen Netzwerken - eine
wirtschaftspolitische Analyse. Universität Paderborn; 2015.
apa: Schulz, H. (2015). Zur Verbreitung von Informationen in sozialen Netzwerken
- eine wirtschaftspolitische Analyse. Universität Paderborn.
bibtex: '@book{Schulz_2015, title={Zur Verbreitung von Informationen in sozialen
Netzwerken - eine wirtschaftspolitische Analyse}, publisher={Universität Paderborn},
author={Schulz, Hannah}, year={2015} }'
chicago: Schulz, Hannah. Zur Verbreitung von Informationen in sozialen Netzwerken
- eine wirtschaftspolitische Analyse. Universität Paderborn, 2015.
ieee: H. Schulz, Zur Verbreitung von Informationen in sozialen Netzwerken - eine
wirtschaftspolitische Analyse. Universität Paderborn, 2015.
mla: Schulz, Hannah. Zur Verbreitung von Informationen in sozialen Netzwerken
- eine wirtschaftspolitische Analyse. Universität Paderborn, 2015.
short: H. Schulz, Zur Verbreitung von Informationen in sozialen Netzwerken - eine
wirtschaftspolitische Analyse, Universität Paderborn, 2015.
date_created: 2017-10-17T12:41:36Z
date_updated: 2022-01-06T06:55:43Z
department:
- _id: '280'
language:
- iso: ger
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: Zur Verbreitung von Informationen in sozialen Netzwerken - eine wirtschaftspolitische
Analyse
type: bachelorsthesis
user_id: '42447'
year: '2015'
...
---
_id: '230'
abstract:
- lang: eng
text: 'Cognitive fit theory (CFT) provides guidance for how best to represent information
that is relevant for solving a given problem. CFT is widely established in information
systems research and its validity has been demonstrated in a great variety of
contexts. However, of the two major types of problems that exist (i.e., routine
and creative problems) prior CFT research has addressed only one: routine problems.
Creative problems, despite their importance, have been left unaddressed. Therefore,
based on the visual sketching model of problem solving, we propose an extension
of CFT and thereby demonstrate that cognitive fit can promote problem solving
performance also for creative problems. In doing so, we extend the boundary of
CFT and add to creativity research a previously unknown cognitive mechanism for
promoting creative performance: cognitive fit. Moreover, we contribute to general
problem solving research by bridging the gap between problem solving in creativity
and information systems research.'
author:
- first_name: Thomas
full_name: John, Thomas
id: '3952'
last_name: John
- first_name: Dennis
full_name: Kundisch, Dennis
id: '21117'
last_name: Kundisch
citation:
ama: 'John T, Kundisch D. Why Fit Leads to Surprise: An Extension of Cognitive Fit
Theory to Creative Problems. In: Proceedings of the 36th International Conference
on Information Systems (ICIS), Fort Worth, USA. ; 2015.'
apa: 'John, T., & Kundisch, D. (2015). Why Fit Leads to Surprise: An Extension
of Cognitive Fit Theory to Creative Problems. In Proceedings of the 36th International
Conference on Information Systems (ICIS), Fort Worth, USA. Fort Worth, USA.'
bibtex: '@inproceedings{John_Kundisch_2015, title={Why Fit Leads to Surprise: An
Extension of Cognitive Fit Theory to Creative Problems}, booktitle={Proceedings
of the 36th International Conference on Information Systems (ICIS), Fort Worth,
USA}, author={John, Thomas and Kundisch, Dennis}, year={2015} }'
chicago: 'John, Thomas, and Dennis Kundisch. “Why Fit Leads to Surprise: An Extension
of Cognitive Fit Theory to Creative Problems.” In Proceedings of the 36th International
Conference on Information Systems (ICIS), Fort Worth, USA, 2015.'
ieee: 'T. John and D. Kundisch, “Why Fit Leads to Surprise: An Extension of Cognitive
Fit Theory to Creative Problems,” in Proceedings of the 36th International
Conference on Information Systems (ICIS), Fort Worth, USA, Fort Worth, USA,
2015.'
mla: 'John, Thomas, and Dennis Kundisch. “Why Fit Leads to Surprise: An Extension
of Cognitive Fit Theory to Creative Problems.” Proceedings of the 36th International
Conference on Information Systems (ICIS), Fort Worth, USA, 2015.'
short: 'T. John, D. Kundisch, in: Proceedings of the 36th International Conference
on Information Systems (ICIS), Fort Worth, USA, 2015.'
conference:
location: Fort Worth, USA
name: 36th International Conference on Information Systems (ICIS)
date_created: 2017-10-17T12:41:36Z
date_updated: 2022-01-06T06:55:45Z
ddc:
- '040'
department:
- _id: '276'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T10:32:38Z
date_updated: 2018-03-21T10:32:38Z
file_id: '1504'
file_name: 230-Why_Fit_Leads_to_Surprise_-_An_Extension_of_Cognitive_Fit_Theory_to_Creative_Problems__002_.pdf
file_size: 449413
relation: main_file
success: 1
file_date_updated: 2018-03-21T10:32:38Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '17'
name: SFB 901 - Subprojekt C5
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the 36th International Conference on Information Systems
(ICIS), Fort Worth, USA
status: public
title: 'Why Fit Leads to Surprise: An Extension of Cognitive Fit Theory to Creative
Problems'
type: conference
user_id: '16205'
year: '2015'
...
---
_id: '231'
abstract:
- lang: eng
text: 'Existing approaches towards service composition demand requirements of the
customers in terms of service templates, service query profiles, or partial process
models. However, addressed non-expert customers may be unable to fill-in the slots
of service templates as requested or to describe, for example, pre- and postconditions,
or even have difficulties in formalizing their requirements. Thus, our idea is
to provide non-experts with suggestions how to complete or clarify their requirement
descriptions written in natural language. Two main issues have to be tackled:
(1) partial or full inability (incapacity) of non-experts to specify their requirements
correctly in formal and precise ways, and (2) problems in text analysis due to
fuzziness in natural language. We present ideas how to face these challenges by
means of requirement disambiguation and completion. Therefore, we conduct ontology-based
requirement extraction and similarity retrieval based on requirement descriptions
that are gathered from App marketplaces. The innovative aspect of our work is
that we support users without expert knowledge in writing their requirements by
simultaneously resolving ambiguity, vagueness, and underspecification in natural
language.'
author:
- first_name: Michaela
full_name: Geierhos, Michaela
id: '42496'
last_name: Geierhos
orcid: 0000-0002-8180-5606
- first_name: Sabine
full_name: Schulze, Sabine
last_name: Schulze
- first_name: Frederik Simon
full_name: Bäumer, Frederik Simon
id: '38837'
last_name: Bäumer
citation:
ama: 'Geierhos M, Schulze S, Bäumer FS. What did you mean? Facing the Challenges
of User-generated Software Requirements. In: Loiseau S, Filipe J, Duval B, van
den Herik J, eds. Proceedings of the 7th International Conference on Agents
and Artificial Intelligence (ICAART), Special Session on Partiality, Underspecification,
and Natural Language Processing (PUaNLP 2015). Setúbal, Portugal: SciTePress
- Science and Technology Publications; 2015:277-283. doi:10.5220/0005346002770283'
apa: 'Geierhos, M., Schulze, S., & Bäumer, F. S. (2015). What did you mean?
Facing the Challenges of User-generated Software Requirements. In S. Loiseau,
J. Filipe, B. Duval, & J. van den Herik (Eds.), Proceedings of the 7th
International Conference on Agents and Artificial Intelligence (ICAART), Special
Session on Partiality, Underspecification, and Natural Language Processing (PUaNLP
2015) (pp. 277–283). Setúbal, Portugal: SciTePress - Science and Technology
Publications. https://doi.org/10.5220/0005346002770283'
bibtex: '@inproceedings{Geierhos_Schulze_Bäumer_2015, place={Setúbal, Portugal},
title={What did you mean? Facing the Challenges of User-generated Software Requirements},
DOI={10.5220/0005346002770283},
booktitle={Proceedings of the 7th International Conference on Agents and Artificial
Intelligence (ICAART), Special Session on Partiality, Underspecification, and
Natural Language Processing (PUaNLP 2015)}, publisher={SciTePress - Science and
Technology Publications}, author={Geierhos, Michaela and Schulze, Sabine and Bäumer,
Frederik Simon}, editor={Loiseau, Stephane and Filipe, Joaquim and Duval, Béatrice and
van den Herik, JaapEditors}, year={2015}, pages={277–283} }'
chicago: 'Geierhos, Michaela, Sabine Schulze, and Frederik Simon Bäumer. “What Did
You Mean? Facing the Challenges of User-Generated Software Requirements.” In Proceedings
of the 7th International Conference on Agents and Artificial Intelligence (ICAART),
Special Session on Partiality, Underspecification, and Natural Language Processing
(PUaNLP 2015), edited by Stephane Loiseau, Joaquim Filipe, Béatrice Duval,
and Jaap van den Herik, 277–83. Setúbal, Portugal: SciTePress - Science and Technology
Publications, 2015. https://doi.org/10.5220/0005346002770283.'
ieee: M. Geierhos, S. Schulze, and F. S. Bäumer, “What did you mean? Facing the
Challenges of User-generated Software Requirements,” in Proceedings of the
7th International Conference on Agents and Artificial Intelligence (ICAART), Special
Session on Partiality, Underspecification, and Natural Language Processing (PUaNLP
2015), 2015, pp. 277–283.
mla: Geierhos, Michaela, et al. “What Did You Mean? Facing the Challenges of User-Generated
Software Requirements.” Proceedings of the 7th International Conference on
Agents and Artificial Intelligence (ICAART), Special Session on Partiality, Underspecification,
and Natural Language Processing (PUaNLP 2015), edited by Stephane Loiseau
et al., SciTePress - Science and Technology Publications, 2015, pp. 277–83, doi:10.5220/0005346002770283.
short: 'M. Geierhos, S. Schulze, F.S. Bäumer, in: S. Loiseau, J. Filipe, B. Duval,
J. van den Herik (Eds.), Proceedings of the 7th International Conference on Agents
and Artificial Intelligence (ICAART), Special Session on Partiality, Underspecification,
and Natural Language Processing (PUaNLP 2015), SciTePress - Science and Technology
Publications, Setúbal, Portugal, 2015, pp. 277–283.'
date_created: 2017-10-17T12:41:37Z
date_updated: 2022-01-06T06:55:46Z
ddc:
- '040'
department:
- _id: '36'
- _id: '1'
- _id: '579'
doi: 10.5220/0005346002770283
editor:
- first_name: 'Stephane '
full_name: 'Loiseau, Stephane '
last_name: Loiseau
- first_name: 'Joaquim '
full_name: 'Filipe, Joaquim '
last_name: Filipe
- first_name: 'Béatrice '
full_name: 'Duval, Béatrice '
last_name: Duval
- first_name: Jaap
full_name: van den Herik, Jaap
last_name: van den Herik
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T10:31:17Z
date_updated: 2018-03-21T10:31:17Z
file_id: '1503'
file_name: 231-GeierhosSchulzeBäumer2015.pdf
file_size: 1192736
relation: main_file
success: 1
file_date_updated: 2018-03-21T10:31:17Z
has_accepted_license: '1'
language:
- iso: eng
page: 277-283
place: Setúbal, Portugal
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 7th International Conference on Agents and Artificial
Intelligence (ICAART), Special Session on Partiality, Underspecification, and Natural
Language Processing (PUaNLP 2015)
publication_identifier:
isbn:
- ' 978-989-758-073-4'
publication_status: published
publisher: SciTePress - Science and Technology Publications
quality_controlled: '1'
status: public
title: What did you mean? Facing the Challenges of User-generated Software Requirements
type: conference
user_id: '15504'
year: '2015'
...
---
_id: '232'
abstract:
- lang: eng
text: 'We introduce weighted boolean formula games (WBFG) as a new class of succinct
games. Each player has a set of boolean formulas she wants to get satisfied; the
formulas involve a ground set of boolean variables each of which is controlled
by some player. The payoff of a player is a weighted sum of the values of her
formulas. We consider both pure equilibria and their refinement of payoff-dominant
equilibria [34], where every player is no worse-off than in any other pure equilibrium.
We present both structural and complexity results:We consider mutual weighted
boolean formula games (MWBFG), a subclass of WBFG making a natural mutuality assumption
on the formulas of players. We present a very simple exact potential for MWBFG.
We establish a polynomial monomorphism from certain classes of weighted congestion
games to subclasses of WBFG and MWBFG, respectively, indicating their rich structure.We
present a collection of complexity results about decision (and search) problems
for both pure and payoff-dominant equilibria in WBFG. The precise complexities
depend crucially on five parameters: (i) the number of players; (ii) the number
of variables per player; (iii) the number of formulas per player; (iv) the weights
in the payoff functions (whether identical or not), and (v) the syntax of the
formulas. These results imply that, unless the polynomial hierarchy collapses,
decision (and search) problems for payoff-dominant equilibria are harde than for
pure equilibria.'
author:
- first_name: Burkhard
full_name: Monien, Burkhard
last_name: Monien
- first_name: Marios
full_name: Mavronicolas, Marios
last_name: Mavronicolas
- first_name: Klaus
full_name: Wagner, Klaus
last_name: Wagner
citation:
ama: 'Monien B, Mavronicolas M, Wagner K. Weighted Boolean Formula Games. In: The
´Festschrift´ Algorithms, Probability, Networks, and Games: Scientific Papers
and Essays Dedicated to Paul G. Spirakis on the Occasion of His 60th Birthday.
LNCS. ; 2015:49-86. doi:10.1007/978-3-319-24024-4_6'
apa: 'Monien, B., Mavronicolas, M., & Wagner, K. (2015). Weighted Boolean Formula
Games. In the ´Festschrift´ Algorithms, Probability, Networks, and Games: Scientific
Papers and Essays Dedicated to Paul G. Spirakis on the Occasion of His 60th Birthday
(pp. 49–86). https://doi.org/10.1007/978-3-319-24024-4_6'
bibtex: '@inproceedings{Monien_Mavronicolas_Wagner_2015, series={LNCS}, title={Weighted
Boolean Formula Games}, DOI={10.1007/978-3-319-24024-4_6},
booktitle={the ´Festschrift´ Algorithms, Probability, Networks, and Games: Scientific
Papers and Essays Dedicated to Paul G. Spirakis on the Occasion of His 60th Birthday},
author={Monien, Burkhard and Mavronicolas, Marios and Wagner, Klaus}, year={2015},
pages={49–86}, collection={LNCS} }'
chicago: 'Monien, Burkhard, Marios Mavronicolas, and Klaus Wagner. “Weighted Boolean
Formula Games.” In The ´Festschrift´ Algorithms, Probability, Networks, and
Games: Scientific Papers and Essays Dedicated to Paul G. Spirakis on the Occasion
of His 60th Birthday, 49–86. LNCS, 2015. https://doi.org/10.1007/978-3-319-24024-4_6.'
ieee: 'B. Monien, M. Mavronicolas, and K. Wagner, “Weighted Boolean Formula Games,”
in the ´Festschrift´ Algorithms, Probability, Networks, and Games: Scientific
Papers and Essays Dedicated to Paul G. Spirakis on the Occasion of His 60th Birthday,
2015, pp. 49–86.'
mla: 'Monien, Burkhard, et al. “Weighted Boolean Formula Games.” The ´Festschrift´
Algorithms, Probability, Networks, and Games: Scientific Papers and Essays Dedicated
to Paul G. Spirakis on the Occasion of His 60th Birthday, 2015, pp. 49–86,
doi:10.1007/978-3-319-24024-4_6.'
short: 'B. Monien, M. Mavronicolas, K. Wagner, in: The ´Festschrift´ Algorithms,
Probability, Networks, and Games: Scientific Papers and Essays Dedicated to Paul
G. Spirakis on the Occasion of His 60th Birthday, 2015, pp. 49–86.'
date_created: 2017-10-17T12:41:37Z
date_updated: 2022-01-06T06:55:47Z
ddc:
- '040'
doi: 10.1007/978-3-319-24024-4_6
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T10:30:47Z
date_updated: 2018-03-21T10:30:47Z
file_id: '1502'
file_name: 232-chp_3A10.1007_2F978-3-319-24024-4_6.pdf
file_size: 500543
relation: main_file
success: 1
file_date_updated: 2018-03-21T10:30:47Z
has_accepted_license: '1'
page: 49-86
project:
- _id: '1'
name: SFB 901
- _id: '7'
name: SFB 901 - Subprojekt A3
- _id: '2'
name: SFB 901 - Project Area A
publication: 'the ´Festschrift´ Algorithms, Probability, Networks, and Games: Scientific
Papers and Essays Dedicated to Paul G. Spirakis on the Occasion of His 60th Birthday'
series_title: LNCS
status: public
title: Weighted Boolean Formula Games
type: conference
user_id: '15504'
year: '2015'
...
---
_id: '233'
abstract:
- lang: eng
text: Motivated by the deterministic single exponential time algorithm of Micciancio
and Voulgaris for solving the shortest and closest vector problem for the Euclidean
norm, we study the geometry and complexity of Voronoi cells of lattices with respect
to arbitrary norms.On the positive side, we show that for strictly convex and
smooth norms the geometry of Voronoi cells of lattices in any dimension is similar
to the Euclidean case, i.e., the Voronoi cells are defined by the so-called Voronoi-relevant
vectors and the facets of a Voronoi cell are in one-to-one correspondence with
these vectors. On the negative side, we show that combinatorially Voronoi cells
for arbitrary strictly convex and smooth norms are much more complicated than
in the Euclidean case.In particular, we construct a family of three-dimensional
lattices whose number of Voronoi-relevant vectors with respect to the l_3-norm
is unbounded.Since the algorithm of Micciancio and Voulgaris and its run time
analysis crucially dependonthefactthatfortheEuclidean normthenumber of Voronoi-relevant
vectors is single exponential in the lattice dimension, this indicates that the
techniques of Micciancio and Voulgaris cannot be extended to achieve deterministic
single exponential time algorithms for lattice problems with respect to arbitrary
l_p-norms.
author:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
- first_name: Kathlén
full_name: Kohn, Kathlén
last_name: Kohn
citation:
ama: Blömer J, Kohn K. Voronoi Cells of Lattices with Respect to Arbitrary Norms.
Universität Paderborn; 2015.
apa: Blömer, J., & Kohn, K. (2015). Voronoi Cells of Lattices with Respect
to Arbitrary Norms. Universität Paderborn.
bibtex: '@book{Blömer_Kohn_2015, title={Voronoi Cells of Lattices with Respect to
Arbitrary Norms}, publisher={Universität Paderborn}, author={Blömer, Johannes
and Kohn, Kathlén}, year={2015} }'
chicago: Blömer, Johannes, and Kathlén Kohn. Voronoi Cells of Lattices with Respect
to Arbitrary Norms. Universität Paderborn, 2015.
ieee: J. Blömer and K. Kohn, Voronoi Cells of Lattices with Respect to Arbitrary
Norms. Universität Paderborn, 2015.
mla: Blömer, Johannes, and Kathlén Kohn. Voronoi Cells of Lattices with Respect
to Arbitrary Norms. Universität Paderborn, 2015.
short: J. Blömer, K. Kohn, Voronoi Cells of Lattices with Respect to Arbitrary Norms,
Universität Paderborn, 2015.
date_created: 2017-10-17T12:41:37Z
date_updated: 2022-01-06T06:55:49Z
ddc:
- '040'
department:
- _id: '64'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T10:30:18Z
date_updated: 2018-03-21T10:30:18Z
file_id: '1501'
file_name: 233-1512.00720v1.pdf
file_size: 1231102
relation: main_file
success: 1
file_date_updated: 2018-03-21T10:30:18Z
has_accepted_license: '1'
main_file_link:
- open_access: '1'
url: http://arxiv.org/pdf/1512.00720v1.pdf
oa: '1'
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
title: Voronoi Cells of Lattices with Respect to Arbitrary Norms
type: report
user_id: '25078'
year: '2015'
...
---
_id: '5930'
author:
- first_name: Lehrstuhl
full_name: Mikroökonomie, Lehrstuhl
last_name: Mikroökonomie
citation:
ama: Mikroökonomie L. Bilateral Matching and Bargaining Games. Universität
Paderborn; 2015.
apa: Mikroökonomie, L. (2015). Bilateral matching and bargaining games. Universität
Paderborn.
bibtex: '@book{Mikroökonomie_2015, title={Bilateral matching and bargaining games},
publisher={Universität Paderborn}, author={Mikroökonomie, Lehrstuhl}, year={2015}
}'
chicago: Mikroökonomie, Lehrstuhl. Bilateral Matching and Bargaining Games.
Universität Paderborn, 2015.
ieee: L. Mikroökonomie, Bilateral matching and bargaining games. Universität
Paderborn, 2015.
mla: Mikroökonomie, Lehrstuhl. Bilateral Matching and Bargaining Games. Universität
Paderborn, 2015.
short: L. Mikroökonomie, Bilateral Matching and Bargaining Games, Universität Paderborn,
2015.
date_created: 2018-11-28T10:09:18Z
date_updated: 2022-01-06T07:02:47Z
department:
- _id: '205'
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: Universität Paderborn
status: public
title: Bilateral matching and bargaining games
type: mastersthesis
user_id: '65453'
year: '2015'
...
---
_id: '4792'
author:
- first_name: Robin
full_name: Senge, Robin
last_name: Senge
- first_name: Eyke
full_name: Hüllermeier, Eyke
id: '48129'
last_name: Hüllermeier
citation:
ama: Senge R, Hüllermeier E. Fast Fuzzy Pattern Tree Learning for Classification.
IEEE Transactions on Fuzzy Systems. 2015;23(6):2024-2033. doi:10.1109/tfuzz.2015.2396078
apa: Senge, R., & Hüllermeier, E. (2015). Fast Fuzzy Pattern Tree Learning for
Classification. IEEE Transactions on Fuzzy Systems, 23(6), 2024–2033.
https://doi.org/10.1109/tfuzz.2015.2396078
bibtex: '@article{Senge_Hüllermeier_2015, title={Fast Fuzzy Pattern Tree Learning
for Classification}, volume={23}, DOI={10.1109/tfuzz.2015.2396078},
number={6}, journal={IEEE Transactions on Fuzzy Systems}, publisher={Institute
of Electrical and Electronics Engineers (IEEE)}, author={Senge, Robin and Hüllermeier,
Eyke}, year={2015}, pages={2024–2033} }'
chicago: 'Senge, Robin, and Eyke Hüllermeier. “Fast Fuzzy Pattern Tree Learning
for Classification.” IEEE Transactions on Fuzzy Systems 23, no. 6 (2015):
2024–33. https://doi.org/10.1109/tfuzz.2015.2396078.'
ieee: R. Senge and E. Hüllermeier, “Fast Fuzzy Pattern Tree Learning for Classification,”
IEEE Transactions on Fuzzy Systems, vol. 23, no. 6, pp. 2024–2033, 2015.
mla: Senge, Robin, and Eyke Hüllermeier. “Fast Fuzzy Pattern Tree Learning for Classification.”
IEEE Transactions on Fuzzy Systems, vol. 23, no. 6, Institute of Electrical
and Electronics Engineers (IEEE), 2015, pp. 2024–33, doi:10.1109/tfuzz.2015.2396078.
short: R. Senge, E. Hüllermeier, IEEE Transactions on Fuzzy Systems 23 (2015) 2024–2033.
date_created: 2018-10-22T06:53:37Z
date_updated: 2022-01-06T07:01:22Z
ddc:
- '000'
department:
- _id: '355'
doi: 10.1109/tfuzz.2015.2396078
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T15:53:23Z
date_updated: 2018-11-02T15:53:23Z
file_id: '5316'
file_name: 07018950.pdf
file_size: 732827
relation: main_file
success: 1
file_date_updated: 2018-11-02T15:53:23Z
has_accepted_license: '1'
intvolume: ' 23'
issue: '6'
language:
- iso: eng
page: 2024-2033
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '11'
name: SFB 901 - Subproject B3
publication: IEEE Transactions on Fuzzy Systems
publication_identifier:
issn:
- 1063-6706
- 1941-0034
publication_status: published
publisher: Institute of Electrical and Electronics Engineers (IEEE)
status: public
title: Fast Fuzzy Pattern Tree Learning for Classification
type: journal_article
user_id: '49109'
volume: 23
year: '2015'
...
---
_id: '491'
abstract:
- lang: eng
text: In the framework of spatial competition, two or more players strategically
choose a locationin order to attract consumers. It is assumed standardly that
consumers with the same favorite location fully agree on the ranking of all possible
locations. To investigate the necessity of this questionable and restrictive assumption,
we model heterogeneity in consumers’ distance perceptions by individual edge lengths
of a given graph. A profile of location choices is called a “robust equilibrium”
if it is a Nash equilibrium in several games which differ only by the consumers’
perceptions of distances. For a finite number of players and any distribution of
consumers, we provide a full characterization of all robust equilibria and derive
structural conditions for their existence. Furthermore, we discuss whether the
classical observations of minimal differentiation and inefficiency are robust phenomena.
Thereby, we find strong support for an old conjecture that in equilibrium firms
form local clusters.
author:
- first_name: Berno
full_name: Buechel, Berno
last_name: Buechel
- first_name: Nils
full_name: Röhl, Nils
last_name: Röhl
citation:
ama: Buechel B, Röhl N. Robust Equilibria in Location Games. European Journal
of Operational Research. 2015;240(2):505-517. doi:10.1016/j.ejor.2014.07.019
apa: Buechel, B., & Röhl, N. (2015). Robust Equilibria in Location Games. European
Journal of Operational Research, 240(2), 505–517. https://doi.org/10.1016/j.ejor.2014.07.019
bibtex: '@article{Buechel_Röhl_2015, title={Robust Equilibria in Location Games},
volume={240}, DOI={10.1016/j.ejor.2014.07.019},
number={2}, journal={European Journal of Operational Research}, publisher={Elsevier},
author={Buechel, Berno and Röhl, Nils}, year={2015}, pages={505–517} }'
chicago: 'Buechel, Berno, and Nils Röhl. “Robust Equilibria in Location Games.”
European Journal of Operational Research 240, no. 2 (2015): 505–17. https://doi.org/10.1016/j.ejor.2014.07.019.'
ieee: B. Buechel and N. Röhl, “Robust Equilibria in Location Games,” European
Journal of Operational Research, vol. 240, no. 2, pp. 505–517, 2015.
mla: Buechel, Berno, and Nils Röhl. “Robust Equilibria in Location Games.” European
Journal of Operational Research, vol. 240, no. 2, Elsevier, 2015, pp. 505–17,
doi:10.1016/j.ejor.2014.07.019.
short: B. Buechel, N. Röhl, European Journal of Operational Research 240 (2015)
505–517.
date_created: 2017-10-17T12:42:28Z
date_updated: 2022-01-06T07:01:29Z
ddc:
- '040'
department:
- _id: '205'
- _id: '475'
doi: 10.1016/j.ejor.2014.07.019
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T13:44:15Z
date_updated: 2018-03-15T13:44:15Z
file_id: '1316'
file_name: 491-WP58.pdf
file_size: 389892
relation: main_file
success: 1
file_date_updated: 2018-03-15T13:44:15Z
has_accepted_license: '1'
intvolume: ' 240'
issue: '2'
language:
- iso: eng
page: 505-517
project:
- _id: '1'
name: SFB 901
- _id: '7'
name: SFB 901 - Subprojekt A3
- _id: '2'
name: SFB 901 - Project Area A
publication: European Journal of Operational Research
publisher: Elsevier
status: public
title: Robust Equilibria in Location Games
type: journal_article
user_id: '1112'
volume: 240
year: '2015'
...
---
_id: '743'
author:
- first_name: Arne
full_name: Schwabe, Arne
last_name: Schwabe
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: 'Schwabe A, Karl H. Topology model to generate realistic latency for simulations.
In: 2015 IEEE International Conference on Communications, ICC 2015, London,
United Kingdom, June 8-12, 2015. ; 2015:6122--6127. doi:10.1109/ICC.2015.7249298'
apa: Schwabe, A., & Karl, H. (2015). Topology model to generate realistic latency
for simulations. In 2015 IEEE International Conference on Communications, ICC
2015, London, United Kingdom, June 8-12, 2015 (pp. 6122--6127). https://doi.org/10.1109/ICC.2015.7249298
bibtex: '@inproceedings{Schwabe_Karl_2015, title={Topology model to generate realistic
latency for simulations}, DOI={10.1109/ICC.2015.7249298},
booktitle={2015 IEEE International Conference on Communications, ICC 2015, London,
United Kingdom, June 8-12, 2015}, author={Schwabe, Arne and Karl, Holger}, year={2015},
pages={6122--6127} }'
chicago: Schwabe, Arne, and Holger Karl. “Topology Model to Generate Realistic Latency
for Simulations.” In 2015 IEEE International Conference on Communications,
ICC 2015, London, United Kingdom, June 8-12, 2015, 6122--6127, 2015. https://doi.org/10.1109/ICC.2015.7249298.
ieee: A. Schwabe and H. Karl, “Topology model to generate realistic latency for
simulations,” in 2015 IEEE International Conference on Communications, ICC
2015, London, United Kingdom, June 8-12, 2015, 2015, pp. 6122--6127.
mla: Schwabe, Arne, and Holger Karl. “Topology Model to Generate Realistic Latency
for Simulations.” 2015 IEEE International Conference on Communications, ICC
2015, London, United Kingdom, June 8-12, 2015, 2015, pp. 6122--6127, doi:10.1109/ICC.2015.7249298.
short: 'A. Schwabe, H. Karl, in: 2015 IEEE International Conference on Communications,
ICC 2015, London, United Kingdom, June 8-12, 2015, 2015, pp. 6122--6127.'
date_created: 2017-11-27T10:22:25Z
date_updated: 2022-01-06T07:03:37Z
ddc:
- '000'
department:
- _id: '75'
doi: 10.1109/ICC.2015.7249298
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T14:03:07Z
date_updated: 2018-11-02T14:03:07Z
file_id: '5260'
file_name: Schwabe07249298.pdf
file_size: 3386981
relation: main_file
success: 1
file_date_updated: 2018-11-02T14:03:07Z
has_accepted_license: '1'
language:
- iso: eng
page: 6122--6127
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '6'
name: SFB 901 - Subproject A2
publication: 2015 IEEE International Conference on Communications, ICC 2015, London,
United Kingdom, June 8-12, 2015
status: public
title: Topology model to generate realistic latency for simulations
type: conference
user_id: '477'
year: '2015'
...
---
_id: '986'
abstract:
- lang: eng
text: "The increasing amount of mobile traffic leads to a significantly higher energy
consumption of mobile networks that is mainly caused by the high number of required
base stations. One recent solution for this is based on a two-layered network
that uses long-range macro cells to provide a full coverage signaling overlay
and short-range small cells for fast data transmissions. These small cells can
be switched off when they are not needed and allow network-wide energy optimizations.\r\n\r\nThis
paper presents an architecture that extends existing mobile networks to integrate
a small cell layer that supports on-demand cell activation. We discuss how additional
small cells can be interconnected with existing core components and how they can
be controlled by a resource management component. \r\nFinally, a Wi-Fi based proof
of concept testbed implementation is presented that demonstrates the feasibility
of the approach."
accept: '1'
author:
- 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: 'Peuster M, Karl H. An Architecture for Energy-aware On-demand Mobile Network
Management. In: Proceedings of the 5th Workshop on All Things Cellular: Operations,
Applications and Challenges. ; 2015.'
apa: 'Peuster, M., & Karl, H. (2015). An Architecture for Energy-aware On-demand
Mobile Network Management. In Proceedings of the 5th Workshop on All Things
Cellular: Operations, Applications and Challenges. London.'
bibtex: '@inproceedings{Peuster_Karl_2015, title={An Architecture for Energy-aware
On-demand Mobile Network Management}, booktitle={Proceedings of the 5th Workshop
on All Things Cellular: Operations, Applications and Challenges}, author={Peuster,
Manuel and Karl, Holger}, year={2015} }'
chicago: 'Peuster, Manuel, and Holger Karl. “An Architecture for Energy-Aware On-Demand
Mobile Network Management.” In Proceedings of the 5th Workshop on All Things
Cellular: Operations, Applications and Challenges, 2015.'
ieee: 'M. Peuster and H. Karl, “An Architecture for Energy-aware On-demand Mobile
Network Management,” in Proceedings of the 5th Workshop on All Things Cellular:
Operations, Applications and Challenges, London, 2015.'
mla: 'Peuster, Manuel, and Holger Karl. “An Architecture for Energy-Aware On-Demand
Mobile Network Management.” Proceedings of the 5th Workshop on All Things Cellular:
Operations, Applications and Challenges, 2015.'
short: 'M. Peuster, H. Karl, in: Proceedings of the 5th Workshop on All Things Cellular:
Operations, Applications and Challenges, 2015.'
conference:
location: London
name: 'Proceedings of the 5th Workshop on All Things Cellular: Operations, Applications
and Challenges'
date_created: 2017-11-27T10:22:29Z
date_updated: 2019-01-03T13:18:55Z
ddc:
- '000'
department:
- _id: '75'
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T14:06:06Z
date_updated: 2018-11-02T14:06:06Z
file_id: '5261'
file_name: p25-peuster.pdf
file_size: 1916017
open_access: 1
relation: main_file
success: 1
file_date_updated: 2018-11-02T14:06:06Z
language:
- iso: eng
main_file_link:
- url: https://dl.acm.org/citation.cfm?id=2785973
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '16'
name: SFB 901 - Subproject C4
publication: 'Proceedings of the 5th Workshop on All Things Cellular: Operations,
Applications and Challenges'
publication_status: published
status: public
title: An Architecture for Energy-aware On-demand Mobile Network Management
type: conference
user_id: '477'
year: '2015'
...
---
_id: '398'
abstract:
- lang: eng
text: We consider strategic games in which each player seeks a mixed strategy to
minimize her cost evaluated by a concave valuation V (mapping probability distributions
to reals); such valuations are used to model risk. In contrast to games with expectation-optimizer
players where mixed equilibria always exist (Nash 1950; Nash Ann. Math. 54, 286–295,
1951), a mixed equilibrium for such games, called a V-equilibrium, may fail to
exist, even though pure equilibria (if any) transfer over. What is the exact impact
of such valuations on the existence, structure and complexity of mixed equilibria?
We address this fundamental question in the context of expectation plus variance,
a particular concave valuation denoted as RA, which stands for risk-averse; so,
variance enters as a measure of risk and it is used as an additive adjustment
to expectation. We obtain the following results about RA-equilibria:A collection
of general structural properties of RA-equilibria connecting to (i) E-equilibria
and Var-equilibria, which correspond to the expectation and variance valuations
E and Var, respectively, and to (ii) other weaker or incomparable properties such
as Weak Equilibrium and Strong Equilibrium. Some of these structural properties
imply quantitative constraints on the existence of mixed RA-equilibria.A second
collection of (i) existence, (ii) equivalence and separation (with respect to
E-equilibria), and (iii) characterization results for RA-equilibria in the new
class of player-specific scheduling games. We provide suitable examples with a
mixed RA-equilibrium that is not an E-equilibrium and vice versa.A purification
technique to transform a player-specific scheduling game on two identical links
into a player-specific scheduling game on two links so that all non-pure RA-equilibria
are eliminated while no new pure equilibria are created; so, a particular player-specific
scheduling game on two identical links with no pure equilibrium yields a player-specific
scheduling game with no RA-equilibrium (whether mixed or pure). As a by-product,
the first PLS-completeness result for the computation of RA-equilibria follows.
author:
- first_name: Burkhard
full_name: Monien, Burkhard
last_name: Monien
- first_name: Marios
full_name: Mavronicolas, Marios
last_name: Mavronicolas
citation:
ama: Monien B, Mavronicolas M. Minimizing Expectation Plus Variance. Theory of
Computing Systems. 2015;57(3):617-654. doi:10.1007/s00224-014-9542-z
apa: Monien, B., & Mavronicolas, M. (2015). Minimizing Expectation Plus Variance.
Theory of Computing Systems, 57(3), 617–654. https://doi.org/10.1007/s00224-014-9542-z
bibtex: '@article{Monien_Mavronicolas_2015, title={Minimizing Expectation Plus Variance},
volume={57}, DOI={10.1007/s00224-014-9542-z},
number={3}, journal={Theory of Computing Systems}, publisher={Springer}, author={Monien,
Burkhard and Mavronicolas, Marios}, year={2015}, pages={617–654} }'
chicago: 'Monien, Burkhard, and Marios Mavronicolas. “Minimizing Expectation Plus
Variance.” Theory of Computing Systems 57, no. 3 (2015): 617–54. https://doi.org/10.1007/s00224-014-9542-z.'
ieee: B. Monien and M. Mavronicolas, “Minimizing Expectation Plus Variance,” Theory
of Computing Systems, vol. 57, no. 3, pp. 617–654, 2015.
mla: Monien, Burkhard, and Marios Mavronicolas. “Minimizing Expectation Plus Variance.”
Theory of Computing Systems, vol. 57, no. 3, Springer, 2015, pp. 617–54,
doi:10.1007/s00224-014-9542-z.
short: B. Monien, M. Mavronicolas, Theory of Computing Systems 57 (2015) 617–654.
date_created: 2017-10-17T12:42:09Z
date_updated: 2022-01-06T07:00:04Z
ddc:
- '040'
doi: 10.1007/s00224-014-9542-z
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T08:22:31Z
date_updated: 2018-03-15T08:22:31Z
file_id: '1255'
file_name: 398-MEPV14_02.pdf
file_size: 638191
relation: main_file
success: 1
file_date_updated: 2018-03-15T08:22:31Z
has_accepted_license: '1'
intvolume: ' 57'
issue: '3'
language:
- iso: eng
page: 617-654
project:
- _id: '1'
name: SFB 901
- _id: '7'
name: SFB 901 - Subprojekt A3
- _id: '2'
name: SFB 901 - Project Area A
publication: Theory of Computing Systems
publisher: Springer
status: public
title: Minimizing Expectation Plus Variance
type: journal_article
user_id: '42447'
volume: 57
year: '2015'
...
---
_id: '5090'
author:
- first_name: Thomas
full_name: Streck, Thomas
id: '33041'
last_name: Streck
citation:
ama: Streck T. Praktikabilität Des Adjusted Winner Verfahrens Bei Variablem Status
Quo- Punkt Und Exogenen Einflüssen. Universität Paderborn; 2015.
apa: Streck, T. (2015). Praktikabilität des Adjusted Winner Verfahrens bei variablem
Status Quo- Punkt und exogenen Einflüssen. Universität Paderborn.
bibtex: '@book{Streck_2015, title={Praktikabilität des Adjusted Winner Verfahrens
bei variablem Status Quo- Punkt und exogenen Einflüssen}, publisher={Universität
Paderborn}, author={Streck, Thomas}, year={2015} }'
chicago: Streck, Thomas. Praktikabilität Des Adjusted Winner Verfahrens Bei Variablem
Status Quo- Punkt Und Exogenen Einflüssen. Universität Paderborn, 2015.
ieee: T. Streck, Praktikabilität des Adjusted Winner Verfahrens bei variablem
Status Quo- Punkt und exogenen Einflüssen. Universität Paderborn, 2015.
mla: Streck, Thomas. Praktikabilität Des Adjusted Winner Verfahrens Bei Variablem
Status Quo- Punkt Und Exogenen Einflüssen. Universität Paderborn, 2015.
short: T. Streck, Praktikabilität Des Adjusted Winner Verfahrens Bei Variablem Status
Quo- Punkt Und Exogenen Einflüssen, Universität Paderborn, 2015.
date_created: 2018-10-30T14:56:49Z
date_updated: 2022-01-06T07:01:37Z
department:
- _id: '205'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '7'
name: SFB 901 - Subproject 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: Praktikabilität des Adjusted Winner Verfahrens bei variablem Status Quo- Punkt
und exogenen Einflüssen
type: bachelorsthesis
user_id: '477'
year: '2015'
...
---
_id: '5207'
author:
- first_name: Li
full_name: Li, Li
last_name: Li
- first_name: Alexandre
full_name: Bartel, Alexandre
last_name: Bartel
- first_name: Tegawende F.
full_name: Bissyande, Tegawende F.
last_name: Bissyande
- first_name: Jacques
full_name: Klein, Jacques
last_name: Klein
- first_name: Yves
full_name: Le Traon, Yves
last_name: Le Traon
- first_name: Steven
full_name: Arzt, Steven
last_name: Arzt
- first_name: Siegfried
full_name: Rasthofer, Siegfried
last_name: Rasthofer
- first_name: Eric
full_name: Bodden, Eric
id: '59256'
last_name: Bodden
orcid: 0000-0003-3470-3647
- first_name: Damien
full_name: Octeau, Damien
last_name: Octeau
- first_name: Patrick
full_name: McDaniel, Patrick
last_name: McDaniel
citation:
ama: 'Li L, Bartel A, Bissyande TF, et al. IccTA: Detecting Inter-Component Privacy
Leaks in Android Apps. In: 2015 International Conference on Software Engineering
(ICSE). ; 2015:280-291.'
apa: 'Li, L., Bartel, A., Bissyande, T. F., Klein, J., Le Traon, Y., Arzt, S., …
McDaniel, P. (2015). IccTA: Detecting Inter-Component Privacy Leaks in Android
Apps. In 2015 International Conference on Software Engineering (ICSE) (pp.
280–291).'
bibtex: '@inproceedings{Li_Bartel_Bissyande_Klein_Le Traon_Arzt_Rasthofer_Bodden_Octeau_McDaniel_2015,
title={IccTA: Detecting Inter-Component Privacy Leaks in Android Apps}, booktitle={2015
International Conference on Software Engineering (ICSE)}, author={Li, Li and Bartel,
Alexandre and Bissyande, Tegawende F. and Klein, Jacques and Le Traon, Yves and
Arzt, Steven and Rasthofer, Siegfried and Bodden, Eric and Octeau, Damien and
McDaniel, Patrick}, year={2015}, pages={280–291} }'
chicago: 'Li, Li, Alexandre Bartel, Tegawende F. Bissyande, Jacques Klein, Yves
Le Traon, Steven Arzt, Siegfried Rasthofer, Eric Bodden, Damien Octeau, and Patrick
McDaniel. “IccTA: Detecting Inter-Component Privacy Leaks in Android Apps.” In
2015 International Conference on Software Engineering (ICSE), 280–91, 2015.'
ieee: 'L. Li et al., “IccTA: Detecting Inter-Component Privacy Leaks in Android
Apps,” in 2015 International Conference on Software Engineering (ICSE),
2015, pp. 280–291.'
mla: 'Li, Li, et al. “IccTA: Detecting Inter-Component Privacy Leaks in Android
Apps.” 2015 International Conference on Software Engineering (ICSE), 2015,
pp. 280–91.'
short: 'L. Li, A. Bartel, T.F. Bissyande, J. Klein, Y. Le Traon, S. Arzt, S. Rasthofer,
E. Bodden, D. Octeau, P. McDaniel, in: 2015 International Conference on Software
Engineering (ICSE), 2015, pp. 280–291.'
date_created: 2018-10-31T12:59:44Z
date_updated: 2022-01-06T07:01:46Z
ddc:
- '000'
department:
- _id: '76'
extern: '1'
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T14:10:22Z
date_updated: 2018-11-02T14:10:22Z
file_id: '5263'
file_name: lbb+15iccta.pdf
file_size: 206378
relation: main_file
success: 1
file_date_updated: 2018-11-02T14:10:22Z
has_accepted_license: '1'
keyword:
- CROSSING
- ATTRACT
- ITSECWEBSITE
language:
- iso: eng
main_file_link:
- url: http://www.bodden.de/pubs/lbb+15iccta.pdf
page: 280-291
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '12'
name: SFB 901 - Subproject B4
publication: 2015 International Conference on Software Engineering (ICSE)
publication_identifier:
isbn:
- 978-1-4799-1934-5
status: public
title: 'IccTA: Detecting Inter-Component Privacy Leaks in Android Apps'
type: conference
user_id: '477'
year: '2015'
...
---
_id: '5413'
author:
- first_name: Lukas
full_name: Funke, Lukas
last_name: Funke
citation:
ama: Funke L. An LLVM Based Toolchain for Transparent Acceleration of Digital
Image Processing Applications Using FPGA Overlay Architectures. Universität
Paderborn; 2015.
apa: Funke, L. (2015). An LLVM Based Toolchain for Transparent Acceleration of
Digital Image Processing Applications using FPGA Overlay Architectures. Universität
Paderborn.
bibtex: '@book{Funke_2015, title={An LLVM Based Toolchain for Transparent Acceleration
of Digital Image Processing Applications using FPGA Overlay Architectures}, publisher={Universität
Paderborn}, author={Funke, Lukas}, year={2015} }'
chicago: Funke, Lukas. An LLVM Based Toolchain for Transparent Acceleration of
Digital Image Processing Applications Using FPGA Overlay Architectures. Universität
Paderborn, 2015.
ieee: L. Funke, An LLVM Based Toolchain for Transparent Acceleration of Digital
Image Processing Applications using FPGA Overlay Architectures. Universität
Paderborn, 2015.
mla: Funke, Lukas. An LLVM Based Toolchain for Transparent Acceleration of Digital
Image Processing Applications Using FPGA Overlay Architectures. Universität
Paderborn, 2015.
short: L. Funke, An LLVM Based Toolchain for Transparent Acceleration of Digital
Image Processing Applications Using FPGA Overlay Architectures, Universität Paderborn,
2015.
date_created: 2018-11-07T15:10:35Z
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: An LLVM Based Toolchain for Transparent Acceleration of Digital Image Processing
Applications using FPGA Overlay Architectures
type: mastersthesis
user_id: '477'
year: '2015'
...
---
_id: '5416'
author:
- first_name: Thomas
full_name: Löcke, Thomas
last_name: Löcke
citation:
ama: Löcke T. Instance-Specific Computing in Hard- and Software for Faster Solving
of Complex Problems. Universität Paderborn; 2015.
apa: Löcke, T. (2015). Instance-Specific Computing in Hard- and Software for
Faster Solving of Complex Problems. Universität Paderborn.
bibtex: '@book{Löcke_2015, title={Instance-Specific Computing in Hard- and Software
for Faster Solving of Complex Problems}, publisher={Universität Paderborn}, author={Löcke,
Thomas}, year={2015} }'
chicago: Löcke, Thomas. Instance-Specific Computing in Hard- and Software for
Faster Solving of Complex Problems. Universität Paderborn, 2015.
ieee: T. Löcke, Instance-Specific Computing in Hard- and Software for Faster
Solving of Complex Problems. Universität Paderborn, 2015.
mla: Löcke, Thomas. Instance-Specific Computing in Hard- and Software for Faster
Solving of Complex Problems. Universität Paderborn, 2015.
short: T. Löcke, Instance-Specific Computing in Hard- and Software for Faster Solving
of Complex Problems, Universität Paderborn, 2015.
date_created: 2018-11-07T16:06:53Z
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: Instance-Specific Computing in Hard- and Software for Faster Solving of Complex
Problems
type: mastersthesis
user_id: '477'
year: '2015'
...
---
_id: '5419'
author:
- first_name: Felix
full_name: Wallaschek, Felix
last_name: Wallaschek
citation:
ama: Wallaschek F. Accelerating Programmable Logic Controllers with the Use of
FPGAs. Universität Paderborn; 2015.
apa: Wallaschek, F. (2015). Accelerating Programmable Logic Controllers with
the use of FPGAs. Universität Paderborn.
bibtex: '@book{Wallaschek_2015, title={Accelerating Programmable Logic Controllers
with the use of FPGAs}, publisher={Universität Paderborn}, author={Wallaschek,
Felix}, year={2015} }'
chicago: Wallaschek, Felix. Accelerating Programmable Logic Controllers with
the Use of FPGAs. Universität Paderborn, 2015.
ieee: F. Wallaschek, Accelerating Programmable Logic Controllers with the use
of FPGAs. Universität Paderborn, 2015.
mla: Wallaschek, Felix. Accelerating Programmable Logic Controllers with the
Use of FPGAs. Universität Paderborn, 2015.
short: F. Wallaschek, Accelerating Programmable Logic Controllers with the Use of
FPGAs, Universität Paderborn, 2015.
date_created: 2018-11-07T16:14:30Z
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: Accelerating Programmable Logic Controllers with the use of FPGAs
type: mastersthesis
user_id: '477'
year: '2015'
...
---
_id: '694'
author:
- first_name: Georg
full_name: Stilow, Georg
last_name: Stilow
citation:
ama: 'Stilow G. Mobile Agenten in Netzwerken: Analyse von Hotspots. Universität
Paderborn; 2015.'
apa: 'Stilow, G. (2015). Mobile Agenten in Netzwerken: Analyse von Hotspots.
Universität Paderborn.'
bibtex: '@book{Stilow_2015, title={Mobile Agenten in Netzwerken: Analyse von Hotspots},
publisher={Universität Paderborn}, author={Stilow, Georg}, year={2015} }'
chicago: 'Stilow, Georg. Mobile Agenten in Netzwerken: Analyse von Hotspots.
Universität Paderborn, 2015.'
ieee: 'G. Stilow, Mobile Agenten in Netzwerken: Analyse von Hotspots. Universität
Paderborn, 2015.'
mla: 'Stilow, Georg. Mobile Agenten in Netzwerken: Analyse von Hotspots.
Universität Paderborn, 2015.'
short: 'G. Stilow, Mobile Agenten in Netzwerken: Analyse von Hotspots, Universität
Paderborn, 2015.'
date_created: 2017-11-14T06:55:56Z
date_updated: 2022-01-06T07:03:23Z
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
title: 'Mobile Agenten in Netzwerken: Analyse von Hotspots'
type: bachelorsthesis
user_id: '477'
year: '2015'
...