---
_id: '21092'
abstract:
- lang: eng
text: "Automated Machine Learning (AutoML) seeks to automatically find so-called
machine learning pipelines that maximize the prediction performance when being
used to train a model on a given dataset. One of the main and yet open challenges
in AutoML is an effective use of computational resources: An AutoML process involves
the evaluation of many candidate pipelines, which are costly but often ineffective
because they are canceled due to a timeout.\r\nIn this paper, we present an approach
to predict the runtime of two-step machine learning pipelines with up to one pre-processor,
which can be used to anticipate whether or not a pipeline will time out. Separate
runtime models are trained offline for each algorithm that may be used in a pipeline,
and an overall prediction is derived from these models. We empirically show that
the approach increases successful evaluations made by an AutoML tool while preserving
or even improving on the previously best solutions."
author:
- first_name: Felix
full_name: Mohr, Felix
last_name: Mohr
- first_name: Marcel Dominik
full_name: Wever, Marcel Dominik
id: '33176'
last_name: Wever
orcid: ' https://orcid.org/0000-0001-9782-6818'
- first_name: Alexander
full_name: Tornede, Alexander
id: '38209'
last_name: Tornede
- first_name: Eyke
full_name: Hüllermeier, Eyke
id: '48129'
last_name: Hüllermeier
citation:
ama: Mohr F, Wever MD, Tornede A, Hüllermeier E. Predicting Machine Learning Pipeline
Runtimes in the Context of Automated Machine Learning. IEEE Transactions on
Pattern Analysis and Machine Intelligence.
apa: Mohr, F., Wever, M. D., Tornede, A., & Hüllermeier, E. (n.d.). Predicting
Machine Learning Pipeline Runtimes in the Context of Automated Machine Learning.
IEEE Transactions on Pattern Analysis and Machine Intelligence.
bibtex: '@article{Mohr_Wever_Tornede_Hüllermeier, title={Predicting Machine Learning
Pipeline Runtimes in the Context of Automated Machine Learning}, journal={IEEE
Transactions on Pattern Analysis and Machine Intelligence}, publisher={IEEE},
author={Mohr, Felix and Wever, Marcel Dominik and Tornede, Alexander and Hüllermeier,
Eyke} }'
chicago: Mohr, Felix, Marcel Dominik Wever, Alexander Tornede, and Eyke Hüllermeier.
“Predicting Machine Learning Pipeline Runtimes in the Context of Automated Machine
Learning.” IEEE Transactions on Pattern Analysis and Machine Intelligence,
n.d.
ieee: F. Mohr, M. D. Wever, A. Tornede, and E. Hüllermeier, “Predicting Machine
Learning Pipeline Runtimes in the Context of Automated Machine Learning,” IEEE
Transactions on Pattern Analysis and Machine Intelligence.
mla: Mohr, Felix, et al. “Predicting Machine Learning Pipeline Runtimes in the Context
of Automated Machine Learning.” IEEE Transactions on Pattern Analysis and Machine
Intelligence, IEEE.
short: F. Mohr, M.D. Wever, A. Tornede, E. Hüllermeier, IEEE Transactions on Pattern
Analysis and Machine Intelligence (n.d.).
date_created: 2021-01-27T13:45:52Z
date_updated: 2022-01-06T06:54:45Z
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
- _id: '52'
name: Computing Resources Provided by the Paderborn Center for Parallel Computing
publication: IEEE Transactions on Pattern Analysis and Machine Intelligence
publication_status: accepted
publisher: IEEE
status: public
title: Predicting Machine Learning Pipeline Runtimes in the Context of Automated Machine
Learning
type: journal_article
user_id: '5786'
year: '2021'
...
---
_id: '21197'
author:
- first_name: Ma
full_name: Mengshi, Ma
last_name: Mengshi
citation:
ama: Mengshi M. Self-Stabilizing Arrow Protocol on Spanning Trees with a Low
Diameter.; 2021.
apa: Mengshi, M. (2021). Self-stabilizing Arrow Protocol on Spanning Trees with
a Low Diameter.
bibtex: '@book{Mengshi_2021, title={Self-stabilizing Arrow Protocol on Spanning
Trees with a Low Diameter}, author={Mengshi, Ma}, year={2021} }'
chicago: Mengshi, Ma. Self-Stabilizing Arrow Protocol on Spanning Trees with
a Low Diameter, 2021.
ieee: M. Mengshi, Self-stabilizing Arrow Protocol on Spanning Trees with a Low
Diameter. 2021.
mla: Mengshi, Ma. Self-Stabilizing Arrow Protocol on Spanning Trees with a Low
Diameter. 2021.
short: M. Mengshi, Self-Stabilizing Arrow Protocol on Spanning Trees with a Low
Diameter, 2021.
date_created: 2021-02-09T07:09:22Z
date_updated: 2022-01-06T06:54:49Z
department:
- _id: '79'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '4'
name: SFB 901 - Project Area C
- _id: '5'
name: SFB 901 - Subproject A1
- _id: '13'
name: SFB 901 - Subproject C1
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: Self-stabilizing Arrow Protocol on Spanning Trees with a Low Diameter
type: bachelorsthesis
user_id: '15504'
year: '2021'
...
---
_id: '21337'
abstract:
- lang: eng
text: "We present a flexible trust region descend algorithm for unconstrained and\r\nconvexly
constrained multiobjective optimization problems. It is targeted at\r\nheterogeneous
and expensive problems, i.e., problems that have at least one\r\nobjective function
that is computationally expensive. The method is\r\nderivative-free in the sense
that neither need derivative information be\r\navailable for the expensive objectives
nor are gradients approximated using\r\nrepeated function evaluations as is the
case in finite-difference methods.\r\nInstead, a multiobjective trust region approach
is used that works similarly to\r\nits well-known scalar pendants. Local surrogate
models constructed from\r\nevaluation data of the true objective functions are
employed to compute\r\npossible descent directions. In contrast to existing multiobjective
trust\r\nregion algorithms, these surrogates are not polynomial but carefully\r\nconstructed
radial basis function networks. This has the important advantage\r\nthat the number
of data points scales linearly with the parameter space\r\ndimension. The local
models qualify as fully linear and the corresponding\r\ngeneral scalar framework
is adapted for problems with multiple objectives.\r\nConvergence to Pareto critical
points is proven and numerical examples\r\nillustrate our findings."
article_number: '31'
author:
- first_name: Manuel Bastian
full_name: Berkemeier, Manuel Bastian
id: '51701'
last_name: Berkemeier
- first_name: Sebastian
full_name: Peitz, Sebastian
id: '47427'
last_name: Peitz
orcid: 0000-0002-3389-793X
citation:
ama: Berkemeier MB, Peitz S. Derivative-Free Multiobjective Trust Region Descent
Method Using Radial Basis Function Surrogate Models. Mathematical and Computational
Applications. 2021;26(2). doi:10.3390/mca26020031
apa: Berkemeier, M. B., & Peitz, S. (2021). Derivative-Free Multiobjective Trust
Region Descent Method Using Radial Basis Function Surrogate Models. Mathematical
and Computational Applications, 26(2). https://doi.org/10.3390/mca26020031
bibtex: '@article{Berkemeier_Peitz_2021, title={Derivative-Free Multiobjective Trust
Region Descent Method Using Radial Basis Function Surrogate Models}, volume={26},
DOI={10.3390/mca26020031}, number={231},
journal={Mathematical and Computational Applications}, author={Berkemeier, Manuel
Bastian and Peitz, Sebastian}, year={2021} }'
chicago: Berkemeier, Manuel Bastian, and Sebastian Peitz. “Derivative-Free Multiobjective
Trust Region Descent Method Using Radial Basis Function Surrogate Models.” Mathematical
and Computational Applications 26, no. 2 (2021). https://doi.org/10.3390/mca26020031.
ieee: M. B. Berkemeier and S. Peitz, “Derivative-Free Multiobjective Trust Region
Descent Method Using Radial Basis Function Surrogate Models,” Mathematical
and Computational Applications, vol. 26, no. 2, 2021.
mla: Berkemeier, Manuel Bastian, and Sebastian Peitz. “Derivative-Free Multiobjective
Trust Region Descent Method Using Radial Basis Function Surrogate Models.” Mathematical
and Computational Applications, vol. 26, no. 2, 31, 2021, doi:10.3390/mca26020031.
short: M.B. Berkemeier, S. Peitz, Mathematical and Computational Applications 26
(2021).
date_created: 2021-03-01T10:46:48Z
date_updated: 2022-01-06T06:54:55Z
department:
- _id: '101'
- _id: '655'
doi: 10.3390/mca26020031
intvolume: ' 26'
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.mdpi.com/2297-8747/26/2/31/pdf
oa: '1'
publication: Mathematical and Computational Applications
publication_identifier:
eissn:
- 2297-8747
publication_status: published
status: public
title: Derivative-Free Multiobjective Trust Region Descent Method Using Radial Basis
Function Surrogate Models
type: journal_article
user_id: '47427'
volume: 26
year: '2021'
...
---
_id: '21378'
author:
- first_name: Rita
full_name: Hartel, Rita
id: '14961'
last_name: Hartel
- first_name: Alexander
full_name: Dunst, Alexander
last_name: Dunst
citation:
ama: 'Hartel R, Dunst A. An OCR Pipeline and Semantic Text Analysis for Comics.
In: MANPU 2020: The 4th International Workshop on CoMics ANalysis, Processing
and Understanding@Pattern Recognition. ICPR International Workshops and Challenges.
Cham; 2021. doi:10.1007/978-3-030-68780-9_19'
apa: 'Hartel, R., & Dunst, A. (2021). An OCR Pipeline and Semantic Text Analysis
for Comics. In MANPU 2020: The 4th International Workshop on coMics ANalysis,
Processing and Understanding@Pattern Recognition. ICPR International Workshops
and Challenges. Cham. https://doi.org/10.1007/978-3-030-68780-9_19'
bibtex: '@inproceedings{Hartel_Dunst_2021, place={Cham}, title={An OCR Pipeline
and Semantic Text Analysis for Comics}, DOI={10.1007/978-3-030-68780-9_19},
booktitle={MANPU 2020: The 4th International Workshop on coMics ANalysis, Processing
and Understanding@Pattern Recognition. ICPR International Workshops and Challenges},
author={Hartel, Rita and Dunst, Alexander}, year={2021} }'
chicago: 'Hartel, Rita, and Alexander Dunst. “An OCR Pipeline and Semantic Text
Analysis for Comics.” In MANPU 2020: The 4th International Workshop on CoMics
ANalysis, Processing and Understanding@Pattern Recognition. ICPR International
Workshops and Challenges. Cham, 2021. https://doi.org/10.1007/978-3-030-68780-9_19.'
ieee: 'R. Hartel and A. Dunst, “An OCR Pipeline and Semantic Text Analysis for Comics,”
in MANPU 2020: The 4th International Workshop on coMics ANalysis, Processing
and Understanding@Pattern Recognition. ICPR International Workshops and Challenges,
2021.'
mla: 'Hartel, Rita, and Alexander Dunst. “An OCR Pipeline and Semantic Text Analysis
for Comics.” MANPU 2020: The 4th International Workshop on CoMics ANalysis,
Processing and Understanding@Pattern Recognition. ICPR International Workshops
and Challenges, 2021, doi:10.1007/978-3-030-68780-9_19.'
short: 'R. Hartel, A. Dunst, in: MANPU 2020: The 4th International Workshop on CoMics
ANalysis, Processing and Understanding@Pattern Recognition. ICPR International
Workshops and Challenges, Cham, 2021.'
date_created: 2021-03-04T12:35:22Z
date_updated: 2022-01-06T06:54:57Z
department:
- _id: '69'
doi: 10.1007/978-3-030-68780-9_19
language:
- iso: eng
place: Cham
publication: 'MANPU 2020: The 4th International Workshop on coMics ANalysis, Processing
and Understanding@Pattern Recognition. ICPR International Workshops and Challenges'
publication_identifier:
isbn:
- '9783030687793'
- '9783030687809'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: An OCR Pipeline and Semantic Text Analysis for Comics
type: conference
user_id: '14961'
year: '2021'
...
---
_id: '21535'
author:
- first_name: Viktor
full_name: Bengs, Viktor
last_name: Bengs
- first_name: Róbert
full_name: Busa-Fekete, Róbert
last_name: Busa-Fekete
- first_name: Adil
full_name: El Mesaoudi-Paul, Adil
last_name: El Mesaoudi-Paul
- first_name: Eyke
full_name: Hüllermeier, Eyke
last_name: Hüllermeier
citation:
ama: 'Bengs V, Busa-Fekete R, El Mesaoudi-Paul A, Hüllermeier E. Preference-based
Online Learning with Dueling Bandits: A Survey. Journal of Machine Learning
Research. 2021;22(7):1-108.'
apa: 'Bengs, V., Busa-Fekete, R., El Mesaoudi-Paul, A., & Hüllermeier, E. (2021).
Preference-based Online Learning with Dueling Bandits: A Survey. Journal of
Machine Learning Research, 22(7), 1–108.'
bibtex: '@article{Bengs_Busa-Fekete_El Mesaoudi-Paul_Hüllermeier_2021, title={Preference-based
Online Learning with Dueling Bandits: A Survey}, volume={22}, number={7}, journal={Journal
of Machine Learning Research}, author={Bengs, Viktor and Busa-Fekete, Róbert and
El Mesaoudi-Paul, Adil and Hüllermeier, Eyke}, year={2021}, pages={1–108} }'
chicago: 'Bengs, Viktor, Róbert Busa-Fekete, Adil El Mesaoudi-Paul, and Eyke Hüllermeier.
“Preference-Based Online Learning with Dueling Bandits: A Survey.” Journal
of Machine Learning Research 22, no. 7 (2021): 1–108.'
ieee: 'V. Bengs, R. Busa-Fekete, A. El Mesaoudi-Paul, and E. Hüllermeier, “Preference-based
Online Learning with Dueling Bandits: A Survey,” Journal of Machine Learning
Research, vol. 22, no. 7, pp. 1–108, 2021.'
mla: 'Bengs, Viktor, et al. “Preference-Based Online Learning with Dueling Bandits:
A Survey.” Journal of Machine Learning Research, vol. 22, no. 7, 2021,
pp. 1–108.'
short: V. Bengs, R. Busa-Fekete, A. El Mesaoudi-Paul, E. Hüllermeier, Journal of
Machine Learning Research 22 (2021) 1–108.
date_created: 2021-03-18T11:15:38Z
date_updated: 2022-01-06T06:55:03Z
department:
- _id: '34'
- _id: '7'
- _id: '355'
intvolume: ' 22'
issue: '7'
language:
- iso: eng
page: 1-108
publication: Journal of Machine Learning Research
quality_controlled: '1'
status: public
title: 'Preference-based Online Learning with Dueling Bandits: A Survey'
type: journal_article
user_id: '76599'
volume: 22
year: '2021'
...
---
_id: '21543'
abstract:
- lang: eng
text: "Services often consist of multiple chained components such as microservices
in a service mesh, or machine learning functions in a pipeline. Providing these
services requires online coordination including scaling the service, placing instance
of all components in the network, scheduling traffic to these instances, and routing
traffic through the network. Optimized service coordination is still a hard problem
due to many influencing factors such as rapidly arriving user demands and limited
node and link capacity. Existing approaches to solve the problem are often built
on rigid models and assumptions, tailored to specific scenarios. If the scenario
changes and the assumptions no longer hold, they easily break and require manual
adjustments by experts. Novel self-learning approaches using deep reinforcement
learning (DRL) are promising but still have limitations as they only address simplified
versions of the problem and are typically centralized and thus do not scale to
practical large-scale networks.\r\n\r\nTo address these issues, we propose a distributed
self-learning service coordination approach using DRL. After centralized training,
we deploy a distributed DRL agent at each node in the network, making fast coordination
decisions locally in parallel with the other nodes. Each agent only observes its
direct neighbors and does not need global knowledge. Hence, our approach scales
independently from the size of the network. In our extensive evaluation using
real-world network topologies and traffic traces, we show that our proposed approach
outperforms a state-of-the-art conventional heuristic as well as a centralized
DRL approach (60% higher throughput on average) while requiring less time per
online decision (1 ms)."
author:
- first_name: Stefan Balthasar
full_name: Schneider, Stefan Balthasar
id: '35343'
last_name: Schneider
orcid: 0000-0001-8210-4011
- first_name: Haydar
full_name: Qarawlus, Haydar
last_name: Qarawlus
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: 'Schneider SB, Qarawlus H, Karl H. Distributed Online Service Coordination
Using Deep Reinforcement Learning. In: IEEE International Conference on Distributed
Computing Systems (ICDCS). IEEE; 2021.'
apa: 'Schneider, S. B., Qarawlus, H., & Karl, H. (2021). Distributed Online
Service Coordination Using Deep Reinforcement Learning. In IEEE International
Conference on Distributed Computing Systems (ICDCS). Washington, DC, USA:
IEEE.'
bibtex: '@inproceedings{Schneider_Qarawlus_Karl_2021, title={Distributed Online
Service Coordination Using Deep Reinforcement Learning}, booktitle={IEEE International
Conference on Distributed Computing Systems (ICDCS)}, publisher={IEEE}, author={Schneider,
Stefan Balthasar and Qarawlus, Haydar and Karl, Holger}, year={2021} }'
chicago: Schneider, Stefan Balthasar, Haydar Qarawlus, and Holger Karl. “Distributed
Online Service Coordination Using Deep Reinforcement Learning.” In IEEE International
Conference on Distributed Computing Systems (ICDCS). IEEE, 2021.
ieee: S. B. Schneider, H. Qarawlus, and H. Karl, “Distributed Online Service Coordination
Using Deep Reinforcement Learning,” in IEEE International Conference on Distributed
Computing Systems (ICDCS), Washington, DC, USA, 2021.
mla: Schneider, Stefan Balthasar, et al. “Distributed Online Service Coordination
Using Deep Reinforcement Learning.” IEEE International Conference on Distributed
Computing Systems (ICDCS), IEEE, 2021.
short: 'S.B. Schneider, H. Qarawlus, H. Karl, in: IEEE International Conference
on Distributed Computing Systems (ICDCS), IEEE, 2021.'
conference:
location: Washington, DC, USA
name: IEEE International Conference on Distributed Computing Systems (ICDCS)
date_created: 2021-03-18T17:15:47Z
date_updated: 2022-01-06T06:55:04Z
ddc:
- '000'
department:
- _id: '75'
file:
- access_level: open_access
content_type: application/pdf
creator: stschn
date_created: 2021-03-18T17:12:56Z
date_updated: 2021-03-18T17:12:56Z
file_id: '21544'
file_name: public_author_version.pdf
file_size: 606321
relation: main_file
title: Distributed Online Service Coordination Using Deep Reinforcement Learning
file_date_updated: 2021-03-18T17:12:56Z
has_accepted_license: '1'
keyword:
- network management
- service management
- coordination
- reinforcement learning
- distributed
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: IEEE International Conference on Distributed Computing Systems (ICDCS)
publisher: IEEE
related_material:
link:
- relation: software
url: https://github.com/ RealVNF/distributed-drl-coordination
status: public
title: Distributed Online Service Coordination Using Deep Reinforcement Learning
type: conference
user_id: '35343'
year: '2021'
...
---
_id: '21569'
abstract:
- lang: eng
text: Die kontinuierliche Weiterentwicklung des eigenen Geschäftsmodells ist für
eine Organisation von entscheidender Bedeutung, um wettbewerbsfähig und somit
nachhaltig erfolgreich zu bleiben. Während für die Entwicklung neuer Geschäftsmodelle
häufig Workshops und einfache Software-Tools zur Visualisierung genutzt werden,
wurden in der Forschung bereits erste Ansätze von datengetriebener Geschäftsmodellentwicklung
(GME) vorgestellt. Diese Ansätze nutzen dabei Daten, Informationen oder auch Wissen
aus internen und externen Unternehmensquellen, um den GME-Prozess zu unterstützen.
Innerhalb dieses Beitrags zeigen wir einige Ansätze aus der aktuellen Literatur
und analysieren wie ihre Datennutzung den GME-Prozess unterstützt. Weiterhin stellen
wir mit dem BMDL Feature Modeler ein Tool vor, welches den GME-Prozess mit Expertenwissen
unterstützt.
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
citation:
ama: 'Gottschalk S, Yigitbas E. Von datenbasierter zu datengetriebener Geschäftsmodellentwicklung:
Ein Überblick über Software-Tools und deren Datennutzung. Vol 1. Gesellschaft
für Informatik; 2021.'
apa: 'Gottschalk, S., & Yigitbas, E. (2021). Von datenbasierter zu datengetriebener
Geschäftsmodellentwicklung: Ein Überblick über Software-Tools und deren Datennutzung
(Vol. 1). Gesellschaft für Informatik.'
bibtex: '@book{Gottschalk_Yigitbas_2021, series={WI-MAW-Rundbrief}, title={Von datenbasierter
zu datengetriebener Geschäftsmodellentwicklung: Ein Überblick über Software-Tools
und deren Datennutzung}, volume={1}, publisher={Gesellschaft für Informatik},
author={Gottschalk, Sebastian and Yigitbas, Enes}, year={2021}, collection={WI-MAW-Rundbrief}
}'
chicago: 'Gottschalk, Sebastian, and Enes Yigitbas. Von datenbasierter zu datengetriebener
Geschäftsmodellentwicklung: Ein Überblick über Software-Tools und deren Datennutzung.
Vol. 1. WI-MAW-Rundbrief. Gesellschaft für Informatik, 2021.'
ieee: 'S. Gottschalk and E. Yigitbas, Von datenbasierter zu datengetriebener
Geschäftsmodellentwicklung: Ein Überblick über Software-Tools und deren Datennutzung,
vol. 1. Gesellschaft für Informatik, 2021.'
mla: 'Gottschalk, Sebastian, and Enes Yigitbas. Von datenbasierter zu datengetriebener
Geschäftsmodellentwicklung: Ein Überblick über Software-Tools und deren Datennutzung.
Vol. 1, Gesellschaft für Informatik, 2021.'
short: 'S. Gottschalk, E. Yigitbas, Von datenbasierter zu datengetriebener Geschäftsmodellentwicklung:
Ein Überblick über Software-Tools und deren Datennutzung, Gesellschaft für Informatik,
2021.'
date_created: 2021-03-25T10:02:18Z
date_updated: 2022-01-06T06:55:06Z
department:
- _id: '66'
- _id: '534'
intvolume: ' 1'
language:
- iso: ger
main_file_link:
- open_access: '1'
url: https://fa-wi-maw.gi.de/fileadmin/FA/WI-MAW/Rundbriefe/3037624_GI_45_Rundbrief_JG27.pdf
oa: '1'
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '17'
name: SFB 901 - Subproject C5
publication_identifier:
unknown:
- 1610-5753
publisher: Gesellschaft für Informatik
series_title: WI-MAW-Rundbrief
status: public
title: 'Von datenbasierter zu datengetriebener Geschäftsmodellentwicklung: Ein Überblick
über Software-Tools und deren Datennutzung'
type: report
user_id: '47208'
volume: 1
year: '2021'
...
---
_id: '21570'
author:
- first_name: Tanja
full_name: Tornede, Tanja
id: '40795'
last_name: Tornede
- 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'
- first_name: Eyke
full_name: Hüllermeier, Eyke
id: '48129'
last_name: Hüllermeier
citation:
ama: 'Tornede T, Tornede A, Wever MD, Hüllermeier E. Coevolution of Remaining Useful
Lifetime Estimation Pipelines for Automated Predictive Maintenance. In: Proceedings
of the Genetic and Evolutionary Computation Conference. ; 2021.'
apa: Tornede, T., Tornede, A., Wever, M. D., & Hüllermeier, E. (2021). Coevolution
of Remaining Useful Lifetime Estimation Pipelines for Automated Predictive Maintenance.
Proceedings of the Genetic and Evolutionary Computation Conference. Genetic
and Evolutionary Computation Conference.
bibtex: '@inproceedings{Tornede_Tornede_Wever_Hüllermeier_2021, title={Coevolution
of Remaining Useful Lifetime Estimation Pipelines for Automated Predictive Maintenance},
booktitle={Proceedings of the Genetic and Evolutionary Computation Conference},
author={Tornede, Tanja and Tornede, Alexander and Wever, Marcel Dominik and Hüllermeier,
Eyke}, year={2021} }'
chicago: Tornede, Tanja, Alexander Tornede, Marcel Dominik Wever, and Eyke Hüllermeier.
“Coevolution of Remaining Useful Lifetime Estimation Pipelines for Automated Predictive
Maintenance.” In Proceedings of the Genetic and Evolutionary Computation Conference,
2021.
ieee: T. Tornede, A. Tornede, M. D. Wever, and E. Hüllermeier, “Coevolution of Remaining
Useful Lifetime Estimation Pipelines for Automated Predictive Maintenance,” presented
at the Genetic and Evolutionary Computation Conference, 2021.
mla: Tornede, Tanja, et al. “Coevolution of Remaining Useful Lifetime Estimation
Pipelines for Automated Predictive Maintenance.” Proceedings of the Genetic
and Evolutionary Computation Conference, 2021.
short: 'T. Tornede, A. Tornede, M.D. Wever, E. Hüllermeier, in: Proceedings of the
Genetic and Evolutionary Computation Conference, 2021.'
conference:
end_date: 2021-07-14
name: Genetic and Evolutionary Computation Conference
start_date: 2021-07-10
date_created: 2021-03-26T09:14:19Z
date_updated: 2022-01-06T06:55:06Z
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
- _id: '52'
name: Computing Resources Provided by the Paderborn Center for Parallel Computing
publication: Proceedings of the Genetic and Evolutionary Computation Conference
status: public
title: Coevolution of Remaining Useful Lifetime Estimation Pipelines for Automated
Predictive Maintenance
type: conference
user_id: '5786'
year: '2021'
...
---
_id: '21595'
author:
- first_name: Lars
full_name: Stockmann, Lars
id: '48144'
last_name: Stockmann
- first_name: Sven
full_name: Laux, Sven
last_name: Laux
- first_name: Eric
full_name: Bodden, Eric
id: '59256'
last_name: Bodden
orcid: 0000-0003-3470-3647
citation:
ama: Stockmann L, Laux S, Bodden E. Using Architectural Runtime Verification for
Offline Data Analysis. Journal of Automotive Software Engineering. Published
online 2021. doi:10.2991/jase.d.210205.001
apa: Stockmann, L., Laux, S., & Bodden, E. (2021). Using Architectural Runtime
Verification for Offline Data Analysis. Journal of Automotive Software Engineering.
https://doi.org/10.2991/jase.d.210205.001
bibtex: '@article{Stockmann_Laux_Bodden_2021, title={Using Architectural Runtime
Verification for Offline Data Analysis}, DOI={10.2991/jase.d.210205.001},
journal={Journal of Automotive Software Engineering}, author={Stockmann, Lars
and Laux, Sven and Bodden, Eric}, year={2021} }'
chicago: Stockmann, Lars, Sven Laux, and Eric Bodden. “Using Architectural Runtime
Verification for Offline Data Analysis.” Journal of Automotive Software Engineering,
2021. https://doi.org/10.2991/jase.d.210205.001.
ieee: 'L. Stockmann, S. Laux, and E. Bodden, “Using Architectural Runtime Verification
for Offline Data Analysis,” Journal of Automotive Software Engineering,
2021, doi: 10.2991/jase.d.210205.001.'
mla: Stockmann, Lars, et al. “Using Architectural Runtime Verification for Offline
Data Analysis.” Journal of Automotive Software Engineering, 2021, doi:10.2991/jase.d.210205.001.
short: L. Stockmann, S. Laux, E. Bodden, Journal of Automotive Software Engineering
(2021).
date_created: 2021-04-08T11:21:32Z
date_updated: 2022-01-06T06:55:06Z
department:
- _id: '76'
doi: 10.2991/jase.d.210205.001
language:
- iso: eng
main_file_link:
- url: https://www.bodden.de/pubs/sb21architectural.pdf
publication: Journal of Automotive Software Engineering
publication_identifier:
issn:
- 2589-2258
publication_status: published
status: public
title: Using Architectural Runtime Verification for Offline Data Analysis
type: journal_article
user_id: '5786'
year: '2021'
...
---
_id: '21596'
author:
- first_name: Andreas
full_name: Fischer, Andreas
last_name: Fischer
citation:
ama: Fischer A. Computing on Encrypted Data Using Trusted Execution Environments.
Universität Paderborn; 2021.
apa: Fischer, A. (2021). Computing on Encrypted Data using Trusted Execution
Environments. Universität Paderborn.
bibtex: '@book{Fischer_2021, title={Computing on Encrypted Data using Trusted Execution
Environments}, publisher={Universität Paderborn}, author={Fischer, Andreas}, year={2021}
}'
chicago: Fischer, Andreas. Computing on Encrypted Data Using Trusted Execution
Environments. Universität Paderborn, 2021.
ieee: A. Fischer, Computing on Encrypted Data using Trusted Execution Environments.
Universität Paderborn, 2021.
mla: Fischer, Andreas. Computing on Encrypted Data Using Trusted Execution Environments.
Universität Paderborn, 2021.
short: A. Fischer, Computing on Encrypted Data Using Trusted Execution Environments,
Universität Paderborn, 2021.
date_created: 2021-04-08T11:23:13Z
date_updated: 2022-01-06T06:55:06Z
department:
- _id: '76'
language:
- iso: eng
main_file_link:
- url: https://www.bodden.de/pubs/phdFischer.pdf
publisher: Universität Paderborn
status: public
title: Computing on Encrypted Data using Trusted Execution Environments
type: dissertation
user_id: '5786'
year: '2021'
...
---
_id: '21597'
author:
- first_name: Philipp
full_name: Holzinger, Philipp
last_name: Holzinger
- first_name: Eric
full_name: Bodden, Eric
id: '59256'
last_name: Bodden
orcid: 0000-0003-3470-3647
citation:
ama: Holzinger P, Bodden E. A Systematic Hardening of Java’s Information Hiding.
International Symposium on Advanced Security on Software and Systems (ASSS).
Published online 2021.
apa: Holzinger, P., & Bodden, E. (2021). A Systematic Hardening of Java’s Information
Hiding. International Symposium on Advanced Security on Software and Systems
(ASSS).
bibtex: '@article{Holzinger_Bodden_2021, title={A Systematic Hardening of Java’s
Information Hiding}, journal={International Symposium on Advanced Security on
Software and Systems (ASSS)}, author={Holzinger, Philipp and Bodden, Eric}, year={2021}
}'
chicago: Holzinger, Philipp, and Eric Bodden. “A Systematic Hardening of Java’s
Information Hiding.” International Symposium on Advanced Security on Software
and Systems (ASSS), 2021.
ieee: P. Holzinger and E. Bodden, “A Systematic Hardening of Java’s Information
Hiding,” International Symposium on Advanced Security on Software and Systems
(ASSS), 2021.
mla: Holzinger, Philipp, and Eric Bodden. “A Systematic Hardening of Java’s Information
Hiding.” International Symposium on Advanced Security on Software and Systems
(ASSS), 2021.
short: P. Holzinger, E. Bodden, International Symposium on Advanced Security on
Software and Systems (ASSS) (2021).
date_created: 2021-04-08T11:24:06Z
date_updated: 2022-01-06T06:55:06Z
department:
- _id: '76'
language:
- iso: eng
main_file_link:
- url: https://www.bodden.de/pubs/hb21systematic.pdf
publication: International Symposium on Advanced Security on Software and Systems
(ASSS)
status: public
title: A Systematic Hardening of Java's Information Hiding
type: journal_article
user_id: '5786'
year: '2021'
...
---
_id: '21599'
author:
- first_name: Rodrigo
full_name: Bonifacio, Rodrigo
last_name: Bonifacio
- first_name: Stefan
full_name: Krüger, Stefan
last_name: Krüger
- first_name: Krishna
full_name: Narasimhan, Krishna
last_name: Narasimhan
- first_name: Eric
full_name: Bodden, Eric
id: '59256'
last_name: Bodden
orcid: 0000-0003-3470-3647
- first_name: Mira
full_name: Mezini, Mira
last_name: Mezini
citation:
ama: Bonifacio R, Krüger S, Narasimhan K, Bodden E, Mezini M. Dealing with Variability
in API Misuse Specification. European Conference on Object-Oriented Programming
(ECOOP). Published online 2021.
apa: Bonifacio, R., Krüger, S., Narasimhan, K., Bodden, E., & Mezini, M. (2021).
Dealing with Variability in API Misuse Specification. European Conference on
Object-Oriented Programming (ECOOP).
bibtex: '@article{Bonifacio_Krüger_Narasimhan_Bodden_Mezini_2021, title={Dealing
with Variability in API Misuse Specification}, journal={European Conference on
Object-Oriented Programming (ECOOP)}, author={Bonifacio, Rodrigo and Krüger, Stefan
and Narasimhan, Krishna and Bodden, Eric and Mezini, Mira}, year={2021} }'
chicago: Bonifacio, Rodrigo, Stefan Krüger, Krishna Narasimhan, Eric Bodden, and
Mira Mezini. “Dealing with Variability in API Misuse Specification.” European
Conference on Object-Oriented Programming (ECOOP), 2021.
ieee: R. Bonifacio, S. Krüger, K. Narasimhan, E. Bodden, and M. Mezini, “Dealing
with Variability in API Misuse Specification,” European Conference on Object-Oriented
Programming (ECOOP), 2021.
mla: Bonifacio, Rodrigo, et al. “Dealing with Variability in API Misuse Specification.”
European Conference on Object-Oriented Programming (ECOOP), 2021.
short: R. Bonifacio, S. Krüger, K. Narasimhan, E. Bodden, M. Mezini, European Conference
on Object-Oriented Programming (ECOOP) (2021).
date_created: 2021-04-08T11:25:43Z
date_updated: 2022-01-06T06:55:06Z
department:
- _id: '76'
language:
- iso: eng
publication: European Conference on Object-Oriented Programming (ECOOP)
status: public
title: Dealing with Variability in API Misuse Specification
type: journal_article
user_id: '5786'
year: '2021'
...
---
_id: '21601'
abstract:
- lang: eng
text: The invention describes a distributed merchandise management system, in which
the client, retailer and the manufacturer are linked by a network. This is implemented
by a cloud storage (105), the cloud storage (105) comprising a means (105 a) for
storing data, a means for receiving first data from a first network node (110),
the first data being associated with a physical object, a means for receiving
request data from a second network node (120), a means for receiving second data
from a third network node (130), the second data being associated with the first
data and comprising at least one data piece adapted to change the first data depending
on the received request data, a means for changing the first data based at least
in part on the second data and the request data, and a means for sending a changed
portion of the first data from the cloud storage (105) to the first network node
(110).
application_date: 2019-04-12
application_number: 17050,078
author:
- first_name: Thomas
full_name: Göllner, Thomas
last_name: Göllner
- first_name: Jan-Hendrik
full_name: Schwarz, Jan-Hendrik
last_name: Schwarz
- first_name: Sebastian
full_name: Gottschalk, Sebastian
id: '47208'
last_name: Gottschalk
- first_name: Stefan
full_name: Sauer, Stefan
id: '447'
last_name: Sauer
citation:
ama: Göllner T, Schwarz J-H, Gottschalk S, Sauer S. Distributed merchandise management
system. 2021.
apa: Göllner, T., Schwarz, J.-H., Gottschalk, S., & Sauer, S. (2021). Distributed
merchandise management system.
bibtex: '@article{Göllner_Schwarz_Gottschalk_Sauer_2021, title={Distributed merchandise
management system}, author={Göllner, Thomas and Schwarz, Jan-Hendrik and Gottschalk,
Sebastian and Sauer, Stefan}, year={2021} }'
chicago: Göllner, Thomas, Jan-Hendrik Schwarz, Sebastian Gottschalk, and Stefan
Sauer. “Distributed Merchandise Management System,” 2021.
ieee: T. Göllner, J.-H. Schwarz, S. Gottschalk, and S. Sauer, “Distributed merchandise
management system.” 2021.
mla: Göllner, Thomas, et al. Distributed Merchandise Management System. 2021.
short: T. Göllner, J.-H. Schwarz, S. Gottschalk, S. Sauer, (2021).
date_created: 2021-04-09T09:47:52Z
date_updated: 2022-01-06T06:55:07Z
department:
- _id: '66'
ipc: 06Q 30/02, H04W 4/02, 06F 16/182
ipn: US 2021/0081978 A1
main_file_link:
- open_access: '1'
url: https://patents.google.com/patent/US20210081978A1/en
oa: '1'
publication_date: 2021-03-18
status: public
title: Distributed merchandise management system
type: patent
user_id: '47208'
year: '2021'
...
---
_id: '21610'
author:
- first_name: Muhammad
full_name: Awais, Muhammad
id: '64665'
last_name: Awais
orcid: https://orcid.org/0000-0003-4148-2969
- first_name: Hassan
full_name: Ghasemzadeh Mohammadi, Hassan
id: '61186'
last_name: Ghasemzadeh Mohammadi
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
citation:
ama: 'Awais M, Ghasemzadeh Mohammadi H, Platzner M. LDAX: A Learning-based Fast
Design Space Exploration Framework for Approximate Circuit Synthesis. In: Proceedings
of the ACM Great Lakes Symposium on VLSI (GLSVLSI) 2021. ACM; 2021:27-32.
doi:https://doi.org/10.1145/3453688.3461506'
apa: 'Awais, M., Ghasemzadeh Mohammadi, H., & Platzner, M. (2021). LDAX: A Learning-based
Fast Design Space Exploration Framework for Approximate Circuit Synthesis. In
Proceedings of the ACM Great Lakes Symposium on VLSI (GLSVLSI) 2021 (pp.
27–32). Virtual: ACM. https://doi.org/10.1145/3453688.3461506'
bibtex: '@inproceedings{Awais_Ghasemzadeh Mohammadi_Platzner_2021, title={LDAX:
A Learning-based Fast Design Space Exploration Framework for Approximate Circuit
Synthesis}, DOI={https://doi.org/10.1145/3453688.3461506},
booktitle={Proceedings of the ACM Great Lakes Symposium on VLSI (GLSVLSI) 2021},
publisher={ACM}, author={Awais, Muhammad and Ghasemzadeh Mohammadi, Hassan and
Platzner, Marco}, year={2021}, pages={27–32} }'
chicago: 'Awais, Muhammad, Hassan Ghasemzadeh Mohammadi, and Marco Platzner. “LDAX:
A Learning-Based Fast Design Space Exploration Framework for Approximate Circuit
Synthesis.” In Proceedings of the ACM Great Lakes Symposium on VLSI (GLSVLSI)
2021, 27–32. ACM, 2021. https://doi.org/10.1145/3453688.3461506.'
ieee: 'M. Awais, H. Ghasemzadeh Mohammadi, and M. Platzner, “LDAX: A Learning-based
Fast Design Space Exploration Framework for Approximate Circuit Synthesis,” in
Proceedings of the ACM Great Lakes Symposium on VLSI (GLSVLSI) 2021, Virtual,
2021, pp. 27–32.'
mla: 'Awais, Muhammad, et al. “LDAX: A Learning-Based Fast Design Space Exploration
Framework for Approximate Circuit Synthesis.” Proceedings of the ACM Great
Lakes Symposium on VLSI (GLSVLSI) 2021, ACM, 2021, pp. 27–32, doi:https://doi.org/10.1145/3453688.3461506.'
short: 'M. Awais, H. Ghasemzadeh Mohammadi, M. Platzner, in: Proceedings of the
ACM Great Lakes Symposium on VLSI (GLSVLSI) 2021, ACM, 2021, pp. 27–32.'
conference:
end_date: 2021-06-25
location: Virtual
name: 31st ACM Great Lakes Symposium on VLSI (GLSVLSI) 2021
start_date: 2021-06-22
date_created: 2021-04-13T10:17:47Z
date_updated: 2022-01-06T06:55:07Z
department:
- _id: '78'
doi: https://doi.org/10.1145/3453688.3461506
language:
- iso: eng
page: 27-32
publication: Proceedings of the ACM Great Lakes Symposium on VLSI (GLSVLSI) 2021
publication_status: published
publisher: ACM
status: public
title: 'LDAX: A Learning-based Fast Design Space Exploration Framework for Approximate
Circuit Synthesis'
type: conference
user_id: '64665'
year: '2021'
...
---
_id: '21627'
author:
- first_name: David
full_name: Liedtke, David
last_name: Liedtke
citation:
ama: Liedtke D. Exploration and Convex Hull Construction in the Three-Dimensional
Hybrid Model.; 2021.
apa: Liedtke, D. (2021). Exploration and Convex Hull Construction in the Three-Dimensional
Hybrid Model.
bibtex: '@book{Liedtke_2021, title={Exploration and Convex Hull Construction in
the Three-Dimensional Hybrid Model}, author={Liedtke, David}, year={2021} }'
chicago: Liedtke, David. Exploration and Convex Hull Construction in the Three-Dimensional
Hybrid Model, 2021.
ieee: D. Liedtke, Exploration and Convex Hull Construction in the Three-Dimensional
Hybrid Model. 2021.
mla: Liedtke, David. Exploration and Convex Hull Construction in the Three-Dimensional
Hybrid Model. 2021.
short: D. Liedtke, Exploration and Convex Hull Construction in the Three-Dimensional
Hybrid Model, 2021.
date_created: 2021-04-15T05:51:43Z
date_updated: 2022-01-06T06:55:08Z
department:
- _id: '79'
language:
- iso: eng
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model
type: mastersthesis
user_id: '15504'
year: '2021'
...
---
_id: '21628'
abstract:
- lang: eng
text: "This thesis considers the realization of distributed data structures and
the construction of distributed protocols for self-stabilizing overlay networks.\r\n\r\nIn
the first part of this thesis, we provide distributed protocols for queues, stacks
and priority queues that serve the insertion and deletion of elements within a
logarithmic amount of rounds.\r\nOur protocols respect semantic constraints such
as sequential consistency or serializability and the individual semantic constraints
given by the type (queue, stack, priority queue) of the data structure.\r\nWe
furthermore provide a protocol that handles joining and leaving nodes.\r\nAs an
important side product, we present a novel protocol solving the distributed $k$-selection
problem in a logarithmic amount of rounds, that is, to find the $k$-smallest elements
among a polynomial number of elements spread among $n$ nodes.\r\n\t\r\nThe second
part of this thesis is devoted to the construction of protocols for self-stabilizing
overlay networks, i.e., distributed protocols that transform an overlay network
from any initial (potentially illegitimate) state into a legitimate state in finite
time.\r\nWe present protocols for self-stabilizing generalized De Bruijn graphs,
self-stabilizing quadtrees and self-stabilizing supervised skip rings.\r\nEach
of those protocols comes with unique properties that makes it interesting for
certain distributed applications.\r\nGeneralized De Bruijn networks provide routing
within a constant amount of hops, thus serving the interest in networks that require
a low latency for requests.\r\nThe protocol for the quadtree guarantees monotonic
searchability as well as a geometric variant of monotonic searchability, making
it interesting for wireless networks or applications needed in the area of computational
geometry.\r\nThe supervised skip ring can be used to construct a self-stabilizing
publish-subscribe system.\r\n"
author:
- first_name: Michael
full_name: Feldmann, Michael
id: '23538'
last_name: Feldmann
citation:
ama: Feldmann M. Algorithms for Distributed Data Structures and Self-Stabilizing
Overlay Networks.; 2021. doi:10.17619/UNIPB/1-1113
apa: Feldmann, M. (2021). Algorithms for Distributed Data Structures and Self-Stabilizing
Overlay Networks. https://doi.org/10.17619/UNIPB/1-1113
bibtex: '@book{Feldmann_2021, title={Algorithms for Distributed Data Structures
and Self-Stabilizing Overlay Networks}, DOI={10.17619/UNIPB/1-1113},
author={Feldmann, Michael}, year={2021} }'
chicago: Feldmann, Michael. Algorithms for Distributed Data Structures and Self-Stabilizing
Overlay Networks, 2021. https://doi.org/10.17619/UNIPB/1-1113.
ieee: M. Feldmann, Algorithms for Distributed Data Structures and Self-Stabilizing
Overlay Networks. 2021.
mla: Feldmann, Michael. Algorithms for Distributed Data Structures and Self-Stabilizing
Overlay Networks. 2021, doi:10.17619/UNIPB/1-1113.
short: M. Feldmann, Algorithms for Distributed Data Structures and Self-Stabilizing
Overlay Networks, 2021.
date_created: 2021-04-15T08:23:52Z
date_updated: 2022-01-06T06:55:08Z
ddc:
- '006'
department:
- _id: '79'
doi: 10.17619/UNIPB/1-1113
file:
- access_level: closed
content_type: application/pdf
creator: mfeldma2
date_created: 2021-04-15T08:21:15Z
date_updated: 2021-04-15T08:21:15Z
file_id: '21629'
file_name: Dissertation_Michael_Feldmann.pdf
file_size: 2617069
relation: main_file
success: 1
file_date_updated: 2021-04-15T08:21:15Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: Algorithms for Distributed Data Structures and Self-Stabilizing Overlay Networks
type: dissertation
user_id: '23538'
year: '2021'
...
---
_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: '23458'
author:
- first_name: Roman
full_name: Dumitrescu, Roman
id: '16190'
last_name: Dumitrescu
- first_name: Albert
full_name: Albers, Albert
last_name: Albers
- first_name: Jürgen
full_name: Gausemeier, Jürgen
id: '163'
last_name: Gausemeier
- first_name: Oliver
full_name: Riedel, Oliver
last_name: Riedel
- first_name: Rainer
full_name: Stark, Rainer
last_name: Stark
citation:
ama: Dumitrescu R, Albers A, Gausemeier J, Riedel O, Stark R. Engineering in
Deutschland – Status quo in Wirtschaft und Wissenschaft. Ein Beitrag zum Advanced
Systems Engineering. Fraunhofer-Institut für Entwurfstechnik Mechatronik IEM,
Paderborn; 2021.
apa: Dumitrescu, R., Albers, A., Gausemeier, J., Riedel, O., & Stark, R. (2021).
Engineering in Deutschland – Status quo in Wirtschaft und Wissenschaft. Ein
Beitrag zum Advanced Systems Engineering. Fraunhofer-Institut für Entwurfstechnik
Mechatronik IEM, Paderborn.
bibtex: '@book{Dumitrescu_Albers_Gausemeier_Riedel_Stark_2021, title={Engineering
in Deutschland – Status quo in Wirtschaft und Wissenschaft. Ein Beitrag zum Advanced
Systems Engineering}, publisher={Fraunhofer-Institut für Entwurfstechnik Mechatronik
IEM, Paderborn}, author={Dumitrescu, Roman and Albers, Albert and Gausemeier,
Jürgen and Riedel, Oliver and Stark, Rainer}, year={2021} }'
chicago: Dumitrescu, Roman, Albert Albers, Jürgen Gausemeier, Oliver Riedel, and
Rainer Stark. Engineering in Deutschland – Status quo in Wirtschaft und Wissenschaft.
Ein Beitrag zum Advanced Systems Engineering. Fraunhofer-Institut für Entwurfstechnik
Mechatronik IEM, Paderborn, 2021.
ieee: R. Dumitrescu, A. Albers, J. Gausemeier, O. Riedel, and R. Stark, Engineering
in Deutschland – Status quo in Wirtschaft und Wissenschaft. Ein Beitrag zum Advanced
Systems Engineering. Fraunhofer-Institut für Entwurfstechnik Mechatronik IEM,
Paderborn, 2021.
mla: Dumitrescu, Roman, et al. Engineering in Deutschland – Status quo in Wirtschaft
und Wissenschaft. Ein Beitrag zum Advanced Systems Engineering. Fraunhofer-Institut
für Entwurfstechnik Mechatronik IEM, Paderborn, 2021.
short: R. Dumitrescu, A. Albers, J. Gausemeier, O. Riedel, R. Stark, Engineering
in Deutschland – Status quo in Wirtschaft und Wissenschaft. Ein Beitrag zum Advanced
Systems Engineering, Fraunhofer-Institut für Entwurfstechnik Mechatronik IEM,
Paderborn, 2021.
date_created: 2021-08-20T08:12:46Z
date_updated: 2022-01-06T06:55:55Z
department:
- _id: '563'
- _id: '26'
language:
- iso: ger
publication_status: published
publisher: Fraunhofer-Institut für Entwurfstechnik Mechatronik IEM, Paderborn
status: public
title: Engineering in Deutschland – Status quo in Wirtschaft und Wissenschaft. Ein
Beitrag zum Advanced Systems Engineering
type: book
user_id: '15782'
year: '2021'
...
---
_id: '23466'
abstract:
- lang: eng
text: "Abstract\r\n The term graphic
novel has increasingly functioned as a catalyst for understanding comic books
as an emergent literary genre. This article focuses on one specific element within
this historical process: the claim, made by artists such as Alan Moore, that graphic
novels are characterized by greater formal complexity, or density, than serial
comics. These claims are evaluated by combining computational text and image recognition
of a corpus of 131 graphic narratives with sociological metadata on production
and circulation. The results show that Moore’s own book-length comics, in particular
Watchmen and V for Vendetta,
rank among the densest graphic narratives in the sample in both their visual and
textual content. Graphic memoirs, in contrast, only show an increase in textual
complexity. With Pierre Bourdieu, the article understands complexity as a social
and aesthetic strategy that aims at increasing the cultural capital of comics
creators. At the same time, the article contextualizes computational results against
the background of a changing marketplace for comics, in particular the decline
of serial comics, the shift towards digital printing, and increased access to
book distribution. This analysis shows that graphic narratives pursue both literary
and popular aesthetic strategies, challenging Bourdieu’s account of a clear opposition
between profit and prestige in cultural production."
author:
- first_name: Alexander
full_name: Dunst, Alexander
last_name: Dunst
- first_name: Rita
full_name: Hartel, Rita
id: '14961'
last_name: Hartel
citation:
ama: 'Dunst A, Hartel R. Computing Literary Surplus Value: Alan Moore and the Density
of the Comic Book as Graphic Novel. Anglia. 2021;139(1):195-223. doi:10.1515/ang-2021-0010'
apa: 'Dunst, A., & Hartel, R. (2021). Computing Literary Surplus Value: Alan
Moore and the Density of the Comic Book as Graphic Novel. Anglia, 139(1),
195–223. https://doi.org/10.1515/ang-2021-0010'
bibtex: '@article{Dunst_Hartel_2021, title={Computing Literary Surplus Value: Alan
Moore and the Density of the Comic Book as Graphic Novel}, volume={139}, DOI={10.1515/ang-2021-0010}, number={1},
journal={Anglia}, author={Dunst, Alexander and Hartel, Rita}, year={2021}, pages={195–223}
}'
chicago: 'Dunst, Alexander, and Rita Hartel. “Computing Literary Surplus Value:
Alan Moore and the Density of the Comic Book as Graphic Novel.” Anglia
139, no. 1 (2021): 195–223. https://doi.org/10.1515/ang-2021-0010.'
ieee: 'A. Dunst and R. Hartel, “Computing Literary Surplus Value: Alan Moore and
the Density of the Comic Book as Graphic Novel,” Anglia, vol. 139, no.
1, pp. 195–223, 2021.'
mla: 'Dunst, Alexander, and Rita Hartel. “Computing Literary Surplus Value: Alan
Moore and the Density of the Comic Book as Graphic Novel.” Anglia, vol.
139, no. 1, 2021, pp. 195–223, doi:10.1515/ang-2021-0010.'
short: A. Dunst, R. Hartel, Anglia 139 (2021) 195–223.
date_created: 2021-08-23T12:32:17Z
date_updated: 2022-01-06T06:55:55Z
department:
- _id: '69'
doi: 10.1515/ang-2021-0010
intvolume: ' 139'
issue: '1'
language:
- iso: eng
page: 195-223
publication: Anglia
publication_identifier:
issn:
- 1865-8938
- 0340-5222
publication_status: published
status: public
title: 'Computing Literary Surplus Value: Alan Moore and the Density of the Comic
Book as Graphic Novel'
type: journal_article
user_id: '14961'
volume: 139
year: '2021'
...
---
_id: '23525'
abstract:
- lang: eng
text: "AbstractIn the field of Model-Driven Engineering,
Triple Graph Grammars\r\n(TGGs) play an important role as a rule-based means of
implementing\r\nconsistency management. From a declarative specification of a\r\nconsistency
relation, several operations including forward and\r\nbackward transformations,
(concurrent) synchronisation, and\r\nconsistency checks can be automatically derived.
For TGGs to be\r\napplicable in realistic application scenarios, expressiveness
in\r\nterms of supported language features is very important. A TGG tool\r\nis
schema compliant if it can take domain constraints, such as\r\nmultiplicity constraints
in a meta-model, into account when\r\nperforming consistency management tasks.
To guarantee schema\r\ncompliance, most TGG tools allow application conditions
to be\r\nattached as necessary to relevant rules. This strategy is\r\nproblematic
for at least two reasons: First, ensuring compliance to\r\na sufficiently expressive
schema for all previously mentioned\r\nderived operations is still an open challenge;
to the best of our\r\nknowledge, all existing TGG tools only support a very restricted\r\nsubset
of application conditions. Second, it is conceptually\r\ndemanding for the user
to indirectly specify domain constraints as\r\napplication conditions, especially
because this has to be completely\r\nrevisited every time the TGG or domain constraint
is changed. While\r\ndomain constraints can in theory be automatically transformed
to\r\nobtain the required set of application conditions, this has only\r\nbeen
successfully transferred to TGGs for a very limited subset of\r\ndomain constraints.
To address these limitations, this paper\r\nproposes a search-based strategy for
achieving schema compliance. We\r\nshow that all correctness and completeness
properties, previously\r\nproven in a setting without domain constraints, still
hold when\r\nschema compliance is to be additionally guaranteed. An\r\nimplementation
and experimental evaluation are provided to support\r\nour claim of practical
applicability."
author:
- first_name: Nils
full_name: Weidmann, Nils
id: '53103'
last_name: Weidmann
- first_name: Anthony
full_name: Anjorin, Anthony
last_name: Anjorin
citation:
ama: Weidmann N, Anjorin A. Schema Compliant Consistency Management via Triple Graph
Grammars and Integer Linear Programming. Formal Aspects of Computing. 2021.
doi:10.1007/s00165-021-00557-0
apa: Weidmann, N., & Anjorin, A. (2021). Schema Compliant Consistency Management
via Triple Graph Grammars and Integer Linear Programming. Formal Aspects of
Computing. https://doi.org/10.1007/s00165-021-00557-0
bibtex: '@article{Weidmann_Anjorin_2021, title={Schema Compliant Consistency Management
via Triple Graph Grammars and Integer Linear Programming}, DOI={10.1007/s00165-021-00557-0},
journal={Formal Aspects of Computing}, publisher={Springer}, author={Weidmann,
Nils and Anjorin, Anthony}, year={2021} }'
chicago: Weidmann, Nils, and Anthony Anjorin. “Schema Compliant Consistency Management
via Triple Graph Grammars and Integer Linear Programming.” Formal Aspects of
Computing, 2021. https://doi.org/10.1007/s00165-021-00557-0.
ieee: N. Weidmann and A. Anjorin, “Schema Compliant Consistency Management via Triple
Graph Grammars and Integer Linear Programming,” Formal Aspects of Computing,
2021.
mla: Weidmann, Nils, and Anthony Anjorin. “Schema Compliant Consistency Management
via Triple Graph Grammars and Integer Linear Programming.” Formal Aspects of
Computing, Springer, 2021, doi:10.1007/s00165-021-00557-0.
short: N. Weidmann, A. Anjorin, Formal Aspects of Computing (2021).
date_created: 2021-08-25T18:07:25Z
date_updated: 2022-01-06T06:55:56Z
department:
- _id: '28'
- _id: '66'
doi: 10.1007/s00165-021-00557-0
language:
- iso: eng
publication: Formal Aspects of Computing
publication_identifier:
issn:
- 0934-5043
- 1433-299X
publication_status: published
publisher: Springer
status: public
title: Schema Compliant Consistency Management via Triple Graph Grammars and Integer
Linear Programming
type: journal_article
user_id: '53103'
year: '2021'
...