---
_id: '3685'
author:
- first_name: Michael
full_name: Goller, Michael
id: '30984'
last_name: Goller
orcid: 0000-0002-2820-9178
- first_name: Christian
full_name: Harteis, Christian
id: '27503'
last_name: Harteis
orcid: https://orcid.org/0000-0002-3570-7626
citation:
ama: 'Goller M, Harteis C. Employing agency in academic settings: Doctoral students
shaping their own experiences. In: Harteis C, Rausch A, Seifried J, eds. Discourses
on Professional Learning. Dordrecht: Springer; 2014:189--210.'
apa: 'Goller, M., & Harteis, C. (2014). Employing agency in academic settings:
Doctoral students shaping their own experiences. In C. Harteis, A. Rausch, &
J. Seifried (Eds.), Discourses on Professional Learning (pp. 189--210).
Dordrecht: Springer.'
bibtex: '@inbook{Goller_Harteis_2014, place={Dordrecht}, title={Employing agency
in academic settings: Doctoral students shaping their own experiences}, booktitle={Discourses
on Professional Learning}, publisher={Springer}, author={Goller, Michael and Harteis,
Christian}, editor={Harteis, Christian and Rausch, Andreas and Seifried, JürgenEditors},
year={2014}, pages={189--210} }'
chicago: 'Goller, Michael, and Christian Harteis. “Employing Agency in Academic
Settings: Doctoral Students Shaping Their Own Experiences.” In Discourses on
Professional Learning, edited by Christian Harteis, Andreas Rausch, and Jürgen
Seifried, 189--210. Dordrecht: Springer, 2014.'
ieee: 'M. Goller and C. Harteis, “Employing agency in academic settings: Doctoral
students shaping their own experiences,” in Discourses on Professional Learning,
C. Harteis, A. Rausch, and J. Seifried, Eds. Dordrecht: Springer, 2014, pp. 189--210.'
mla: 'Goller, Michael, and Christian Harteis. “Employing Agency in Academic Settings:
Doctoral Students Shaping Their Own Experiences.” Discourses on Professional
Learning, edited by Christian Harteis et al., Springer, 2014, pp. 189--210.'
short: 'M. Goller, C. Harteis, in: C. Harteis, A. Rausch, J. Seifried (Eds.), Discourses
on Professional Learning, Springer, Dordrecht, 2014, pp. 189--210.'
date_created: 2018-07-23T13:36:48Z
date_updated: 2022-01-06T06:59:30Z
department:
- _id: '452'
editor:
- first_name: Christian
full_name: Harteis, Christian
last_name: Harteis
- first_name: Andreas
full_name: Rausch, Andreas
last_name: Rausch
- first_name: Jürgen
full_name: Seifried, Jürgen
last_name: Seifried
page: 189--210
place: Dordrecht
publication: Discourses on Professional Learning
publisher: Springer
status: public
title: 'Employing agency in academic settings: Doctoral students shaping their own
experiences'
type: book_chapter
user_id: '27503'
year: '2014'
...
---
_id: '3686'
author:
- first_name: Christian
full_name: Harteis, Christian
id: '27503'
last_name: Harteis
orcid: https://orcid.org/0000-0002-3570-7626
- first_name: Michael
full_name: Goller, Michael
id: '30984'
last_name: Goller
orcid: 0000-0002-2820-9178
citation:
ama: 'Harteis C, Goller M. New skills for new jobs: Work agency as a necessary condition
for successful lifelong learning. In: Halttunen T, Koivisto M, Billett S, eds.
Promoting, Assessing, Recognizing and Certifying Lifelong Learning. Dordrecht:
Springer; 2014:37--56.'
apa: 'Harteis, C., & Goller, M. (2014). New skills for new jobs: Work agency
as a necessary condition for successful lifelong learning. In T. Halttunen, M.
Koivisto, & S. Billett (Eds.), Promoting, assessing, recognizing and certifying
lifelong learning (pp. 37--56). Dordrecht: Springer.'
bibtex: '@inbook{Harteis_Goller_2014, place={Dordrecht}, title={New skills for new
jobs: Work agency as a necessary condition for successful lifelong learning},
booktitle={Promoting, assessing, recognizing and certifying lifelong learning},
publisher={Springer}, author={Harteis, Christian and Goller, Michael}, editor={Halttunen,
Timo and Koivisto, Mari and Billett, StephenEditors}, year={2014}, pages={37--56}
}'
chicago: 'Harteis, Christian, and Michael Goller. “New Skills for New Jobs: Work
Agency as a Necessary Condition for Successful Lifelong Learning.” In Promoting,
Assessing, Recognizing and Certifying Lifelong Learning, edited by Timo Halttunen,
Mari Koivisto, and Stephen Billett, 37--56. Dordrecht: Springer, 2014.'
ieee: 'C. Harteis and M. Goller, “New skills for new jobs: Work agency as a necessary
condition for successful lifelong learning,” in Promoting, assessing, recognizing
and certifying lifelong learning, T. Halttunen, M. Koivisto, and S. Billett,
Eds. Dordrecht: Springer, 2014, pp. 37--56.'
mla: 'Harteis, Christian, and Michael Goller. “New Skills for New Jobs: Work Agency
as a Necessary Condition for Successful Lifelong Learning.” Promoting, Assessing,
Recognizing and Certifying Lifelong Learning, edited by Timo Halttunen et
al., Springer, 2014, pp. 37--56.'
short: 'C. Harteis, M. Goller, in: T. Halttunen, M. Koivisto, S. Billett (Eds.),
Promoting, Assessing, Recognizing and Certifying Lifelong Learning, Springer,
Dordrecht, 2014, pp. 37--56.'
date_created: 2018-07-23T13:38:10Z
date_updated: 2022-01-06T06:59:30Z
department:
- _id: '452'
editor:
- first_name: Timo
full_name: Halttunen, Timo
last_name: Halttunen
- first_name: Mari
full_name: Koivisto, Mari
last_name: Koivisto
- first_name: Stephen
full_name: Billett, Stephen
last_name: Billett
page: 37--56
place: Dordrecht
publication: Promoting, assessing, recognizing and certifying lifelong learning
publisher: Springer
status: public
title: 'New skills for new jobs: Work agency as a necessary condition for successful
lifelong learning'
type: book_chapter
user_id: '27503'
year: '2014'
...
---
_id: '369'
abstract:
- lang: eng
text: 'RSA Full Domain Hash ist im Zufallsorakelmodell ein EUF-CMA sicheres Signaturverfahren
(existentially unforgeable under chosen-message attacks). Der Sicherheitsbeweis
wird unter anderem in der Vorlesung Einf{\"u}hrung in die Kryptographie vorgestellt.
Auch bei einer genaueren Analyse verliert man bei der Reduktion einen Faktor \nicefrac{1}{q_{s}}(wobei
q_{s}die Anzahl der Anfragen an das Signaturorakel darstellt), was f{\"u}r die
Praxis in relativ großen Systemparametern (RSA-Modul) resultiert [1].Seit der
Ver{\"o}ffentlichung von [2] wurde geglaubt, dass der Faktor \nicefrac{1}{q_{s}}optimal
ist. Erst zehn Jahre sp{\"a}ter offenbarten die Autoren von [3] einen Fehler in
[2] und zeigten eine bessere Reduktion allerdings unter einer etwas st{\"a}rkeren
Sicherheitsannahme.Die Ergebnisse aus [3] lassen sich auf PSS-Verfahren (Probabilistic
Signature Scheme), das z.B. in PKCS #1 benutzt wird, {\"u}bertragen und sind somit
von großer Bedeutung f{\"u}r die Praxis. Weiterhin sind die in den Beweisen verwendete
Techniken n{\"u}tzlich auch bei anderen kryptographischen Verfahren.In Rahmen
dieser Arbeit sollen die entsprechenden Sicherheitsbeweise aufgearbeitet und dessen
Auswirkungen f{\"u}r die Praxis analysiert werden.[1] J.S. Coron, “On the Exact
Security of Full Domain Hash”, CRYPTO 2000. LNCS 1880, pp. 229-235, 2000.[2] J.S.
Coron, “Optimal security proofs for PPS and other signature schemes”, EUROCRYPT
2002. LNCS 2332, pp 272-287, 2002.[3] S.A. Kakvi and E. Kiltz, “Optimal Security
Proofs for Full Domain Hash, Revisited”, in EUROCRYPT 2012. LNCS 7237, pp 537-553,
2012.'
author:
- first_name: Timo
full_name: Rath, Timo
last_name: Rath
citation:
ama: Rath T. RSA-Full Domain Hash Revisited. Universität Paderborn; 2014.
apa: Rath, T. (2014). RSA-Full Domain Hash Revisited. Universität Paderborn.
bibtex: '@book{Rath_2014, title={RSA-Full Domain Hash Revisited}, publisher={Universität
Paderborn}, author={Rath, Timo}, year={2014} }'
chicago: Rath, Timo. RSA-Full Domain Hash Revisited. Universität Paderborn,
2014.
ieee: T. Rath, RSA-Full Domain Hash Revisited. Universität Paderborn, 2014.
mla: Rath, Timo. RSA-Full Domain Hash Revisited. Universität Paderborn, 2014.
short: T. Rath, RSA-Full Domain Hash Revisited, Universität Paderborn, 2014.
date_created: 2017-10-17T12:42:04Z
date_updated: 2022-01-06T06:59:30Z
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: RSA-Full Domain Hash Revisited
type: bachelorsthesis
user_id: '477'
year: '2014'
...
---
_id: '3699'
abstract:
- lang: eng
text: When taxes on capital or wealth are levied, in most countries companies have
to be assessed in terms of their market value (MV). Estimating the MV of private
companies for tax purposes is a challenging task for tax authorities as MVs are
not available. In this study, I empirically analyse to what extent an accounting-based
tax valuation method for private companies, a simplified residual income model,
succeeds in matching the MV. I refer to the mandatory Standardised Combination
Model that is a special case of methods commonly used in several countries. In
the absence of market prices for private companies, I use a sample of small German
public companies as a proxy. I validate this approach using a sensitivity analysis
that involves matching the sample of public companies with that of private companies.
The results imply that the mandatory Standardised Combination Model leads to a
severe unequal treatment not only between public and private companies but also
among private companies across and within industries. Furthermore, I simulate
the effects of variation in the key parameters and highlight their impact on the
approximation quality of the Standardised Combination Method. The findings are
relevant to tax reform discussions as well as to tax policy-makers and practitioners
in many countries.
article_type: original
author:
- first_name: Jens
full_name: Müller, Jens
id: '1245'
last_name: Müller
citation:
ama: Müller J. The challenge of assessing the market value of private companies
using a standardised combination method for tax purposes--Lessons to be learnt
from past experience. European Accounting Review. 2014;(1):117--141.
apa: Müller, J. (2014). The challenge of assessing the market value of private companies
using a standardised combination method for tax purposes--Lessons to be learnt
from past experience. European Accounting Review, (1), 117--141.
bibtex: '@article{Müller_2014, title={The challenge of assessing the market value
of private companies using a standardised combination method for tax purposes--Lessons
to be learnt from past experience}, number={1}, journal={European Accounting Review},
author={Müller, Jens}, year={2014}, pages={117--141} }'
chicago: 'Müller, Jens. “The Challenge of Assessing the Market Value of Private
Companies Using a Standardised Combination Method for Tax Purposes--Lessons to
Be Learnt from Past Experience.” European Accounting Review, no. 1 (2014):
117--141.'
ieee: J. Müller, “The challenge of assessing the market value of private companies
using a standardised combination method for tax purposes--Lessons to be learnt
from past experience,” European Accounting Review, no. 1, pp. 117--141,
2014.
mla: Müller, Jens. “The Challenge of Assessing the Market Value of Private Companies
Using a Standardised Combination Method for Tax Purposes--Lessons to Be Learnt
from Past Experience.” European Accounting Review, no. 1, 2014, pp. 117--141.
short: J. Müller, European Accounting Review (2014) 117--141.
date_created: 2018-07-25T07:53:11Z
date_updated: 2022-01-06T06:59:30Z
department:
- _id: '189'
issue: '1'
jel:
- H2
- M41
keyword:
- Challenge of Assessing
- Tax Purposes
language:
- iso: eng
page: 117--141
publication: European Accounting Review
status: public
title: The challenge of assessing the market value of private companies using a standardised
combination method for tax purposes--Lessons to be learnt from past experience
type: journal_article
user_id: '48187'
year: '2014'
...
---
_id: '370'
abstract:
- lang: eng
text: 'Max-min fairness (MMF) is a widely known approach to a fair allocation of
bandwidth to each of the users in a network. This allocation can be computed by
uniformly raising the bandwidths of all users without violating capacity constraints.
We consider an extension of these allocations by raising the bandwidth with arbitrary
and not necessarily uniform time-depending velocities (allocation rates). These
allocations are used in a game-theoretic context for routing choices, which we
formalize in progressive filling games (PFGs).We present a variety of results
for equilibria in PFGs. We show that these games possess pure Nash and strong
equilibria. While computation in general is NP-hard, there are polynomial-time
algorithms for prominent classes of Max-Min-Fair Games (MMFG), including the case
when all users have the same source-destination pair. We characterize prices of
anarchy and stability for pure Nash and strong equilibria in PFGs and MMFGs when
players have different or the same source-destination pairs. In addition, we show
that when a designer can adjust allocation rates, it is possible to design games
with optimal strong equilibria. Some initial results on polynomial-time algorithms
in this direction are also derived. '
author:
- first_name: Tobias
full_name: Harks, Tobias
last_name: Harks
- first_name: Martin
full_name: Höfer, Martin
last_name: Höfer
- first_name: Kevin
full_name: Schewior, Kevin
last_name: Schewior
- first_name: Alexander
full_name: Skopalik, Alexander
id: '40384'
last_name: Skopalik
citation:
ama: 'Harks T, Höfer M, Schewior K, Skopalik A. Routing Games with Progressive Filling.
In: Proceedings of the 33rd Annual IEEE International Conference on Computer
Communications (INFOCOM’14). ; 2014:352-360. doi:10.1109/TNET.2015.2468571'
apa: Harks, T., Höfer, M., Schewior, K., & Skopalik, A. (2014). Routing Games
with Progressive Filling. In Proceedings of the 33rd Annual IEEE International
Conference on Computer Communications (INFOCOM’14) (pp. 352–360). https://doi.org/10.1109/TNET.2015.2468571
bibtex: '@inproceedings{Harks_Höfer_Schewior_Skopalik_2014, title={Routing Games
with Progressive Filling}, DOI={10.1109/TNET.2015.2468571},
booktitle={Proceedings of the 33rd Annual IEEE International Conference on Computer
Communications (INFOCOM’14)}, author={Harks, Tobias and Höfer, Martin and Schewior,
Kevin and Skopalik, Alexander}, year={2014}, pages={352–360} }'
chicago: Harks, Tobias, Martin Höfer, Kevin Schewior, and Alexander Skopalik. “Routing
Games with Progressive Filling.” In Proceedings of the 33rd Annual IEEE International
Conference on Computer Communications (INFOCOM’14), 352–60, 2014. https://doi.org/10.1109/TNET.2015.2468571.
ieee: T. Harks, M. Höfer, K. Schewior, and A. Skopalik, “Routing Games with Progressive
Filling,” in Proceedings of the 33rd Annual IEEE International Conference on
Computer Communications (INFOCOM’14), 2014, pp. 352–360.
mla: Harks, Tobias, et al. “Routing Games with Progressive Filling.” Proceedings
of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM’14),
2014, pp. 352–60, doi:10.1109/TNET.2015.2468571.
short: 'T. Harks, M. Höfer, K. Schewior, A. Skopalik, in: Proceedings of the 33rd
Annual IEEE International Conference on Computer Communications (INFOCOM’14),
2014, pp. 352–360.'
date_created: 2017-10-17T12:42:04Z
date_updated: 2022-01-06T06:59:30Z
ddc:
- '040'
department:
- _id: '63'
- _id: '541'
doi: 10.1109/TNET.2015.2468571
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:17:04Z
date_updated: 2018-03-20T07:17:04Z
file_id: '1402'
file_name: 370-HHSS14.pdf
file_size: 179583
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:17:04Z
has_accepted_license: '1'
language:
- iso: eng
page: 352-360
project:
- _id: '1'
name: SFB 901
- _id: '7'
name: SFB 901 - Subprojekt A3
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 33rd Annual IEEE International Conference on Computer
Communications (INFOCOM'14)
status: public
title: Routing Games with Progressive Filling
type: conference
user_id: '477'
year: '2014'
...
---
_id: '371'
abstract:
- lang: eng
text: In this work we present the first distributed storage system that is provably
robust against crash failures issued by an adaptive adversary, i.e., for each
batch of requests the adversary can decide based on the entire system state which
servers will be unavailable for that batch of requests. Despite up to \gamma n^{1/\log\log
n} crashed servers, with \gamma>0 constant and n denoting the number of servers,
our system can correctly process any batch of lookup and write requests (with
at most a polylogarithmic number of requests issued at each non-crashed server)
in at most a polylogarithmic number of communication rounds, with at most polylogarithmic
time and work at each server and only a logarithmic storage overhead. Our system
is based on previous work by Eikel and Scheideler (SPAA 2013), who presented IRIS,
a distributed information system that is provably robust against the same kind
of crash failures. However, IRIS is only able to serve lookup requests. Handling
both lookup and write requests has turned out to require major changes in the
design of IRIS.
author:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Alexander
full_name: Setzer, Alexander
id: '11108'
last_name: Setzer
- first_name: Martina
full_name: Eikel, Martina
last_name: Eikel
citation:
ama: 'Scheideler C, Setzer A, Eikel M. RoBuSt: A Crash-Failure-Resistant Distributed
Storage System. In: Proceedings of the 18th International Conference on Principles
of Distributed Systems (OPODIS). LNCS. ; 2014:107--122. doi:10.1007/978-3-319-14472-6_8'
apa: 'Scheideler, C., Setzer, A., & Eikel, M. (2014). RoBuSt: A Crash-Failure-Resistant
Distributed Storage System. In Proceedings of the 18th International Conference
on Principles of Distributed Systems (OPODIS) (pp. 107--122). https://doi.org/10.1007/978-3-319-14472-6_8'
bibtex: '@inproceedings{Scheideler_Setzer_Eikel_2014, series={LNCS}, title={RoBuSt:
A Crash-Failure-Resistant Distributed Storage System}, DOI={10.1007/978-3-319-14472-6_8},
booktitle={Proceedings of the 18th International Conference on Principles of Distributed
Systems (OPODIS)}, author={Scheideler, Christian and Setzer, Alexander and Eikel,
Martina}, year={2014}, pages={107--122}, collection={LNCS} }'
chicago: 'Scheideler, Christian, Alexander Setzer, and Martina Eikel. “RoBuSt: A
Crash-Failure-Resistant Distributed Storage System.” In Proceedings of the
18th International Conference on Principles of Distributed Systems (OPODIS),
107--122. LNCS, 2014. https://doi.org/10.1007/978-3-319-14472-6_8.'
ieee: 'C. Scheideler, A. Setzer, and M. Eikel, “RoBuSt: A Crash-Failure-Resistant
Distributed Storage System,” in Proceedings of the 18th International Conference
on Principles of Distributed Systems (OPODIS), 2014, pp. 107--122.'
mla: 'Scheideler, Christian, et al. “RoBuSt: A Crash-Failure-Resistant Distributed
Storage System.” Proceedings of the 18th International Conference on Principles
of Distributed Systems (OPODIS), 2014, pp. 107--122, doi:10.1007/978-3-319-14472-6_8.'
short: 'C. Scheideler, A. Setzer, M. Eikel, in: Proceedings of the 18th International
Conference on Principles of Distributed Systems (OPODIS), 2014, pp. 107--122.'
date_created: 2017-10-17T12:42:04Z
date_updated: 2022-01-06T06:59:31Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1007/978-3-319-14472-6_8
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:16:32Z
date_updated: 2018-03-20T07:16:32Z
file_id: '1401'
file_name: 371-RoBuSt-OPODIS.pdf
file_size: 269941
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:16:32Z
has_accepted_license: '1'
page: 107--122
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the 18th International Conference on Principles of Distributed
Systems (OPODIS)
series_title: LNCS
status: public
title: 'RoBuSt: A Crash-Failure-Resistant Distributed Storage System'
type: conference
user_id: '15504'
year: '2014'
...
---
_id: '3718'
author:
- first_name: Christian
full_name: Harteis, Christian
id: '27503'
last_name: Harteis
orcid: https://orcid.org/0000-0002-3570-7626
citation:
ama: 'Harteis C. Auswirkungen des Bologna-Prozesses: Eine Expertise der Hochschuldidaktik.
In: Arnold R, Wolf K, eds. Herausforderung Kompetenzorientierte Hochschule.
Hohengeheren: Schneider; 2014:189-211.'
apa: 'Harteis, C. (2014). Auswirkungen des Bologna-Prozesses: Eine Expertise der
Hochschuldidaktik. In R. Arnold & K. Wolf (Eds.), Herausforderung kompetenzorientierte
Hochschule (pp. 189–211). Hohengeheren: Schneider.'
bibtex: '@inbook{Harteis_2014, place={Hohengeheren}, title={Auswirkungen des Bologna-Prozesses:
Eine Expertise der Hochschuldidaktik}, booktitle={Herausforderung kompetenzorientierte
Hochschule}, publisher={Schneider}, author={Harteis, Christian}, editor={Arnold,
Rolf and Wolf, KEditors}, year={2014}, pages={189–211} }'
chicago: 'Harteis, Christian. “Auswirkungen Des Bologna-Prozesses: Eine Expertise
Der Hochschuldidaktik.” In Herausforderung Kompetenzorientierte Hochschule,
edited by Rolf Arnold and K Wolf, 189–211. Hohengeheren: Schneider, 2014.'
ieee: 'C. Harteis, “Auswirkungen des Bologna-Prozesses: Eine Expertise der Hochschuldidaktik,”
in Herausforderung kompetenzorientierte Hochschule, R. Arnold and K. Wolf,
Eds. Hohengeheren: Schneider, 2014, pp. 189–211.'
mla: 'Harteis, Christian. “Auswirkungen Des Bologna-Prozesses: Eine Expertise Der
Hochschuldidaktik.” Herausforderung Kompetenzorientierte Hochschule, edited
by Rolf Arnold and K Wolf, Schneider, 2014, pp. 189–211.'
short: 'C. Harteis, in: R. Arnold, K. Wolf (Eds.), Herausforderung Kompetenzorientierte
Hochschule, Schneider, Hohengeheren, 2014, pp. 189–211.'
date_created: 2018-07-26T10:26:26Z
date_updated: 2022-01-06T06:59:31Z
department:
- _id: '452'
editor:
- first_name: Rolf
full_name: Arnold, Rolf
last_name: Arnold
- first_name: K
full_name: Wolf, K
last_name: Wolf
page: 189-211
place: Hohengeheren
publication: Herausforderung kompetenzorientierte Hochschule
publisher: Schneider
status: public
title: 'Auswirkungen des Bologna-Prozesses: Eine Expertise der Hochschuldidaktik'
type: book_chapter
user_id: '27503'
year: '2014'
...
---
_id: '3719'
author:
- first_name: Christian
full_name: Harteis, Christian
id: '27503'
last_name: Harteis
orcid: https://orcid.org/0000-0002-3570-7626
citation:
ama: 'Harteis C. Investigating intuition under the perpective of expertise: Experiences
from two experimental studies. In: Sinclair M, ed. Handbook of Intuition Research
Methodology. Cheltenham: Edward Elgar; 2014:116-129.'
apa: 'Harteis, C. (2014). Investigating intuition under the perpective of expertise:
Experiences from two experimental studies. In M. Sinclair (Ed.), Handbook of
intuition research methodology (pp. 116–129). Cheltenham: Edward Elgar.'
bibtex: '@inbook{Harteis_2014, place={Cheltenham}, title={Investigating intuition
under the perpective of expertise: Experiences from two experimental studies},
booktitle={Handbook of intuition research methodology}, publisher={Edward Elgar},
author={Harteis, Christian}, editor={Sinclair, MarthaEditor}, year={2014}, pages={116–129}
}'
chicago: 'Harteis, Christian. “Investigating Intuition under the Perpective of Expertise:
Experiences from Two Experimental Studies.” In Handbook of Intuition Research
Methodology, edited by Martha Sinclair, 116–29. Cheltenham: Edward Elgar,
2014.'
ieee: 'C. Harteis, “Investigating intuition under the perpective of expertise: Experiences
from two experimental studies,” in Handbook of intuition research methodology,
M. Sinclair, Ed. Cheltenham: Edward Elgar, 2014, pp. 116–129.'
mla: 'Harteis, Christian. “Investigating Intuition under the Perpective of Expertise:
Experiences from Two Experimental Studies.” Handbook of Intuition Research
Methodology, edited by Martha Sinclair, Edward Elgar, 2014, pp. 116–29.'
short: 'C. Harteis, in: M. Sinclair (Ed.), Handbook of Intuition Research Methodology,
Edward Elgar, Cheltenham, 2014, pp. 116–129.'
date_created: 2018-07-26T10:28:02Z
date_updated: 2022-01-06T06:59:31Z
department:
- _id: '452'
editor:
- first_name: Martha
full_name: Sinclair, Martha
last_name: Sinclair
page: 116-129
place: Cheltenham
publication: Handbook of intuition research methodology
publisher: Edward Elgar
status: public
title: 'Investigating intuition under the perpective of expertise: Experiences from
two experimental studies'
type: book_chapter
user_id: '27503'
year: '2014'
...
---
_id: '372'
abstract:
- lang: eng
text: 'In the near future many more compute resources will be available at different
geographical locations. To minimize the response time of requests, application
servers closer to the user can hence be used to shorten network round trip times.
However, this advantage is neutralized if the used data centre is highly loaded
as the processing time of re- quests is important as well. We model the request
response time as the network round trip time plus the processing time at a data
centre.We present a capacitated facility location problem formal- ization where
the processing time is modelled as the sojourn time of a queueing model. We discuss
the Pareto trade-off between the number of used data centres and the resulting
response time. For example, using fewer data centres could cut expenses but results
in high utilization, high response time, and smaller revenues.Previous work presented
a non-linear cost function. We prove its convexity and exploit this property in
two ways: First, we transform the convex model into a linear model while controlling
the maximum approximation error. Sec- ond, we used a convex solver instead of
a slower non-linear solver. Numerical results on network topologies exemplify
our work.'
author:
- first_name: Matthias
full_name: Keller, Matthias
last_name: Keller
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: 'Keller M, Karl H. Response Time-Optimized Distributed Cloud Resource Allocation.
In: Proceedings of the SIGCOMM Workshop on Distributed Cloud Computing.
; 2014:47--52. doi:10.1145/2627566.2627570'
apa: Keller, M., & Karl, H. (2014). Response Time-Optimized Distributed Cloud
Resource Allocation. In Proceedings of the SIGCOMM workshop on Distributed
cloud computing (pp. 47--52). https://doi.org/10.1145/2627566.2627570
bibtex: '@inproceedings{Keller_Karl_2014, title={Response Time-Optimized Distributed
Cloud Resource Allocation}, DOI={10.1145/2627566.2627570},
booktitle={Proceedings of the SIGCOMM workshop on Distributed cloud computing},
author={Keller, Matthias and Karl, Holger}, year={2014}, pages={47--52} }'
chicago: Keller, Matthias, and Holger Karl. “Response Time-Optimized Distributed
Cloud Resource Allocation.” In Proceedings of the SIGCOMM Workshop on Distributed
Cloud Computing, 47--52, 2014. https://doi.org/10.1145/2627566.2627570.
ieee: M. Keller and H. Karl, “Response Time-Optimized Distributed Cloud Resource
Allocation,” in Proceedings of the SIGCOMM workshop on Distributed cloud computing,
2014, pp. 47--52.
mla: Keller, Matthias, and Holger Karl. “Response Time-Optimized Distributed Cloud
Resource Allocation.” Proceedings of the SIGCOMM Workshop on Distributed Cloud
Computing, 2014, pp. 47--52, doi:10.1145/2627566.2627570.
short: 'M. Keller, H. Karl, in: Proceedings of the SIGCOMM Workshop on Distributed
Cloud Computing, 2014, pp. 47--52.'
date_created: 2017-10-17T12:42:04Z
date_updated: 2022-01-06T06:59:31Z
ddc:
- '000'
department:
- _id: '75'
doi: 10.1145/2627566.2627570
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T14:00:54Z
date_updated: 2018-11-02T14:00:54Z
file_id: '5259'
file_name: p47-keller.pdf
file_size: 804240
relation: main_file
success: 1
file_date_updated: 2018-11-02T14:00:54Z
has_accepted_license: '1'
language:
- iso: eng
page: 47--52
project:
- _id: '1'
name: SFB 901
- _id: '6'
name: SFB 901 - Subprojekt A2
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the SIGCOMM workshop on Distributed cloud computing
status: public
title: Response Time-Optimized Distributed Cloud Resource Allocation
type: conference
user_id: '477'
year: '2014'
...
---
_id: '373'
author:
- first_name: David
full_name: Pahl, David
last_name: Pahl
citation:
ama: Pahl D. Reputationssysteme für zusammengesetzte Dienstleistungen. Universität
Paderborn; 2014.
apa: Pahl, D. (2014). Reputationssysteme für zusammengesetzte Dienstleistungen.
Universität Paderborn.
bibtex: '@book{Pahl_2014, title={Reputationssysteme für zusammengesetzte Dienstleistungen},
publisher={Universität Paderborn}, author={Pahl, David}, year={2014} }'
chicago: Pahl, David. Reputationssysteme für zusammengesetzte Dienstleistungen.
Universität Paderborn, 2014.
ieee: D. Pahl, Reputationssysteme für zusammengesetzte Dienstleistungen.
Universität Paderborn, 2014.
mla: Pahl, David. Reputationssysteme für zusammengesetzte Dienstleistungen.
Universität Paderborn, 2014.
short: D. Pahl, Reputationssysteme für zusammengesetzte Dienstleistungen, Universität
Paderborn, 2014.
date_created: 2017-10-17T12:42:04Z
date_updated: 2022-01-06T06:59:31Z
department:
- _id: '63'
- _id: '541'
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: Alexander
full_name: Skopalik, Alexander
id: '40384'
last_name: Skopalik
title: Reputationssysteme für zusammengesetzte Dienstleistungen
type: bachelorsthesis
user_id: '14052'
year: '2014'
...
---
_id: '374'
abstract:
- lang: eng
text: Run-time reconfiguration provides an opportunity to increase performance,
reduce cost and improve energy efficiency in FPGA-based systems. However, run-time
reconfigurable systems are more complex to implement than static only systems.
This increases time to market, and introduces run-time overhead into the system.
Our research aims to raise the abstraction level to develop run-time reconfigurable
systems. We present operating system extensions which enable seamless integration
of run-time reconfigurable hardware threads into applications. To improve resource
utilization, the hardware threads are placed on a fine granularity tile grid.
We take advantage of a relocatable module placer targeting modern FPGA to manage
the reconfigurable area. The module placer accurately models the FPGA resources
to compute feasible placement locations for the hardware threads at run-time.
Finally, we evaluate our work by means of a case study that consists of a synthetic
application to validate the functionality and performance of the implementation.
The results show a reduction in reconfiguration time of up to 42% and more than
double resource utilization.
author:
- first_name: Alexander
full_name: Wold, Alexander
last_name: Wold
- first_name: Andreas
full_name: Agne, Andreas
last_name: Agne
- first_name: Jim
full_name: Torresen, Jim
last_name: Torresen
citation:
ama: 'Wold A, Agne A, Torresen J. Relocatable Hardware Threads in Run-Time Reconfigurable
Systems. In: Goehringer D, Santambrogio M, Cardoso JP, Bertels K, eds. Proceedings
of the 10th International Symposium on Reconfigurable Computing: Architectures,
Tools, and Applications. LNCS. ; 2014:61-72. doi:10.1007/978-3-319-05960-0_6'
apa: 'Wold, A., Agne, A., & Torresen, J. (2014). Relocatable Hardware Threads
in Run-Time Reconfigurable Systems. In D. Goehringer, M. Santambrogio, J. P. Cardoso,
& K. Bertels (Eds.), Proceedings of the 10th International Symposium on
Reconfigurable Computing: Architectures, Tools, and Applications (pp. 61–72).
https://doi.org/10.1007/978-3-319-05960-0_6'
bibtex: '@inproceedings{Wold_Agne_Torresen_2014, series={LNCS}, title={Relocatable
Hardware Threads in Run-Time Reconfigurable Systems}, DOI={10.1007/978-3-319-05960-0_6},
booktitle={Proceedings of the 10th International Symposium on Reconfigurable Computing:
Architectures, Tools, and Applications}, author={Wold, Alexander and Agne, Andreas
and Torresen, Jim}, editor={Goehringer, Diana and Santambrogio, MarcoDomenico
and Cardoso, JoãoM.P. and Bertels, KoenEditors}, year={2014}, pages={61–72}, collection={LNCS}
}'
chicago: 'Wold, Alexander, Andreas Agne, and Jim Torresen. “Relocatable Hardware
Threads in Run-Time Reconfigurable Systems.” In Proceedings of the 10th International
Symposium on Reconfigurable Computing: Architectures, Tools, and Applications,
edited by Diana Goehringer, MarcoDomenico Santambrogio, JoãoM.P. Cardoso, and
Koen Bertels, 61–72. LNCS, 2014. https://doi.org/10.1007/978-3-319-05960-0_6.'
ieee: 'A. Wold, A. Agne, and J. Torresen, “Relocatable Hardware Threads in Run-Time
Reconfigurable Systems,” in Proceedings of the 10th International Symposium
on Reconfigurable Computing: Architectures, Tools, and Applications, 2014,
pp. 61–72.'
mla: 'Wold, Alexander, et al. “Relocatable Hardware Threads in Run-Time Reconfigurable
Systems.” Proceedings of the 10th International Symposium on Reconfigurable
Computing: Architectures, Tools, and Applications, edited by Diana Goehringer
et al., 2014, pp. 61–72, doi:10.1007/978-3-319-05960-0_6.'
short: 'A. Wold, A. Agne, J. Torresen, in: D. Goehringer, M. Santambrogio, J.P.
Cardoso, K. Bertels (Eds.), Proceedings of the 10th International Symposium on
Reconfigurable Computing: Architectures, Tools, and Applications, 2014, pp. 61–72.'
date_created: 2017-10-17T12:42:05Z
date_updated: 2022-01-06T06:59:32Z
ddc:
- '040'
doi: 10.1007/978-3-319-05960-0_6
editor:
- first_name: Diana
full_name: Goehringer, Diana
last_name: Goehringer
- first_name: MarcoDomenico
full_name: Santambrogio, MarcoDomenico
last_name: Santambrogio
- first_name: JoãoM.P.
full_name: Cardoso, JoãoM.P.
last_name: Cardoso
- first_name: Koen
full_name: Bertels, Koen
last_name: Bertels
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:15:59Z
date_updated: 2018-03-20T07:15:59Z
file_id: '1400'
file_name: 374-2014_wold_arc.pdf
file_size: 818625
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:15:59Z
has_accepted_license: '1'
page: 61-72
project:
- _id: '1'
name: SFB 901
- _id: '14'
name: SFB 901 - Subprojekt C2
- _id: '4'
name: SFB 901 - Project Area C
publication: 'Proceedings of the 10th International Symposium on Reconfigurable Computing:
Architectures, Tools, and Applications'
series_title: LNCS
status: public
title: Relocatable Hardware Threads in Run-Time Reconfigurable Systems
type: conference
user_id: '15504'
year: '2014'
...
---
_id: '375'
abstract:
- lang: eng
text: Many software development, planning, or analysis tasks require an up-to-date
software architecture documentation. However, this documentation is often outdated,
unavailable, or at least not available as a formal model which analysis tools
could use. Reverse engineering methods try to fill this gap. However, as they
process the system’s source code, they are easily misled by design deficiencies
(e.g., violations of component encapsulation) which leaked into the code during
the system’s evolution. Despite the high impact of design deficiencies on the
quality of the resulting software architecture models, none of the surveyed related
works is able to cope with them during the reverse engineering process. Therefore,
we have developed the Archimetrix approach which semi-automatically recovers the
system’s concrete architecture in a formal model while simultaneously detecting
and removing design deficiencies. We have validated Archi metrix on a case-study
system and two implementation variants of the CoCoME benchmark system. Results
show that the removal of relevant design deficiencies leads to an architecture
model which more closely matches the system’s conceptual architecture.
author:
- first_name: Markus
full_name: von Detten, Markus
last_name: von Detten
- first_name: Marie Christin
full_name: Platenius, Marie Christin
last_name: Platenius
- first_name: Steffen
full_name: Becker, Steffen
last_name: Becker
citation:
ama: von Detten M, Platenius MC, Becker S. Reengineering Component-Based Software
Systems with Archimetrix. Journal of Software and Systems Modeling. 2014;(4):1239--1268.
doi:10.1007/s10270-013-0341-9
apa: von Detten, M., Platenius, M. C., & Becker, S. (2014). Reengineering Component-Based
Software Systems with Archimetrix. Journal of Software and Systems Modeling,
(4), 1239--1268. https://doi.org/10.1007/s10270-013-0341-9
bibtex: '@article{von Detten_Platenius_Becker_2014, title={Reengineering Component-Based
Software Systems with Archimetrix}, DOI={10.1007/s10270-013-0341-9},
number={4}, journal={Journal of Software and Systems Modeling}, publisher={Springer},
author={von Detten, Markus and Platenius, Marie Christin and Becker, Steffen},
year={2014}, pages={1239--1268} }'
chicago: 'Detten, Markus von, Marie Christin Platenius, and Steffen Becker. “Reengineering
Component-Based Software Systems with Archimetrix.” Journal of Software and
Systems Modeling, no. 4 (2014): 1239--1268. https://doi.org/10.1007/s10270-013-0341-9.'
ieee: M. von Detten, M. C. Platenius, and S. Becker, “Reengineering Component-Based
Software Systems with Archimetrix,” Journal of Software and Systems Modeling,
no. 4, pp. 1239--1268, 2014.
mla: von Detten, Markus, et al. “Reengineering Component-Based Software Systems
with Archimetrix.” Journal of Software and Systems Modeling, no. 4, Springer,
2014, pp. 1239--1268, doi:10.1007/s10270-013-0341-9.
short: M. von Detten, M.C. Platenius, S. Becker, Journal of Software and Systems
Modeling (2014) 1239--1268.
date_created: 2017-10-17T12:42:05Z
date_updated: 2022-01-06T06:59:34Z
ddc:
- '040'
doi: 10.1007/s10270-013-0341-9
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:15:26Z
date_updated: 2018-03-20T07:15:26Z
file_id: '1399'
file_name: 375-sosym.pdf
file_size: 3356333
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:15:26Z
has_accepted_license: '1'
issue: '4'
page: 1239--1268
project:
- _id: '1'
name: SFB 901
- _id: '9'
name: SFB 901 - Subprojekt B1
- _id: '3'
name: SFB 901 - Project Area B
publication: Journal of Software and Systems Modeling
publisher: Springer
status: public
title: Reengineering Component-Based Software Systems with Archimetrix
type: journal_article
user_id: '477'
year: '2014'
...
---
_id: '376'
abstract:
- lang: eng
text: Radio access networks (RANs) have become one of the largest energy consumers
of communication technology [LLH+13] and their energy consumption is predicted
to increase [FFMB11]. To reduce the energy consumption of RANs different techniques
have been proposed. One of the most promising techniques is the use of a low-power
sleep mode. However, a sleep mode can also reduce the performance. In this dissertation,
I quantify how much energy can be conserved with a sleep mode and which negative
effects it has on the performance of RANs. Additionally, I analyze how a sleep
mode can be enabled more often and how the performance can be kept high. First,
I quantify the effect of power-cycle durations on energy consumption and latency
in an abstract queuing system. This results in a trade-off between energy consumption
and latency for a single base station (BS). Second, I show that considering a
network as a whole (instead of each BS individually) allows the energy consumption
to be reduced even further. After these analyses, which are not specific for RANs,
I study RANs for the rest of the dissertation. RANs need to both detect and execute
the requests of users. Because detection and execution of requests have different
requirements, I analyze them independently. I quantify how the number of active
BSs can be reduced if the detection ranges of BSs are increased by cooperative
transmissions. Next, I analyze how more BSs can be deactivated if the remaining
active BSs cooperate to transmit data to the users. However, in addition to increasing
the range, cooperative transmissions also radiate more power. This results in
higher interference for other users which slows their transmissions down and,
thus, increases energy consumption. Therefore, I describe how the radiated power
of cooperative transmissions can be reduced if instantaneous channel knowledge
is available. Because the implementation in real hardware is impractical for demonstration
purposes, I show the results of a simulation that incorporates all effects I studied
analytically earlier. In conclusion, I show that a sleep mode can reduce the energy
consumption of RANs if applied correctly. To apply a sleep mode correctly, it
is necessary to consider power-cycle durations, power profiles, and the interaction
of BSs. When this knowledge is combined the energy consumption of RANs can be
reduced with only a slight loss of performance. Because this results in a trade-off
between energy consumption and performance, each RAN operator has to decide which
trade-off is preferred.
author:
- first_name: Matthias
full_name: Herlich, Matthias
last_name: Herlich
citation:
ama: Herlich M. Reducing Energy Consumption of Radio Access Networks. Universität
Paderborn; 2014.
apa: Herlich, M. (2014). Reducing Energy Consumption of Radio Access Networks.
Universität Paderborn.
bibtex: '@book{Herlich_2014, title={Reducing Energy Consumption of Radio Access
Networks}, publisher={Universität Paderborn}, author={Herlich, Matthias}, year={2014}
}'
chicago: Herlich, Matthias. Reducing Energy Consumption of Radio Access Networks.
Universität Paderborn, 2014.
ieee: M. Herlich, Reducing Energy Consumption of Radio Access Networks. Universität
Paderborn, 2014.
mla: Herlich, Matthias. Reducing Energy Consumption of Radio Access Networks.
Universität Paderborn, 2014.
short: M. Herlich, Reducing Energy Consumption of Radio Access Networks, Universität
Paderborn, 2014.
date_created: 2017-10-17T12:42:05Z
date_updated: 2022-01-06T06:59:35Z
ddc:
- '040'
department:
- _id: '75'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:14:52Z
date_updated: 2018-03-20T07:14:52Z
file_id: '1398'
file_name: 376-Herlich-Dissertation.pdf
file_size: 1476366
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:14:52Z
has_accepted_license: '1'
project:
- _id: '1'
name: SFB 901
- _id: '6'
name: SFB 901 - Subprojekt A2
- _id: '2'
name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
title: Reducing Energy Consumption of Radio Access Networks
type: dissertation
user_id: '477'
year: '2014'
...
---
_id: '378'
abstract:
- lang: eng
text: The Chord peer-to-peer system is considered, together with CAN, Tapestry and
Pastry, as one of the pioneering works on peer-to-peer distributed hash tables
(DHT) that inspired a large volume of papers and projects on DHTs as well as peer-to-peer
systems in general. Chord, in particular, has been studied thoroughly, and many
variants of Chord have been presented that optimize various criteria. Also, several
implementations of Chord are available on various platforms. Though Chord is known
to be very efficient and scalable and it can handle churn quite well, no protocol
is known yet that guarantees that Chord is self-stabilizing, i.e., the Chord network
can be recovered from any initial state in which the network is still weakly connected.
This is not too surprising since it is known that the Chord network is not locally
checkable for its current topology. We present a slight extension of the Chord
network, called Re-Chord (reactive Chord), that turns out to be locally checkable,
and we present a self-stabilizing distributed protocol for it that can recover
the Re-Chord network from any initial state, in which the n peers are weakly connected,
in O(nlogn) communication rounds. We also show that our protocol allows a new
peer to join or an old peer to leave an already stable Re-Chord network so that
within O(logn)^2) communication rounds the Re-Chord network is stable again.
author:
- first_name: Sebastian
full_name: Kniesburges, Sebastian
last_name: Kniesburges
- first_name: Andreas
full_name: Koutsopoulos, Andreas
last_name: Koutsopoulos
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Kniesburges S, Koutsopoulos A, Scheideler C. Re-Chord: A Self-stabilizing
Chord Overlay Network. Theory of Computing Systems. 2014;(3):591-612. doi:10.1007/s00224-012-9431-2'
apa: 'Kniesburges, S., Koutsopoulos, A., & Scheideler, C. (2014). Re-Chord:
A Self-stabilizing Chord Overlay Network. Theory of Computing Systems,
(3), 591–612. https://doi.org/10.1007/s00224-012-9431-2'
bibtex: '@article{Kniesburges_Koutsopoulos_Scheideler_2014, title={Re-Chord: A Self-stabilizing
Chord Overlay Network}, DOI={10.1007/s00224-012-9431-2},
number={3}, journal={Theory of Computing Systems}, publisher={Springer}, author={Kniesburges,
Sebastian and Koutsopoulos, Andreas and Scheideler, Christian}, year={2014}, pages={591–612}
}'
chicago: 'Kniesburges, Sebastian, Andreas Koutsopoulos, and Christian Scheideler.
“Re-Chord: A Self-Stabilizing Chord Overlay Network.” Theory of Computing Systems,
no. 3 (2014): 591–612. https://doi.org/10.1007/s00224-012-9431-2.'
ieee: 'S. Kniesburges, A. Koutsopoulos, and C. Scheideler, “Re-Chord: A Self-stabilizing
Chord Overlay Network,” Theory of Computing Systems, no. 3, pp. 591–612,
2014.'
mla: 'Kniesburges, Sebastian, et al. “Re-Chord: A Self-Stabilizing Chord Overlay
Network.” Theory of Computing Systems, no. 3, Springer, 2014, pp. 591–612,
doi:10.1007/s00224-012-9431-2.'
short: S. Kniesburges, A. Koutsopoulos, C. Scheideler, Theory of Computing Systems
(2014) 591–612.
date_created: 2017-10-17T12:42:05Z
date_updated: 2022-01-06T06:59:35Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1007/s00224-012-9431-2
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:13:36Z
date_updated: 2018-03-20T07:13:36Z
file_id: '1396'
file_name: 378-re-chord_journal.pdf
file_size: 310961
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:13:36Z
has_accepted_license: '1'
issue: '3'
page: 591-612
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '4'
name: SFB 901 - Project Area C
- _id: '13'
name: SFB 901 - Subproject C1
- _id: '2'
name: SFB 901 - Project Area A
publication: Theory of Computing Systems
publisher: Springer
status: public
title: 'Re-Chord: A Self-stabilizing Chord Overlay Network'
type: journal_article
user_id: '477'
year: '2014'
...
---
_id: '379'
abstract:
- lang: eng
text: In the leasing variant of Set Cover presented by Anthony et al.[1], elements
U arrive over time and must be covered by sets from a familyF of subsets of U.
Each set can be leased for K different periods of time.Let |U| = n and |F| = m.
Leasing a set S for a period k incurs a cost ckS and allows S to cover its elements
for the next lk time steps. The objectiveis to minimize the total cost of the
sets leased, such that elements arrivingat any time t are covered by sets which
contain them and are leased duringtime t. Anthony et al. [1] gave an optimal O(log
n)-approximation forthe problem in the offline setting, unless P = NP [22]. In
this paper, wegive randomized algorithms for variants of Set Cover Leasing in
the onlinesetting, including a generalization of Online Set Cover with Repetitionspresented
by Alon et al. [2], where elements appear multiple times andmust be covered by
a different set at each arrival. Our results improve theO(log2(mn)) competitive
factor of Online Set Cover with Repetitions [2]to O(log d log(dn)) = O(logmlog(mn)),
where d is the maximum numberof sets an element belongs to.
author:
- first_name: Sebastian
full_name: Abshoff, Sebastian
last_name: Abshoff
- first_name: Christine
full_name: Markarian, Christine
id: '37612'
last_name: Markarian
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Abshoff S, Markarian C, Meyer auf der Heide F. Randomized Online Algorithms
for Set Cover Leasing Problems. In: Proceedings of the 8th Annual International
Conference on Combinatorial Optimization and Applications (COCOA). LNCS. ;
2014:25-34. doi:10.1007/978-3-319-12691-3_3'
apa: Abshoff, S., Markarian, C., & Meyer auf der Heide, F. (2014). Randomized
Online Algorithms for Set Cover Leasing Problems. In Proceedings of the 8th
Annual International Conference on Combinatorial Optimization and Applications
(COCOA) (pp. 25–34). https://doi.org/10.1007/978-3-319-12691-3_3
bibtex: '@inproceedings{Abshoff_Markarian_Meyer auf der Heide_2014, series={LNCS},
title={Randomized Online Algorithms for Set Cover Leasing Problems}, DOI={10.1007/978-3-319-12691-3_3},
booktitle={Proceedings of the 8th Annual International Conference on Combinatorial
Optimization and Applications (COCOA)}, author={Abshoff, Sebastian and Markarian,
Christine and Meyer auf der Heide, Friedhelm}, year={2014}, pages={25–34}, collection={LNCS}
}'
chicago: Abshoff, Sebastian, Christine Markarian, and Friedhelm Meyer auf der Heide.
“Randomized Online Algorithms for Set Cover Leasing Problems.” In Proceedings
of the 8th Annual International Conference on Combinatorial Optimization and Applications
(COCOA), 25–34. LNCS, 2014. https://doi.org/10.1007/978-3-319-12691-3_3.
ieee: S. Abshoff, C. Markarian, and F. Meyer auf der Heide, “Randomized Online Algorithms
for Set Cover Leasing Problems,” in Proceedings of the 8th Annual International
Conference on Combinatorial Optimization and Applications (COCOA), 2014, pp.
25–34.
mla: Abshoff, Sebastian, et al. “Randomized Online Algorithms for Set Cover Leasing
Problems.” Proceedings of the 8th Annual International Conference on Combinatorial
Optimization and Applications (COCOA), 2014, pp. 25–34, doi:10.1007/978-3-319-12691-3_3.
short: 'S. Abshoff, C. Markarian, F. Meyer auf der Heide, in: Proceedings of the
8th Annual International Conference on Combinatorial Optimization and Applications
(COCOA), 2014, pp. 25–34.'
date_created: 2017-10-17T12:42:06Z
date_updated: 2022-01-06T06:59:36Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1007/978-3-319-12691-3_3
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:12:57Z
date_updated: 2018-03-20T07:12:57Z
file_id: '1395'
file_name: 379-COCOA14.pdf
file_size: 214299
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:12:57Z
has_accepted_license: '1'
page: 25-34
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 8th Annual International Conference on Combinatorial
Optimization and Applications (COCOA)
series_title: LNCS
status: public
title: Randomized Online Algorithms for Set Cover Leasing Problems
type: conference
user_id: '15504'
year: '2014'
...
---
_id: '380'
abstract:
- lang: eng
text: 'Network creation games model the creation and usage costs of networks formed
by n selfish nodes. Each node v can buy a set of edges, each for a fixed price
α > 0. Its goal is to minimize its private costs, i.e., the sum (SUM-game, Fabrikant
et al., PODC 2003) or maximum (MAX-game, Demaine et al., PODC 2007) of distances
from v to all other nodes plus the prices of the bought edges. The above papers
show the existence of Nash equilibria as well as upper and lower bounds for the
prices of anarchy and stability. In several subsequent papers, these bounds were
improved for a wide range of prices α. In this paper, we extend these models by
incorporating quality-of-service aspects: Each edge cannot only be bought at a
fixed quality (edge length one) for a fixed price α. Instead, we assume that quality
levels (i.e., edge lengths) are varying in a fixed interval [βˇ,β^] , 0 series
= {LNCS}'
author:
- first_name: Andreas
full_name: Cord-Landwehr, Andreas
last_name: Cord-Landwehr
- first_name: Alexander
full_name: Mäcker, Alexander
id: '13536'
last_name: Mäcker
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Cord-Landwehr A, Mäcker A, Meyer auf der Heide F. Quality of Service in Network
Creation Games. In: Proceedings of the 10th International Conference on Web
and Internet Economics (WINE). ; 2014:423-428. doi:10.1007/978-3-319-13129-0_34'
apa: Cord-Landwehr, A., Mäcker, A., & Meyer auf der Heide, F. (2014). Quality
of Service in Network Creation Games. In Proceedings of the 10th International
Conference on Web and Internet Economics (WINE) (pp. 423–428). https://doi.org/10.1007/978-3-319-13129-0_34
bibtex: '@inproceedings{Cord-Landwehr_Mäcker_Meyer auf der Heide_2014, title={Quality
of Service in Network Creation Games}, DOI={10.1007/978-3-319-13129-0_34},
booktitle={Proceedings of the 10th International Conference on Web and Internet
Economics (WINE)}, author={Cord-Landwehr, Andreas and Mäcker, Alexander and Meyer
auf der Heide, Friedhelm}, year={2014}, pages={423–428} }'
chicago: Cord-Landwehr, Andreas, Alexander Mäcker, and Friedhelm Meyer auf der Heide.
“Quality of Service in Network Creation Games.” In Proceedings of the 10th
International Conference on Web and Internet Economics (WINE), 423–28, 2014.
https://doi.org/10.1007/978-3-319-13129-0_34.
ieee: A. Cord-Landwehr, A. Mäcker, and F. Meyer auf der Heide, “Quality of Service
in Network Creation Games,” in Proceedings of the 10th International Conference
on Web and Internet Economics (WINE), 2014, pp. 423–428.
mla: Cord-Landwehr, Andreas, et al. “Quality of Service in Network Creation Games.”
Proceedings of the 10th International Conference on Web and Internet Economics
(WINE), 2014, pp. 423–28, doi:10.1007/978-3-319-13129-0_34.
short: 'A. Cord-Landwehr, A. Mäcker, F. Meyer auf der Heide, in: Proceedings of
the 10th International Conference on Web and Internet Economics (WINE), 2014,
pp. 423–428.'
date_created: 2017-10-17T12:42:06Z
date_updated: 2022-01-06T06:59:36Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1007/978-3-319-13129-0_34
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:05:59Z
date_updated: 2018-03-20T07:05:59Z
file_id: '1394'
file_name: 380-WINE2014.pdf
file_size: 166640
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:05:59Z
has_accepted_license: '1'
page: 423-428
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
publication: Proceedings of the 10th International Conference on Web and Internet
Economics (WINE)
status: public
title: Quality of Service in Network Creation Games
type: conference
user_id: '15504'
year: '2014'
...
---
_id: '3805'
author:
- first_name: Frank
full_name: Brüseke, Frank
last_name: Brüseke
- first_name: Henning
full_name: Wachsmuth, Henning
id: '3900'
last_name: Wachsmuth
- first_name: Gregor
full_name: Engels, Gregor
last_name: Engels
- first_name: Steffen
full_name: Becker, Steffen
last_name: Becker
citation:
ama: 'Brüseke F, Wachsmuth H, Engels G, Becker S. PBlaman: performance blame analysis
based on Palladio contracts. In: Proceedings of the 4th International Symposium
on Autonomous Minirobots for Research and Edutainment. ; 2014:1975-2004.'
apa: 'Brüseke, F., Wachsmuth, H., Engels, G., & Becker, S. (2014). PBlaman:
performance blame analysis based on Palladio contracts. In Proceedings of the
4th International Symposium on Autonomous Minirobots for Research and Edutainment
(pp. 1975–2004).'
bibtex: '@inproceedings{Brüseke_Wachsmuth_Engels_Becker_2014, title={PBlaman: performance
blame analysis based on Palladio contracts}, number={12}, booktitle={Proceedings
of the 4th International Symposium on Autonomous Minirobots for Research and Edutainment},
author={Brüseke, Frank and Wachsmuth, Henning and Engels, Gregor and Becker, Steffen},
year={2014}, pages={1975–2004} }'
chicago: 'Brüseke, Frank, Henning Wachsmuth, Gregor Engels, and Steffen Becker.
“PBlaman: Performance Blame Analysis Based on Palladio Contracts.” In Proceedings
of the 4th International Symposium on Autonomous Minirobots for Research and Edutainment,
1975–2004, 2014.'
ieee: 'F. Brüseke, H. Wachsmuth, G. Engels, and S. Becker, “PBlaman: performance
blame analysis based on Palladio contracts,” in Proceedings of the 4th International
Symposium on Autonomous Minirobots for Research and Edutainment, 2014, no.
12, pp. 1975–2004.'
mla: 'Brüseke, Frank, et al. “PBlaman: Performance Blame Analysis Based on Palladio
Contracts.” Proceedings of the 4th International Symposium on Autonomous Minirobots
for Research and Edutainment, no. 12, 2014, pp. 1975–2004.'
short: 'F. Brüseke, H. Wachsmuth, G. Engels, S. Becker, in: Proceedings of the 4th
International Symposium on Autonomous Minirobots for Research and Edutainment,
2014, pp. 1975–2004.'
date_created: 2018-08-02T13:38:28Z
date_updated: 2022-01-06T06:59:36Z
department:
- _id: '600'
issue: '12'
language:
- iso: eng
page: 1975-2004
publication: Proceedings of the 4th International Symposium on Autonomous Minirobots
for Research and Edutainment
status: public
title: 'PBlaman: performance blame analysis based on Palladio contracts'
type: conference
user_id: '82920'
year: '2014'
...
---
_id: '382'
abstract:
- lang: eng
text: This paper explores how cloud provider competition influences instance pricing
in an IaaS (Infrastructure-as-a-Service) market. When reserved instance pricing
includes an on-demand price component in addition to a reservation fee (two-part
tariffs), different providers might offer different price combinations, where
the client’s choice depends on its load profile. We investigate a duopoly of providers
and analyze stable market prices in two-part tariffs. Further, we study offers
that allow a specified amount of included usage (three-part tariffs). Neither two-part
nor three-part tariffs produce an equilibrium market outcome other than a service
pricing that equals production cost, i.e., complex price structures do not significantly
affect the results from ordinary Bertrand competition.
author:
- first_name: Jörn
full_name: Künsemöller, Jörn
last_name: Künsemöller
- first_name: Sonja
full_name: Brangewitz, Sonja
last_name: Brangewitz
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
- first_name: Claus-Jochen
full_name: Haake, Claus-Jochen
id: '20801'
last_name: Haake
citation:
ama: 'Künsemöller J, Brangewitz S, Karl H, Haake C-J. Provider Competition in Infrastructure-as-a-Service.
In: Proceedings of the 2014 IEEE International Conference on Services Computing
(SCC). ; 2014:203-210. doi:10.1109/SCC.2014.35'
apa: Künsemöller, J., Brangewitz, S., Karl, H., & Haake, C.-J. (2014). Provider
Competition in Infrastructure-as-a-Service. In Proceedings of the 2014 IEEE
International Conference on Services Computing (SCC) (pp. 203–210). https://doi.org/10.1109/SCC.2014.35
bibtex: '@inproceedings{Künsemöller_Brangewitz_Karl_Haake_2014, title={Provider
Competition in Infrastructure-as-a-Service}, DOI={10.1109/SCC.2014.35},
booktitle={Proceedings of the 2014 IEEE International Conference on Services Computing
(SCC)}, author={Künsemöller, Jörn and Brangewitz, Sonja and Karl, Holger and Haake,
Claus-Jochen}, year={2014}, pages={203–210} }'
chicago: Künsemöller, Jörn, Sonja Brangewitz, Holger Karl, and Claus-Jochen Haake.
“Provider Competition in Infrastructure-as-a-Service.” In Proceedings of the
2014 IEEE International Conference on Services Computing (SCC), 203–10, 2014.
https://doi.org/10.1109/SCC.2014.35.
ieee: J. Künsemöller, S. Brangewitz, H. Karl, and C.-J. Haake, “Provider Competition
in Infrastructure-as-a-Service,” in Proceedings of the 2014 IEEE International
Conference on Services Computing (SCC), 2014, pp. 203–210.
mla: Künsemöller, Jörn, et al. “Provider Competition in Infrastructure-as-a-Service.”
Proceedings of the 2014 IEEE International Conference on Services Computing
(SCC), 2014, pp. 203–10, doi:10.1109/SCC.2014.35.
short: 'J. Künsemöller, S. Brangewitz, H. Karl, C.-J. Haake, in: Proceedings of
the 2014 IEEE International Conference on Services Computing (SCC), 2014, pp.
203–210.'
date_created: 2017-10-17T12:42:06Z
date_updated: 2022-01-06T06:59:37Z
ddc:
- '004'
department:
- _id: '75'
- _id: '205'
doi: 10.1109/SCC.2014.35
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T13:34:46Z
date_updated: 2018-11-02T13:34:46Z
file_id: '5250'
file_name: 06930535.pdf
file_size: 228172
relation: main_file
success: 1
file_date_updated: 2018-11-02T13:34:46Z
has_accepted_license: '1'
language:
- iso: eng
page: 203-210
project:
- _id: '1'
name: SFB 901
- _id: '6'
name: SFB 901 - Subprojekt A2
- _id: '7'
name: SFB 901 - Subproject A3
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 2014 IEEE International Conference on Services Computing
(SCC)
status: public
title: Provider Competition in Infrastructure-as-a-Service
type: conference
user_id: '477'
year: '2014'
...
---
_id: '383'
abstract:
- lang: eng
text: Proof-carrying code approaches aim at safe execution of untrusted code by
having the code producer attach a safety proof to the code which the code consumer
only has to validate. Depending on the type of safety property, proofs can however
become quite large and their validation - though faster than their construction
- still time consuming. In this paper we introduce a new concept for safe execution
of untrusted code. It keeps the idea of putting the time consuming part of proving
on the side of the code producer, however, attaches no proofs to code anymore
but instead uses the proof to transform the program into an equivalent but more
efficiently verifiable program. Code consumers thus still do proving themselves,
however, on a computationally inexpensive level only. Experimental results show
that the proof effort can be reduced by several orders of magnitude, both with
respect to time and space.
author:
- first_name: Daniel
full_name: Wonisch, Daniel
last_name: Wonisch
- first_name: Alexander
full_name: Schremmer, Alexander
last_name: Schremmer
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Wonisch D, Schremmer A, Wehrheim H. Programs from Proofs -- Approach and Applications.
In: Proceedings of the Software Engineering Conference (SE). Lecture Notes
in Informatics (LNI). ; 2014:67-68.'
apa: Wonisch, D., Schremmer, A., & Wehrheim, H. (2014). Programs from Proofs
-- Approach and Applications. In Proceedings of the Software Engineering Conference
(SE) (pp. 67–68).
bibtex: '@inproceedings{Wonisch_Schremmer_Wehrheim_2014, series={Lecture Notes in
Informatics (LNI)}, title={Programs from Proofs -- Approach and Applications},
booktitle={Proceedings of the Software Engineering Conference (SE)}, author={Wonisch,
Daniel and Schremmer, Alexander and Wehrheim, Heike}, year={2014}, pages={67–68},
collection={Lecture Notes in Informatics (LNI)} }'
chicago: Wonisch, Daniel, Alexander Schremmer, and Heike Wehrheim. “Programs from
Proofs -- Approach and Applications.” In Proceedings of the Software Engineering
Conference (SE), 67–68. Lecture Notes in Informatics (LNI), 2014.
ieee: D. Wonisch, A. Schremmer, and H. Wehrheim, “Programs from Proofs -- Approach
and Applications,” in Proceedings of the Software Engineering Conference (SE),
2014, pp. 67–68.
mla: Wonisch, Daniel, et al. “Programs from Proofs -- Approach and Applications.”
Proceedings of the Software Engineering Conference (SE), 2014, pp. 67–68.
short: 'D. Wonisch, A. Schremmer, H. Wehrheim, in: Proceedings of the Software Engineering
Conference (SE), 2014, pp. 67–68.'
date_created: 2017-10-17T12:42:06Z
date_updated: 2022-01-06T06:59:38Z
ddc:
- '040'
department:
- _id: '77'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:04:52Z
date_updated: 2018-03-20T07:04:52Z
file_id: '1392'
file_name: 383-programmsFromProofsSE.pdf
file_size: 66474
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:04:52Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- url: http://eprints.uni-kiel.de/23752/
page: 67-68
project:
- _id: '1'
name: SFB 901
- _id: '12'
name: SFB 901 - Subprojekt B4
- _id: '3'
name: SFB 901 - Project Area B
publication: Proceedings of the Software Engineering Conference (SE)
series_title: Lecture Notes in Informatics (LNI)
status: public
title: Programs from Proofs -- Approach and Applications
type: conference
user_id: '477'
year: '2014'
...
---
_id: '384'
abstract:
- lang: eng
text: 'Reputation systems provide reputation values of rated parties to users. These
reputation values, typically aggregations of individual user ratings, shall be
reliable, i.e. should enable a realistic assessment of the probability that the
rated party behaves as expected in a transaction. In order for the reputation
values to stay reliable and, thus, for the reputation system to provide a benefit,
the system needs to be resistant against manipulations by users, the rated parties
trying to improve their reputation values, and even against competitors trying
to worsen a reputation value. At the same time, a reputation system shall provide
privacy protection for users: rated parties shall not be able to learn who provided
a certain rating. Otherwise users might not take part in the system as they fear
bad feedback in revenge for bad ratings, or users do not want to be connected
to certain transactions based on their provided ratings. In this paper we come
up with a solution that provides both, reliability of reputation values on the
one hand, and privacy protection for users on the other hand. In contrast to related
work, our solution only makes use of a single reputation provider that needs to
be trusted (to a certain extent) and does not require any bulletin boards to be
present in the system. We make use of the Paillier cryptosystem to provide an
aggregation of individual user ratings in a way that no party can learn which
user provided a certain rating.'
author:
- first_name: Ronald
full_name: Petrlic, Ronald
last_name: Petrlic
- first_name: Sascha
full_name: Lutters, Sascha
last_name: Lutters
- first_name: Christoph
full_name: Sorge, Christoph
last_name: Sorge
citation:
ama: 'Petrlic R, Lutters S, Sorge C. Privacy-Preserving Reputation Management. In:
Proceedings of the 29th Symposium On Applied Computing (SAC). ; 2014:1712-1718.
doi:10.1145/2554850.2554881'
apa: Petrlic, R., Lutters, S., & Sorge, C. (2014). Privacy-Preserving Reputation
Management. In Proceedings of the 29th Symposium On Applied Computing (SAC)
(pp. 1712–1718). https://doi.org/10.1145/2554850.2554881
bibtex: '@inproceedings{Petrlic_Lutters_Sorge_2014, title={Privacy-Preserving Reputation
Management}, DOI={10.1145/2554850.2554881},
booktitle={Proceedings of the 29th Symposium On Applied Computing (SAC)}, author={Petrlic,
Ronald and Lutters, Sascha and Sorge, Christoph}, year={2014}, pages={1712–1718}
}'
chicago: Petrlic, Ronald, Sascha Lutters, and Christoph Sorge. “Privacy-Preserving
Reputation Management.” In Proceedings of the 29th Symposium On Applied Computing
(SAC), 1712–18, 2014. https://doi.org/10.1145/2554850.2554881.
ieee: R. Petrlic, S. Lutters, and C. Sorge, “Privacy-Preserving Reputation Management,”
in Proceedings of the 29th Symposium On Applied Computing (SAC), 2014,
pp. 1712–1718.
mla: Petrlic, Ronald, et al. “Privacy-Preserving Reputation Management.” Proceedings
of the 29th Symposium On Applied Computing (SAC), 2014, pp. 1712–18, doi:10.1145/2554850.2554881.
short: 'R. Petrlic, S. Lutters, C. Sorge, in: Proceedings of the 29th Symposium
On Applied Computing (SAC), 2014, pp. 1712–1718.'
date_created: 2017-10-17T12:42:06Z
date_updated: 2022-01-06T06:59:42Z
ddc:
- '040'
doi: 10.1145/2554850.2554881
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:04:20Z
date_updated: 2018-03-20T07:04:20Z
file_id: '1391'
file_name: 384-reputationsystem_01.pdf
file_size: 505927
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:04:20Z
has_accepted_license: '1'
page: 1712-1718
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 29th Symposium On Applied Computing (SAC)
status: public
title: Privacy-Preserving Reputation Management
type: conference
user_id: '15504'
year: '2014'
...