---
_id: '21639'
abstract:
- lang: eng
text: 'The development of effective business models is an essential task in highly
competitive markets like mobile ecosystems. Existing development methods for these
business models do not specifically focus that the development process profoundly
depends on the situation (e.g., market size, regulations) of the mobile app developer.
Here, a mismatch between method and situation can lead to poor resource management
and longer development cycles. In software engineering, situational method engineering
is used for software projects to configure a development method out of a method
repository based on the project situation. Analogously, we support creating situation-specific
business model development methods with a method base and new user roles. Here,
the method engineer obtains the knowledge of the domain expert and stores it in
the method base as elements, building blocks, and patterns. The expert knowledge
is derived from a grey literature review on mobile development processes. After
this, the method engineer constructs the development method based on the described
situation of the business developer. We provide an open-source tool and evaluate
it by constructing a local event platform''s business model development method. '
author:
- first_name: Sebastian
full_name: Gottschalk, Sebastian
id: '47208'
last_name: Gottschalk
- first_name: Enes
full_name: Yigitbas, Enes
id: '8447'
last_name: Yigitbas
orcid: 0000-0002-5967-833X
- first_name: Alexander
full_name: Nowosad, Alexander
last_name: Nowosad
- first_name: Gregor
full_name: Engels, Gregor
last_name: Engels
citation:
ama: 'Gottschalk S, Yigitbas E, Nowosad A, Engels G. Situation-specific Business
Model Development Methods for Mobile App Developers. In: Enterprise, Business-Process
and Information Systems Modeling. Springer; 2021. doi:10.1007/978-3-030-79186-5_17'
apa: Gottschalk, S., Yigitbas, E., Nowosad, A., & Engels, G. (2021). Situation-specific
Business Model Development Methods for Mobile App Developers. In Enterprise,
Business-Process and Information Systems Modeling. Springer. https://doi.org/10.1007/978-3-030-79186-5_17
bibtex: '@inproceedings{Gottschalk_Yigitbas_Nowosad_Engels_2021, title={Situation-specific
Business Model Development Methods for Mobile App Developers}, DOI={10.1007/978-3-030-79186-5_17},
booktitle={Enterprise, Business-Process and Information Systems Modeling}, publisher={Springer},
author={Gottschalk, Sebastian and Yigitbas, Enes and Nowosad, Alexander and Engels,
Gregor}, year={2021} }'
chicago: Gottschalk, Sebastian, Enes Yigitbas, Alexander Nowosad, and Gregor Engels.
“Situation-Specific Business Model Development Methods for Mobile App Developers.”
In Enterprise, Business-Process and Information Systems Modeling. Springer,
2021. https://doi.org/10.1007/978-3-030-79186-5_17.
ieee: S. Gottschalk, E. Yigitbas, A. Nowosad, and G. Engels, “Situation-specific
Business Model Development Methods for Mobile App Developers,” in Enterprise,
Business-Process and Information Systems Modeling, 2021.
mla: Gottschalk, Sebastian, et al. “Situation-Specific Business Model Development
Methods for Mobile App Developers.” Enterprise, Business-Process and Information
Systems Modeling, Springer, 2021, doi:10.1007/978-3-030-79186-5_17.
short: 'S. Gottschalk, E. Yigitbas, A. Nowosad, G. Engels, in: Enterprise, Business-Process
and Information Systems Modeling, Springer, 2021.'
date_created: 2021-04-20T13:23:41Z
date_updated: 2022-01-06T06:55:08Z
ddc:
- '000'
department:
- _id: '66'
- _id: '534'
doi: 10.1007/978-3-030-79186-5_17
file:
- access_level: open_access
content_type: application/pdf
creator: sego
date_created: 2021-07-20T16:19:27Z
date_updated: 2021-07-20T16:20:15Z
file_id: '22769'
file_name: EMMSAD21.pdf
file_size: 638707
relation: main_file
file_date_updated: 2021-07-20T16:20:15Z
has_accepted_license: '1'
keyword:
- Business Model Development
- Situational Method Engineering
- Mobile App
- Business Model Development Tools
language:
- iso: eng
oa: '1'
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '17'
name: SFB 901 - Subproject C5
publication: Enterprise, Business-Process and Information Systems Modeling
publisher: Springer
status: public
title: Situation-specific Business Model Development Methods for Mobile App Developers
type: conference
user_id: '47208'
year: '2021'
...
---
_id: '17905'
abstract:
- lang: eng
text: 'This chapter concentrates on aspect-based sentiment analysis, a form of opinion
mining where algorithms detect sentiments expressed about features of products,
services, etc. We especially focus on novel approaches for aspect phrase extraction
and classification trained on feature-rich datasets. Here, we present two new
datasets, which we gathered from the linguistically rich domain of physician reviews,
as other investigations have mainly concentrated on commercial reviews and social
media reviews so far. To give readers a better understanding of the underlying
datasets, we describe the annotation process and inter-annotator agreement in
detail. In our research, we automatically assess implicit mentions or indications
of specific aspects. To do this, we propose and utilize neural network models
that perform the here-defined aspect phrase extraction and classification task,
achieving F1-score values of about 80% and accuracy values of more than 90%. As
we apply our models to a comparatively complex domain, we obtain promising results. '
author:
- 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: 'Kersting J, Geierhos M. Towards Aspect Extraction and Classification for Opinion
Mining with Deep Sequence Networks. In: Loukanova R, ed. Natural Language Processing
in Artificial Intelligence -- NLPinAI 2020. Vol 939. Studies in Computational
Intelligence (SCI). Cham: Springer; 2021:163--189. doi:10.1007/978-3-030-63787-3_6'
apa: 'Kersting, J., & Geierhos, M. (2021). Towards Aspect Extraction and Classification
for Opinion Mining with Deep Sequence Networks. In R. Loukanova (Ed.), Natural
Language Processing in Artificial Intelligence -- NLPinAI 2020 (Vol. 939,
pp. 163--189). Cham: Springer. https://doi.org/10.1007/978-3-030-63787-3_6'
bibtex: '@inbook{Kersting_Geierhos_2021, place={Cham}, series={Studies in Computational
Intelligence (SCI)}, title={Towards Aspect Extraction and Classification for Opinion
Mining with Deep Sequence Networks}, volume={939}, DOI={10.1007/978-3-030-63787-3_6},
booktitle={Natural Language Processing in Artificial Intelligence -- NLPinAI 2020},
publisher={Springer}, author={Kersting, Joschka and Geierhos, Michaela}, editor={Loukanova,
RoussankaEditor}, year={2021}, pages={163--189}, collection={Studies in Computational
Intelligence (SCI)} }'
chicago: 'Kersting, Joschka, and Michaela Geierhos. “Towards Aspect Extraction and
Classification for Opinion Mining with Deep Sequence Networks.” In Natural
Language Processing in Artificial Intelligence -- NLPinAI 2020, edited by
Roussanka Loukanova, 939:163--189. Studies in Computational Intelligence (SCI).
Cham: Springer, 2021. https://doi.org/10.1007/978-3-030-63787-3_6.'
ieee: 'J. Kersting and M. Geierhos, “Towards Aspect Extraction and Classification
for Opinion Mining with Deep Sequence Networks,” in Natural Language Processing
in Artificial Intelligence -- NLPinAI 2020, vol. 939, R. Loukanova, Ed. Cham:
Springer, 2021, pp. 163--189.'
mla: Kersting, Joschka, and Michaela Geierhos. “Towards Aspect Extraction and Classification
for Opinion Mining with Deep Sequence Networks.” Natural Language Processing
in Artificial Intelligence -- NLPinAI 2020, edited by Roussanka Loukanova,
vol. 939, Springer, 2021, pp. 163--189, doi:10.1007/978-3-030-63787-3_6.
short: 'J. Kersting, M. Geierhos, in: R. Loukanova (Ed.), Natural Language Processing
in Artificial Intelligence -- NLPinAI 2020, Springer, Cham, 2021, pp. 163--189.'
date_created: 2020-08-13T09:29:52Z
date_updated: 2022-01-06T06:53:23Z
ddc:
- '000'
department:
- _id: '579'
doi: 10.1007/978-3-030-63787-3_6
editor:
- first_name: Roussanka
full_name: Loukanova, Roussanka
last_name: Loukanova
file:
- access_level: closed
content_type: application/pdf
creator: jkers
date_created: 2021-04-08T08:14:05Z
date_updated: 2021-04-08T08:14:05Z
file_id: '21594'
file_name: Kersting-Geierhos2021_Chapter_TowardsAspectExtractionAndClas.pdf
file_size: 512065
relation: main_file
success: 1
file_date_updated: 2021-04-08T08:14:05Z
has_accepted_license: '1'
intvolume: ' 939'
language:
- iso: eng
page: '163--189 '
place: Cham
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '9'
name: SFB 901 - Subproject B1
publication: Natural Language Processing in Artificial Intelligence -- NLPinAI 2020
publication_identifier:
unknown:
- 978-3-030-63786-6 ; 978-3-030-63787-3
publication_status: published
publisher: Springer
series_title: Studies in Computational Intelligence (SCI)
status: public
title: Towards Aspect Extraction and Classification for Opinion Mining with Deep Sequence
Networks
type: book_chapter
user_id: '58701'
volume: 939
year: '2021'
...
---
_id: '20683'
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
id: '41265'
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. Theory of Computing Systems. 2021;65:943–984. doi:10.1007/s00224-020-10023-8
apa: Feldkord, B., Knollmann, T., Malatyali, M., & Meyer auf der Heide, F. (2021).
Managing Multiple Mobile Resources. Theory of Computing Systems, 65,
943–984. https://doi.org/10.1007/s00224-020-10023-8
bibtex: '@article{Feldkord_Knollmann_Malatyali_Meyer auf der Heide_2021, title={Managing
Multiple Mobile Resources}, volume={65}, DOI={10.1007/s00224-020-10023-8},
journal={Theory of Computing Systems}, author={Feldkord, Björn and Knollmann,
Till and Malatyali, Manuel and Meyer auf der Heide, Friedhelm}, year={2021}, pages={943–984}
}'
chicago: 'Feldkord, Björn, Till Knollmann, Manuel Malatyali, and Friedhelm Meyer
auf der Heide. “Managing Multiple Mobile Resources.” Theory of Computing Systems
65 (2021): 943–984. https://doi.org/10.1007/s00224-020-10023-8.'
ieee: 'B. Feldkord, T. Knollmann, M. Malatyali, and F. Meyer auf der Heide, “Managing
Multiple Mobile Resources,” Theory of Computing Systems, vol. 65, pp. 943–984,
2021, doi: 10.1007/s00224-020-10023-8.'
mla: Feldkord, Björn, et al. “Managing Multiple Mobile Resources.” Theory of
Computing Systems, vol. 65, 2021, pp. 943–984, doi:10.1007/s00224-020-10023-8.
short: B. Feldkord, T. Knollmann, M. Malatyali, F. Meyer auf der Heide, Theory of
Computing Systems 65 (2021) 943–984.
date_created: 2020-12-08T08:40:10Z
date_updated: 2022-01-06T06:54:31Z
department:
- _id: '63'
doi: 10.1007/s00224-020-10023-8
intvolume: ' 65'
language:
- iso: eng
page: 943–984
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
publication: Theory of Computing Systems
publication_status: published
status: public
title: Managing Multiple Mobile Resources
type: journal_article
user_id: '15415'
volume: 65
year: '2021'
...
---
_id: '20693'
abstract:
- lang: eng
text: "In practical, large-scale networks, services are requested\r\nby users across
the globe, e.g., for video streaming.\r\nServices consist of multiple interconnected
components such as\r\nmicroservices in a service mesh. Coordinating these services\r\nrequires
scaling them according to continuously changing user\r\ndemand, deploying instances
at the edge close to their users,\r\nand routing traffic efficiently between users
and connected instances.\r\nNetwork and service coordination is commonly addressed\r\nthrough
centralized approaches, where a single coordinator\r\nknows everything and coordinates
the entire network globally.\r\nWhile such centralized approaches can reach global
optima, they\r\ndo not scale to large, realistic networks. In contrast, distributed\r\napproaches
scale well, but sacrifice solution quality due to their\r\nlimited scope of knowledge
and coordination decisions.\r\n\r\nTo this end, we propose a hierarchical coordination
approach\r\nthat combines the good solution quality of centralized approaches\r\nwith
the scalability of distributed approaches. In doing so, we divide\r\nthe network
into multiple hierarchical domains and optimize\r\ncoordination in a top-down
manner. We compare our hierarchical\r\nwith a centralized approach in an extensive
evaluation on a real-world\r\nnetwork topology. Our results indicate that hierarchical\r\ncoordination
can find close-to-optimal solutions in a fraction of\r\nthe runtime of centralized
approaches."
author:
- first_name: Stefan Balthasar
full_name: Schneider, Stefan Balthasar
id: '35343'
last_name: Schneider
orcid: 0000-0001-8210-4011
- first_name: Mirko
full_name: Jürgens, Mirko
last_name: Jürgens
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: 'Schneider SB, Jürgens M, Karl H. Divide and Conquer: Hierarchical Network
and Service Coordination. In: IFIP/IEEE International Symposium on Integrated
Network Management (IM). IFIP/IEEE; 2021.'
apa: 'Schneider, S. B., Jürgens, M., & Karl, H. (2021). Divide and Conquer:
Hierarchical Network and Service Coordination. In IFIP/IEEE International Symposium
on Integrated Network Management (IM). Bordeaux, France: IFIP/IEEE.'
bibtex: '@inproceedings{Schneider_Jürgens_Karl_2021, title={Divide and Conquer:
Hierarchical Network and Service Coordination}, booktitle={IFIP/IEEE International
Symposium on Integrated Network Management (IM)}, publisher={IFIP/IEEE}, author={Schneider,
Stefan Balthasar and Jürgens, Mirko and Karl, Holger}, year={2021} }'
chicago: 'Schneider, Stefan Balthasar, Mirko Jürgens, and Holger Karl. “Divide and
Conquer: Hierarchical Network and Service Coordination.” In IFIP/IEEE International
Symposium on Integrated Network Management (IM). IFIP/IEEE, 2021.'
ieee: 'S. B. Schneider, M. Jürgens, and H. Karl, “Divide and Conquer: Hierarchical
Network and Service Coordination,” in IFIP/IEEE International Symposium on
Integrated Network Management (IM), Bordeaux, France, 2021.'
mla: 'Schneider, Stefan Balthasar, et al. “Divide and Conquer: Hierarchical Network
and Service Coordination.” IFIP/IEEE International Symposium on Integrated
Network Management (IM), IFIP/IEEE, 2021.'
short: 'S.B. Schneider, M. Jürgens, H. Karl, in: IFIP/IEEE International Symposium
on Integrated Network Management (IM), IFIP/IEEE, 2021.'
conference:
location: Bordeaux, France
name: IFIP/IEEE International Symposium on Integrated Network Management (IM)
date_created: 2020-12-11T08:39:47Z
date_updated: 2022-01-06T06:54:32Z
ddc:
- '006'
department:
- _id: '75'
file:
- access_level: open_access
content_type: application/pdf
creator: stschn
date_created: 2020-12-11T08:37:37Z
date_updated: 2020-12-11T08:37:37Z
file_id: '20694'
file_name: preprint_with_header.pdf
file_size: 7979772
relation: main_file
title: 'Divide and Conquer: Hierarchical Network and Service Coordination'
file_date_updated: 2020-12-11T08:37:37Z
has_accepted_license: '1'
keyword:
- network management
- service management
- coordination
- hierarchical
- scalability
- nfv
language:
- iso: eng
oa: '1'
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '16'
name: SFB 901 - Subproject C4
publication: IFIP/IEEE International Symposium on Integrated Network Management (IM)
publisher: IFIP/IEEE
quality_controlled: '1'
status: public
title: 'Divide and Conquer: Hierarchical Network and Service Coordination'
type: conference
user_id: '35343'
year: '2021'
...
---
_id: '20817'
author:
- first_name: Marcin
full_name: Bienkowski, Marcin
last_name: Bienkowski
- first_name: Björn
full_name: Feldkord, Björn
id: '22704'
last_name: Feldkord
- first_name: Pawel
full_name: Schmidt, Pawel
last_name: Schmidt
citation:
ama: 'Bienkowski M, Feldkord B, Schmidt P. A Nearly Optimal Deterministic Online
Algorithm for Non-Metric Facility Location. In: Proceedings of the 38th Symposium
on Theoretical Aspects of Computer Science (STACS). ; 2021:14:1-14:17. doi:10.4230/LIPIcs.STACS.2021.14'
apa: Bienkowski, M., Feldkord, B., & Schmidt, P. (2021). A Nearly Optimal Deterministic
Online Algorithm for Non-Metric Facility Location. In Proceedings of the 38th
Symposium on Theoretical Aspects of Computer Science (STACS) (pp. 14:1-14:17).
https://doi.org/10.4230/LIPIcs.STACS.2021.14
bibtex: '@inproceedings{Bienkowski_Feldkord_Schmidt_2021, title={A Nearly Optimal
Deterministic Online Algorithm for Non-Metric Facility Location}, DOI={10.4230/LIPIcs.STACS.2021.14},
booktitle={Proceedings of the 38th Symposium on Theoretical Aspects of Computer
Science (STACS)}, author={Bienkowski, Marcin and Feldkord, Björn and Schmidt,
Pawel}, year={2021}, pages={14:1-14:17} }'
chicago: Bienkowski, Marcin, Björn Feldkord, and Pawel Schmidt. “A Nearly Optimal
Deterministic Online Algorithm for Non-Metric Facility Location.” In Proceedings
of the 38th Symposium on Theoretical Aspects of Computer Science (STACS),
14:1-14:17, 2021. https://doi.org/10.4230/LIPIcs.STACS.2021.14.
ieee: M. Bienkowski, B. Feldkord, and P. Schmidt, “A Nearly Optimal Deterministic
Online Algorithm for Non-Metric Facility Location,” in Proceedings of the 38th
Symposium on Theoretical Aspects of Computer Science (STACS), 2021, pp. 14:1-14:17.
mla: Bienkowski, Marcin, et al. “A Nearly Optimal Deterministic Online Algorithm
for Non-Metric Facility Location.” Proceedings of the 38th Symposium on Theoretical
Aspects of Computer Science (STACS), 2021, pp. 14:1-14:17, doi:10.4230/LIPIcs.STACS.2021.14.
short: 'M. Bienkowski, B. Feldkord, P. Schmidt, in: Proceedings of the 38th Symposium
on Theoretical Aspects of Computer Science (STACS), 2021, pp. 14:1-14:17.'
date_created: 2020-12-21T13:46:16Z
date_updated: 2022-01-06T06:54:40Z
department:
- _id: '63'
doi: 10.4230/LIPIcs.STACS.2021.14
language:
- iso: eng
page: 14:1 - 14:17
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 38th Symposium on Theoretical Aspects of Computer
Science (STACS)
publication_status: published
status: public
title: A Nearly Optimal Deterministic Online Algorithm for Non-Metric Facility Location
type: conference
user_id: '22704'
year: '2021'
...
---
_id: '22155'
author:
- first_name: Sebastian
full_name: Gottschalk, Sebastian
id: '47208'
last_name: Gottschalk
citation:
ama: 'Gottschalk S. Situation-specific Development of Business Models for Services
in Software Ecosystems. In: Advanced Software Engineering. Doctorial Consortium.
CEUR; 2021.'
apa: Gottschalk, S. (2021). Situation-specific Development of Business Models for
Services in Software Ecosystems. In Advanced Software Engineering. Doctorial
Consortium. CEUR.
bibtex: '@inproceedings{Gottschalk_2021, title={Situation-specific Development of
Business Models for Services in Software Ecosystems}, booktitle={Advanced Software
Engineering. Doctorial Consortium}, publisher={CEUR}, author={Gottschalk, Sebastian},
year={2021} }'
chicago: Gottschalk, Sebastian. “Situation-Specific Development of Business Models
for Services in Software Ecosystems.” In Advanced Software Engineering. Doctorial
Consortium. CEUR, 2021.
ieee: S. Gottschalk, “Situation-specific Development of Business Models for Services
in Software Ecosystems,” in Advanced Software Engineering. Doctorial Consortium,
2021.
mla: Gottschalk, Sebastian. “Situation-Specific Development of Business Models for
Services in Software Ecosystems.” Advanced Software Engineering. Doctorial
Consortium, CEUR, 2021.
short: 'S. Gottschalk, in: Advanced Software Engineering. Doctorial Consortium,
CEUR, 2021.'
date_created: 2021-05-11T12:46:07Z
date_updated: 2022-01-06T06:55:28Z
ddc:
- '000'
department:
- _id: '66'
- _id: '534'
file:
- access_level: open_access
content_type: application/pdf
creator: sego
date_created: 2021-07-20T16:16:05Z
date_updated: 2021-07-20T16:16:05Z
file_id: '22767'
file_name: CAISEDC21.pdf
file_size: 278027
relation: main_file
file_date_updated: 2021-07-20T16:16:05Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '17'
name: SFB 901 - Subproject C5
publication: Advanced Software Engineering. Doctorial Consortium
publisher: CEUR
status: public
title: Situation-specific Development of Business Models for Services in Software
Ecosystems
type: conference
user_id: '47208'
year: '2021'
...
---
_id: '22283'
abstract:
- lang: eng
text: " We show how to construct an overlay network of constant degree and diameter
$O(\\log n)$ in time $O(\\log n)$ starting from an arbitrary weakly connected
graph.\r\n We assume a synchronous communication network in which nodes can
send messages to nodes they know the identifier of and establish new connections
by sending node identifiers.\r\n If the initial network's graph is weakly connected
and has constant degree, then our algorithm constructs the desired topology with
each node sending and receiving only $O(\\log n)$ messages in each round in time
$O(\\log n)$, w.h.p., which beats the currently best $O(\\log^{3/2} n)$ time algorithm
of [Götte et al., SIROCCO'19].\r\n Since the problem cannot be solved faster
than by using pointer jumping for $O(\\log n)$ rounds (which would even require
each node to communicate $\\Omega(n)$ bits), our algorithm is asymptotically optimal.\r\n
\ We achieve this speedup by using short random walks to repeatedly establish
random connections between the nodes that quickly reduce the conductance of the
graph using an observation of [Kwok and Lau, APPROX'14].\r\n \r\n Additionally,
we show how our algorithm can be used to efficiently solve graph problems in \\emph{hybrid
networks} [Augustine et al., SODA'20].\r\n Motivated by the idea that nodes
possess two different modes of communication, we assume that communication of
the \\emph{initial} edges is unrestricted. In contrast, only polylogarithmically
many messages can be communicated over edges that have been established throughout
an algorithm's execution.\r\n For an (undirected) graph $G$ with arbitrary
degree, we show how to compute connected components, a spanning tree, and biconnected
components in time $O(\\log n)$, w.h.p.\r\n Furthermore, we show how to compute
an MIS in time $O(\\log d + \\log \\log n)$, w.h.p., where $d$ is the initial
degree of $G$."
author:
- first_name: Thorsten
full_name: Götte, Thorsten
id: '34727'
last_name: Götte
- first_name: Kristian
full_name: Hinnenthal, Kristian
id: '32229'
last_name: Hinnenthal
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Julian
full_name: Werthmann, Julian
id: '50024'
last_name: Werthmann
citation:
ama: 'Götte T, Hinnenthal K, Scheideler C, Werthmann J. Time-Optimal Construction
of Overlays. In: Censor-Hillel K, ed. Proc. of the 40th ACM Symposium on Principles
of Distributed Computing (PODC ’21). New York: ACM. doi:10.1145/3465084.3467932'
apa: 'Götte, T., Hinnenthal, K., Scheideler, C., & Werthmann, J. (n.d.). Time-Optimal
Construction of Overlays. In K. Censor-Hillel (Ed.), Proc. of the 40th ACM
Symposium on Principles of Distributed Computing (PODC ’21). New York: ACM.
https://doi.org/10.1145/3465084.3467932'
bibtex: '@inproceedings{Götte_Hinnenthal_Scheideler_Werthmann, place={New York},
title={Time-Optimal Construction of Overlays}, DOI={10.1145/3465084.3467932},
booktitle={Proc. of the 40th ACM Symposium on Principles of Distributed Computing
(PODC ’21)}, publisher={ACM}, author={Götte, Thorsten and Hinnenthal, Kristian
and Scheideler, Christian and Werthmann, Julian}, editor={Censor-Hillel, KerenEditor}
}'
chicago: 'Götte, Thorsten, Kristian Hinnenthal, Christian Scheideler, and Julian
Werthmann. “Time-Optimal Construction of Overlays.” In Proc. of the 40th ACM
Symposium on Principles of Distributed Computing (PODC ’21), edited by Keren
Censor-Hillel. New York: ACM, n.d. https://doi.org/10.1145/3465084.3467932.'
ieee: T. Götte, K. Hinnenthal, C. Scheideler, and J. Werthmann, “Time-Optimal Construction
of Overlays,” in Proc. of the 40th ACM Symposium on Principles of Distributed
Computing (PODC ’21), Virtual.
mla: Götte, Thorsten, et al. “Time-Optimal Construction of Overlays.” Proc. of
the 40th ACM Symposium on Principles of Distributed Computing (PODC ’21),
edited by Keren Censor-Hillel, ACM, doi:10.1145/3465084.3467932.
short: 'T. Götte, K. Hinnenthal, C. Scheideler, J. Werthmann, in: K. Censor-Hillel
(Ed.), Proc. of the 40th ACM Symposium on Principles of Distributed Computing
(PODC ’21), ACM, New York, n.d.'
conference:
end_date: 2021-07-30
location: Virtual
name: ACM Symposium on Principles of Distributed Computing (PODC)
start_date: 2021-07-26
date_created: 2021-06-06T19:10:26Z
date_updated: 2022-01-06T06:55:30Z
ddc:
- '000'
department:
- _id: '34'
doi: 10.1145/3465084.3467932
editor:
- first_name: Keren
full_name: Censor-Hillel, Keren
last_name: Censor-Hillel
file:
- access_level: closed
content_type: application/pdf
creator: thgoette
date_created: 2021-06-06T19:12:49Z
date_updated: 2021-06-06T19:12:49Z
file_id: '22284'
file_name: Wicked_Fast_Overlay_Construction(1).pdf
file_size: 590875
relation: main_file
success: 1
file_date_updated: 2021-06-06T19:12:49Z
has_accepted_license: '1'
language:
- iso: eng
place: New York
project:
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
- _id: '4'
name: SFB 901 - Project Area C
- _id: '13'
name: SFB 901 - Subproject C1
- _id: '1'
name: SFB 901
publication: Proc. of the 40th ACM Symposium on Principles of Distributed Computing
(PODC '21)
publication_status: accepted
publisher: ACM
status: public
title: Time-Optimal Construction of Overlays
type: conference
user_id: '477'
year: '2021'
...
---
_id: '22304'
author:
- first_name: Stefan
full_name: Schott, Stefan
id: '54847'
last_name: Schott
citation:
ama: Schott S. Android App Analysis Benchmark Case Generation. Paderborn;
2021.
apa: Schott, S. (2021). Android App Analysis Benchmark Case Generation. Paderborn.
bibtex: '@book{Schott_2021, place={Paderborn}, title={Android App Analysis Benchmark
Case Generation}, author={Schott, Stefan}, year={2021} }'
chicago: Schott, Stefan. Android App Analysis Benchmark Case Generation.
Paderborn, 2021.
ieee: S. Schott, Android App Analysis Benchmark Case Generation. Paderborn,
2021.
mla: Schott, Stefan. Android App Analysis Benchmark Case Generation. 2021.
short: S. Schott, Android App Analysis Benchmark Case Generation, Paderborn, 2021.
date_created: 2021-06-09T06:04:12Z
date_updated: 2022-01-06T06:55:31Z
ddc:
- '000'
department:
- _id: '77'
extern: '1'
file:
- access_level: open_access
content_type: application/pdf
creator: fpauck
date_created: 2021-06-09T06:01:45Z
date_updated: 2021-06-09T06:01:45Z
file_id: '22305'
file_name: Masters_Thesis_Stefan_Schott_unsigned.pdf
file_size: 1918444
relation: main_file
file_date_updated: 2021-06-09T06:01:45Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
place: Paderborn
project:
- _id: '1'
name: SFB 901
- _id: '12'
name: SFB 901 - Subproject B4
- _id: '3'
name: SFB 901 - Project Area B
status: public
supervisor:
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
title: Android App Analysis Benchmark Case Generation
type: mastersthesis
user_id: '477'
year: '2021'
...
---
_id: '22483'
abstract:
- lang: eng
text: This bachelor thesis presents a C/C++ implementation of the XCS algorithm
for an embedded system and profiling results concerning the execution time of
the functions. These are then analyzed in relation to the input characteristics
of the examined learning environments and compared with related work. Three main
conclusions can be drawn from the measured results. First, the maximum size of
the population of the classifiers influences the runtime of the genetic algorithm;
second, the size of the input space has a direct effect on the execution time
of the matching function; and last, a larger action space results in a longer
runtime generating the prediction for the possible actions. The dependencies identified
here can serve to optimize the computational efficiency and make XCS more suitable
for embedded systems.
author:
- first_name: Mathis
full_name: Brede, Mathis
last_name: Brede
citation:
ama: 'Brede M. Implementation and Profiling of XCS in the Context of Embedded
Systems. Paderborn: Paderborn University; 2021.'
apa: 'Brede, M. (2021). Implementation and Profiling of XCS in the Context of
Embedded Systems. Paderborn: Paderborn University.'
bibtex: '@book{Brede_2021, place={Paderborn}, title={Implementation and Profiling
of XCS in the Context of Embedded Systems}, publisher={Paderborn University},
author={Brede, Mathis}, year={2021} }'
chicago: 'Brede, Mathis. Implementation and Profiling of XCS in the Context of
Embedded Systems. Paderborn: Paderborn University, 2021.'
ieee: 'M. Brede, Implementation and Profiling of XCS in the Context of Embedded
Systems. Paderborn: Paderborn University, 2021.'
mla: Brede, Mathis. Implementation and Profiling of XCS in the Context of Embedded
Systems. Paderborn University, 2021.
short: M. Brede, Implementation and Profiling of XCS in the Context of Embedded
Systems, Paderborn University, Paderborn, 2021.
date_created: 2021-06-21T09:35:03Z
date_updated: 2022-01-06T06:55:33Z
department:
- _id: '78'
extern: '1'
language:
- iso: eng
place: Paderborn
project:
- _id: '14'
name: SFB 901 - Subproject C2
- _id: '4'
name: SFB 901 - Project Area C
- _id: '1'
name: SFB 901
publisher: Paderborn University
status: public
supervisor:
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
- first_name: Tim
full_name: Hansmeier, Tim
id: '49992'
last_name: Hansmeier
orcid: 0000-0003-1377-3339
title: Implementation and Profiling of XCS in the Context of Embedded Systems
type: bachelorsthesis
user_id: '477'
year: '2021'
...
---
_id: '22803'
author:
- first_name: Paula
full_name: Frieden, Paula
last_name: Frieden
citation:
ama: Frieden P. Experimentelle Untersuchung der Visualisierung von Geschäftsmodell-Abhängigkeiten
und dessen Auswirkung auf das Verständnis der Nutzer von Geschäftsmodellen.
Universität Paderborn; 2021.
apa: Frieden, P. (2021). Experimentelle Untersuchung der Visualisierung von Geschäftsmodell-Abhängigkeiten
und dessen Auswirkung auf das Verständnis der Nutzer von Geschäftsmodellen.
Universität Paderborn.
bibtex: '@book{Frieden_2021, place={Universität Paderborn}, title={Experimentelle
Untersuchung der Visualisierung von Geschäftsmodell-Abhängigkeiten und dessen
Auswirkung auf das Verständnis der Nutzer von Geschäftsmodellen}, author={Frieden,
Paula}, year={2021} }'
chicago: Frieden, Paula. Experimentelle Untersuchung der Visualisierung von Geschäftsmodell-Abhängigkeiten
und dessen Auswirkung auf das Verständnis der Nutzer von Geschäftsmodellen.
Universität Paderborn, 2021.
ieee: P. Frieden, Experimentelle Untersuchung der Visualisierung von Geschäftsmodell-Abhängigkeiten
und dessen Auswirkung auf das Verständnis der Nutzer von Geschäftsmodellen.
Universität Paderborn, 2021.
mla: Frieden, Paula. Experimentelle Untersuchung der Visualisierung von Geschäftsmodell-Abhängigkeiten
und dessen Auswirkung auf das Verständnis der Nutzer von Geschäftsmodellen.
2021.
short: P. Frieden, Experimentelle Untersuchung der Visualisierung von Geschäftsmodell-Abhängigkeiten
und dessen Auswirkung auf das Verständnis der Nutzer von Geschäftsmodellen, Universität
Paderborn, 2021.
date_created: 2021-07-23T08:46:29Z
date_updated: 2022-01-06T06:55:41Z
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: Experimentelle Untersuchung der Visualisierung von Geschäftsmodell-Abhängigkeiten
und dessen Auswirkung auf das Verständnis der Nutzer von Geschäftsmodellen
type: mastersthesis
user_id: '16205'
year: '2021'
...
---
_id: '22913'
author:
- first_name: Eyke
full_name: Hüllermeier, Eyke
id: '48129'
last_name: Hüllermeier
- first_name: Felix
full_name: Mohr, Felix
last_name: Mohr
- first_name: Alexander
full_name: Tornede, Alexander
id: '38209'
last_name: Tornede
- first_name: Marcel Dominik
full_name: Wever, Marcel Dominik
id: '33176'
last_name: Wever
orcid: ' https://orcid.org/0000-0001-9782-6818'
citation:
ama: 'Hüllermeier E, Mohr F, Tornede A, Wever MD. Automated Machine Learning, Bounded
Rationality, and Rational Metareasoning. In: ; 2021.'
apa: Hüllermeier, E., Mohr, F., Tornede, A., & Wever, M. D. (2021). Automated
Machine Learning, Bounded Rationality, and Rational Metareasoning. ECML/PKDD
Workshop on Automating Data Science, Bilbao (Virtual).
bibtex: '@inproceedings{Hüllermeier_Mohr_Tornede_Wever_2021, title={Automated Machine
Learning, Bounded Rationality, and Rational Metareasoning}, author={Hüllermeier,
Eyke and Mohr, Felix and Tornede, Alexander and Wever, Marcel Dominik}, year={2021}
}'
chicago: Hüllermeier, Eyke, Felix Mohr, Alexander Tornede, and Marcel Dominik Wever.
“Automated Machine Learning, Bounded Rationality, and Rational Metareasoning,”
2021.
ieee: E. Hüllermeier, F. Mohr, A. Tornede, and M. D. Wever, “Automated Machine Learning,
Bounded Rationality, and Rational Metareasoning,” presented at the ECML/PKDD Workshop
on Automating Data Science, Bilbao (Virtual), 2021.
mla: Hüllermeier, Eyke, et al. Automated Machine Learning, Bounded Rationality,
and Rational Metareasoning. 2021.
short: 'E. Hüllermeier, F. Mohr, A. Tornede, M.D. Wever, in: 2021.'
conference:
end_date: 2021-09-17
location: Bilbao (Virtual)
name: ECML/PKDD Workshop on Automating Data Science
start_date: 2021-09-13
date_created: 2021-08-02T07:46:29Z
date_updated: 2022-01-06T06:55:43Z
department:
- _id: '34'
- _id: '355'
- _id: '26'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '10'
name: SFB 901 - Subproject B2
quality_controlled: '1'
status: public
title: Automated Machine Learning, Bounded Rationality, and Rational Metareasoning
type: conference
user_id: '5786'
year: '2021'
...
---
_id: '22927'
author:
- first_name: John
full_name: Derrick, John
last_name: Derrick
- first_name: Simon
full_name: Doherty, Simon
last_name: Doherty
- first_name: Brijesh
full_name: Dongol, Brijesh
last_name: Dongol
- first_name: Gerhard
full_name: Schellhorn, Gerhard
last_name: Schellhorn
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Derrick J, Doherty S, Dongol B, Schellhorn G, Wehrheim H. On Strong Observational
Refinement and Forward Simulation. In: Proceedings of the 35th International
Symposium on Distributed Computing (DISC). Leibniz International Proceedings
in Informatics. Schloß Dagstuhl.'
apa: Derrick, J., Doherty, S., Dongol, B., Schellhorn, G., & Wehrheim, H. (n.d.).
On Strong Observational Refinement and Forward Simulation. In Proceedings of
the 35th International Symposium on Distributed Computing (DISC). Schloß Dagstuhl.
bibtex: '@inproceedings{Derrick_Doherty_Dongol_Schellhorn_Wehrheim, series={Leibniz
International Proceedings in Informatics}, title={On Strong Observational Refinement
and Forward Simulation}, booktitle={Proceedings of the 35th International Symposium
on Distributed Computing (DISC)}, publisher={Schloß Dagstuhl}, author={Derrick,
John and Doherty, Simon and Dongol, Brijesh and Schellhorn, Gerhard and Wehrheim,
Heike}, collection={Leibniz International Proceedings in Informatics} }'
chicago: Derrick, John, Simon Doherty, Brijesh Dongol, Gerhard Schellhorn, and Heike
Wehrheim. “On Strong Observational Refinement and Forward Simulation.” In Proceedings
of the 35th International Symposium on Distributed Computing (DISC). Leibniz
International Proceedings in Informatics. Schloß Dagstuhl, n.d.
ieee: J. Derrick, S. Doherty, B. Dongol, G. Schellhorn, and H. Wehrheim, “On Strong
Observational Refinement and Forward Simulation,” in Proceedings of the 35th
International Symposium on Distributed Computing (DISC).
mla: Derrick, John, et al. “On Strong Observational Refinement and Forward Simulation.”
Proceedings of the 35th International Symposium on Distributed Computing (DISC),
Schloß Dagstuhl.
short: 'J. Derrick, S. Doherty, B. Dongol, G. Schellhorn, H. Wehrheim, in: Proceedings
of the 35th International Symposium on Distributed Computing (DISC), Schloß Dagstuhl,
n.d.'
date_created: 2021-08-03T07:38:56Z
date_updated: 2022-01-06T06:55:43Z
department:
- _id: '7'
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: Proceedings of the 35th International Symposium on Distributed Computing
(DISC)
publication_status: accepted
publisher: Schloß Dagstuhl
series_title: Leibniz International Proceedings in Informatics
status: public
title: On Strong Observational Refinement and Forward Simulation
type: conference
user_id: '477'
year: '2021'
...
---
_id: '21727'
abstract:
- lang: eng
text: 'Platform-based business models underlie the success of many of today’s largest,
fastest-growing, and most disruptive companies. Despite the success of prominent
examples, such as Uber and Airbnb, creating a profitable platform ecosystem presents
a key challenge for many companies across all industries. Although research provides
knowledge about platforms’ different value drivers (e.g., network effects), companies
that seek to transform their current business model into a platform-based one
lack an artifact to reduce knowledge boundaries, collaborate effectively, and
cope with the complexities and dynamics of platform ecosystems. We address this
challenge by developing two artifacts and combining research from variability
modeling, business model dependencies, and system dynamics. This paper presents
a design science research approach to develop the platform ecosystem modeling
language and the platform ecosystem development tool that support researcher and
practitioner by visualizing and simulating platform ecosystems. '
author:
- first_name: Christian
full_name: Vorbohle, Christian
id: '29951'
last_name: Vorbohle
- first_name: Sebastian
full_name: Gottschalk, Sebastian
id: '47208'
last_name: Gottschalk
citation:
ama: 'Vorbohle C, Gottschalk S. Towards Visualizing and Simulating Business Models
in Dynamic Platform Ecosystems . In: Proceedings of the 29th European Conference
on Information Systems (ECIS). AIS.'
apa: 'Vorbohle, C., & Gottschalk, S. (n.d.). Towards Visualizing and Simulating
Business Models in Dynamic Platform Ecosystems . In Proceedings of the 29th
European Conference on Information Systems (ECIS). Virtual Conference/Workshop:
AIS.'
bibtex: '@inproceedings{Vorbohle_Gottschalk, title={Towards Visualizing and Simulating
Business Models in Dynamic Platform Ecosystems }, booktitle={Proceedings of the
29th European Conference on Information Systems (ECIS)}, publisher={AIS}, author={Vorbohle,
Christian and Gottschalk, Sebastian} }'
chicago: Vorbohle, Christian, and Sebastian Gottschalk. “Towards Visualizing and
Simulating Business Models in Dynamic Platform Ecosystems .” In Proceedings
of the 29th European Conference on Information Systems (ECIS). AIS, n.d.
ieee: C. Vorbohle and S. Gottschalk, “Towards Visualizing and Simulating Business
Models in Dynamic Platform Ecosystems ,” in Proceedings of the 29th European
Conference on Information Systems (ECIS), Virtual Conference/Workshop.
mla: Vorbohle, Christian, and Sebastian Gottschalk. “Towards Visualizing and Simulating
Business Models in Dynamic Platform Ecosystems .” Proceedings of the 29th European
Conference on Information Systems (ECIS), AIS.
short: 'C. Vorbohle, S. Gottschalk, in: Proceedings of the 29th European Conference
on Information Systems (ECIS), AIS, n.d.'
conference:
location: Virtual Conference/Workshop
name: 29th European Conference on Information Systems (ECIS)
date_created: 2021-04-23T13:38:54Z
date_updated: 2022-01-06T06:55:12Z
department:
- _id: '66'
- _id: '534'
- _id: '276'
keyword:
- Platform Ecosystems
- Platform Ecosystem Modeling Language
- Platform Ecosystem Development Tool
- Business Models
- Design Science
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '17'
name: SFB 901 - Subproject C5
publication: Proceedings of the 29th European Conference on Information Systems (ECIS)
publication_status: accepted
publisher: AIS
status: public
title: 'Towards Visualizing and Simulating Business Models in Dynamic Platform Ecosystems '
type: conference
user_id: '47208'
year: '2021'
...
---
_id: '21799'
author:
- first_name: K.
full_name: Kutzner, K.
last_name: Kutzner
- first_name: M.
full_name: Stadtländer, M.
last_name: Stadtländer
- first_name: Janina
full_name: Seutter, Janina
id: '64464'
last_name: Seutter
- first_name: Dennis
full_name: Kundisch, Dennis
id: '21117'
last_name: Kundisch
- first_name: R.
full_name: Knackstedt, R.
last_name: Knackstedt
citation:
ama: 'Kutzner K, Stadtländer M, Seutter J, Kundisch D, Knackstedt R. ”Sorry, Too
Much Information” Designing Online Review Systems that Support Information Search
and Processing. In: Proceedings of the 29th European Conference on Information
Systems (ECIS). ; 2021.'
apa: Kutzner, K., Stadtländer, M., Seutter, J., Kundisch, D., & Knackstedt,
R. (2021). ”Sorry, Too Much Information” Designing Online Review Systems that
Support Information Search and Processing. In Proceedings of the 29th European
Conference on Information Systems (ECIS). Virtual Conference/Workshop.
bibtex: '@inproceedings{Kutzner_Stadtländer_Seutter_Kundisch_Knackstedt_2021, title={”Sorry,
Too Much Information” Designing Online Review Systems that Support Information
Search and Processing}, booktitle={Proceedings of the 29th European Conference
on Information Systems (ECIS)}, author={Kutzner, K. and Stadtländer, M. and Seutter,
Janina and Kundisch, Dennis and Knackstedt, R.}, year={2021} }'
chicago: Kutzner, K., M. Stadtländer, Janina Seutter, Dennis Kundisch, and R. Knackstedt.
“”Sorry, Too Much Information” Designing Online Review Systems That Support Information
Search and Processing.” In Proceedings of the 29th European Conference on Information
Systems (ECIS), 2021.
ieee: K. Kutzner, M. Stadtländer, J. Seutter, D. Kundisch, and R. Knackstedt, “”Sorry,
Too Much Information” Designing Online Review Systems that Support Information
Search and Processing,” in Proceedings of the 29th European Conference on Information
Systems (ECIS), Virtual Conference/Workshop, 2021.
mla: Kutzner, K., et al. “”Sorry, Too Much Information” Designing Online Review
Systems That Support Information Search and Processing.” Proceedings of the
29th European Conference on Information Systems (ECIS), 2021.
short: 'K. Kutzner, M. Stadtländer, J. Seutter, D. Kundisch, R. Knackstedt, in:
Proceedings of the 29th European Conference on Information Systems (ECIS), 2021.'
conference:
location: Virtual Conference/Workshop
name: 29th European Conference on Information Systems (ECIS)
date_created: 2021-04-26T10:46:22Z
date_updated: 2022-01-06T06:55:13Z
department:
- _id: '276'
language:
- iso: eng
project:
- _id: '2'
name: SFB 901 - Project Area A
- _id: '8'
name: SFB 901 - Subproject A4
- _id: '1'
name: SFB 901
publication: Proceedings of the 29th European Conference on Information Systems (ECIS)
status: public
title: ”Sorry, Too Much Information” Designing Online Review Systems that Support
Information Search and Processing
type: conference
user_id: '477'
year: '2021'
...
---
_id: '21808'
abstract:
- lang: eng
text: "Modern services consist of interconnected components,e.g., microservices
in a service mesh or machine learning functions in a pipeline. These services
can scale and run across multiple network nodes on demand. To process incoming
traffic, service components have to be instantiated and traffic assigned to these
instances, taking capacities, changing demands, and Quality of Service (QoS) requirements
into account. This challenge is usually solved with custom approaches designed
by experts. While this typically works well for the considered scenario, the models
often rely on unrealistic assumptions or on knowledge that is not available in
practice (e.g., a priori knowledge).\r\n\r\nWe propose DeepCoord, a novel deep
reinforcement learning approach that learns how to best coordinate services and
is geared towards realistic assumptions. It interacts with the network and relies
on available, possibly delayed monitoring information. Rather than defining a
complex model or an algorithm on how to achieve an objective, our model-free approach
adapts to various objectives and traffic patterns. An agent is trained offline
without expert knowledge and then applied online with minimal overhead. Compared
to a state-of-the-art heuristic, DeepCoord significantly improves flow throughput
(up to 76%) and overall network utility (more than 2x) on realworld network topologies
and traffic traces. It also supports optimizing multiple, possibly competing objectives,
learns to respect QoS requirements, generalizes to scenarios with unseen, stochastic
traffic, and scales to large real-world networks. For reproducibility and reuse,
our code is publicly available."
article_type: original
author:
- first_name: Stefan Balthasar
full_name: Schneider, Stefan Balthasar
id: '35343'
last_name: Schneider
orcid: 0000-0001-8210-4011
- first_name: Ramin
full_name: Khalili, Ramin
last_name: Khalili
- first_name: Adnan
full_name: Manzoor, Adnan
last_name: Manzoor
- first_name: Haydar
full_name: Qarawlus, Haydar
last_name: Qarawlus
- first_name: Rafael
full_name: Schellenberg, Rafael
last_name: Schellenberg
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
- first_name: Artur
full_name: Hecker, Artur
last_name: Hecker
citation:
ama: Schneider SB, Khalili R, Manzoor A, et al. Self-Learning Multi-Objective Service
Coordination Using Deep Reinforcement Learning. Transactions on Network and
Service Management. 2021. doi:10.1109/TNSM.2021.3076503
apa: Schneider, S. B., Khalili, R., Manzoor, A., Qarawlus, H., Schellenberg, R.,
Karl, H., & Hecker, A. (2021). Self-Learning Multi-Objective Service Coordination
Using Deep Reinforcement Learning. Transactions on Network and Service Management.
https://doi.org/10.1109/TNSM.2021.3076503
bibtex: '@article{Schneider_Khalili_Manzoor_Qarawlus_Schellenberg_Karl_Hecker_2021,
title={Self-Learning Multi-Objective Service Coordination Using Deep Reinforcement
Learning}, DOI={10.1109/TNSM.2021.3076503},
journal={Transactions on Network and Service Management}, publisher={IEEE}, author={Schneider,
Stefan Balthasar and Khalili, Ramin and Manzoor, Adnan and Qarawlus, Haydar and
Schellenberg, Rafael and Karl, Holger and Hecker, Artur}, year={2021} }'
chicago: Schneider, Stefan Balthasar, Ramin Khalili, Adnan Manzoor, Haydar Qarawlus,
Rafael Schellenberg, Holger Karl, and Artur Hecker. “Self-Learning Multi-Objective
Service Coordination Using Deep Reinforcement Learning.” Transactions on Network
and Service Management, 2021. https://doi.org/10.1109/TNSM.2021.3076503.
ieee: S. B. Schneider et al., “Self-Learning Multi-Objective Service Coordination
Using Deep Reinforcement Learning,” Transactions on Network and Service Management,
2021.
mla: Schneider, Stefan Balthasar, et al. “Self-Learning Multi-Objective Service
Coordination Using Deep Reinforcement Learning.” Transactions on Network and
Service Management, IEEE, 2021, doi:10.1109/TNSM.2021.3076503.
short: S.B. Schneider, R. Khalili, A. Manzoor, H. Qarawlus, R. Schellenberg, H.
Karl, A. Hecker, Transactions on Network and Service Management (2021).
date_created: 2021-04-27T08:04:16Z
date_updated: 2022-01-06T06:55:15Z
ddc:
- '000'
department:
- _id: '75'
doi: 10.1109/TNSM.2021.3076503
file:
- access_level: open_access
content_type: application/pdf
creator: stschn
date_created: 2021-04-27T08:01:26Z
date_updated: 2021-04-27T08:01:26Z
description: Author version of the accepted paper
file_id: '21809'
file_name: ris-accepted-version.pdf
file_size: 4172270
relation: main_file
file_date_updated: 2021-04-27T08:01:26Z
has_accepted_license: '1'
keyword:
- network management
- service management
- coordination
- reinforcement learning
- self-learning
- self-adaptation
- multi-objective
language:
- iso: eng
oa: '1'
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '16'
name: SFB 901 - Subproject C4
publication: Transactions on Network and Service Management
publisher: IEEE
status: public
title: Self-Learning Multi-Objective Service Coordination Using Deep Reinforcement
Learning
type: journal_article
user_id: '35343'
year: '2021'
...
---
_id: '21812'
author:
- first_name: Christian
full_name: Vorbohle, Christian
id: '29951'
last_name: Vorbohle
- first_name: Daniel
full_name: Szopinski, Daniel
id: '36372'
last_name: Szopinski
- first_name: Dennis
full_name: Kundisch, Dennis
id: '21117'
last_name: Kundisch
citation:
ama: 'Vorbohle C, Szopinski D, Kundisch D. Toward Understanding the Complexity of
Business Models – A Taxonomy of Business Model Dependencies. In: Proceedings
of the 29th European Conference on Information Systems (ECIS). ; 2021.'
apa: Vorbohle, C., Szopinski, D., & Kundisch, D. (2021). Toward Understanding
the Complexity of Business Models – A Taxonomy of Business Model Dependencies.
In Proceedings of the 29th European Conference on Information Systems (ECIS).
Virtual Conference/Workshop.
bibtex: '@inproceedings{Vorbohle_Szopinski_Kundisch_2021, title={Toward Understanding
the Complexity of Business Models – A Taxonomy of Business Model Dependencies},
booktitle={Proceedings of the 29th European Conference on Information Systems
(ECIS)}, author={Vorbohle, Christian and Szopinski, Daniel and Kundisch, Dennis},
year={2021} }'
chicago: Vorbohle, Christian, Daniel Szopinski, and Dennis Kundisch. “Toward Understanding
the Complexity of Business Models – A Taxonomy of Business Model Dependencies.”
In Proceedings of the 29th European Conference on Information Systems (ECIS),
2021.
ieee: C. Vorbohle, D. Szopinski, and D. Kundisch, “Toward Understanding the Complexity
of Business Models – A Taxonomy of Business Model Dependencies,” in Proceedings
of the 29th European Conference on Information Systems (ECIS), Virtual Conference/Workshop,
2021.
mla: Vorbohle, Christian, et al. “Toward Understanding the Complexity of Business
Models – A Taxonomy of Business Model Dependencies.” Proceedings of the 29th
European Conference on Information Systems (ECIS), 2021.
short: 'C. Vorbohle, D. Szopinski, D. Kundisch, in: Proceedings of the 29th European
Conference on Information Systems (ECIS), 2021.'
conference:
location: Virtual Conference/Workshop
name: 29th European Conference on Information Systems (ECIS)
date_created: 2021-04-28T08:22:41Z
date_updated: 2022-01-06T06:55:15Z
department:
- _id: '276'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '17'
name: SFB 901 - Subproject C5
publication: Proceedings of the 29th European Conference on Information Systems (ECIS)
status: public
title: Toward Understanding the Complexity of Business Models – A Taxonomy of Business
Model Dependencies
type: conference
user_id: '477'
year: '2021'
...
---
_id: '22051'
author:
- 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: 'Kersting J, Geierhos M. Well-being in Plastic Surgery: Deep Learning Reveals
Patients’ Evaluations. In: Proceedings of the 10th International Conference
on Data Science, Technology and Applications (DATA 2021). SCITEPRESS; 2021:275--284.'
apa: 'Kersting, J., & Geierhos, M. (2021). Well-being in Plastic Surgery: Deep
Learning Reveals Patients’ Evaluations. Proceedings of the 10th International
Conference on Data Science, Technology and Applications (DATA 2021), 275--284.'
bibtex: '@inproceedings{Kersting_Geierhos_2021, place={Online}, title={Well-being
in Plastic Surgery: Deep Learning Reveals Patients’ Evaluations}, booktitle={Proceedings
of the 10th International Conference on Data Science, Technology and Applications
(DATA 2021)}, publisher={SCITEPRESS}, author={Kersting, Joschka and Geierhos,
Michaela}, year={2021}, pages={275--284} }'
chicago: 'Kersting, Joschka, and Michaela Geierhos. “Well-Being in Plastic Surgery:
Deep Learning Reveals Patients’ Evaluations.” In Proceedings of the 10th International
Conference on Data Science, Technology and Applications (DATA 2021), 275--284.
Online: SCITEPRESS, 2021.'
ieee: 'J. Kersting and M. Geierhos, “Well-being in Plastic Surgery: Deep Learning
Reveals Patients’ Evaluations,” in Proceedings of the 10th International Conference
on Data Science, Technology and Applications (DATA 2021), Online, 2021, pp.
275--284.'
mla: 'Kersting, Joschka, and Michaela Geierhos. “Well-Being in Plastic Surgery:
Deep Learning Reveals Patients’ Evaluations.” Proceedings of the 10th International
Conference on Data Science, Technology and Applications (DATA 2021), SCITEPRESS,
2021, pp. 275--284.'
short: 'J. Kersting, M. Geierhos, in: Proceedings of the 10th International Conference
on Data Science, Technology and Applications (DATA 2021), SCITEPRESS, Online,
2021, pp. 275--284.'
conference:
end_date: 2021-07-08
location: Online
name: 10th International Conference on Data Science, Technology and Applications
(DATA 2021)
start_date: 2021-07-06
date_created: 2021-05-07T16:27:27Z
date_updated: 2022-01-06T06:55:23Z
department:
- _id: '579'
language:
- iso: eng
page: 275--284
place: Online
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '9'
name: SFB 901 - Subproject B1
publication: Proceedings of the 10th International Conference on Data Science, Technology
and Applications (DATA 2021)
publication_status: published
publisher: SCITEPRESS
status: public
title: 'Well-being in Plastic Surgery: Deep Learning Reveals Patients'' Evaluations'
type: conference
user_id: '58701'
year: '2021'
...
---
_id: '22057'
abstract:
- lang: eng
text: "We construct more efficient cryptosystems with provable\r\nsecurity against
adaptive attacks, based on simple and natural hardness\r\nassumptions in the standard
model. Concretely, we describe:\r\n– An adaptively-secure variant of the efficient,
selectively-secure LWE-\r\nbased identity-based encryption (IBE) scheme of Agrawal,
Boneh,\r\nand Boyen (EUROCRYPT 2010). In comparison to the previously\r\nmost
efficient such scheme by Yamada (CRYPTO 2017) we achieve\r\nsmaller lattice parameters
and shorter public keys of size O(log λ),\r\nwhere λ is the security parameter.\r\n–
Adaptively-secure variants of two efficient selectively-secure pairing-\r\nbased
IBEs of Boneh and Boyen (EUROCRYPT 2004). One is based\r\non the DBDH assumption,
has the same ciphertext size as the cor-\r\nresponding BB04 scheme, and achieves
full adaptive security with\r\npublic parameters of size only O(log λ). The other
is based on a q-\r\ntype assumption and has public key size O(λ), but a ciphertext
is\r\nonly a single group element and the security reduction is quadrat-\r\nically
tighter than the corresponding scheme by Jager and Kurek\r\n(ASIACRYPT 2018).\r\n–
A very efficient adaptively-secure verifiable random function where\r\nproofs,
public keys, and secret keys have size O(log λ).\r\nAs a technical contribution
we introduce blockwise partitioning, which\r\nleverages the assumption that a
cryptographic hash function is weak\r\nnear-collision resistant to prove full
adaptive security of cryptosystems."
author:
- first_name: Tibor
full_name: Jager, Tibor
last_name: Jager
- first_name: Rafael
full_name: Kurek, Rafael
last_name: Kurek
- first_name: David
full_name: Niehues, David
id: '36113'
last_name: Niehues
citation:
ama: 'Jager T, Kurek R, Niehues D. Efficient Adaptively-Secure IB-KEMs and VRFs
via Near-Collision Resistance. In: Public-Key Cryptography – PKC 2021.
Cham; 2021. doi:10.1007/978-3-030-75245-3_22'
apa: Jager, T., Kurek, R., & Niehues, D. (2021). Efficient Adaptively-Secure
IB-KEMs and VRFs via Near-Collision Resistance. In Public-Key Cryptography
– PKC 2021. Cham. https://doi.org/10.1007/978-3-030-75245-3_22
bibtex: '@inbook{Jager_Kurek_Niehues_2021, place={Cham}, title={Efficient Adaptively-Secure
IB-KEMs and VRFs via Near-Collision Resistance}, DOI={10.1007/978-3-030-75245-3_22},
booktitle={Public-Key Cryptography – PKC 2021}, author={Jager, Tibor and Kurek,
Rafael and Niehues, David}, year={2021} }'
chicago: Jager, Tibor, Rafael Kurek, and David Niehues. “Efficient Adaptively-Secure
IB-KEMs and VRFs via Near-Collision Resistance.” In Public-Key Cryptography
– PKC 2021. Cham, 2021. https://doi.org/10.1007/978-3-030-75245-3_22.
ieee: T. Jager, R. Kurek, and D. Niehues, “Efficient Adaptively-Secure IB-KEMs and
VRFs via Near-Collision Resistance,” in Public-Key Cryptography – PKC 2021,
Cham, 2021.
mla: Jager, Tibor, et al. “Efficient Adaptively-Secure IB-KEMs and VRFs via Near-Collision
Resistance.” Public-Key Cryptography – PKC 2021, 2021, doi:10.1007/978-3-030-75245-3_22.
short: 'T. Jager, R. Kurek, D. Niehues, in: Public-Key Cryptography – PKC 2021,
Cham, 2021.'
date_created: 2021-05-10T15:56:24Z
date_updated: 2022-01-06T06:55:23Z
ddc:
- '000'
department:
- _id: '558'
doi: 10.1007/978-3-030-75245-3_22
file:
- access_level: closed
content_type: application/pdf
creator: davnie
date_created: 2021-05-10T16:02:02Z
date_updated: 2021-05-10T16:02:02Z
file_id: '22058'
file_name: Jager et al. - 2021 - Efficient Adaptively-Secure IB-KEMs and VRFs via
N.pdf
file_size: 701068
relation: main_file
file_date_updated: 2021-05-10T16:02:02Z
has_accepted_license: '1'
language:
- iso: eng
place: Cham
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '13'
name: SFB 901 - Subproject C1
publication: Public-Key Cryptography – PKC 2021
publication_identifier:
isbn:
- '9783030752446'
- '9783030752453'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Efficient Adaptively-Secure IB-KEMs and VRFs via Near-Collision Resistance
type: book_chapter
user_id: '36113'
year: '2021'
...
---
_id: '22059'
abstract:
- lang: eng
text: "Verifiable random functions (VRFs), introduced by Micali,\r\nRabin and Vadhan
(FOCS’99), are the public-key equivalent of pseudo-\r\nrandom functions. A public
verification key and proofs accompanying the\r\noutput enable all parties to verify
the correctness of the output. How-\r\never, all known standard model VRFs have
a reduction loss that is much\r\nworse than what one would expect from known optimal
constructions of\r\nclosely related primitives like unique signatures. We show
that:\r\n1. Every security proof for a VRF that relies on a non-interactive\r\nassumption
has to lose a factor of Q, where Q is the number of adver-\r\nsarial queries.
To that end, we extend the meta-reduction technique\r\nof Bader et al. (EUROCRYPT’16)
to also cover VRFs.\r\n2. This raises the question: Is this bound optimal? We
answer this ques-\r\ntion in the affirmative by presenting the first VRF with
a reduction\r\nfrom the non-interactive qDBDHI assumption to the security of VRF\r\nthat
achieves this optimal loss.\r\nWe thus paint a complete picture of the achievability
of tight verifiable\r\nrandom functions: We show that a security loss of Q is
unavoidable and\r\npresent the first construction that achieves this bound."
author:
- first_name: David
full_name: Niehues, David
id: '36113'
last_name: Niehues
citation:
ama: 'Niehues D. Verifiable Random Functions with Optimal Tightness. In: Public-Key
Cryptography – PKC 2021. Cham; 2021. doi:10.1007/978-3-030-75248-4_3'
apa: Niehues, D. (2021). Verifiable Random Functions with Optimal Tightness. In
Public-Key Cryptography – PKC 2021. Cham. https://doi.org/10.1007/978-3-030-75248-4_3
bibtex: '@inbook{Niehues_2021, place={Cham}, title={Verifiable Random Functions
with Optimal Tightness}, DOI={10.1007/978-3-030-75248-4_3},
booktitle={Public-Key Cryptography – PKC 2021}, author={Niehues, David}, year={2021}
}'
chicago: Niehues, David. “Verifiable Random Functions with Optimal Tightness.” In
Public-Key Cryptography – PKC 2021. Cham, 2021. https://doi.org/10.1007/978-3-030-75248-4_3.
ieee: D. Niehues, “Verifiable Random Functions with Optimal Tightness,” in Public-Key
Cryptography – PKC 2021, Cham, 2021.
mla: Niehues, David. “Verifiable Random Functions with Optimal Tightness.” Public-Key
Cryptography – PKC 2021, 2021, doi:10.1007/978-3-030-75248-4_3.
short: 'D. Niehues, in: Public-Key Cryptography – PKC 2021, Cham, 2021.'
date_created: 2021-05-10T16:07:50Z
date_updated: 2022-01-06T06:55:24Z
ddc:
- '000'
department:
- _id: '558'
doi: 10.1007/978-3-030-75248-4_3
file:
- access_level: closed
content_type: application/pdf
creator: davnie
date_created: 2021-05-10T16:09:17Z
date_updated: 2021-05-10T16:09:17Z
file_id: '22060'
file_name: Niehues - 2021 - Verifiable Random Functions with Optimal Tightness.pdf
file_size: 697361
relation: main_file
file_date_updated: 2021-05-10T16:09:17Z
has_accepted_license: '1'
language:
- iso: eng
place: Cham
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '13'
name: SFB 901 - Subproject C1
publication: Public-Key Cryptography – PKC 2021
publication_identifier:
isbn:
- '9783030752477'
- '9783030752484'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Verifiable Random Functions with Optimal Tightness
type: book_chapter
user_id: '36113'
year: '2021'
...
---
_id: '21953'
author:
- first_name: Linus Matthias
full_name: Witschen, Linus Matthias
id: '49051'
last_name: Witschen
- first_name: Tobias
full_name: Wiersema, Tobias
id: '3118'
last_name: Wiersema
- first_name: Masood
full_name: Raeisi Nafchi, Masood
last_name: Raeisi Nafchi
- first_name: Arne
full_name: Bockhorn, Arne
last_name: Bockhorn
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
citation:
ama: 'Witschen LM, Wiersema T, Raeisi Nafchi M, Bockhorn A, Platzner M. Timing Optimization
for Virtual FPGA Configurations. In: Hannig F, Derrien S, Diniz P, Chillet D,
eds. Proceedings of International Symposium on Applied Reconfigurable Computing
(ARC’21). Reconfigurable Computing: Architectures, Tools, and Applications.
Springer Lecture Notes in Computer Science. doi:10.1007/978-3-030-79025-7_4'
apa: Witschen, L. M., Wiersema, T., Raeisi Nafchi, M., Bockhorn, A., & Platzner,
M. (n.d.). Timing Optimization for Virtual FPGA Configurations. In F. Hannig,
S. Derrien, P. Diniz, & D. Chillet (Eds.), Proceedings of International
Symposium on Applied Reconfigurable Computing (ARC’21). Springer Lecture Notes
in Computer Science. https://doi.org/10.1007/978-3-030-79025-7_4
bibtex: '@inproceedings{Witschen_Wiersema_Raeisi Nafchi_Bockhorn_Platzner, series={Reconfigurable
Computing: Architectures, Tools, and Applications}, title={Timing Optimization
for Virtual FPGA Configurations}, DOI={10.1007/978-3-030-79025-7_4},
booktitle={Proceedings of International Symposium on Applied Reconfigurable Computing
(ARC’21)}, publisher={Springer Lecture Notes in Computer Science}, author={Witschen,
Linus Matthias and Wiersema, Tobias and Raeisi Nafchi, Masood and Bockhorn, Arne
and Platzner, Marco}, editor={Hannig, Frank and Derrien, Steven and Diniz, Pedro
and Chillet, Daniel}, collection={Reconfigurable Computing: Architectures, Tools,
and Applications} }'
chicago: 'Witschen, Linus Matthias, Tobias Wiersema, Masood Raeisi Nafchi, Arne
Bockhorn, and Marco Platzner. “Timing Optimization for Virtual FPGA Configurations.”
In Proceedings of International Symposium on Applied Reconfigurable Computing
(ARC’21), edited by Frank Hannig, Steven Derrien, Pedro Diniz, and Daniel
Chillet. Reconfigurable Computing: Architectures, Tools, and Applications. Springer
Lecture Notes in Computer Science, n.d. https://doi.org/10.1007/978-3-030-79025-7_4.'
ieee: 'L. M. Witschen, T. Wiersema, M. Raeisi Nafchi, A. Bockhorn, and M. Platzner,
“Timing Optimization for Virtual FPGA Configurations,” in Proceedings of International
Symposium on Applied Reconfigurable Computing (ARC’21), Virtual conference,
doi: 10.1007/978-3-030-79025-7_4.'
mla: Witschen, Linus Matthias, et al. “Timing Optimization for Virtual FPGA Configurations.”
Proceedings of International Symposium on Applied Reconfigurable Computing
(ARC’21), edited by Frank Hannig et al., Springer Lecture Notes in Computer
Science, doi:10.1007/978-3-030-79025-7_4.
short: 'L.M. Witschen, T. Wiersema, M. Raeisi Nafchi, A. Bockhorn, M. Platzner,
in: F. Hannig, S. Derrien, P. Diniz, D. Chillet (Eds.), Proceedings of International
Symposium on Applied Reconfigurable Computing (ARC’21), Springer Lecture Notes
in Computer Science, n.d.'
conference:
end_date: 2021-07-01
location: Virtual conference
name: International Symposium on Applied Reconfigurable Computing
start_date: 2021-06-29
date_created: 2021-05-04T14:18:46Z
date_updated: 2022-02-14T11:03:09Z
department:
- _id: '78'
doi: 10.1007/978-3-030-79025-7_4
editor:
- first_name: Frank
full_name: Hannig, Frank
last_name: Hannig
- first_name: Steven
full_name: Derrien, Steven
last_name: Derrien
- first_name: Pedro
full_name: Diniz, Pedro
last_name: Diniz
- first_name: Daniel
full_name: Chillet, Daniel
last_name: Chillet
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '12'
name: SFB 901 - Subproject B4
- _id: '52'
name: Computing Resources Provided by the Paderborn Center for Parallel Computing
publication: Proceedings of International Symposium on Applied Reconfigurable Computing
(ARC'21)
publication_status: accepted
publisher: Springer Lecture Notes in Computer Science
series_title: 'Reconfigurable Computing: Architectures, Tools, and Applications'
status: public
title: Timing Optimization for Virtual FPGA Configurations
type: conference
user_id: '3118'
year: '2021'
...