---
_id: '446'
abstract:
- lang: eng
text: 'This paper considers the problem of how to efficiently share a wireless medium
which is subject to harsh external interference or even jamming. While this problem
has already been studied intensively for simplistic single-hop or unit disk graph
models, we make a leap forward and study MAC protocols for the SINR interference
model (a.k.a. the physical model). We make two contributions. First, we introduce
a new adversarial SINR model which captures a wide range of interference phenomena.
Concretely, we consider a powerful, adaptive adversary which can jam nodes at
arbitrary times and which is only limited by some energy budget. The second contribution
of this paper is a distributed MAC protocol which provably achieves a constant
competitive throughput in this environment: we show that, with high probability,
the protocol ensures that a constant fraction of the non-blocked time periods
is used for successful transmissions.'
author:
- first_name: Adrian
full_name: Ogierman, Adrian
last_name: Ogierman
- first_name: Andrea W.
full_name: Richa, Andrea W.
last_name: Richa
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Stefan
full_name: Schmid, Stefan
last_name: Schmid
- first_name: Jin
full_name: Zhang, Jin
last_name: Zhang
citation:
ama: 'Ogierman A, Richa AW, Scheideler C, Schmid S, Zhang J. Competitive MAC under
adversarial SINR. In: Proceedings of the 33rd Annual IEEE International Conference
on Computer Communications (INFOCOM). ; 2014:2751--2759. doi:10.1109/INFOCOM.2014.6848224'
apa: Ogierman, A., Richa, A. W., Scheideler, C., Schmid, S., & Zhang, J. (2014).
Competitive MAC under adversarial SINR. In Proceedings of the 33rd Annual IEEE
International Conference on Computer Communications (INFOCOM) (pp. 2751--2759).
https://doi.org/10.1109/INFOCOM.2014.6848224
bibtex: '@inproceedings{Ogierman_Richa_Scheideler_Schmid_Zhang_2014, title={Competitive
MAC under adversarial SINR}, DOI={10.1109/INFOCOM.2014.6848224},
booktitle={Proceedings of the 33rd Annual IEEE International Conference on Computer
Communications (INFOCOM)}, author={Ogierman, Adrian and Richa, Andrea W. and Scheideler,
Christian and Schmid, Stefan and Zhang, Jin}, year={2014}, pages={2751--2759}
}'
chicago: Ogierman, Adrian, Andrea W. Richa, Christian Scheideler, Stefan Schmid,
and Jin Zhang. “Competitive MAC under Adversarial SINR.” In Proceedings of
the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM),
2751--2759, 2014. https://doi.org/10.1109/INFOCOM.2014.6848224.
ieee: A. Ogierman, A. W. Richa, C. Scheideler, S. Schmid, and J. Zhang, “Competitive
MAC under adversarial SINR,” in Proceedings of the 33rd Annual IEEE International
Conference on Computer Communications (INFOCOM), 2014, pp. 2751--2759.
mla: Ogierman, Adrian, et al. “Competitive MAC under Adversarial SINR.” Proceedings
of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM),
2014, pp. 2751--2759, doi:10.1109/INFOCOM.2014.6848224.
short: 'A. Ogierman, A.W. Richa, C. Scheideler, S. Schmid, J. Zhang, in: Proceedings
of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM),
2014, pp. 2751--2759.'
date_created: 2017-10-17T12:42:18Z
date_updated: 2022-01-06T07:01:05Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1109/INFOCOM.2014.6848224
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-16T11:27:04Z
date_updated: 2018-03-16T11:27:04Z
file_id: '1348'
file_name: 446-infocom14_01.pdf
file_size: 378095
relation: main_file
success: 1
file_date_updated: 2018-03-16T11:27:04Z
has_accepted_license: '1'
page: 2751--2759
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 33rd Annual IEEE International Conference on Computer
Communications (INFOCOM)
status: public
title: Competitive MAC under adversarial SINR
type: conference
user_id: '15504'
year: '2014'
...
---
_id: '451'
abstract:
- lang: eng
text: We introduce the concept of budget games. Players choose a set of tasks and
each task has a certain demand on every resource in the game. Each resource has
a budget. If the budget is not enough to satisfy the sum of all demands, it has
to be shared between the tasks. We study strategic budget games, where the budget
is shared proportionally. We also consider a variant in which the order of the
strategic decisions influences the distribution of the budgets. The complexity
of the optimal solution as well as existence, complexity and quality of equilibria
are analysed. Finally, we show that the time an ordered budget game needs to convergence
towards an equilibrium may be exponential.
author:
- first_name: Maximilian
full_name: Drees, Maximilian
last_name: Drees
- first_name: Sören
full_name: Riechers, Sören
last_name: Riechers
- first_name: Alexander
full_name: Skopalik, Alexander
id: '40384'
last_name: Skopalik
citation:
ama: 'Drees M, Riechers S, Skopalik A. Budget-restricted utility games with ordered
strategic decisions. In: Lavi R, ed. Proceedings of the 7th International Symposium
on Algorithmic Game Theory (SAGT). Lecture Notes in Computer Science. ; 2014:110-121.
doi:10.1007/978-3-662-44803-8_10'
apa: Drees, M., Riechers, S., & Skopalik, A. (2014). Budget-restricted utility
games with ordered strategic decisions. In R. Lavi (Ed.), Proceedings of the
7th International Symposium on Algorithmic Game Theory (SAGT) (pp. 110–121).
https://doi.org/10.1007/978-3-662-44803-8_10
bibtex: '@inproceedings{Drees_Riechers_Skopalik_2014, series={Lecture Notes in Computer
Science}, title={Budget-restricted utility games with ordered strategic decisions},
DOI={10.1007/978-3-662-44803-8_10},
booktitle={Proceedings of the 7th International Symposium on Algorithmic Game
Theory (SAGT)}, author={Drees, Maximilian and Riechers, Sören and Skopalik, Alexander},
editor={Lavi, RonEditor}, year={2014}, pages={110–121}, collection={Lecture Notes
in Computer Science} }'
chicago: Drees, Maximilian, Sören Riechers, and Alexander Skopalik. “Budget-Restricted
Utility Games with Ordered Strategic Decisions.” In Proceedings of the 7th
International Symposium on Algorithmic Game Theory (SAGT), edited by Ron Lavi,
110–21. Lecture Notes in Computer Science, 2014. https://doi.org/10.1007/978-3-662-44803-8_10.
ieee: M. Drees, S. Riechers, and A. Skopalik, “Budget-restricted utility games with
ordered strategic decisions,” in Proceedings of the 7th International Symposium
on Algorithmic Game Theory (SAGT), 2014, pp. 110–121.
mla: Drees, Maximilian, et al. “Budget-Restricted Utility Games with Ordered Strategic
Decisions.” Proceedings of the 7th International Symposium on Algorithmic Game
Theory (SAGT), edited by Ron Lavi, 2014, pp. 110–21, doi:10.1007/978-3-662-44803-8_10.
short: 'M. Drees, S. Riechers, A. Skopalik, in: R. Lavi (Ed.), Proceedings of the
7th International Symposium on Algorithmic Game Theory (SAGT), 2014, pp. 110–121.'
date_created: 2017-10-17T12:42:20Z
date_updated: 2022-01-06T07:01:07Z
ddc:
- '040'
department:
- _id: '63'
- _id: '541'
doi: 10.1007/978-3-662-44803-8_10
editor:
- first_name: Ron
full_name: Lavi, Ron
last_name: Lavi
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-16T11:25:10Z
date_updated: 2018-03-16T11:25:10Z
file_id: '1344'
file_name: 451-DRS14.pdf
file_size: 283266
relation: main_file
success: 1
file_date_updated: 2018-03-16T11:25:10Z
has_accepted_license: '1'
language:
- iso: eng
page: 110-121
project:
- _id: '1'
name: SFB 901
- _id: '14'
name: SFB 901 - Subproject C2
- _id: '16'
name: SFB 901 - Subproject C4
- _id: '7'
name: SFB 901 - Subproject A3
- _id: '2'
name: SFB 901 - Project Area A
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the 7th International Symposium on Algorithmic Game Theory
(SAGT)
series_title: Lecture Notes in Computer Science
status: public
title: Budget-restricted utility games with ordered strategic decisions
type: conference
user_id: '477'
year: '2014'
...
---
_id: '460'
author:
- first_name: Robert
full_name: Mittendorf, Robert
last_name: Mittendorf
citation:
ama: Mittendorf R. Advanced AES-Key Recovery from Decayed RAM-Dumps Using Multi-Threading
and FPGAs. Universität Paderborn; 2014.
apa: Mittendorf, R. (2014). Advanced AES-key recovery from decayed RAM-dumps
using multi-threading and FPGAs. Universität Paderborn.
bibtex: '@book{Mittendorf_2014, title={Advanced AES-key recovery from decayed RAM-dumps
using multi-threading and FPGAs}, publisher={Universität Paderborn}, author={Mittendorf,
Robert}, year={2014} }'
chicago: Mittendorf, Robert. Advanced AES-Key Recovery from Decayed RAM-Dumps
Using Multi-Threading and FPGAs. Universität Paderborn, 2014.
ieee: R. Mittendorf, Advanced AES-key recovery from decayed RAM-dumps using multi-threading
and FPGAs. Universität Paderborn, 2014.
mla: Mittendorf, Robert. Advanced AES-Key Recovery from Decayed RAM-Dumps Using
Multi-Threading and FPGAs. Universität Paderborn, 2014.
short: R. Mittendorf, Advanced AES-Key Recovery from Decayed RAM-Dumps Using Multi-Threading
and FPGAs, Universität Paderborn, 2014.
date_created: 2017-10-17T12:42:21Z
date_updated: 2022-01-06T07:01:14Z
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '14'
name: SFB 901 - Subprojekt C2
- _id: '4'
name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
title: Advanced AES-key recovery from decayed RAM-dumps using multi-threading and
FPGAs
type: mastersthesis
user_id: '15504'
year: '2014'
...
---
_id: '463'
abstract:
- lang: eng
text: Several fault attacks against pairing-based cryptography have been described
theoretically in recent years. Interestingly, none of these have been practically
evaluated. We accomplished this task and prove that fault attacks against pairing-based
cryptography are indeed possible and are even practical — thus posing a serious
threat. Moreover, we successfully conducted a second-order fault attack against
an open source implementation of the eta pairing on an AVR XMEGA A1. We injected
the first fault into the computation of the Miller Algorithm and applied the second
fault to skip the final exponentiation completely. We introduce a low-cost setup
that allowed us to generate multiple independent faults in one computation. The
setup implements these faults by clock glitches which induce instruction skips.
With this setup we conducted the first practical fault attack against a complete
pairing computation.
author:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
- first_name: Ricardo
full_name: Gomes da Silva, Ricardo
last_name: Gomes da Silva
- first_name: Peter
full_name: Günther, Peter
last_name: Günther
- first_name: Juliane
full_name: Krämer, Juliane
last_name: Krämer
- first_name: Jean-Pierre
full_name: Seifert, Jean-Pierre
last_name: Seifert
citation:
ama: 'Blömer J, Gomes da Silva R, Günther P, Krämer J, Seifert J-P. A Practical
Second-Order Fault Attack against a Real-World Pairing Implementation. In: Proceedings
of Fault Tolerance and Diagnosis in Cryptography(FDTC). ; 2014:123--136. doi:10.1109/FDTC.2014.22'
apa: Blömer, J., Gomes da Silva, R., Günther, P., Krämer, J., & Seifert, J.-P.
(2014). A Practical Second-Order Fault Attack against a Real-World Pairing Implementation.
In Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC) (pp.
123--136). https://doi.org/10.1109/FDTC.2014.22
bibtex: '@inproceedings{Blömer_Gomes da Silva_Günther_Krämer_Seifert_2014, title={A
Practical Second-Order Fault Attack against a Real-World Pairing Implementation},
DOI={10.1109/FDTC.2014.22},
booktitle={Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC)},
author={Blömer, Johannes and Gomes da Silva, Ricardo and Günther, Peter and Krämer,
Juliane and Seifert, Jean-Pierre}, year={2014}, pages={123--136} }'
chicago: Blömer, Johannes, Ricardo Gomes da Silva, Peter Günther, Juliane Krämer,
and Jean-Pierre Seifert. “A Practical Second-Order Fault Attack against a Real-World
Pairing Implementation.” In Proceedings of Fault Tolerance and Diagnosis in
Cryptography(FDTC), 123--136, 2014. https://doi.org/10.1109/FDTC.2014.22.
ieee: J. Blömer, R. Gomes da Silva, P. Günther, J. Krämer, and J.-P. Seifert, “A
Practical Second-Order Fault Attack against a Real-World Pairing Implementation,”
in Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC),
2014, pp. 123--136.
mla: Blömer, Johannes, et al. “A Practical Second-Order Fault Attack against a Real-World
Pairing Implementation.” Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC),
2014, pp. 123--136, doi:10.1109/FDTC.2014.22.
short: 'J. Blömer, R. Gomes da Silva, P. Günther, J. Krämer, J.-P. Seifert, in:
Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC), 2014, pp.
123--136.'
date_created: 2017-10-17T12:42:22Z
date_updated: 2022-01-06T07:01:16Z
ddc:
- '040'
department:
- _id: '64'
doi: 10.1109/FDTC.2014.22
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-16T11:20:54Z
date_updated: 2018-03-16T11:20:54Z
file_id: '1336'
file_name: 463-FDTC14.pdf
file_size: 437518
relation: main_file
success: 1
file_date_updated: 2018-03-16T11:20:54Z
has_accepted_license: '1'
page: 123--136
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
- _id: '43'
name: Securing the Financial Cloud
publication: Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC)
status: public
title: A Practical Second-Order Fault Attack against a Real-World Pairing Implementation
type: conference
user_id: '25078'
year: '2014'
...
---
_id: '465'
abstract:
- lang: eng
text: This article presents a novel Mixed Integer Nonlinear Programming (MINLP)
approach for finding a renewal plan of pipes in a water distribution system. We
formulate a MINLP model for finding the times of renewal and suited measurements
of pipe dimensions in a multi-year planning horizon. The model includes a multi-period
hydraulic simulation of the distribution systems behaviour thereby respecting
the friction caused headloss as a nonlinear constraint. We apply the MINLP solver
Bonmin to a test network and present first numerical results. The models embedding
into a general solution framework for water network problems consisting of network
reduction and simulation steps in an interated way, is beign discussed. This latter
discussion corresponds well to the recent results by C. Hallmann for the problem
of tank planning within the mentioned solution framework that has been presented
there for the first time.
author:
- first_name: Florian
full_name: Stapel, Florian
last_name: Stapel
- first_name: Leena
full_name: Suhl, Leena
last_name: Suhl
citation:
ama: Stapel F, Suhl L. A MINLP Approach for Planning the Renewal of Pipes in
Drinking Water Networks. Universität Paderborn; 2014.
apa: Stapel, F., & Suhl, L. (2014). A MINLP Approach for Planning the Renewal
of Pipes in Drinking Water Networks. Universität Paderborn.
bibtex: '@book{Stapel_Suhl_2014, title={A MINLP Approach for Planning the Renewal
of Pipes in Drinking Water Networks}, publisher={Universität Paderborn}, author={Stapel,
Florian and Suhl, Leena}, year={2014} }'
chicago: Stapel, Florian, and Leena Suhl. A MINLP Approach for Planning the Renewal
of Pipes in Drinking Water Networks. Universität Paderborn, 2014.
ieee: F. Stapel and L. Suhl, A MINLP Approach for Planning the Renewal of Pipes
in Drinking Water Networks. Universität Paderborn, 2014.
mla: Stapel, Florian, and Leena Suhl. A MINLP Approach for Planning the Renewal
of Pipes in Drinking Water Networks. Universität Paderborn, 2014.
short: F. Stapel, L. Suhl, A MINLP Approach for Planning the Renewal of Pipes in
Drinking Water Networks, Universität Paderborn, 2014.
date_created: 2017-10-17T12:42:22Z
date_updated: 2022-01-06T07:01:16Z
ddc:
- '040'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-16T11:20:22Z
date_updated: 2018-03-16T11:20:22Z
file_id: '1335'
file_name: 465-2014_-_Stapel__Suhl_-_TechReport_MINLP_Water.pdf
file_size: 435976
relation: main_file
success: 1
file_date_updated: 2018-03-16T11:20:22Z
has_accepted_license: '1'
project:
- _id: '1'
name: SFB 901
- _id: '15'
name: SFB 901 - Subprojekt C3
- _id: '4'
name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
title: A MINLP Approach for Planning the Renewal of Pipes in Drinking Water Networks
type: report
user_id: '15504'
year: '2014'
...
---
_id: '466'
author:
- first_name: Marcel
full_name: Brand, Marcel
last_name: Brand
citation:
ama: Brand M. A Generalized Loop Accelerator Implemented as a Coarse Grained
Array. Universität Paderborn; 2014.
apa: Brand, M. (2014). A generalized loop accelerator implemented as a coarse
grained array. Universität Paderborn.
bibtex: '@book{Brand_2014, title={A generalized loop accelerator implemented as
a coarse grained array}, publisher={Universität Paderborn}, author={Brand, Marcel},
year={2014} }'
chicago: Brand, Marcel. A Generalized Loop Accelerator Implemented as a Coarse
Grained Array. Universität Paderborn, 2014.
ieee: M. Brand, A generalized loop accelerator implemented as a coarse grained
array. Universität Paderborn, 2014.
mla: Brand, Marcel. A Generalized Loop Accelerator Implemented as a Coarse Grained
Array. Universität Paderborn, 2014.
short: M. Brand, A Generalized Loop Accelerator Implemented as a Coarse Grained
Array, Universität Paderborn, 2014.
date_created: 2017-10-17T12:42:22Z
date_updated: 2022-01-06T07:01:17Z
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '14'
name: SFB 901 - Subprojekt C2
- _id: '4'
name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
title: A generalized loop accelerator implemented as a coarse grained array
type: mastersthesis
user_id: '477'
year: '2014'
...
---
_id: '479'
abstract:
- lang: eng
text: Identity-based cryptography has attracted attention in the cryptographic research
community in recent years. Despite the importance of cryptographic schemes for
applications in business and law, the legal implications of identity-based cryptography
have not yet been discussed. We investigate how identity-based signatures fit
into the legal framework. We focus on the European Signature Directive, but also
take the UNCITRAL Model Law on Electronic Signatures into account. In contrast
to previous assumptions, identity-based signature schemes can, in principle, be
used even for qualified electronic signatures, which can replace handwritten signatures
in the member states of the European Union. We derive requirements to be taken
into account in the development of future identity-based signature schemes.
author:
- first_name: Christoph
full_name: Sorge, Christoph
last_name: Sorge
citation:
ama: Sorge C. The Legal Classification of Identity-Based Signatures. Computer
Law & Security Review. 2014;30(2):126-136. doi:10.1016/j.clsr.2014.01.002
apa: Sorge, C. (2014). The Legal Classification of Identity-Based Signatures. Computer
Law & Security Review, 30(2), 126–136. https://doi.org/10.1016/j.clsr.2014.01.002
bibtex: '@article{Sorge_2014, title={The Legal Classification of Identity-Based
Signatures}, volume={30}, DOI={10.1016/j.clsr.2014.01.002},
number={2}, journal={Computer Law & Security Review}, publisher={Elsevier},
author={Sorge, Christoph}, year={2014}, pages={126–136} }'
chicago: 'Sorge, Christoph. “The Legal Classification of Identity-Based Signatures.”
Computer Law & Security Review 30, no. 2 (2014): 126–36. https://doi.org/10.1016/j.clsr.2014.01.002.'
ieee: C. Sorge, “The Legal Classification of Identity-Based Signatures,” Computer
Law & Security Review, vol. 30, no. 2, pp. 126–136, 2014.
mla: Sorge, Christoph. “The Legal Classification of Identity-Based Signatures.”
Computer Law & Security Review, vol. 30, no. 2, Elsevier, 2014, pp.
126–36, doi:10.1016/j.clsr.2014.01.002.
short: C. Sorge, Computer Law & Security Review 30 (2014) 126–136.
date_created: 2017-10-17T12:42:25Z
date_updated: 2022-01-06T07:01:22Z
ddc:
- '040'
doi: 10.1016/j.clsr.2014.01.002
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T14:03:20Z
date_updated: 2018-03-15T14:03:20Z
file_id: '1323'
file_name: 479-Sorge-Legal-Classification2013.pdf
file_size: 194634
relation: main_file
success: 1
file_date_updated: 2018-03-15T14:03:20Z
has_accepted_license: '1'
intvolume: ' 30'
issue: '2'
page: 126-136
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
publication: Computer Law & Security Review
publisher: Elsevier
status: public
title: The Legal Classification of Identity-Based Signatures
type: journal_article
user_id: '477'
volume: 30
year: '2014'
...
---
_id: '401'
abstract:
- lang: eng
text: Service matching approaches determine to what extent a provided service matches
a requester's requirements. This process is based on service specifications describing
functional (e.g., signatures) as well as non-functional properties (e.g., privacy
policies). However, we cannot expect service specifications to be complete as
providers do not want to share all details of their services' implementation.
Moreover, creating complete specifications requires much effort. In this paper,
we propose a novel service matching approach taking into account a service's signatures
and privacy policies. In particular, our approach applies fuzzy matching techniques
that are able to deal with incomplete service specifications. As a benefit, decision-making
based on matching results is improved and service matching becomes better applicable
in practice.
author:
- first_name: Marie Christin
full_name: Platenius, Marie Christin
last_name: Platenius
- first_name: Svetlana
full_name: Arifulina, Svetlana
last_name: Arifulina
- first_name: Ronald
full_name: Petrlic, Ronald
last_name: Petrlic
- first_name: Wilhelm
full_name: Schäfer, Wilhelm
last_name: Schäfer
citation:
ama: 'Platenius MC, Arifulina S, Petrlic R, Schäfer W. Matching of Incomplete Service
Specifications Exemplified by Privacy Policy Matching. In: Proceedings of the
4th International Workshop on Adaptive Services for the Future Internet. Communications
in Computer and Information Science. ; 2014:6-17. doi:10.1007/978-3-319-14886-1_2'
apa: Platenius, M. C., Arifulina, S., Petrlic, R., & Schäfer, W. (2014). Matching
of Incomplete Service Specifications Exemplified by Privacy Policy Matching. In
Proceedings of the 4th International Workshop on Adaptive Services for the
Future Internet (pp. 6–17). https://doi.org/10.1007/978-3-319-14886-1_2
bibtex: '@inproceedings{Platenius_Arifulina_Petrlic_Schäfer_2014, series={Communications
in Computer and Information Science}, title={Matching of Incomplete Service Specifications
Exemplified by Privacy Policy Matching}, DOI={10.1007/978-3-319-14886-1_2},
booktitle={Proceedings of the 4th International Workshop on Adaptive Services
for the Future Internet}, author={Platenius, Marie Christin and Arifulina, Svetlana
and Petrlic, Ronald and Schäfer, Wilhelm}, year={2014}, pages={6–17}, collection={Communications
in Computer and Information Science} }'
chicago: Platenius, Marie Christin, Svetlana Arifulina, Ronald Petrlic, and Wilhelm
Schäfer. “Matching of Incomplete Service Specifications Exemplified by Privacy
Policy Matching.” In Proceedings of the 4th International Workshop on Adaptive
Services for the Future Internet, 6–17. Communications in Computer and Information
Science, 2014. https://doi.org/10.1007/978-3-319-14886-1_2.
ieee: M. C. Platenius, S. Arifulina, R. Petrlic, and W. Schäfer, “Matching of Incomplete
Service Specifications Exemplified by Privacy Policy Matching,” in Proceedings
of the 4th International Workshop on Adaptive Services for the Future Internet,
2014, pp. 6–17.
mla: Platenius, Marie Christin, et al. “Matching of Incomplete Service Specifications
Exemplified by Privacy Policy Matching.” Proceedings of the 4th International
Workshop on Adaptive Services for the Future Internet, 2014, pp. 6–17, doi:10.1007/978-3-319-14886-1_2.
short: 'M.C. Platenius, S. Arifulina, R. Petrlic, W. Schäfer, in: Proceedings of
the 4th International Workshop on Adaptive Services for the Future Internet, 2014,
pp. 6–17.'
date_created: 2017-10-17T12:42:10Z
date_updated: 2022-01-06T07:00:07Z
ddc:
- '040'
department:
- _id: '66'
- _id: '76'
doi: 10.1007/978-3-319-14886-1_2
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-16T11:38:13Z
date_updated: 2018-03-16T11:38:13Z
file_id: '1367'
file_name: 401-WAS4FI2014.pdf
file_size: 396656
relation: main_file
success: 1
file_date_updated: 2018-03-16T11:38:13Z
has_accepted_license: '1'
language:
- iso: eng
page: 6-17
project:
- _id: '1'
name: SFB 901
- _id: '9'
name: SFB 901 - Subprojekt B1
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '3'
name: SFB 901 - Project Area B
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the 4th International Workshop on Adaptive Services for
the Future Internet
series_title: Communications in Computer and Information Science
status: public
title: Matching of Incomplete Service Specifications Exemplified by Privacy Policy
Matching
type: conference
user_id: '477'
year: '2014'
...
---
_id: '410'
abstract:
- lang: eng
text: One goal of service-oriented computing is to realize future markets of composed
services. In such markets, service providers offer services that can be flexibly
combined with each other. However, although crucial for decision-making, market
participants are usually not able to individually estimate the quality of traded
services in advance. To overcome this problem, we present a conceptual design
for a reputation system that collects and processes user feedback on transactions,
and provides this information as a signal for quality to participants in the market.
Based on our proposed concept, we describe the incorporation of reputation information
into distinct decision-making processes that are crucial in such service markets.
In this context, we present a fuzzy service matching approach that takes reputation
information into account. Furthermore, we introduce an adaptive service composition
approach, and investigate the impact of exchanging immediate user feedback by
reputation information. Last but not least, we describe the importance of reputation
information for economic decisions of different market participants. The overall
output of this paper is a comprehensive view on managing and exploiting reputation
information in markets of composed services using the example of On-The-Fly Computing.
author:
- first_name: Alexander
full_name: Jungmann, Alexander
last_name: Jungmann
- first_name: Sonja
full_name: Brangewitz, Sonja
last_name: Brangewitz
- first_name: Ronald
full_name: Petrlic, Ronald
last_name: Petrlic
- first_name: Marie Christin
full_name: Platenius, Marie Christin
last_name: Platenius
citation:
ama: Jungmann A, Brangewitz S, Petrlic R, Platenius MC. Incorporating Reputation
Information into Decision-Making Processes in Markets of Composed Services. International
Journal On Advances in Intelligent Systems (IntSys). 2014;7(3&4):572--594.
apa: Jungmann, A., Brangewitz, S., Petrlic, R., & Platenius, M. C. (2014). Incorporating
Reputation Information into Decision-Making Processes in Markets of Composed Services.
International Journal On Advances in Intelligent Systems (IntSys), 7(3&4),
572--594.
bibtex: '@article{Jungmann_Brangewitz_Petrlic_Platenius_2014, title={Incorporating
Reputation Information into Decision-Making Processes in Markets of Composed Services},
volume={7}, number={3&4}, journal={International Journal On Advances in Intelligent
Systems (IntSys)}, publisher={IARIA}, author={Jungmann, Alexander and Brangewitz,
Sonja and Petrlic, Ronald and Platenius, Marie Christin}, year={2014}, pages={572--594}
}'
chicago: 'Jungmann, Alexander, Sonja Brangewitz, Ronald Petrlic, and Marie Christin
Platenius. “Incorporating Reputation Information into Decision-Making Processes
in Markets of Composed Services.” International Journal On Advances in Intelligent
Systems (IntSys) 7, no. 3&4 (2014): 572--594.'
ieee: A. Jungmann, S. Brangewitz, R. Petrlic, and M. C. Platenius, “Incorporating
Reputation Information into Decision-Making Processes in Markets of Composed Services,”
International Journal On Advances in Intelligent Systems (IntSys), vol.
7, no. 3&4, pp. 572--594, 2014.
mla: Jungmann, Alexander, et al. “Incorporating Reputation Information into Decision-Making
Processes in Markets of Composed Services.” International Journal On Advances
in Intelligent Systems (IntSys), vol. 7, no. 3&4, IARIA, 2014, pp. 572--594.
short: A. Jungmann, S. Brangewitz, R. Petrlic, M.C. Platenius, International Journal
On Advances in Intelligent Systems (IntSys) 7 (2014) 572--594.
date_created: 2017-10-17T12:42:11Z
date_updated: 2022-01-06T07:00:17Z
ddc:
- '040'
department:
- _id: '205'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-16T11:34:28Z
date_updated: 2018-03-16T11:34:28Z
file_id: '1362'
file_name: 410-intsys_v7_n34_2014_18.pdf
file_size: 2590608
relation: main_file
success: 1
file_date_updated: 2018-03-16T11:34:28Z
has_accepted_license: '1'
intvolume: ' 7'
issue: 3&4
language:
- iso: eng
main_file_link:
- url: http://www.iariajournals.org/intelligent_systems/intsys_v7_n34_2014_paged.pdf
page: 572--594
project:
- _id: '1'
name: SFB 901
- _id: '7'
name: SFB 901 - Subprojekt A3
- _id: '10'
name: SFB 901 - Subprojekt B2
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '2'
name: SFB 901 - Project Area A
- _id: '4'
name: SFB 901 - Project Area C
- _id: '3'
name: SFB 901 - Project Area B
publication: International Journal On Advances in Intelligent Systems (IntSys)
publisher: IARIA
status: public
title: Incorporating Reputation Information into Decision-Making Processes in Markets
of Composed Services
type: journal_article
user_id: '65453'
volume: 7
year: '2014'
...
---
_id: '414'
author:
- first_name: Janek
full_name: Jochheim, Janek
last_name: Jochheim
citation:
ama: Jochheim J. Hiding Software Components Using Functional Encryption.
Universität Paderborn; 2014.
apa: Jochheim, J. (2014). Hiding software components using functional encryption.
Universität Paderborn.
bibtex: '@book{Jochheim_2014, title={Hiding software components using functional
encryption}, publisher={Universität Paderborn}, author={Jochheim, Janek}, year={2014}
}'
chicago: Jochheim, Janek. Hiding Software Components Using Functional Encryption.
Universität Paderborn, 2014.
ieee: J. Jochheim, Hiding software components using functional encryption.
Universität Paderborn, 2014.
mla: Jochheim, Janek. Hiding Software Components Using Functional Encryption.
Universität Paderborn, 2014.
short: J. Jochheim, Hiding Software Components Using Functional Encryption, Universität
Paderborn, 2014.
date_created: 2017-10-17T12:42:12Z
date_updated: 2022-01-06T07:00:23Z
department:
- _id: '64'
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
- _id: '43'
name: Securing the Financial Cloud
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
title: Hiding software components using functional encryption
type: mastersthesis
user_id: '25078'
year: '2014'
...
---
_id: '416'
author:
- first_name: Pascal
full_name: Bemmann, Pascal
id: '32571'
last_name: Bemmann
citation:
ama: Bemmann P. Group Signature Schemes with Strong Exculpability. Universität
Paderborn; 2014.
apa: Bemmann, P. (2014). Group Signature Schemes with Strong Exculpability.
Universität Paderborn.
bibtex: '@book{Bemmann_2014, title={Group Signature Schemes with Strong Exculpability},
publisher={Universität Paderborn}, author={Bemmann, Pascal}, year={2014} }'
chicago: Bemmann, Pascal. Group Signature Schemes with Strong Exculpability.
Universität Paderborn, 2014.
ieee: P. Bemmann, Group Signature Schemes with Strong Exculpability. Universität
Paderborn, 2014.
mla: Bemmann, Pascal. Group Signature Schemes with Strong Exculpability.
Universität Paderborn, 2014.
short: P. Bemmann, Group Signature Schemes with Strong Exculpability, Universität
Paderborn, 2014.
date_created: 2017-10-17T12:42:13Z
date_updated: 2022-01-06T07:00:26Z
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: Group Signature Schemes with Strong Exculpability
type: bachelorsthesis
user_id: '25078'
year: '2014'
...
---
_id: '421'
author:
- first_name: Jan
full_name: Lippert, Jan
last_name: Lippert
citation:
ama: Lippert J. Fujisaki-Okamoto Transformation. Universität Paderborn; 2014.
apa: Lippert, J. (2014). Fujisaki-Okamoto Transformation. Universität Paderborn.
bibtex: '@book{Lippert_2014, title={Fujisaki-Okamoto Transformation}, publisher={Universität
Paderborn}, author={Lippert, Jan}, year={2014} }'
chicago: Lippert, Jan. Fujisaki-Okamoto Transformation. Universität Paderborn,
2014.
ieee: J. Lippert, Fujisaki-Okamoto Transformation. Universität Paderborn,
2014.
mla: Lippert, Jan. Fujisaki-Okamoto Transformation. Universität Paderborn,
2014.
short: J. Lippert, Fujisaki-Okamoto Transformation, Universität Paderborn, 2014.
date_created: 2017-10-17T12:42:14Z
date_updated: 2022-01-06T07:00:36Z
department:
- _id: '64'
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
- _id: '43'
name: Securing the Financial Cloud
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
title: Fujisaki-Okamoto Transformation
type: bachelorsthesis
user_id: '25078'
year: '2014'
...
---
_id: '429'
author:
- first_name: Maik
full_name: Herbort, Maik
last_name: Herbort
citation:
ama: Herbort M. Entwicklung eines mathematischen Modells zur Optimierung der
Struktur eines Trinkwasserbehälters. Universität Paderborn; 2014.
apa: Herbort, M. (2014). Entwicklung eines mathematischen Modells zur Optimierung
der Struktur eines Trinkwasserbehälters. Universität Paderborn.
bibtex: '@book{Herbort_2014, title={Entwicklung eines mathematischen Modells zur
Optimierung der Struktur eines Trinkwasserbehälters}, publisher={Universität Paderborn},
author={Herbort, Maik}, year={2014} }'
chicago: Herbort, Maik. Entwicklung eines mathematischen Modells zur Optimierung
der Struktur eines Trinkwasserbehälters. Universität Paderborn, 2014.
ieee: M. Herbort, Entwicklung eines mathematischen Modells zur Optimierung der
Struktur eines Trinkwasserbehälters. Universität Paderborn, 2014.
mla: Herbort, Maik. Entwicklung eines mathematischen Modells zur Optimierung
der Struktur eines Trinkwasserbehälters. Universität Paderborn, 2014.
short: M. Herbort, Entwicklung eines mathematischen Modells zur Optimierung der
Struktur eines Trinkwasserbehälters, Universität Paderborn, 2014.
date_created: 2017-10-17T12:42:15Z
date_updated: 2022-01-06T07:00:48Z
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '15'
name: SFB 901 - Subprojekt C3
- _id: '4'
name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
title: Entwicklung eines mathematischen Modells zur Optimierung der Struktur eines
Trinkwasserbehälters
type: bachelorsthesis
user_id: '477'
year: '2014'
...
---
_id: '431'
abstract:
- lang: eng
text: In meiner Dissertation besch{\"a}ftige ich mich mit dem Entwurf und der Analyse
energieeffizienter Schedulingalgorithmen, insbesondere f{\"u}r sogenannte Speed-Scaling
Modelle. Diese stellen das theoretische Pendant von Techniken wie AMDs PowerNOW!
und Intels SpeedStep dar, welche es erlauben die Geschwindigkeit von Prozessoren
zur Laufzeit an die derzeitigen Bedingungen anzupassen. Theoretische Untersuchungen
solcher Modelle sind auf eine Arbeit von Yao, Demers und Shenker (FOCS'95) zur{\"u}ckzuf{\"u}hren.
Hier kombinieren die Autoren klassisches Deadline-Scheduling mit einem Prozessor
der Speed-Scaling beherrscht. Es gilt Jobs verschiedener Gr{\"o}ße fristgerecht
abzuarbeiten und die dabei verwendete Energie zu minimieren. Der Energieverbrauch
des Prozessors wird durch eine konvexe Funktion $\POW\colon\R_{\geq0}\to\R_{\geq0}$
modelliert, welche die Geschwindigkeit auf den Energieverbrauch abbildet.Meine
Dissertation betrachtet verschiedene Varianten des urspr{\"u}nglichen Speed-Scaling
Modells. Forschungsrelevante Ergebnisse sind in den Kapiteln 3 bis 6 zu finden
und erstrecken sich {\"u}ber die im Folgenden beschriebenen Aspekte:- Kapitel
3 und 4 betrachten verschiedene \emph{Price-Collecting} Varianten des Originalproblems.
Hier d{\"u}rfen einzelne Deadlines verfehlt werden, sofern eine jobabh{\"a}ngige
Strafe gezahlt wird. Ich entwerfe insbesondere Online-Algorithmen mit einer beweisbar
guten Competitiveness. Dabei liefern meine Ergebnisse substantielle Verbesserungen
bestehender Arbeiten und erweitern diese unter Anderem auf Szenarien mit mehreren
Prozessoren.- In Kapitel 5 wird statt des klassischen Deadline-Schedulings eine
Linearkombination der durchschnittlichen Antwortzeit und des Energieverbrauchs
betrachtet. Die Frage, ob dieses Problem NP-schwer ist, stellt eine der zentralen
Forschungsfragen in diesem Gebiet dar. F{\"u}r eine relaxierte Form dieser Frage
entwerfe ich einen effizienter Algorithmus und beweise seine Optimalit{\"a}t.-
Das letzte Kapitel betrachtet ein Modell, welches – auf den ersten Blick – nicht
direkt zur Speed-Scaling Literatur z{\"a}hlt. Hier geht es stattdessen um ein
allgemeines Resource-Constrained Scheduling, in dem sich die Prozessoren zusammen
eine gemeinsame, beliebig aufteilbare Ressource teilen. Ich untersuche die Komplexit{\"a}t
des Problems und entwerfe verschiedene Approximationsalgorithmen.
author:
- first_name: Peter
full_name: Kling, Peter
last_name: Kling
citation:
ama: Kling P. Energy-Efficient Scheduling Algorithms. Universität Paderborn;
2014.
apa: Kling, P. (2014). Energy-efficient Scheduling Algorithms. Universität
Paderborn.
bibtex: '@book{Kling_2014, title={Energy-efficient Scheduling Algorithms}, publisher={Universität
Paderborn}, author={Kling, Peter}, year={2014} }'
chicago: Kling, Peter. Energy-Efficient Scheduling Algorithms. Universität
Paderborn, 2014.
ieee: P. Kling, Energy-efficient Scheduling Algorithms. Universität Paderborn,
2014.
mla: Kling, Peter. Energy-Efficient Scheduling Algorithms. Universität Paderborn,
2014.
short: P. Kling, Energy-Efficient Scheduling Algorithms, Universität Paderborn,
2014.
date_created: 2017-10-17T12:42:15Z
date_updated: 2022-01-06T07:00:52Z
ddc:
- '040'
department:
- _id: '63'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-16T11:31:29Z
date_updated: 2018-03-16T11:31:29Z
file_id: '1356'
file_name: 431-Peter_Kling_PhDThesis_01.pdf
file_size: 792106
relation: main_file
success: 1
file_date_updated: 2018-03-16T11:31:29Z
has_accepted_license: '1'
project:
- _id: '1'
name: SFB 901
- _id: '14'
name: SFB 901 - Subprojekt C2
- _id: '4'
name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
title: Energy-efficient Scheduling Algorithms
type: dissertation
user_id: '477'
year: '2014'
...
---
_id: '435'
abstract:
- lang: eng
text: We give a polynomial time algorithm to compute an optimal energy and fractional
weighted flow trade-off schedule for a speed-scalable processor with discrete
speeds.Our algorithm uses a geometric approach that is based on structural properties
obtained from a primal-dual formulation of the problem.
author:
- first_name: Antonios
full_name: Antoniadis, Antonios
last_name: Antoniadis
- first_name: Neal
full_name: Barcelo, Neal
last_name: Barcelo
- first_name: Mario
full_name: Consuegra, Mario
last_name: Consuegra
- first_name: Peer
full_name: Kling, Peer
last_name: Kling
- first_name: Michael
full_name: Nugent, Michael
last_name: Nugent
- first_name: Kirk
full_name: Pruhs, Kirk
last_name: Pruhs
- first_name: Michele
full_name: Scquizzato, Michele
last_name: Scquizzato
citation:
ama: 'Antoniadis A, Barcelo N, Consuegra M, et al. Efficient Computation of Optimal
Energy and Fractional Weighted Flow Trade-off Schedules. In: Proceedings of
the 31st Symposium on Theoretical Aspects of Computer Science (STACS). LIPIcs.
; 2014:63--74. doi:10.4230/LIPIcs.STACS.2014.63'
apa: Antoniadis, A., Barcelo, N., Consuegra, M., Kling, P., Nugent, M., Pruhs, K.,
& Scquizzato, M. (2014). Efficient Computation of Optimal Energy and Fractional
Weighted Flow Trade-off Schedules. In Proceedings of the 31st Symposium on
Theoretical Aspects of Computer Science (STACS) (pp. 63--74). https://doi.org/10.4230/LIPIcs.STACS.2014.63
bibtex: '@inproceedings{Antoniadis_Barcelo_Consuegra_Kling_Nugent_Pruhs_Scquizzato_2014,
series={LIPIcs}, title={Efficient Computation of Optimal Energy and Fractional
Weighted Flow Trade-off Schedules}, DOI={10.4230/LIPIcs.STACS.2014.63},
booktitle={Proceedings of the 31st Symposium on Theoretical Aspects of Computer
Science (STACS)}, author={Antoniadis, Antonios and Barcelo, Neal and Consuegra,
Mario and Kling, Peer and Nugent, Michael and Pruhs, Kirk and Scquizzato, Michele},
year={2014}, pages={63--74}, collection={LIPIcs} }'
chicago: Antoniadis, Antonios, Neal Barcelo, Mario Consuegra, Peer Kling, Michael
Nugent, Kirk Pruhs, and Michele Scquizzato. “Efficient Computation of Optimal
Energy and Fractional Weighted Flow Trade-off Schedules.” In Proceedings of
the 31st Symposium on Theoretical Aspects of Computer Science (STACS), 63--74.
LIPIcs, 2014. https://doi.org/10.4230/LIPIcs.STACS.2014.63.
ieee: A. Antoniadis et al., “Efficient Computation of Optimal Energy and
Fractional Weighted Flow Trade-off Schedules,” in Proceedings of the 31st Symposium
on Theoretical Aspects of Computer Science (STACS), 2014, pp. 63--74.
mla: Antoniadis, Antonios, et al. “Efficient Computation of Optimal Energy and Fractional
Weighted Flow Trade-off Schedules.” Proceedings of the 31st Symposium on Theoretical
Aspects of Computer Science (STACS), 2014, pp. 63--74, doi:10.4230/LIPIcs.STACS.2014.63.
short: 'A. Antoniadis, N. Barcelo, M. Consuegra, P. Kling, M. Nugent, K. Pruhs,
M. Scquizzato, in: Proceedings of the 31st Symposium on Theoretical Aspects of
Computer Science (STACS), 2014, pp. 63--74.'
date_created: 2017-10-17T12:42:16Z
date_updated: 2022-01-06T07:00:58Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.4230/LIPIcs.STACS.2014.63
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-16T11:30:23Z
date_updated: 2018-03-16T11:30:23Z
file_id: '1354'
file_name: 435-Kling_C2_STACS2014.pdf
file_size: 525851
relation: main_file
success: 1
file_date_updated: 2018-03-16T11:30:23Z
has_accepted_license: '1'
language:
- iso: eng
page: 63--74
project:
- _id: '1'
name: SFB 901
- _id: '16'
name: SFB 901 - Subprojekt C4
- _id: '14'
name: SFB 901 - Subproject C2
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the 31st Symposium on Theoretical Aspects of Computer
Science (STACS)
series_title: LIPIcs
status: public
title: Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-off
Schedules
type: conference
user_id: '477'
year: '2014'
...
---
_id: '436'
author:
- first_name: Marvin
full_name: Damschen, Marvin
last_name: Damschen
citation:
ama: Damschen M. Easy-to-Use on-the-Fly Binary Program Acceleration on Many-Cores.
Universität Paderborn; 2014.
apa: Damschen, M. (2014). Easy-to-use on-the-fly binary program acceleration
on many-cores. Universität Paderborn.
bibtex: '@book{Damschen_2014, title={Easy-to-use on-the-fly binary program acceleration
on many-cores}, publisher={Universität Paderborn}, author={Damschen, Marvin},
year={2014} }'
chicago: Damschen, Marvin. Easy-to-Use on-the-Fly Binary Program Acceleration
on Many-Cores. Universität Paderborn, 2014.
ieee: M. Damschen, Easy-to-use on-the-fly binary program acceleration on many-cores.
Universität Paderborn, 2014.
mla: Damschen, Marvin. Easy-to-Use on-the-Fly Binary Program Acceleration on
Many-Cores. Universität Paderborn, 2014.
short: M. Damschen, Easy-to-Use on-the-Fly Binary Program Acceleration on Many-Cores,
Universität Paderborn, 2014.
date_created: 2017-10-17T12:42:16Z
date_updated: 2022-01-06T07:00:58Z
project:
- _id: '1'
name: SFB 901
- _id: '14'
name: SFB 901 - Subprojekt C2
- _id: '4'
name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
title: Easy-to-use on-the-fly binary program acceleration on many-cores
type: mastersthesis
user_id: '15504'
year: '2014'
...
---
_id: '438'
author:
- first_name: Andreas
full_name: Kokoschka, Andreas
last_name: Kokoschka
citation:
ama: Kokoschka A. Designing an Anonymous and Secure Reputation System Using a
Group Signature Variant. Universität Paderborn; 2014.
apa: Kokoschka, A. (2014). Designing an Anonymous and Secure Reputation System
Using a Group Signature Variant. Universität Paderborn.
bibtex: '@book{Kokoschka_2014, title={Designing an Anonymous and Secure Reputation
System Using a Group Signature Variant}, publisher={Universität Paderborn}, author={Kokoschka,
Andreas}, year={2014} }'
chicago: Kokoschka, Andreas. Designing an Anonymous and Secure Reputation System
Using a Group Signature Variant. Universität Paderborn, 2014.
ieee: A. Kokoschka, Designing an Anonymous and Secure Reputation System Using
a Group Signature Variant. Universität Paderborn, 2014.
mla: Kokoschka, Andreas. Designing an Anonymous and Secure Reputation System
Using a Group Signature Variant. Universität Paderborn, 2014.
short: A. Kokoschka, Designing an Anonymous and Secure Reputation System Using a
Group Signature Variant, Universität Paderborn, 2014.
date_created: 2017-10-17T12:42:17Z
date_updated: 2022-01-06T07:01:00Z
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: Designing an Anonymous and Secure Reputation System Using a Group Signature
Variant
type: bachelorsthesis
user_id: '15504'
year: '2014'
...
---
_id: '335'
abstract:
- lang: eng
text: Im Bereich der Computersysteme ist die Festlegung der Grenze zwischen Hardware
und Software eine zentrale Problemstellung. Diese Grenze hat in den letzten Jahrzehnten
nicht nur die Entwicklung von Computersystemen bestimmt, sondern auch die Strukturierung
der Ausbildung in den Computerwissenschaften beeinflusst und sogar zur Entstehung
von neuen Forschungsrichtungen gef{\"u}hrt. In diesem Beitrag besch{\"a}ftigen
wir uns mit Verschiebungen an der Grenze zwischen Hardware und Software und diskutieren
insgesamt drei qualitativ unterschiedliche Formen solcher Verschiebungen. Wir
beginnen mit der Entwicklung von Computersystemen im letzten Jahrhundert und der
Entstehung dieser Grenze, die Hardware und Software erst als eigenst{\"a}ndige
Produkte differenziert. Dann widmen wir uns der Frage, welche Funktionen in einem
Computersystem besser in Hardware und welche besser in Software realisiert werden
sollten, eine Fragestellung die zu Beginn der 90er-Jahre zur Bildung einer eigenen
Forschungsrichtung, dem sogenannten Hardware/Software Co-design, gef{\"u}hrt hat.
Im Hardware/Software Co-design findet eine Verschiebung von Funktionen an der Grenze
zwischen Hardware und Software w{\"a}hrend der Entwicklung eines Produktes statt,
um Produkteigenschaften zu optimieren. Im fertig entwickelten und eingesetzten
Produkt hingegen k{\"o}nnen wir dann eine feste Grenze zwischen Hardware und Software
beobachten. Im dritten Teil dieses Beitrags stellen wir mit selbst-adaptiven Systemen
eine hochaktuelle Forschungsrichtung vor. In unserem Kontext bedeutet Selbstadaption,
dass ein System Verschiebungen von Funktionen an der Grenze zwischen Hardware
und Software autonom w{\"a}hrend der Betriebszeit vornimmt. Solche Systeme beruhen
auf rekonfigurierbarer Hardware, einer relativ neuen Technologie mit der die Hardware
eines Computers w{\"a}hrend der Laufzeit ver{\"a}ndert werden kann. Diese Technologie
f{\"u}hrt zu einer durchl{\"a}ssigen Grenze zwischen Hardware und Software bzw.
l{\"o}st sie die herk{\"o}mmliche Vorstellung einer festen Hardware und einer
flexiblen Software damit auf.
author:
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
- first_name: Christian
full_name: Plessl, Christian
id: '16153'
last_name: Plessl
orcid: 0000-0001-5728-9982
citation:
ama: 'Platzner M, Plessl C. Verschiebungen an der Grenze zwischen Hardware und Software.
In: Künsemöller J, Eke NO, Foit L, Kaerlein T, eds. Logiken strukturbildender
Prozesse: Automatismen. Schriftenreihe des Graduiertenkollegs “Automatismen.”
Wilhelm Fink; 2014:123-144.'
apa: 'Platzner, M., & Plessl, C. (2014). Verschiebungen an der Grenze zwischen
Hardware und Software. In J. Künsemöller, N. O. Eke, L. Foit, & T. Kaerlein
(Eds.), Logiken strukturbildender Prozesse: Automatismen (pp. 123–144).
Wilhelm Fink.'
bibtex: '@inbook{Platzner_Plessl_2014, place={Paderborn}, series={Schriftenreihe
des Graduiertenkollegs “Automatismen”}, title={Verschiebungen an der Grenze zwischen
Hardware und Software}, booktitle={Logiken strukturbildender Prozesse: Automatismen},
publisher={Wilhelm Fink}, author={Platzner, Marco and Plessl, Christian}, editor={Künsemöller,
Jörn and Eke, Norber Otto and Foit, Lioba and Kaerlein, Timo}, year={2014}, pages={123–144},
collection={Schriftenreihe des Graduiertenkollegs “Automatismen”} }'
chicago: 'Platzner, Marco, and Christian Plessl. “Verschiebungen an der Grenze zwischen
Hardware und Software.” In Logiken strukturbildender Prozesse: Automatismen,
edited by Jörn Künsemöller, Norber Otto Eke, Lioba Foit, and Timo Kaerlein, 123–44.
Schriftenreihe des Graduiertenkollegs “Automatismen.” Paderborn: Wilhelm Fink,
2014.'
ieee: 'M. Platzner and C. Plessl, “Verschiebungen an der Grenze zwischen Hardware
und Software,” in Logiken strukturbildender Prozesse: Automatismen, J.
Künsemöller, N. O. Eke, L. Foit, and T. Kaerlein, Eds. Paderborn: Wilhelm Fink,
2014, pp. 123–144.'
mla: 'Platzner, Marco, and Christian Plessl. “Verschiebungen an der Grenze zwischen
Hardware und Software.” Logiken strukturbildender Prozesse: Automatismen,
edited by Jörn Künsemöller et al., Wilhelm Fink, 2014, pp. 123–44.'
short: 'M. Platzner, C. Plessl, in: J. Künsemöller, N.O. Eke, L. Foit, T. Kaerlein
(Eds.), Logiken strukturbildender Prozesse: Automatismen, Wilhelm Fink, Paderborn,
2014, pp. 123–144.'
date_created: 2017-10-17T12:41:57Z
date_updated: 2023-09-26T13:32:49Z
ddc:
- '040'
department:
- _id: '518'
- _id: '27'
- _id: '78'
editor:
- first_name: Jörn
full_name: Künsemöller, Jörn
last_name: Künsemöller
- first_name: Norber Otto
full_name: Eke, Norber Otto
last_name: Eke
- first_name: Lioba
full_name: Foit, Lioba
last_name: Foit
- first_name: Timo
full_name: Kaerlein, Timo
last_name: Kaerlein
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:29:58Z
date_updated: 2018-03-20T07:29:58Z
file_id: '1424'
file_name: 335-2014_plessl_automatismen.pdf
file_size: 2848154
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:29:58Z
has_accepted_license: '1'
language:
- iso: ger
page: 123-144
place: Paderborn
project:
- _id: '1'
grant_number: '160364472'
name: SFB 901
- _id: '14'
grant_number: '160364472'
name: SFB 901 - Subprojekt C2
- _id: '4'
name: SFB 901 - Project Area C
publication: 'Logiken strukturbildender Prozesse: Automatismen'
publication_identifier:
isbn:
- 978-3-7705-5730-1
publication_status: published
publisher: Wilhelm Fink
quality_controlled: '1'
series_title: Schriftenreihe des Graduiertenkollegs "Automatismen"
status: public
title: Verschiebungen an der Grenze zwischen Hardware und Software
type: book_chapter
user_id: '15278'
year: '2014'
...
---
_id: '388'
abstract:
- lang: eng
text: In order to leverage the use of reconfigurable architectures in general-purpose
computing, quick and automated methods to find suitable accelerator designs are
required. We tackle this challenge in both regards. In order to avoid long synthesis
times, we target a vector copro- cessor, implemented on the FPGAs of a Convey
HC-1. Previous studies showed that existing tools were not able to accelerate
a real-world application with low effort. We present a toolflow to automatically
identify suitable loops for vectorization, generate a corresponding hardware/software
bipartition, and generate coprocessor code. Where applicable, we leverage outer-loop
vectorization. We evaluate our tools with a set of characteristic loops, systematically
analyzing different dependency and data layout properties.
author:
- first_name: Tobias
full_name: Kenter, Tobias
id: '3145'
last_name: Kenter
- first_name: Gavin Francis
full_name: Vaz, Gavin Francis
id: '30332'
last_name: Vaz
- first_name: Christian
full_name: Plessl, Christian
id: '16153'
last_name: Plessl
orcid: 0000-0001-5728-9982
citation:
ama: 'Kenter T, Vaz GF, Plessl C. Partitioning and Vectorizing Binary Applications
for a Reconfigurable Vector Computer. In: Proceedings of the International
Symposium on Reconfigurable Computing: Architectures, Tools, and Applications
(ARC). Vol 8405. Lecture Notes in Computer Science (LNCS). Springer International
Publishing; 2014:144-155. doi:10.1007/978-3-319-05960-0_13'
apa: 'Kenter, T., Vaz, G. F., & Plessl, C. (2014). Partitioning and Vectorizing
Binary Applications for a Reconfigurable Vector Computer. Proceedings of the
International Symposium on Reconfigurable Computing: Architectures, Tools, and
Applications (ARC), 8405, 144–155. https://doi.org/10.1007/978-3-319-05960-0_13'
bibtex: '@inproceedings{Kenter_Vaz_Plessl_2014, place={Cham}, series={Lecture Notes
in Computer Science (LNCS)}, title={Partitioning and Vectorizing Binary Applications
for a Reconfigurable Vector Computer}, volume={8405}, DOI={10.1007/978-3-319-05960-0_13},
booktitle={Proceedings of the International Symposium on Reconfigurable Computing:
Architectures, Tools, and Applications (ARC)}, publisher={Springer International
Publishing}, author={Kenter, Tobias and Vaz, Gavin Francis and Plessl, Christian},
year={2014}, pages={144–155}, collection={Lecture Notes in Computer Science (LNCS)}
}'
chicago: 'Kenter, Tobias, Gavin Francis Vaz, and Christian Plessl. “Partitioning
and Vectorizing Binary Applications for a Reconfigurable Vector Computer.” In
Proceedings of the International Symposium on Reconfigurable Computing: Architectures,
Tools, and Applications (ARC), 8405:144–55. Lecture Notes in Computer Science
(LNCS). Cham: Springer International Publishing, 2014. https://doi.org/10.1007/978-3-319-05960-0_13.'
ieee: 'T. Kenter, G. F. Vaz, and C. Plessl, “Partitioning and Vectorizing Binary
Applications for a Reconfigurable Vector Computer,” in Proceedings of the International
Symposium on Reconfigurable Computing: Architectures, Tools, and Applications
(ARC), 2014, vol. 8405, pp. 144–155, doi: 10.1007/978-3-319-05960-0_13.'
mla: 'Kenter, Tobias, et al. “Partitioning and Vectorizing Binary Applications for
a Reconfigurable Vector Computer.” Proceedings of the International Symposium
on Reconfigurable Computing: Architectures, Tools, and Applications (ARC),
vol. 8405, Springer International Publishing, 2014, pp. 144–55, doi:10.1007/978-3-319-05960-0_13.'
short: 'T. Kenter, G.F. Vaz, C. Plessl, in: Proceedings of the International Symposium
on Reconfigurable Computing: Architectures, Tools, and Applications (ARC), Springer
International Publishing, Cham, 2014, pp. 144–155.'
date_created: 2017-10-17T12:42:07Z
date_updated: 2023-09-26T13:34:08Z
ddc:
- '040'
department:
- _id: '27'
- _id: '518'
- _id: '78'
doi: 10.1007/978-3-319-05960-0_13
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:02:02Z
date_updated: 2018-03-20T07:02:02Z
file_id: '1387'
file_name: 388-plessl14_arc.pdf
file_size: 330193
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:02:02Z
has_accepted_license: '1'
intvolume: ' 8405'
language:
- iso: eng
page: 144-155
place: Cham
project:
- _id: '1'
grant_number: '160364472'
name: SFB 901
- _id: '14'
grant_number: '160364472'
name: SFB 901 - Subprojekt C2
- _id: '4'
name: SFB 901 - Project Area C
- _id: '34'
grant_number: '610996'
name: Self-Adaptive Virtualisation-Aware High-Performance/Low-Energy Heterogeneous
System Architectures
publication: 'Proceedings of the International Symposium on Reconfigurable Computing:
Architectures, Tools, and Applications (ARC)'
publisher: Springer International Publishing
quality_controlled: '1'
series_title: Lecture Notes in Computer Science (LNCS)
status: public
title: Partitioning and Vectorizing Binary Applications for a Reconfigurable Vector
Computer
type: conference
user_id: '15278'
volume: 8405
year: '2014'
...
---
_id: '363'
abstract:
- lang: eng
text: Due to the continuously shrinking device structures and increasing densities
of FPGAs, thermal aspects have become the new focus for many research projects
over the last years. Most researchers rely on temperature simulations to evaluate
their novel thermal management techniques. However, these temperature simulations
require a high computational effort if a detailed thermal model is used and their
accuracies are often unclear. In contrast to simulations, the use of synthetic
heat sources allows for experimental evaluation of temperature management methods.
In this paper we investigate the creation of significant rises in temperature
on modern FPGAs to enable future evaluation of thermal management techniques based
on experiments. To that end, we have developed seven different heat-generating
cores that use different subsets of FPGA resources. Our experimental results show
that, according to external temperature probes connected to the FPGA’s heat sink,
we can increase the temperature by an average of 81 !C. This corresponds to an
average increase of 156.3 !C as measured by the built-in thermal diodes of our
Virtex-5 FPGAs in less than 30 min by only utilizing about 21 percent of the slices.
author:
- first_name: Andreas
full_name: Agne, Andreas
last_name: Agne
- first_name: Hendrik
full_name: Hangmann, Hendrik
last_name: Hangmann
- first_name: Markus
full_name: Happe, Markus
last_name: Happe
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
- first_name: Christian
full_name: Plessl, Christian
id: '16153'
last_name: Plessl
orcid: 0000-0001-5728-9982
citation:
ama: Agne A, Hangmann H, Happe M, Platzner M, Plessl C. Seven Recipes for Setting
Your FPGA on Fire – A Cookbook on Heat Generators. Microprocessors and Microsystems.
2014;38(8, Part B):911-919. doi:10.1016/j.micpro.2013.12.001
apa: Agne, A., Hangmann, H., Happe, M., Platzner, M., & Plessl, C. (2014). Seven
Recipes for Setting Your FPGA on Fire – A Cookbook on Heat Generators. Microprocessors
and Microsystems, 38(8, Part B), 911–919. https://doi.org/10.1016/j.micpro.2013.12.001
bibtex: '@article{Agne_Hangmann_Happe_Platzner_Plessl_2014, title={Seven Recipes
for Setting Your FPGA on Fire – A Cookbook on Heat Generators}, volume={38}, DOI={10.1016/j.micpro.2013.12.001},
number={8, Part B}, journal={Microprocessors and Microsystems}, publisher={Elsevier},
author={Agne, Andreas and Hangmann, Hendrik and Happe, Markus and Platzner, Marco
and Plessl, Christian}, year={2014}, pages={911–919} }'
chicago: 'Agne, Andreas, Hendrik Hangmann, Markus Happe, Marco Platzner, and Christian
Plessl. “Seven Recipes for Setting Your FPGA on Fire – A Cookbook on Heat Generators.”
Microprocessors and Microsystems 38, no. 8, Part B (2014): 911–19. https://doi.org/10.1016/j.micpro.2013.12.001.'
ieee: 'A. Agne, H. Hangmann, M. Happe, M. Platzner, and C. Plessl, “Seven Recipes
for Setting Your FPGA on Fire – A Cookbook on Heat Generators,” Microprocessors
and Microsystems, vol. 38, no. 8, Part B, pp. 911–919, 2014, doi: 10.1016/j.micpro.2013.12.001.'
mla: Agne, Andreas, et al. “Seven Recipes for Setting Your FPGA on Fire – A Cookbook
on Heat Generators.” Microprocessors and Microsystems, vol. 38, no. 8,
Part B, Elsevier, 2014, pp. 911–19, doi:10.1016/j.micpro.2013.12.001.
short: A. Agne, H. Hangmann, M. Happe, M. Platzner, C. Plessl, Microprocessors and
Microsystems 38 (2014) 911–919.
date_created: 2017-10-17T12:42:02Z
date_updated: 2023-09-26T13:33:06Z
ddc:
- '040'
department:
- _id: '27'
- _id: '518'
- _id: '78'
doi: 10.1016/j.micpro.2013.12.001
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:20:31Z
date_updated: 2018-03-20T07:20:31Z
file_id: '1408'
file_name: 363-plessl13_micpro.pdf
file_size: 1499996
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:20:31Z
has_accepted_license: '1'
intvolume: ' 38'
issue: 8, Part B
language:
- iso: eng
page: 911-919
project:
- _id: '1'
grant_number: '160364472'
name: SFB 901
- _id: '14'
grant_number: '160364472'
name: SFB 901 - Subprojekt C2
- _id: '4'
name: SFB 901 - Project Area C
- _id: '31'
grant_number: '257906'
name: Engineering Proprioception in Computing Systems
publication: Microprocessors and Microsystems
publisher: Elsevier
quality_controlled: '1'
status: public
title: Seven Recipes for Setting Your FPGA on Fire – A Cookbook on Heat Generators
type: journal_article
user_id: '15278'
volume: 38
year: '2014'
...