---
_id: '16364'
author:
- first_name: Alexander
full_name: Macker, Alexander
last_name: Macker
- first_name: Manuel
full_name: Malatyali, Manuel
last_name: Malatyali
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Macker A, Malatyali M, Meyer auf der Heide F. On Competitive Algorithms for
Approximations of Top-k-Position Monitoring of Distributed Streams. In: 2016
IEEE International Parallel and Distributed Processing Symposium (IPDPS).
; 2016. doi:10.1109/ipdps.2016.91'
apa: Macker, A., Malatyali, M., & Meyer auf der Heide, F. (2016). On Competitive
Algorithms for Approximations of Top-k-Position Monitoring of Distributed Streams.
In 2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS).
https://doi.org/10.1109/ipdps.2016.91
bibtex: '@inproceedings{Macker_Malatyali_Meyer auf der Heide_2016, title={On Competitive
Algorithms for Approximations of Top-k-Position Monitoring of Distributed Streams},
DOI={10.1109/ipdps.2016.91},
booktitle={2016 IEEE International Parallel and Distributed Processing Symposium
(IPDPS)}, author={Macker, Alexander and Malatyali, Manuel and Meyer auf der Heide,
Friedhelm}, year={2016} }'
chicago: Macker, Alexander, Manuel Malatyali, and Friedhelm Meyer auf der Heide.
“On Competitive Algorithms for Approximations of Top-k-Position Monitoring of
Distributed Streams.” In 2016 IEEE International Parallel and Distributed Processing
Symposium (IPDPS), 2016. https://doi.org/10.1109/ipdps.2016.91.
ieee: A. Macker, M. Malatyali, and F. Meyer auf der Heide, “On Competitive Algorithms
for Approximations of Top-k-Position Monitoring of Distributed Streams,” in 2016
IEEE International Parallel and Distributed Processing Symposium (IPDPS),
2016.
mla: Macker, Alexander, et al. “On Competitive Algorithms for Approximations of
Top-k-Position Monitoring of Distributed Streams.” 2016 IEEE International
Parallel and Distributed Processing Symposium (IPDPS), 2016, doi:10.1109/ipdps.2016.91.
short: 'A. Macker, M. Malatyali, F. Meyer auf der Heide, in: 2016 IEEE International
Parallel and Distributed Processing Symposium (IPDPS), 2016.'
date_created: 2020-04-02T10:14:25Z
date_updated: 2022-01-06T06:52:49Z
department:
- _id: '63'
doi: 10.1109/ipdps.2016.91
language:
- iso: eng
publication: 2016 IEEE International Parallel and Distributed Processing Symposium
(IPDPS)
publication_identifier:
isbn:
- '9781509021406'
publication_status: published
status: public
title: On Competitive Algorithms for Approximations of Top-k-Position Monitoring of
Distributed Streams
type: conference
user_id: '15415'
year: '2016'
...
---
_id: '16386'
author:
- first_name: Florian
full_name: Klingler, Florian
last_name: Klingler
- first_name: Falko
full_name: Dressler, Falko
last_name: Dressler
- first_name: Christoph
full_name: Sommer, Christoph
last_name: Sommer
citation:
ama: 'Klingler F, Dressler F, Sommer C. IEEE 802.11p unicast considered harmful.
In: 2015 IEEE Vehicular Networking Conference (VNC). ; 2016. doi:10.1109/vnc.2015.7385550'
apa: Klingler, F., Dressler, F., & Sommer, C. (2016). IEEE 802.11p unicast considered
harmful. In 2015 IEEE Vehicular Networking Conference (VNC). https://doi.org/10.1109/vnc.2015.7385550
bibtex: '@inproceedings{Klingler_Dressler_Sommer_2016, title={IEEE 802.11p unicast
considered harmful}, DOI={10.1109/vnc.2015.7385550},
booktitle={2015 IEEE Vehicular Networking Conference (VNC)}, author={Klingler,
Florian and Dressler, Falko and Sommer, Christoph}, year={2016} }'
chicago: Klingler, Florian, Falko Dressler, and Christoph Sommer. “IEEE 802.11p
Unicast Considered Harmful.” In 2015 IEEE Vehicular Networking Conference (VNC),
2016. https://doi.org/10.1109/vnc.2015.7385550.
ieee: F. Klingler, F. Dressler, and C. Sommer, “IEEE 802.11p unicast considered
harmful,” in 2015 IEEE Vehicular Networking Conference (VNC), 2016.
mla: Klingler, Florian, et al. “IEEE 802.11p Unicast Considered Harmful.” 2015
IEEE Vehicular Networking Conference (VNC), 2016, doi:10.1109/vnc.2015.7385550.
short: 'F. Klingler, F. Dressler, C. Sommer, in: 2015 IEEE Vehicular Networking
Conference (VNC), 2016.'
date_created: 2020-04-02T15:41:34Z
date_updated: 2022-01-06T06:52:50Z
doi: 10.1109/vnc.2015.7385550
publication: 2015 IEEE Vehicular Networking Conference (VNC)
publication_identifier:
isbn:
- '9781467394116'
publication_status: published
status: public
title: IEEE 802.11p unicast considered harmful
type: conference
user_id: '49153'
year: '2016'
...
---
_id: '16396'
abstract:
- lang: eng
text: "We consider a scheduling problem where machines need to be rented from the\r\ncloud
in order to process jobs. There are two types of machines available which\r\ncan
be rented for machine-type dependent prices and for arbitrary durations.\r\nHowever,
a machine-type dependent setup time is required before a machine is\r\navailable
for processing. Jobs arrive online over time, have machine-type\r\ndependent sizes
and have individual deadlines. The objective is to rent\r\nmachines and schedule
jobs so as to meet all deadlines while minimizing the\r\nrental cost.\r\n Since
we observe the slack of jobs to have a fundamental influence on the\r\ncompetitiveness,
we study the model when instances are parameterized by their\r\n(minimum) slack.
An instance is called to have a slack of $\\beta$ if, for all\r\njobs, the difference
between the job's release time and the latest point in\r\ntime at which it needs
to be started is at least $\\beta$. While for $\\beta < s$\r\nno finite competitiveness
is possible, our main result is an\r\n$O(\\frac{c}{\\varepsilon} + \\frac{1}{\\varepsilon^3})$-competitive
online\r\nalgorithm for $\\beta = (1+\\varepsilon)s$ with $\\frac{1}{s} \\leq
\\varepsilon\r\n\\leq 1$, where $s$ and $c$ denotes the largest setup time and
the cost ratio of\r\nthe machine-types, respectively. It is complemented by a
lower bound of\r\n$\\Omega(\\frac{c}{\\varepsilon})$."
author:
- first_name: Alexander
full_name: Mäcker, Alexander
id: '13536'
last_name: Mäcker
- first_name: Manuel
full_name: Malatyali, Manuel
last_name: Malatyali
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Sören
full_name: Riechers, Sören
last_name: Riechers
citation:
ama: Mäcker A, Malatyali M, Meyer auf der Heide F, Riechers S. Cost-efficient Scheduling
on Machines from the Cloud. arXiv:160901184. 2016.
apa: Mäcker, A., Malatyali, M., Meyer auf der Heide, F., & Riechers, S. (2016).
Cost-efficient Scheduling on Machines from the Cloud. ArXiv:1609.01184.
bibtex: '@article{Mäcker_Malatyali_Meyer auf der Heide_Riechers_2016, title={Cost-efficient
Scheduling on Machines from the Cloud}, journal={arXiv:1609.01184}, author={Mäcker,
Alexander and Malatyali, Manuel and Meyer auf der Heide, Friedhelm and Riechers,
Sören}, year={2016} }'
chicago: Mäcker, Alexander, Manuel Malatyali, Friedhelm Meyer auf der Heide, and
Sören Riechers. “Cost-Efficient Scheduling on Machines from the Cloud.” ArXiv:1609.01184,
2016.
ieee: A. Mäcker, M. Malatyali, F. Meyer auf der Heide, and S. Riechers, “Cost-efficient
Scheduling on Machines from the Cloud,” arXiv:1609.01184. 2016.
mla: Mäcker, Alexander, et al. “Cost-Efficient Scheduling on Machines from the Cloud.”
ArXiv:1609.01184, 2016.
short: A. Mäcker, M. Malatyali, F. Meyer auf der Heide, S. Riechers, ArXiv:1609.01184
(2016).
date_created: 2020-04-03T09:24:28Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
external_id:
arxiv:
- '1609.01184'
language:
- iso: eng
publication: arXiv:1609.01184
status: public
title: Cost-efficient Scheduling on Machines from the Cloud
type: preprint
user_id: '15415'
year: '2016'
...
---
_id: '164'
author:
- first_name: Mike
full_name: Czech, Mike
last_name: Czech
citation:
ama: Czech M. Predicting Rankings of Software Verification Tools Using Kernels
for Structured Data. Universität Paderborn; 2016.
apa: Czech, M. (2016). Predicting Rankings of Software Verification Tools Using
Kernels for Structured Data. Universität Paderborn.
bibtex: '@book{Czech_2016, title={Predicting Rankings of Software Verification Tools
Using Kernels for Structured Data}, publisher={Universität Paderborn}, author={Czech,
Mike}, year={2016} }'
chicago: Czech, Mike. Predicting Rankings of Software Verification Tools Using
Kernels for Structured Data. Universität Paderborn, 2016.
ieee: M. Czech, Predicting Rankings of Software Verification Tools Using Kernels
for Structured Data. Universität Paderborn, 2016.
mla: Czech, Mike. Predicting Rankings of Software Verification Tools Using Kernels
for Structured Data. Universität Paderborn, 2016.
short: M. Czech, Predicting Rankings of Software Verification Tools Using Kernels
for Structured Data, Universität Paderborn, 2016.
date_created: 2017-10-17T12:41:24Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '77'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '11'
name: SFB 901 - Subprojekt B3
- _id: '3'
name: SFB 901 - Project Area B
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Heike
full_name: Wehrheim, Heike
last_name: Wehrheim
title: Predicting Rankings of Software Verification Tools Using Kernels for Structured
Data
type: mastersthesis
user_id: '15504'
year: '2016'
...
---
_id: '13860'
author:
- first_name: Fabian
full_name: Bause, Fabian
last_name: Bause
citation:
ama: Bause F. Ein Ultraschallbasiertes Inverses Messverfahren Zur Charakterisierung
Viskoelastischer Materialparameter von Polymeren. Universität Paderborn; 2016.
apa: Bause, F. (2016). Ein ultraschallbasiertes inverses Messverfahren zur Charakterisierung
viskoelastischer Materialparameter von Polymeren. Universität Paderborn.
bibtex: '@book{Bause_2016, title={Ein ultraschallbasiertes inverses Messverfahren
zur Charakterisierung viskoelastischer Materialparameter von Polymeren}, publisher={Universität
Paderborn}, author={Bause, Fabian}, year={2016} }'
chicago: Bause, Fabian. Ein Ultraschallbasiertes Inverses Messverfahren Zur Charakterisierung
Viskoelastischer Materialparameter von Polymeren. Universität Paderborn, 2016.
ieee: F. Bause, Ein ultraschallbasiertes inverses Messverfahren zur Charakterisierung
viskoelastischer Materialparameter von Polymeren. Universität Paderborn, 2016.
mla: Bause, Fabian. Ein Ultraschallbasiertes Inverses Messverfahren Zur Charakterisierung
Viskoelastischer Materialparameter von Polymeren. Universität Paderborn, 2016.
short: F. Bause, Ein Ultraschallbasiertes Inverses Messverfahren Zur Charakterisierung
Viskoelastischer Materialparameter von Polymeren, Universität Paderborn, 2016.
date_created: 2019-10-15T10:38:36Z
date_updated: 2022-01-06T06:51:45Z
department:
- _id: '49'
language:
- iso: eng
publisher: Universität Paderborn
status: public
title: Ein ultraschallbasiertes inverses Messverfahren zur Charakterisierung viskoelastischer
Materialparameter von Polymeren
type: dissertation
user_id: '15911'
year: '2016'
...
---
_id: '13864'
author:
- first_name: F.
full_name: Bause, F.
last_name: Bause
- first_name: Bernd
full_name: Henning, Bernd
id: '213'
last_name: Henning
citation:
ama: 'Bause F, Henning B. 5.3.1 - Ein ultraschallbasiertes inverses Messverfahren
zur Charakterisierung viskoelastischer Materialparameter von Polymeren. In: LibreCat
University; 2016. doi:10.5162/SENSOREN2016/5.3.1'
apa: Bause, F., & Henning, B. (2016). 5.3.1 - Ein ultraschallbasiertes inverses
Messverfahren zur Charakterisierung viskoelastischer Materialparameter von Polymeren.
LibreCat University. https://doi.org/10.5162/SENSOREN2016/5.3.1
bibtex: '@inproceedings{Bause_Henning_2016, title={5.3.1 - Ein ultraschallbasiertes
inverses Messverfahren zur Charakterisierung viskoelastischer Materialparameter
von Polymeren}, DOI={10.5162/SENSOREN2016/5.3.1},
publisher={LibreCat University}, author={Bause, F. and Henning, Bernd}, year={2016}
}'
chicago: Bause, F., and Bernd Henning. “5.3.1 - Ein Ultraschallbasiertes Inverses
Messverfahren Zur Charakterisierung Viskoelastischer Materialparameter von Polymeren.”
LibreCat University, 2016. https://doi.org/10.5162/SENSOREN2016/5.3.1.
ieee: F. Bause and B. Henning, “5.3.1 - Ein ultraschallbasiertes inverses Messverfahren
zur Charakterisierung viskoelastischer Materialparameter von Polymeren,” 2016.
mla: Bause, F., and Bernd Henning. 5.3.1 - Ein Ultraschallbasiertes Inverses
Messverfahren Zur Charakterisierung Viskoelastischer Materialparameter von Polymeren.
LibreCat University, 2016, doi:10.5162/SENSOREN2016/5.3.1.
short: 'F. Bause, B. Henning, in: LibreCat University, 2016.'
date_created: 2019-10-15T11:03:43Z
date_updated: 2022-01-06T06:51:45Z
department:
- _id: '49'
doi: 10.5162/SENSOREN2016/5.3.1
language:
- iso: eng
publisher: LibreCat University
status: public
title: 5.3.1 - Ein ultraschallbasiertes inverses Messverfahren zur Charakterisierung
viskoelastischer Materialparameter von Polymeren
type: conference
user_id: '15911'
year: '2016'
...
---
_id: '13865'
author:
- first_name: S.
full_name: Ester, S.
last_name: Ester
- first_name: M.
full_name: Struschka, M.
last_name: Struschka
- first_name: Bernd
full_name: Henning, Bernd
id: '213'
last_name: Henning
citation:
ama: 'Ester S, Struschka M, Henning B. 3.2.3 - Direktgravimetrischer Partikelmasse-Sensor
zur quasikontinuierlichen Emissionsmessung. In: LibreCat University; 2016. doi:10.5162/SENSOREN2016/3.2.3'
apa: Ester, S., Struschka, M., & Henning, B. (2016). 3.2.3 - Direktgravimetrischer
Partikelmasse-Sensor zur quasikontinuierlichen Emissionsmessung. LibreCat University.
https://doi.org/10.5162/SENSOREN2016/3.2.3
bibtex: '@inproceedings{Ester_Struschka_Henning_2016, title={3.2.3 - Direktgravimetrischer
Partikelmasse-Sensor zur quasikontinuierlichen Emissionsmessung}, DOI={10.5162/SENSOREN2016/3.2.3},
publisher={LibreCat University}, author={Ester, S. and Struschka, M. and Henning,
Bernd}, year={2016} }'
chicago: Ester, S., M. Struschka, and Bernd Henning. “3.2.3 - Direktgravimetrischer
Partikelmasse-Sensor Zur Quasikontinuierlichen Emissionsmessung.” LibreCat University,
2016. https://doi.org/10.5162/SENSOREN2016/3.2.3.
ieee: S. Ester, M. Struschka, and B. Henning, “3.2.3 - Direktgravimetrischer Partikelmasse-Sensor
zur quasikontinuierlichen Emissionsmessung,” 2016.
mla: Ester, S., et al. 3.2.3 - Direktgravimetrischer Partikelmasse-Sensor Zur
Quasikontinuierlichen Emissionsmessung. LibreCat University, 2016, doi:10.5162/SENSOREN2016/3.2.3.
short: 'S. Ester, M. Struschka, B. Henning, in: LibreCat University, 2016.'
date_created: 2019-10-15T11:04:18Z
date_updated: 2022-01-06T06:51:45Z
department:
- _id: '49'
doi: 10.5162/SENSOREN2016/3.2.3
language:
- iso: eng
publisher: LibreCat University
status: public
title: 3.2.3 - Direktgravimetrischer Partikelmasse-Sensor zur quasikontinuierlichen
Emissionsmessung
type: conference
user_id: '15911'
year: '2016'
...
---
_id: '139'
abstract:
- lang: eng
text: 'We consider online optimization problems in which certain goods have to be
acquired in order to provide a service or infrastructure. Classically, decisions
for such problems are considered as final: one buys the goods. However, in many
real world applications, there is a shift away from the idea of buying goods.
Instead, leasing is often a more flexible and lucrative business model. Research
has realized this shift and recently initiated the theoretical study of leasing
models (Anthony and Gupta in Proceedings of the integer programming and combinatorial
optimization: 12th International IPCO Conference, Ithaca, NY, USA, June 25–27,
2007; Meyerson in Proceedings of the 46th Annual IEEE Symposium on Foundations
of Computer Science (FOCS 2005), 23–25 Oct 2005, Pittsburgh, PA, USA, 2005; Nagarajan
and Williamson in Discret Optim 10(4):361–370, 2013) We extend this line of work
and suggest a more systematic study of leasing aspects for a class of online optimization
problems. We provide two major technical results. We introduce the leasing variant
of online set multicover and give an O(log(mK)logn)-competitive algorithm (with
n, m, and K being the number of elements, sets, and leases, respectively). Our
results also imply improvements for the non-leasing variant of online set cover.
Moreover, we extend results for the leasing variant of online facility location.
Nagarajan and Williamson (Discret Optim 10(4):361–370, 2013) gave an O(Klogn)-competitive
algorithm for this problem (with n and K being the number of clients and leases,
respectively). We remove the dependency on n (and, thereby, on time). In general,
this leads to a bound of O(lmaxloglmax) (with the maximal lease length lmax).
For many natural problem instances, the bound improves to O(K2).'
author:
- first_name: Sebastian
full_name: Abshoff, Sebastian
last_name: Abshoff
- first_name: Peter
full_name: Kling, Peter
last_name: Kling
- first_name: Christine
full_name: Markarian, Christine
id: '37612'
last_name: Markarian
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: 'Peter '
full_name: 'Pietrzyk, Peter '
last_name: Pietrzyk
citation:
ama: Abshoff S, Kling P, Markarian C, Meyer auf der Heide F, Pietrzyk P. Towards
the price of leasing online. Journal of Combinatorial Optimization. 2016;(4):1197--1216.
doi:10.1007/s10878-015-9915-5
apa: Abshoff, S., Kling, P., Markarian, C., Meyer auf der Heide, F., & Pietrzyk,
P. (2016). Towards the price of leasing online. Journal of Combinatorial Optimization,
(4), 1197--1216. https://doi.org/10.1007/s10878-015-9915-5
bibtex: '@article{Abshoff_Kling_Markarian_Meyer auf der Heide_Pietrzyk_2016, title={Towards
the price of leasing online}, DOI={10.1007/s10878-015-9915-5},
number={4}, journal={Journal of Combinatorial Optimization}, publisher={Springer},
author={Abshoff, Sebastian and Kling, Peter and Markarian, Christine and Meyer
auf der Heide, Friedhelm and Pietrzyk, Peter }, year={2016}, pages={1197--1216}
}'
chicago: 'Abshoff, Sebastian, Peter Kling, Christine Markarian, Friedhelm Meyer
auf der Heide, and Peter Pietrzyk. “Towards the Price of Leasing Online.” Journal
of Combinatorial Optimization, no. 4 (2016): 1197--1216. https://doi.org/10.1007/s10878-015-9915-5.'
ieee: S. Abshoff, P. Kling, C. Markarian, F. Meyer auf der Heide, and P. Pietrzyk,
“Towards the price of leasing online,” Journal of Combinatorial Optimization,
no. 4, pp. 1197--1216, 2016.
mla: Abshoff, Sebastian, et al. “Towards the Price of Leasing Online.” Journal
of Combinatorial Optimization, no. 4, Springer, 2016, pp. 1197--1216, doi:10.1007/s10878-015-9915-5.
short: S. Abshoff, P. Kling, C. Markarian, F. Meyer auf der Heide, P. Pietrzyk,
Journal of Combinatorial Optimization (2016) 1197--1216.
date_created: 2017-10-17T12:41:18Z
date_updated: 2022-01-06T06:51:46Z
ddc:
- '000'
department:
- _id: '63'
doi: 10.1007/s10878-015-9915-5
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T15:57:25Z
date_updated: 2018-11-02T15:57:25Z
file_id: '5318'
file_name: Abshoff-TowardsThePriceOfLeasingOnline.pdf
file_size: 654903
relation: main_file
success: 1
file_date_updated: 2018-11-02T15:57:25Z
has_accepted_license: '1'
issue: '4'
language:
- iso: eng
page: ' 1197--1216'
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '16'
name: SFB 901 - Subprojekt C4
- _id: '2'
name: SFB 901 - Project Area A
- _id: '4'
name: SFB 901 - Project Area C
publication: Journal of Combinatorial Optimization
publisher: Springer
status: public
title: Towards the price of leasing online
type: journal_article
user_id: '477'
year: '2016'
...
---
_id: '140'
author:
- first_name: Alexander
full_name: Jungmann, Alexander
last_name: Jungmann
citation:
ama: Jungmann A. Towards On-The-Fly Image Processing. Universität Paderborn;
2016.
apa: Jungmann, A. (2016). Towards On-The-Fly Image Processing. Universität
Paderborn.
bibtex: '@book{Jungmann_2016, title={Towards On-The-Fly Image Processing}, publisher={Universität
Paderborn}, author={Jungmann, Alexander}, year={2016} }'
chicago: Jungmann, Alexander. Towards On-The-Fly Image Processing. Universität
Paderborn, 2016.
ieee: A. Jungmann, Towards On-The-Fly Image Processing. Universität Paderborn,
2016.
mla: Jungmann, Alexander. Towards On-The-Fly Image Processing. Universität
Paderborn, 2016.
short: A. Jungmann, Towards On-The-Fly Image Processing, Universität Paderborn,
2016.
date_created: 2017-10-17T12:41:18Z
date_updated: 2022-01-06T06:51:49Z
ddc:
- '040'
department:
- _id: '70'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T13:00:24Z
date_updated: 2018-03-21T13:00:24Z
file_id: '1559'
file_name: 140-Dissertation-Alexander_Jungmann.pdf
file_size: 8006614
relation: main_file
success: 1
file_date_updated: 2018-03-21T13:00:24Z
has_accepted_license: '1'
project:
- _id: '1'
name: SFB 901
- _id: '10'
name: SFB 901 - Subprojekt B2
- _id: '3'
name: SFB 901 - Project Area B
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Franz
full_name: Rammig, Franz
last_name: Rammig
title: Towards On-The-Fly Image Processing
type: dissertation
user_id: '477'
year: '2016'
...
---
_id: '141'
author:
- first_name: Felix
full_name: Mohr, Felix
last_name: Mohr
citation:
ama: Mohr F. Towards Automated Service Composition Under Quality Constraints.
Universität Paderborn; 2016. doi:10.17619/UNIPB/1-171
apa: Mohr, F. (2016). Towards Automated Service Composition Under Quality Constraints.
Universität Paderborn. https://doi.org/10.17619/UNIPB/1-171
bibtex: '@book{Mohr_2016, title={Towards Automated Service Composition Under Quality
Constraints}, DOI={10.17619/UNIPB/1-171},
publisher={Universität Paderborn}, author={Mohr, Felix}, year={2016} }'
chicago: Mohr, Felix. Towards Automated Service Composition Under Quality Constraints.
Universität Paderborn, 2016. https://doi.org/10.17619/UNIPB/1-171.
ieee: F. Mohr, Towards Automated Service Composition Under Quality Constraints.
Universität Paderborn, 2016.
mla: Mohr, Felix. Towards Automated Service Composition Under Quality Constraints.
Universität Paderborn, 2016, doi:10.17619/UNIPB/1-171.
short: F. Mohr, Towards Automated Service Composition Under Quality Constraints,
Universität Paderborn, 2016.
date_created: 2017-10-17T12:41:19Z
date_updated: 2022-01-06T06:51:55Z
department:
- _id: '355'
doi: 10.17619/UNIPB/1-171
project:
- _id: '1'
name: SFB 901
- _id: '10'
name: SFB 901 - Subprojekt B2
- _id: '3'
name: SFB 901 - Project Area B
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Hans
full_name: Kleine Büning, Hans
last_name: Kleine Büning
title: Towards Automated Service Composition Under Quality Constraints
type: dissertation
user_id: '477'
year: '2016'
...
---
_id: '142'
abstract:
- lang: eng
text: For overlay networks, the ability to recover from a variety of problems like
membership changes or faults is a key element to preserve their functionality.
In recent years, various self-stabilizing overlay networks have been proposed
that have the advantage of being able to recover from any illegal state. However,
the vast majority of these networks cannot give any guarantees on its functionality
while the recovery process is going on. We are especially interested in searchability,
i.e., the functionality that search messages for a specific identifier are answered
successfully if a node with that identifier exists in the network. We investigate
overlay networks that are not only self-stabilizing but that also ensure that
monotonic searchability is maintained while the recovery process is going on,
as long as there are no corrupted messages in the system. More precisely, once
a search message from node u to another node v is successfully delivered, all
future search messages from u to v succeed as well. Monotonic searchability was
recently introduced in OPODIS 2015, in which the authors provide a solution for
a simple line topology.We present the first universal approach to maintain monotonic
searchability that is applicable to a wide range of topologies. As the base for
our approach, we introduce a set of primitives for manipulating overlay networks
that allows us to maintain searchability and show how existing protocols can be
transformed to use theses primitives.We complement this result with a generic
search protocol that together with the use of our primitives guarantees monotonic
searchability.As an additional feature, searching existing nodes with the generic
search protocol is as fast as searching a node with any other fixed routing protocol
once the topology has stabilized.
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: Thim Frederik
full_name: Strothmann, Thim Frederik
id: '11319'
last_name: Strothmann
citation:
ama: 'Scheideler C, Setzer A, Strothmann TF. Towards a Universal Approach for Monotonic
Searchability in Self-stabilizing Overlay Networks. In: Proceedings of the
30th International Symposium on Distributed Computing (DISC). LNCS. ; 2016:71--84.
doi:10.1007/978-3-662-53426-7_6'
apa: Scheideler, C., Setzer, A., & Strothmann, T. F. (2016). Towards a Universal
Approach for Monotonic Searchability in Self-stabilizing Overlay Networks. In
Proceedings of the 30th International Symposium on Distributed Computing (DISC)
(pp. 71--84). https://doi.org/10.1007/978-3-662-53426-7_6
bibtex: '@inproceedings{Scheideler_Setzer_Strothmann_2016, series={LNCS}, title={Towards
a Universal Approach for Monotonic Searchability in Self-stabilizing Overlay Networks},
DOI={10.1007/978-3-662-53426-7_6},
booktitle={Proceedings of the 30th International Symposium on Distributed Computing
(DISC)}, author={Scheideler, Christian and Setzer, Alexander and Strothmann, Thim
Frederik}, year={2016}, pages={71--84}, collection={LNCS} }'
chicago: Scheideler, Christian, Alexander Setzer, and Thim Frederik Strothmann.
“Towards a Universal Approach for Monotonic Searchability in Self-Stabilizing
Overlay Networks.” In Proceedings of the 30th International Symposium on Distributed
Computing (DISC), 71--84. LNCS, 2016. https://doi.org/10.1007/978-3-662-53426-7_6.
ieee: C. Scheideler, A. Setzer, and T. F. Strothmann, “Towards a Universal Approach
for Monotonic Searchability in Self-stabilizing Overlay Networks,” in Proceedings
of the 30th International Symposium on Distributed Computing (DISC), 2016,
pp. 71--84.
mla: Scheideler, Christian, et al. “Towards a Universal Approach for Monotonic Searchability
in Self-Stabilizing Overlay Networks.” Proceedings of the 30th International
Symposium on Distributed Computing (DISC), 2016, pp. 71--84, doi:10.1007/978-3-662-53426-7_6.
short: 'C. Scheideler, A. Setzer, T.F. Strothmann, in: Proceedings of the 30th International
Symposium on Distributed Computing (DISC), 2016, pp. 71--84.'
date_created: 2017-10-17T12:41:19Z
date_updated: 2022-01-06T06:51:56Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1007/978-3-662-53426-7_6
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T12:59:29Z
date_updated: 2018-03-21T12:59:29Z
file_id: '1558'
file_name: 142-SchSetStrDISC16.pdf
file_size: 209638
relation: main_file
success: 1
file_date_updated: 2018-03-21T12:59:29Z
has_accepted_license: '1'
language:
- iso: eng
page: 71--84
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 30th International Symposium on Distributed Computing
(DISC)
series_title: LNCS
status: public
title: Towards a Universal Approach for Monotonic Searchability in Self-stabilizing
Overlay Networks
type: conference
user_id: '477'
year: '2016'
...
---
_id: '143'
abstract:
- lang: eng
text: 'We present an efficient parallel algorithm for the general Monotone Circuit
Value Problem (MCVP) with n gates and an underlying graph of bounded genus k.
Our algorithm generalizes a recent result by Limaye et al. who showed that MCVP
with toroidal embedding (genus 1) is in NC when the input contains a toroidal
embedding of the circuit. In addition to extending this result from genus 1 to
any bounded genus k, and unlike the work reported by Limaye et al., we do not
require a precomputed embedding to be given. Most importantly, our results imply
that given a P-complete problem, it is possible to find an algorithm that makes
the problem fall into NC by fixing one or more parameters. Hence, we deduce the
interesting analogy: Fixed Parameter Parallelizable (FPP) is with respect to P-complete
what Fixed Parameter Tractable (FPT) is with respect to NP-complete. Similar work
that uses treewidth as parameter was also presented by Elberfeld et al. in [6].'
author:
- first_name: 'Faisal N. '
full_name: 'Abu-Khzam, Faisal N. '
last_name: Abu-Khzam
- first_name: Shouwei
full_name: Li, Shouwei
last_name: Li
- first_name: Christine
full_name: Markarian, Christine
id: '37612'
last_name: Markarian
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Pavel
full_name: Podlipyan, Pavel
last_name: Podlipyan
citation:
ama: 'Abu-Khzam FN, Li S, Markarian C, Meyer auf der Heide F, Podlipyan P. The Monotone
Circuit Value Problem with Bounded Genus Is in NC. In: Proceedings of the 22nd
International Conference on Computing and Combinatorics (COCOON). LNCS. ;
2016:92-102. doi:10.1007/978-3-319-42634-1_8'
apa: Abu-Khzam, F. N., Li, S., Markarian, C., Meyer auf der Heide, F., & Podlipyan,
P. (2016). The Monotone Circuit Value Problem with Bounded Genus Is in NC. In
Proceedings of the 22nd International Conference on Computing and Combinatorics
(COCOON) (pp. 92–102). https://doi.org/10.1007/978-3-319-42634-1_8
bibtex: '@inproceedings{Abu-Khzam_Li_Markarian_Meyer auf der Heide_Podlipyan_2016,
series={LNCS}, title={The Monotone Circuit Value Problem with Bounded Genus Is
in NC}, DOI={10.1007/978-3-319-42634-1_8},
booktitle={Proceedings of the 22nd International Conference on Computing and Combinatorics
(COCOON)}, author={Abu-Khzam, Faisal N. and Li, Shouwei and Markarian, Christine
and Meyer auf der Heide, Friedhelm and Podlipyan, Pavel}, year={2016}, pages={92–102},
collection={LNCS} }'
chicago: Abu-Khzam, Faisal N. , Shouwei Li, Christine Markarian, Friedhelm Meyer
auf der Heide, and Pavel Podlipyan. “The Monotone Circuit Value Problem with Bounded
Genus Is in NC.” In Proceedings of the 22nd International Conference on Computing
and Combinatorics (COCOON), 92–102. LNCS, 2016. https://doi.org/10.1007/978-3-319-42634-1_8.
ieee: F. N. Abu-Khzam, S. Li, C. Markarian, F. Meyer auf der Heide, and P. Podlipyan,
“The Monotone Circuit Value Problem with Bounded Genus Is in NC,” in Proceedings
of the 22nd International Conference on Computing and Combinatorics (COCOON),
2016, pp. 92–102.
mla: Abu-Khzam, Faisal N., et al. “The Monotone Circuit Value Problem with Bounded
Genus Is in NC.” Proceedings of the 22nd International Conference on Computing
and Combinatorics (COCOON), 2016, pp. 92–102, doi:10.1007/978-3-319-42634-1_8.
short: 'F.N. Abu-Khzam, S. Li, C. Markarian, F. Meyer auf der Heide, P. Podlipyan,
in: Proceedings of the 22nd International Conference on Computing and Combinatorics
(COCOON), 2016, pp. 92–102.'
date_created: 2017-10-17T12:41:19Z
date_updated: 2022-01-06T06:51:57Z
ddc:
- '000'
department:
- _id: '63'
doi: 10.1007/978-3-319-42634-1_8
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T14:20:45Z
date_updated: 2018-11-02T14:20:45Z
file_id: '5269'
file_name: TheMonotoneCircuitValueProblem.pdf
file_size: 234587
relation: main_file
success: 1
file_date_updated: 2018-11-02T14:20:45Z
has_accepted_license: '1'
language:
- iso: eng
page: 92-102
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 22nd International Conference on Computing and Combinatorics
(COCOON)
series_title: LNCS
status: public
title: The Monotone Circuit Value Problem with Bounded Genus Is in NC
type: conference
user_id: '477'
year: '2016'
...
---
_id: '144'
abstract:
- lang: eng
text: 'Following the direction pioneered by Fiat and Papadimitriou in their 2010
paper [12], we study the complexity of deciding the existence of mixed equilibria
for minimization games where players use valuations other than expectation to
evaluate their costs. We consider risk-averse players seeking to minimize the
sum V=E+R of expectationE and a risk valuationR of their costs; R is non-negative
and vanishes exactly when the cost incurred to a player is constant over all choices
of strategies by the other players. In a V-equilibrium, no player could unilaterally
reduce her cost.Say that V has the Weak-Equilibrium-for-Expectation property if
all strategies supported in a player''s best-response mixed strategy incur the
same conditional expectation of her cost. We introduce E-strict concavity and
observe that every E-strictly concave valuation has the Weak-Equilibrium-for-Expectation
property. We focus on a broad class of valuations shown to have the Weak-Equilibrium-for-Expectation
property, which we exploit to prove two main complexity results, the first of
their kind, for the two simplest cases of the problem:• Two strategies: Deciding
the existence of a V-equilibrium is strongly NP-hard for the restricted class
of player-specific scheduling games on two ordered links [22], when choosing R
as (1)Var (variance), or (2)SD (standard deviation), or (3) a concave linear sum
of even moments of small order.• Two players: Deciding the existence of a V-equilibrium
is strongly NP-hard when choosing R as (1)γ⋅Var, or (2)γ⋅SD, where γ>0 is the
risk-coefficient, or choosing V as (3) a convex combination of E+γ⋅Var and the
concave ν-valuationν−1(E(ν(⋅))), where ν(x)=xr, with r≥2. This is a concrete consequence
of a general strong NP-hardness result that only needs the Weak-Equilibrium-for-Expectation
property and a few additional properties for V; its proof involves a reduction
with a single parameter, which can be chosen efficiently so that each valuation
satisfies the additional properties.'
author:
- first_name: Burkhard
full_name: Monien, Burkhard
last_name: Monien
- first_name: Marios
full_name: Mavronicolas, Marios
last_name: Mavronicolas
citation:
ama: Monien B, Mavronicolas M. The complexity of equilibria for risk-modeling valuations.
Theoretical Computer Science. 2016;634:67-96. doi:10.1016/j.tcs.2016.04.013
apa: Monien, B., & Mavronicolas, M. (2016). The complexity of equilibria for
risk-modeling valuations. Theoretical Computer Science, 634, 67–96.
https://doi.org/10.1016/j.tcs.2016.04.013
bibtex: '@article{Monien_Mavronicolas_2016, title={The complexity of equilibria
for risk-modeling valuations}, volume={634}, DOI={10.1016/j.tcs.2016.04.013},
journal={Theoretical Computer Science}, publisher={Elsevier}, author={Monien,
Burkhard and Mavronicolas, Marios}, year={2016}, pages={67–96} }'
chicago: 'Monien, Burkhard, and Marios Mavronicolas. “The Complexity of Equilibria
for Risk-Modeling Valuations.” Theoretical Computer Science 634 (2016):
67–96. https://doi.org/10.1016/j.tcs.2016.04.013.'
ieee: B. Monien and M. Mavronicolas, “The complexity of equilibria for risk-modeling
valuations,” Theoretical Computer Science, vol. 634, pp. 67–96, 2016.
mla: Monien, Burkhard, and Marios Mavronicolas. “The Complexity of Equilibria for
Risk-Modeling Valuations.” Theoretical Computer Science, vol. 634, Elsevier,
2016, pp. 67–96, doi:10.1016/j.tcs.2016.04.013.
short: B. Monien, M. Mavronicolas, Theoretical Computer Science 634 (2016) 67–96.
date_created: 2017-10-17T12:41:20Z
date_updated: 2022-01-06T06:51:59Z
ddc:
- '040'
doi: 10.1016/j.tcs.2016.04.013
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T12:58:42Z
date_updated: 2018-03-21T12:58:42Z
file_id: '1557'
file_name: 144-Monien_Mavronicolas-TCS2016_01.pdf
file_size: 633599
relation: main_file
success: 1
file_date_updated: 2018-03-21T12:58:42Z
has_accepted_license: '1'
intvolume: ' 634'
language:
- iso: eng
page: 67-96
project:
- _id: '1'
name: SFB 901
- _id: '7'
name: SFB 901 - Subprojekt A3
- _id: '2'
name: SFB 901 - Project Area A
publication: Theoretical Computer Science
publisher: Elsevier
status: public
title: The complexity of equilibria for risk-modeling valuations
type: journal_article
user_id: '42447'
volume: 634
year: '2016'
...
---
_id: '145'
abstract:
- lang: eng
text: 'Comparative evaluations of peer-to-peer protocols through simulations are
a viable approach to judge the performance and costs of the individual protocols
in large-scale networks. In order to support this work, we present the peer-to-peer
system simulator PeerfactSim.KOM, which we extended over the last years. PeerfactSim.KOM
comes with an extensive layer model to support various facets and protocols of
peer-to-peer networking. In this article, we describe PeerfactSim.KOM and show
how it can be used for detailed measurements of large-scale peer-to-peer networks.
We enhanced PeerfactSim.KOM with a fine-grained analyzer concept, with exhaustive
automated measurements and gnuplot generators as well as a coordination control
to evaluate sets of experiment setups in parallel. Thus, by configuring all experiments
and protocols only once and starting the simulator, all desired measurements are
performed, analyzed, evaluated, and combined, resulting in a holistic environment
for the comparative evaluation of peer-to-peer systems. An immediate comparison
of different configurations and overlays under different aspects is possible directly
after the execution without any manual post-processing. '
author:
- first_name: Matthias
full_name: Feldotto, Matthias
id: '14052'
last_name: Feldotto
orcid: 0000-0003-1348-6516
- first_name: Kalman
full_name: Graffi, Kalman
last_name: Graffi
citation:
ama: 'Feldotto M, Graffi K. Systematic evaluation of peer-to-peer systems using
PeerfactSim.KOM. Concurrency and Computation: Practice and Experience.
2016;28(5):1655-1677. doi:10.1002/cpe.3716'
apa: 'Feldotto, M., & Graffi, K. (2016). Systematic evaluation of peer-to-peer
systems using PeerfactSim.KOM. Concurrency and Computation: Practice and Experience,
28(5), 1655–1677. https://doi.org/10.1002/cpe.3716'
bibtex: '@article{Feldotto_Graffi_2016, title={Systematic evaluation of peer-to-peer
systems using PeerfactSim.KOM}, volume={28}, DOI={10.1002/cpe.3716},
number={5}, journal={Concurrency and Computation: Practice and Experience}, publisher={Wiley
Online Library}, author={Feldotto, Matthias and Graffi, Kalman}, year={2016},
pages={1655–1677} }'
chicago: 'Feldotto, Matthias, and Kalman Graffi. “Systematic Evaluation of Peer-to-Peer
Systems Using PeerfactSim.KOM.” Concurrency and Computation: Practice and Experience
28, no. 5 (2016): 1655–77. https://doi.org/10.1002/cpe.3716.'
ieee: 'M. Feldotto and K. Graffi, “Systematic evaluation of peer-to-peer systems
using PeerfactSim.KOM,” Concurrency and Computation: Practice and Experience,
vol. 28, no. 5, pp. 1655–1677, 2016.'
mla: 'Feldotto, Matthias, and Kalman Graffi. “Systematic Evaluation of Peer-to-Peer
Systems Using PeerfactSim.KOM.” Concurrency and Computation: Practice and Experience,
vol. 28, no. 5, Wiley Online Library, 2016, pp. 1655–77, doi:10.1002/cpe.3716.'
short: 'M. Feldotto, K. Graffi, Concurrency and Computation: Practice and Experience
28 (2016) 1655–1677.'
date_created: 2017-10-17T12:41:20Z
date_updated: 2022-01-06T06:52:00Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
- _id: '541'
doi: 10.1002/cpe.3716
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T12:57:57Z
date_updated: 2018-03-21T12:57:57Z
file_id: '1556'
file_name: 145-Feldotto_et_al-2016-Concurrency_and_Computation-_Practice_and_Experience.pdf
file_size: 3121363
relation: main_file
success: 1
file_date_updated: 2018-03-21T12:57:57Z
has_accepted_license: '1'
intvolume: ' 28'
issue: '5'
page: 1655-1677
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: 'Concurrency and Computation: Practice and Experience'
publication_status: published
publisher: Wiley Online Library
status: public
title: Systematic evaluation of peer-to-peer systems using PeerfactSim.KOM
type: journal_article
user_id: '14052'
volume: 28
year: '2016'
...
---
_id: '1450'
author:
- first_name: Matthias
full_name: Pelster, Matthias
id: '67265'
last_name: Pelster
orcid: ' https://orcid.org/0000-0001-5740-2420'
- first_name: Vera
full_name: Hagemann, Vera
last_name: Hagemann
- first_name: Franziska
full_name: Laporte Uribe, Franziska
last_name: Laporte Uribe
citation:
ama: Pelster M, Hagemann V, Laporte Uribe F. Key Aspects of a Sustainable Health
Insurance System in Germany. Applied Health Economics and Health Policy.
2016;14(3):293-312. doi:10.1007/s40258-016-0223-8
apa: Pelster, M., Hagemann, V., & Laporte Uribe, F. (2016). Key Aspects of a
Sustainable Health Insurance System in Germany. Applied Health Economics and
Health Policy, 14(3), 293–312. https://doi.org/10.1007/s40258-016-0223-8
bibtex: '@article{Pelster_Hagemann_Laporte Uribe_2016, title={Key Aspects of a Sustainable
Health Insurance System in Germany}, volume={14}, DOI={10.1007/s40258-016-0223-8},
number={3}, journal={Applied Health Economics and Health Policy}, publisher={Springer
Nature}, author={Pelster, Matthias and Hagemann, Vera and Laporte Uribe, Franziska},
year={2016}, pages={293–312} }'
chicago: 'Pelster, Matthias, Vera Hagemann, and Franziska Laporte Uribe. “Key Aspects
of a Sustainable Health Insurance System in Germany.” Applied Health Economics
and Health Policy 14, no. 3 (2016): 293–312. https://doi.org/10.1007/s40258-016-0223-8.'
ieee: M. Pelster, V. Hagemann, and F. Laporte Uribe, “Key Aspects of a Sustainable
Health Insurance System in Germany,” Applied Health Economics and Health Policy,
vol. 14, no. 3, pp. 293–312, 2016.
mla: Pelster, Matthias, et al. “Key Aspects of a Sustainable Health Insurance System
in Germany.” Applied Health Economics and Health Policy, vol. 14, no. 3,
Springer Nature, 2016, pp. 293–312, doi:10.1007/s40258-016-0223-8.
short: M. Pelster, V. Hagemann, F. Laporte Uribe, Applied Health Economics and Health
Policy 14 (2016) 293–312.
date_created: 2018-03-20T11:32:44Z
date_updated: 2022-01-06T06:52:00Z
department:
- _id: '186'
- _id: '578'
doi: 10.1007/s40258-016-0223-8
extern: '1'
intvolume: ' 14'
issue: '3'
page: 293-312
publication: Applied Health Economics and Health Policy
publication_identifier:
issn:
- 1175-5652
- 1179-1896
publication_status: published
publisher: Springer Nature
status: public
title: Key Aspects of a Sustainable Health Insurance System in Germany
type: journal_article
user_id: '67265'
volume: 14
year: '2016'
...
---
_id: '1455'
author:
- first_name: Thomas
full_name: Zentgraf, Thomas
id: '30525'
last_name: Zentgraf
orcid: 0000-0002-8662-1101
citation:
ama: Zentgraf T. Doppler-Effekt für rotierende Objekte. Physik in unserer Zeit.
2016;47(4):163-164. doi:10.1002/piuz.201690063
apa: Zentgraf, T. (2016). Doppler-Effekt für rotierende Objekte. Physik in Unserer
Zeit, 47(4), 163–164. https://doi.org/10.1002/piuz.201690063
bibtex: '@article{Zentgraf_2016, title={Doppler-Effekt für rotierende Objekte},
volume={47}, DOI={10.1002/piuz.201690063},
number={4}, journal={Physik in unserer Zeit}, publisher={Wiley-Blackwell}, author={Zentgraf,
Thomas}, year={2016}, pages={163–164} }'
chicago: 'Zentgraf, Thomas. “Doppler-Effekt Für Rotierende Objekte.” Physik in
Unserer Zeit 47, no. 4 (2016): 163–64. https://doi.org/10.1002/piuz.201690063.'
ieee: T. Zentgraf, “Doppler-Effekt für rotierende Objekte,” Physik in unserer
Zeit, vol. 47, no. 4, pp. 163–164, 2016.
mla: Zentgraf, Thomas. “Doppler-Effekt Für Rotierende Objekte.” Physik in Unserer
Zeit, vol. 47, no. 4, Wiley-Blackwell, 2016, pp. 163–64, doi:10.1002/piuz.201690063.
short: T. Zentgraf, Physik in Unserer Zeit 47 (2016) 163–164.
date_created: 2018-03-20T18:20:07Z
date_updated: 2022-01-06T06:52:02Z
department:
- _id: '15'
- _id: '230'
doi: 10.1002/piuz.201690063
intvolume: ' 47'
issue: '4'
page: 163-164
publication: Physik in unserer Zeit
publication_identifier:
issn:
- 0031-9252
publication_status: published
publisher: Wiley-Blackwell
status: public
title: Doppler-Effekt für rotierende Objekte
type: journal_article
user_id: '30525'
volume: 47
year: '2016'
...
---
_id: '131'
author:
- first_name: Annabel
full_name: Holzmann, Annabel
last_name: Holzmann
citation:
ama: Holzmann A. Wenn 1+1 nicht 2 ergibt – Gestaltungsmöglichkeiten Einzelbewertungen
in Reputationssystemen zu Gesamtbewertungen zu aggregieren. Universität Paderborn;
2016.
apa: Holzmann, A. (2016). Wenn 1+1 nicht 2 ergibt – Gestaltungsmöglichkeiten
Einzelbewertungen in Reputationssystemen zu Gesamtbewertungen zu aggregieren.
Universität Paderborn.
bibtex: '@book{Holzmann_2016, title={Wenn 1+1 nicht 2 ergibt – Gestaltungsmöglichkeiten
Einzelbewertungen in Reputationssystemen zu Gesamtbewertungen zu aggregieren},
publisher={Universität Paderborn}, author={Holzmann, Annabel}, year={2016} }'
chicago: Holzmann, Annabel. Wenn 1+1 nicht 2 ergibt – Gestaltungsmöglichkeiten
Einzelbewertungen in Reputationssystemen zu Gesamtbewertungen zu aggregieren.
Universität Paderborn, 2016.
ieee: A. Holzmann, Wenn 1+1 nicht 2 ergibt – Gestaltungsmöglichkeiten Einzelbewertungen
in Reputationssystemen zu Gesamtbewertungen zu aggregieren. Universität Paderborn,
2016.
mla: Holzmann, Annabel. Wenn 1+1 nicht 2 ergibt – Gestaltungsmöglichkeiten Einzelbewertungen
in Reputationssystemen zu Gesamtbewertungen zu aggregieren. Universität Paderborn,
2016.
short: A. Holzmann, Wenn 1+1 nicht 2 ergibt – Gestaltungsmöglichkeiten Einzelbewertungen
in Reputationssystemen zu Gesamtbewertungen zu aggregieren, Universität Paderborn,
2016.
date_created: 2017-10-17T12:41:17Z
date_updated: 2022-01-06T06:51:28Z
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '8'
name: SFB 901 - Subprojekt A4
- _id: '2'
name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
title: Wenn 1+1 nicht 2 ergibt – Gestaltungsmöglichkeiten Einzelbewertungen in Reputationssystemen
zu Gesamtbewertungen zu aggregieren
type: bachelorsthesis
user_id: '477'
year: '2016'
...
---
_id: '13151'
author:
- first_name: Tobias
full_name: Graf, Tobias
last_name: Graf
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
citation:
ama: 'Graf T, Platzner M. Using Deep Convolutional Neural Networks in Monte Carlo
Tree Search. In: Computer and Games. ; 2016.'
apa: Graf, T., & Platzner, M. (2016). Using Deep Convolutional Neural Networks
in Monte Carlo Tree Search. In Computer and Games.
bibtex: '@inproceedings{Graf_Platzner_2016, title={Using Deep Convolutional Neural
Networks in Monte Carlo Tree Search}, booktitle={Computer and Games}, author={Graf,
Tobias and Platzner, Marco}, year={2016} }'
chicago: Graf, Tobias, and Marco Platzner. “Using Deep Convolutional Neural Networks
in Monte Carlo Tree Search.” In Computer and Games, 2016.
ieee: T. Graf and M. Platzner, “Using Deep Convolutional Neural Networks in Monte
Carlo Tree Search,” in Computer and Games, 2016.
mla: Graf, Tobias, and Marco Platzner. “Using Deep Convolutional Neural Networks
in Monte Carlo Tree Search.” Computer and Games, 2016.
short: 'T. Graf, M. Platzner, in: Computer and Games, 2016.'
date_created: 2019-09-09T09:01:09Z
date_updated: 2022-01-06T06:51:29Z
department:
- _id: '78'
language:
- iso: eng
project:
- _id: '52'
name: Computing Resources Provided by the Paderborn Center for Parallel Computing
publication: Computer and Games
status: public
title: Using Deep Convolutional Neural Networks in Monte Carlo Tree Search
type: conference
user_id: '398'
year: '2016'
...
---
_id: '13152'
author:
- first_name: Tobias
full_name: Graf, Tobias
last_name: Graf
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
citation:
ama: 'Graf T, Platzner M. Monte-Carlo Simulation Balancing Revisited. In: IEEE
Computational Intelligence and Games. ; 2016.'
apa: Graf, T., & Platzner, M. (2016). Monte-Carlo Simulation Balancing Revisited.
In IEEE Computational Intelligence and Games.
bibtex: '@inproceedings{Graf_Platzner_2016, title={Monte-Carlo Simulation Balancing
Revisited}, booktitle={IEEE Computational Intelligence and Games}, author={Graf,
Tobias and Platzner, Marco}, year={2016} }'
chicago: Graf, Tobias, and Marco Platzner. “Monte-Carlo Simulation Balancing Revisited.”
In IEEE Computational Intelligence and Games, 2016.
ieee: T. Graf and M. Platzner, “Monte-Carlo Simulation Balancing Revisited,” in
IEEE Computational Intelligence and Games, 2016.
mla: Graf, Tobias, and Marco Platzner. “Monte-Carlo Simulation Balancing Revisited.”
IEEE Computational Intelligence and Games, 2016.
short: 'T. Graf, M. Platzner, in: IEEE Computational Intelligence and Games, 2016.'
date_created: 2019-09-09T09:06:39Z
date_updated: 2022-01-06T06:51:29Z
department:
- _id: '78'
language:
- iso: eng
project:
- _id: '52'
name: Computing Resources Provided by the Paderborn Center for Parallel Computing
publication: IEEE Computational Intelligence and Games
status: public
title: Monte-Carlo Simulation Balancing Revisited
type: conference
user_id: '398'
year: '2016'
...
---
_id: '13164'
author:
- first_name: Frithjof H.
full_name: Dubberke, Frithjof H.
last_name: Dubberke
- first_name: Markus
full_name: Riepold, Markus
last_name: Riepold
- first_name: Elmar
full_name: Baumhögger, Elmar
id: '15164'
last_name: Baumhögger
- first_name: Jadran
full_name: Vrabec, Jadran
last_name: Vrabec
citation:
ama: Dubberke FH, Riepold M, Baumhögger E, Vrabec J. Speed of Sound of Oxygen in
Supercritical States up to 500 K and 100 MPa. Journal of Chemical & Engineering
Data. 2016:1632-1636. doi:10.1021/acs.jced.5b01007
apa: Dubberke, F. H., Riepold, M., Baumhögger, E., & Vrabec, J. (2016). Speed
of Sound of Oxygen in Supercritical States up to 500 K and 100 MPa. Journal
of Chemical & Engineering Data, 1632–1636. https://doi.org/10.1021/acs.jced.5b01007
bibtex: '@article{Dubberke_Riepold_Baumhögger_Vrabec_2016, title={Speed of Sound
of Oxygen in Supercritical States up to 500 K and 100 MPa}, DOI={10.1021/acs.jced.5b01007},
journal={Journal of Chemical & Engineering Data}, author={Dubberke, Frithjof
H. and Riepold, Markus and Baumhögger, Elmar and Vrabec, Jadran}, year={2016},
pages={1632–1636} }'
chicago: Dubberke, Frithjof H., Markus Riepold, Elmar Baumhögger, and Jadran Vrabec.
“Speed of Sound of Oxygen in Supercritical States up to 500 K and 100 MPa.” Journal
of Chemical & Engineering Data, 2016, 1632–36. https://doi.org/10.1021/acs.jced.5b01007.
ieee: F. H. Dubberke, M. Riepold, E. Baumhögger, and J. Vrabec, “Speed of Sound
of Oxygen in Supercritical States up to 500 K and 100 MPa,” Journal of Chemical
& Engineering Data, pp. 1632–1636, 2016.
mla: Dubberke, Frithjof H., et al. “Speed of Sound of Oxygen in Supercritical States
up to 500 K and 100 MPa.” Journal of Chemical & Engineering Data, 2016,
pp. 1632–36, doi:10.1021/acs.jced.5b01007.
short: F.H. Dubberke, M. Riepold, E. Baumhögger, J. Vrabec, Journal of Chemical
& Engineering Data (2016) 1632–1636.
date_created: 2019-09-09T15:17:09Z
date_updated: 2022-01-06T06:51:29Z
department:
- _id: '155'
doi: 10.1021/acs.jced.5b01007
language:
- iso: eng
page: 1632-1636
publication: Journal of Chemical & Engineering Data
publication_identifier:
issn:
- 0021-9568
- 1520-5134
publication_status: published
status: public
title: Speed of Sound of Oxygen in Supercritical States up to 500 K and 100 MPa
type: journal_article
user_id: '15164'
year: '2016'
...