---
_id: '2273'
author:
- first_name: Laura
full_name: Moselage, Laura
last_name: Moselage
citation:
ama: Moselage L. Das Reputationssystem als bedeutendes Instrument digitaler Märkte.
Universität Paderborn; 2017.
apa: Moselage, L. (2017). Das Reputationssystem als bedeutendes Instrument digitaler
Märkte. Universität Paderborn.
bibtex: '@book{Moselage_2017, title={Das Reputationssystem als bedeutendes Instrument
digitaler Märkte}, publisher={Universität Paderborn}, author={Moselage, Laura},
year={2017} }'
chicago: Moselage, Laura. Das Reputationssystem als bedeutendes Instrument digitaler
Märkte. Universität Paderborn, 2017.
ieee: L. Moselage, Das Reputationssystem als bedeutendes Instrument digitaler
Märkte. Universität Paderborn, 2017.
mla: Moselage, Laura. Das Reputationssystem als bedeutendes Instrument digitaler
Märkte. Universität Paderborn, 2017.
short: L. Moselage, Das Reputationssystem als bedeutendes Instrument digitaler Märkte,
Universität Paderborn, 2017.
date_created: 2018-04-10T10:01:16Z
date_updated: 2022-01-06T06:55:39Z
department:
- _id: '19'
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '8'
name: SFB 901 - Subproject A4
publisher: Universität Paderborn
status: public
title: Das Reputationssystem als bedeutendes Instrument digitaler Märkte
type: bachelorsthesis
user_id: '477'
year: '2017'
...
---
_id: '2274'
author:
- first_name: Mohammad Ziad
full_name: Hennawi, Mohammad Ziad
last_name: Hennawi
citation:
ama: Hennawi MZ. Der Preis als Qualitätssignal. Universität Paderborn; 2017.
apa: Hennawi, M. Z. (2017). Der Preis als Qualitätssignal. Universität Paderborn.
bibtex: '@book{Hennawi_2017, title={Der Preis als Qualitätssignal}, publisher={Universität
Paderborn}, author={Hennawi, Mohammad Ziad}, year={2017} }'
chicago: Hennawi, Mohammad Ziad. Der Preis als Qualitätssignal. Universität
Paderborn, 2017.
ieee: M. Z. Hennawi, Der Preis als Qualitätssignal. Universität Paderborn,
2017.
mla: Hennawi, Mohammad Ziad. Der Preis als Qualitätssignal. Universität Paderborn,
2017.
short: M.Z. Hennawi, Der Preis als Qualitätssignal, Universität Paderborn, 2017.
date_created: 2018-04-10T10:52:19Z
date_updated: 2022-01-06T06:55:39Z
department:
- _id: '19'
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '8'
name: SFB 901 - Subproject A4
publisher: Universität Paderborn
status: public
title: Der Preis als Qualitätssignal
type: bachelorsthesis
user_id: '477'
year: '2017'
...
---
_id: '90'
abstract:
- lang: eng
text: We propose and extend an approach for the verification of safety properties
for parameterized timed systems modeled as networks of timed automata. For this
task, we introduce an incremental workflow that is based on our algorithm IC3
with Zones. It proceeds in a cycle in which single models of the system are verified,
and the verification results are employed for the reasoning about the entire system.
Starting with the smallest instances, the verification of the safety property
is carried out fast and efficient. On successful verification, the algorithm produces
an inductive strengthening of the safety property. We reuse this result and try
to reason about the entire parameterized timed system. To this end, we extrapolate
the inductive strengthening into a candidate for the next-larger model. In case
this candidate is a valid inductive strengthening for the next larger model, our
main theorem reasons about all models of the parameterized timed system, stating
that the safety property holds true for all models. Otherwise, the main cycle
starts over with the verification of the next larger model. This workflow is iterated
indefinitely, until able to reason about the entire parameterized timed system,
until a counterexample trace is found, or until the single models become too large
to be handled in the verification. We reuse the intermediate results in a Feedback-loop
in order to accelerate the verification runs for the single models. Furthermore,
we consider an extended formalism in comparison to our previous publications.
author:
- first_name: Tobias
full_name: Isenberg, Tobias
last_name: Isenberg
citation:
ama: Isenberg T. Incremental Inductive Verification of Parameterized Timed Systems.
ACM Transactions on Embedded Computing Systems. 2017;(2):47:1-47:24. doi:10.1145/2984640
apa: Isenberg, T. (2017). Incremental Inductive Verification of Parameterized Timed
Systems. ACM Transactions on Embedded Computing Systems, (2), 47:1-47:24.
https://doi.org/10.1145/2984640
bibtex: '@article{Isenberg_2017, title={Incremental Inductive Verification of Parameterized
Timed Systems}, DOI={10.1145/2984640},
number={2}, journal={ACM Transactions on Embedded Computing Systems}, publisher={ACM},
author={Isenberg, Tobias}, year={2017}, pages={47:1-47:24} }'
chicago: 'Isenberg, Tobias. “Incremental Inductive Verification of Parameterized
Timed Systems.” ACM Transactions on Embedded Computing Systems, no. 2 (2017):
47:1-47:24. https://doi.org/10.1145/2984640.'
ieee: T. Isenberg, “Incremental Inductive Verification of Parameterized Timed Systems,”
ACM Transactions on Embedded Computing Systems, no. 2, pp. 47:1-47:24,
2017.
mla: Isenberg, Tobias. “Incremental Inductive Verification of Parameterized Timed
Systems.” ACM Transactions on Embedded Computing Systems, no. 2, ACM, 2017,
pp. 47:1-47:24, doi:10.1145/2984640.
short: T. Isenberg, ACM Transactions on Embedded Computing Systems (2017) 47:1-47:24.
date_created: 2017-10-17T12:41:09Z
date_updated: 2022-01-06T07:04:06Z
ddc:
- '040'
department:
- _id: '77'
doi: 10.1145/2984640
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T13:13:04Z
date_updated: 2018-03-21T13:13:04Z
file_id: '1572'
file_name: 90-a47-isenberg.pdf
file_size: 584870
relation: main_file
success: 1
file_date_updated: 2018-03-21T13:13:04Z
has_accepted_license: '1'
issue: '2'
language:
- iso: eng
page: 47:1-47:24
project:
- _id: '1'
name: SFB 901
- _id: '12'
name: SFB 901 - Subprojekt B4
- _id: '3'
name: SFB 901 - Project Area B
publication: ACM Transactions on Embedded Computing Systems
publisher: ACM
status: public
title: Incremental Inductive Verification of Parameterized Timed Systems
type: journal_article
user_id: '477'
year: '2017'
...
---
_id: '91'
abstract:
- lang: eng
text: The interest in business model innovation has risen rapidly in recent years,
and software tools for business model development hold great promise for supporting
business model innovation. Nonetheless, virtually no design-relevant knowledge
exists concerning the functions that such tools should possess. Therefore, we
develop a comprehensive taxonomy that identifies characteristic functions of software-based
business model development tools. For developing the taxonomy, we draw on prior
research on business model innovation, process modeling, and creativity support
systems, and we analyze software tools for business model development that have
been proposed in practice. The resulting taxonomy can support practitioners in
their tool (re-)design and investment decisions, and for researchers can serve
as a preliminary step towards more advanced theories for software tools for business
model development.
author:
- first_name: Daniel
full_name: Szopinski, Daniel
id: '36372'
last_name: Szopinski
- first_name: Thorsten
full_name: Schoormann, Thorsten
last_name: Schoormann
- first_name: Thomas
full_name: John, Thomas
id: '3952'
last_name: John
- first_name: Ralf
full_name: Knackstedt, Ralf
last_name: Knackstedt
- first_name: Dennis
full_name: Kundisch, Dennis
id: '21117'
last_name: Kundisch
citation:
ama: 'Szopinski D, Schoormann T, John T, Knackstedt R, Kundisch D. How Software
Can Support Innovating Business Models: A Taxonomy of Functions of Business Model
Development Tools. In: Proceedings of the 23rd Americas Conference on Information
Systems (AMCIS). ; 2017.'
apa: 'Szopinski, D., Schoormann, T., John, T., Knackstedt, R., & Kundisch, D.
(2017). How Software Can Support Innovating Business Models: A Taxonomy of Functions
of Business Model Development Tools. In Proceedings of the 23rd Americas Conference
on Information Systems (AMCIS). Boston, USA.'
bibtex: '@inproceedings{Szopinski_Schoormann_John_Knackstedt_Kundisch_2017, title={How
Software Can Support Innovating Business Models: A Taxonomy of Functions of Business
Model Development Tools}, booktitle={Proceedings of the 23rd Americas Conference
on Information Systems (AMCIS)}, author={Szopinski, Daniel and Schoormann, Thorsten
and John, Thomas and Knackstedt, Ralf and Kundisch, Dennis}, year={2017} }'
chicago: 'Szopinski, Daniel, Thorsten Schoormann, Thomas John, Ralf Knackstedt,
and Dennis Kundisch. “How Software Can Support Innovating Business Models: A Taxonomy
of Functions of Business Model Development Tools.” In Proceedings of the 23rd
Americas Conference on Information Systems (AMCIS), 2017.'
ieee: 'D. Szopinski, T. Schoormann, T. John, R. Knackstedt, and D. Kundisch, “How
Software Can Support Innovating Business Models: A Taxonomy of Functions of Business
Model Development Tools,” in Proceedings of the 23rd Americas Conference on
Information Systems (AMCIS), Boston, USA, 2017.'
mla: 'Szopinski, Daniel, et al. “How Software Can Support Innovating Business Models:
A Taxonomy of Functions of Business Model Development Tools.” Proceedings of
the 23rd Americas Conference on Information Systems (AMCIS), 2017.'
short: 'D. Szopinski, T. Schoormann, T. John, R. Knackstedt, D. Kundisch, in: Proceedings
of the 23rd Americas Conference on Information Systems (AMCIS), 2017.'
conference:
location: Boston, USA
name: 23rd Americas Conference on Information Systems (AMCIS)
date_created: 2017-10-17T12:41:09Z
date_updated: 2022-01-06T07:04:08Z
ddc:
- '040'
department:
- _id: '276'
file:
- access_level: closed
content_type: application/pdf
creator: dsz
date_created: 2018-11-12T13:22:49Z
date_updated: 2018-11-12T13:22:49Z
file_id: '5503'
file_name: AMCIS2017_BMDT.pdf
file_size: 912449
relation: main_file
success: 1
file_date_updated: 2018-11-12T13:22:49Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '17'
name: SFB 901 - Subprojekt C5
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the 23rd Americas Conference on Information Systems (AMCIS)
status: public
title: 'How Software Can Support Innovating Business Models: A Taxonomy of Functions
of Business Model Development Tools'
type: conference
user_id: '16205'
year: '2017'
...
---
_id: '92'
author:
- first_name: Daniel
full_name: Szopinski, Daniel
id: '36372'
last_name: Szopinski
- first_name: Thorsten
full_name: Schoormann, Thorsten
last_name: Schoormann
- first_name: Thomas
full_name: John, Thomas
id: '3952'
last_name: John
- first_name: Ralf
full_name: Knackstedt, Ralf
last_name: Knackstedt
- first_name: Dennis
full_name: Kundisch, Dennis
id: '21117'
last_name: Kundisch
citation:
ama: 'Szopinski D, Schoormann T, John T, Knackstedt R, Kundisch D. How Software
Can Support Innovating Business Models: A Taxonomy of Functions of Business Model
Development Tools. In: Bosch Business Model Innovation Summit 2017. ; 2017.'
apa: 'Szopinski, D., Schoormann, T., John, T., Knackstedt, R., & Kundisch, D.
(2017). How Software Can Support Innovating Business Models: A Taxonomy of Functions
of Business Model Development Tools. In Bosch Business Model Innovation Summit
2017. Renningen, Germany.'
bibtex: '@inproceedings{Szopinski_Schoormann_John_Knackstedt_Kundisch_2017, title={How
Software Can Support Innovating Business Models: A Taxonomy of Functions of Business
Model Development Tools}, booktitle={Bosch Business Model Innovation Summit 2017},
author={Szopinski, Daniel and Schoormann, Thorsten and John, Thomas and Knackstedt,
Ralf and Kundisch, Dennis}, year={2017} }'
chicago: 'Szopinski, Daniel, Thorsten Schoormann, Thomas John, Ralf Knackstedt,
and Dennis Kundisch. “How Software Can Support Innovating Business Models: A Taxonomy
of Functions of Business Model Development Tools.” In Bosch Business Model
Innovation Summit 2017, 2017.'
ieee: 'D. Szopinski, T. Schoormann, T. John, R. Knackstedt, and D. Kundisch, “How
Software Can Support Innovating Business Models: A Taxonomy of Functions of Business
Model Development Tools,” in Bosch Business Model Innovation Summit 2017,
Renningen, Germany, 2017.'
mla: 'Szopinski, Daniel, et al. “How Software Can Support Innovating Business Models:
A Taxonomy of Functions of Business Model Development Tools.” Bosch Business
Model Innovation Summit 2017, 2017.'
short: 'D. Szopinski, T. Schoormann, T. John, R. Knackstedt, D. Kundisch, in: Bosch
Business Model Innovation Summit 2017, 2017.'
conference:
location: Renningen, Germany
name: Bosch Business Model Innovation Summit 2017
date_created: 2017-10-17T12:41:09Z
date_updated: 2022-01-06T07:04:09Z
ddc:
- '040'
department:
- _id: '276'
file:
- access_level: closed
content_type: application/pdf
creator: dsz
date_created: 2018-11-29T15:02:15Z
date_updated: 2018-11-29T15:02:15Z
file_id: '5981'
file_name: Bosch BMI Summit 2017.pdf
file_size: 1359194
relation: main_file
success: 1
file_date_updated: 2018-11-29T15:02:15Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '17'
name: SFB 901 - Subprojekt C5
- _id: '4'
name: SFB 901 - Project Area C
publication: Bosch Business Model Innovation Summit 2017
status: public
title: 'How Software Can Support Innovating Business Models: A Taxonomy of Functions
of Business Model Development Tools'
type: conference_abstract
user_id: '477'
year: '2017'
...
---
_id: '93'
abstract:
- lang: eng
text: "In recent years, there has been a proliferation of technological developments
that incorporate processing of human language. Hardware and software can be specialized
for designated subject areas, and computational devices are designed for a widening
variety of applications. At the same time, new areas and applications are emerging
by demanding intelligent technology enhanced by the processing of human language.
These new applications often perform tasks which handle information, and they
have a capacity to reason, using both formal and human language. Many sub-areas
of Artificial Intelligence demand integration of Natural Language Processing,
at least to some degree. Furthermore, technologies require coverage of known as
well as unknown agents, and tasks with potential variations. All of this takes
place in environments with unknown factors.\r\nThe book covers theoretical work,
advanced applications, approaches, and techniques for computational models of
information, reasoning systems, and presentation in language. The book promotes
work on intelligent natural language processing and related models of information,
thought, reasoning, and other cognitive processes. The topics covered by the chapters
prompt further research and developments of advanced systems in the areas of logic,
computability, computational linguistics, cognitive science, neuroscience of language,
robotics, and artificial intelligence, among others."
author:
- first_name: Michaela
full_name: Geierhos, Michaela
id: '42496'
last_name: Geierhos
orcid: 0000-0002-8180-5606
- first_name: Frederik Simon
full_name: Bäumer, Frederik Simon
id: '38837'
last_name: Bäumer
citation:
ama: 'Geierhos M, Bäumer FS. Guesswork? Resolving Vagueness in User-Generated Software
Requirements. In: Christiansen H, Jiménez-López MD, Loukanova R, Moss LS, eds.
Partiality and Underspecification in Information, Languages, and Knowledge.
1st ed. Newcastle upon Tyne, UK: Cambridge Scholars Publishing; 2017:65-108.'
apa: 'Geierhos, M., & Bäumer, F. S. (2017). Guesswork? Resolving Vagueness in
User-Generated Software Requirements. In H. Christiansen, M. D. Jiménez-López,
R. Loukanova, & L. S. Moss (Eds.), Partiality and Underspecification in
Information, Languages, and Knowledge (1st ed., pp. 65–108). Newcastle upon
Tyne, UK: Cambridge Scholars Publishing.'
bibtex: '@inbook{Geierhos_Bäumer_2017, place={Newcastle upon Tyne, UK}, edition={1},
title={Guesswork? Resolving Vagueness in User-Generated Software Requirements},
booktitle={Partiality and Underspecification in Information, Languages, and Knowledge},
publisher={Cambridge Scholars Publishing}, author={Geierhos, Michaela and Bäumer,
Frederik Simon}, editor={Christiansen, Henning and Jiménez-López, M. Dolores
and Loukanova, Roussanka and Moss, Lawrence S.Editors}, year={2017}, pages={65–108}
}'
chicago: 'Geierhos, Michaela, and Frederik Simon Bäumer. “Guesswork? Resolving Vagueness
in User-Generated Software Requirements.” In Partiality and Underspecification
in Information, Languages, and Knowledge, edited by Henning Christiansen,
M. Dolores Jiménez-López, Roussanka Loukanova, and Lawrence S. Moss, 1st ed.,
65–108. Newcastle upon Tyne, UK: Cambridge Scholars Publishing, 2017.'
ieee: 'M. Geierhos and F. S. Bäumer, “Guesswork? Resolving Vagueness in User-Generated
Software Requirements,” in Partiality and Underspecification in Information,
Languages, and Knowledge, 1st ed., H. Christiansen, M. D. Jiménez-López, R.
Loukanova, and L. S. Moss, Eds. Newcastle upon Tyne, UK: Cambridge Scholars Publishing,
2017, pp. 65–108.'
mla: Geierhos, Michaela, and Frederik Simon Bäumer. “Guesswork? Resolving Vagueness
in User-Generated Software Requirements.” Partiality and Underspecification
in Information, Languages, and Knowledge, edited by Henning Christiansen
et al., 1st ed., Cambridge Scholars Publishing, 2017, pp. 65–108.
short: 'M. Geierhos, F.S. Bäumer, in: H. Christiansen, M.D. Jiménez-López, R. Loukanova,
L.S. Moss (Eds.), Partiality and Underspecification in Information, Languages,
and Knowledge, 1st ed., Cambridge Scholars Publishing, Newcastle upon Tyne, UK,
2017, pp. 65–108.'
date_created: 2017-10-17T12:41:09Z
date_updated: 2022-01-06T07:04:13Z
ddc:
- '004'
department:
- _id: '36'
- _id: '1'
- _id: '579'
edition: '1'
editor:
- first_name: 'Henning '
full_name: 'Christiansen, Henning '
last_name: Christiansen
- first_name: M. Dolores
full_name: Jiménez-López, M. Dolores
last_name: Jiménez-López
- first_name: 'Roussanka '
full_name: 'Loukanova, Roussanka '
last_name: Loukanova
- first_name: Lawrence S.
full_name: Moss, Lawrence S.
last_name: Moss
file:
- access_level: closed
content_type: application/pdf
creator: fbaeumer
date_created: 2019-01-11T11:43:23Z
date_updated: 2019-01-11T11:43:23Z
file_id: '6625'
file_name: CSP_Chapter_GeierhosBaeumer.pdf
file_size: 2888473
relation: main_file
success: 1
file_date_updated: 2019-01-11T11:43:23Z
has_accepted_license: '1'
language:
- iso: eng
page: 65-108
place: Newcastle upon Tyne, UK
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '9'
name: SFB 901 - Subproject B1
publication: Partiality and Underspecification in Information, Languages, and Knowledge
publication_identifier:
isbn:
- 978-1- 4438-7947-7
publication_status: published
publisher: Cambridge Scholars Publishing
quality_controlled: '1'
status: public
title: Guesswork? Resolving Vagueness in User-Generated Software Requirements
type: book_chapter
user_id: '38837'
year: '2017'
...
---
_id: '94'
author:
- first_name: Martin
full_name: Martens, Martin
last_name: Martens
citation:
ama: Martens M. Geschäftsmodelle elektronischer Handelsplattformen. Universität
Paderborn; 2017.
apa: Martens, M. (2017). Geschäftsmodelle elektronischer Handelsplattformen.
Universität Paderborn.
bibtex: '@book{Martens_2017, title={Geschäftsmodelle elektronischer Handelsplattformen},
publisher={Universität Paderborn}, author={Martens, Martin}, year={2017} }'
chicago: Martens, Martin. Geschäftsmodelle elektronischer Handelsplattformen.
Universität Paderborn, 2017.
ieee: M. Martens, Geschäftsmodelle elektronischer Handelsplattformen. Universität
Paderborn, 2017.
mla: Martens, Martin. Geschäftsmodelle elektronischer Handelsplattformen.
Universität Paderborn, 2017.
short: M. Martens, Geschäftsmodelle elektronischer Handelsplattformen, Universität
Paderborn, 2017.
date_created: 2017-10-17T12:41:09Z
date_updated: 2022-01-06T07:04:14Z
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '17'
name: SFB 901 - Subprojekt C5
- _id: '4'
name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
title: Geschäftsmodelle elektronischer Handelsplattformen
type: bachelorsthesis
user_id: '16205'
year: '2017'
...
---
_id: '95'
author:
- first_name: Dennis
full_name: Kundisch, Dennis
id: '21117'
last_name: Kundisch
- first_name: Thomas
full_name: John, Thomas
id: '3952'
last_name: John
citation:
ama: 'Kundisch D, John T. Geschäftsmodell-Modellierungssprache/Business Model Modeling
Language. In: Enzyklopädie der Wirtschaftsinformatik, GITO. ; 2017.'
apa: Kundisch, D., & John, T. (2017). Geschäftsmodell-Modellierungssprache/Business
Model Modeling Language. In Enzyklopädie der Wirtschaftsinformatik, GITO.
bibtex: '@inbook{Kundisch_John_2017, title={Geschäftsmodell-Modellierungssprache/Business
Model Modeling Language}, booktitle={Enzyklopädie der Wirtschaftsinformatik, GITO},
author={Kundisch, Dennis and John, Thomas}, year={2017} }'
chicago: Kundisch, Dennis, and Thomas John. “Geschäftsmodell-Modellierungssprache/Business
Model Modeling Language.” In Enzyklopädie der Wirtschaftsinformatik, GITO,
2017.
ieee: D. Kundisch and T. John, “Geschäftsmodell-Modellierungssprache/Business Model
Modeling Language,” in Enzyklopädie der Wirtschaftsinformatik, GITO, 2017.
mla: Kundisch, Dennis, and Thomas John. “Geschäftsmodell-Modellierungssprache/Business
Model Modeling Language.” Enzyklopädie der Wirtschaftsinformatik, GITO,
2017.
short: 'D. Kundisch, T. John, in: Enzyklopädie der Wirtschaftsinformatik, GITO,
2017.'
date_created: 2017-10-17T12:41:10Z
date_updated: 2022-01-06T07:04:16Z
ddc:
- '040'
department:
- _id: '276'
file:
- access_level: closed
content_type: application/pdf
creator: abursig
date_created: 2018-12-03T15:24:40Z
date_updated: 2018-12-03T15:24:40Z
file_id: '5990'
file_name: EDW_BMML.PDF
file_size: 456551
relation: main_file
success: 1
file_date_updated: 2018-12-03T15:24:40Z
has_accepted_license: '1'
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '17'
name: SFB 901 - Subproject C5
- _id: '4'
name: SFB 901 - Project Area C
publication: Enzyklopädie der Wirtschaftsinformatik, GITO
related_material:
link:
- relation: confirmation
url: http://www.enzyklopaedie-der-wirtschaftsinformatik.de/lexikon/is-management/Systementwicklung/Hauptaktivitaten-der-Systementwicklung/Problemanalyse-/geschaeftsmodellmodellierungssprache-business-model-modeling-language
status: public
title: Geschäftsmodell-Modellierungssprache/Business Model Modeling Language
type: encyclopedia_article
user_id: '477'
year: '2017'
...
---
_id: '77'
abstract:
- lang: eng
text: Das Enterprise Architecture Management stellt umfangreiche Methoden, Modelle
und Frameworks f{\"u}r die Modellierung von Unternehmensarchitekturen zur Verf{\"u}gung.
Die Entwicklung von Software und deren Integration in IT-Landschaften ist heutzutage
zunehmend von Komplexit{\"a}t und Unsicherheit gepr{\"a}gt. Dieser Beitrag (Research-in-progress)
m{\"o}chte ein neues Paradigma – das „On-The-Fly Computing“ – vorschlagen, um
diesen Herausforderungen zu begegnen, m{\"o}gliche L{\"o}sungsans{\"a}tze zu diskutieren
sowie erste Ergebnisse eines Referenzmodells f{\"u}r individualisierte IT-Dienstleistungen
in dynamischen Software-M{\"a}rkten dokumentieren.
author:
- first_name: Daniel
full_name: Szopinski, Daniel
id: '36372'
last_name: Szopinski
- first_name: Bahar
full_name: Jazayeri, Bahar
id: '36399'
last_name: Jazayeri
- first_name: Gregor
full_name: Engels, Gregor
id: '107'
last_name: Engels
- first_name: Dennis
full_name: Kundisch, Dennis
id: '21117'
last_name: Kundisch
citation:
ama: 'Szopinski D, Jazayeri B, Engels G, Kundisch D. On-The-Fly Computing: Ein Referenzmodell
für individualisierte IT-Dienstleistungen in dynamischen Märkten. In: Proceedings
of the Workshop Enterprise Architecture Management in Forschung Und Praxis, INFORMATIK
2017, Chemnitz, Germany. Lecture Notes in Informatics (LNI). GI; 2017:2059-2066.'
apa: 'Szopinski, D., Jazayeri, B., Engels, G., & Kundisch, D. (2017). On-The-Fly
Computing: Ein Referenzmodell für individualisierte IT-Dienstleistungen in dynamischen
Märkten. In Proceedings of the Workshop Enterprise Architecture Management
in Forschung und Praxis, INFORMATIK 2017, Chemnitz, Germany (pp. 2059–2066).
GI.'
bibtex: '@inproceedings{Szopinski_Jazayeri_Engels_Kundisch_2017, series={Lecture
Notes in Informatics (LNI)}, title={On-The-Fly Computing: Ein Referenzmodell für
individualisierte IT-Dienstleistungen in dynamischen Märkten}, booktitle={Proceedings
of the Workshop Enterprise Architecture Management in Forschung und Praxis, INFORMATIK
2017, Chemnitz, Germany}, publisher={GI}, author={Szopinski, Daniel and Jazayeri,
Bahar and Engels, Gregor and Kundisch, Dennis}, year={2017}, pages={2059–2066},
collection={Lecture Notes in Informatics (LNI)} }'
chicago: 'Szopinski, Daniel, Bahar Jazayeri, Gregor Engels, and Dennis Kundisch.
“On-The-Fly Computing: Ein Referenzmodell Für Individualisierte IT-Dienstleistungen
in Dynamischen Märkten.” In Proceedings of the Workshop Enterprise Architecture
Management in Forschung Und Praxis, INFORMATIK 2017, Chemnitz, Germany, 2059–66.
Lecture Notes in Informatics (LNI). GI, 2017.'
ieee: 'D. Szopinski, B. Jazayeri, G. Engels, and D. Kundisch, “On-The-Fly Computing:
Ein Referenzmodell für individualisierte IT-Dienstleistungen in dynamischen Märkten,”
in Proceedings of the Workshop Enterprise Architecture Management in Forschung
und Praxis, INFORMATIK 2017, Chemnitz, Germany, 2017, pp. 2059–2066.'
mla: 'Szopinski, Daniel, et al. “On-The-Fly Computing: Ein Referenzmodell Für Individualisierte
IT-Dienstleistungen in Dynamischen Märkten.” Proceedings of the Workshop Enterprise
Architecture Management in Forschung Und Praxis, INFORMATIK 2017, Chemnitz, Germany,
GI, 2017, pp. 2059–66.'
short: 'D. Szopinski, B. Jazayeri, G. Engels, D. Kundisch, in: Proceedings of the
Workshop Enterprise Architecture Management in Forschung Und Praxis, INFORMATIK
2017, Chemnitz, Germany, GI, 2017, pp. 2059–2066.'
date_created: 2017-10-17T12:41:06Z
date_updated: 2022-01-06T07:03:44Z
ddc:
- '040'
department:
- _id: '276'
file:
- access_level: closed
content_type: application/pdf
creator: dsz
date_created: 2018-11-12T13:22:12Z
date_updated: 2018-11-12T13:22:12Z
file_id: '5502'
file_name: INFORMATIK2017_OTF.pdf
file_size: 251032
relation: main_file
success: 1
file_date_updated: 2018-11-12T13:22:12Z
has_accepted_license: '1'
language:
- iso: eng
page: 2059-2066
project:
- _id: '1'
name: SFB 901
- _id: '17'
name: SFB 901 - Subprojekt C5
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the Workshop Enterprise Architecture Management in Forschung
und Praxis, INFORMATIK 2017, Chemnitz, Germany
publication_status: published
publisher: GI
series_title: Lecture Notes in Informatics (LNI)
status: public
title: 'On-The-Fly Computing: Ein Referenzmodell für individualisierte IT-Dienstleistungen
in dynamischen Märkten'
type: conference
user_id: '16205'
year: '2017'
...
---
_id: '78'
abstract:
- lang: eng
text: The Internet of Things (IoT) connects the things of our everyday life and
supports usin our common activities.Several markets for IoT services have been
created. These markets enable IoT users to search and compose services in order
to support an IoT activity.However, existing IoT markets like IFTTT (If This Then
That) are not convenient for users with respect to service discovery and composition.The
objective of On-the-fly (OTF) computing is to configure and provide software markets
that fulfill individual users' wishes by the automatic on-the-fly composition
of single services.The architecture framework of On-the-fly computing markets
helps architects to systematically develop these systems in different domains.In
this paper, we use our OTF architectural framework to examine the requirements
of a reference architecture for IoT markets.Furthermore, we perform a comparison
between the architecture of IFTTT as an existing IoT market with this reference
architecture. The results show how existing IoT markets can be improved. In return,
the practical knowledge of IFTTT is taken to the reference architecture.This knowledge
helps to overcome the limitations of today's IoT markets or creating new markets
in the future.
author:
- first_name: Bahar
full_name: Jazayeri, Bahar
id: '36399'
last_name: Jazayeri
- first_name: Simon
full_name: Schwichtenberg, Simon
id: '13235'
last_name: Schwichtenberg
citation:
ama: 'Jazayeri B, Schwichtenberg S. On-The-Fly Computing Meets IoT Markets - Towards
a Reference Architecture. In: Proceedings of the International Conference on
Software Architecture (ICSA) IoT-ASAP Workshop. Gothenburg, Sweden: IEEE;
2017:120--127. doi:10.1109/ICSAW.2017.59'
apa: 'Jazayeri, B., & Schwichtenberg, S. (2017). On-The-Fly Computing Meets
IoT Markets - Towards a Reference Architecture. In Proceedings of the International
Conference on Software Architecture (ICSA) IoT-ASAP Workshop (pp. 120--127).
Gothenburg, Sweden: IEEE. https://doi.org/10.1109/ICSAW.2017.59'
bibtex: '@inproceedings{Jazayeri_Schwichtenberg_2017, place={Gothenburg, Sweden},
title={On-The-Fly Computing Meets IoT Markets - Towards a Reference Architecture},
DOI={10.1109/ICSAW.2017.59},
booktitle={Proceedings of the International Conference on Software Architecture
(ICSA) IoT-ASAP Workshop}, publisher={IEEE}, author={Jazayeri, Bahar and Schwichtenberg,
Simon}, year={2017}, pages={120--127} }'
chicago: 'Jazayeri, Bahar, and Simon Schwichtenberg. “On-The-Fly Computing Meets
IoT Markets - Towards a Reference Architecture.” In Proceedings of the International
Conference on Software Architecture (ICSA) IoT-ASAP Workshop, 120--127. Gothenburg,
Sweden: IEEE, 2017. https://doi.org/10.1109/ICSAW.2017.59.'
ieee: B. Jazayeri and S. Schwichtenberg, “On-The-Fly Computing Meets IoT Markets
- Towards a Reference Architecture,” in Proceedings of the International Conference
on Software Architecture (ICSA) IoT-ASAP Workshop, 2017, pp. 120--127.
mla: Jazayeri, Bahar, and Simon Schwichtenberg. “On-The-Fly Computing Meets IoT
Markets - Towards a Reference Architecture.” Proceedings of the International
Conference on Software Architecture (ICSA) IoT-ASAP Workshop, IEEE, 2017,
pp. 120--127, doi:10.1109/ICSAW.2017.59.
short: 'B. Jazayeri, S. Schwichtenberg, in: Proceedings of the International Conference
on Software Architecture (ICSA) IoT-ASAP Workshop, IEEE, Gothenburg, Sweden, 2017,
pp. 120--127.'
date_created: 2017-10-17T12:41:06Z
date_updated: 2022-01-06T07:03:46Z
ddc:
- '000'
department:
- _id: '66'
doi: 10.1109/ICSAW.2017.59
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T14:49:05Z
date_updated: 2018-11-02T14:49:05Z
file_id: '5284'
file_name: 07958467.pdf
file_size: 624689
relation: main_file
success: 1
file_date_updated: 2018-11-02T14:49:05Z
has_accepted_license: '1'
language:
- iso: eng
page: 120--127
place: Gothenburg, Sweden
project:
- _id: '1'
name: SFB 901
- _id: '17'
name: SFB 901 - Subprojekt C5
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the International Conference on Software Architecture
(ICSA) IoT-ASAP Workshop
publisher: IEEE
status: public
title: On-The-Fly Computing Meets IoT Markets - Towards a Reference Architecture
type: conference
user_id: '36399'
year: '2017'
...
---
_id: '79'
abstract:
- lang: eng
text: Consider a problem in which $n$ jobs that are classified into $k$ types arrive
over time at their release times and are to be scheduled on a single machine so
as to minimize the maximum flow time.The machine requires a setup taking $s$ time
units whenever it switches from processing jobs of one type to jobs of a different
type.We consider the problem as an online problem where each job is only known
to the scheduler as soon as it arrives and where the processing time of a job
only becomes known upon its completion (non-clairvoyance).We are interested in
the potential of simple ``greedy-like'' algorithms.We analyze a modification of
the FIFO strategy and show its competitiveness to be $\Theta(\sqrt{n})$, which
is optimal for the considered class of algorithms.For $k=2$ types it achieves
a constant competitiveness.Our main insight is obtained by an analysis of the
smoothed competitiveness.If processing times $p_j$ are independently perturbed
to $\hat p_j = (1+X_j)p_j$, we obtain a competitiveness of $O(\sigma^{-2} \log^2
n)$ when $X_j$ is drawn from a uniform or a (truncated) normal distribution with
standard deviation $\sigma$.The result proves that bad instances are fragile and
``practically'' one might expect a much better performance than given by the $\Omega(\sqrt{n})$-bound.
author:
- first_name: Alexander
full_name: Mäcker, Alexander
id: '13536'
last_name: Mäcker
- 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
- first_name: Sören
full_name: Riechers, Sören
last_name: Riechers
citation:
ama: 'Mäcker A, Malatyali M, Meyer auf der Heide F, Riechers S. Non-Clairvoyant
Scheduling to Minimize Max Flow Time on a Machine with Setup Times. In: Proceedings
of the 15th Workshop on Approximation and Online Algorithms (WAOA). Vol 10787.
Lecture Notes in Computer Science. Springer; 2017:207-222. doi:10.1007/978-3-319-89441-6'
apa: Mäcker, A., Malatyali, M., Meyer auf der Heide, F., & Riechers, S. (2017).
Non-Clairvoyant Scheduling to Minimize Max Flow Time on a Machine with Setup Times.
In Proceedings of the 15th Workshop on Approximation and Online Algorithms
(WAOA) (Vol. 10787, pp. 207–222). Springer. https://doi.org/10.1007/978-3-319-89441-6
bibtex: '@inproceedings{Mäcker_Malatyali_Meyer auf der Heide_Riechers_2017, series={Lecture
Notes in Computer Science}, title={Non-Clairvoyant Scheduling to Minimize Max
Flow Time on a Machine with Setup Times}, volume={10787}, DOI={10.1007/978-3-319-89441-6},
booktitle={Proceedings of the 15th Workshop on Approximation and Online Algorithms
(WAOA)}, publisher={Springer}, author={Mäcker, Alexander and Malatyali, Manuel
and Meyer auf der Heide, Friedhelm and Riechers, Sören}, year={2017}, pages={207–222},
collection={Lecture Notes in Computer Science} }'
chicago: Mäcker, Alexander, Manuel Malatyali, Friedhelm Meyer auf der Heide, and
Sören Riechers. “Non-Clairvoyant Scheduling to Minimize Max Flow Time on a Machine
with Setup Times.” In Proceedings of the 15th Workshop on Approximation and
Online Algorithms (WAOA), 10787:207–22. Lecture Notes in Computer Science.
Springer, 2017. https://doi.org/10.1007/978-3-319-89441-6.
ieee: A. Mäcker, M. Malatyali, F. Meyer auf der Heide, and S. Riechers, “Non-Clairvoyant
Scheduling to Minimize Max Flow Time on a Machine with Setup Times,” in Proceedings
of the 15th Workshop on Approximation and Online Algorithms (WAOA), 2017,
vol. 10787, pp. 207–222.
mla: Mäcker, Alexander, et al. “Non-Clairvoyant Scheduling to Minimize Max Flow
Time on a Machine with Setup Times.” Proceedings of the 15th Workshop on Approximation
and Online Algorithms (WAOA), vol. 10787, Springer, 2017, pp. 207–22, doi:10.1007/978-3-319-89441-6.
short: 'A. Mäcker, M. Malatyali, F. Meyer auf der Heide, S. Riechers, in: Proceedings
of the 15th Workshop on Approximation and Online Algorithms (WAOA), Springer,
2017, pp. 207–222.'
date_created: 2017-10-17T12:41:06Z
date_updated: 2022-01-06T07:03:47Z
ddc:
- '000'
department:
- _id: '63'
doi: 10.1007/978-3-319-89441-6
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T14:59:22Z
date_updated: 2018-11-02T14:59:22Z
file_id: '5289'
file_name: Non-clairvoyantSchedulingToMin.pdf
file_size: 380629
relation: main_file
success: 1
file_date_updated: 2018-11-02T14:59:22Z
has_accepted_license: '1'
intvolume: ' 10787'
language:
- iso: eng
page: 207-222
project:
- _id: '1'
name: SFB 901
- _id: '16'
name: SFB 901 - Subprojekt C4
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the 15th Workshop on Approximation and Online Algorithms
(WAOA)
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: Non-Clairvoyant Scheduling to Minimize Max Flow Time on a Machine with Setup
Times
type: conference
user_id: '477'
volume: 10787
year: '2017'
...
---
_id: '81'
author:
- first_name: Linghui
full_name: Luo, Linghui
last_name: Luo
citation:
ama: 'Luo L. MultiSkipList: A Self-Stabilizing Overlay Network with Monotonic
Searchability Maintained. Universität Paderborn; 2017.'
apa: 'Luo, L. (2017). MultiSkipList: A Self-stabilizing Overlay Network with
Monotonic Searchability maintained. Universität Paderborn.'
bibtex: '@book{Luo_2017, title={MultiSkipList: A Self-stabilizing Overlay Network
with Monotonic Searchability maintained}, publisher={Universität Paderborn}, author={Luo,
Linghui}, year={2017} }'
chicago: 'Luo, Linghui. MultiSkipList: A Self-Stabilizing Overlay Network with
Monotonic Searchability Maintained. Universität Paderborn, 2017.'
ieee: 'L. Luo, MultiSkipList: A Self-stabilizing Overlay Network with Monotonic
Searchability maintained. Universität Paderborn, 2017.'
mla: 'Luo, Linghui. MultiSkipList: A Self-Stabilizing Overlay Network with Monotonic
Searchability Maintained. Universität Paderborn, 2017.'
short: 'L. Luo, MultiSkipList: A Self-Stabilizing Overlay Network with Monotonic
Searchability Maintained, Universität Paderborn, 2017.'
date_created: 2017-10-17T12:41:07Z
date_updated: 2022-01-06T07:03:50Z
department:
- _id: '79'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: 'MultiSkipList: A Self-stabilizing Overlay Network with Monotonic Searchability
maintained'
type: mastersthesis
user_id: '477'
year: '2017'
...
---
_id: '82'
abstract:
- lang: eng
text: Many graph problems such as maximum cut, chromatic number, hamiltonian cycle,
and edge dominating set are known to be fixed-parameter tractable (FPT) when parameterized
by the treewidth of the input graphs, but become W-hard with respect to the clique-width
parameter. Recently, Gajarský et al. proposed a new parameter called modular-width
using the notion of modular decomposition of graphs. They showed that the chromatic
number problem and the partitioning into paths problem, and hence hamiltonian
path and hamiltonian cycle, are FPT when parameterized by this parameter. In this
paper, we study modular-width in parameterized parallel complexity and show that
the weighted maximum clique problem and the maximum matching problem are fixed-parameter
parallel-tractable (FPPT) when parameterized by this parameter.
author:
- first_name: Faisal N.
full_name: Abu-Khzam, Faisal N.
last_name: Abu-Khzam
- 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
- first_name: Pavel
full_name: Podlipyan, Pavel
last_name: Podlipyan
citation:
ama: 'Abu-Khzam FN, Li S, Markarian C, Meyer auf der Heide F, Podlipyan P. Modular-Width:
An Auxiliary Parameter for Parameterized Parallel Complexity. In: Proceedings
of the 11th International Workshop on Frontiers in Algorithmics (FAW). LNCS.
; 2017:139-150. doi:10.1007/978-3-319-59605-1_13'
apa: 'Abu-Khzam, F. N., Li, S., Markarian, C., Meyer auf der Heide, F., & Podlipyan,
P. (2017). Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity.
In Proceedings of the 11th International Workshop on Frontiers in Algorithmics
(FAW) (pp. 139–150). https://doi.org/10.1007/978-3-319-59605-1_13'
bibtex: '@inproceedings{Abu-Khzam_Li_Markarian_Meyer auf der Heide_Podlipyan_2017,
series={LNCS}, title={Modular-Width: An Auxiliary Parameter for Parameterized
Parallel Complexity}, DOI={10.1007/978-3-319-59605-1_13},
booktitle={Proceedings of the 11th International Workshop on Frontiers in Algorithmics
(FAW)}, author={Abu-Khzam, Faisal N. and Li, Shouwei and Markarian, Christine
and Meyer auf der Heide, Friedhelm and Podlipyan, Pavel}, year={2017}, pages={139–150},
collection={LNCS} }'
chicago: 'Abu-Khzam, Faisal N., Shouwei Li, Christine Markarian, Friedhelm Meyer
auf der Heide, and Pavel Podlipyan. “Modular-Width: An Auxiliary Parameter for
Parameterized Parallel Complexity.” In Proceedings of the 11th International
Workshop on Frontiers in Algorithmics (FAW), 139–50. LNCS, 2017. https://doi.org/10.1007/978-3-319-59605-1_13.'
ieee: 'F. N. Abu-Khzam, S. Li, C. Markarian, F. Meyer auf der Heide, and P. Podlipyan,
“Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity,”
in Proceedings of the 11th International Workshop on Frontiers in Algorithmics
(FAW), 2017, pp. 139–150.'
mla: 'Abu-Khzam, Faisal N., et al. “Modular-Width: An Auxiliary Parameter for Parameterized
Parallel Complexity.” Proceedings of the 11th International Workshop on Frontiers
in Algorithmics (FAW), 2017, pp. 139–50, doi:10.1007/978-3-319-59605-1_13.'
short: 'F.N. Abu-Khzam, S. Li, C. Markarian, F. Meyer auf der Heide, P. Podlipyan,
in: Proceedings of the 11th International Workshop on Frontiers in Algorithmics
(FAW), 2017, pp. 139–150.'
date_created: 2017-10-17T12:41:07Z
date_updated: 2022-01-06T07:03:52Z
ddc:
- '000'
department:
- _id: '63'
doi: 10.1007/978-3-319-59605-1_13
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T15:07:35Z
date_updated: 2018-11-02T15:07:35Z
file_id: '5294'
file_name: Modular-WidthAnAuxiliaryParame.pdf
file_size: 238276
relation: main_file
success: 1
file_date_updated: 2018-11-02T15:07:35Z
has_accepted_license: '1'
language:
- iso: eng
page: 139-150
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
publication: Proceedings of the 11th International Workshop on Frontiers in Algorithmics
(FAW)
series_title: LNCS
status: public
title: 'Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity'
type: conference
user_id: '477'
year: '2017'
...
---
_id: '83'
author:
- first_name: Dennis
full_name: Uden, Dennis
last_name: Uden
citation:
ama: Uden D. Microsoft vs. the EU Commission - An Analysis on Product Bundeling.
Universität Paderborn; 2017.
apa: Uden, D. (2017). Microsoft vs. the EU Commission - An analysis on product
bundeling. Universität Paderborn.
bibtex: '@book{Uden_2017, title={Microsoft vs. the EU Commission - An analysis on
product bundeling}, publisher={Universität Paderborn}, author={Uden, Dennis},
year={2017} }'
chicago: Uden, Dennis. Microsoft vs. the EU Commission - An Analysis on Product
Bundeling. Universität Paderborn, 2017.
ieee: D. Uden, Microsoft vs. the EU Commission - An analysis on product bundeling.
Universität Paderborn, 2017.
mla: Uden, Dennis. Microsoft vs. the EU Commission - An Analysis on Product Bundeling.
Universität Paderborn, 2017.
short: D. Uden, Microsoft vs. the EU Commission - An Analysis on Product Bundeling,
Universität Paderborn, 2017.
date_created: 2017-10-17T12:41:07Z
date_updated: 2022-01-06T07:03:53Z
department:
- _id: '280'
project:
- _id: '1'
name: SFB 901
- _id: '7'
name: SFB 901 - Subprojekt A3
- _id: '2'
name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Burkhard
full_name: Hehenkamp, Burkhard
id: '37339'
last_name: Hehenkamp
title: Microsoft vs. the EU Commission - An analysis on product bundeling
type: bachelorsthesis
user_id: '42447'
year: '2017'
...
---
_id: '5694'
author:
- first_name: Nino Noel
full_name: Schnitker, Nino Noel
last_name: Schnitker
citation:
ama: Schnitker NN. Genetischer Algorithmus zur Erstellung von Ensembles von Nested
Dichotomies. Universität Paderborn; 2017.
apa: Schnitker, N. N. (2017). Genetischer Algorithmus zur Erstellung von Ensembles
von Nested Dichotomies. Universität Paderborn.
bibtex: '@book{Schnitker_2017, title={Genetischer Algorithmus zur Erstellung von
Ensembles von Nested Dichotomies}, publisher={Universität Paderborn}, author={Schnitker,
Nino Noel}, year={2017} }'
chicago: Schnitker, Nino Noel. Genetischer Algorithmus zur Erstellung von Ensembles
von Nested Dichotomies. Universität Paderborn, 2017.
ieee: N. N. Schnitker, Genetischer Algorithmus zur Erstellung von Ensembles von
Nested Dichotomies. Universität Paderborn, 2017.
mla: Schnitker, Nino Noel. Genetischer Algorithmus zur Erstellung von Ensembles
von Nested Dichotomies. Universität Paderborn, 2017.
short: N.N. Schnitker, Genetischer Algorithmus zur Erstellung von Ensembles von
Nested Dichotomies, Universität Paderborn, 2017.
date_created: 2018-11-15T08:10:48Z
date_updated: 2022-01-06T07:02:35Z
department:
- _id: '355'
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '10'
name: SFB 901 - Subproject B2
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Eyke
full_name: Hüllermeier, Eyke
id: '48129'
last_name: Hüllermeier
title: Genetischer Algorithmus zur Erstellung von Ensembles von Nested Dichotomies
type: bachelorsthesis
user_id: '477'
year: '2017'
...
---
_id: '5695'
article_number: '2'
author:
- first_name: Bahar
full_name: Jazayeri, Bahar
id: '36399'
last_name: Jazayeri
- first_name: Simon
full_name: Schwichtenberg, Simon
id: '13235'
last_name: Schwichtenberg
citation:
ama: 'Jazayeri B, Schwichtenberg S. On the Necessity of an Architecture Framework
for On-The-Fly Computing. In: Proceedings of Softwaretechnik-Trends Workshops.
Vol 37. Bad Honnef, Germany: Gesellschaft für Informatik eV, Fachgruppe PARS;
2017.'
apa: 'Jazayeri, B., & Schwichtenberg, S. (2017). On the Necessity of an Architecture
Framework for On-The-Fly Computing. In Proceedings of Softwaretechnik-Trends
Workshops (Vol. 37). Bad Honnef, Germany: Gesellschaft für Informatik eV,
Fachgruppe PARS.'
bibtex: '@inproceedings{Jazayeri_Schwichtenberg_2017, place={Bad Honnef, Germany},
title={On the Necessity of an Architecture Framework for On-The-Fly Computing},
volume={37}, number={2}, booktitle={Proceedings of Softwaretechnik-Trends Workshops},
publisher={Gesellschaft für Informatik eV, Fachgruppe PARS}, author={Jazayeri,
Bahar and Schwichtenberg, Simon}, year={2017} }'
chicago: 'Jazayeri, Bahar, and Simon Schwichtenberg. “On the Necessity of an Architecture
Framework for On-The-Fly Computing.” In Proceedings of Softwaretechnik-Trends
Workshops, Vol. 37. Bad Honnef, Germany: Gesellschaft für Informatik eV, Fachgruppe
PARS, 2017.'
ieee: B. Jazayeri and S. Schwichtenberg, “On the Necessity of an Architecture Framework
for On-The-Fly Computing,” in Proceedings of Softwaretechnik-Trends Workshops,
2017, vol. 37.
mla: Jazayeri, Bahar, and Simon Schwichtenberg. “On the Necessity of an Architecture
Framework for On-The-Fly Computing.” Proceedings of Softwaretechnik-Trends
Workshops, vol. 37, 2, Gesellschaft für Informatik eV, Fachgruppe PARS, 2017.
short: 'B. Jazayeri, S. Schwichtenberg, in: Proceedings of Softwaretechnik-Trends
Workshops, Gesellschaft für Informatik eV, Fachgruppe PARS, Bad Honnef, Germany,
2017.'
date_created: 2018-11-15T09:06:51Z
date_updated: 2022-01-06T07:02:35Z
ddc:
- '040'
department:
- _id: '66'
file:
- access_level: closed
content_type: application/pdf
creator: bahareh
date_created: 2018-11-15T09:08:46Z
date_updated: 2018-11-15T09:08:46Z
file_id: '5696'
file_name: Jazayeri_DFF2017.pdf
file_size: 65506
relation: main_file
success: 1
file_date_updated: 2018-11-15T09:08:46Z
has_accepted_license: '1'
intvolume: ' 37'
language:
- iso: eng
place: Bad Honnef, Germany
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '17'
name: SFB 901 - Subproject C5
publication: Proceedings of Softwaretechnik-Trends Workshops
publisher: Gesellschaft für Informatik eV, Fachgruppe PARS
status: public
title: On the Necessity of an Architecture Framework for On-The-Fly Computing
type: conference
user_id: '36399'
volume: 37
year: '2017'
...
---
_id: '57'
abstract:
- lang: eng
text: 'Users prefer natural language software requirements because of their usability
and accessibility. Many approaches exist to elaborate these requirements and to
support the users during the elicitation process. But there is a lack of adequate
resources, which are needed to train and evaluate approaches for requirement refinement.
We are trying to close this gap by using online available software descriptions
from SourceForge and app stores. Thus, we present two real-life requirements collections
based on online-available software descriptions. Our goal is to show the domain-specific
characteristics of content words describing functional requirements. On the one
hand, we created a semantic role-labeled requirements set, which we use for requirements
classification. On the other hand, we enriched software descriptions with linguistic
features and dependencies to provide evidence for the context-awareness of software
functionalities. '
author:
- first_name: Frederik Simon
full_name: Bäumer, Frederik Simon
id: '38837'
last_name: Bäumer
- first_name: Markus
full_name: Dollmann, Markus
id: '27578'
last_name: Dollmann
- first_name: Michaela
full_name: Geierhos, Michaela
id: '42496'
last_name: Geierhos
orcid: 0000-0002-8180-5606
citation:
ama: 'Bäumer FS, Dollmann M, Geierhos M. Studying Software Descriptions in SourceForge
and App Stores for a better Understanding of real-life Requirements. In: Sarro
F, Shihab E, Nagappan M, Platenius MC, Kaimann D, eds. Proceedings of the 2nd
ACM SIGSOFT International Workshop on App Market Analytics. New York, NY,
USA: ACM; 2017:19-25. doi:10.1145/3121264.3121269'
apa: 'Bäumer, F. S., Dollmann, M., & Geierhos, M. (2017). Studying Software
Descriptions in SourceForge and App Stores for a better Understanding of real-life
Requirements. In F. Sarro, E. Shihab, M. Nagappan, M. C. Platenius, & D. Kaimann
(Eds.), Proceedings of the 2nd ACM SIGSOFT International Workshop on App Market
Analytics (pp. 19–25). New York, NY, USA: ACM. https://doi.org/10.1145/3121264.3121269'
bibtex: '@inproceedings{Bäumer_Dollmann_Geierhos_2017, place={New York, NY, USA},
title={Studying Software Descriptions in SourceForge and App Stores for a better
Understanding of real-life Requirements}, DOI={10.1145/3121264.3121269},
booktitle={Proceedings of the 2nd ACM SIGSOFT International Workshop on App Market
Analytics}, publisher={ACM}, author={Bäumer, Frederik Simon and Dollmann, Markus
and Geierhos, Michaela}, editor={Sarro, Federica and Shihab, Emad and Nagappan,
Meiyappan and Platenius, Marie Christin and Kaimann, DanielEditors}, year={2017},
pages={19–25} }'
chicago: 'Bäumer, Frederik Simon, Markus Dollmann, and Michaela Geierhos. “Studying
Software Descriptions in SourceForge and App Stores for a Better Understanding
of Real-Life Requirements.” In Proceedings of the 2nd ACM SIGSOFT International
Workshop on App Market Analytics, edited by Federica Sarro, Emad Shihab,
Meiyappan Nagappan, Marie Christin Platenius, and Daniel Kaimann, 19–25. New
York, NY, USA: ACM, 2017. https://doi.org/10.1145/3121264.3121269.'
ieee: F. S. Bäumer, M. Dollmann, and M. Geierhos, “Studying Software Descriptions
in SourceForge and App Stores for a better Understanding of real-life Requirements,”
in Proceedings of the 2nd ACM SIGSOFT International Workshop on App Market
Analytics, Paderborn, Germany, 2017, pp. 19–25.
mla: Bäumer, Frederik Simon, et al. “Studying Software Descriptions in SourceForge
and App Stores for a Better Understanding of Real-Life Requirements.” Proceedings
of the 2nd ACM SIGSOFT International Workshop on App Market Analytics, edited
by Federica Sarro et al., ACM, 2017, pp. 19–25, doi:10.1145/3121264.3121269.
short: 'F.S. Bäumer, M. Dollmann, M. Geierhos, in: F. Sarro, E. Shihab, M. Nagappan,
M.C. Platenius, D. Kaimann (Eds.), Proceedings of the 2nd ACM SIGSOFT International
Workshop on App Market Analytics, ACM, New York, NY, USA, 2017, pp. 19–25.'
conference:
end_date: 2017-09-05
location: Paderborn, Germany
name: 2nd ACM SIGSOFT International Workshop on App Market Analytics
start_date: 2017-09-05
date_created: 2017-10-17T12:41:02Z
date_updated: 2022-01-06T07:02:36Z
ddc:
- '000'
department:
- _id: '36'
- _id: '1'
- _id: '579'
doi: 10.1145/3121264.3121269
editor:
- first_name: 'Federica '
full_name: 'Sarro, Federica '
last_name: Sarro
- first_name: 'Emad '
full_name: 'Shihab, Emad '
last_name: Shihab
- first_name: 'Meiyappan '
full_name: 'Nagappan, Meiyappan '
last_name: Nagappan
- first_name: Marie Christin
full_name: Platenius, Marie Christin
last_name: Platenius
- first_name: Daniel
full_name: Kaimann, Daniel
last_name: Kaimann
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T14:27:00Z
date_updated: 2018-11-02T14:27:00Z
file_id: '5272'
file_name: fsews17wama-wamamainid5.pdf
file_size: 1546837
relation: main_file
success: 1
file_date_updated: 2018-11-02T14:27:00Z
has_accepted_license: '1'
language:
- iso: eng
page: 19-25
place: New York, NY, USA
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '9'
name: SFB 901 - Subproject B1
publication: Proceedings of the 2nd ACM SIGSOFT International Workshop on App Market
Analytics
publication_identifier:
isbn:
- 978-1-4503-5158-4
publication_status: published
publisher: ACM
quality_controlled: '1'
status: public
title: Studying Software Descriptions in SourceForge and App Stores for a better Understanding
of real-life Requirements
type: conference
user_id: '477'
year: '2017'
...
---
_id: '5724'
author:
- first_name: Alexander
full_name: Hetzer, Alexander
id: '38209'
last_name: Hetzer
- first_name: Tanja
full_name: Tornede, Tanja
last_name: Tornede
citation:
ama: Hetzer A, Tornede T. Solving the Container Pre-Marshalling Problem Using
Reinforcement Learning and Structured Output Prediction. Universität Paderborn;
2017.
apa: Hetzer, A., & Tornede, T. (2017). Solving the Container Pre-Marshalling
Problem using Reinforcement Learning and Structured Output Prediction. Universität
Paderborn.
bibtex: '@book{Hetzer_Tornede_2017, title={Solving the Container Pre-Marshalling
Problem using Reinforcement Learning and Structured Output Prediction}, publisher={Universität
Paderborn}, author={Hetzer, Alexander and Tornede, Tanja}, year={2017} }'
chicago: Hetzer, Alexander, and Tanja Tornede. Solving the Container Pre-Marshalling
Problem Using Reinforcement Learning and Structured Output Prediction. Universität
Paderborn, 2017.
ieee: A. Hetzer and T. Tornede, Solving the Container Pre-Marshalling Problem
using Reinforcement Learning and Structured Output Prediction. Universität
Paderborn, 2017.
mla: Hetzer, Alexander, and Tanja Tornede. Solving the Container Pre-Marshalling
Problem Using Reinforcement Learning and Structured Output Prediction. Universität
Paderborn, 2017.
short: A. Hetzer, T. Tornede, Solving the Container Pre-Marshalling Problem Using
Reinforcement Learning and Structured Output Prediction, Universität Paderborn,
2017.
date_created: 2018-11-19T07:49:13Z
date_updated: 2022-01-06T07:02:37Z
department:
- _id: '355'
- _id: '199'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '10'
name: SFB 901 - Subproject B2
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Felix
full_name: Mohr, Felix
last_name: Mohr
- first_name: Eyke
full_name: Hüllermeier, Eyke
id: '48129'
last_name: Hüllermeier
- first_name: Kevin
full_name: Tierney, Kevin
last_name: Tierney
title: Solving the Container Pre-Marshalling Problem using Reinforcement Learning
and Structured Output Prediction
type: mastersthesis
user_id: '477'
year: '2017'
...
---
_id: '5769'
abstract:
- lang: eng
text: "Information Flow Analysis (IFA) aims at detecting illegal flows of information
between program entities. “Legality” is therein specified in terms of various
security policies. For the analysis, this opens up two possibilities: building
generic, policy independent and building specific, policy dependent IFAs. While
the former needs to track all dependencies between program entities, the latter
allows for a reduced and thus more efficient analysis.\r\n\r\nIn this paper, we
start out by formally defining a policy independent information flow analysis.
Next, we show how to specialize this IFA via policy specific variable tracking,
and prove soundness of the specialization. We furthermore investigate refinement
relationships between policies, allowing an IFA for one policy to be employed
for its refinements. As policy refinement depends on concrete program entities,
we additionally propose a precomputation of policy refinement conditions, enabling
an efficient refinement check for concrete programs."
author:
- first_name: Manuel
full_name: Töws, Manuel
id: '11315'
last_name: Töws
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Töws M, Wehrheim H. Policy Dependent and Independent Information Flow Analyses.
In: Formal Methods and Software Engineering - 19th International Conference
on Formal Engineering Methods (ICFEM 2017). Springer International Publishing;
2017:362-378. doi:10.1007/978-3-319-68690-5_22'
apa: Töws, M., & Wehrheim, H. (2017). Policy Dependent and Independent Information
Flow Analyses. In Formal Methods and Software Engineering - 19th International
Conference on Formal Engineering Methods (ICFEM 2017) (pp. 362–378). Springer
International Publishing. https://doi.org/10.1007/978-3-319-68690-5_22
bibtex: '@inproceedings{Töws_Wehrheim_2017, title={Policy Dependent and Independent
Information Flow Analyses}, DOI={10.1007/978-3-319-68690-5_22},
booktitle={Formal Methods and Software Engineering - 19th International Conference
on Formal Engineering Methods (ICFEM 2017)}, publisher={Springer International
Publishing}, author={Töws, Manuel and Wehrheim, Heike}, year={2017}, pages={362–378}
}'
chicago: Töws, Manuel, and Heike Wehrheim. “Policy Dependent and Independent Information
Flow Analyses.” In Formal Methods and Software Engineering - 19th International
Conference on Formal Engineering Methods (ICFEM 2017), 362–78. Springer International
Publishing, 2017. https://doi.org/10.1007/978-3-319-68690-5_22.
ieee: M. Töws and H. Wehrheim, “Policy Dependent and Independent Information Flow
Analyses,” in Formal Methods and Software Engineering - 19th International
Conference on Formal Engineering Methods (ICFEM 2017), 2017, pp. 362–378.
mla: Töws, Manuel, and Heike Wehrheim. “Policy Dependent and Independent Information
Flow Analyses.” Formal Methods and Software Engineering - 19th International
Conference on Formal Engineering Methods (ICFEM 2017), Springer International
Publishing, 2017, pp. 362–78, doi:10.1007/978-3-319-68690-5_22.
short: 'M. Töws, H. Wehrheim, in: Formal Methods and Software Engineering - 19th
International Conference on Formal Engineering Methods (ICFEM 2017), Springer
International Publishing, 2017, pp. 362–378.'
date_created: 2018-11-21T09:38:43Z
date_updated: 2022-01-06T07:02:39Z
ddc:
- '000'
department:
- _id: '77'
doi: 10.1007/978-3-319-68690-5_22
file:
- access_level: closed
content_type: application/pdf
creator: mtoews
date_created: 2018-11-26T15:07:42Z
date_updated: 2018-11-26T15:07:42Z
file_id: '5836'
file_name: Töws-Wehrheim2017_Chapter_PolicyDependentAndIndependentI.pdf
file_size: 424031
relation: main_file
success: 1
file_date_updated: 2018-11-26T15:07:42Z
has_accepted_license: '1'
language:
- iso: eng
page: 362-378
project:
- _id: '12'
name: SFB 901 - Subproject B4
- _id: '3'
name: SFB 901 - Project Area B
- _id: '1'
name: SFB 901
publication: Formal Methods and Software Engineering - 19th International Conference on
Formal Engineering Methods (ICFEM 2017)
publication_identifier:
isbn:
- '9783319686899'
- '9783319686905'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer International Publishing
status: public
title: Policy Dependent and Independent Information Flow Analyses
type: conference
user_id: '477'
year: '2017'
...
---
_id: '58'
abstract:
- lang: eng
text: Network function virtualization and software-defined networking allow services
consisting of virtual network functions to be designed and implemented with great
flexibility by facilitating automatic deployments, migrations, and reconfigurations
for services and their components. For extended flexibility, we go beyond seeing
services as a fixed chain of functions. We define the service structure in a flexible
way that enables changing the order of functions in case the functionality of
the service is not influenced by this, and propose a YANG data model for expressing
this flexibility. Flexible structures allow the network orchestration system to
choose the optimal composition of service components that for example gives the
best results for placement of services in the network. When number of flexible
services and number of components in each service increase, combinatorial explosion
limits the practical use of this flexibility. In this paper, we describe a selection
heuristic that gives a Pareto set of the possible compositions of a service as
well as possible combinations of different services, with respect to different
optimization objectives. Moreover, we present a heuristic algorithm for placement
of a combination of services, which aims at placing service components along shortest
paths that have enough capacity for accommodating the services. By applying these
solutions, we show that allowing flexibility in the service structure is feasible.
author:
- first_name: Sevil
full_name: Dräxler, Sevil
id: '31764'
last_name: Dräxler
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: Dräxler S, Karl H. Specification, Composition, and Placement of Network Services
with Flexible Structures. International Journal of Network Management.
2017;(2):1--16. doi:10.1002/nem.1963
apa: Dräxler, S., & Karl, H. (2017). Specification, Composition, and Placement
of Network Services with Flexible Structures. International Journal of Network
Management, (2), 1--16. https://doi.org/10.1002/nem.1963
bibtex: '@article{Dräxler_Karl_2017, title={Specification, Composition, and Placement
of Network Services with Flexible Structures}, DOI={10.1002/nem.1963},
number={2}, journal={International Journal of Network Management}, publisher={Wiley
Online Library}, author={Dräxler, Sevil and Karl, Holger}, year={2017}, pages={1--16}
}'
chicago: 'Dräxler, Sevil, and Holger Karl. “Specification, Composition, and Placement
of Network Services with Flexible Structures.” International Journal of Network
Management, no. 2 (2017): 1--16. https://doi.org/10.1002/nem.1963.'
ieee: S. Dräxler and H. Karl, “Specification, Composition, and Placement of Network
Services with Flexible Structures,” International Journal of Network Management,
no. 2, pp. 1--16, 2017.
mla: Dräxler, Sevil, and Holger Karl. “Specification, Composition, and Placement
of Network Services with Flexible Structures.” International Journal of Network
Management, no. 2, Wiley Online Library, 2017, pp. 1--16, doi:10.1002/nem.1963.
short: S. Dräxler, H. Karl, International Journal of Network Management (2017) 1--16.
date_created: 2017-10-17T12:41:02Z
date_updated: 2022-01-06T07:02:42Z
ddc:
- '040'
department:
- _id: '75'
doi: 10.1002/nem.1963
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-03-21T13:18:13Z
date_updated: 2018-06-13T09:15:42Z
file_id: '1579'
file_name: 58-preprint-ijnm.pdf
file_size: 2765738
relation: hidden
- access_level: open_access
content_type: application/pdf
creator: sevilmeh
date_created: 2018-06-13T09:22:37Z
date_updated: 2018-06-13T09:22:37Z
file_id: '3197'
file_name: 58-accepted-ijnm.pdf
file_size: 2766920
relation: main_file
file_date_updated: 2018-06-13T09:22:37Z
has_accepted_license: '1'
issue: '2'
oa: '1'
page: 1--16
project:
- _id: '1'
name: SFB 901
- _id: '16'
name: SFB 901 - Subprojekt C4
- _id: '4'
name: SFB 901 - Project Area C
- _id: '25'
call_identifier: 5G PPP Phase 1
grant_number: '671517'
name: 'SONATA NFV: Agile Service Development and Orchestration in 5G Virtualized
Networks'
publication: International Journal of Network Management
publisher: Wiley Online Library
status: public
title: Specification, Composition, and Placement of Network Services with Flexible
Structures
type: journal_article
urn: '582'
user_id: '477'
year: '2017'
...