---
_id: '9270'
abstract:
- lang: eng
text: "As 5G and network function virtualization (NFV) are maturing, it becomes
crucial to demonstrate their feasibility and benefits by means of vertical scenarios.
While 5GPPP has identified smart manufacturing as one of the most important vertical
industries, there is still a lack of specific, practical use cases. \r\n\r\nUsing
the experience from a large-scale manufacturing company, Weidm{\\\"u}ller Group,
we present a detailed use case that reflects the needs of real-world manufacturers.
We also propose an architecture with specific network services and virtual network
functions (VNFs) that realize the use case in practice. As a proof of concept,
we implement the required services and deploy them on an emulation-based prototyping
platform. Our experimental results indicate that a fully virtualized smart manufacturing
use case is not only feasible but also reduces machine interconnection and configuration
time and thus improves productivity by orders of magnitude."
author:
- first_name: Stefan Balthasar
full_name: Schneider, Stefan Balthasar
id: '35343'
last_name: Schneider
orcid: 0000-0001-8210-4011
- first_name: Manuel
full_name: Peuster, Manuel
id: '13271'
last_name: Peuster
- first_name: Daniel
full_name: Behnke, Daniel
last_name: Behnke
- first_name: Müller
full_name: Marcel, Müller
last_name: Marcel
- first_name: Patrick-Benjamin
full_name: Bök, Patrick-Benjamin
last_name: Bök
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: 'Schneider SB, Peuster M, Behnke D, Marcel M, Bök P-B, Karl H. Putting 5G into
Production: Realizing a Smart Manufacturing Vertical Scenario. In: European
Conference on Networks and Communications (EuCNC). Valencia, Spain: IEEE;
2019. doi:10.1109/eucnc.2019.8802016'
apa: 'Schneider, S. B., Peuster, M., Behnke, D., Marcel, M., Bök, P.-B., & Karl,
H. (2019). Putting 5G into Production: Realizing a Smart Manufacturing Vertical
Scenario. In European Conference on Networks and Communications (EuCNC).
Valencia, Spain: IEEE. https://doi.org/10.1109/eucnc.2019.8802016'
bibtex: '@inproceedings{Schneider_Peuster_Behnke_Marcel_Bök_Karl_2019, place={Valencia,
Spain}, title={Putting 5G into Production: Realizing a Smart Manufacturing Vertical
Scenario}, DOI={10.1109/eucnc.2019.8802016},
booktitle={European Conference on Networks and Communications (EuCNC)}, publisher={IEEE},
author={Schneider, Stefan Balthasar and Peuster, Manuel and Behnke, Daniel and
Marcel, Müller and Bök, Patrick-Benjamin and Karl, Holger}, year={2019} }'
chicago: 'Schneider, Stefan Balthasar, Manuel Peuster, Daniel Behnke, Müller Marcel,
Patrick-Benjamin Bök, and Holger Karl. “Putting 5G into Production: Realizing
a Smart Manufacturing Vertical Scenario.” In European Conference on Networks
and Communications (EuCNC). Valencia, Spain: IEEE, 2019. https://doi.org/10.1109/eucnc.2019.8802016.'
ieee: 'S. B. Schneider, M. Peuster, D. Behnke, M. Marcel, P.-B. Bök, and H. Karl,
“Putting 5G into Production: Realizing a Smart Manufacturing Vertical Scenario,”
in European Conference on Networks and Communications (EuCNC), 2019.'
mla: 'Schneider, Stefan Balthasar, et al. “Putting 5G into Production: Realizing
a Smart Manufacturing Vertical Scenario.” European Conference on Networks and
Communications (EuCNC), IEEE, 2019, doi:10.1109/eucnc.2019.8802016.'
short: 'S.B. Schneider, M. Peuster, D. Behnke, M. Marcel, P.-B. Bök, H. Karl, in:
European Conference on Networks and Communications (EuCNC), IEEE, Valencia, Spain,
2019.'
date_created: 2019-04-23T09:27:06Z
date_updated: 2022-01-06T07:04:12Z
ddc:
- '000'
department:
- _id: '75'
doi: 10.1109/eucnc.2019.8802016
file:
- access_level: open_access
content_type: application/pdf
creator: stschn
date_created: 2019-04-23T09:29:49Z
date_updated: 2019-12-12T09:15:57Z
file_id: '9272'
file_name: preprint_ris_with_header.pdf
file_size: 374397
relation: main_file
file_date_updated: 2019-12-12T09:15:57Z
has_accepted_license: '1'
keyword:
- 5g
- vertical
- smart manufacturing
- nfv
language:
- iso: eng
main_file_link:
- url: https://ieeexplore.ieee.org/document/8802016
oa: '1'
place: Valencia, Spain
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '16'
name: SFB 901 - Subproject C4
- _id: '28'
grant_number: '761493'
name: 5G Development and validation platform for global industry-specific network
services and Apps
publication: European Conference on Networks and Communications (EuCNC)
publisher: IEEE
status: public
title: 'Putting 5G into Production: Realizing a Smart Manufacturing Vertical Scenario'
type: conference
user_id: '35343'
year: '2019'
...
---
_id: '9275'
abstract:
- lang: eng
text: "In the last years, store-oriented software ecosystems are gaining\r\nmore
and more attention from a business perspective. In these ecosystems,\r\nthird-party
developers upload extensions to a store which can be\r\ndownloaded by end users.
While the functional scope of such ecosystems\r\nis relatively similar, the underlying
business models differ greatly in and\r\nbetween their different product domains
(e.g. Mobile Phone, Smart TV).\r\nThis variability, in turn, makes it challenging
for store providers to \r\nfind a business model that fits their own needs.\r\nTo
handle this variability, we introduce the Business Variability Model\r\n(BVM)
for modeling business model decisions. The basis of these decisions\r\nis the
analysis of 60 store-oriented software ecosystems in eight\r\ndifferent product
domains. We map their business model decisions to the\r\nBusiness Model Canvas,
condense them to a variability model and discuss\r\nparticular variants and their
dependencies. Our work provides store\r\nproviders a new approach for modeling
business model decisions together\r\nwith insights of existing business models.
This, in turn, supports them\r\nin creating new and improving existing business
models."
author:
- first_name: Sebastian
full_name: Gottschalk, Sebastian
id: '47208'
last_name: Gottschalk
- first_name: Florian
full_name: Rittmeier, Florian
id: '5281'
last_name: Rittmeier
- first_name: Gregor
full_name: Engels, Gregor
id: '107'
last_name: Engels
citation:
ama: 'Gottschalk S, Rittmeier F, Engels G. Business Models of Store-Oriented Software
Ecosystems: A Variability Modeling Approach. In: Shishkov B, ed. Business Modeling
and Software Design. Lecture Notes in Business Information Processing. Springer
International Publishing; 2019:153-169. doi:10.1007/978-3-030-24854-3_10'
apa: 'Gottschalk, S., Rittmeier, F., & Engels, G. (2019). Business Models of
Store-Oriented Software Ecosystems: A Variability Modeling Approach. In B. Shishkov
(Ed.), Business Modeling and Software Design (pp. 153–169). Lisbon: Springer
International Publishing. https://doi.org/10.1007/978-3-030-24854-3_10'
bibtex: '@inproceedings{Gottschalk_Rittmeier_Engels_2019, series={Lecture Notes
in Business Information Processing}, title={Business Models of Store-Oriented
Software Ecosystems: A Variability Modeling Approach}, DOI={10.1007/978-3-030-24854-3_10},
booktitle={Business Modeling and Software Design}, publisher={Springer International
Publishing}, author={Gottschalk, Sebastian and Rittmeier, Florian and Engels,
Gregor}, editor={Shishkov, BorisEditor}, year={2019}, pages={153–169}, collection={Lecture
Notes in Business Information Processing} }'
chicago: 'Gottschalk, Sebastian, Florian Rittmeier, and Gregor Engels. “Business
Models of Store-Oriented Software Ecosystems: A Variability Modeling Approach.”
In Business Modeling and Software Design, edited by Boris Shishkov, 153–69.
Lecture Notes in Business Information Processing. Springer International Publishing,
2019. https://doi.org/10.1007/978-3-030-24854-3_10.'
ieee: 'S. Gottschalk, F. Rittmeier, and G. Engels, “Business Models of Store-Oriented
Software Ecosystems: A Variability Modeling Approach,” in Business Modeling
and Software Design, Lisbon, 2019, pp. 153–169.'
mla: 'Gottschalk, Sebastian, et al. “Business Models of Store-Oriented Software
Ecosystems: A Variability Modeling Approach.” Business Modeling and Software
Design, edited by Boris Shishkov, Springer International Publishing, 2019,
pp. 153–69, doi:10.1007/978-3-030-24854-3_10.'
short: 'S. Gottschalk, F. Rittmeier, G. Engels, in: B. Shishkov (Ed.), Business
Modeling and Software Design, Springer International Publishing, 2019, pp. 153–169.'
conference:
end_date: 2019-07-03
location: Lisbon
name: International Symposium on Business Modeling and Software Design
start_date: 2019-07-01
date_created: 2019-04-23T11:47:23Z
date_updated: 2022-01-06T07:04:12Z
ddc:
- '000'
department:
- _id: '66'
doi: 10.1007/978-3-030-24854-3_10
editor:
- first_name: Boris
full_name: Shishkov, Boris
last_name: Shishkov
file:
- access_level: open_access
content_type: application/pdf
creator: sego
date_created: 2019-11-14T14:47:32Z
date_updated: 2019-12-06T13:47:58Z
file_id: '14988'
file_name: BMSD.pdf
file_size: 546764
relation: main_file
file_date_updated: 2019-12-06T13:47:58Z
has_accepted_license: '1'
keyword:
- Software Ecosystems
- Business Models
- Variabilities
language:
- iso: eng
main_file_link:
- url: https://link.springer.com/chapter/10.1007/978-3-030-24854-3_10
oa: '1'
page: 153-169
project:
- _id: '4'
name: SFB 901 - Project Area C
- _id: '1'
name: SFB 901
- _id: '17'
name: SFB 901 - Subproject C5
publication: Business Modeling and Software Design
publication_identifier:
unknown:
- 978-3-030-24853-6
publication_status: published
publisher: Springer International Publishing
series_title: Lecture Notes in Business Information Processing
status: public
title: 'Business Models of Store-Oriented Software Ecosystems: A Variability Modeling
Approach'
type: conference
user_id: '47208'
year: '2019'
...
---
_id: '7752'
author:
- first_name: Arnab
full_name: Sharma, Arnab
id: '67200'
last_name: Sharma
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Sharma A, Wehrheim H. Testing Balancedness of ML Algorithms. In: Proceedings
of the Software Engineering Conference (SE). Vol P-292. Lecture Notes in Informatics
(LNI). Stuttgart: Gesellschaft für Informatik e.V. (GI); 2019:157-158.'
apa: 'Sharma, A., & Wehrheim, H. (2019). Testing Balancedness of ML Algorithms.
In Proceedings of the Software Engineering Conference (SE) (Vol. P-292,
pp. 157–158). Stuttgart: Gesellschaft für Informatik e.V. (GI).'
bibtex: '@inproceedings{Sharma_Wehrheim_2019, place={Stuttgart}, series={Lecture
Notes in Informatics (LNI)}, title={Testing Balancedness of ML Algorithms}, volume={P-292},
booktitle={Proceedings of the Software Engineering Conference (SE)}, publisher={Gesellschaft
für Informatik e.V. (GI)}, author={Sharma, Arnab and Wehrheim, Heike}, year={2019},
pages={157–158}, collection={Lecture Notes in Informatics (LNI)} }'
chicago: 'Sharma, Arnab, and Heike Wehrheim. “Testing Balancedness of ML Algorithms.”
In Proceedings of the Software Engineering Conference (SE), P-292:157–58.
Lecture Notes in Informatics (LNI). Stuttgart: Gesellschaft für Informatik e.V.
(GI), 2019.'
ieee: A. Sharma and H. Wehrheim, “Testing Balancedness of ML Algorithms,” in Proceedings
of the Software Engineering Conference (SE), Stuttgart, 2019, vol. P-292,
pp. 157–158.
mla: Sharma, Arnab, and Heike Wehrheim. “Testing Balancedness of ML Algorithms.”
Proceedings of the Software Engineering Conference (SE), vol. P-292, Gesellschaft
für Informatik e.V. (GI), 2019, pp. 157–58.
short: 'A. Sharma, H. Wehrheim, in: Proceedings of the Software Engineering Conference
(SE), Gesellschaft für Informatik e.V. (GI), Stuttgart, 2019, pp. 157–158.'
conference:
end_date: 2019-02-22
location: Stuttgart
name: Software Engineering(SE)
start_date: 2019-02-18
date_created: 2019-02-19T08:28:23Z
date_updated: 2022-01-06T07:03:45Z
department:
- _id: '34'
- _id: '77'
language:
- iso: eng
page: 157 - 158
place: Stuttgart
project:
- _id: '3'
name: SFB 901 - Project Area B
- _id: '11'
name: SFB 901 - Subproject B3
- _id: '1'
name: SFB 901
publication: Proceedings of the Software Engineering Conference (SE)
publication_identifier:
isbn:
- 978-3-88579-686-2
publication_status: published
publisher: Gesellschaft für Informatik e.V. (GI)
series_title: Lecture Notes in Informatics (LNI)
status: public
title: Testing Balancedness of ML Algorithms
type: conference_abstract
user_id: '477'
volume: P-292
year: '2019'
...
---
_id: '80'
abstract:
- lang: eng
text: "Models on network formation have often been extended to include the potential
of network disruption in recent years. Whereas the theoretical research on network
formation under the threat of disruption has thus gained prominence, hardly any
experimental research exists so far. In this paper, we therefore experimentally
study the emergence of networks including the aspect of a known external threat
by relating theoretical predictions by Dzuibiński and Goyal (2013) to actual observed
behaviour. We deal with the question if subjects in the role of a strategic Designer
are able to form safe networks for least costs while facing a strategic Adversary
who is going to attack their networks. Varying the costs for protecting nodes,
we designed and tested two treatments with different predictions for the equilibrium
network and investigated whether one of the least cost equilibrium networks was
more likely to be reached. Furthermore, the influence of the subjects’ farsightedness
on their decision-making process was elicited and analysed.\r\n\r\nWe find that
while subjects are able to build safe networks in both treatments, equilibrium
networks are only built in one of the two treatments. In the other treatment,
predominantly safe networks are built but they are not for least costs. Additionally,
we find that farsightedness –as measured in our experiment– has no influence on
whether subjects are able to build safe or least cost equilibrium networks. Two
robustness settings with a reduced external threat or more liberties to modify
the initial networks qualitatively confirm our results. Overall, in this experiment
observed behaviour is only partially in line with the theoretical predictions
by Dzuibiński and Goyal (2013)."
article_type: original
author:
- first_name: Angelika Elfriede
full_name: Endres, Angelika Elfriede
id: '48794'
last_name: Endres
- first_name: Sonja
full_name: Recker, Sonja
last_name: Recker
- first_name: Behnud
full_name: Mir Djawadi, Behnud
id: '26032'
last_name: Mir Djawadi
orcid: 0000-0002-6271-5912
- first_name: Britta
full_name: Hoyer, Britta
id: '42447'
last_name: Hoyer
citation:
ama: 'Endres AE, Recker S, Mir Djawadi B, Hoyer B. Network Formation and Disruption
- An Experiment: Are equilibrium networks too complex? Journal of Economic
Behavior and Organization . 2019;157:708-734. doi:10.1016/j.jebo.2018.11.004'
apa: 'Endres, A. E., Recker, S., Mir Djawadi, B., & Hoyer, B. (2019). Network
Formation and Disruption - An Experiment: Are equilibrium networks too complex?
Journal of Economic Behavior and Organization , 157, 708–734. https://doi.org/10.1016/j.jebo.2018.11.004'
bibtex: '@article{Endres_Recker_Mir Djawadi_Hoyer_2019, title={Network Formation
and Disruption - An Experiment: Are equilibrium networks too complex?}, volume={157},
DOI={10.1016/j.jebo.2018.11.004},
journal={Journal of Economic Behavior and Organization }, author={Endres, Angelika
Elfriede and Recker, Sonja and Mir Djawadi, Behnud and Hoyer, Britta}, year={2019},
pages={708–734} }'
chicago: 'Endres, Angelika Elfriede, Sonja Recker, Behnud Mir Djawadi, and Britta
Hoyer. “Network Formation and Disruption - An Experiment: Are Equilibrium Networks
Too Complex?” Journal of Economic Behavior and Organization 157 (2019):
708–34. https://doi.org/10.1016/j.jebo.2018.11.004.'
ieee: 'A. E. Endres, S. Recker, B. Mir Djawadi, and B. Hoyer, “Network Formation
and Disruption - An Experiment: Are equilibrium networks too complex?,” Journal
of Economic Behavior and Organization , vol. 157, pp. 708–734, 2019.'
mla: 'Endres, Angelika Elfriede, et al. “Network Formation and Disruption - An Experiment:
Are Equilibrium Networks Too Complex?” Journal of Economic Behavior and Organization
, vol. 157, 2019, pp. 708–34, doi:10.1016/j.jebo.2018.11.004.'
short: A.E. Endres, S. Recker, B. Mir Djawadi, B. Hoyer, Journal of Economic Behavior
and Organization 157 (2019) 708–734.
date_created: 2017-10-17T12:41:07Z
date_updated: 2022-01-06T07:03:49Z
ddc:
- '330'
department:
- _id: '280'
- _id: '179'
- _id: '204'
- _id: '475'
doi: 10.1016/j.jebo.2018.11.004
file:
- access_level: closed
content_type: application/pdf
creator: bhoyer
date_created: 2018-11-19T07:39:42Z
date_updated: 2018-11-19T07:39:42Z
file_id: '5723'
file_name: Publication Jebo.pdf
file_size: 1569991
relation: main_file
file_date_updated: 2018-11-19T07:39:42Z
has_accepted_license: '1'
intvolume: ' 157'
language:
- iso: eng
page: 708-734
project:
- _id: '1'
name: SFB 901
- _id: '7'
name: SFB 901 - Subprojekt A3
- _id: '8'
name: SFB 901 - Subprojekt A4
- _id: '2'
name: SFB 901 - Project Area A
publication: 'Journal of Economic Behavior and Organization '
publication_status: epub_ahead
status: public
title: 'Network Formation and Disruption - An Experiment: Are equilibrium networks
too complex?'
type: journal_article
user_id: '42447'
volume: 157
year: '2019'
...
---
_id: '8080'
abstract:
- lang: eng
text: This thesis investigates approximate pure Nash equilibria in different game-theoretic
models. In such an outcome, no player can improve her objective by more than a
given factor through a deviation to another strategy. In the first part, we investigate
two variants of Congestion Games in which the existence of pure Nash equilibria
is guaranteed through a potential function argument. However, the computation
of such equilibria might be hard. We construct and analyze approximation algorithms
that enable the computation of states with low approximation factors in polynomial
time. To show their guarantees we use sub games among players, bound the potential
function values of arbitrary states and exploit a connection between Shapley and
proportional cost shares. Furthermore, we apply and analyze sampling techniques
for the computation of approximate Shapley values in different settings. In the
second part, we concentrate on the existence of approximate pure Nash equilibria
in games in which no pure Nash equilibria exist in general. In the model of Coevolving
Opinion Formation Games, we bound the approximation guarantees for natural states
nearly independent of the specific definition of the players' neighborhoods by
applying a concept of virtual costs. For the special case of only one influential
neighbor, we even show lower approximation factors for a natural strategy. Then,
we investigate a two-sided Facility Location Game among facilities and clients
on a line with an objective function consisting of distance and load. We show
tight bounds on the approximation factor for settings with three facilities and
infinitely many clients. For the general scenario with an arbitrary number of
facilities, we bound the approximation factor for two promising candidates, namely
facilities that are uniformly distributed and which are paired.
author:
- first_name: Matthias
full_name: Feldotto, Matthias
id: '14052'
last_name: Feldotto
orcid: 0000-0003-1348-6516
citation:
ama: Feldotto M. Approximate Pure Nash Equilibria in Congestion, Opinion Formation
and Facility Location Games. Universität Paderborn; 2019. doi:10.17619/UNIPB/1-588
apa: Feldotto, M. (2019). Approximate Pure Nash Equilibria in Congestion, Opinion
Formation and Facility Location Games. Universität Paderborn. https://doi.org/10.17619/UNIPB/1-588
bibtex: '@book{Feldotto_2019, place={Universität Paderborn}, title={Approximate
Pure Nash Equilibria in Congestion, Opinion Formation and Facility Location Games},
DOI={10.17619/UNIPB/1-588},
author={Feldotto, Matthias}, year={2019} }'
chicago: Feldotto, Matthias. Approximate Pure Nash Equilibria in Congestion,
Opinion Formation and Facility Location Games. Universität Paderborn, 2019.
https://doi.org/10.17619/UNIPB/1-588.
ieee: M. Feldotto, Approximate Pure Nash Equilibria in Congestion, Opinion Formation
and Facility Location Games. Universität Paderborn, 2019.
mla: Feldotto, Matthias. Approximate Pure Nash Equilibria in Congestion, Opinion
Formation and Facility Location Games. 2019, doi:10.17619/UNIPB/1-588.
short: M. Feldotto, Approximate Pure Nash Equilibria in Congestion, Opinion Formation
and Facility Location Games, Universität Paderborn, 2019.
date_created: 2019-02-25T13:03:02Z
date_updated: 2022-01-06T07:03:50Z
ddc:
- '000'
department:
- _id: '541'
- _id: '63'
doi: 10.17619/UNIPB/1-588
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2019-03-28T13:40:51Z
date_updated: 2019-03-28T13:40:51Z
file_id: '8715'
file_name: Approximate Pure Nash Equilibria in Congestion, Opinion Formation and
Facility Location Games.pdf
file_size: 3116177
relation: main_file
success: 1
file_date_updated: 2019-03-28T13:40:51Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- url: http://digital.ub.uni-paderborn.de/hs/download/pdf/3005508?originalFilename=true
place: Universität Paderborn
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '7'
name: SFB 901 - Subproject A3
status: public
supervisor:
- first_name: Alexander
full_name: Skopalik, Alexander
id: '40384'
last_name: Skopalik
title: Approximate Pure Nash Equilibria in Congestion, Opinion Formation and Facility
Location Games
type: dissertation
user_id: '15415'
year: '2019'
...
---
_id: '8113'
abstract:
- lang: eng
text: "The ongoing softwarization of networks creates a big need for automated testing
solutions to ensure service quality. This becomes even more important if agile
environments with short time to market and high demands, in terms of service performance
and availability, are considered.\r\nIn this paper, we introduce a novel testing
solution for virtualized, microservice-based network functions and services, which
we base on TTCN-3, a well known testing language defined by the European standards
institute (ETSI). We use TTCN-3 not only for functional testing but also answer
the question whether TTCN-3 can be used for performance profiling tasks as well.
Finally, we demonstrate the proposed concepts and solutions in a case study using
our open-source prototype to test and profile a chained network service."
author:
- first_name: Manuel
full_name: Peuster, Manuel
id: '13271'
last_name: Peuster
- first_name: Christian
full_name: Dröge, Christian
last_name: Dröge
- first_name: Clemens
full_name: Boos, Clemens
last_name: Boos
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: Peuster M, Dröge C, Boos C, Karl H. Joint testing and profiling of microservice-based
network services using TTCN-3. ICT Express. 2019. doi:10.1016/j.icte.2019.02.001
apa: Peuster, M., Dröge, C., Boos, C., & Karl, H. (2019). Joint testing and
profiling of microservice-based network services using TTCN-3. ICT Express.
https://doi.org/10.1016/j.icte.2019.02.001
bibtex: '@article{Peuster_Dröge_Boos_Karl_2019, title={Joint testing and profiling
of microservice-based network services using TTCN-3}, DOI={10.1016/j.icte.2019.02.001},
journal={ICT Express}, publisher={Elsevier BV}, author={Peuster, Manuel and Dröge,
Christian and Boos, Clemens and Karl, Holger}, year={2019} }'
chicago: Peuster, Manuel, Christian Dröge, Clemens Boos, and Holger Karl. “Joint
Testing and Profiling of Microservice-Based Network Services Using TTCN-3.” ICT
Express, 2019. https://doi.org/10.1016/j.icte.2019.02.001.
ieee: M. Peuster, C. Dröge, C. Boos, and H. Karl, “Joint testing and profiling of
microservice-based network services using TTCN-3,” ICT Express, 2019.
mla: Peuster, Manuel, et al. “Joint Testing and Profiling of Microservice-Based
Network Services Using TTCN-3.” ICT Express, Elsevier BV, 2019, doi:10.1016/j.icte.2019.02.001.
short: M. Peuster, C. Dröge, C. Boos, H. Karl, ICT Express (2019).
date_created: 2019-02-26T18:07:33Z
date_updated: 2022-01-06T07:03:51Z
ddc:
- '000'
department:
- _id: '75'
doi: 10.1016/j.icte.2019.02.001
file:
- access_level: open_access
content_type: application/pdf
creator: peuster
date_created: 2019-02-26T18:09:43Z
date_updated: 2019-02-26T18:09:43Z
file_id: '8114'
file_name: main_for_ris.pdf
file_size: 232599
relation: main_file
file_date_updated: 2019-02-26T18:09:43Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.sciencedirect.com/science/article/pii/S2405959519300402
oa: '1'
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '16'
name: SFB 901 - Subproject C4
- _id: '28'
grant_number: '761493'
name: 5G Development and validation platform for global industry-specific network
services and Apps
publication: ICT Express
publication_identifier:
issn:
- 2405-9595
publication_status: published
publisher: Elsevier BV
status: public
title: Joint testing and profiling of microservice-based network services using TTCN-3
type: journal_article
user_id: '477'
year: '2019'
...
---
_id: '8240'
author:
- first_name: Sevil
full_name: Dräxler, Sevil
id: '31764'
last_name: Dräxler
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: 'Dräxler S, Karl H. SPRING: Scaling, Placement, and Routing of Heterogeneous
Services with Flexible Structures. In: 5th IEEE International Conference on
Network Softwarization (NetSoft) 2019.'
apa: 'Dräxler, S., & Karl, H. (n.d.). SPRING: Scaling, Placement, and Routing
of Heterogeneous Services with Flexible Structures. In 5th IEEE International
Conference on Network Softwarization (NetSoft) 2019. Paris.'
bibtex: '@inproceedings{Dräxler_Karl, title={SPRING: Scaling, Placement, and Routing
of Heterogeneous Services with Flexible Structures}, booktitle={5th IEEE International
Conference on Network Softwarization (NetSoft) 2019}, author={Dräxler, Sevil and
Karl, Holger} }'
chicago: 'Dräxler, Sevil, and Holger Karl. “SPRING: Scaling, Placement, and Routing
of Heterogeneous Services with Flexible Structures.” In 5th IEEE International
Conference on Network Softwarization (NetSoft) 2019, n.d.'
ieee: 'S. Dräxler and H. Karl, “SPRING: Scaling, Placement, and Routing of Heterogeneous
Services with Flexible Structures,” in 5th IEEE International Conference on
Network Softwarization (NetSoft) 2019, Paris.'
mla: 'Dräxler, Sevil, and Holger Karl. “SPRING: Scaling, Placement, and Routing
of Heterogeneous Services with Flexible Structures.” 5th IEEE International
Conference on Network Softwarization (NetSoft) 2019.'
short: 'S. Dräxler, H. Karl, in: 5th IEEE International Conference on Network Softwarization
(NetSoft) 2019, n.d.'
conference:
end_date: 2019-06-28
location: Paris
name: 5th IEEE International Conference on Network Softwarization (NetSoft) 2019
start_date: 2019-06-24
date_created: 2019-03-04T09:23:54Z
date_updated: 2022-01-06T07:03:52Z
department:
- _id: '75'
language:
- iso: eng
project:
- _id: '23'
grant_number: '762057'
name: 5G Programmable Infrastructure Converging disaggregated neTwork and compUte
Resources
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '16'
name: SFB 901 - Subproject C4
publication: 5th IEEE International Conference on Network Softwarization (NetSoft)
2019
publication_status: accepted
status: public
title: 'SPRING: Scaling, Placement, and Routing of Heterogeneous Services with Flexible
Structures'
type: conference
user_id: '31764'
year: '2019'
...
---
_id: '8312'
author:
- first_name: Frederik Simon
full_name: Bäumer, Frederik Simon
id: '38837'
last_name: Bäumer
- first_name: Michaela
full_name: Geierhos, Michaela
id: '42496'
last_name: Geierhos
orcid: 0000-0002-8180-5606
citation:
ama: 'Bäumer FS, Geierhos M. Requirements Engineering in OTF-Computing. In: Encyclopedia.Pub.
Basel, Switzerland: MDPI; 2019.'
apa: 'Bäumer, F. S., & Geierhos, M. (2019). Requirements Engineering in OTF-Computing.
In encyclopedia.pub. Basel, Switzerland: MDPI.'
bibtex: '@inbook{Bäumer_Geierhos_2019, place={Basel, Switzerland}, title={Requirements
Engineering in OTF-Computing}, booktitle={encyclopedia.pub}, publisher={MDPI},
author={Bäumer, Frederik Simon and Geierhos, Michaela}, year={2019} }'
chicago: 'Bäumer, Frederik Simon, and Michaela Geierhos. “Requirements Engineering
in OTF-Computing.” In Encyclopedia.Pub. Basel, Switzerland: MDPI, 2019.'
ieee: 'F. S. Bäumer and M. Geierhos, “Requirements Engineering in OTF-Computing,”
in encyclopedia.pub, Basel, Switzerland: MDPI, 2019.'
mla: Bäumer, Frederik Simon, and Michaela Geierhos. “Requirements Engineering in
OTF-Computing.” Encyclopedia.Pub, MDPI, 2019.
short: 'F.S. Bäumer, M. Geierhos, in: Encyclopedia.Pub, MDPI, Basel, Switzerland,
2019.'
date_created: 2019-03-05T08:54:37Z
date_updated: 2022-01-06T07:03:53Z
department:
- _id: '36'
- _id: '1'
- _id: '579'
keyword:
- OTF Computing
- Natural Language Processing
- Requirements Engineering
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://encyclopedia.pub/131
oa: '1'
place: Basel, Switzerland
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '9'
name: SFB 901 - Subproject B1
publication: encyclopedia.pub
publication_status: published
publisher: MDPI
quality_controlled: '1'
status: public
title: Requirements Engineering in OTF-Computing
type: encyclopedia_article
user_id: '42496'
year: '2019'
...
---
_id: '7413'
author:
- first_name: Dominik
full_name: Gutt, Dominik
id: '14368'
last_name: Gutt
- first_name: Jürgen
full_name: Neumann, Jürgen
id: '32456'
last_name: Neumann
- first_name: Steffen
full_name: Zimmermann, Steffen
last_name: Zimmermann
- first_name: Dennis
full_name: Kundisch, Dennis
id: '21117'
last_name: Kundisch
- first_name: J.
full_name: Chen, J.
last_name: Chen
citation:
ama: Gutt D, Neumann J, Zimmermann S, Kundisch D, Chen J. Design of Review Systems
– A Strategic Instrument to shape Online Reviewing Behavior and Economic Outcomes.
Journal of Strategic Information Systems. 2019;28(2):104-117.
apa: Gutt, D., Neumann, J., Zimmermann, S., Kundisch, D., & Chen, J. (2019).
Design of Review Systems – A Strategic Instrument to shape Online Reviewing Behavior
and Economic Outcomes. Journal of Strategic Information Systems, 28(2),
104–117.
bibtex: '@article{Gutt_Neumann_Zimmermann_Kundisch_Chen_2019, title={Design of Review
Systems – A Strategic Instrument to shape Online Reviewing Behavior and Economic
Outcomes}, volume={28}, number={2}, journal={Journal of Strategic Information
Systems}, author={Gutt, Dominik and Neumann, Jürgen and Zimmermann, Steffen and
Kundisch, Dennis and Chen, J.}, year={2019}, pages={104–117} }'
chicago: 'Gutt, Dominik, Jürgen Neumann, Steffen Zimmermann, Dennis Kundisch, and
J. Chen. “Design of Review Systems – A Strategic Instrument to Shape Online Reviewing
Behavior and Economic Outcomes.” Journal of Strategic Information Systems
28, no. 2 (2019): 104–17.'
ieee: D. Gutt, J. Neumann, S. Zimmermann, D. Kundisch, and J. Chen, “Design of Review
Systems – A Strategic Instrument to shape Online Reviewing Behavior and Economic
Outcomes,” Journal of Strategic Information Systems, vol. 28, no. 2, pp.
104–117, 2019.
mla: Gutt, Dominik, et al. “Design of Review Systems – A Strategic Instrument to
Shape Online Reviewing Behavior and Economic Outcomes.” Journal of Strategic
Information Systems, vol. 28, no. 2, 2019, pp. 104–17.
short: D. Gutt, J. Neumann, S. Zimmermann, D. Kundisch, J. Chen, Journal of Strategic
Information Systems 28 (2019) 104–117.
date_created: 2019-02-01T16:02:29Z
date_updated: 2022-01-06T07:03:37Z
ddc:
- '330'
department:
- _id: '276'
file:
- access_level: closed
content_type: application/pdf
creator: abursig
date_created: 2019-02-12T08:28:30Z
date_updated: 2019-02-12T08:28:30Z
file_id: '7632'
file_name: JSIS.pdf
file_size: 631307
relation: main_file
success: 1
file_date_updated: 2019-02-12T08:28:30Z
has_accepted_license: '1'
intvolume: ' 28'
issue: '2'
language:
- iso: eng
page: 104-117
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '8'
name: SFB 901 - Subproject A4
publication: Journal of Strategic Information Systems
publication_status: published
status: public
title: Design of Review Systems – A Strategic Instrument to shape Online Reviewing
Behavior and Economic Outcomes
type: journal_article
user_id: '16205'
volume: 28
year: '2019'
...
---
_id: '7623'
author:
- first_name: Shikun
full_name: Zhang, Shikun
last_name: Zhang
citation:
ama: Zhang S. Combining Android Apps for Analysis Purposes. Universität Paderborn;
2019.
apa: Zhang, S. (2019). Combining Android Apps for Analysis Purposes. Universität
Paderborn.
bibtex: '@book{Zhang_2019, title={Combining Android Apps for Analysis Purposes},
publisher={Universität Paderborn}, author={Zhang, Shikun}, year={2019} }'
chicago: Zhang, Shikun. Combining Android Apps for Analysis Purposes. Universität
Paderborn, 2019.
ieee: S. Zhang, Combining Android Apps for Analysis Purposes. Universität
Paderborn, 2019.
mla: Zhang, Shikun. Combining Android Apps for Analysis Purposes. Universität
Paderborn, 2019.
short: S. Zhang, Combining Android Apps for Analysis Purposes, Universität Paderborn,
2019.
date_created: 2019-02-12T06:13:43Z
date_updated: 2022-01-06T07:03:41Z
department:
- _id: '77'
language:
- iso: eng
page: '64'
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '12'
name: SFB 901 - Subproject B4
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
title: Combining Android Apps for Analysis Purposes
type: mastersthesis
user_id: '477'
year: '2019'
...
---
_id: '7628'
author:
- first_name: Nils
full_name: Selbach, Nils
last_name: Selbach
citation:
ama: Selbach N. Modeling Crypto API Usages in OpenSSL’s EVP Library. Universität
Paderborn; 2019.
apa: Selbach, N. (2019). Modeling Crypto API usages in OpenSSL’s EVP library.
Universität Paderborn.
bibtex: '@book{Selbach_2019, title={Modeling Crypto API usages in OpenSSL’s EVP
library}, publisher={Universität Paderborn}, author={Selbach, Nils}, year={2019}
}'
chicago: Selbach, Nils. Modeling Crypto API Usages in OpenSSL’s EVP Library.
Universität Paderborn, 2019.
ieee: N. Selbach, Modeling Crypto API usages in OpenSSL’s EVP library. Universität
Paderborn, 2019.
mla: Selbach, Nils. Modeling Crypto API Usages in OpenSSL’s EVP Library.
Universität Paderborn, 2019.
short: N. Selbach, Modeling Crypto API Usages in OpenSSL’s EVP Library, Universität
Paderborn, 2019.
date_created: 2019-02-12T07:28:12Z
date_updated: 2022-01-06T07:03:41Z
department:
- _id: '76'
language:
- iso: eng
project:
- _id: '12'
name: SFB 901 - Subproject B4
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Philipp
full_name: Schubert, Philipp
id: '60543'
last_name: Schubert
orcid: 0000-0002-8674-1859
title: Modeling Crypto API usages in OpenSSL's EVP library
type: bachelorsthesis
user_id: '477'
year: '2019'
...
---
_id: '7630'
abstract:
- lang: eng
text: In this paper, we analyze a credence goods model adjusted to the health care
market with regulated prices and heterogeneous experts. Experts are physicians
and are assumed to differ in their cost of treating a small problem. We investigate
the effects of this heterogeneity on the physicians’ level of fraud and on the
patients’ search for second opinions. We find that introducing a fraction of more
efficient low-cost physicians always increases social welfare, but in some cases
only because of the raised physicians’ surplus. When the low-cost physicians’
cost advantage is small, imposing a share of low-cost physicians does not change
the equilibrium fraud level. When the cost advantage is large, however, different
changes in the fraud level occur depending on the share of generated low-cost
physicians, the search rate and the initial level of fraud.
author:
- first_name: Joachim Maria Josef
full_name: Heinzel, Joachim Maria Josef
id: '53445'
last_name: Heinzel
citation:
ama: 'Heinzel JMJ. Credence Goods Markets with Heterogeneous Experts. Vol
118. Paderborn University: CIE Working Paper Series; 2019.'
apa: 'Heinzel, J. M. J. (2019). Credence Goods Markets with Heterogeneous Experts
(Vol. 118). Paderborn University: CIE Working Paper Series.'
bibtex: '@book{Heinzel_2019, place={Paderborn University}, series={CIE Working Paper
Series}, title={Credence Goods Markets with Heterogeneous Experts}, volume={118},
publisher={CIE Working Paper Series}, author={Heinzel, Joachim Maria Josef}, year={2019},
collection={CIE Working Paper Series} }'
chicago: 'Heinzel, Joachim Maria Josef. Credence Goods Markets with Heterogeneous
Experts. Vol. 118. CIE Working Paper Series. Paderborn University: CIE Working
Paper Series, 2019.'
ieee: 'J. M. J. Heinzel, Credence Goods Markets with Heterogeneous Experts,
vol. 118. Paderborn University: CIE Working Paper Series, 2019.'
mla: Heinzel, Joachim Maria Josef. Credence Goods Markets with Heterogeneous
Experts. Vol. 118, CIE Working Paper Series, 2019.
short: J.M.J. Heinzel, Credence Goods Markets with Heterogeneous Experts, CIE Working
Paper Series, Paderborn University, 2019.
date_created: 2019-02-12T08:18:02Z
date_updated: 2022-01-06T07:03:42Z
ddc:
- '330'
department:
- _id: '280'
- _id: '475'
file:
- access_level: closed
content_type: application/pdf
creator: jheinzel
date_created: 2019-02-12T08:21:37Z
date_updated: 2019-02-12T08:21:37Z
file_id: '7631'
file_name: WP118.pdf
file_size: 286367
relation: main_file
success: 1
file_date_updated: 2019-02-12T08:21:37Z
has_accepted_license: '1'
intvolume: ' 118'
jel:
- D82
- I11
- L15
keyword:
- credence goods
- treatment efficiency
- heterogeneous experts
- overcharging
language:
- iso: eng
place: Paderborn University
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '7'
name: SFB 901 - Subproject A3
publisher: CIE Working Paper Series
report_number: 2019-01
series_title: CIE Working Paper Series
status: public
title: Credence Goods Markets with Heterogeneous Experts
type: report
user_id: '477'
volume: 118
year: '2019'
...
---
_id: '7635'
author:
- first_name: Arnab
full_name: Sharma, Arnab
id: '67200'
last_name: Sharma
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Sharma A, Wehrheim H. Testing Machine Learning Algorithms for Balanced Data
Usage. In: IEEE International Conference on Software Testing, Verification
and Validation (ICST). Xi’an, China: IEEE; 2019:125--135.'
apa: 'Sharma, A., & Wehrheim, H. (2019). Testing Machine Learning Algorithms
for Balanced Data Usage. In IEEE International Conference on Software Testing,
Verification and Validation (ICST) (pp. 125--135). Xi’an, China: IEEE.'
bibtex: '@inproceedings{Sharma_Wehrheim_2019, place={Xi’an, China}, title={Testing
Machine Learning Algorithms for Balanced Data Usage}, booktitle={IEEE International
Conference on Software Testing, Verification and Validation (ICST)}, publisher={IEEE},
author={Sharma, Arnab and Wehrheim, Heike}, year={2019}, pages={125--135} }'
chicago: 'Sharma, Arnab, and Heike Wehrheim. “Testing Machine Learning Algorithms
for Balanced Data Usage.” In IEEE International Conference on Software Testing,
Verification and Validation (ICST), 125--135. Xi’an, China: IEEE, 2019.'
ieee: A. Sharma and H. Wehrheim, “Testing Machine Learning Algorithms for Balanced
Data Usage,” in IEEE International Conference on Software Testing, Verification
and Validation (ICST), Xi’an, China, April, 2019, 2019, pp. 125--135.
mla: Sharma, Arnab, and Heike Wehrheim. “Testing Machine Learning Algorithms for
Balanced Data Usage.” IEEE International Conference on Software Testing, Verification
and Validation (ICST), IEEE, 2019, pp. 125--135.
short: 'A. Sharma, H. Wehrheim, in: IEEE International Conference on Software Testing,
Verification and Validation (ICST), IEEE, Xi’an, China, 2019, pp. 125--135.'
conference:
end_date: 2019-04-27
location: Xi'an, China, April, 2019
name: IEEE International Conference on Software Testing, Verification and Validation
(ICST)
start_date: 2019-04-22
date_created: 2019-02-12T12:31:57Z
date_updated: 2022-01-06T07:03:42Z
ddc:
- '004'
department:
- _id: '34'
- _id: '77'
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2019-08-26T10:56:34Z
date_updated: 2019-08-26T10:56:34Z
file_id: '12960'
file_name: 08730187.pdf
file_size: 266375
relation: main_file
success: 1
file_date_updated: 2019-08-26T10:56:34Z
has_accepted_license: '1'
language:
- iso: eng
page: 125--135
place: Xi'an, China
project:
- _id: '3'
name: SFB 901 - Project Area B
- _id: '11'
name: SFB 901 - Subproject B3
- _id: '1'
name: SFB 901
publication: IEEE International Conference on Software Testing, Verification and Validation
(ICST)
publication_status: published
publisher: IEEE
status: public
title: Testing Machine Learning Algorithms for Balanced Data Usage
type: conference
user_id: '29719'
year: '2019'
...
---
_id: '7636'
abstract:
- lang: eng
text: "Self-stabilizing overlay networks have the advantage of being able to recover
from illegal states and faults. \r\nHowever, the majority of these networks cannot
give any guarantees on their functionality while the recovery process is going
on. \r\nWe are especially interested in searchability, i.e., the functionality
that search messages for a specific node are answered successfully if a node exists
in the network. \r\nIn this paper we investigate overlay networks that ensure
the maintenance of monotonic searchability while the self-stabilization is going
on. \r\nMore 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.\r\nWe
extend the existing research by focusing on skip graphs and present a solution
for two scenarios: (i) the goal topology is a super graph of the perfect skip
graph and (ii) the goal topology is exactly the perfect skip graph.\r\n"
author:
- first_name: Linghui
full_name: Luo, Linghui
last_name: Luo
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Thim Frederik
full_name: Strothmann, Thim Frederik
id: '11319'
last_name: Strothmann
citation:
ama: 'Luo L, Scheideler C, Strothmann TF. MultiSkipGraph: A Self-stabilizing Overlay
Network that Maintains Monotonic Searchability. In: Proceedings of the 2019
IEEE 33rd International Parallel and Distributed Processing Symposium (IPDPS ’19).
; 2019.'
apa: 'Luo, L., Scheideler, C., & Strothmann, T. F. (2019). MultiSkipGraph: A
Self-stabilizing Overlay Network that Maintains Monotonic Searchability. In Proceedings
of the 2019 IEEE 33rd International Parallel and Distributed Processing Symposium
(IPDPS ’19). Rio de Janeiro, Brazil.'
bibtex: '@inproceedings{Luo_Scheideler_Strothmann_2019, title={MultiSkipGraph: A
Self-stabilizing Overlay Network that Maintains Monotonic Searchability}, booktitle={Proceedings
of the 2019 IEEE 33rd International Parallel and Distributed Processing Symposium
(IPDPS ’19)}, author={Luo, Linghui and Scheideler, Christian and Strothmann, Thim
Frederik}, year={2019} }'
chicago: 'Luo, Linghui, Christian Scheideler, and Thim Frederik Strothmann. “MultiSkipGraph:
A Self-Stabilizing Overlay Network That Maintains Monotonic Searchability.” In
Proceedings of the 2019 IEEE 33rd International Parallel and Distributed Processing
Symposium (IPDPS ’19), 2019.'
ieee: 'L. Luo, C. Scheideler, and T. F. Strothmann, “MultiSkipGraph: A Self-stabilizing
Overlay Network that Maintains Monotonic Searchability,” in Proceedings of
the 2019 IEEE 33rd International Parallel and Distributed Processing Symposium
(IPDPS ’19), Rio de Janeiro, Brazil, 2019.'
mla: 'Luo, Linghui, et al. “MultiSkipGraph: A Self-Stabilizing Overlay Network That
Maintains Monotonic Searchability.” Proceedings of the 2019 IEEE 33rd International
Parallel and Distributed Processing Symposium (IPDPS ’19), 2019.'
short: 'L. Luo, C. Scheideler, T.F. Strothmann, in: Proceedings of the 2019 IEEE
33rd International Parallel and Distributed Processing Symposium (IPDPS ’19),
2019.'
conference:
end_date: 2019-05-25
location: Rio de Janeiro, Brazil
name: 2019 IEEE 33rd International Parallel and Distributed Processing Symposium
(IPDPS '19)
start_date: 2019-05-20
date_created: 2019-02-12T13:39:20Z
date_updated: 2022-01-06T07:03:42Z
ddc:
- '006'
department:
- _id: '66'
file:
- access_level: closed
content_type: application/pdf
creator: thim
date_created: 2019-02-12T13:37:35Z
date_updated: 2019-02-12T13:37:35Z
file_id: '7637'
file_name: IPDPS_main.pdf
file_size: 372026
relation: main_file
file_date_updated: 2019-02-12T13:37:35Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
- _id: '1'
name: SFB 901
publication: Proceedings of the 2019 IEEE 33rd International Parallel and Distributed
Processing Symposium (IPDPS '19)
status: public
title: 'MultiSkipGraph: A Self-stabilizing Overlay Network that Maintains Monotonic
Searchability'
type: conference
user_id: '477'
year: '2019'
...
---
_id: '7668'
author:
- first_name: Stefan
full_name: Heindorf, Stefan
id: '11871'
last_name: Heindorf
orcid: 0000-0002-4525-6865
- first_name: Yan
full_name: Scholten, Yan
last_name: Scholten
- first_name: Gregor
full_name: Engels, Gregor
id: '107'
last_name: Engels
- first_name: Martin
full_name: Potthast, Martin
last_name: Potthast
citation:
ama: 'Heindorf S, Scholten Y, Engels G, Potthast M. Debiasing Vandalism Detection
Models at Wikidata. In: WWW. ACM; 2019:670-680. doi:10.1145/3308558.3313507'
apa: 'Heindorf, S., Scholten, Y., Engels, G., & Potthast, M. (2019). Debiasing
Vandalism Detection Models at Wikidata. In WWW (pp. 670–680). San Francisco,
USA: ACM. https://doi.org/10.1145/3308558.3313507'
bibtex: '@inproceedings{Heindorf_Scholten_Engels_Potthast_2019, title={Debiasing
Vandalism Detection Models at Wikidata}, DOI={10.1145/3308558.3313507},
booktitle={WWW}, publisher={ACM}, author={Heindorf, Stefan and Scholten, Yan and
Engels, Gregor and Potthast, Martin}, year={2019}, pages={670–680} }'
chicago: Heindorf, Stefan, Yan Scholten, Gregor Engels, and Martin Potthast. “Debiasing
Vandalism Detection Models at Wikidata.” In WWW, 670–80. ACM, 2019. https://doi.org/10.1145/3308558.3313507.
ieee: S. Heindorf, Y. Scholten, G. Engels, and M. Potthast, “Debiasing Vandalism
Detection Models at Wikidata,” in WWW, San Francisco, USA, 2019, pp. 670–680.
mla: Heindorf, Stefan, et al. “Debiasing Vandalism Detection Models at Wikidata.”
WWW, ACM, 2019, pp. 670–80, doi:10.1145/3308558.3313507.
short: 'S. Heindorf, Y. Scholten, G. Engels, M. Potthast, in: WWW, ACM, 2019, pp.
670–680.'
conference:
end_date: 2015-05-17
location: San Francisco, USA
name: 2019 World Wide Web Conference (WWW '19)
start_date: 2019-05-13
date_created: 2019-02-13T14:10:36Z
date_updated: 2022-01-06T07:03:43Z
ddc:
- '000'
department:
- _id: '66'
doi: 10.1145/3308558.3313507
file:
- access_level: closed
content_type: application/pdf
creator: heindorf
date_created: 2019-04-27T06:09:45Z
date_updated: 2019-04-27T06:09:45Z
file_id: '9518'
file_name: heindorf2019_WWW.pdf
file_size: 1302648
relation: main_file
success: 1
file_date_updated: 2019-04-27T06:09:45Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://groups.uni-paderborn.de/fg-engels/publications_pdfs/Konferenzbeitraege/heindorf2019_WWW.pdf
oa: '1'
page: 670-680
project:
- _id: '17'
name: SFB 901 - Subproject C5
- _id: '4'
name: SFB 901 - Project Area C
- _id: '1'
name: SFB 901
publication: WWW
publication_identifier:
unknown:
- 978-1-4503-6674-8/19/05
publisher: ACM
status: public
title: Debiasing Vandalism Detection Models at Wikidata
type: conference
user_id: '11871'
year: '2019'
...
---
_id: '7689'
article_type: original
author:
- first_name: Heinrich
full_name: Riebler, Heinrich
id: '8961'
last_name: Riebler
- first_name: Gavin Francis
full_name: Vaz, Gavin Francis
id: '30332'
last_name: Vaz
- first_name: Tobias
full_name: Kenter, Tobias
id: '3145'
last_name: Kenter
- first_name: Christian
full_name: Plessl, Christian
id: '16153'
last_name: Plessl
orcid: 0000-0001-5728-9982
citation:
ama: Riebler H, Vaz GF, Kenter T, Plessl C. Transparent Acceleration for Heterogeneous
Platforms with Compilation to OpenCL. ACM Trans Archit Code Optim (TACO).
2019;16(2):14:1–14:26. doi:10.1145/3319423
apa: Riebler, H., Vaz, G. F., Kenter, T., & Plessl, C. (2019). Transparent Acceleration
for Heterogeneous Platforms with Compilation to OpenCL. ACM Trans. Archit.
Code Optim. (TACO), 16(2), 14:1–14:26. https://doi.org/10.1145/3319423
bibtex: '@article{Riebler_Vaz_Kenter_Plessl_2019, title={Transparent Acceleration
for Heterogeneous Platforms with Compilation to OpenCL}, volume={16}, DOI={10.1145/3319423}, number={2}, journal={ACM
Trans. Archit. Code Optim. (TACO)}, publisher={ACM}, author={Riebler, Heinrich
and Vaz, Gavin Francis and Kenter, Tobias and Plessl, Christian}, year={2019},
pages={14:1–14:26} }'
chicago: 'Riebler, Heinrich, Gavin Francis Vaz, Tobias Kenter, and Christian Plessl.
“Transparent Acceleration for Heterogeneous Platforms with Compilation to OpenCL.”
ACM Trans. Archit. Code Optim. (TACO) 16, no. 2 (2019): 14:1–14:26. https://doi.org/10.1145/3319423.'
ieee: H. Riebler, G. F. Vaz, T. Kenter, and C. Plessl, “Transparent Acceleration
for Heterogeneous Platforms with Compilation to OpenCL,” ACM Trans. Archit.
Code Optim. (TACO), vol. 16, no. 2, pp. 14:1–14:26, 2019.
mla: Riebler, Heinrich, et al. “Transparent Acceleration for Heterogeneous Platforms
with Compilation to OpenCL.” ACM Trans. Archit. Code Optim. (TACO), vol.
16, no. 2, ACM, 2019, pp. 14:1–14:26, doi:10.1145/3319423.
short: H. Riebler, G.F. Vaz, T. Kenter, C. Plessl, ACM Trans. Archit. Code Optim.
(TACO) 16 (2019) 14:1–14:26.
date_created: 2019-02-13T15:01:43Z
date_updated: 2022-01-06T07:03:44Z
ddc:
- '000'
department:
- _id: '27'
- _id: '518'
doi: 10.1145/3319423
file:
- access_level: closed
content_type: application/pdf
creator: deffel
date_created: 2019-02-13T14:59:07Z
date_updated: 2019-02-13T14:59:07Z
file_id: '7695'
file_name: htrop19_taco.pdf
file_size: 872822
relation: main_file
file_date_updated: 2019-02-13T14:59:07Z
has_accepted_license: '1'
intvolume: ' 16'
issue: '2'
keyword:
- htrop
language:
- iso: eng
page: 14:1–14:26
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '14'
name: SFB 901 - Subproject C2
publication: ACM Trans. Archit. Code Optim. (TACO)
publication_status: published
publisher: ACM
quality_controlled: '1'
status: public
title: Transparent Acceleration for Heterogeneous Platforms with Compilation to OpenCL
type: journal_article
user_id: '16153'
volume: 16
year: '2019'
...
---
_id: '8351'
author:
- first_name: Florian
full_name: Nutt, Florian
last_name: Nutt
citation:
ama: Nutt F. Vertrauensbildung und Reputationssysteme auf digitalen B2B-Märkten
- Ein klassifizierender Überblick. Universität Paderborn; 2019.
apa: Nutt, F. (2019). Vertrauensbildung und Reputationssysteme auf digitalen
B2B-Märkten - Ein klassifizierender Überblick. Universität Paderborn.
bibtex: '@book{Nutt_2019, place={Universität Paderborn}, title={Vertrauensbildung
und Reputationssysteme auf digitalen B2B-Märkten - Ein klassifizierender Überblick},
author={Nutt, Florian}, year={2019} }'
chicago: Nutt, Florian. Vertrauensbildung und Reputationssysteme auf digitalen
B2B-Märkten - Ein klassifizierender Überblick. Universität Paderborn, 2019.
ieee: F. Nutt, Vertrauensbildung und Reputationssysteme auf digitalen B2B-Märkten
- Ein klassifizierender Überblick. Universität Paderborn, 2019.
mla: Nutt, Florian. Vertrauensbildung und Reputationssysteme auf digitalen B2B-Märkten
- Ein klassifizierender Überblick. 2019.
short: F. Nutt, Vertrauensbildung und Reputationssysteme auf digitalen B2B-Märkten
- Ein klassifizierender Überblick, Universität Paderborn, 2019.
date_created: 2019-03-05T13:42:10Z
date_updated: 2022-01-06T07:03:53Z
language:
- iso: other
place: Universität Paderborn
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '8'
name: SFB 901 - Subproject A4
status: public
supervisor:
- first_name: Dennis
full_name: Kundisch, Dennis
id: '21117'
last_name: Kundisch
title: Vertrauensbildung und Reputationssysteme auf digitalen B2B-Märkten - Ein klassifizierender
Überblick
type: bachelorsthesis
user_id: '16205'
year: '2019'
...
---
_id: '8424'
abstract:
- lang: eng
text: 'The vision of On-the-Fly (OTF) Computing is to compose and provide software
services ad hoc, based on requirement descriptions in natural language. Since
non-technical users write their software requirements themselves and in unrestricted
natural language, deficits occur such as inaccuracy and incompleteness. These
deficits are usually met by natural language processing methods, which have to
face special challenges in OTF Computing because maximum automation is the goal.
In this paper, we present current automatic approaches for solving inaccuracies
and incompletenesses in natural language requirement descriptions and elaborate
open challenges. In particular, we will discuss the necessity of domain-specific
resources and show why, despite far-reaching automation, an intelligent and guided
integration of end users into the compensation process is required. In this context,
we present our idea of a chat bot that integrates users into the compensation
process depending on the given circumstances. '
article_number: '22'
article_type: original
author:
- first_name: Frederik Simon
full_name: Bäumer, Frederik Simon
id: '38837'
last_name: Bäumer
- first_name: Joschka
full_name: Kersting, Joschka
id: '58701'
last_name: Kersting
- first_name: Michaela
full_name: Geierhos, Michaela
id: '42496'
last_name: Geierhos
orcid: 0000-0002-8180-5606
citation:
ama: 'Bäumer FS, Kersting J, Geierhos M. Natural Language Processing in OTF Computing:
Challenges and the Need for Interactive Approaches. Computers. 2019;8(1).
doi:10.3390/computers8010022'
apa: 'Bäumer, F. S., Kersting, J., & Geierhos, M. (2019). Natural Language Processing
in OTF Computing: Challenges and the Need for Interactive Approaches. Computers,
8(1). https://doi.org/10.3390/computers8010022'
bibtex: '@article{Bäumer_Kersting_Geierhos_2019, title={Natural Language Processing
in OTF Computing: Challenges and the Need for Interactive Approaches}, volume={8},
DOI={10.3390/computers8010022},
number={122}, journal={Computers}, publisher={MDPI AG, Basel, Switzerland}, author={Bäumer,
Frederik Simon and Kersting, Joschka and Geierhos, Michaela}, year={2019} }'
chicago: 'Bäumer, Frederik Simon, Joschka Kersting, and Michaela Geierhos. “Natural
Language Processing in OTF Computing: Challenges and the Need for Interactive
Approaches.” Computers 8, no. 1 (2019). https://doi.org/10.3390/computers8010022.'
ieee: 'F. S. Bäumer, J. Kersting, and M. Geierhos, “Natural Language Processing
in OTF Computing: Challenges and the Need for Interactive Approaches,” Computers,
vol. 8, no. 1, 2019.'
mla: 'Bäumer, Frederik Simon, et al. “Natural Language Processing in OTF Computing:
Challenges and the Need for Interactive Approaches.” Computers, vol. 8,
no. 1, 22, MDPI AG, Basel, Switzerland, 2019, doi:10.3390/computers8010022.'
short: F.S. Bäumer, J. Kersting, M. Geierhos, Computers 8 (2019).
conference:
end_date: 2018-10-06
location: Vilnius, Lithuania
name: 24th International Conference on Information and Software Technologies (ICIST
2018)
start_date: 2018-10-04
date_created: 2019-03-06T14:27:28Z
date_updated: 2022-01-06T07:03:55Z
ddc:
- '000'
department:
- _id: '36'
- _id: '1'
- _id: '579'
doi: 10.3390/computers8010022
file:
- access_level: closed
content_type: application/pdf
creator: jkers
date_created: 2020-09-18T09:23:34Z
date_updated: 2020-09-18T09:23:34Z
file_id: '19572'
file_name: Bäumer et al. (2019), Baeumer2019.pdf
file_size: 3164523
relation: main_file
success: 1
file_date_updated: 2020-09-18T09:23:34Z
has_accepted_license: '1'
intvolume: ' 8'
issue: '1'
keyword:
- Inaccuracy Detection
- Natural Language Software Requirements
- Chat Bot
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.mdpi.com/2073-431X/8/1/22/pdf
oa: '1'
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '9'
name: SFB 901 - Subproject B1
publication: Computers
publication_identifier:
issn:
- 2073-431X
publication_status: published
publisher: MDPI AG, Basel, Switzerland
quality_controlled: '1'
status: public
title: 'Natural Language Processing in OTF Computing: Challenges and the Need for
Interactive Approaches'
type: journal_article
user_id: '58701'
volume: 8
year: '2019'
...
---
_id: '8530'
author:
- first_name: Yvonne Maria
full_name: Beckhoff, Yvonne Maria
last_name: Beckhoff
citation:
ama: Beckhoff YM. There’s an App for that - Ein Literaturüberblick über Erfolgsfaktoren
für App-Downloads. Universität Paderborn; 2019.
apa: Beckhoff, Y. M. (2019). There’s an App for that - Ein Literaturüberblick
über Erfolgsfaktoren für App-Downloads. Universität Paderborn.
bibtex: '@book{Beckhoff_2019, place={Universität Paderborn}, title={There’s an App
for that - Ein Literaturüberblick über Erfolgsfaktoren für App-Downloads}, author={Beckhoff,
Yvonne Maria}, year={2019} }'
chicago: Beckhoff, Yvonne Maria. There’s an App for that - Ein Literaturüberblick
über Erfolgsfaktoren für App-Downloads. Universität Paderborn, 2019.
ieee: Y. M. Beckhoff, There’s an App for that - Ein Literaturüberblick über Erfolgsfaktoren
für App-Downloads. Universität Paderborn, 2019.
mla: Beckhoff, Yvonne Maria. There’s an App for that - Ein Literaturüberblick
über Erfolgsfaktoren für App-Downloads. 2019.
short: Y.M. Beckhoff, There’s an App for that - Ein Literaturüberblick über Erfolgsfaktoren
für App-Downloads, Universität Paderborn, 2019.
date_created: 2019-03-21T08:42:42Z
date_updated: 2022-01-06T07:03:56Z
language:
- iso: other
place: Universität Paderborn
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '8'
name: SFB 901 - Subproject A4
status: public
supervisor:
- first_name: Dennis
full_name: Kundisch, Dennis
id: '21117'
last_name: Kundisch
title: There's an App for that - Ein Literaturüberblick über Erfolgsfaktoren für App-Downloads
type: bachelorsthesis
user_id: '477'
year: '2019'
...
---
_id: '8534'
abstract:
- lang: eng
text: "We propose two protocols for distributed priority queues (denoted by 'heap'
for simplicity in this paper) called SKEAP and SEAP. SKEAP realizes a distributed
heap for a constant amount of priorities and SEAP one for an arbitrary amount.
Both protocols build on an overlay, which induces an aggregation tree on which
heap operations are aggregated in batches, ensuring that our protocols scale even
for a high rate of incoming requests. As part of SEAP we provide a novel distributed
protocol for the k-selection problem that runs in time O(log n) w.h.p. SKEAP guarantees
sequential consistency for its heap operations, while SEAP guarantees serializability.
SKEAP and SEAP provide logarithmic runtimes w.h.p. on all their operations. \r\nSKEAP
and SEAP provide logarithmic runtimes w.h.p. on all their operations with SEAP
having to use only O(log n) bit messages."
author:
- first_name: Michael
full_name: Feldmann, Michael
id: '23538'
last_name: Feldmann
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Feldmann M, Scheideler C. Skeap & Seap: Scalable Distributed Priority
Queues for Constant and Arbitrary Priorities. In: Proceedings of the 31st ACM
Symposium on Parallelism in Algorithms and Architectures (SPAA). ACM; 2019:287--296.
doi:10.1145/3323165.3323193'
apa: 'Feldmann, M., & Scheideler, C. (2019). Skeap & Seap: Scalable Distributed
Priority Queues for Constant and Arbitrary Priorities. In Proceedings of the
31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) (pp.
287--296). ACM. https://doi.org/10.1145/3323165.3323193'
bibtex: '@inproceedings{Feldmann_Scheideler_2019, title={Skeap & Seap: Scalable
Distributed Priority Queues for Constant and Arbitrary Priorities}, DOI={10.1145/3323165.3323193},
booktitle={Proceedings of the 31st ACM Symposium on Parallelism in Algorithms
and Architectures (SPAA)}, publisher={ACM}, author={Feldmann, Michael and Scheideler,
Christian}, year={2019}, pages={287--296} }'
chicago: 'Feldmann, Michael, and Christian Scheideler. “Skeap & Seap: Scalable
Distributed Priority Queues for Constant and Arbitrary Priorities.” In Proceedings
of the 31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA),
287--296. ACM, 2019. https://doi.org/10.1145/3323165.3323193.'
ieee: 'M. Feldmann and C. Scheideler, “Skeap & Seap: Scalable Distributed Priority
Queues for Constant and Arbitrary Priorities,” in Proceedings of the 31st ACM
Symposium on Parallelism in Algorithms and Architectures (SPAA), 2019, pp.
287--296.'
mla: 'Feldmann, Michael, and Christian Scheideler. “Skeap & Seap: Scalable Distributed
Priority Queues for Constant and Arbitrary Priorities.” Proceedings of the
31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA),
ACM, 2019, pp. 287--296, doi:10.1145/3323165.3323193.'
short: 'M. Feldmann, C. Scheideler, in: Proceedings of the 31st ACM Symposium on
Parallelism in Algorithms and Architectures (SPAA), ACM, 2019, pp. 287--296.'
date_created: 2019-03-21T14:37:26Z
date_updated: 2022-01-06T07:03:56Z
ddc:
- '004'
department:
- _id: '79'
doi: 10.1145/3323165.3323193
external_id:
arxiv:
- '1805.03472'
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2019-08-26T09:14:32Z
date_updated: 2019-08-26T09:14:32Z
file_id: '12954'
file_name: p287-feldmann.pdf
file_size: 1295095
relation: main_file
success: 1
file_date_updated: 2019-08-26T09:14:32Z
has_accepted_license: '1'
language:
- iso: eng
page: 287--296
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
publication: Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and
Architectures (SPAA)
publisher: ACM
status: public
title: 'Skeap & Seap: Scalable Distributed Priority Queues for Constant and Arbitrary
Priorities'
type: conference
user_id: '477'
year: '2019'
...