---
_id: '3936'
author:
- first_name: Dominik
full_name: Gutt, Dominik
id: '14368'
last_name: Gutt
- first_name: Philipp
full_name: Herrmann, Philipp
last_name: Herrmann
- first_name: Mohammad
full_name: Rahman, Mohammad
last_name: Rahman
citation:
ama: 'Gutt D, Herrmann P, Rahman M. Crowd-Driven Competitive Intelligence: Understanding
the Relationship between Local Market Competition and Online Rating Distributions.
Information Systems Research. 2019;30(3):980-994.'
apa: 'Gutt, D., Herrmann, P., & Rahman, M. (2019). Crowd-Driven Competitive
Intelligence: Understanding the Relationship between Local Market Competition
and Online Rating Distributions. Information Systems Research, 30(3),
980–994.'
bibtex: '@article{Gutt_Herrmann_Rahman_2019, title={Crowd-Driven Competitive Intelligence:
Understanding the Relationship between Local Market Competition and Online Rating
Distributions}, volume={30}, number={3}, journal={Information Systems Research},
author={Gutt, Dominik and Herrmann, Philipp and Rahman, Mohammad}, year={2019},
pages={980–994} }'
chicago: 'Gutt, Dominik, Philipp Herrmann, and Mohammad Rahman. “Crowd-Driven Competitive
Intelligence: Understanding the Relationship between Local Market Competition
and Online Rating Distributions.” Information Systems Research 30, no.
3 (2019): 980–94.'
ieee: 'D. Gutt, P. Herrmann, and M. Rahman, “Crowd-Driven Competitive Intelligence:
Understanding the Relationship between Local Market Competition and Online Rating
Distributions,” Information Systems Research, vol. 30, no. 3, pp. 980–994,
2019.'
mla: 'Gutt, Dominik, et al. “Crowd-Driven Competitive Intelligence: Understanding
the Relationship between Local Market Competition and Online Rating Distributions.”
Information Systems Research, vol. 30, no. 3, 2019, pp. 980–94.'
short: D. Gutt, P. Herrmann, M. Rahman, Information Systems Research 30 (2019) 980–994.
date_created: 2018-08-20T09:45:31Z
date_updated: 2022-01-06T06:59:57Z
ddc:
- '330'
department:
- _id: '276'
file:
- access_level: closed
content_type: application/pdf
creator: d0mi
date_created: 2018-11-12T09:55:20Z
date_updated: 2018-11-12T09:55:20Z
file_id: '5473'
file_name: Crowd-Driven_Competitive_Intelligence_accept.pdf
file_size: 640218
relation: main_file
success: 1
file_date_updated: 2018-11-12T09:55:20Z
has_accepted_license: '1'
intvolume: ' 30'
issue: '3'
language:
- iso: eng
page: 980-994
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '8'
name: SFB 901 - Subproject A4
publication: Information Systems Research
publication_status: epub_ahead
status: public
title: 'Crowd-Driven Competitive Intelligence: Understanding the Relationship between
Local Market Competition and Online Rating Distributions'
type: journal_article
user_id: '16205'
volume: 30
year: '2019'
...
---
_id: '5471'
abstract:
- lang: eng
text: "We characterise the set of dominant strategy incentive compatible (DSIC),
strongly budget balanced (SBB), and ex-post individually rational (IR) mechanisms
for the multi-unit bilateral trade setting. In such a setting there is a single
buyer and a single seller who holds a finite number k of identical items. The
mechanism has to decide how many units of the item are transferred from the seller
to the buyer and how much money is transferred from the buyer to the seller. We
consider two classes of valuation functions for the buyer and seller: Valuations
that are increasing in the number of units in possession, and the more specific
class of valuations that are increasing and submodular. \r\nFurthermore, we present
some approximation results about the performance of certain such mechanisms, in
terms of social welfare: For increasing submodular valuation functions, we show
the existence of a deterministic 2-approximation mechanism and a randomised e/(1-e)
approximation mechanism, matching the best known bounds for the single-item setting."
author:
- first_name: Philip
full_name: Lazos, Philip
last_name: Lazos
- first_name: Paul
full_name: Goldberg, Paul
last_name: Goldberg
- first_name: Alexander
full_name: Skopalik, Alexander
id: '40384'
last_name: Skopalik
- first_name: Matthias
full_name: Gerstgrasser, Matthias
last_name: Gerstgrasser
- first_name: Bart
full_name: de Keijzer, Bart
last_name: de Keijzer
citation:
ama: 'Lazos P, Goldberg P, Skopalik A, Gerstgrasser M, de Keijzer B. Multi-unit
Bilateral Trade. In: Proceedings of the Thirty-Third AAAI Conference on Artificial
Intelligence (AAAI). ; 2019. doi:10.1609/aaai.v33i01.33011973'
apa: Lazos, P., Goldberg, P., Skopalik, A., Gerstgrasser, M., & de Keijzer,
B. (2019). Multi-unit Bilateral Trade. Proceedings of the Thirty-Third AAAI
Conference on Artificial Intelligence (AAAI). Thirty-Third AAAI Conference
on Artificial Intelligence (AAAI), Honolulu, Hawaii, USA. https://doi.org/10.1609/aaai.v33i01.33011973
bibtex: '@inproceedings{Lazos_Goldberg_Skopalik_Gerstgrasser_de Keijzer_2019, title={
Multi-unit Bilateral Trade}, DOI={10.1609/aaai.v33i01.33011973},
booktitle={Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence
(AAAI)}, author={Lazos, Philip and Goldberg, Paul and Skopalik, Alexander and
Gerstgrasser, Matthias and de Keijzer, Bart}, year={2019} }'
chicago: Lazos, Philip, Paul Goldberg, Alexander Skopalik, Matthias Gerstgrasser,
and Bart de Keijzer. “ Multi-Unit Bilateral Trade.” In Proceedings of the Thirty-Third
AAAI Conference on Artificial Intelligence (AAAI), 2019. https://doi.org/10.1609/aaai.v33i01.33011973.
ieee: 'P. Lazos, P. Goldberg, A. Skopalik, M. Gerstgrasser, and B. de Keijzer, “
Multi-unit Bilateral Trade,” presented at the Thirty-Third AAAI Conference on
Artificial Intelligence (AAAI), Honolulu, Hawaii, USA, 2019, doi: 10.1609/aaai.v33i01.33011973.'
mla: Lazos, Philip, et al. “ Multi-Unit Bilateral Trade.” Proceedings of the
Thirty-Third AAAI Conference on Artificial Intelligence (AAAI), 2019, doi:10.1609/aaai.v33i01.33011973.
short: 'P. Lazos, P. Goldberg, A. Skopalik, M. Gerstgrasser, B. de Keijzer, in:
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence (AAAI),
2019.'
conference:
end_date: 2019-02-01
location: Honolulu, Hawaii, USA
name: Thirty-Third AAAI Conference on Artificial Intelligence (AAAI)
start_date: 2019-01-27
date_created: 2018-11-12T09:38:16Z
date_updated: 2022-01-06T07:01:55Z
ddc:
- '000'
department:
- _id: '541'
- _id: '63'
doi: 10.1609/aaai.v33i01.33011973
file:
- access_level: closed
content_type: application/pdf
creator: feldi
date_created: 2018-12-06T13:57:51Z
date_updated: 2018-12-06T13:57:51Z
file_id: '6018'
file_name: 1811.05130.pdf
file_size: 315877
relation: main_file
success: 1
file_date_updated: 2018-12-06T13:57:51Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '7'
name: SFB 901 - Subproject A3
publication: Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence
(AAAI)
publication_status: published
status: public
title: ' Multi-unit Bilateral Trade'
type: conference
user_id: '15415'
year: '2019'
...
---
_id: '6628'
author:
- first_name: Janina
full_name: Seutter, Janina
last_name: Seutter
citation:
ama: 'Seutter J. Bewertung von Maschinen-generierten Geschäftsmodell-Ideen: Eine
experimentelle Untersuchung. Universität Paderborn; 2019.'
apa: 'Seutter, J. (2019). Bewertung von Maschinen-generierten Geschäftsmodell-Ideen:
Eine experimentelle Untersuchung. Universität Paderborn.'
bibtex: '@book{Seutter_2019, place={Universität Paderborn}, title={Bewertung von
Maschinen-generierten Geschäftsmodell-Ideen: Eine experimentelle Untersuchung},
author={Seutter, Janina}, year={2019} }'
chicago: 'Seutter, Janina. Bewertung von Maschinen-generierten Geschäftsmodell-Ideen:
Eine experimentelle Untersuchung. Universität Paderborn, 2019.'
ieee: 'J. Seutter, Bewertung von Maschinen-generierten Geschäftsmodell-Ideen:
Eine experimentelle Untersuchung. Universität Paderborn, 2019.'
mla: 'Seutter, Janina. Bewertung von Maschinen-generierten Geschäftsmodell-Ideen:
Eine experimentelle Untersuchung. 2019.'
short: 'J. Seutter, Bewertung von Maschinen-generierten Geschäftsmodell-Ideen: Eine
experimentelle Untersuchung, Universität Paderborn, 2019.'
date_created: 2019-01-11T13:10:16Z
date_updated: 2022-01-06T07:03:13Z
language:
- iso: ger
place: Universität Paderborn
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '17'
name: SFB 901 - Subproject C5
status: public
supervisor:
- first_name: Dennis
full_name: Kundisch, Dennis
id: '21117'
last_name: Kundisch
title: 'Bewertung von Maschinen-generierten Geschäftsmodell-Ideen: Eine experimentelle
Untersuchung'
type: mastersthesis
user_id: '477'
year: '2019'
...
---
_id: '6856'
author:
- first_name: Michelle
full_name: Müller, Michelle
last_name: Müller
- first_name: Dominik
full_name: Gutt, Dominik
id: '14368'
last_name: Gutt
citation:
ama: 'Müller M, Gutt D. Heart over Heels? An Empirical Analysis of the Relationship
between Emotions and Review Helpfulness for Experience and Credence Goods. In:
Wirtschaftsinformatik Proceedings 2019. ; 2019.'
apa: Müller, M., & Gutt, D. (2019). Heart over Heels? An Empirical Analysis
of the Relationship between Emotions and Review Helpfulness for Experience and
Credence Goods. In Wirtschaftsinformatik Proceedings 2019. Siegen, Germany.
bibtex: '@inproceedings{Müller_Gutt_2019, title={Heart over Heels? An Empirical
Analysis of the Relationship between Emotions and Review Helpfulness for Experience
and Credence Goods}, booktitle={Wirtschaftsinformatik Proceedings 2019}, author={Müller,
Michelle and Gutt, Dominik}, year={2019} }'
chicago: Müller, Michelle, and Dominik Gutt. “Heart over Heels? An Empirical Analysis
of the Relationship between Emotions and Review Helpfulness for Experience and
Credence Goods.” In Wirtschaftsinformatik Proceedings 2019, 2019.
ieee: M. Müller and D. Gutt, “Heart over Heels? An Empirical Analysis of the Relationship
between Emotions and Review Helpfulness for Experience and Credence Goods,” in
Wirtschaftsinformatik Proceedings 2019, Siegen, Germany, 2019.
mla: Müller, Michelle, and Dominik Gutt. “Heart over Heels? An Empirical Analysis
of the Relationship between Emotions and Review Helpfulness for Experience and
Credence Goods.” Wirtschaftsinformatik Proceedings 2019, 2019.
short: 'M. Müller, D. Gutt, in: Wirtschaftsinformatik Proceedings 2019, 2019.'
conference:
location: Siegen, Germany
name: Wirtschaftsinformatik
date_created: 2019-01-17T14:39:49Z
date_updated: 2022-01-06T07:03:22Z
department:
- _id: '276'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '8'
name: SFB 901 - Subproject A4
publication: Wirtschaftsinformatik Proceedings 2019
status: public
title: Heart over Heels? An Empirical Analysis of the Relationship between Emotions
and Review Helpfulness for Experience and Credence Goods
type: conference
user_id: '16205'
year: '2019'
...
---
_id: '6857'
author:
- first_name: Martin
full_name: Poniatowski, Martin
id: '32441'
last_name: Poniatowski
- first_name: Jürgen
full_name: Neumann, Jürgen
id: '32456'
last_name: Neumann
- first_name: Thomas
full_name: Görzen, Thomas
id: '47700'
last_name: Görzen
- first_name: Dennis
full_name: Kundisch, Dennis
id: '21117'
last_name: Kundisch
citation:
ama: 'Poniatowski M, Neumann J, Görzen T, Kundisch D. A Semi-Automated Approach
for Generating Online Review Templates, . In: Wirtschaftsinformatik Proceedings
2019. ; 2019.'
apa: Poniatowski, M., Neumann, J., Görzen, T., & Kundisch, D. (2019). A Semi-Automated
Approach for Generating Online Review Templates, . In Wirtschaftsinformatik
Proceedings 2019. Siegen, Germany.
bibtex: '@inproceedings{Poniatowski_Neumann_Görzen_Kundisch_2019, title={A Semi-Automated
Approach for Generating Online Review Templates, }, booktitle={Wirtschaftsinformatik
Proceedings 2019}, author={Poniatowski, Martin and Neumann, Jürgen and Görzen,
Thomas and Kundisch, Dennis}, year={2019} }'
chicago: Poniatowski, Martin, Jürgen Neumann, Thomas Görzen, and Dennis Kundisch.
“A Semi-Automated Approach for Generating Online Review Templates, .” In Wirtschaftsinformatik
Proceedings 2019, 2019.
ieee: M. Poniatowski, J. Neumann, T. Görzen, and D. Kundisch, “A Semi-Automated
Approach for Generating Online Review Templates, ,” in Wirtschaftsinformatik
Proceedings 2019, Siegen, Germany, 2019.
mla: Poniatowski, Martin, et al. “A Semi-Automated Approach for Generating Online
Review Templates, .” Wirtschaftsinformatik Proceedings 2019, 2019.
short: 'M. Poniatowski, J. Neumann, T. Görzen, D. Kundisch, in: Wirtschaftsinformatik
Proceedings 2019, 2019.'
conference:
location: Siegen, Germany
name: Wirtschaftsinformatik
date_created: 2019-01-17T14:46:50Z
date_updated: 2022-01-06T07:03:22Z
department:
- _id: '276'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '8'
name: SFB 901 - Subproject A4
publication: Wirtschaftsinformatik Proceedings 2019
status: public
title: 'A Semi-Automated Approach for Generating Online Review Templates, '
type: conference
user_id: '477'
year: '2019'
...
---
_id: '6976'
abstract:
- lang: eng
text: "We investigate the maintenance of overlay networks under massive churn, i.e.\r\nnodes
joining and leaving the network. We assume an adversary that may churn a\r\nconstant
fraction $\\alpha n$ of nodes over the course of $\\mathcal{O}(\\log n)$\r\nrounds.
In particular, the adversary has an almost up-to-date information of\r\nthe network
topology as it can observe an only slightly outdated topology that\r\nis at least
$2$ rounds old. Other than that, we only have the provably minimal\r\nrestriction
that new nodes can only join the network via nodes that have taken\r\npart in
the network for at least one round.\r\n Our contributions are as follows: First,
we show that it is impossible to\r\nmaintain a connected topology if adversary
has up-to-date information about the\r\nnodes' connections. Further, we show that
our restriction concerning the join\r\nis also necessary. As our main result present
an algorithm that constructs a\r\nnew overlay- completely independent of all previous
overlays - every $2$\r\nrounds. Furthermore, each node sends and receives only
$\\mathcal{O}(\\log^3 n)$\r\nmessages each round. As part of our solution we propose
the Linearized DeBruijn\r\nSwarm (LDS), a highly churn resistant overlay, which
will be maintained by the\r\nalgorithm. However, our approaches can be transferred
to a variety of classical\r\nP2P Topologies where nodes are mapped into the $[0,1)$-interval."
author:
- first_name: Thorsten
full_name: Götte, Thorsten
id: '34727'
last_name: Götte
- first_name: Vipin Ravindran
full_name: Vijayalakshmi, Vipin Ravindran
last_name: Vijayalakshmi
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Götte T, Vijayalakshmi VR, Scheideler C. Always be Two Steps Ahead of Your
Enemy - Maintaining a Routable Overlay under Massive Churn with an Almost Up-to-date
Adversary. In: Proceedings of the 2019 IEEE 33rd International Parallel and
Distributed Processing Symposium (IPDPS ’19). IEEE.'
apa: 'Götte, T., Vijayalakshmi, V. R., & Scheideler, C. (n.d.). Always be Two
Steps Ahead of Your Enemy - Maintaining a Routable Overlay under Massive Churn
with an Almost Up-to-date Adversary. In Proceedings of the 2019 IEEE 33rd International
Parallel and Distributed Processing Symposium (IPDPS ’19). Rio de Janeiro,
Brazil: IEEE.'
bibtex: '@inproceedings{Götte_Vijayalakshmi_Scheideler, title={Always be Two Steps
Ahead of Your Enemy - Maintaining a Routable Overlay under Massive Churn with
an Almost Up-to-date Adversary}, booktitle={Proceedings of the 2019 IEEE 33rd
International Parallel and Distributed Processing Symposium (IPDPS ’19)}, publisher={IEEE},
author={Götte, Thorsten and Vijayalakshmi, Vipin Ravindran and Scheideler, Christian}
}'
chicago: Götte, Thorsten, Vipin Ravindran Vijayalakshmi, and Christian Scheideler.
“Always Be Two Steps Ahead of Your Enemy - Maintaining a Routable Overlay under
Massive Churn with an Almost Up-to-Date Adversary.” In Proceedings of the 2019
IEEE 33rd International Parallel and Distributed Processing Symposium (IPDPS
’19). IEEE, n.d.
ieee: T. Götte, V. R. Vijayalakshmi, and C. Scheideler, “Always be Two Steps Ahead
of Your Enemy - Maintaining a Routable Overlay under Massive Churn with an Almost
Up-to-date Adversary,” in Proceedings of the 2019 IEEE 33rd International Parallel
and Distributed Processing Symposium (IPDPS ’19), Rio de Janeiro, Brazil.
mla: Götte, Thorsten, et al. “Always Be Two Steps Ahead of Your Enemy - Maintaining
a Routable Overlay under Massive Churn with an Almost Up-to-Date Adversary.” Proceedings
of the 2019 IEEE 33rd International Parallel and Distributed Processing Symposium
(IPDPS ’19), IEEE.
short: 'T. Götte, V.R. Vijayalakshmi, C. Scheideler, in: Proceedings of the 2019
IEEE 33rd International Parallel and Distributed Processing Symposium (IPDPS
’19), IEEE, n.d.'
conference:
end_date: 24.05.19
location: Rio de Janeiro, Brazil
name: 2019 IEEE 33rd International Parallel and Distributed Processing Symposium
(IPDPS '19)
start_date: 20.05.19
date_created: 2019-01-24T18:53:11Z
date_updated: 2022-01-06T07:03:25Z
ddc:
- '000'
department:
- _id: '79'
file:
- access_level: closed
content_type: application/pdf
creator: thgoette
date_created: 2019-01-26T16:09:08Z
date_updated: 2019-01-26T16:09:08Z
file_id: '7007'
file_name: Always_be_Two_Steps_Ahead_of_Your_Enemy.pdf
file_size: 638020
relation: main_file
success: 1
file_date_updated: 2019-01-26T16:09:08Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '13'
name: SFB 901 - Subproject C1
publication: Proceedings of the 2019 IEEE 33rd International Parallel and Distributed
Processing Symposium (IPDPS '19)
publication_status: accepted
publisher: IEEE
status: public
title: Always be Two Steps Ahead of Your Enemy - Maintaining a Routable Overlay under
Massive Churn with an Almost Up-to-date Adversary
type: conference
user_id: '34727'
year: '2019'
...
---
_id: '10586'
abstract:
- lang: eng
text: We consider the problem of transforming a given graph G_s into a desired graph
G_t by applying a minimum number of primitives from a particular set of local
graph transformation primitives. These primitives are local in the sense that
each node can apply them based on local knowledge and by affecting only its 1-neighborhood.
Although the specific set of primitives we consider makes it possible to transform
any (weakly) connected graph into any other (weakly) connected graph consisting
of the same nodes, they cannot disconnect the graph or introduce new nodes into
the graph, making them ideal in the context of supervised overlay network transformations.
We prove that computing a minimum sequence of primitive applications (even centralized)
for arbitrary G_s and G_t is NP-hard, which we conjecture to hold for any set
of local graph transformation primitives satisfying the aforementioned properties.
On the other hand, we show that this problem admits a polynomial time algorithm
with a constant approximation ratio.
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
citation:
ama: 'Scheideler C, Setzer A. On the Complexity of Local Graph Transformations.
In: Proceedings of the 46th International Colloquium on Automata, Languages,
and Programming. Vol 132. LIPIcs. Dagstuhl Publishing; 2019:150:1--150:14.
doi:10.4230/LIPICS.ICALP.2019.150'
apa: 'Scheideler, C., & Setzer, A. (2019). On the Complexity of Local Graph
Transformations. In Proceedings of the 46th International Colloquium on Automata,
Languages, and Programming (Vol. 132, pp. 150:1--150:14). Patras, Greece:
Dagstuhl Publishing. https://doi.org/10.4230/LIPICS.ICALP.2019.150'
bibtex: '@inproceedings{Scheideler_Setzer_2019, series={LIPIcs}, title={On the Complexity
of Local Graph Transformations}, volume={132}, DOI={10.4230/LIPICS.ICALP.2019.150},
booktitle={Proceedings of the 46th International Colloquium on Automata, Languages,
and Programming}, publisher={Dagstuhl Publishing}, author={Scheideler, Christian
and Setzer, Alexander}, year={2019}, pages={150:1--150:14}, collection={LIPIcs}
}'
chicago: Scheideler, Christian, and Alexander Setzer. “On the Complexity of Local
Graph Transformations.” In Proceedings of the 46th International Colloquium
on Automata, Languages, and Programming, 132:150:1--150:14. LIPIcs. Dagstuhl
Publishing, 2019. https://doi.org/10.4230/LIPICS.ICALP.2019.150.
ieee: C. Scheideler and A. Setzer, “On the Complexity of Local Graph Transformations,”
in Proceedings of the 46th International Colloquium on Automata, Languages,
and Programming, Patras, Greece, 2019, vol. 132, pp. 150:1--150:14.
mla: Scheideler, Christian, and Alexander Setzer. “On the Complexity of Local Graph
Transformations.” Proceedings of the 46th International Colloquium on Automata,
Languages, and Programming, vol. 132, Dagstuhl Publishing, 2019, pp. 150:1--150:14,
doi:10.4230/LIPICS.ICALP.2019.150.
short: 'C. Scheideler, A. Setzer, in: Proceedings of the 46th International Colloquium
on Automata, Languages, and Programming, Dagstuhl Publishing, 2019, pp. 150:1--150:14.'
conference:
end_date: 2019-07-12
location: Patras, Greece
name: ICALP 2019
start_date: 2019-07-09
date_created: 2019-07-08T17:19:01Z
date_updated: 2022-01-06T06:50:45Z
ddc:
- '004'
department:
- _id: '79'
doi: 10.4230/LIPICS.ICALP.2019.150
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2019-08-26T09:21:27Z
date_updated: 2019-08-26T09:21:27Z
file_id: '12955'
file_name: LIPIcs-ICALP-2019-150.pdf
file_size: 537649
relation: main_file
success: 1
file_date_updated: 2019-08-26T09:21:27Z
has_accepted_license: '1'
intvolume: ' 132'
keyword:
- Graphs transformations
- NP-hardness
- approximation algorithms
language:
- iso: eng
page: 150:1--150:14
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subproject A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 46th International Colloquium on Automata, Languages,
and Programming
publication_status: published
publisher: Dagstuhl Publishing
series_title: LIPIcs
status: public
title: On the Complexity of Local Graph Transformations
type: conference
user_id: '477'
volume: 132
year: '2019'
...
---
_id: '12870'
author:
- first_name: Björn
full_name: Feldkord, Björn
id: '22704'
last_name: Feldkord
- first_name: Till
full_name: Knollmann, Till
id: '39241'
last_name: Knollmann
orcid: 0000-0003-2014-4696
- 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: 'Feldkord B, Knollmann T, Malatyali M, Meyer auf der Heide F. Managing Multiple
Mobile Resources. In: Proceedings of the 17th Workshop on Approximation and
Online Algorithms (WAOA). Springer; 2019:120-137. doi:10.1007/978-3-030-39479-0_9'
apa: Feldkord, B., Knollmann, T., Malatyali, M., & Meyer auf der Heide, F. (2019).
Managing Multiple Mobile Resources. In Proceedings of the 17th Workshop on
Approximation and Online Algorithms (WAOA) (pp. 120–137). Springer. https://doi.org/10.1007/978-3-030-39479-0_9
bibtex: '@inproceedings{Feldkord_Knollmann_Malatyali_Meyer auf der Heide_2019, title={Managing
Multiple Mobile Resources}, DOI={10.1007/978-3-030-39479-0_9},
booktitle={Proceedings of the 17th Workshop on Approximation and Online Algorithms
(WAOA)}, publisher={Springer}, author={Feldkord, Björn and Knollmann, Till and
Malatyali, Manuel and Meyer auf der Heide, Friedhelm}, year={2019}, pages={120–137}
}'
chicago: Feldkord, Björn, Till Knollmann, Manuel Malatyali, and Friedhelm Meyer
auf der Heide. “Managing Multiple Mobile Resources.” In Proceedings of the
17th Workshop on Approximation and Online Algorithms (WAOA), 120–37. Springer,
2019. https://doi.org/10.1007/978-3-030-39479-0_9.
ieee: B. Feldkord, T. Knollmann, M. Malatyali, and F. Meyer auf der Heide, “Managing
Multiple Mobile Resources,” in Proceedings of the 17th Workshop on Approximation
and Online Algorithms (WAOA), 2019, pp. 120–137.
mla: Feldkord, Björn, et al. “Managing Multiple Mobile Resources.” Proceedings
of the 17th Workshop on Approximation and Online Algorithms (WAOA), Springer,
2019, pp. 120–37, doi:10.1007/978-3-030-39479-0_9.
short: 'B. Feldkord, T. Knollmann, M. Malatyali, F. Meyer auf der Heide, in: Proceedings
of the 17th Workshop on Approximation and Online Algorithms (WAOA), Springer,
2019, pp. 120–137.'
date_created: 2019-07-22T09:00:05Z
date_updated: 2022-01-06T06:51:20Z
department:
- _id: '63'
doi: 10.1007/978-3-030-39479-0_9
external_id:
arxiv:
- '1907.09834'
language:
- iso: eng
page: 120 - 137
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 17th Workshop on Approximation and Online Algorithms
(WAOA)
publication_status: published
publisher: Springer
status: public
title: Managing Multiple Mobile Resources
type: conference
user_id: '22704'
year: '2019'
...
---
_id: '12912'
author:
- first_name: Hadi
full_name: Razzaghi Kouchaksaraei, Hadi
id: '60845'
last_name: Razzaghi Kouchaksaraei
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: 'Razzaghi Kouchaksaraei H, Karl H. Quantitative Analysis of Dynamically Provisioned
Heterogeneous Network Services. In: 15th International Conference on Network
and Service Management (CNSM). Halifax, Canada; 2019.'
apa: Razzaghi Kouchaksaraei, H., & Karl, H. (2019). Quantitative Analysis of
Dynamically Provisioned Heterogeneous Network Services. In 15th International
Conference on Network and Service Management (CNSM). Halifax, Canada.
bibtex: '@inproceedings{Razzaghi Kouchaksaraei_Karl_2019, place={Halifax, Canada},
title={Quantitative Analysis of Dynamically Provisioned Heterogeneous Network
Services}, booktitle={15th International Conference on Network and Service Management
(CNSM)}, author={Razzaghi Kouchaksaraei, Hadi and Karl, Holger}, year={2019} }'
chicago: Razzaghi Kouchaksaraei, Hadi, and Holger Karl. “Quantitative Analysis of
Dynamically Provisioned Heterogeneous Network Services.” In 15th International
Conference on Network and Service Management (CNSM). Halifax, Canada, 2019.
ieee: H. Razzaghi Kouchaksaraei and H. Karl, “Quantitative Analysis of Dynamically
Provisioned Heterogeneous Network Services,” in 15th International Conference
on Network and Service Management (CNSM), Halifax, Canada, 2019.
mla: Razzaghi Kouchaksaraei, Hadi, and Holger Karl. “Quantitative Analysis of Dynamically
Provisioned Heterogeneous Network Services.” 15th International Conference
on Network and Service Management (CNSM), 2019.
short: 'H. Razzaghi Kouchaksaraei, H. Karl, in: 15th International Conference on
Network and Service Management (CNSM), Halifax, Canada, 2019.'
conference:
end_date: 2019-10-25
location: Halifax, Canada
name: 15th International Conference on Network and Service Management
start_date: 2019-10-21
date_created: 2019-08-12T08:12:30Z
date_updated: 2022-01-06T06:51:24Z
department:
- _id: '34'
language:
- iso: eng
place: Halifax, Canada
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: 15th International Conference on Network and Service Management (CNSM)
publication_status: published
status: public
title: Quantitative Analysis of Dynamically Provisioned Heterogeneous Network Services
type: conference
user_id: '60845'
year: '2019'
...
---
_id: '15333'
author:
- first_name: Stefan
full_name: Heindorf, Stefan
id: '11871'
last_name: Heindorf
orcid: 0000-0002-4525-6865
citation:
ama: Heindorf S. Vandalism Detection in Crowdsourced Knowledge Bases. Universität
Paderborn; 2019.
apa: Heindorf, S. (2019). Vandalism Detection in Crowdsourced Knowledge Bases.
Universität Paderborn.
bibtex: '@book{Heindorf_2019, title={Vandalism Detection in Crowdsourced Knowledge
Bases}, publisher={Universität Paderborn}, author={Heindorf, Stefan}, year={2019}
}'
chicago: Heindorf, Stefan. Vandalism Detection in Crowdsourced Knowledge Bases.
Universität Paderborn, 2019.
ieee: S. Heindorf, Vandalism Detection in Crowdsourced Knowledge Bases. Universität
Paderborn, 2019.
mla: Heindorf, Stefan. Vandalism Detection in Crowdsourced Knowledge Bases.
Universität Paderborn, 2019.
short: S. Heindorf, Vandalism Detection in Crowdsourced Knowledge Bases, Universität
Paderborn, 2019.
date_created: 2019-12-17T06:15:38Z
date_updated: 2022-01-06T06:52:20Z
ddc:
- '040'
department:
- _id: '66'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2020-01-16T12:09:52Z
date_updated: 2020-01-16T12:09:52Z
file_id: '15603'
file_name: Dissertation_Stefan_Heindorf.pdf
file_size: 1740910
relation: main_file
success: 1
file_date_updated: 2020-01-16T12:09:52Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '17'
name: SFB 901 - Subproject C5
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Gregor
full_name: Engels, Gregor
id: '107'
last_name: Engels
title: Vandalism Detection in Crowdsourced Knowledge Bases
type: dissertation
user_id: '477'
year: '2019'
...
---
_id: '15369'
author:
- first_name: Marcel
full_name: Müller, Marcel
last_name: Müller
- first_name: Daniel
full_name: Behnke, Daniel
last_name: Behnke
- first_name: Patrick-Benjamin
full_name: Bök, Patrick-Benjamin
last_name: Bök
- first_name: Manuel
full_name: Peuster, Manuel
id: '13271'
last_name: Peuster
- first_name: Stefan Balthasar
full_name: Schneider, Stefan Balthasar
id: '35343'
last_name: Schneider
orcid: 0000-0001-8210-4011
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: 'Müller M, Behnke D, Bök P-B, Peuster M, Schneider SB, Karl H. 5G as Key Technology
for Networked Factories: Application of Vertical-specific Network Services for
Enabling Flexible Smart Manufacturing. In: IEEE 17th International Conference
on Industrial Informatics (IEEE-INDIN). Helsinki: IEEE; 2019.'
apa: 'Müller, M., Behnke, D., Bök, P.-B., Peuster, M., Schneider, S. B., & Karl,
H. (2019). 5G as Key Technology for Networked Factories: Application of Vertical-specific
Network Services for Enabling Flexible Smart Manufacturing. In IEEE 17th International
Conference on Industrial Informatics (IEEE-INDIN). Helsinki: IEEE.'
bibtex: '@inproceedings{Müller_Behnke_Bök_Peuster_Schneider_Karl_2019, place={Helsinki},
title={5G as Key Technology for Networked Factories: Application of Vertical-specific
Network Services for Enabling Flexible Smart Manufacturing}, booktitle={IEEE 17th
International Conference on Industrial Informatics (IEEE-INDIN)}, publisher={IEEE},
author={Müller, Marcel and Behnke, Daniel and Bök, Patrick-Benjamin and Peuster,
Manuel and Schneider, Stefan Balthasar and Karl, Holger}, year={2019} }'
chicago: 'Müller, Marcel, Daniel Behnke, Patrick-Benjamin Bök, Manuel Peuster, Stefan
Balthasar Schneider, and Holger Karl. “5G as Key Technology for Networked Factories:
Application of Vertical-Specific Network Services for Enabling Flexible Smart
Manufacturing.” In IEEE 17th International Conference on Industrial Informatics
(IEEE-INDIN). Helsinki: IEEE, 2019.'
ieee: 'M. Müller, D. Behnke, P.-B. Bök, M. Peuster, S. B. Schneider, and H. Karl,
“5G as Key Technology for Networked Factories: Application of Vertical-specific
Network Services for Enabling Flexible Smart Manufacturing,” in IEEE 17th International
Conference on Industrial Informatics (IEEE-INDIN), 2019.'
mla: 'Müller, Marcel, et al. “5G as Key Technology for Networked Factories: Application
of Vertical-Specific Network Services for Enabling Flexible Smart Manufacturing.”
IEEE 17th International Conference on Industrial Informatics (IEEE-INDIN),
IEEE, 2019.'
short: 'M. Müller, D. Behnke, P.-B. Bök, M. Peuster, S.B. Schneider, H. Karl, in:
IEEE 17th International Conference on Industrial Informatics (IEEE-INDIN), IEEE,
Helsinki, 2019.'
date_created: 2019-12-18T07:27:24Z
date_updated: 2022-01-06T06:52:21Z
department:
- _id: '75'
language:
- iso: eng
place: Helsinki
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: IEEE 17th International Conference on Industrial Informatics (IEEE-INDIN)
publisher: IEEE
status: public
title: '5G as Key Technology for Networked Factories: Application of Vertical-specific
Network Services for Enabling Flexible Smart Manufacturing'
type: conference
user_id: '13271'
year: '2019'
...
---
_id: '15371'
abstract:
- lang: eng
text: "More and more management and orchestration approaches for (software) networks
are based on machine learning paradigms and solutions. These approaches depend
not only on their program code to operate properly, but also require enough input
data to train their internal models. However, such training data is barely available
for the software networking domain and most presented solutions rely on their
own, sometimes not even published, data sets. This makes it hard, or even infeasible,
to reproduce and compare many of the existing solutions. As a result, it ultimately
slows down the adoption of machine learning approaches in softwarised networks.
To this end, we introduce the \"softwarised network data zoo\" (SNDZoo), an open
collection of software networking data sets aiming to streamline and ease machine
learning research in the software networking domain. We present a general methodology
to collect, archive, and publish those data sets for use by other researches and,
as an example, eight initial data sets, focusing on the performance of virtualised
network functions.\r\n"
author:
- first_name: Manuel
full_name: Peuster, Manuel
id: '13271'
last_name: Peuster
- first_name: Stefan Balthasar
full_name: Schneider, Stefan Balthasar
id: '35343'
last_name: Schneider
orcid: 0000-0001-8210-4011
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: 'Peuster M, Schneider SB, Karl H. The Softwarised Network Data Zoo. In: IEEE/IFIP
15th International Conference on Network and Service Management (CNSM). Halifax:
IEEE/IFIP; 2019.'
apa: 'Peuster, M., Schneider, S. B., & Karl, H. (2019). The Softwarised Network
Data Zoo. In IEEE/IFIP 15th International Conference on Network and Service
Management (CNSM). Halifax: IEEE/IFIP.'
bibtex: '@inproceedings{Peuster_Schneider_Karl_2019, place={Halifax}, title={The
Softwarised Network Data Zoo}, booktitle={IEEE/IFIP 15th International Conference
on Network and Service Management (CNSM)}, publisher={IEEE/IFIP}, author={Peuster,
Manuel and Schneider, Stefan Balthasar and Karl, Holger}, year={2019} }'
chicago: 'Peuster, Manuel, Stefan Balthasar Schneider, and Holger Karl. “The Softwarised
Network Data Zoo.” In IEEE/IFIP 15th International Conference on Network and
Service Management (CNSM). Halifax: IEEE/IFIP, 2019.'
ieee: M. Peuster, S. B. Schneider, and H. Karl, “The Softwarised Network Data Zoo,”
in IEEE/IFIP 15th International Conference on Network and Service Management
(CNSM), 2019.
mla: Peuster, Manuel, et al. “The Softwarised Network Data Zoo.” IEEE/IFIP 15th
International Conference on Network and Service Management (CNSM), IEEE/IFIP,
2019.
short: 'M. Peuster, S.B. Schneider, H. Karl, in: IEEE/IFIP 15th International Conference
on Network and Service Management (CNSM), IEEE/IFIP, Halifax, 2019.'
date_created: 2019-12-18T07:30:45Z
date_updated: 2022-01-06T06:52:21Z
ddc:
- '000'
department:
- _id: '75'
file:
- access_level: open_access
content_type: application/pdf
creator: peuster
date_created: 2019-12-18T08:10:23Z
date_updated: 2019-12-18T08:10:23Z
file_id: '15377'
file_name: main_for_ris.pdf
file_size: 515208
relation: main_file
file_date_updated: 2019-12-18T08:10:23Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://dl.ifip.org/db/conf/cnsm/cnsm2019/1570555677.pdf
oa: '1'
place: Halifax
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: IEEE/IFIP 15th International Conference on Network and Service Management
(CNSM)
publisher: IEEE/IFIP
status: public
title: The Softwarised Network Data Zoo
type: conference
user_id: '13271'
year: '2019'
...
---
_id: '15373'
abstract:
- lang: eng
text: "Offloading packet processing tasks to programmable switches and/or to programmable
network interfaces, so called “SmartNICs”, is one of the key concepts to prepare
softwarized networks for the high traffic demands of the future. However, implementing
network functions that make use of those offload- ing technologies is still challenging
and usually requires the availability of specialized hardware. It becomes even
harder if heterogeneous services, making use of different offloading and network
virtualization technologies, should be developed.\r\nIn this paper, we introduce
FOP4 (Function Offloading Pro- totyping with P4), a novel prototyping platform
that allows to prototype heterogeneous software network scenarios, including container-based,
P4-switch-based, and SmartNIC-based network functions. The presented work substantially
extends our existing Containernet platform with the means to prototype offloading
scenarios. Besides presenting the platform’s system design, we evaluate its scalability
and show that it can run scenarios with more than 64 P4 switch or SmartNIC nodes
on a single laptop. Finally, we presented a case study in which we use the presented
platform to prototype an extended in-band network telemetry use case."
author:
- first_name: Daniele
full_name: Moro, Daniele
last_name: Moro
- first_name: Manuel
full_name: Peuster, Manuel
id: '13271'
last_name: Peuster
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
- first_name: Antonio
full_name: Capone, Antonio
last_name: Capone
citation:
ama: 'Moro D, Peuster M, Karl H, Capone A. FOP4: Function Offloading Prototyping
in Heterogeneous and Programmable Network Scenarios. In: IEEE Conference on
Network Function Virtualization and Software Defined Networks (NFV-SDN). Dallas:
IEEE; 2019.'
apa: 'Moro, D., Peuster, M., Karl, H., & Capone, A. (2019). FOP4: Function Offloading
Prototyping in Heterogeneous and Programmable Network Scenarios. In IEEE Conference
on Network Function Virtualization and Software Defined Networks (NFV-SDN).
Dallas: IEEE.'
bibtex: '@inproceedings{Moro_Peuster_Karl_Capone_2019, place={Dallas}, title={FOP4:
Function Offloading Prototyping in Heterogeneous and Programmable Network Scenarios},
booktitle={IEEE Conference on Network Function Virtualization and Software Defined
Networks (NFV-SDN)}, publisher={IEEE}, author={Moro, Daniele and Peuster, Manuel
and Karl, Holger and Capone, Antonio}, year={2019} }'
chicago: 'Moro, Daniele, Manuel Peuster, Holger Karl, and Antonio Capone. “FOP4:
Function Offloading Prototyping in Heterogeneous and Programmable Network Scenarios.”
In IEEE Conference on Network Function Virtualization and Software Defined
Networks (NFV-SDN). Dallas: IEEE, 2019.'
ieee: 'D. Moro, M. Peuster, H. Karl, and A. Capone, “FOP4: Function Offloading Prototyping
in Heterogeneous and Programmable Network Scenarios,” in IEEE Conference on
Network Function Virtualization and Software Defined Networks (NFV-SDN), 2019.'
mla: 'Moro, Daniele, et al. “FOP4: Function Offloading Prototyping in Heterogeneous
and Programmable Network Scenarios.” IEEE Conference on Network Function Virtualization
and Software Defined Networks (NFV-SDN), IEEE, 2019.'
short: 'D. Moro, M. Peuster, H. Karl, A. Capone, in: IEEE Conference on Network
Function Virtualization and Software Defined Networks (NFV-SDN), IEEE, Dallas,
2019.'
date_created: 2019-12-18T07:39:28Z
date_updated: 2022-01-06T06:52:22Z
ddc:
- '000'
department:
- _id: '75'
file:
- access_level: open_access
content_type: application/pdf
creator: peuster
date_created: 2019-12-18T08:11:37Z
date_updated: 2019-12-18T08:11:37Z
file_id: '15378'
file_name: main_for_ris.pdf
file_size: 657216
relation: main_file
file_date_updated: 2019-12-18T08:11:37Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
place: Dallas
project:
- _id: '28'
grant_number: '761493'
name: 5G Development and validation platform for global industry-specific network
services and Apps
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '16'
name: SFB 901 - Subproject C4
publication: IEEE Conference on Network Function Virtualization and Software Defined
Networks (NFV-SDN)
publisher: IEEE
status: public
title: 'FOP4: Function Offloading Prototyping in Heterogeneous and Programmable Network
Scenarios'
type: conference
user_id: '13271'
year: '2019'
...
---
_id: '15374'
abstract:
- lang: eng
text: Emulation platforms supporting Virtual Network Functions (VNFs) allow developers
to rapidly prototype network services. None of the available platforms, however,
supports experimenting with programmable data planes to enable VNF offloading.
In this demonstration, we show FOP4, a flexible platform that provides support
for Docker-based VNFs, and VNF offloading, by means of P4-enabled switches. The
platform provides interfaces to program the P4 devices and to deploy network functions.
We demonstrate FOP4 with two complex example scenarios, demonstrating how developers
can exploit data plane programmability to implement network functions.
author:
- first_name: Daniele
full_name: Moro, Daniele
last_name: Moro
- first_name: Manuel
full_name: Peuster, Manuel
id: '13271'
last_name: Peuster
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
- first_name: Antonio
full_name: Capone, Antonio
last_name: Capone
citation:
ama: 'Moro D, Peuster M, Karl H, Capone A. Demonstrating FOP4: A Flexible Platform
to Prototype NFV Offloading Scenarios. In: IEEE Conference on Network Function
Virtualization and Software Defined Networks (NFV-SDN). Dallas: IEEE; 2019.'
apa: 'Moro, D., Peuster, M., Karl, H., & Capone, A. (2019). Demonstrating FOP4:
A Flexible Platform to Prototype NFV Offloading Scenarios. In IEEE Conference
on Network Function Virtualization and Software Defined Networks (NFV-SDN).
Dallas: IEEE.'
bibtex: '@inproceedings{Moro_Peuster_Karl_Capone_2019, place={Dallas}, title={Demonstrating
FOP4: A Flexible Platform to Prototype NFV Offloading Scenarios}, booktitle={IEEE
Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN)},
publisher={IEEE}, author={Moro, Daniele and Peuster, Manuel and Karl, Holger and
Capone, Antonio}, year={2019} }'
chicago: 'Moro, Daniele, Manuel Peuster, Holger Karl, and Antonio Capone. “Demonstrating
FOP4: A Flexible Platform to Prototype NFV Offloading Scenarios.” In IEEE Conference
on Network Function Virtualization and Software Defined Networks (NFV-SDN).
Dallas: IEEE, 2019.'
ieee: 'D. Moro, M. Peuster, H. Karl, and A. Capone, “Demonstrating FOP4: A Flexible
Platform to Prototype NFV Offloading Scenarios,” in IEEE Conference on Network
Function Virtualization and Software Defined Networks (NFV-SDN), 2019.'
mla: 'Moro, Daniele, et al. “Demonstrating FOP4: A Flexible Platform to Prototype
NFV Offloading Scenarios.” IEEE Conference on Network Function Virtualization
and Software Defined Networks (NFV-SDN), IEEE, 2019.'
short: 'D. Moro, M. Peuster, H. Karl, A. Capone, in: IEEE Conference on Network
Function Virtualization and Software Defined Networks (NFV-SDN), IEEE, Dallas,
2019.'
date_created: 2019-12-18T07:41:21Z
date_updated: 2022-01-06T06:52:22Z
ddc:
- '000'
department:
- _id: '75'
file:
- access_level: open_access
content_type: application/pdf
creator: peuster
date_created: 2019-12-18T08:12:28Z
date_updated: 2019-12-18T08:12:28Z
file_id: '15379'
file_name: main_for_ris.pdf
file_size: 370456
relation: main_file
file_date_updated: 2019-12-18T08:12:28Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
place: Dallas
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '16'
name: SFB 901 - Subproject C4
publication: IEEE Conference on Network Function Virtualization and Software Defined
Networks (NFV-SDN)
publisher: IEEE
status: public
title: 'Demonstrating FOP4: A Flexible Platform to Prototype NFV Offloading Scenarios'
type: conference
user_id: '13271'
year: '2019'
...
---
_id: '15627'
author:
- first_name: John
full_name: Augustine, John
last_name: Augustine
- first_name: Kristian
full_name: Hinnenthal, Kristian
id: '32229'
last_name: Hinnenthal
- first_name: Fabian
full_name: Kuhn, Fabian
last_name: Kuhn
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Philipp
full_name: Schneider, Philipp
last_name: Schneider
citation:
ama: 'Augustine J, Hinnenthal K, Kuhn F, Scheideler C, Schneider P. Shortest Paths
in a Hybrid Network Model. In: Proceedings of the Fourteenth Annual ACM-SIAM
Symposium on Discrete Algorithms. Philadelphia, PA; 2019:1280-1299. doi:10.1137/1.9781611975994.78'
apa: Augustine, J., Hinnenthal, K., Kuhn, F., Scheideler, C., & Schneider, P.
(2019). Shortest Paths in a Hybrid Network Model. In Proceedings of the Fourteenth
Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 1280–1299). Philadelphia,
PA. https://doi.org/10.1137/1.9781611975994.78
bibtex: '@inproceedings{Augustine_Hinnenthal_Kuhn_Scheideler_Schneider_2019, place={Philadelphia,
PA}, title={Shortest Paths in a Hybrid Network Model}, DOI={10.1137/1.9781611975994.78},
booktitle={Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete
Algorithms}, author={Augustine, John and Hinnenthal, Kristian and Kuhn, Fabian
and Scheideler, Christian and Schneider, Philipp}, year={2019}, pages={1280–1299}
}'
chicago: Augustine, John, Kristian Hinnenthal, Fabian Kuhn, Christian Scheideler,
and Philipp Schneider. “Shortest Paths in a Hybrid Network Model.” In Proceedings
of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1280–99.
Philadelphia, PA, 2019. https://doi.org/10.1137/1.9781611975994.78.
ieee: J. Augustine, K. Hinnenthal, F. Kuhn, C. Scheideler, and P. Schneider, “Shortest
Paths in a Hybrid Network Model,” in Proceedings of the Fourteenth Annual ACM-SIAM
Symposium on Discrete Algorithms, 2019, pp. 1280–1299.
mla: Augustine, John, et al. “Shortest Paths in a Hybrid Network Model.” Proceedings
of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019,
pp. 1280–99, doi:10.1137/1.9781611975994.78.
short: 'J. Augustine, K. Hinnenthal, F. Kuhn, C. Scheideler, P. Schneider, in: Proceedings
of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, Philadelphia,
PA, 2019, pp. 1280–1299.'
date_created: 2020-01-22T09:07:36Z
date_updated: 2022-01-06T06:52:30Z
doi: 10.1137/1.9781611975994.78
language:
- iso: eng
page: 1280-1299
place: Philadelphia, PA
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 Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms
publication_identifier:
isbn:
- '9781611975994'
publication_status: published
status: public
title: Shortest Paths in a Hybrid Network Model
type: conference
user_id: '32229'
year: '2019'
...
---
_id: '15838'
abstract:
- lang: eng
text: In the field of software analysis a trade-off between scalability and accuracy
always exists. In this respect, Android app analysis is no exception, in particular,
analyzing large or many apps can be challenging. Dealing with many small apps
is a typical challenge when facing micro-benchmarks such as DROIDBENCH or ICC-BENCH.
These particular benchmarks are not only used for the evaluation of novel tools
but also in continuous integration pipelines of existing mature tools to maintain
and guarantee a certain quality-level. Considering this latter usage it becomes
very important to be able to achieve benchmark results as fast as possible. Hence,
benchmarks have to be optimized for this purpose. One approach to do so is app
merging. We implemented the Android Merge Tool (AMT) following this approach and
show that its novel aspects can be used to produce scaled up and accurate benchmarks.
For such benchmarks Android app analysis tools do not suffer from the scalability-accuracy
trade-off anymore. We show this throughout detailed experiments on DROIDBENCH
employing three different analysis tools (AMANDROID, ICCTA, FLOWDROID). Benchmark
execution times are largely reduced without losing benchmark accuracy. Moreover,
we argue why AMT is an advantageous successor of the state-of-the-art app merging
tool (APKCOMBINER) in analysis lift-up scenarios.
author:
- first_name: Felix
full_name: Pauck, Felix
id: '22398'
last_name: Pauck
- first_name: Shikun
full_name: Zhang, Shikun
last_name: Zhang
citation:
ama: 'Pauck F, Zhang S. Android App Merging for Benchmark Speed-Up and Analysis
Lift-Up. In: 2019 34th IEEE/ACM International Conference on Automated Software
Engineering Workshop (ASEW). ; 2019. doi:10.1109/asew.2019.00019'
apa: Pauck, F., & Zhang, S. (2019). Android App Merging for Benchmark Speed-Up
and Analysis Lift-Up. In 2019 34th IEEE/ACM International Conference on Automated
Software Engineering Workshop (ASEW). https://doi.org/10.1109/asew.2019.00019
bibtex: '@inproceedings{Pauck_Zhang_2019, title={Android App Merging for Benchmark
Speed-Up and Analysis Lift-Up}, DOI={10.1109/asew.2019.00019},
booktitle={2019 34th IEEE/ACM International Conference on Automated Software Engineering
Workshop (ASEW)}, author={Pauck, Felix and Zhang, Shikun}, year={2019} }'
chicago: Pauck, Felix, and Shikun Zhang. “Android App Merging for Benchmark Speed-Up
and Analysis Lift-Up.” In 2019 34th IEEE/ACM International Conference on Automated
Software Engineering Workshop (ASEW), 2019. https://doi.org/10.1109/asew.2019.00019.
ieee: F. Pauck and S. Zhang, “Android App Merging for Benchmark Speed-Up and Analysis
Lift-Up,” in 2019 34th IEEE/ACM International Conference on Automated Software
Engineering Workshop (ASEW), 2019.
mla: Pauck, Felix, and Shikun Zhang. “Android App Merging for Benchmark Speed-Up
and Analysis Lift-Up.” 2019 34th IEEE/ACM International Conference on Automated
Software Engineering Workshop (ASEW), 2019, doi:10.1109/asew.2019.00019.
short: 'F. Pauck, S. Zhang, in: 2019 34th IEEE/ACM International Conference on Automated
Software Engineering Workshop (ASEW), 2019.'
date_created: 2020-02-06T17:06:51Z
date_updated: 2022-01-06T06:52:38Z
ddc:
- '004'
department:
- _id: '77'
doi: 10.1109/asew.2019.00019
file:
- access_level: closed
content_type: application/pdf
creator: fpauck
date_created: 2020-02-06T17:09:45Z
date_updated: 2020-02-06T17:09:45Z
file_id: '15839'
file_name: AMT_final.pdf
file_size: 644517
relation: main_file
file_date_updated: 2020-02-06T17:09:45Z
has_accepted_license: '1'
keyword:
- Program Analysis
- Android App Analysis
- Taint Analysis
- App Merging
- Benchmark
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '12'
name: SFB 901 - Subproject B4
publication: 2019 34th IEEE/ACM International Conference on Automated Software Engineering
Workshop (ASEW)
publication_identifier:
isbn:
- '9781728141367'
publication_status: published
status: public
title: Android App Merging for Benchmark Speed-Up and Analysis Lift-Up
type: conference
user_id: '477'
year: '2019'
...
---
_id: '15920'
abstract:
- lang: eng
text: "Secure hardware design is the most important aspect to be considered in addition
to functional correctness. Achieving hardware security in today’s globalized Integrated
Cir- cuit(IC) supply chain is a challenging task. One solution that is widely
considered to help achieve secure hardware designs is Information Flow Tracking(IFT).
It provides an ap- proach to verify that the systems adhere to security properties
either by static verification during design phase or dynamic checking during runtime.\r\nProof-Carrying
Hardware(PCH) is an approach to verify a functional design prior to using it in
hardware. It is a two-party verification approach, where the target party, the
consumer requests new functionalities with pre-defined properties to the producer.
In response, the producer designs the IP (Intellectual Property) cores with the
requested functionalities that adhere to the consumer-defined properties. The
producer provides the IP cores and a proof certificate combined into a proof-carrying
bitstream to the consumer to verify it. If the verification is successful, the
consumer can use the IP cores in his hardware. In essence, the consumer can only
run verified IP cores. Correctly applied, PCH techniques can help consumers to
defend against many unintentional modifications and malicious alterations of the
modules they receive. There are numerous published examples of how to use PCH
to detect any change in the functionality of a circuit, i.e., pairing a PCH approach
with functional equivalence checking for combinational or sequential circuits.
For non-functional properties, since opening new covert channels to leak secret
information from secure circuits is a viable attack vector for hardware trojans,
i.e., intentionally added malicious circuitry, IFT technique is employed to make
sure that secret/untrusted information never reaches any unclassified/trusted
outputs.\r\nThis master thesis aims to explore the possibility of adapting Information
Flow Tracking into a Proof-Carrying Hardware scenario. It aims to create a method
that combines Infor- mation Flow Tracking(IFT) with a PCH approach at bitstream
level enabling consumers to validate the trustworthiness of a module’s information
flow without the computational costs of a complete flow analysis."
author:
- first_name: Monica
full_name: Keerthipati, Monica
last_name: Keerthipati
citation:
ama: Keerthipati M. A Bitstream-Level Proof-Carrying Hardware Technique for Information
Flow Tracking. Universität Paderborn; 2019.
apa: Keerthipati, M. (2019). A Bitstream-Level Proof-Carrying Hardware Technique
for Information Flow Tracking. Universität Paderborn.
bibtex: '@book{Keerthipati_2019, title={A Bitstream-Level Proof-Carrying Hardware
Technique for Information Flow Tracking}, publisher={Universität Paderborn}, author={Keerthipati,
Monica}, year={2019} }'
chicago: Keerthipati, Monica. A Bitstream-Level Proof-Carrying Hardware Technique
for Information Flow Tracking. Universität Paderborn, 2019.
ieee: M. Keerthipati, A Bitstream-Level Proof-Carrying Hardware Technique for
Information Flow Tracking. Universität Paderborn, 2019.
mla: Keerthipati, Monica. A Bitstream-Level Proof-Carrying Hardware Technique
for Information Flow Tracking. Universität Paderborn, 2019.
short: M. Keerthipati, A Bitstream-Level Proof-Carrying Hardware Technique for Information
Flow Tracking, Universität Paderborn, 2019.
date_created: 2020-02-17T12:03:40Z
date_updated: 2022-01-06T06:52:41Z
department:
- _id: '78'
language:
- iso: eng
project:
- _id: '12'
name: SFB 901 - Subproject B4
- _id: '3'
name: SFB 901 - Project Area B
- _id: '1'
name: SFB 901
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Tobias
full_name: Wiersema, Tobias
id: '3118'
last_name: Wiersema
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
- first_name: Sybille
full_name: Hellebrand, Sybille
id: '209'
last_name: Hellebrand
orcid: 0000-0002-3717-3939
title: A Bitstream-Level Proof-Carrying Hardware Technique for Information Flow Tracking
type: mastersthesis
user_id: '477'
year: '2019'
...
---
_id: '14829'
citation:
ama: Scheideler C, Berenbrink P, eds. The 31st ACM Symposium on Parallelism in
Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June 22-24, 2019.
ACM; 2019. doi:10.1145/3323165
apa: Scheideler, C., & Berenbrink, P. (Eds.). (2019). The 31st ACM Symposium
on Parallelism in Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June
22-24, 2019. ACM. https://doi.org/10.1145/3323165
bibtex: '@book{Scheideler_Berenbrink_2019, title={The 31st ACM Symposium on Parallelism
in Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June 22-24, 2019},
DOI={10.1145/3323165}, publisher={ACM},
year={2019} }'
chicago: Scheideler, Christian, and Petra Berenbrink, eds. The 31st ACM Symposium
on Parallelism in Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June
22-24, 2019. ACM, 2019. https://doi.org/10.1145/3323165.
ieee: C. Scheideler and P. Berenbrink, Eds., The 31st ACM Symposium on Parallelism
in Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June 22-24, 2019.
ACM, 2019.
mla: Scheideler, Christian, and Petra Berenbrink, editors. The 31st ACM Symposium
on Parallelism in Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June
22-24, 2019. ACM, 2019, doi:10.1145/3323165.
short: C. Scheideler, P. Berenbrink, eds., The 31st ACM Symposium on Parallelism
in Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June 22-24, 2019,
ACM, 2019.
date_created: 2019-11-06T10:43:41Z
date_updated: 2022-01-06T06:52:07Z
department:
- _id: '79'
doi: 10.1145/3323165
editor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Petra
full_name: Berenbrink, Petra
last_name: Berenbrink
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
publication_identifier:
isbn:
- 978-1-4503-6184-2
publisher: ACM
status: public
title: The 31st ACM Symposium on Parallelism in Algorithms and Architectures, SPAA
2019, Phoenix, AZ, USA, June 22-24, 2019
type: conference_editor
user_id: '477'
year: '2019'
...
---
_id: '14830'
author:
- first_name: Robert
full_name: Gmyr, Robert
last_name: Gmyr
- first_name: Jonas
full_name: Lefevre, Jonas
last_name: Lefevre
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: Gmyr R, Lefevre J, Scheideler C. Self-Stabilizing Metric Graphs. Theory
Comput Syst. 2019;63(2):177-199. doi:10.1007/s00224-017-9823-4
apa: Gmyr, R., Lefevre, J., & Scheideler, C. (2019). Self-Stabilizing Metric
Graphs. Theory Comput. Syst., 63(2), 177–199. https://doi.org/10.1007/s00224-017-9823-4
bibtex: '@article{Gmyr_Lefevre_Scheideler_2019, title={Self-Stabilizing Metric Graphs},
volume={63}, DOI={10.1007/s00224-017-9823-4},
number={2}, journal={Theory Comput. Syst.}, author={Gmyr, Robert and Lefevre,
Jonas and Scheideler, Christian}, year={2019}, pages={177–199} }'
chicago: 'Gmyr, Robert, Jonas Lefevre, and Christian Scheideler. “Self-Stabilizing
Metric Graphs.” Theory Comput. Syst. 63, no. 2 (2019): 177–99. https://doi.org/10.1007/s00224-017-9823-4.'
ieee: R. Gmyr, J. Lefevre, and C. Scheideler, “Self-Stabilizing Metric Graphs,”
Theory Comput. Syst., vol. 63, no. 2, pp. 177–199, 2019.
mla: Gmyr, Robert, et al. “Self-Stabilizing Metric Graphs.” Theory Comput. Syst.,
vol. 63, no. 2, 2019, pp. 177–99, doi:10.1007/s00224-017-9823-4.
short: R. Gmyr, J. Lefevre, C. Scheideler, Theory Comput. Syst. 63 (2019) 177–199.
date_created: 2019-11-06T10:54:58Z
date_updated: 2022-01-06T06:52:07Z
department:
- _id: '79'
doi: 10.1007/s00224-017-9823-4
intvolume: ' 63'
issue: '2'
language:
- iso: eng
page: 177-199
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '13'
name: SFB 901 - Subproject C1
publication: Theory Comput. Syst.
status: public
title: Self-Stabilizing Metric Graphs
type: journal_article
user_id: '15504'
volume: 63
year: '2019'
...
---
_id: '14849'
author:
- first_name: Gavin Francis
full_name: Vaz, Gavin Francis
id: '30332'
last_name: Vaz
citation:
ama: Vaz GF. Using Just-in-Time Code Generation to Transparently Accelerate Applications
in Heterogeneous Systems. Universität Paderborn; 2019.
apa: Vaz, G. F. (2019). Using Just-in-Time Code Generation to Transparently Accelerate
Applications in Heterogeneous Systems. Universität Paderborn.
bibtex: '@book{Vaz_2019, title={Using Just-in-Time Code Generation to Transparently
Accelerate Applications in Heterogeneous Systems}, publisher={Universität Paderborn},
author={Vaz, Gavin Francis}, year={2019} }'
chicago: Vaz, Gavin Francis. Using Just-in-Time Code Generation to Transparently
Accelerate Applications in Heterogeneous Systems. Universität Paderborn, 2019.
ieee: G. F. Vaz, Using Just-in-Time Code Generation to Transparently Accelerate
Applications in Heterogeneous Systems. Universität Paderborn, 2019.
mla: Vaz, Gavin Francis. Using Just-in-Time Code Generation to Transparently
Accelerate Applications in Heterogeneous Systems. Universität Paderborn, 2019.
short: G.F. Vaz, Using Just-in-Time Code Generation to Transparently Accelerate
Applications in Heterogeneous Systems, Universität Paderborn, 2019.
date_created: 2019-11-07T14:13:54Z
date_updated: 2022-01-06T06:52:08Z
ddc:
- '040'
department:
- _id: '518'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2019-11-07T14:13:14Z
date_updated: 2019-11-07T14:13:14Z
file_id: '14850'
file_name: PhDThesis_GavinVaz_2019-07-11.pdf
file_size: 1462659
relation: main_file
success: 1
file_date_updated: 2019-11-07T14:13:14Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '14'
name: SFB 901 - Subproject C2
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
full_name: Plessl, Christian
id: '16153'
last_name: Plessl
orcid: 0000-0001-5728-9982
title: Using Just-in-Time Code Generation to Transparently Accelerate Applications
in Heterogeneous Systems
type: dissertation
user_id: '477'
year: '2019'
...