---
_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: '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: '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: '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: '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: '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: '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: '29235'
author:
- first_name: Sebastian
full_name: Gottschalk, Sebastian
id: '47208'
last_name: Gottschalk
- first_name: Muhammad Suffyan
full_name: Aziz, Muhammad Suffyan
last_name: Aziz
- first_name: Enes
full_name: Yigitbas, Enes
id: '8447'
last_name: Yigitbas
orcid: 0000-0002-5967-833X
- first_name: Gregor
full_name: Engels, Gregor
id: '107'
last_name: Engels
citation:
ama: 'Gottschalk S, Aziz MS, Yigitbas E, Engels G. Design Principles for a Crowd-Based
Prototype Validation Platform. In: Wang X, Martini A, Nguyen-Duc A, Stray V, eds.
Software Business - 12th International Conference, ICSOB 2021, Drammen, Norway,
December 2-3, 2021, Proceedings. Vol 434. Lecture Notes in Business Information
Processing. Springer; 2021:205–220. doi:10.1007/978-3-030-91983-2_16'
apa: Gottschalk, S., Aziz, M. S., Yigitbas, E., & Engels, G. (2021). Design
Principles for a Crowd-Based Prototype Validation Platform. In X. Wang, A. Martini,
A. Nguyen-Duc, & V. Stray (Eds.), Software Business - 12th International
Conference, ICSOB 2021, Drammen, Norway, December 2-3, 2021, Proceedings (Vol.
434, pp. 205–220). Springer. https://doi.org/10.1007/978-3-030-91983-2_16
bibtex: '@inproceedings{Gottschalk_Aziz_Yigitbas_Engels_2021, series={Lecture Notes
in Business Information Processing}, title={Design Principles for a Crowd-Based
Prototype Validation Platform}, volume={434}, DOI={10.1007/978-3-030-91983-2_16},
booktitle={Software Business - 12th International Conference, ICSOB 2021, Drammen,
Norway, December 2-3, 2021, Proceedings}, publisher={Springer}, author={Gottschalk,
Sebastian and Aziz, Muhammad Suffyan and Yigitbas, Enes and Engels, Gregor}, editor={Wang,
Xiaofeng and Martini, Antonio and Nguyen-Duc, Anh and Stray, Viktoria}, year={2021},
pages={205–220}, collection={Lecture Notes in Business Information Processing}
}'
chicago: Gottschalk, Sebastian, Muhammad Suffyan Aziz, Enes Yigitbas, and Gregor
Engels. “Design Principles for a Crowd-Based Prototype Validation Platform.” In
Software Business - 12th International Conference, ICSOB 2021, Drammen, Norway,
December 2-3, 2021, Proceedings, edited by Xiaofeng Wang, Antonio Martini,
Anh Nguyen-Duc, and Viktoria Stray, 434:205–220. Lecture Notes in Business Information
Processing. Springer, 2021. https://doi.org/10.1007/978-3-030-91983-2_16.
ieee: 'S. Gottschalk, M. S. Aziz, E. Yigitbas, and G. Engels, “Design Principles
for a Crowd-Based Prototype Validation Platform,” in Software Business - 12th
International Conference, ICSOB 2021, Drammen, Norway, December 2-3, 2021, Proceedings,
2021, vol. 434, pp. 205–220, doi: 10.1007/978-3-030-91983-2_16.'
mla: Gottschalk, Sebastian, et al. “Design Principles for a Crowd-Based Prototype
Validation Platform.” Software Business - 12th International Conference, ICSOB
2021, Drammen, Norway, December 2-3, 2021, Proceedings, edited by Xiaofeng
Wang et al., vol. 434, Springer, 2021, pp. 205–220, doi:10.1007/978-3-030-91983-2_16.
short: 'S. Gottschalk, M.S. Aziz, E. Yigitbas, G. Engels, in: X. Wang, A. Martini,
A. Nguyen-Duc, V. Stray (Eds.), Software Business - 12th International Conference,
ICSOB 2021, Drammen, Norway, December 2-3, 2021, Proceedings, Springer, 2021,
pp. 205–220.'
date_created: 2022-01-11T12:43:22Z
date_updated: 2022-02-15T07:32:52Z
department:
- _id: '66'
- _id: '534'
doi: 10.1007/978-3-030-91983-2_16
editor:
- first_name: Xiaofeng
full_name: Wang, Xiaofeng
last_name: Wang
- first_name: Antonio
full_name: Martini, Antonio
last_name: Martini
- first_name: Anh
full_name: Nguyen-Duc, Anh
last_name: Nguyen-Duc
- first_name: Viktoria
full_name: Stray, Viktoria
last_name: Stray
intvolume: ' 434'
language:
- iso: eng
page: 205–220
project:
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '4'
name: 'SFB 901 - C: SFB 901 - Project Area C'
- _id: '17'
name: 'SFB 901 - C5: SFB 901 - Subproject C5'
publication: Software Business - 12th International Conference, ICSOB 2021, Drammen,
Norway, December 2-3, 2021, Proceedings
publisher: Springer
series_title: Lecture Notes in Business Information Processing
status: public
title: Design Principles for a Crowd-Based Prototype Validation Platform
type: conference
user_id: '47208'
volume: 434
year: '2021'
...
---
_id: '25528'
abstract:
- lang: eng
text: "Developing effective business models is a complex process for a company where
several tasks (e.g., conduct customer interviews) need to be accomplished, and
decisions (e.g., advertisement as a revenue stream) must be made. Here, domain
experts can guide the choices of tasks and decisions with their knowledge. Nevertheless,
this knowledge needs to match the situation of the company (e.g., financial resources)
and the application domain of the product/service (e.g., mobile app) to reduce
the risk of developing ineffective business models with low market penetration.
This is not covered by one-size-fits-all development methods without tailoring
before the enaction.\r\nTherefore, we conduct a design science study to create
a situation-specific development approach for business models. Based on situational
method engineering and our previous work in storing knowledge of methods and models
in distinct repositories, this paper shows the situation-specific composition
and enaction of business model development methods. First, the method engineer
composes the development method out of both repositories based on the situational
context. Second, the business developer enacts the method and develops the business
model. We implement the approach in a tool and evaluate it with a industrial
case study on mobile apps."
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
id: '107'
last_name: Engels
citation:
ama: 'Gottschalk S, Yigitbas E, Nowosad A, Engels G. Situation- and Domain-specific
Composition and Enactment of Business Model Development Methods. In: Product-Focused
Software Process Improvement. Springer; 2021.'
apa: Gottschalk, S., Yigitbas, E., Nowosad, A., & Engels, G. (2021). Situation-
and Domain-specific Composition and Enactment of Business Model Development Methods.
In Product-focused Software Process Improvement. 22nd International Conference
on Product-Focused Software Process Improvement, Turin. Springer.
bibtex: '@inbook{Gottschalk_Yigitbas_Nowosad_Engels_2021, title={Situation- and
Domain-specific Composition and Enactment of Business Model Development Methods},
booktitle={Product-focused Software Process Improvement}, 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- and Domain-Specific Composition and Enactment of Business Model Development
Methods.” In Product-Focused Software Process Improvement. Springer, 2021.
ieee: S. Gottschalk, E. Yigitbas, A. Nowosad, and G. Engels, “Situation- and Domain-specific
Composition and Enactment of Business Model Development Methods,” in Product-focused
Software Process Improvement, Springer, 2021.
mla: Gottschalk, Sebastian, et al. “Situation- and Domain-Specific Composition
and Enactment of Business Model Development Methods.” Product-Focused Software
Process Improvement, Springer, 2021.
short: 'S. Gottschalk, E. Yigitbas, A. Nowosad, G. Engels, in: Product-Focused Software
Process Improvement, Springer, 2021.'
conference:
end_date: 2021-11-26
location: Turin
name: 22nd International Conference on Product-Focused Software Process Improvement
start_date: 2021-11-25
date_created: 2021-10-05T20:11:09Z
date_updated: 2022-02-15T08:36:09Z
department:
- _id: '66'
keyword:
- Business Model Development
- Situational Method Engineering
- Lean Development
- Kanban Boards
- Canvas Models
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: Product-focused Software Process Improvement
publisher: Springer
status: public
title: Situation- and Domain-specific Composition and Enactment of Business Model
Development Methods
type: book_chapter
user_id: '47208'
year: '2021'
...
---
_id: '23554'
author:
- first_name: Florian
full_name: Pieper, Florian
last_name: Pieper
citation:
ama: Pieper F. Systematische Identifikation und Analyse von Vorgehensmodellen
zur Geschäftsmodellentwicklung auf digitalen Plattformen.; 2021.
apa: Pieper, F. (2021). Systematische Identifikation und Analyse von Vorgehensmodellen
zur Geschäftsmodellentwicklung auf digitalen Plattformen.
bibtex: '@book{Pieper_2021, place={Universität Paderborn}, title={Systematische
Identifikation und Analyse von Vorgehensmodellen zur Geschäftsmodellentwicklung
auf digitalen Plattformen}, author={Pieper, Florian}, year={2021} }'
chicago: Pieper, Florian. Systematische Identifikation und Analyse von Vorgehensmodellen
zur Geschäftsmodellentwicklung auf digitalen Plattformen. Universität Paderborn,
2021.
ieee: F. Pieper, Systematische Identifikation und Analyse von Vorgehensmodellen
zur Geschäftsmodellentwicklung auf digitalen Plattformen. Universität Paderborn,
2021.
mla: Pieper, Florian. Systematische Identifikation und Analyse von Vorgehensmodellen
zur Geschäftsmodellentwicklung auf digitalen Plattformen. 2021.
short: F. Pieper, Systematische Identifikation und Analyse von Vorgehensmodellen
zur Geschäftsmodellentwicklung auf digitalen Plattformen, Universität Paderborn,
2021.
date_created: 2021-08-27T13:12:37Z
date_updated: 2022-07-14T13:06:02Z
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: Systematische Identifikation und Analyse von Vorgehensmodellen zur Geschäftsmodellentwicklung
auf digitalen Plattformen
type: bachelorsthesis
user_id: '16205'
year: '2021'
...
---
_id: '21798'
author:
- first_name: Laurenz Jobst
full_name: Richert, Laurenz Jobst
last_name: Richert
citation:
ama: Richert LJ. Abhängigkeiten innerhalb und zwischen Business Model Canvas
und ArchiMate - Ein konzeptioneller Vergleich zweier Modellierungssprachen.;
2021.
apa: Richert, L. J. (2021). Abhängigkeiten innerhalb und zwischen Business Model
Canvas und ArchiMate - Ein konzeptioneller Vergleich zweier Modellierungssprachen.
bibtex: '@book{Richert_2021, place={Universität Paderborn}, title={Abhängigkeiten
innerhalb und zwischen Business Model Canvas und ArchiMate - Ein konzeptioneller
Vergleich zweier Modellierungssprachen}, author={Richert, Laurenz Jobst}, year={2021}
}'
chicago: Richert, Laurenz Jobst. Abhängigkeiten innerhalb und zwischen Business
Model Canvas und ArchiMate - Ein konzeptioneller Vergleich zweier Modellierungssprachen.
Universität Paderborn, 2021.
ieee: L. J. Richert, Abhängigkeiten innerhalb und zwischen Business Model Canvas
und ArchiMate - Ein konzeptioneller Vergleich zweier Modellierungssprachen.
Universität Paderborn, 2021.
mla: Richert, Laurenz Jobst. Abhängigkeiten innerhalb und zwischen Business Model
Canvas und ArchiMate - Ein konzeptioneller Vergleich zweier Modellierungssprachen.
2021.
short: L.J. Richert, Abhängigkeiten innerhalb und zwischen Business Model Canvas
und ArchiMate - Ein konzeptioneller Vergleich zweier Modellierungssprachen, Universität
Paderborn, 2021.
date_created: 2021-04-26T10:35:02Z
date_updated: 2022-07-14T13:06:32Z
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: Abhängigkeiten innerhalb und zwischen Business Model Canvas und ArchiMate
- Ein konzeptioneller Vergleich zweier Modellierungssprachen
type: bachelorsthesis
user_id: '16205'
year: '2021'
...
---
_id: '21116'
author:
- first_name: Steffen
full_name: Rennemeier, Steffen
last_name: Rennemeier
citation:
ama: Rennemeier S. Entwicklung und Pilotierung eines Experiments über Visualisierungen
von Taxonomien in der Wirtschaftsinformatik.; 2021.
apa: Rennemeier, S. (2021). Entwicklung und Pilotierung eines Experiments über
Visualisierungen von Taxonomien in der Wirtschaftsinformatik.
bibtex: '@book{Rennemeier_2021, title={Entwicklung und Pilotierung eines Experiments
über Visualisierungen von Taxonomien in der Wirtschaftsinformatik}, author={Rennemeier,
Steffen}, year={2021} }'
chicago: Rennemeier, Steffen. Entwicklung und Pilotierung eines Experiments über
Visualisierungen von Taxonomien in der Wirtschaftsinformatik, 2021.
ieee: S. Rennemeier, Entwicklung und Pilotierung eines Experiments über Visualisierungen
von Taxonomien in der Wirtschaftsinformatik. 2021.
mla: Rennemeier, Steffen. Entwicklung und Pilotierung eines Experiments über
Visualisierungen von Taxonomien in der Wirtschaftsinformatik. 2021.
short: S. Rennemeier, Entwicklung und Pilotierung eines Experiments über Visualisierungen
von Taxonomien in der Wirtschaftsinformatik, 2021.
date_created: 2021-02-01T09:51:47Z
date_updated: 2022-07-14T13:08:13Z
language:
- iso: ger
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: Entwicklung und Pilotierung eines Experiments über Visualisierungen von Taxonomien
in der Wirtschaftsinformatik
type: bachelorsthesis
user_id: '16205'
year: '2021'
...
---
_id: '21714'
author:
- first_name: Daniel
full_name: Wittmann, Daniel
last_name: Wittmann
citation:
ama: 'Wittmann D. Interdependente Geschäftsmodelle: Eine systematische Analyse
von Relationen in Geschäftsmodell-Modellierungssprachen.; 2021.'
apa: 'Wittmann, D. (2021). Interdependente Geschäftsmodelle: Eine systematische
Analyse von Relationen in Geschäftsmodell-Modellierungssprachen.'
bibtex: '@book{Wittmann_2021, place={Universität Paderborn}, title={Interdependente
Geschäftsmodelle: Eine systematische Analyse von Relationen in Geschäftsmodell-Modellierungssprachen},
author={Wittmann, Daniel}, year={2021} }'
chicago: 'Wittmann, Daniel. Interdependente Geschäftsmodelle: Eine systematische
Analyse von Relationen in Geschäftsmodell-Modellierungssprachen. Universität
Paderborn, 2021.'
ieee: 'D. Wittmann, Interdependente Geschäftsmodelle: Eine systematische Analyse
von Relationen in Geschäftsmodell-Modellierungssprachen. Universität Paderborn,
2021.'
mla: 'Wittmann, Daniel. Interdependente Geschäftsmodelle: Eine systematische
Analyse von Relationen in Geschäftsmodell-Modellierungssprachen. 2021.'
short: 'D. Wittmann, Interdependente Geschäftsmodelle: Eine systematische Analyse
von Relationen in Geschäftsmodell-Modellierungssprachen, Universität Paderborn,
2021.'
date_created: 2021-04-22T08:49:36Z
date_updated: 2022-07-14T13:12:17Z
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: 'Interdependente Geschäftsmodelle: Eine systematische Analyse von Relationen
in Geschäftsmodell-Modellierungssprachen'
type: mastersthesis
user_id: '16205'
year: '2021'
...
---
_id: '26645'
author:
- first_name: Jan
full_name: Bobolz, Jan
id: '27207'
last_name: Bobolz
- first_name: Fabian
full_name: Eidens, Fabian
id: '25078'
last_name: Eidens
- first_name: Raphael
full_name: Heitjohann, Raphael
last_name: Heitjohann
- first_name: Jeremy
full_name: Fell, Jeremy
last_name: Fell
citation:
ama: 'Bobolz J, Eidens F, Heitjohann R, Fell J. Cryptimeleon: A Library for Fast
Prototyping of Privacy-Preserving Cryptographic Schemes. Published online 2021.'
apa: 'Bobolz, J., Eidens, F., Heitjohann, R., & Fell, J. (2021). Cryptimeleon:
A Library for Fast Prototyping of Privacy-Preserving Cryptographic Schemes.
IACR eprint.'
bibtex: '@article{Bobolz_Eidens_Heitjohann_Fell_2021, title={Cryptimeleon: A Library
for Fast Prototyping of Privacy-Preserving Cryptographic Schemes}, publisher={IACR
eprint}, author={Bobolz, Jan and Eidens, Fabian and Heitjohann, Raphael and Fell,
Jeremy}, year={2021} }'
chicago: 'Bobolz, Jan, Fabian Eidens, Raphael Heitjohann, and Jeremy Fell. “Cryptimeleon:
A Library for Fast Prototyping of Privacy-Preserving Cryptographic Schemes.” IACR
eprint, 2021.'
ieee: 'J. Bobolz, F. Eidens, R. Heitjohann, and J. Fell, “Cryptimeleon: A Library
for Fast Prototyping of Privacy-Preserving Cryptographic Schemes.” IACR eprint,
2021.'
mla: 'Bobolz, Jan, et al. Cryptimeleon: A Library for Fast Prototyping of Privacy-Preserving
Cryptographic Schemes. IACR eprint, 2021.'
short: J. Bobolz, F. Eidens, R. Heitjohann, J. Fell, (2021).
date_created: 2021-10-21T07:51:32Z
date_updated: 2022-11-18T09:38:42Z
department:
- _id: '64'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2021/961
oa: '1'
project:
- _id: '4'
name: SFB 901 - Project Area C
- _id: '82'
name: SFB 901 - Project Area T
- _id: '84'
name: SFB 901 -Subproject T2
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '13'
name: 'SFB 901 - C1: SFB 901 - Subproject C1'
publisher: IACR eprint
status: public
title: 'Cryptimeleon: A Library for Fast Prototyping of Privacy-Preserving Cryptographic
Schemes'
type: preprint
user_id: '477'
year: '2021'
...
---
_id: '33854'
abstract:
- lang: eng
text: "Macrodiversity is a key technique to increase the capacity of mobile networks.
It can be realized using coordinated multipoint (CoMP), simultaneously connecting
users to multiple overlapping cells. Selecting which users to serve by how many
and which cells is NP-hard but needs to happen continuously in real time as users
move and channel state changes. Existing approaches often require strict assumptions
about or perfect knowledge of the underlying radio system, its resource allocation
scheme, or user movements, none of which is readily available in practice.\r\n\r\nInstead,
we propose three novel self-learning and self-adapting approaches using model-free
deep reinforcement learning (DRL): DeepCoMP, DD-CoMP, and D3-CoMP. DeepCoMP leverages
central observations and control of all users to select cells almost optimally.
DD-CoMP and D3-CoMP use multi-agent DRL, which allows distributed, robust, and
highly scalable coordination. All three approaches learn from experience and self-adapt
to varying scenarios, reaching 2x higher Quality of Experience than other approaches.
They have very few built-in assumptions and do not need prior system knowledge,
making them more robust to change and better applicable in practice than existing
approaches."
author:
- 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
- first_name: Ramin
full_name: Khalili, Ramin
last_name: Khalili
- first_name: Artur
full_name: Hecker, Artur
last_name: Hecker
citation:
ama: 'Schneider SB, Karl H, Khalili R, Hecker A. DeepCoMP: Coordinated Multipoint
Using Multi-Agent Deep Reinforcement Learning.; 2021.'
apa: 'Schneider, S. B., Karl, H., Khalili, R., & Hecker, A. (2021). DeepCoMP:
Coordinated Multipoint Using Multi-Agent Deep Reinforcement Learning.'
bibtex: '@book{Schneider_Karl_Khalili_Hecker_2021, title={DeepCoMP: Coordinated
Multipoint Using Multi-Agent Deep Reinforcement Learning}, author={Schneider,
Stefan Balthasar and Karl, Holger and Khalili, Ramin and Hecker, Artur}, year={2021}
}'
chicago: 'Schneider, Stefan Balthasar, Holger Karl, Ramin Khalili, and Artur Hecker.
DeepCoMP: Coordinated Multipoint Using Multi-Agent Deep Reinforcement Learning,
2021.'
ieee: 'S. B. Schneider, H. Karl, R. Khalili, and A. Hecker, DeepCoMP: Coordinated
Multipoint Using Multi-Agent Deep Reinforcement Learning. 2021.'
mla: 'Schneider, Stefan Balthasar, et al. DeepCoMP: Coordinated Multipoint Using
Multi-Agent Deep Reinforcement Learning. 2021.'
short: 'S.B. Schneider, H. Karl, R. Khalili, A. Hecker, DeepCoMP: Coordinated Multipoint
Using Multi-Agent Deep Reinforcement Learning, 2021.'
date_created: 2022-10-20T16:44:19Z
date_updated: 2022-11-18T09:59:27Z
ddc:
- '004'
department:
- _id: '75'
file:
- access_level: open_access
content_type: application/pdf
creator: stschn
date_created: 2022-10-20T16:41:10Z
date_updated: 2022-10-20T16:41:10Z
file_id: '33855'
file_name: preprint.pdf
file_size: 2521656
relation: main_file
file_date_updated: 2022-10-20T16:41:10Z
has_accepted_license: '1'
keyword:
- mobility management
- coordinated multipoint
- CoMP
- cell selection
- resource management
- reinforcement learning
- multi agent
- MARL
- self-learning
- self-adaptation
- QoE
language:
- iso: eng
oa: '1'
project:
- _id: '4'
name: 'SFB 901 - C: SFB 901 - Project Area C'
- _id: '16'
name: 'SFB 901 - C4: SFB 901 - Subproject C4'
- _id: '1'
name: 'SFB 901: SFB 901'
status: public
title: 'DeepCoMP: Coordinated Multipoint Using Multi-Agent Deep Reinforcement Learning'
type: working_paper
user_id: '477'
year: '2021'
...
---
_id: '29137'
author:
- first_name: Tim
full_name: Hansmeier, Tim
id: '49992'
last_name: Hansmeier
orcid: 0000-0003-1377-3339
citation:
ama: 'Hansmeier T. Self-aware Operation of Heterogeneous Compute Nodes using the
Learning Classifier System XCS. In: HEART ’21: Proceedings of the 11th International
Symposium on Highly Efficient Accelerators and Reconfigurable Technologies.
Association for Computing Machinery (ACM); 2021. doi:10.1145/3468044.3468055'
apa: 'Hansmeier, T. (2021). Self-aware Operation of Heterogeneous Compute Nodes
using the Learning Classifier System XCS. HEART ’21: Proceedings of the 11th
International Symposium on Highly Efficient Accelerators and Reconfigurable Technologies.
International Symposium on Highly Efficient Accelerators and Reconfigurable Technologies
(HEART ’21), Online. https://doi.org/10.1145/3468044.3468055'
bibtex: '@inproceedings{Hansmeier_2021, place={New York, NY, United States}, title={Self-aware
Operation of Heterogeneous Compute Nodes using the Learning Classifier System
XCS}, DOI={10.1145/3468044.3468055},
booktitle={HEART ’21: Proceedings of the 11th International Symposium on Highly
Efficient Accelerators and Reconfigurable Technologies}, publisher={Association
for Computing Machinery (ACM)}, author={Hansmeier, Tim}, year={2021} }'
chicago: 'Hansmeier, Tim. “Self-Aware Operation of Heterogeneous Compute Nodes Using
the Learning Classifier System XCS.” In HEART ’21: Proceedings of the 11th
International Symposium on Highly Efficient Accelerators and Reconfigurable Technologies.
New York, NY, United States: Association for Computing Machinery (ACM), 2021.
https://doi.org/10.1145/3468044.3468055.'
ieee: 'T. Hansmeier, “Self-aware Operation of Heterogeneous Compute Nodes using
the Learning Classifier System XCS,” presented at the International Symposium
on Highly Efficient Accelerators and Reconfigurable Technologies (HEART ’21),
Online, 2021, doi: 10.1145/3468044.3468055.'
mla: 'Hansmeier, Tim. “Self-Aware Operation of Heterogeneous Compute Nodes Using
the Learning Classifier System XCS.” HEART ’21: Proceedings of the 11th International
Symposium on Highly Efficient Accelerators and Reconfigurable Technologies,
Association for Computing Machinery (ACM), 2021, doi:10.1145/3468044.3468055.'
short: 'T. Hansmeier, in: HEART ’21: Proceedings of the 11th International Symposium
on Highly Efficient Accelerators and Reconfigurable Technologies, Association
for Computing Machinery (ACM), New York, NY, United States, 2021.'
conference:
end_date: 2021-06-23
location: Online
name: International Symposium on Highly Efficient Accelerators and Reconfigurable
Technologies (HEART ’21)
start_date: 2021-06-21
date_created: 2021-12-27T12:01:02Z
date_updated: 2022-11-18T10:03:24Z
department:
- _id: '78'
doi: 10.1145/3468044.3468055
language:
- iso: eng
place: New York, NY, United States
project:
- _id: '4'
name: SFB 901 - Project Area C
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '14'
name: 'SFB 901 - C2: SFB 901 - Subproject C2'
publication: 'HEART ''21: Proceedings of the 11th International Symposium on Highly
Efficient Accelerators and Reconfigurable Technologies'
publication_status: published
publisher: Association for Computing Machinery (ACM)
status: public
title: Self-aware Operation of Heterogeneous Compute Nodes using the Learning Classifier
System XCS
type: conference
user_id: '477'
year: '2021'
...