---
_id: '97'
abstract:
- lang: eng
text: Bridging the gap between informal, imprecise, and vague user requirements
descriptions and precise formalized specifications is the main task of requirements
engineering. Techniques such as interviews or story telling are used when requirements
engineers try to identify a user's needs. The requirements specification process
is typically done in a dialogue between users, domain experts, and requirements
engineers. In our research, we aim at automating the specification of requirements.
The idea is to distinguish between untrained users and trained users, and to exploit
domain knowledge learned from previous runs of our system. We let untrained users
provide unstructured natural language descriptions, while we allow trained users
to provide examples of behavioral descriptions. In both cases, our goal is to
synthesize formal requirements models similar to statecharts. From requirements
specification processes with trained users, behavioral ontologies are learned
which are later used to support the requirements specification process for untrained
users. Our research method is original in combining natural language processing
and search-based techniques for the synthesis of requirements specifications.
Our work is embedded in a larger project that aims at automating the whole software
development and deployment process in envisioned future software service markets.
author:
- first_name: Lorijn
full_name: van Rooijen, Lorijn
id: '58843'
last_name: van Rooijen
- first_name: Frederik Simon
full_name: Bäumer, Frederik Simon
id: '38837'
last_name: Bäumer
- first_name: Marie Christin
full_name: Platenius, Marie Christin
last_name: Platenius
- first_name: Michaela
full_name: Geierhos, Michaela
id: '42496'
last_name: Geierhos
orcid: 0000-0002-8180-5606
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
- first_name: Gregor
full_name: Engels, Gregor
id: '107'
last_name: Engels
citation:
ama: 'van Rooijen L, Bäumer FS, Platenius MC, Geierhos M, Hamann H, Engels G. From
User Demand to Software Service: Using Machine Learning to Automate the Requirements
Specification Process. In: 2017 IEEE 25th International Requirements Engineering
Conference Workshops (REW). Piscataway, NJ, USA: IEEE; 2017:379-385. doi:10.1109/REW.2017.26'
apa: 'van Rooijen, L., Bäumer, F. S., Platenius, M. C., Geierhos, M., Hamann, H.,
& Engels, G. (2017). From User Demand to Software Service: Using Machine Learning
to Automate the Requirements Specification Process. In 2017 IEEE 25th International
Requirements Engineering Conference Workshops (REW) (pp. 379–385). Piscataway,
NJ, USA: IEEE. https://doi.org/10.1109/REW.2017.26'
bibtex: '@inproceedings{van Rooijen_Bäumer_Platenius_Geierhos_Hamann_Engels_2017,
place={Piscataway, NJ, USA}, title={From User Demand to Software Service: Using
Machine Learning to Automate the Requirements Specification Process}, DOI={10.1109/REW.2017.26}, booktitle={2017
IEEE 25th International Requirements Engineering Conference Workshops (REW)},
publisher={IEEE}, author={van Rooijen, Lorijn and Bäumer, Frederik Simon and Platenius,
Marie Christin and Geierhos, Michaela and Hamann, Heiko and Engels, Gregor}, year={2017},
pages={379–385} }'
chicago: 'Rooijen, Lorijn van, Frederik Simon Bäumer, Marie Christin Platenius,
Michaela Geierhos, Heiko Hamann, and Gregor Engels. “From User Demand to Software
Service: Using Machine Learning to Automate the Requirements Specification Process.”
In 2017 IEEE 25th International Requirements Engineering Conference Workshops
(REW), 379–85. Piscataway, NJ, USA: IEEE, 2017. https://doi.org/10.1109/REW.2017.26.'
ieee: 'L. van Rooijen, F. S. Bäumer, M. C. Platenius, M. Geierhos, H. Hamann, and
G. Engels, “From User Demand to Software Service: Using Machine Learning to Automate
the Requirements Specification Process,” in 2017 IEEE 25th International Requirements
Engineering Conference Workshops (REW), Lisbon, Portugal, 2017, pp. 379–385.'
mla: 'van Rooijen, Lorijn, et al. “From User Demand to Software Service: Using Machine
Learning to Automate the Requirements Specification Process.” 2017 IEEE 25th
International Requirements Engineering Conference Workshops (REW), IEEE, 2017,
pp. 379–85, doi:10.1109/REW.2017.26.'
short: 'L. van Rooijen, F.S. Bäumer, M.C. Platenius, M. Geierhos, H. Hamann, G.
Engels, in: 2017 IEEE 25th International Requirements Engineering Conference Workshops
(REW), IEEE, Piscataway, NJ, USA, 2017, pp. 379–385.'
conference:
end_date: 2017-09-08
location: Lisbon, Portugal
name: 2017 IEEE 25th International Requirements Engineering Conference Workshops
(REW)
start_date: 2017-09-04
date_created: 2017-10-17T12:41:10Z
date_updated: 2022-01-06T07:04:18Z
ddc:
- '000'
department:
- _id: '36'
- _id: '1'
- _id: '579'
- _id: '34'
- _id: '7'
- _id: '66'
- _id: '238'
- _id: '63'
doi: 10.1109/REW.2017.26
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T14:50:35Z
date_updated: 2018-11-02T14:50:35Z
file_id: '5285'
file_name: 08054881.pdf
file_size: 433613
relation: main_file
success: 1
file_date_updated: 2018-11-02T14:50:35Z
has_accepted_license: '1'
keyword:
- Software
- Unified modeling language
- Requirements engineering
- Ontologies
- Search problems
- Natural languages
language:
- iso: eng
page: 379-385
place: Piscataway, NJ, USA
project:
- _id: '1'
name: SFB 901
- _id: '9'
name: SFB 901 - Subprojekt B1
- _id: '3'
name: SFB 901 - Project Area B
publication: 2017 IEEE 25th International Requirements Engineering Conference Workshops
(REW)
publication_identifier:
eisbn:
- '978-1-5386-3488-2 '
isbn:
- 978-1-5386-3489-9
publication_status: published
publisher: IEEE
quality_controlled: '1'
status: public
title: 'From User Demand to Software Service: Using Machine Learning to Automate the
Requirements Specification Process'
type: conference
user_id: '57458'
year: '2017'
...
---
_id: '55'
abstract:
- lang: eng
text: We introduce the mobile server problem, inspired by current trends to move
computational tasks from cloud structures to multiple devices close to the end
user. An example for this are embedded systems in autonomous cars that communicate
in order to coordinate their actions. Our model is a variant of the classical
Page Migration Problem. Moreformally, we consider a mobile server holding a data
page.The server can move in the Euclidean space (of arbitrary dimension). In every
round, requests for data items from the page pop up at arbitrary points in the
space. The requests are served, each at a cost of the distance from the requesting
point and the server, and the mobile server may move, at a cost D times the distance
traveled for some constant D . We assume a maximum distance m the server is allowed
to move per round. We show that no online algorithm can achieve a competitive
ratio independent of the length of the input sequence in this setting. Hence we
augment the maximum movement distance of the online algorithms to ( 1 + δ) times
the maximum distance of the offline solution. We provide a deterministic algorithm
which is simple to describe and works for multiple variants of our problem. The
algorithm achieves almost tight competitive ratios independent of the length of
the input sequence.
author:
- first_name: Björn
full_name: Feldkord, Björn
id: '22704'
last_name: Feldkord
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Feldkord B, Meyer auf der Heide F. The Mobile Server Problem. In: Proceedings
of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA).
; 2017:313-319. doi:10.1145/3087556.3087575'
apa: Feldkord, B., & Meyer auf der Heide, F. (2017). The Mobile Server Problem.
In Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures
(SPAA) (pp. 313–319). https://doi.org/10.1145/3087556.3087575
bibtex: '@inproceedings{Feldkord_Meyer auf der Heide_2017, title={The Mobile Server
Problem}, DOI={10.1145/3087556.3087575},
booktitle={Proceedings of the 29th ACM Symposium on Parallelism in Algorithms
and Architectures (SPAA)}, author={Feldkord, Björn and Meyer auf der Heide, Friedhelm},
year={2017}, pages={313–319} }'
chicago: Feldkord, Björn, and Friedhelm Meyer auf der Heide. “The Mobile Server
Problem.” In Proceedings of the 29th ACM Symposium on Parallelism in Algorithms
and Architectures (SPAA), 313–19, 2017. https://doi.org/10.1145/3087556.3087575.
ieee: B. Feldkord and F. Meyer auf der Heide, “The Mobile Server Problem,” in Proceedings
of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA),
2017, pp. 313–319.
mla: Feldkord, Björn, and Friedhelm Meyer auf der Heide. “The Mobile Server Problem.”
Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures
(SPAA), 2017, pp. 313–19, doi:10.1145/3087556.3087575.
short: 'B. Feldkord, F. Meyer auf der Heide, in: Proceedings of the 29th ACM Symposium
on Parallelism in Algorithms and Architectures (SPAA), 2017, pp. 313–319.'
date_created: 2017-10-17T12:41:02Z
date_updated: 2022-01-06T07:01:56Z
ddc:
- '000'
department:
- _id: '63'
doi: 10.1145/3087556.3087575
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T14:55:10Z
date_updated: 2018-11-02T14:55:10Z
file_id: '5288'
file_name: p313-feldkord.pdf
file_size: 691691
relation: main_file
success: 1
file_date_updated: 2018-11-02T14:55:10Z
has_accepted_license: '1'
language:
- iso: eng
page: 313-319
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and
Architectures (SPAA)
status: public
title: The Mobile Server Problem
type: conference
user_id: '477'
year: '2017'
...
---
_id: '66'
abstract:
- lang: eng
text: In budget games, players compete over resources with finite budgets. For every
resource, a player has a specific demand and as a strategy, he chooses a subset
of resources. If the total demand on a resource does not exceed its budget, the
utility of each player who chose that resource equals his demand. Otherwise, the
budget is shared proportionally. In the general case, pure Nash equilibria (NE)
do not exist for such games. In this paper, we consider the natural classes of
singleton and matroid budget games with additional constraints and show that for
each, pure NE can be guaranteed. In addition, we introduce a lexicographical potential
function to prove that every matroid budget game has an approximate pure NE which
depends on the largest ratio between the different demands of each individual
player.
author:
- first_name: Maximilian
full_name: Drees, Maximilian
last_name: Drees
- first_name: Matthias
full_name: Feldotto, Matthias
id: '14052'
last_name: Feldotto
orcid: 0000-0003-1348-6516
- first_name: Sören
full_name: Riechers, Sören
last_name: Riechers
- first_name: Alexander
full_name: Skopalik, Alexander
id: '40384'
last_name: Skopalik
citation:
ama: 'Drees M, Feldotto M, Riechers S, Skopalik A. Pure Nash Equilibria in Restricted
Budget Games. In: Proceedings of the 23rd International Computing and Combinatorics
Conference (COCOON). LNCS. ; 2017:175--187. doi:10.1007/978-3-319-62389-4_15'
apa: Drees, M., Feldotto, M., Riechers, S., & Skopalik, A. (2017). Pure Nash
Equilibria in Restricted Budget Games. In Proceedings of the 23rd International
Computing and Combinatorics Conference (COCOON) (pp. 175--187). https://doi.org/10.1007/978-3-319-62389-4_15
bibtex: '@inproceedings{Drees_Feldotto_Riechers_Skopalik_2017, series={LNCS}, title={Pure
Nash Equilibria in Restricted Budget Games}, DOI={10.1007/978-3-319-62389-4_15},
booktitle={Proceedings of the 23rd International Computing and Combinatorics Conference
(COCOON)}, author={Drees, Maximilian and Feldotto, Matthias and Riechers, Sören
and Skopalik, Alexander}, year={2017}, pages={175--187}, collection={LNCS} }'
chicago: Drees, Maximilian, Matthias Feldotto, Sören Riechers, and Alexander Skopalik.
“Pure Nash Equilibria in Restricted Budget Games.” In Proceedings of the 23rd
International Computing and Combinatorics Conference (COCOON), 175--187. LNCS,
2017. https://doi.org/10.1007/978-3-319-62389-4_15.
ieee: M. Drees, M. Feldotto, S. Riechers, and A. Skopalik, “Pure Nash Equilibria
in Restricted Budget Games,” in Proceedings of the 23rd International Computing
and Combinatorics Conference (COCOON), 2017, pp. 175--187.
mla: Drees, Maximilian, et al. “Pure Nash Equilibria in Restricted Budget Games.”
Proceedings of the 23rd International Computing and Combinatorics Conference
(COCOON), 2017, pp. 175--187, doi:10.1007/978-3-319-62389-4_15.
short: 'M. Drees, M. Feldotto, S. Riechers, A. Skopalik, in: Proceedings of the
23rd International Computing and Combinatorics Conference (COCOON), 2017, pp.
175--187.'
date_created: 2017-10-17T12:41:04Z
date_updated: 2022-01-06T07:03:13Z
ddc:
- '000'
department:
- _id: '541'
- _id: '63'
doi: 10.1007/978-3-319-62389-4_15
file:
- access_level: closed
content_type: application/pdf
creator: feldi
date_created: 2018-10-31T16:58:42Z
date_updated: 2018-10-31T16:58:42Z
file_id: '5228'
file_name: Drees2017_Chapter_PureNashEquilibriaInRestricted.pdf
file_size: 346390
relation: main_file
success: 1
file_date_updated: 2018-10-31T16:58:42Z
has_accepted_license: '1'
language:
- iso: eng
page: 175--187
project:
- _id: '1'
name: SFB 901
- _id: '7'
name: SFB 901 - Subprojekt A3
- _id: '16'
name: SFB 901 - Subproject C4
- _id: '2'
name: SFB 901 - Project Area A
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the 23rd International Computing and Combinatorics Conference
(COCOON)
series_title: LNCS
status: public
title: Pure Nash Equilibria in Restricted Budget Games
type: conference
user_id: '14052'
year: '2017'
...
---
_id: '695'
author:
- first_name: Joshua
full_name: Nowack, Joshua
last_name: Nowack
citation:
ama: Nowack J. On-The-Fly Konstruktion zusammenhängender Straßennetze aus gegebenen
Einzelteilen. Universität Paderborn; 2017.
apa: Nowack, J. (2017). On-The-Fly Konstruktion zusammenhängender Straßennetze
aus gegebenen Einzelteilen. Universität Paderborn.
bibtex: '@book{Nowack_2017, title={On-The-Fly Konstruktion zusammenhängender Straßennetze
aus gegebenen Einzelteilen}, publisher={Universität Paderborn}, author={Nowack,
Joshua}, year={2017} }'
chicago: Nowack, Joshua. On-The-Fly Konstruktion zusammenhängender Straßennetze
aus gegebenen Einzelteilen. Universität Paderborn, 2017.
ieee: J. Nowack, On-The-Fly Konstruktion zusammenhängender Straßennetze aus gegebenen
Einzelteilen. Universität Paderborn, 2017.
mla: Nowack, Joshua. On-The-Fly Konstruktion zusammenhängender Straßennetze aus
gegebenen Einzelteilen. Universität Paderborn, 2017.
short: J. Nowack, On-The-Fly Konstruktion zusammenhängender Straßennetze aus gegebenen
Einzelteilen, Universität Paderborn, 2017.
date_created: 2017-11-14T06:57:49Z
date_updated: 2022-01-06T07:03:23Z
department:
- _id: '63'
language:
- iso: ger
publisher: Universität Paderborn
status: public
title: On-The-Fly Konstruktion zusammenhängender Straßennetze aus gegebenen Einzelteilen
type: bachelorsthesis
user_id: '14052'
year: '2017'
...
---
_id: '16444'
author:
- first_name: Jürgen
full_name: Gausemeier, Jürgen
last_name: Gausemeier
- first_name: Eric
full_name: Bodden, Eric
last_name: Bodden
- first_name: Falko
full_name: ' Dressler, Falko'
last_name: ' Dressler'
- first_name: Roman
full_name: Dumitrescu, Roman
last_name: Dumitrescu
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Christoph
full_name: Scheytt, Christoph
last_name: Scheytt
- first_name: Ansgar
full_name: Trächtler, Ansgar
last_name: Trächtler
citation:
ama: Gausemeier J, Bodden E, Dressler F, et al. Wissenschaftsforum Intelligente
Technische Systeme (WInTeSys). Paderborn; 2017.
apa: Gausemeier, J., Bodden, E., Dressler, F., Dumitrescu, R., Meyer auf der Heide,
F., Scheytt, C., & Trächtler, A. (2017). Wissenschaftsforum Intelligente
Technische Systeme (WInTeSys). Paderborn.
bibtex: '@book{Gausemeier_Bodden_ Dressler_Dumitrescu_Meyer auf der Heide_Scheytt_Trächtler_2017,
place={Paderborn}, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn}}, title={Wissenschaftsforum Intelligente Technische Systeme (WInTeSys)},
author={Gausemeier, Jürgen and Bodden, Eric and Dressler, Falko and Dumitrescu,
Roman and Meyer auf der Heide, Friedhelm and Scheytt, Christoph and Trächtler,
Ansgar}, year={2017}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn}} }'
chicago: Gausemeier, Jürgen, Eric Bodden, Falko Dressler, Roman Dumitrescu, Friedhelm
Meyer auf der Heide, Christoph Scheytt, and Ansgar Trächtler. Wissenschaftsforum
Intelligente Technische Systeme (WInTeSys). Verlagsschriftenreihe Des Heinz
Nixdorf Instituts, Paderborn}. Paderborn, 2017.
ieee: J. Gausemeier et al., Wissenschaftsforum Intelligente Technische
Systeme (WInTeSys). Paderborn, 2017.
mla: Gausemeier, Jürgen, et al. Wissenschaftsforum Intelligente Technische Systeme
(WInTeSys). 2017.
short: J. Gausemeier, E. Bodden, F. Dressler, R. Dumitrescu, F. Meyer auf der Heide,
C. Scheytt, A. Trächtler, Wissenschaftsforum Intelligente Technische Systeme (WInTeSys),
Paderborn, 2017.
date_created: 2020-04-07T06:36:06Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
language:
- iso: eng
page: '369'
place: Paderborn
publication_status: published
series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}
status: public
title: Wissenschaftsforum Intelligente Technische Systeme (WInTeSys)
type: book
user_id: '15415'
year: '2017'
...
---
_id: '16461'
author:
- first_name: Pascal
full_name: Bemmann, Pascal
last_name: Bemmann
- first_name: Felix
full_name: Biermeier, Felix
last_name: Biermeier
- first_name: Jan
full_name: Bürmann, Jan
last_name: Bürmann
- first_name: Arne
full_name: Kemper, Arne
last_name: Kemper
- first_name: Till
full_name: Knollmann, Till
id: '39241'
last_name: Knollmann
orcid: 0000-0003-2014-4696
- first_name: Steffen
full_name: Knorr, Steffen
last_name: Knorr
- first_name: Nils
full_name: Kothe, Nils
last_name: Kothe
- first_name: Alexander
full_name: Mäcker, Alexander
id: '13536'
last_name: Mäcker
- first_name: Manuel
full_name: Malatyali, Manuel
id: '41265'
last_name: Malatyali
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Sören
full_name: Riechers, Sören
last_name: Riechers
- first_name: Johannes Sebastian
full_name: Schaefer, Johannes Sebastian
id: '30291'
last_name: Schaefer
- first_name: Jannik
full_name: Sundermeier, Jannik
id: '38705'
last_name: Sundermeier
citation:
ama: 'Bemmann P, Biermeier F, Bürmann J, et al. Monitoring of Domain-Related Problems
in Distributed Data Streams. In: Structural Information and Communication Complexity.
; 2017. doi:10.1007/978-3-319-72050-0_13'
apa: Bemmann, P., Biermeier, F., Bürmann, J., Kemper, A., Knollmann, T., Knorr,
S., Kothe, N., Mäcker, A., Malatyali, M., Meyer auf der Heide, F., Riechers, S.,
Schaefer, J. S., & Sundermeier, J. (2017). Monitoring of Domain-Related Problems
in Distributed Data Streams. In Structural Information and Communication Complexity.
https://doi.org/10.1007/978-3-319-72050-0_13
bibtex: '@inbook{Bemmann_Biermeier_Bürmann_Kemper_Knollmann_Knorr_Kothe_Mäcker_Malatyali_Meyer
auf der Heide_et al._2017, place={Cham}, title={Monitoring of Domain-Related Problems
in Distributed Data Streams}, DOI={10.1007/978-3-319-72050-0_13},
booktitle={Structural Information and Communication Complexity}, author={Bemmann,
Pascal and Biermeier, Felix and Bürmann, Jan and Kemper, Arne and Knollmann, Till
and Knorr, Steffen and Kothe, Nils and Mäcker, Alexander and Malatyali, Manuel
and Meyer auf der Heide, Friedhelm and et al.}, year={2017} }'
chicago: Bemmann, Pascal, Felix Biermeier, Jan Bürmann, Arne Kemper, Till Knollmann,
Steffen Knorr, Nils Kothe, et al. “Monitoring of Domain-Related Problems in Distributed
Data Streams.” In Structural Information and Communication Complexity.
Cham, 2017. https://doi.org/10.1007/978-3-319-72050-0_13.
ieee: P. Bemmann et al., “Monitoring of Domain-Related Problems in Distributed
Data Streams,” in Structural Information and Communication Complexity,
Cham, 2017.
mla: Bemmann, Pascal, et al. “Monitoring of Domain-Related Problems in Distributed
Data Streams.” Structural Information and Communication Complexity, 2017,
doi:10.1007/978-3-319-72050-0_13.
short: 'P. Bemmann, F. Biermeier, J. Bürmann, A. Kemper, T. Knollmann, S. Knorr,
N. Kothe, A. Mäcker, M. Malatyali, F. Meyer auf der Heide, S. Riechers, J.S. Schaefer,
J. Sundermeier, in: Structural Information and Communication Complexity, Cham,
2017.'
date_created: 2020-04-08T07:20:20Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1007/978-3-319-72050-0_13
external_id:
arxiv:
- 'arXiv:1706.03568 '
language:
- iso: eng
place: Cham
publication: Structural Information and Communication Complexity
publication_identifier:
isbn:
- '9783319720494'
- '9783319720500'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Monitoring of Domain-Related Problems in Distributed Data Streams
type: book_chapter
user_id: '15415'
year: '2017'
...
---
_id: '1073'
author:
- first_name: Simon
full_name: Nachtigall, Simon
last_name: Nachtigall
citation:
ama: Nachtigall S. Sortieren dynamischer Daten. Universität Paderborn; 2017.
apa: Nachtigall, S. (2017). Sortieren dynamischer Daten. Universität Paderborn.
bibtex: '@book{Nachtigall_2017, title={Sortieren dynamischer Daten}, publisher={Universität
Paderborn}, author={Nachtigall, Simon}, year={2017} }'
chicago: Nachtigall, Simon. Sortieren dynamischer Daten. Universität Paderborn,
2017.
ieee: S. Nachtigall, Sortieren dynamischer Daten. Universität Paderborn,
2017.
mla: Nachtigall, Simon. Sortieren dynamischer Daten. Universität Paderborn,
2017.
short: S. Nachtigall, Sortieren dynamischer Daten, Universität Paderborn, 2017.
date_created: 2017-12-19T09:59:32Z
date_updated: 2022-01-06T06:50:50Z
department:
- _id: '63'
- _id: '541'
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '7'
name: SFB 901 - Subproject A3
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Alexander
full_name: Skopalik, Alexander
id: '40384'
last_name: Skopalik
title: Sortieren dynamischer Daten
type: bachelorsthesis
user_id: '14052'
year: '2017'
...
---
_id: '1074'
author:
- first_name: Simon
full_name: Pukrop, Simon
last_name: Pukrop
citation:
ama: Pukrop S. Robuste Optimierung in Congestion Games. Universität Paderborn;
2017.
apa: Pukrop, S. (2017). Robuste Optimierung in Congestion Games. Universität
Paderborn.
bibtex: '@book{Pukrop_2017, title={Robuste Optimierung in Congestion Games}, publisher={Universität
Paderborn}, author={Pukrop, Simon}, year={2017} }'
chicago: Pukrop, Simon. Robuste Optimierung in Congestion Games. Universität
Paderborn, 2017.
ieee: S. Pukrop, Robuste Optimierung in Congestion Games. Universität Paderborn,
2017.
mla: Pukrop, Simon. Robuste Optimierung in Congestion Games. Universität
Paderborn, 2017.
short: S. Pukrop, Robuste Optimierung in Congestion Games, Universität Paderborn,
2017.
date_created: 2017-12-19T10:00:25Z
date_updated: 2022-01-06T06:50:50Z
department:
- _id: '63'
- _id: '541'
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '7'
name: SFB 901 - Subproject A3
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Alexander
full_name: Skopalik, Alexander
id: '40384'
last_name: Skopalik
title: Robuste Optimierung in Congestion Games
type: bachelorsthesis
user_id: '14052'
year: '2017'
...
---
_id: '1080'
author:
- first_name: Jan
full_name: Bürmann, Jan
last_name: Bürmann
citation:
ama: Bürmann J. Complexity of Signalling in Routing Games under Uncertainty.
Universität Paderborn; 2017.
apa: Bürmann, J. (2017). Complexity of Signalling in Routing Games under Uncertainty.
Universität Paderborn.
bibtex: '@book{Bürmann_2017, title={Complexity of Signalling in Routing Games under
Uncertainty}, publisher={Universität Paderborn}, author={Bürmann, Jan}, year={2017}
}'
chicago: Bürmann, Jan. Complexity of Signalling in Routing Games under Uncertainty.
Universität Paderborn, 2017.
ieee: J. Bürmann, Complexity of Signalling in Routing Games under Uncertainty.
Universität Paderborn, 2017.
mla: Bürmann, Jan. Complexity of Signalling in Routing Games under Uncertainty.
Universität Paderborn, 2017.
short: J. Bürmann, Complexity of Signalling in Routing Games under Uncertainty,
Universität Paderborn, 2017.
date_created: 2017-12-19T10:07:35Z
date_updated: 2022-01-06T06:50:50Z
department:
- _id: '63'
- _id: '541'
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '7'
name: SFB 901 - Subproject A3
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Alexander
full_name: Skopalik, Alexander
id: '40384'
last_name: Skopalik
title: Complexity of Signalling in Routing Games under Uncertainty
type: mastersthesis
user_id: '14052'
year: '2017'
...
---
_id: '1081'
author:
- first_name: Vipin Ravindran
full_name: Vijayalakshmi, Vipin Ravindran
last_name: Vijayalakshmi
citation:
ama: Vijayalakshmi VR. Bounding the Inefficiency of Equilibria in Congestion
Games under Taxation. Universität Paderborn; 2017.
apa: Vijayalakshmi, V. R. (2017). Bounding the Inefficiency of Equilibria in
Congestion Games under Taxation. Universität Paderborn.
bibtex: '@book{Vijayalakshmi_2017, title={Bounding the Inefficiency of Equilibria
in Congestion Games under Taxation}, publisher={Universität Paderborn}, author={Vijayalakshmi,
Vipin Ravindran}, year={2017} }'
chicago: Vijayalakshmi, Vipin Ravindran. Bounding the Inefficiency of Equilibria
in Congestion Games under Taxation. Universität Paderborn, 2017.
ieee: V. R. Vijayalakshmi, Bounding the Inefficiency of Equilibria in Congestion
Games under Taxation. Universität Paderborn, 2017.
mla: Vijayalakshmi, Vipin Ravindran. Bounding the Inefficiency of Equilibria
in Congestion Games under Taxation. Universität Paderborn, 2017.
short: V.R. Vijayalakshmi, Bounding the Inefficiency of Equilibria in Congestion
Games under Taxation, Universität Paderborn, 2017.
date_created: 2017-12-19T10:08:44Z
date_updated: 2022-01-06T06:50:51Z
department:
- _id: '63'
- _id: '541'
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '7'
name: SFB 901 - Subproject A3
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Alexander
full_name: Skopalik, Alexander
id: '40384'
last_name: Skopalik
title: Bounding the Inefficiency of Equilibria in Congestion Games under Taxation
type: mastersthesis
user_id: '14052'
year: '2017'
...
---
_id: '1094'
abstract:
- lang: eng
text: Many university students struggle with motivational problems, and gamification
has the potential to address these problems. However, gamification is hardly used
in education, because current approaches to gamification require instructors to
engage in the time-consuming preparation of their course contents for use in quizzes,
mini-games and the like. Drawing on research on limited attention and present
bias, we propose a "lean" approach to gamification, which relies on gamifying
learning activities (rather than learning contents) and increasing their salience.
In this paper, we present the app StudyNow that implements such a lean gamification
approach. With this app, we aim to enable more students and instructors to benefit
from the advantages of gamification.
author:
- first_name: Matthias
full_name: Feldotto, Matthias
id: '14052'
last_name: Feldotto
orcid: 0000-0003-1348-6516
- first_name: Thomas
full_name: John, Thomas
id: '3952'
last_name: John
- first_name: Dennis
full_name: Kundisch, Dennis
id: '21117'
last_name: Kundisch
- first_name: Paul
full_name: Hemsen, Paul
id: '22546'
last_name: Hemsen
- first_name: Katrin
full_name: Klingsieck, Katrin
last_name: Klingsieck
- first_name: Alexander
full_name: Skopalik, Alexander
id: '40384'
last_name: Skopalik
citation:
ama: 'Feldotto M, John T, Kundisch D, Hemsen P, Klingsieck K, Skopalik A. Making
Gamification Easy for the Professor: Decoupling Game and Content with the StudyNow
Mobile App. In: Proceedings of the 12th International Conference on Design
Science Research in Information Systems and Technology (DESRIST). LNCS. ;
2017:462-467. doi:10.1007/978-3-319-59144-5_32'
apa: 'Feldotto, M., John, T., Kundisch, D., Hemsen, P., Klingsieck, K., & Skopalik,
A. (2017). Making Gamification Easy for the Professor: Decoupling Game and Content
with the StudyNow Mobile App. In Proceedings of the 12th International Conference
on Design Science Research in Information Systems and Technology (DESRIST)
(pp. 462–467). https://doi.org/10.1007/978-3-319-59144-5_32'
bibtex: '@inproceedings{Feldotto_John_Kundisch_Hemsen_Klingsieck_Skopalik_2017,
series={LNCS}, title={Making Gamification Easy for the Professor: Decoupling Game
and Content with the StudyNow Mobile App}, DOI={10.1007/978-3-319-59144-5_32},
booktitle={Proceedings of the 12th International Conference on Design Science
Research in Information Systems and Technology (DESRIST)}, author={Feldotto, Matthias
and John, Thomas and Kundisch, Dennis and Hemsen, Paul and Klingsieck, Katrin
and Skopalik, Alexander}, year={2017}, pages={462–467}, collection={LNCS} }'
chicago: 'Feldotto, Matthias, Thomas John, Dennis Kundisch, Paul Hemsen, Katrin
Klingsieck, and Alexander Skopalik. “Making Gamification Easy for the Professor:
Decoupling Game and Content with the StudyNow Mobile App.” In Proceedings of
the 12th International Conference on Design Science Research in Information Systems
and Technology (DESRIST), 462–67. LNCS, 2017. https://doi.org/10.1007/978-3-319-59144-5_32.'
ieee: 'M. Feldotto, T. John, D. Kundisch, P. Hemsen, K. Klingsieck, and A. Skopalik,
“Making Gamification Easy for the Professor: Decoupling Game and Content with
the StudyNow Mobile App,” in Proceedings of the 12th International Conference
on Design Science Research in Information Systems and Technology (DESRIST),
2017, pp. 462–467.'
mla: 'Feldotto, Matthias, et al. “Making Gamification Easy for the Professor: Decoupling
Game and Content with the StudyNow Mobile App.” Proceedings of the 12th International
Conference on Design Science Research in Information Systems and Technology (DESRIST),
2017, pp. 462–67, doi:10.1007/978-3-319-59144-5_32.'
short: 'M. Feldotto, T. John, D. Kundisch, P. Hemsen, K. Klingsieck, A. Skopalik,
in: Proceedings of the 12th International Conference on Design Science Research
in Information Systems and Technology (DESRIST), 2017, pp. 462–467.'
date_created: 2018-01-05T08:37:52Z
date_updated: 2022-01-06T06:50:53Z
ddc:
- '000'
department:
- _id: '63'
- _id: '541'
- _id: '276'
doi: 10.1007/978-3-319-59144-5_32
file:
- access_level: closed
content_type: application/pdf
creator: feldi
date_created: 2018-10-31T17:01:09Z
date_updated: 2018-10-31T17:01:09Z
file_id: '5230'
file_name: Feldotto2017_Chapter_MakingGamificationEasyForThePr.pdf
file_size: 1576363
relation: main_file
success: 1
file_date_updated: 2018-10-31T17:01:09Z
has_accepted_license: '1'
language:
- iso: eng
page: 462-467
publication: Proceedings of the 12th International Conference on Design Science Research
in Information Systems and Technology (DESRIST)
series_title: LNCS
status: public
title: 'Making Gamification Easy for the Professor: Decoupling Game and Content with
the StudyNow Mobile App'
type: conference
user_id: '14052'
year: '2017'
...
---
_id: '1095'
abstract:
- lang: eng
text: 'Many university students struggle with motivational problems, and gamification
has the potential to address these problems. However, using gamification currently
is rather tedious and time-consuming for instructors because current approaches
to gamification require instructors to engage in the time-consuming preparation
of course contents (e.g., for quizzes or mini-games). In reply to this issue,
we propose a “lean” approach to gamification, which relies on gamifying learning
activities rather than learning contents. The learning activities that are gamified
in the lean approach can typically be drawn from existing course syllabi (e.g.,
attend certain lectures, hand in assignments, read book chapters and articles).
Hence, compared to existing approaches, lean gamification substantially lowers
the time requirements posed on instructors for gamifying a given course. Drawing
on research on limited attention and the present bias, we provide the theoretical
foundation for the lean gamification approach. In addition, we present a mobile
application that implements lean gamification and outline a mixed-methods study
that is currently under way for evaluating whether lean gamification does indeed
have the potential to increase students’ motivation. We thereby hope to allow
more students and instructors to benefit from the advantages of gamification. '
author:
- first_name: Thomas
full_name: John, Thomas
id: '3952'
last_name: John
- first_name: Matthias
full_name: Feldotto, Matthias
id: '14052'
last_name: Feldotto
orcid: 0000-0003-1348-6516
- first_name: Paul
full_name: Hemsen, Paul
id: '22546'
last_name: Hemsen
- first_name: Katrin
full_name: Klingsieck, Katrin
last_name: Klingsieck
- first_name: Dennis
full_name: Kundisch, Dennis
id: '21117'
last_name: Kundisch
- first_name: Mike
full_name: Langendorf, Mike
last_name: Langendorf
citation:
ama: 'John T, Feldotto M, Hemsen P, Klingsieck K, Kundisch D, Langendorf M. Towards
a Lean Approach for Gamifying Education. In: Proceedings of the 25th European
Conference on Information Systems (ECIS). ; 2017:2970-2979.'
apa: John, T., Feldotto, M., Hemsen, P., Klingsieck, K., Kundisch, D., & Langendorf,
M. (2017). Towards a Lean Approach for Gamifying Education. In Proceedings
of the 25th European Conference on Information Systems (ECIS) (pp. 2970–2979).
bibtex: '@inproceedings{John_Feldotto_Hemsen_Klingsieck_Kundisch_Langendorf_2017,
title={Towards a Lean Approach for Gamifying Education}, booktitle={Proceedings
of the 25th European Conference on Information Systems (ECIS)}, author={John,
Thomas and Feldotto, Matthias and Hemsen, Paul and Klingsieck, Katrin and Kundisch,
Dennis and Langendorf, Mike}, year={2017}, pages={2970–2979} }'
chicago: John, Thomas, Matthias Feldotto, Paul Hemsen, Katrin Klingsieck, Dennis
Kundisch, and Mike Langendorf. “Towards a Lean Approach for Gamifying Education.”
In Proceedings of the 25th European Conference on Information Systems (ECIS),
2970–79, 2017.
ieee: T. John, M. Feldotto, P. Hemsen, K. Klingsieck, D. Kundisch, and M. Langendorf,
“Towards a Lean Approach for Gamifying Education,” in Proceedings of the 25th
European Conference on Information Systems (ECIS), 2017, pp. 2970–2979.
mla: John, Thomas, et al. “Towards a Lean Approach for Gamifying Education.” Proceedings
of the 25th European Conference on Information Systems (ECIS), 2017, pp. 2970–79.
short: 'T. John, M. Feldotto, P. Hemsen, K. Klingsieck, D. Kundisch, M. Langendorf,
in: Proceedings of the 25th European Conference on Information Systems (ECIS),
2017, pp. 2970–2979.'
date_created: 2018-01-05T08:39:41Z
date_updated: 2022-01-06T06:50:53Z
ddc:
- '000'
department:
- _id: '63'
- _id: '541'
- _id: '178'
- _id: '185'
file:
- access_level: closed
content_type: application/pdf
creator: feldi
date_created: 2018-10-31T17:02:07Z
date_updated: 2018-10-31T17:02:07Z
file_id: '5232'
file_name: TOWARDS A LEAN APPROACH TO GAMIFYING EDUCATION.pdf
file_size: 485333
relation: main_file
success: 1
file_date_updated: 2018-10-31T17:02:07Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://aisel.aisnet.org/ecis2017_rip/46
oa: '1'
page: 2970-2979
publication: Proceedings of the 25th European Conference on Information Systems (ECIS)
status: public
title: Towards a Lean Approach for Gamifying Education
type: conference
user_id: '14052'
year: '2017'
...
---
_id: '110'
abstract:
- lang: eng
text: 'We consider an extension of the dynamic speed scaling scheduling model introduced
by Yao et al.: A set of jobs, each with a release time, deadline, and workload,
has to be scheduled on a single, speed-scalable processor. Both the maximum allowed
speed of the processor and the energy costs may vary continuously over time. The
objective is to find a feasible schedule that minimizes the total energy costs.
Theoretical algorithm design for speed scaling problems often tends to discretize
problems, as our tools in the discrete realm are often better developed or understood.
Using the above speed scaling variant with variable, continuous maximal processor
speeds and energy prices as an example, we demonstrate that a more direct approach
via tools from variational calculus can not only lead to a very concise and elegant
formulation and analysis, but also avoids the “explosion of variables/constraints”
that often comes with discretizing. Using well-known tools from calculus of variations,
we derive combinatorial optimality characteristics for our continuous problem
and provide a quite concise and simple correctness proof.'
author:
- first_name: Antonios
full_name: Antoniadis, Antonios
last_name: Antoniadis
- first_name: Peter
full_name: Kling, Peter
last_name: Kling
- first_name: Sebastian
full_name: Ott, Sebastian
last_name: Ott
- first_name: Sören
full_name: Riechers, Sören
last_name: Riechers
citation:
ama: 'Antoniadis A, Kling P, Ott S, Riechers S. Continuous Speed Scaling with Variability:
A Simple and Direct Approach. Theoretical Computer Science. 2017:1-13.
doi:10.1016/j.tcs.2017.03.021'
apa: 'Antoniadis, A., Kling, P., Ott, S., & Riechers, S. (2017). Continuous
Speed Scaling with Variability: A Simple and Direct Approach. Theoretical Computer
Science, 1–13. https://doi.org/10.1016/j.tcs.2017.03.021'
bibtex: '@article{Antoniadis_Kling_Ott_Riechers_2017, title={Continuous Speed Scaling
with Variability: A Simple and Direct Approach}, DOI={10.1016/j.tcs.2017.03.021},
journal={Theoretical Computer Science}, publisher={Elsevier}, author={Antoniadis,
Antonios and Kling, Peter and Ott, Sebastian and Riechers, Sören}, year={2017},
pages={1–13} }'
chicago: 'Antoniadis, Antonios, Peter Kling, Sebastian Ott, and Sören Riechers.
“Continuous Speed Scaling with Variability: A Simple and Direct Approach.” Theoretical
Computer Science, 2017, 1–13. https://doi.org/10.1016/j.tcs.2017.03.021.'
ieee: 'A. Antoniadis, P. Kling, S. Ott, and S. Riechers, “Continuous Speed Scaling
with Variability: A Simple and Direct Approach,” Theoretical Computer Science,
pp. 1–13, 2017.'
mla: 'Antoniadis, Antonios, et al. “Continuous Speed Scaling with Variability: A
Simple and Direct Approach.” Theoretical Computer Science, Elsevier, 2017,
pp. 1–13, doi:10.1016/j.tcs.2017.03.021.'
short: A. Antoniadis, P. Kling, S. Ott, S. Riechers, Theoretical Computer Science
(2017) 1–13.
date_created: 2017-10-17T12:41:13Z
date_updated: 2022-01-06T06:50:55Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1016/j.tcs.2017.03.021
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T13:07:43Z
date_updated: 2018-03-21T13:07:43Z
file_id: '1567'
file_name: 110-TCSSubmission.pdf
file_size: 494600
relation: main_file
success: 1
file_date_updated: 2018-03-21T13:07:43Z
has_accepted_license: '1'
language:
- iso: eng
page: 1-13
project:
- _id: '1'
name: SFB 901
- _id: '16'
name: SFB 901 - Subprojekt C4
- _id: '4'
name: SFB 901 - Project Area C
publication: Theoretical Computer Science
publisher: Elsevier
status: public
title: 'Continuous Speed Scaling with Variability: A Simple and Direct Approach'
type: journal_article
user_id: '477'
year: '2017'
...
---
_id: '16338'
abstract:
- lang: eng
text: To detect errors or find potential for improvement during the CAD-supported
development of a complex technical system like modern industrial machines, the
system’s virtual prototype can be examined in virtual reality (VR) in the context
of virtual design reviews. Besides exploring the static shape of the examined
system, observing the machines’ mechanics (e.g., motor-driven mechanisms) and
transport routes for the material transport (e.g., via conveyor belts or chains,
or rail-based transport systems) can play an equally important role in such a
review. In practice it is often the case, that the relevant information about
transport routes, or kinematic properties is either not consequently modeled in
the CAD data or is lost during conversion processes. To significantly reduce the
manual effort and costs for creating animations of the machines complex behavior
with such limited input data for a design review, we present a set of algorithms
to automatically determine geometrical properties of machine parts based only
on their triangulated surfaces. The algorithms allow to detect the course of transport
systems, the orientation of objects in 3d space, rotation axes of cylindrical
objects and holes, the number of tooth of gears, as well as the tooth spacing
of toothed racks. We implemented the algorithms in the VR system PADrend and applied
them to animate virtual prototypes of real machines.
author:
- first_name: Sascha
full_name: Brandt, Sascha
id: '11648'
last_name: Brandt
orcid: https://orcid.org/0000-0003-3546-203X
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
- first_name: Maria
full_name: Gerges, Maria
last_name: Gerges
- first_name: Claudius
full_name: Jähn, Claudius
last_name: Jähn
- first_name: Jan
full_name: Berssenbrügge, Jan
last_name: Berssenbrügge
citation:
ama: 'Brandt S, Fischer M, Gerges M, Jähn C, Berssenbrügge J. Automatic Derivation
of Geometric Properties of Components From 3D Polygon Models. In: Volume 1:
37th Computers and Information in Engineering Conference. Vol 1. ; 2017:91:1-91:10.
doi:10.1115/detc2017-67528'
apa: 'Brandt, S., Fischer, M., Gerges, M., Jähn, C., & Berssenbrügge, J. (2017).
Automatic Derivation of Geometric Properties of Components From 3D Polygon Models.
In Volume 1: 37th Computers and Information in Engineering Conference (Vol.
1, pp. 91:1-91:10). Cleveland, USA. https://doi.org/10.1115/detc2017-67528'
bibtex: '@inproceedings{Brandt_Fischer_Gerges_Jähn_Berssenbrügge_2017, title={Automatic
Derivation of Geometric Properties of Components From 3D Polygon Models}, volume={1},
DOI={10.1115/detc2017-67528},
booktitle={Volume 1: 37th Computers and Information in Engineering Conference},
author={Brandt, Sascha and Fischer, Matthias and Gerges, Maria and Jähn, Claudius
and Berssenbrügge, Jan}, year={2017}, pages={91:1-91:10} }'
chicago: 'Brandt, Sascha, Matthias Fischer, Maria Gerges, Claudius Jähn, and Jan
Berssenbrügge. “Automatic Derivation of Geometric Properties of Components From
3D Polygon Models.” In Volume 1: 37th Computers and Information in Engineering
Conference, 1:91:1-91:10, 2017. https://doi.org/10.1115/detc2017-67528.'
ieee: 'S. Brandt, M. Fischer, M. Gerges, C. Jähn, and J. Berssenbrügge, “Automatic
Derivation of Geometric Properties of Components From 3D Polygon Models,” in Volume
1: 37th Computers and Information in Engineering Conference, Cleveland, USA,
2017, vol. 1, pp. 91:1-91:10.'
mla: 'Brandt, Sascha, et al. “Automatic Derivation of Geometric Properties of Components
From 3D Polygon Models.” Volume 1: 37th Computers and Information in Engineering
Conference, vol. 1, 2017, pp. 91:1-91:10, doi:10.1115/detc2017-67528.'
short: 'S. Brandt, M. Fischer, M. Gerges, C. Jähn, J. Berssenbrügge, in: Volume
1: 37th Computers and Information in Engineering Conference, 2017, pp. 91:1-91:10.'
conference:
end_date: 2017-08-09
location: Cleveland, USA
name: 37th Computers and Information in Engineering Conference
start_date: 2017-08-06
date_created: 2020-03-24T08:36:05Z
date_updated: 2022-01-06T06:52:49Z
department:
- _id: '63'
doi: 10.1115/detc2017-67528
intvolume: ' 1'
language:
- iso: eng
page: 91:1-91:10
publication: 'Volume 1: 37th Computers and Information in Engineering Conference'
publication_identifier:
isbn:
- '9780791858110'
publication_status: published
status: public
title: Automatic Derivation of Geometric Properties of Components From 3D Polygon
Models
type: conference
user_id: '15415'
volume: 1
year: '2017'
...
---
_id: '16339'
abstract:
- lang: ger
text: In der CAD-unterstützten Entwicklung von technischen Systemen (Maschinen,
Anlagen etc.) werden virtuelle Prototypen im Rahmen eines virtuellen Design-Reviews
mit Hilfe eines VR-Systems gesamtheitlich betrachtet, um frühzeitig Fehler und
Verbesserungsbedarf zu erkennen. Ein wichtiger Untersuchungsgegenstand ist dabei
die Analyse von Transportwegen für den Materialtransport mittels Fließbändern,
Förderketten oder schienenbasierten Transportsystemen. Diese Transportwege werden
im VR-System animiert. Problematisch dabei ist, dass derartige Transportsysteme
im zugrundeliegenden CAD-Modell in der Praxis oft nicht modelliert und nur exemplarisch
angedeutet werden, da diese für die Konstruktion nicht relevant sind (z.B. der
Fördergurt eines Förderbandes, oder die Kette einer Förderkette), oder die Informationen
über den Verlauf bei der Konvertierung der Daten in das VR-System verloren gehen.
Bei der Animation dieser Transportsysteme in einem VR-System muss der Transportweg
also aufwändig, manuell nachgearbeitet werden. Das Ziel dieser Arbeit ist die
Reduzierung des notwendigen manuellen Nachbearbeitungsaufwandes für das Design-Review
durch eine automatische Berechnung der Animationspfade entlang eines Transportsystems.
Es wird ein Algorithmus vorgestellt, der es ermöglicht mit nur geringem zeitlichem
Benutzeraufwand den Animationspfad aus den reinen polygonalen dreidimensionalen
Daten eines Transportsystems automatisch zu rekonstruieren.
author:
- first_name: Sascha
full_name: Brandt, Sascha
id: '11648'
last_name: Brandt
orcid: https://orcid.org/0000-0003-3546-203X
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
citation:
ama: 'Brandt S, Fischer M. Automatische Ableitung der Transportwege von Transportsystemen
aus dem 3D-Polygonmodell. In: Wissenschaftsforum Intelligente Technische Systeme
(WInTeSys) 2017. Vol 369. Paderborn: Verlagsschriftenreihe des Heinz Nixdorf
Instituts, Paderborn; 2017:415-427.'
apa: 'Brandt, S., & Fischer, M. (2017). Automatische Ableitung der Transportwege
von Transportsystemen aus dem 3D-Polygonmodell. In Wissenschaftsforum Intelligente
Technische Systeme (WInTeSys) 2017 (Vol. 369, pp. 415–427). Paderborn: Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn.'
bibtex: '@inproceedings{Brandt_Fischer_2017, place={Paderborn}, title={Automatische
Ableitung der Transportwege von Transportsystemen aus dem 3D-Polygonmodell}, volume={369},
booktitle={Wissenschaftsforum Intelligente Technische Systeme (WInTeSys) 2017},
publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Brandt,
Sascha and Fischer, Matthias}, year={2017}, pages={415–427} }'
chicago: 'Brandt, Sascha, and Matthias Fischer. “Automatische Ableitung der Transportwege
von Transportsystemen aus dem 3D-Polygonmodell.” In Wissenschaftsforum Intelligente
Technische Systeme (WInTeSys) 2017, 369:415–27. Paderborn: Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 2017.'
ieee: S. Brandt and M. Fischer, “Automatische Ableitung der Transportwege von Transportsystemen
aus dem 3D-Polygonmodell,” in Wissenschaftsforum Intelligente Technische Systeme
(WInTeSys) 2017, Paderborn, 2017, vol. 369, pp. 415–427.
mla: Brandt, Sascha, and Matthias Fischer. “Automatische Ableitung der Transportwege
von Transportsystemen aus dem 3D-Polygonmodell.” Wissenschaftsforum Intelligente
Technische Systeme (WInTeSys) 2017, vol. 369, Verlagsschriftenreihe des Heinz
Nixdorf Instituts, Paderborn, 2017, pp. 415–27.
short: 'S. Brandt, M. Fischer, in: Wissenschaftsforum Intelligente Technische Systeme
(WInTeSys) 2017, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn,
Paderborn, 2017, pp. 415–427.'
conference:
end_date: 2017-05-12
location: Paderborn
name: Wissenschaftsforum Intelligente Technische Systeme (WInTeSys) 2017
start_date: 2017-05-11
date_created: 2020-03-24T08:44:25Z
date_updated: 2022-01-06T06:52:49Z
department:
- _id: '63'
intvolume: ' 369'
language:
- iso: ger
page: 415-427
place: Paderborn
publication: Wissenschaftsforum Intelligente Technische Systeme (WInTeSys) 2017
publication_status: published
publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
status: public
title: Automatische Ableitung der Transportwege von Transportsystemen aus dem 3D-Polygonmodell
type: conference
user_id: '11648'
volume: 369
year: '2017'
...
---
_id: '16347'
author:
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
- first_name: Daniel
full_name: Jung, Daniel
id: '37827'
last_name: Jung
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Fischer M, Jung D, Meyer auf der Heide F. Gathering Anonymous, Oblivious Robots
on a Grid. In: Fernández Anta A, Jurdzinski T, Mosteiro MA, Zhang Y, eds. Algorithms
for Sensor Systems - 13th International Symposium on Algorithms and Experiments
for Wireless Sensor Networks, {ALGOSENSORS}. Vol 10718. Lecture Notes in Computer
Science. Vienna, Austria: Springer; 2017:168-181. doi:10.1007/978-3-319-72751-6_13'
apa: 'Fischer, M., Jung, D., & Meyer auf der Heide, F. (2017). Gathering Anonymous,
Oblivious Robots on a Grid. In A. Fernández Anta, T. Jurdzinski, M. A. Mosteiro,
& Y. Zhang (Eds.), Algorithms for Sensor Systems - 13th International Symposium
on Algorithms and Experiments for Wireless Sensor Networks, {ALGOSENSORS}
(Vol. 10718, pp. 168–181). Vienna, Austria: Springer. https://doi.org/10.1007/978-3-319-72751-6_13'
bibtex: '@inproceedings{Fischer_Jung_Meyer auf der Heide_2017, place={Vienna, Austria},
series={Lecture Notes in Computer Science}, title={Gathering Anonymous, Oblivious
Robots on a Grid}, volume={10718}, DOI={10.1007/978-3-319-72751-6_13},
booktitle={Algorithms for Sensor Systems - 13th International Symposium on Algorithms
and Experiments for Wireless Sensor Networks, {ALGOSENSORS}}, publisher={Springer},
author={Fischer, Matthias and Jung, Daniel and Meyer auf der Heide, Friedhelm},
editor={Fernández Anta, Antonio and Jurdzinski, Tomasz and Mosteiro, Miguel A.
and Zhang, YanyongEditors}, year={2017}, pages={168–181}, collection={Lecture
Notes in Computer Science} }'
chicago: 'Fischer, Matthias, Daniel Jung, and Friedhelm Meyer auf der Heide. “Gathering
Anonymous, Oblivious Robots on a Grid.” In Algorithms for Sensor Systems -
13th International Symposium on Algorithms and Experiments for Wireless Sensor
Networks, {ALGOSENSORS}, edited by Antonio Fernández Anta, Tomasz Jurdzinski,
Miguel A. Mosteiro, and Yanyong Zhang, 10718:168–81. Lecture Notes in Computer
Science. Vienna, Austria: Springer, 2017. https://doi.org/10.1007/978-3-319-72751-6_13.'
ieee: M. Fischer, D. Jung, and F. Meyer auf der Heide, “Gathering Anonymous, Oblivious
Robots on a Grid,” in Algorithms for Sensor Systems - 13th International Symposium
on Algorithms and Experiments for Wireless Sensor Networks, {ALGOSENSORS},
2017, vol. 10718, pp. 168–181.
mla: Fischer, Matthias, et al. “Gathering Anonymous, Oblivious Robots on a Grid.”
Algorithms for Sensor Systems - 13th International Symposium on Algorithms
and Experiments for Wireless Sensor Networks, {ALGOSENSORS}, edited by Antonio
Fernández Anta et al., vol. 10718, Springer, 2017, pp. 168–81, doi:10.1007/978-3-319-72751-6_13.
short: 'M. Fischer, D. Jung, F. Meyer auf der Heide, in: A. Fernández Anta, T. Jurdzinski,
M.A. Mosteiro, Y. Zhang (Eds.), Algorithms for Sensor Systems - 13th International
Symposium on Algorithms and Experiments for Wireless Sensor Networks, {ALGOSENSORS},
Springer, Vienna, Austria, 2017, pp. 168–181.'
date_created: 2020-03-27T14:32:39Z
date_updated: 2022-01-06T06:52:49Z
department:
- _id: '63'
doi: 10.1007/978-3-319-72751-6_13
editor:
- first_name: Antonio
full_name: Fernández Anta, Antonio
last_name: Fernández Anta
- first_name: Tomasz
full_name: Jurdzinski, Tomasz
last_name: Jurdzinski
- first_name: Miguel A.
full_name: Mosteiro, Miguel A.
last_name: Mosteiro
- first_name: Yanyong
full_name: Zhang, Yanyong
last_name: Zhang
intvolume: ' 10718'
language:
- iso: eng
page: 168-181
place: Vienna, Austria
publication: Algorithms for Sensor Systems - 13th International Symposium on Algorithms
and Experiments for Wireless Sensor Networks, {ALGOSENSORS}
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: Gathering Anonymous, Oblivious Robots on a Grid
type: conference
user_id: '15415'
volume: 10718
year: '2017'
...
---
_id: '16348'
author:
- first_name: Felix
full_name: Biermeier, Felix
last_name: Biermeier
- first_name: Björn
full_name: Feldkord, Björn
id: '22704'
last_name: Feldkord
- first_name: Manuel
full_name: Malatyali, Manuel
last_name: Malatyali
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Biermeier F, Feldkord B, Malatyali M, Meyer auf der Heide F. A Communication-Efficient
Distributed Data Structure for Top-k and k-Select Queries. In: Proceedings
of the 15th Workshop on Approximation and Online Algorithms (WAOA). Springer;
2017:285-300. doi:10.1007/978-3-319-89441-6_21'
apa: Biermeier, F., Feldkord, B., Malatyali, M., & Meyer auf der Heide, F. (2017).
A Communication-Efficient Distributed Data Structure for Top-k and k-Select Queries.
In Proceedings of the 15th Workshop on Approximation and Online Algorithms
(WAOA) (pp. 285–300). Springer. https://doi.org/10.1007/978-3-319-89441-6_21
bibtex: '@inproceedings{Biermeier_Feldkord_Malatyali_Meyer auf der Heide_2017, title={A
Communication-Efficient Distributed Data Structure for Top-k and k-Select Queries},
DOI={10.1007/978-3-319-89441-6_21},
booktitle={Proceedings of the 15th Workshop on Approximation and Online Algorithms
(WAOA)}, publisher={Springer}, author={Biermeier, Felix and Feldkord, Björn and
Malatyali, Manuel and Meyer auf der Heide, Friedhelm}, year={2017}, pages={285–300}
}'
chicago: Biermeier, Felix, Björn Feldkord, Manuel Malatyali, and Friedhelm Meyer
auf der Heide. “A Communication-Efficient Distributed Data Structure for Top-k
and k-Select Queries.” In Proceedings of the 15th Workshop on Approximation
and Online Algorithms (WAOA), 285–300. Springer, 2017. https://doi.org/10.1007/978-3-319-89441-6_21.
ieee: F. Biermeier, B. Feldkord, M. Malatyali, and F. Meyer auf der Heide, “A Communication-Efficient
Distributed Data Structure for Top-k and k-Select Queries,” in Proceedings
of the 15th Workshop on Approximation and Online Algorithms (WAOA), 2017,
pp. 285–300.
mla: Biermeier, Felix, et al. “A Communication-Efficient Distributed Data Structure
for Top-k and k-Select Queries.” Proceedings of the 15th Workshop on Approximation
and Online Algorithms (WAOA), Springer, 2017, pp. 285–300, doi:10.1007/978-3-319-89441-6_21.
short: 'F. Biermeier, B. Feldkord, M. Malatyali, F. Meyer auf der Heide, in: Proceedings
of the 15th Workshop on Approximation and Online Algorithms (WAOA), Springer,
2017, pp. 285–300.'
date_created: 2020-03-30T09:25:18Z
date_updated: 2022-01-06T06:52:49Z
department:
- _id: '63'
doi: 10.1007/978-3-319-89441-6_21
language:
- iso: eng
page: 285 - 300
publication: Proceedings of the 15th Workshop on Approximation and Online Algorithms
(WAOA)
publisher: Springer
status: public
title: A Communication-Efficient Distributed Data Structure for Top-k and k-Select
Queries
type: conference
user_id: '15415'
year: '2017'
...
---
_id: '16349'
author:
- first_name: Pavel
full_name: Podlipyan, Pavel
last_name: Podlipyan
- first_name: Shouwei
full_name: Li, Shouwei
last_name: Li
- first_name: Christine
full_name: Markarian, Christine
id: '37612'
last_name: Markarian
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Podlipyan P, Li S, Markarian C, Meyer auf der Heide F. A Continuous Strategy
for Collisionless Gathering. In: Proceedings of the 13th International Symposium
on Algorithms and Experiments for Wireless Networks (ALGOSENSORS). ; 2017:182-197.
doi:10.1007/978-3-319-72751-6_14
'
apa: Podlipyan, P., Li, S., Markarian, C., & Meyer auf der Heide, F. (2017).
A Continuous Strategy for Collisionless Gathering. In Proceedings of the 13th
International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS)
(pp. 182–197). https://doi.org/10.1007/978-3-319-72751-6_14
bibtex: '@inproceedings{Podlipyan_Li_Markarian_Meyer auf der Heide_2017, title={A
Continuous Strategy for Collisionless Gathering}, DOI={10.1007/978-3-319-72751-6_14 }, booktitle={Proceedings of the 13th International
Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS)},
author={Podlipyan, Pavel and Li, Shouwei and Markarian, Christine and Meyer auf
der Heide, Friedhelm}, year={2017}, pages={182–197} }'
chicago: Podlipyan, Pavel, Shouwei Li, Christine Markarian, and Friedhelm Meyer
auf der Heide. “A Continuous Strategy for Collisionless Gathering.” In Proceedings
of the 13th International Symposium on Algorithms and Experiments for Wireless
Networks (ALGOSENSORS), 182–97, 2017. https://doi.org/10.1007/978-3-319-72751-6_14 .
ieee: P. Podlipyan, S. Li, C. Markarian, and F. Meyer auf der Heide, “A Continuous
Strategy for Collisionless Gathering,” in Proceedings of the 13th International
Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS),
2017, pp. 182–197.
mla: Podlipyan, Pavel, et al. “A Continuous Strategy for Collisionless Gathering.”
Proceedings of the 13th International Symposium on Algorithms and Experiments
for Wireless Networks (ALGOSENSORS), 2017, pp. 182–97, doi:10.1007/978-3-319-72751-6_14 .
short: 'P. Podlipyan, S. Li, C. Markarian, F. Meyer auf der Heide, in: Proceedings
of the 13th International Symposium on Algorithms and Experiments for Wireless
Networks (ALGOSENSORS), 2017, pp. 182–197.'
date_created: 2020-03-30T09:43:05Z
date_updated: 2022-01-06T06:52:49Z
department:
- _id: '63'
doi: '10.1007/978-3-319-72751-6_14 '
language:
- iso: eng
page: 182-197
publication: Proceedings of the 13th International Symposium on Algorithms and Experiments
for Wireless Networks (ALGOSENSORS)
status: public
title: A Continuous Strategy for Collisionless Gathering
type: conference
user_id: '15415'
year: '2017'
...
---
_id: '19961'
abstract:
- lang: eng
text: The self-organizing bio-hybrid collaboration ofrobots and natural plants allows
for a variety of interestingapplications. As an example we investigate how robots
can beused to control the growth and motion of a natural plant, using LEDs to
provide stimuli. We follow an evolutionaryrobotics approach where task performance
is determined bymonitoring the plant's reaction. First, we do initial plantexperiments
with simple, predetermined controllers. Then weuse image sampling data as a model
of the dynamics ofthe plant tip xy position. Second, we use this approach toevolve
robot controllers in simulation. The task is to makethe plant approach three predetermined,
distinct points in anxy-plane. Finally, we test the evolved controllers in real
plantexperiments and find that we cross the reality gap successfully. We shortly
describe how we have extended from plant tipto many points on the plant, for a
model of the plant stemdynamics. Future work will extend to two-axes image samplingfor
a 3-d approach.
author:
- first_name: Mostafa
full_name: Wahby, Mostafa
last_name: Wahby
- first_name: Daniel Nicolas
full_name: Hofstadler, Daniel Nicolas
last_name: Hofstadler
- first_name: Mary Katherine
full_name: Heinrich, Mary Katherine
last_name: Heinrich
- first_name: Payam
full_name: Zahadat, Payam
last_name: Zahadat
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
citation:
ama: 'Wahby M, Hofstadler DN, Heinrich MK, Zahadat P, Hamann H. An Evolutionary
Robotics Approach to the Control of Plant Growth and Motion: Modeling Plants and
Crossing the Reality Gap. In: Proc. of the 10th International Conference on
Self-Adaptive and Self-Organizing Systems. ; 2016. doi:10.1109/saso.2016.8'
apa: 'Wahby, M., Hofstadler, D. N., Heinrich, M. K., Zahadat, P., & Hamann,
H. (2016). An Evolutionary Robotics Approach to the Control of Plant Growth and
Motion: Modeling Plants and Crossing the Reality Gap. In Proc. of the 10th
International Conference on Self-Adaptive and Self-Organizing Systems. https://doi.org/10.1109/saso.2016.8'
bibtex: '@inproceedings{Wahby_Hofstadler_Heinrich_Zahadat_Hamann_2016, title={An
Evolutionary Robotics Approach to the Control of Plant Growth and Motion: Modeling
Plants and Crossing the Reality Gap}, DOI={10.1109/saso.2016.8},
booktitle={Proc. of the 10th International Conference on Self-Adaptive and Self-Organizing
Systems}, author={Wahby, Mostafa and Hofstadler, Daniel Nicolas and Heinrich,
Mary Katherine and Zahadat, Payam and Hamann, Heiko}, year={2016} }'
chicago: 'Wahby, Mostafa, Daniel Nicolas Hofstadler, Mary Katherine Heinrich, Payam
Zahadat, and Heiko Hamann. “An Evolutionary Robotics Approach to the Control of
Plant Growth and Motion: Modeling Plants and Crossing the Reality Gap.” In Proc.
of the 10th International Conference on Self-Adaptive and Self-Organizing Systems,
2016. https://doi.org/10.1109/saso.2016.8.'
ieee: 'M. Wahby, D. N. Hofstadler, M. K. Heinrich, P. Zahadat, and H. Hamann, “An
Evolutionary Robotics Approach to the Control of Plant Growth and Motion: Modeling
Plants and Crossing the Reality Gap,” in Proc. of the 10th International Conference
on Self-Adaptive and Self-Organizing Systems, 2016.'
mla: 'Wahby, Mostafa, et al. “An Evolutionary Robotics Approach to the Control of
Plant Growth and Motion: Modeling Plants and Crossing the Reality Gap.” Proc.
of the 10th International Conference on Self-Adaptive and Self-Organizing Systems,
2016, doi:10.1109/saso.2016.8.'
short: 'M. Wahby, D.N. Hofstadler, M.K. Heinrich, P. Zahadat, H. Hamann, in: Proc.
of the 10th International Conference on Self-Adaptive and Self-Organizing Systems,
2016.'
date_created: 2020-10-08T12:57:13Z
date_updated: 2022-01-06T06:54:17Z
department:
- _id: '63'
- _id: '238'
doi: 10.1109/saso.2016.8
language:
- iso: eng
publication: Proc. of the 10th International Conference on Self-Adaptive and Self-Organizing
Systems
publication_identifier:
isbn:
- '9781509035342'
publication_status: published
status: public
title: 'An Evolutionary Robotics Approach to the Control of Plant Growth and Motion:
Modeling Plants and Crossing the Reality Gap'
type: conference
user_id: '15415'
year: '2016'
...
---
_id: '19968'
author:
- first_name: Mary Katherine
full_name: Heinrich, Mary Katherine
last_name: Heinrich
- first_name: Mostafa
full_name: Wahby, Mostafa
last_name: Wahby
- first_name: Mohammad
full_name: Divband Soorati, Mohammad
last_name: Divband Soorati
- first_name: Daniel Nicolas
full_name: Hofstadler, Daniel Nicolas
last_name: Hofstadler
- first_name: Payam
full_name: Zahadat, Payam
last_name: Zahadat
- first_name: Phil
full_name: Ayres, Phil
last_name: Ayres
- first_name: Kasper
full_name: Stoy, Kasper
last_name: Stoy
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
citation:
ama: 'Heinrich MK, Wahby M, Divband Soorati M, et al. Self-Organized Construction
with Continuous Building Material: Higher Flexibility Based on Braided Structures.
In: Proc. of the 1st International Workshop on Self-Organising Construction
(SOCO). ; 2016. doi:10.1109/fas-w.2016.43'
apa: 'Heinrich, M. K., Wahby, M., Divband Soorati, M., Hofstadler, D. N., Zahadat,
P., Ayres, P., … Hamann, H. (2016). Self-Organized Construction with Continuous
Building Material: Higher Flexibility Based on Braided Structures. In Proc.
of the 1st International Workshop on Self-Organising Construction (SOCO).
https://doi.org/10.1109/fas-w.2016.43'
bibtex: '@inproceedings{Heinrich_Wahby_Divband Soorati_Hofstadler_Zahadat_Ayres_Stoy_Hamann_2016,
title={Self-Organized Construction with Continuous Building Material: Higher Flexibility
Based on Braided Structures}, DOI={10.1109/fas-w.2016.43},
booktitle={Proc. of the 1st International Workshop on Self-Organising Construction
(SOCO)}, author={Heinrich, Mary Katherine and Wahby, Mostafa and Divband Soorati,
Mohammad and Hofstadler, Daniel Nicolas and Zahadat, Payam and Ayres, Phil and
Stoy, Kasper and Hamann, Heiko}, year={2016} }'
chicago: 'Heinrich, Mary Katherine, Mostafa Wahby, Mohammad Divband Soorati, Daniel
Nicolas Hofstadler, Payam Zahadat, Phil Ayres, Kasper Stoy, and Heiko Hamann.
“Self-Organized Construction with Continuous Building Material: Higher Flexibility
Based on Braided Structures.” In Proc. of the 1st International Workshop on
Self-Organising Construction (SOCO), 2016. https://doi.org/10.1109/fas-w.2016.43.'
ieee: 'M. K. Heinrich et al., “Self-Organized Construction with Continuous
Building Material: Higher Flexibility Based on Braided Structures,” in Proc.
of the 1st International Workshop on Self-Organising Construction (SOCO),
2016.'
mla: 'Heinrich, Mary Katherine, et al. “Self-Organized Construction with Continuous
Building Material: Higher Flexibility Based on Braided Structures.” Proc. of
the 1st International Workshop on Self-Organising Construction (SOCO), 2016,
doi:10.1109/fas-w.2016.43.'
short: 'M.K. Heinrich, M. Wahby, M. Divband Soorati, D.N. Hofstadler, P. Zahadat,
P. Ayres, K. Stoy, H. Hamann, in: Proc. of the 1st International Workshop on Self-Organising
Construction (SOCO), 2016.'
date_created: 2020-10-09T13:57:21Z
date_updated: 2022-01-06T06:54:17Z
department:
- _id: '63'
- _id: '238'
doi: 10.1109/fas-w.2016.43
language:
- iso: eng
publication: Proc. of the 1st International Workshop on Self-Organising Construction
(SOCO)
publication_identifier:
isbn:
- '9781509036516'
publication_status: published
status: public
title: 'Self-Organized Construction with Continuous Building Material: Higher Flexibility
Based on Braided Structures'
type: conference
user_id: '15415'
year: '2016'
...