---
_id: '706'
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. Cost-efficient Scheduling
on Machines from the Cloud. Journal of Combinatorial Optimization. 2017;36(4):1168-1194.
doi:10.1007/s10878-017-0198-x
apa: Mäcker, A., Malatyali, M., Meyer auf der Heide, F., & Riechers, S. (2017).
Cost-efficient Scheduling on Machines from the Cloud. Journal of Combinatorial
Optimization, 36(4), 1168–1194. https://doi.org/10.1007/s10878-017-0198-x
bibtex: '@article{Mäcker_Malatyali_Meyer auf der Heide_Riechers_2017, title={Cost-efficient
Scheduling on Machines from the Cloud}, volume={36}, DOI={10.1007/s10878-017-0198-x},
number={4}, journal={Journal of Combinatorial Optimization}, publisher={Springer},
author={Mäcker, Alexander and Malatyali, Manuel and Meyer auf der Heide, Friedhelm
and Riechers, Sören}, year={2017}, pages={1168–1194} }'
chicago: 'Mäcker, Alexander, Manuel Malatyali, Friedhelm Meyer auf der Heide, and
Sören Riechers. “Cost-Efficient Scheduling on Machines from the Cloud.” Journal
of Combinatorial Optimization 36, no. 4 (2017): 1168–94. https://doi.org/10.1007/s10878-017-0198-x.'
ieee: A. Mäcker, M. Malatyali, F. Meyer auf der Heide, and S. Riechers, “Cost-efficient
Scheduling on Machines from the Cloud,” Journal of Combinatorial Optimization,
vol. 36, no. 4, pp. 1168–1194, 2017.
mla: Mäcker, Alexander, et al. “Cost-Efficient Scheduling on Machines from the Cloud.”
Journal of Combinatorial Optimization, vol. 36, no. 4, Springer, 2017,
pp. 1168–94, doi:10.1007/s10878-017-0198-x.
short: A. Mäcker, M. Malatyali, F. Meyer auf der Heide, S. Riechers, Journal of
Combinatorial Optimization 36 (2017) 1168–1194.
date_created: 2017-11-15T10:21:34Z
date_updated: 2022-01-06T07:03:27Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1007/s10878-017-0198-x
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-14T12:21:34Z
date_updated: 2018-03-14T12:21:34Z
file_id: '1210'
file_name: 706-chp_3A10.1007_2F978-3-319-48749-6_42.pdf
file_size: 608614
relation: main_file
success: 1
file_date_updated: 2018-03-14T12:21:34Z
has_accepted_license: '1'
intvolume: ' 36'
issue: '4'
language:
- iso: eng
page: 1168-1194
project:
- _id: '1'
name: SFB 901
- _id: '16'
name: SFB 901 - Subprojekt C4
- _id: '4'
name: SFB 901 - Project Area C
publication: Journal of Combinatorial Optimization
publisher: Springer
status: public
title: Cost-efficient Scheduling on Machines from the Cloud
type: journal_article
user_id: '15415'
volume: 36
year: '2017'
...
---
_id: '707'
author:
- first_name: Sven
full_name: Walther, Sven
last_name: Walther
citation:
ama: Walther S. Knowledge-Based Verification of Service Compositions. Universität
Paderborn; 2017. doi:10.17619/UNIPB/1-307
apa: Walther, S. (2017). Knowledge-based Verification of Service Compositions.
Universität Paderborn. https://doi.org/10.17619/UNIPB/1-307
bibtex: '@book{Walther_2017, title={Knowledge-based Verification of Service Compositions},
DOI={10.17619/UNIPB/1-307},
publisher={Universität Paderborn}, author={Walther, Sven}, year={2017} }'
chicago: Walther, Sven. Knowledge-Based Verification of Service Compositions.
Universität Paderborn, 2017. https://doi.org/10.17619/UNIPB/1-307.
ieee: S. Walther, Knowledge-based Verification of Service Compositions. Universität
Paderborn, 2017.
mla: Walther, Sven. Knowledge-Based Verification of Service Compositions.
Universität Paderborn, 2017, doi:10.17619/UNIPB/1-307.
short: S. Walther, Knowledge-Based Verification of Service Compositions, Universität
Paderborn, 2017.
date_created: 2017-11-20T07:59:31Z
date_updated: 2022-01-06T07:03:27Z
department:
- _id: '77'
doi: 10.17619/UNIPB/1-307
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '11'
name: SFB 901 - Subproject B3
- _id: '3'
name: SFB 901 - Project Area B
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
title: Knowledge-based Verification of Service Compositions
type: dissertation
user_id: '477'
year: '2017'
...
---
_id: '71'
abstract:
- lang: eng
text: Today, software verification tools have reached the maturity to be used for
large scale programs. Different tools perform differently well on varying code.
A software developer is hence faced with the problem of choosing a tool appropriate
for her program at hand. A ranking of tools on programs could facilitate the choice.
Such rankings can, however, so far only be obtained by running all considered
tools on the program.In this paper, we present a machine learning approach to
predicting rankings of tools on programs. The method builds upon so-called label
ranking algorithms, which we complement with appropriate kernels providing a similarity
measure for programs. Our kernels employ a graph representation for software source
code that mixes elements of control flow and program dependence graphs with abstract
syntax trees. Using data sets from the software verification competition SV-COMP,
we demonstrate our rank prediction technique to generalize well and achieve a
rather high predictive accuracy (rank correlation > 0.6).
author:
- first_name: Mike
full_name: Czech, Mike
last_name: Czech
- first_name: Eyke
full_name: Hüllermeier, Eyke
id: '48129'
last_name: Hüllermeier
- first_name: Marie-Christine
full_name: Jakobs, Marie-Christine
last_name: Jakobs
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Czech M, Hüllermeier E, Jakobs M-C, Wehrheim H. Predicting Rankings of Software
Verification Tools. In: Proceedings of the 3rd International Workshop on Software
Analytics. SWAN’17. ; 2017:23-26. doi:10.1145/3121257.3121262'
apa: Czech, M., Hüllermeier, E., Jakobs, M.-C., & Wehrheim, H. (2017). Predicting
Rankings of Software Verification Tools. In Proceedings of the 3rd International
Workshop on Software Analytics (pp. 23–26). https://doi.org/10.1145/3121257.3121262
bibtex: '@inproceedings{Czech_Hüllermeier_Jakobs_Wehrheim_2017, series={SWAN’17},
title={Predicting Rankings of Software Verification Tools}, DOI={10.1145/3121257.3121262},
booktitle={Proceedings of the 3rd International Workshop on Software Analytics},
author={Czech, Mike and Hüllermeier, Eyke and Jakobs, Marie-Christine and Wehrheim,
Heike}, year={2017}, pages={23–26}, collection={SWAN’17} }'
chicago: Czech, Mike, Eyke Hüllermeier, Marie-Christine Jakobs, and Heike Wehrheim.
“Predicting Rankings of Software Verification Tools.” In Proceedings of the
3rd International Workshop on Software Analytics, 23–26. SWAN’17, 2017. https://doi.org/10.1145/3121257.3121262.
ieee: M. Czech, E. Hüllermeier, M.-C. Jakobs, and H. Wehrheim, “Predicting Rankings
of Software Verification Tools,” in Proceedings of the 3rd International Workshop
on Software Analytics, 2017, pp. 23–26.
mla: Czech, Mike, et al. “Predicting Rankings of Software Verification Tools.” Proceedings
of the 3rd International Workshop on Software Analytics, 2017, pp. 23–26,
doi:10.1145/3121257.3121262.
short: 'M. Czech, E. Hüllermeier, M.-C. Jakobs, H. Wehrheim, in: Proceedings of
the 3rd International Workshop on Software Analytics, 2017, pp. 23–26.'
date_created: 2017-10-17T12:41:05Z
date_updated: 2022-01-06T07:03:28Z
ddc:
- '000'
department:
- _id: '355'
- _id: '77'
doi: 10.1145/3121257.3121262
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T14:24:29Z
date_updated: 2018-11-02T14:24:29Z
file_id: '5271'
file_name: fsews17swan-swanmain1.pdf
file_size: 822383
relation: main_file
success: 1
file_date_updated: 2018-11-02T14:24:29Z
has_accepted_license: '1'
language:
- iso: eng
page: 23-26
project:
- _id: '1'
name: SFB 901
- _id: '12'
name: SFB 901 - Subprojekt B4
- _id: '10'
name: SFB 901 - Subproject B2
- _id: '3'
name: SFB 901 - Project Area B
- _id: '11'
name: SFB 901 - Subproject B3
publication: Proceedings of the 3rd International Workshop on Software Analytics
series_title: SWAN'17
status: public
title: Predicting Rankings of Software Verification Tools
type: conference
user_id: '15504'
year: '2017'
...
---
_id: '717'
abstract:
- lang: eng
text: In conventional large-scale networks, creation and management of network services
are costly and complex tasks that often consume a lot of resources, including
time and manpower. Network softwarization and network function virtualization
have been introduced to tackle these problems, aiming at decreasing costs and
complexity of implementing new services, maintaining the implemented services,
and managing available resources in service provisioning platforms and underlying
infrastructures. To experience the full potential of these approaches, innovative
development support tools and service provisioning environments are needed. To
answer these needs, we introduce the architecture of the open-source SONATA system,
a service programming, orchestration, and management framework. We present a development
toolchain for virtualized network services, fully integrated with a service platform
and orchestration system. We introduce the modular and flexible architecture of
our system and discuss its main components and features, such as function- and
service-specific managers that allow fine-grained service management, slicing
support to facilitate multi-tenancy, recursiveness for improved scalability, and
full-featured DevOps support.
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
- first_name: Manuel
full_name: Peuster, Manuel
id: '13271'
last_name: Peuster
- first_name: Hadi
full_name: Razzaghi Kouchaksaraei, Hadi
id: '60845'
last_name: Razzaghi Kouchaksaraei
- first_name: Michael
full_name: Bredel, Michael
last_name: Bredel
- first_name: Johannes
full_name: Lessmann, Johannes
last_name: Lessmann
- first_name: Thomas
full_name: Soenen, Thomas
last_name: Soenen
- first_name: Wouter
full_name: Tavernier, Wouter
last_name: Tavernier
- first_name: Sharon
full_name: Mendel-Brin, Sharon
last_name: Mendel-Brin
- first_name: George
full_name: Xilouris, George
last_name: Xilouris
citation:
ama: 'Dräxler S, Karl H, Peuster M, et al. SONATA: Service programming and orchestration
for virtualized software networks. In: 2017 IEEE International Conference on
Communications Workshops (ICC Workshops). IEEE; 2017. doi:10.1109/iccw.2017.7962785'
apa: 'Dräxler, S., Karl, H., Peuster, M., Razzaghi Kouchaksaraei, H., Bredel, M.,
Lessmann, J., … Xilouris, G. (2017). SONATA: Service programming and orchestration
for virtualized software networks. In 2017 IEEE International Conference on
Communications Workshops (ICC Workshops). Paris, France: IEEE. https://doi.org/10.1109/iccw.2017.7962785'
bibtex: '@inproceedings{Dräxler_Karl_Peuster_Razzaghi Kouchaksaraei_Bredel_Lessmann_Soenen_Tavernier_Mendel-Brin_Xilouris_2017,
title={SONATA: Service programming and orchestration for virtualized software
networks}, DOI={10.1109/iccw.2017.7962785},
booktitle={2017 IEEE International Conference on Communications Workshops (ICC
Workshops)}, publisher={IEEE}, author={Dräxler, Sevil and Karl, Holger and Peuster,
Manuel and Razzaghi Kouchaksaraei, Hadi and Bredel, Michael and Lessmann, Johannes
and Soenen, Thomas and Tavernier, Wouter and Mendel-Brin, Sharon and Xilouris,
George}, year={2017} }'
chicago: 'Dräxler, Sevil, Holger Karl, Manuel Peuster, Hadi Razzaghi Kouchaksaraei,
Michael Bredel, Johannes Lessmann, Thomas Soenen, Wouter Tavernier, Sharon Mendel-Brin,
and George Xilouris. “SONATA: Service Programming and Orchestration for Virtualized
Software Networks.” In 2017 IEEE International Conference on Communications
Workshops (ICC Workshops). IEEE, 2017. https://doi.org/10.1109/iccw.2017.7962785.'
ieee: 'S. Dräxler et al., “SONATA: Service programming and orchestration
for virtualized software networks,” in 2017 IEEE International Conference on
Communications Workshops (ICC Workshops), Paris, France, 2017.'
mla: 'Dräxler, Sevil, et al. “SONATA: Service Programming and Orchestration for
Virtualized Software Networks.” 2017 IEEE International Conference on Communications
Workshops (ICC Workshops), IEEE, 2017, doi:10.1109/iccw.2017.7962785.'
short: 'S. Dräxler, H. Karl, M. Peuster, H. Razzaghi Kouchaksaraei, M. Bredel, J.
Lessmann, T. Soenen, W. Tavernier, S. Mendel-Brin, G. Xilouris, in: 2017 IEEE
International Conference on Communications Workshops (ICC Workshops), IEEE, 2017.'
conference:
end_date: 2017-05-25
location: Paris, France
name: 2017 IEEE International Conference on Communications Workshops (ICC Workshops)
start_date: 2017-05-21
date_created: 2017-11-22T09:42:59Z
date_updated: 2022-01-06T07:03:28Z
ddc:
- '000'
department:
- _id: '75'
doi: 10.1109/iccw.2017.7962785
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T14:22:10Z
date_updated: 2018-11-02T14:22:10Z
file_id: '5270'
file_name: 07962785.pdf
file_size: 821211
relation: main_file
success: 1
file_date_updated: 2018-11-02T14:22:10Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/pdf/1605.05850.pdf
oa: '1'
project:
- _id: '25'
call_identifier: 5G PPP Phase 1
grant_number: '671517'
name: 'SONATA NFV: Agile Service Development and Orchestration in 5G Virtualized
Networks'
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '16'
name: SFB 901 - Subproject C4
publication: 2017 IEEE International Conference on Communications Workshops (ICC Workshops)
publication_identifier:
isbn:
- '9781509015252'
publication_status: published
publisher: IEEE
status: public
title: 'SONATA: Service programming and orchestration for virtualized software networks'
type: conference
user_id: '31764'
year: '2017'
...
---
_id: '72'
abstract:
- lang: eng
text: 'Software verification competitions, such as the annual SV-COMP, evaluate
software verification tools with respect to their effectivity and efficiency.
Typically, the outcome of a competition is a (possibly category-specific) ranking
of the tools. For many applications, such as building portfolio solvers, it would
be desirable to have an idea of the (relative) performance of verification tools
on a given verification task beforehand, i.e., prior to actually running all tools
on the task.In this paper, we present a machine learning approach to predicting
rankings of tools on verification tasks. The method builds upon so-called label
ranking algorithms, which we complement with appropriate kernels providing a similarity
measure for verification tasks. Our kernels employ a graph representation for
software source code that mixes elements of control flow and program dependence
graphs with abstract syntax trees. Using data sets from SV-COMP, we demonstrate
our rank prediction technique to generalize well and achieve a rather high predictive
accuracy. In particular, our method outperforms a recently proposed feature-based
approach of Demyanova et al. (when applied to rank predictions). '
author:
- first_name: Mike
full_name: Czech, Mike
last_name: Czech
- first_name: Eyke
full_name: Hüllermeier, Eyke
id: '48129'
last_name: Hüllermeier
- first_name: Marie-Christine
full_name: Jakobs, Marie-Christine
last_name: Jakobs
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: Czech M, Hüllermeier E, Jakobs M-C, Wehrheim H. Predicting Rankings of Software
Verification Competitions.; 2017.
apa: Czech, M., Hüllermeier, E., Jakobs, M.-C., & Wehrheim, H. (2017). Predicting
Rankings of Software Verification Competitions.
bibtex: '@book{Czech_Hüllermeier_Jakobs_Wehrheim_2017, title={Predicting Rankings
of Software Verification Competitions}, author={Czech, Mike and Hüllermeier, Eyke
and Jakobs, Marie-Christine and Wehrheim, Heike}, year={2017} }'
chicago: Czech, Mike, Eyke Hüllermeier, Marie-Christine Jakobs, and Heike Wehrheim.
Predicting Rankings of Software Verification Competitions, 2017.
ieee: M. Czech, E. Hüllermeier, M.-C. Jakobs, and H. Wehrheim, Predicting Rankings
of Software Verification Competitions. 2017.
mla: Czech, Mike, et al. Predicting Rankings of Software Verification Competitions.
2017.
short: M. Czech, E. Hüllermeier, M.-C. Jakobs, H. Wehrheim, Predicting Rankings
of Software Verification Competitions, 2017.
date_created: 2017-10-17T12:41:05Z
date_updated: 2022-01-06T07:03:29Z
ddc:
- '000'
department:
- _id: '77'
- _id: '355'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-11-21T10:50:11Z
date_updated: 2018-11-21T10:50:11Z
file_id: '5782'
file_name: "Predicting Rankings of So\x81ware Verification Competitions.pdf"
file_size: 869984
relation: main_file
success: 1
file_date_updated: 2018-11-21T10:50:11Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '11'
name: SFB 901 - Subprojekt B3
- _id: '12'
name: SFB 901 - Subprojekt B4
- _id: '3'
name: SFB 901 - Project Area B
status: public
title: Predicting Rankings of Software Verification Competitions
type: report
user_id: '15504'
year: '2017'
...
---
_id: '73'
abstract:
- lang: eng
text: Today, verification tools do not only output yes or no, but also provide correctness
arguments or counterexamples. While counterexamples help to fix bugs, correctness
arguments are used to increase the trust in program correctness, e.g., in Proof-Carrying
Code (PCC). Correctness arguments are well-studied for single analyses, but not
when a set of analyses together verifies a program, each of the analyses checking
only a particular part. Such a set of partial, complementary analyses is often
used when a single analysis would fail or is inefficient on some program parts.We
propose PART_PW, a technique which allows us to automatically construct a proof
witness (correctness argument) from the analysis results obtained by a set of
partial, complementary analyses. The constructed proof witnesses are proven to
be valid correctness arguments and in our experiments we use them seamlessly and
efficiently in existing PCC approaches.
author:
- first_name: Marie-Christine
full_name: Jakobs, Marie-Christine
last_name: Jakobs
citation:
ama: 'Jakobs M-C. PART_PW: From Partial Analysis Results to a Proof Witness. In:
Cimatti A, Sirjani M, eds. Software Engineering and Formal Methods. Lecture
Notes in Computer Science. ; 2017:120-135. doi:10.1007/978-3-319-66197-1_8'
apa: 'Jakobs, M.-C. (2017). PART_PW: From Partial Analysis Results to a Proof Witness.
In A. Cimatti & M. Sirjani (Eds.), Software Engineering and Formal Methods
(pp. 120–135). https://doi.org/10.1007/978-3-319-66197-1_8'
bibtex: '@inproceedings{Jakobs_2017, series={Lecture Notes in Computer Science},
title={PART_PW: From Partial Analysis Results to a Proof Witness}, DOI={10.1007/978-3-319-66197-1_8},
booktitle={Software Engineering and Formal Methods}, author={Jakobs, Marie-Christine},
editor={Cimatti, Alessandro and Sirjani, MarjanEditors}, year={2017}, pages={120–135},
collection={Lecture Notes in Computer Science} }'
chicago: 'Jakobs, Marie-Christine. “PART_PW: From Partial Analysis Results to a
Proof Witness.” In Software Engineering and Formal Methods, edited by Alessandro
Cimatti and Marjan Sirjani, 120–35. Lecture Notes in Computer Science, 2017. https://doi.org/10.1007/978-3-319-66197-1_8.'
ieee: 'M.-C. Jakobs, “PART_PW: From Partial Analysis Results to a Proof Witness,”
in Software Engineering and Formal Methods, 2017, pp. 120–135.'
mla: 'Jakobs, Marie-Christine. “PART_PW: From Partial Analysis Results to a Proof
Witness.” Software Engineering and Formal Methods, edited by Alessandro
Cimatti and Marjan Sirjani, 2017, pp. 120–35, doi:10.1007/978-3-319-66197-1_8.'
short: 'M.-C. Jakobs, in: A. Cimatti, M. Sirjani (Eds.), Software Engineering and
Formal Methods, 2017, pp. 120–135.'
date_created: 2017-10-17T12:41:05Z
date_updated: 2022-01-06T07:03:32Z
ddc:
- '000'
doi: 10.1007/978-3-319-66197-1_8
editor:
- first_name: Alessandro
full_name: Cimatti, Alessandro
last_name: Cimatti
- first_name: Marjan
full_name: Sirjani, Marjan
last_name: Sirjani
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T14:47:04Z
date_updated: 2018-11-02T14:47:04Z
file_id: '5283'
file_name: PARTMathrmPWFromPartialAnalysi.pdf
file_size: 496965
relation: main_file
success: 1
file_date_updated: 2018-11-02T14:47:04Z
has_accepted_license: '1'
language:
- iso: eng
page: 120-135
project:
- _id: '1'
name: SFB 901
- _id: '12'
name: SFB 901 - Subprojekt B4
- _id: '3'
name: SFB 901 - Project Area B
publication: Software Engineering and Formal Methods
series_title: Lecture Notes in Computer Science
status: public
title: 'PART_PW: From Partial Analysis Results to a Proof Witness'
type: conference
user_id: '477'
year: '2017'
...
---
_id: '74'
author:
- first_name: Christoph
full_name: Knorr, Christoph
last_name: Knorr
citation:
ama: Knorr C. OpenCL-basierte Videoverarbeitung auf heterogenen Rechenknoten.
Universität Paderborn; 2017.
apa: Knorr, C. (2017). OpenCL-basierte Videoverarbeitung auf heterogenen Rechenknoten.
Universität Paderborn.
bibtex: '@book{Knorr_2017, title={OpenCL-basierte Videoverarbeitung auf heterogenen
Rechenknoten}, publisher={Universität Paderborn}, author={Knorr, Christoph}, year={2017}
}'
chicago: Knorr, Christoph. OpenCL-basierte Videoverarbeitung auf heterogenen
Rechenknoten. Universität Paderborn, 2017.
ieee: C. Knorr, OpenCL-basierte Videoverarbeitung auf heterogenen Rechenknoten.
Universität Paderborn, 2017.
mla: Knorr, Christoph. OpenCL-basierte Videoverarbeitung auf heterogenen Rechenknoten.
Universität Paderborn, 2017.
short: C. Knorr, OpenCL-basierte Videoverarbeitung auf heterogenen Rechenknoten,
Universität Paderborn, 2017.
date_created: 2017-10-17T12:41:05Z
date_updated: 2022-01-06T07:03:36Z
department:
- _id: '78'
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '14'
name: SFB 901 - Subprojekt C2
- _id: '4'
name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Achim
full_name: Lösch, Achim
id: '43646'
last_name: Lösch
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
title: OpenCL-basierte Videoverarbeitung auf heterogenen Rechenknoten
type: mastersthesis
user_id: '477'
year: '2017'
...
---
_id: '84'
abstract:
- lang: eng
text: The increasing popularity of paradigms like service-oriented computing and
cloud com-puting is leading to a growing amount of service providers offering
software componentsin the form of deployed, ready-to-use services (Software as
a Service, SaaS) [14, 20].In order to discover and select software services, intermediaries
apply service matchingapproaches for determining whether the specification of
a provided service satisfies therequester’s requirements. There are already lots
of different service matching approachesconsidering different service properties
(structural, behavioral, and non-functional proper-ties). However, each of these
approaches alone is not enough to provide a high matchingresult quality (e.g.,
accurate matching results) [BOR04].Thus, such approaches should be combined into
a more holistic approach leading to moreaccurate matching results. However, this
combination is a manual, error-prone procedurewhere many design decisions are
made. Furthermore, this procedure has to be repeatedfrequently depending on the
context, e.g., to consider different requesters or markets.
author:
- first_name: Marie Christin
full_name: Platenius, Marie Christin
last_name: Platenius
- first_name: Svetlana
full_name: Arifulina, Svetlana
last_name: Arifulina
- first_name: Wilhelm
full_name: Schäfer, Wilhelm
last_name: Schäfer
citation:
ama: 'Platenius MC, Arifulina S, Schäfer W. MatchBox: A Framework for Dynamic Configuration
of Service Matching Processes (Extended Abstract). In: Tagungsband Software
Engineering. Lecture Notes in Informatics (LNI). ; 2017:81--82.'
apa: 'Platenius, M. C., Arifulina, S., & Schäfer, W. (2017). MatchBox: A Framework
for Dynamic Configuration of Service Matching Processes (Extended Abstract). In
Tagungsband Software Engineering (pp. 81--82).'
bibtex: '@inproceedings{Platenius_Arifulina_Schäfer_2017, series={Lecture Notes
in Informatics (LNI)}, title={MatchBox: A Framework for Dynamic Configuration
of Service Matching Processes (Extended Abstract)}, booktitle={Tagungsband Software
Engineering}, author={Platenius, Marie Christin and Arifulina, Svetlana and Schäfer,
Wilhelm}, year={2017}, pages={81--82}, collection={Lecture Notes in Informatics
(LNI)} }'
chicago: 'Platenius, Marie Christin, Svetlana Arifulina, and Wilhelm Schäfer. “MatchBox:
A Framework for Dynamic Configuration of Service Matching Processes (Extended
Abstract).” In Tagungsband Software Engineering, 81--82. Lecture Notes
in Informatics (LNI), 2017.'
ieee: 'M. C. Platenius, S. Arifulina, and W. Schäfer, “MatchBox: A Framework for
Dynamic Configuration of Service Matching Processes (Extended Abstract),” in Tagungsband
Software Engineering, 2017, pp. 81--82.'
mla: 'Platenius, Marie Christin, et al. “MatchBox: A Framework for Dynamic Configuration
of Service Matching Processes (Extended Abstract).” Tagungsband Software Engineering,
2017, pp. 81--82.'
short: 'M.C. Platenius, S. Arifulina, W. Schäfer, in: Tagungsband Software Engineering,
2017, pp. 81--82.'
date_created: 2017-10-17T12:41:07Z
date_updated: 2022-01-06T07:03:54Z
ddc:
- '040'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T13:13:41Z
date_updated: 2018-03-21T13:13:41Z
file_id: '1573'
file_name: 84-paper_04.pdf
file_size: 200998
relation: main_file
success: 1
file_date_updated: 2018-03-21T13:13:41Z
has_accepted_license: '1'
page: 81--82
project:
- _id: '1'
name: SFB 901
- _id: '9'
name: SFB 901 - Subprojekt B1
- _id: '3'
name: SFB 901 - Project Area B
publication: Tagungsband Software Engineering
series_title: Lecture Notes in Informatics (LNI)
status: public
title: 'MatchBox: A Framework for Dynamic Configuration of Service Matching Processes
(Extended Abstract)'
type: conference
user_id: '15504'
year: '2017'
...
---
_id: '85'
author:
- first_name: Lukas
full_name: Lohrsträter, Lukas
last_name: Lohrsträter
citation:
ama: Lohrsträter L. Literaturüberblick über die Rolle von Business Architecture
in Enterprise Architecture. Universität Paderborn; 2017.
apa: Lohrsträter, L. (2017). Literaturüberblick über die Rolle von Business Architecture
in Enterprise Architecture. Universität Paderborn.
bibtex: '@book{Lohrsträter_2017, title={Literaturüberblick über die Rolle von Business
Architecture in Enterprise Architecture}, publisher={Universität Paderborn}, author={Lohrsträter,
Lukas}, year={2017} }'
chicago: Lohrsträter, Lukas. Literaturüberblick über die Rolle von Business Architecture
in Enterprise Architecture. Universität Paderborn, 2017.
ieee: L. Lohrsträter, Literaturüberblick über die Rolle von Business Architecture
in Enterprise Architecture. Universität Paderborn, 2017.
mla: Lohrsträter, Lukas. Literaturüberblick über die Rolle von Business Architecture
in Enterprise Architecture. Universität Paderborn, 2017.
short: L. Lohrsträter, Literaturüberblick über die Rolle von Business Architecture
in Enterprise Architecture, Universität Paderborn, 2017.
date_created: 2017-10-17T12:41:08Z
date_updated: 2022-01-06T07:03:56Z
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: Literaturüberblick über die Rolle von Business Architecture in Enterprise Architecture
type: bachelorsthesis
user_id: '16205'
year: '2017'
...
---
_id: '86'
author:
- first_name: Laura
full_name: Niggemeyer, Laura
last_name: Niggemeyer
citation:
ama: Niggemeyer L. Kartellabsprachen und vertikale Preisbindungen - Eine wettbewerbspolitische
Analyse am Bespiel der Lebensmittelindustrie in Deutschland. Universität Paderborn;
2017.
apa: Niggemeyer, L. (2017). Kartellabsprachen und vertikale Preisbindungen -
Eine wettbewerbspolitische Analyse am Bespiel der Lebensmittelindustrie in Deutschland.
Universität Paderborn.
bibtex: '@book{Niggemeyer_2017, title={Kartellabsprachen und vertikale Preisbindungen
- Eine wettbewerbspolitische Analyse am Bespiel der Lebensmittelindustrie in Deutschland},
publisher={Universität Paderborn}, author={Niggemeyer, Laura}, year={2017} }'
chicago: Niggemeyer, Laura. Kartellabsprachen und vertikale Preisbindungen -
Eine wettbewerbspolitische Analyse am Bespiel der Lebensmittelindustrie in Deutschland.
Universität Paderborn, 2017.
ieee: L. Niggemeyer, Kartellabsprachen und vertikale Preisbindungen - Eine wettbewerbspolitische
Analyse am Bespiel der Lebensmittelindustrie in Deutschland. Universität Paderborn,
2017.
mla: Niggemeyer, Laura. Kartellabsprachen und vertikale Preisbindungen - Eine
wettbewerbspolitische Analyse am Bespiel der Lebensmittelindustrie in Deutschland.
Universität Paderborn, 2017.
short: L. Niggemeyer, Kartellabsprachen und vertikale Preisbindungen - Eine wettbewerbspolitische
Analyse am Bespiel der Lebensmittelindustrie in Deutschland, Universität Paderborn,
2017.
date_created: 2017-10-17T12:41:08Z
date_updated: 2022-01-06T07:03:57Z
department:
- _id: '280'
language:
- iso: ger
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: Kartellabsprachen und vertikale Preisbindungen - Eine wettbewerbspolitische
Analyse am Bespiel der Lebensmittelindustrie in Deutschland
type: bachelorsthesis
user_id: '42447'
year: '2017'
...
---
_id: '87'
abstract:
- lang: eng
text: Management of complex network services requires flexible and efficient service
provisioning as well as optimized handling of continuous changes in the workload
of the service.To adapt to changes in the demand, service components need to be
replicated (scaling) and allocated to physical resources (placement) dynamically.
In this paper, we propose a fullyautomated approach to the joint optimization
problem of scaling and placement, enabling quick reaction to changes. We formalize
the problem, analyze its complexity, and develop two algorithms to solve it. Extensive
empirical results show the applicability andeffectiveness of the proposed approach.
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
- first_name: Zoltan Adam
full_name: Mann, Zoltan Adam
last_name: Mann
citation:
ama: 'Dräxler S, Karl H, Mann ZA. Joint Optimization of Scaling and Placement of
Virtual Network Services. In: Proceedings of the 17th IEEE/ACM International
Symposium on Cluster, Cloud and Grid Computing (CCGrid 2017). ; 2017. doi:10.1109/CCGRID.2017.25'
apa: Dräxler, S., Karl, H., & Mann, Z. A. (2017). Joint Optimization of Scaling
and Placement of Virtual Network Services. In Proceedings of the 17th IEEE/ACM
International Symposium on Cluster, Cloud and Grid Computing (CCGrid 2017).
https://doi.org/10.1109/CCGRID.2017.25
bibtex: '@inproceedings{Dräxler_Karl_Mann_2017, title={Joint Optimization of Scaling
and Placement of Virtual Network Services}, DOI={10.1109/CCGRID.2017.25},
booktitle={Proceedings of the 17th IEEE/ACM International Symposium on Cluster,
Cloud and Grid Computing (CCGrid 2017)}, author={Dräxler, Sevil and Karl, Holger
and Mann, Zoltan Adam}, year={2017} }'
chicago: Dräxler, Sevil, Holger Karl, and Zoltan Adam Mann. “Joint Optimization
of Scaling and Placement of Virtual Network Services.” In Proceedings of the
17th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid
2017), 2017. https://doi.org/10.1109/CCGRID.2017.25.
ieee: S. Dräxler, H. Karl, and Z. A. Mann, “Joint Optimization of Scaling and Placement
of Virtual Network Services,” in Proceedings of the 17th IEEE/ACM International
Symposium on Cluster, Cloud and Grid Computing (CCGrid 2017), 2017.
mla: Dräxler, Sevil, et al. “Joint Optimization of Scaling and Placement of Virtual
Network Services.” Proceedings of the 17th IEEE/ACM International Symposium
on Cluster, Cloud and Grid Computing (CCGrid 2017), 2017, doi:10.1109/CCGRID.2017.25.
short: 'S. Dräxler, H. Karl, Z.A. Mann, in: Proceedings of the 17th IEEE/ACM International
Symposium on Cluster, Cloud and Grid Computing (CCGrid 2017), 2017.'
date_created: 2017-10-17T12:41:08Z
date_updated: 2022-01-06T07:03:59Z
ddc:
- '040'
department:
- _id: '75'
doi: 10.1109/CCGRID.2017.25
file:
- access_level: open_access
content_type: application/pdf
creator: sevilmeh
date_created: 2018-06-25T08:07:43Z
date_updated: 2018-06-25T08:07:43Z
file_id: '3324'
file_name: RIS.pdf
file_size: 2229109
relation: main_file
file_date_updated: 2018-06-25T08:07:43Z
has_accepted_license: '1'
oa: '1'
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: Proceedings of the 17th IEEE/ACM International Symposium on Cluster,
Cloud and Grid Computing (CCGrid 2017)
status: public
title: Joint Optimization of Scaling and Placement of Virtual Network Services
type: conference
urn: '873'
user_id: '31764'
year: '2017'
...
---
_id: '88'
author:
- first_name: Advait
full_name: Ganesh Athreya, Advait
last_name: Ganesh Athreya
citation:
ama: Ganesh Athreya A. Instantiating a Predicate Encryption Scheme via Pair Encodings.
Universität Paderborn; 2017.
apa: Ganesh Athreya, A. (2017). Instantiating a Predicate Encryption Scheme via
Pair Encodings. Universität Paderborn.
bibtex: '@book{Ganesh Athreya_2017, title={Instantiating a Predicate Encryption
Scheme via Pair Encodings}, publisher={Universität Paderborn}, author={Ganesh
Athreya, Advait}, year={2017} }'
chicago: Ganesh Athreya, Advait. Instantiating a Predicate Encryption Scheme
via Pair Encodings. Universität Paderborn, 2017.
ieee: A. Ganesh Athreya, Instantiating a Predicate Encryption Scheme via Pair
Encodings. Universität Paderborn, 2017.
mla: Ganesh Athreya, Advait. Instantiating a Predicate Encryption Scheme via
Pair Encodings. Universität Paderborn, 2017.
short: A. Ganesh Athreya, Instantiating a Predicate Encryption Scheme via Pair Encodings,
Universität Paderborn, 2017.
date_created: 2017-10-17T12:41:08Z
date_updated: 2022-01-06T07:04:02Z
department:
- _id: '64'
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
title: Instantiating a Predicate Encryption Scheme via Pair Encodings
type: bachelorsthesis
user_id: '477'
year: '2017'
...
---
_id: '89'
abstract:
- lang: eng
text: The vision of OTF Computing is to have the software needs of end users in
the future covered by an automatic composition of existing software services.
Here we focus on natural language software requirements that end users formulate
and submit to OTF providers as requirement specifications. These requirements
serve as the sole foundation for the composition of software; but they can be
inaccurate and incomplete. Up to now, software developers have identified and
corrected these deficits by using a bidirectional consolidation process. However,
this type of quality assurance is no longer included in OTF Computing - the classic
consolidation process is dropped. This is where this work picks up, dealing with
the inaccuracies of freely formulated software design requirements. To do this,
we developed the CORDULA (Compensation of Requirements Descriptions Using Linguistic
Analysis) system that recognizes and compensates for language deficiencies (e.g.,
ambiguity, vagueness and incompleteness) in requirements written by inexperienced
end users. CORDULA supports the search for suitable software services that can
be combined in a composition by transferring requirement specifications into canonical
core functionalities. This dissertation provides the first-ever method for holistically
recording and improving language deficiencies in user-generated requirement specifications
by dealing with ambiguity, incompleteness and vagueness in parallel and in sequence.
author:
- first_name: Frederik Simon
full_name: Bäumer, Frederik Simon
id: '38837'
last_name: Bäumer
citation:
ama: Bäumer FS. Indikatorbasierte Erkennung und Kompensation von ungenauen und
unvollständig beschriebenen Softwareanforderungen. Universität Paderborn;
2017. doi:10.17619/UNIPB/1-157
apa: Bäumer, F. S. (2017). Indikatorbasierte Erkennung und Kompensation von ungenauen
und unvollständig beschriebenen Softwareanforderungen. Universität Paderborn.
https://doi.org/10.17619/UNIPB/1-157
bibtex: '@book{Bäumer_2017, title={Indikatorbasierte Erkennung und Kompensation
von ungenauen und unvollständig beschriebenen Softwareanforderungen}, DOI={10.17619/UNIPB/1-157}, publisher={Universität
Paderborn}, author={Bäumer, Frederik Simon}, year={2017} }'
chicago: Bäumer, Frederik Simon. Indikatorbasierte Erkennung und Kompensation
von ungenauen und unvollständig beschriebenen Softwareanforderungen. Universität
Paderborn, 2017. https://doi.org/10.17619/UNIPB/1-157.
ieee: F. S. Bäumer, Indikatorbasierte Erkennung und Kompensation von ungenauen
und unvollständig beschriebenen Softwareanforderungen. Universität Paderborn,
2017.
mla: Bäumer, Frederik Simon. Indikatorbasierte Erkennung und Kompensation von
ungenauen und unvollständig beschriebenen Softwareanforderungen. Universität
Paderborn, 2017, doi:10.17619/UNIPB/1-157.
short: F.S. Bäumer, Indikatorbasierte Erkennung und Kompensation von ungenauen und
unvollständig beschriebenen Softwareanforderungen, Universität Paderborn, 2017.
date_created: 2017-10-17T12:41:08Z
date_updated: 2022-01-06T07:04:05Z
department:
- _id: '579'
- _id: '36'
- _id: '1'
doi: 10.17619/UNIPB/1-157
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '9'
name: SFB 901 - Subprojekt B1
- _id: '3'
name: SFB 901 - Project Area B
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Michaela
full_name: Geierhos, Michaela
id: '42496'
last_name: Geierhos
orcid: 0000-0002-8180-5606
title: Indikatorbasierte Erkennung und Kompensation von ungenauen und unvollständig
beschriebenen Softwareanforderungen
type: dissertation
user_id: '14931'
year: '2017'
...
---
_id: '96'
author:
- first_name: Markus
full_name: Warkentin, Markus
last_name: Warkentin
citation:
ama: Warkentin M. Geschäftsmodell-Frameworks zur Analyse und Klassifikation bestehender
Geschäftsmodelle. Universität Paderborn; 2017.
apa: Warkentin, M. (2017). Geschäftsmodell-Frameworks zur Analyse und Klassifikation
bestehender Geschäftsmodelle. Universität Paderborn.
bibtex: '@book{Warkentin_2017, title={Geschäftsmodell-Frameworks zur Analyse und
Klassifikation bestehender Geschäftsmodelle}, publisher={Universität Paderborn},
author={Warkentin, Markus}, year={2017} }'
chicago: Warkentin, Markus. Geschäftsmodell-Frameworks zur Analyse und Klassifikation
bestehender Geschäftsmodelle. Universität Paderborn, 2017.
ieee: M. Warkentin, Geschäftsmodell-Frameworks zur Analyse und Klassifikation
bestehender Geschäftsmodelle. Universität Paderborn, 2017.
mla: Warkentin, Markus. Geschäftsmodell-Frameworks zur Analyse und Klassifikation
bestehender Geschäftsmodelle. Universität Paderborn, 2017.
short: M. Warkentin, Geschäftsmodell-Frameworks zur Analyse und Klassifikation bestehender
Geschäftsmodelle, Universität Paderborn, 2017.
date_created: 2017-10-17T12:41:10Z
date_updated: 2022-01-06T07:04:16Z
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '17'
name: SFB 901 - Subproject C5
- _id: '4'
name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
title: Geschäftsmodell-Frameworks zur Analyse und Klassifikation bestehender Geschäftsmodelle
type: bachelorsthesis
user_id: '16205'
year: '2017'
...
---
_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: '98'
abstract:
- lang: eng
text: Today, modern IT-systems are often an interplay of third-party web services.
Developers in their role as requesters integrate existing services of different
providers into new IT-systems. Providers use frameworks like Open API to create
syntactic service specifications from which requesters generate code to integrate
services. Proper service discovery is crucial to identify usable services in the
growing plethora of third-party services. Most advanced service discovery approaches
rely on semantic specifications, e.g., OWL-S. While semantic specification is
crucial for a precise discovery, syntactical specification is needed for service
invocation. To close the gap between semantic and syntactic specifications, service
grounding establishes links between the semantic and syntactic specifications.
However, for a large number of web services still no semantic specification or
grounding exists. In this paper, we present an approach that semi-automates the
semantic specification of web services for service providers and additionally
helps service requesters to leverage semantic web services. Our approach enables
a higher degree of automation than other approaches. This includes the creation
of semantic specifications and service groundings for service providers as well
as the integration of services for requesters by using our code generator. As
proof-of-concept, we provide a case study, where we derive a sophisticated semantic
OWL-S specification from a syntactic Open API specification.
author:
- first_name: Simon
full_name: Schwichtenberg, Simon
id: '13235'
last_name: Schwichtenberg
- first_name: Christian
full_name: Gerth, Christian
last_name: Gerth
- first_name: Gregor
full_name: Engels, Gregor
id: '107'
last_name: Engels
citation:
ama: 'Schwichtenberg S, Gerth C, Engels G. From Open API to Semantic Specifications
and Code Adapters. In: Proceedings of the 24th IEEE International Conference
on Web Services (ICWS). ; 2017:484--491.'
apa: Schwichtenberg, S., Gerth, C., & Engels, G. (2017). From Open API to Semantic
Specifications and Code Adapters. In Proceedings of the 24th IEEE International
Conference on Web Services (ICWS) (pp. 484--491).
bibtex: '@inproceedings{Schwichtenberg_Gerth_Engels_2017, title={From Open API to
Semantic Specifications and Code Adapters}, booktitle={Proceedings of the 24th
IEEE International Conference on Web Services (ICWS)}, author={Schwichtenberg,
Simon and Gerth, Christian and Engels, Gregor}, year={2017}, pages={484--491}
}'
chicago: Schwichtenberg, Simon, Christian Gerth, and Gregor Engels. “From Open API
to Semantic Specifications and Code Adapters.” In Proceedings of the 24th IEEE
International Conference on Web Services (ICWS), 484--491, 2017.
ieee: S. Schwichtenberg, C. Gerth, and G. Engels, “From Open API to Semantic Specifications
and Code Adapters,” in Proceedings of the 24th IEEE International Conference
on Web Services (ICWS), 2017, pp. 484--491.
mla: Schwichtenberg, Simon, et al. “From Open API to Semantic Specifications and
Code Adapters.” Proceedings of the 24th IEEE International Conference on Web
Services (ICWS), 2017, pp. 484--491.
short: 'S. Schwichtenberg, C. Gerth, G. Engels, in: Proceedings of the 24th IEEE
International Conference on Web Services (ICWS), 2017, pp. 484--491.'
date_created: 2017-10-17T12:41:10Z
date_updated: 2022-01-06T07:04:21Z
ddc:
- '000'
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2019-01-11T10:40:48Z
date_updated: 2019-01-11T10:40:48Z
file_id: '6622'
file_name: 08029798.pdf
file_size: 1425640
relation: main_file
success: 1
file_date_updated: 2019-01-11T10:40:48Z
has_accepted_license: '1'
language:
- iso: eng
page: 484--491
project:
- _id: '1'
name: SFB 901
- _id: '9'
name: SFB 901 - Subprojekt B1
- _id: '3'
name: SFB 901 - Project Area B
publication: Proceedings of the 24th IEEE International Conference on Web Services
(ICWS)
status: public
title: From Open API to Semantic Specifications and Code Adapters
type: conference
user_id: '477'
year: '2017'
...
---
_id: '981'
abstract:
- lang: eng
text: "Benchmarking and profiling virtual network functions (VNFs) generates input\r\nknowledge
for resource management decisions taken by \r\nmanagement and orchestration systems.
\r\nSuch VNFs are usually not executed in isolation but are often deployed as
part of a service function chain (SFC) that connects single functions into complex
\r\nstructures. To manage such chains, isolated performance\r\nprofiles of single
functions have to be combined to get insights into \r\nthe overall behavior of
an SFC. This becomes particularly\r\nchallenging in highly agile DevOps environments
in which profiling\r\nprocesses need to be fully automated and detailed insights
about a chain's\r\ninternal structures are not always available. \r\n\r\nIn this
paper, we introduce a\r\nfully automatable, flexible, and platform-agnostic profiling\r\nsystem
that allows to profile entire SFCs at once. This obviates \r\nmanual modeling
procedures to combine profiling results from single\r\nVNFs to reflect SFC performance.
\r\nWe use a case study with different SFC configurations to show that it\r\nis
hard to model the resulting SFC performance based on single-VNF measurements and
that\r\nperformance interactions between real, non-trivial functions that are
deployed in a\r\nchain exist. "
author:
- first_name: Manuel
full_name: Peuster, Manuel
id: '13271'
last_name: Peuster
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: 'Peuster M, Karl H. Profile Your Chains, Not Functions. Automated Network Service
Profiling in DevOps Environments. In: IEEE Conference on Network Function Virtualisation
and Software Defined Networks (NFV-SDN). Berlin; 2017. doi:10.1109/NFV-SDN.2017.8169826'
apa: Peuster, M., & Karl, H. (2017). Profile Your Chains, Not Functions. Automated
Network Service Profiling in DevOps Environments. In IEEE Conference on Network
Function Virtualisation and Software Defined Networks (NFV-SDN). Berlin. https://doi.org/10.1109/NFV-SDN.2017.8169826
bibtex: '@inproceedings{Peuster_Karl_2017, place={Berlin}, title={Profile Your Chains,
Not Functions. Automated Network Service Profiling in DevOps Environments}, DOI={10.1109/NFV-SDN.2017.8169826},
booktitle={IEEE Conference on Network Function Virtualisation and Software Defined
Networks (NFV-SDN)}, author={Peuster, Manuel and Karl, Holger}, year={2017} }'
chicago: Peuster, Manuel, and Holger Karl. “Profile Your Chains, Not Functions.
Automated Network Service Profiling in DevOps Environments.” In IEEE Conference
on Network Function Virtualisation and Software Defined Networks (NFV-SDN).
Berlin, 2017. https://doi.org/10.1109/NFV-SDN.2017.8169826.
ieee: M. Peuster and H. Karl, “Profile Your Chains, Not Functions. Automated Network
Service Profiling in DevOps Environments,” in IEEE Conference on Network Function
Virtualisation and Software Defined Networks (NFV-SDN), Berlin, 2017.
mla: Peuster, Manuel, and Holger Karl. “Profile Your Chains, Not Functions. Automated
Network Service Profiling in DevOps Environments.” IEEE Conference on Network
Function Virtualisation and Software Defined Networks (NFV-SDN), 2017, doi:10.1109/NFV-SDN.2017.8169826.
short: 'M. Peuster, H. Karl, in: IEEE Conference on Network Function Virtualisation
and Software Defined Networks (NFV-SDN), Berlin, 2017.'
conference:
location: Berlin
name: IEEE Conference on Network Function Virtualisation and Software Defined Networks
(NFV-SDN)
date_created: 2017-11-27T10:22:29Z
date_updated: 2022-01-06T07:04:22Z
ddc:
- '004'
department:
- _id: '75'
doi: 10.1109/NFV-SDN.2017.8169826
file:
- access_level: open_access
content_type: application/pdf
creator: peuster
date_created: 2018-07-05T11:14:00Z
date_updated: 2018-07-05T11:14:00Z
file_id: '3431'
file_name: main_ris.pdf
file_size: 2642306
relation: main_file
file_date_updated: 2018-07-05T11:14:00Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
place: Berlin
project:
- _id: '25'
call_identifier: 5G PPP Phase 1
grant_number: '671517'
name: 'SONATA NFV: Agile Service Development and Orchestration in 5G Virtualized
Networks'
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '16'
name: SFB 901 - Subproject C4
publication: IEEE Conference on Network Function Virtualisation and Software Defined
Networks (NFV-SDN)
publication_status: published
status: public
title: Profile Your Chains, Not Functions. Automated Network Service Profiling in
DevOps Environments
type: conference
urn: '9810'
user_id: '13271'
year: '2017'
...
---
_id: '99'
accept: '1'
author:
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Wehrheim H. Fault localization in service compositions. In: Proceedings
of the 14th International Conference on Formal Aspects of Component Software (FACS).
LNCS. ; 2017.'
apa: Wehrheim, H. (2017). Fault localization in service compositions. In Proceedings
of the 14th International Conference on Formal Aspects of Component Software (FACS).
bibtex: '@inproceedings{Wehrheim_2017, series={LNCS}, title={Fault localization
in service compositions}, booktitle={Proceedings of the 14th International Conference
on Formal Aspects of Component Software (FACS)}, author={Wehrheim, Heike}, year={2017},
collection={LNCS} }'
chicago: Wehrheim, Heike. “Fault Localization in Service Compositions.” In Proceedings
of the 14th International Conference on Formal Aspects of Component Software (FACS).
LNCS, 2017.
ieee: H. Wehrheim, “Fault localization in service compositions,” in Proceedings
of the 14th International Conference on Formal Aspects of Component Software (FACS),
2017.
mla: Wehrheim, Heike. “Fault Localization in Service Compositions.” Proceedings
of the 14th International Conference on Formal Aspects of Component Software (FACS),
2017.
short: 'H. Wehrheim, in: Proceedings of the 14th International Conference on Formal
Aspects of Component Software (FACS), 2017.'
date_created: 2017-10-17T12:41:10Z
date_updated: 2019-01-03T13:18:56Z
ddc:
- '000'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-11-21T10:51:33Z
date_updated: 2018-11-21T10:51:33Z
file_id: '5784'
file_name: Wehrheim2017_Chapter_FaultLocalizationInServiceComp.pdf
file_size: 536429
open_access: 1
relation: main_file
success: 1
file_date_updated: 2018-11-21T10:51:33Z
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '11'
name: SFB 901 - Subprojekt B3
- _id: '3'
name: SFB 901 - Project Area B
publication: Proceedings of the 14th International Conference on Formal Aspects of
Component Software (FACS)
series_title: LNCS
status: public
title: Fault localization in service compositions
type: conference
user_id: '15504'
year: '2017'
...
---
_id: '50'
author:
- first_name: Erna
full_name: Hamdeev, Erna
last_name: Hamdeev
citation:
ama: Hamdeev E. Verzerrte Online-Produktbewertungen - Literaturüberblick.
Universität Paderborn; 2017.
apa: Hamdeev, E. (2017). Verzerrte Online-Produktbewertungen - Literaturüberblick.
Universität Paderborn.
bibtex: '@book{Hamdeev_2017, title={Verzerrte Online-Produktbewertungen - Literaturüberblick},
publisher={Universität Paderborn}, author={Hamdeev, Erna}, year={2017} }'
chicago: Hamdeev, Erna. Verzerrte Online-Produktbewertungen - Literaturüberblick.
Universität Paderborn, 2017.
ieee: E. Hamdeev, Verzerrte Online-Produktbewertungen - Literaturüberblick.
Universität Paderborn, 2017.
mla: Hamdeev, Erna. Verzerrte Online-Produktbewertungen - Literaturüberblick.
Universität Paderborn, 2017.
short: E. Hamdeev, Verzerrte Online-Produktbewertungen - Literaturüberblick, Universität
Paderborn, 2017.
date_created: 2017-10-17T12:41:00Z
date_updated: 2022-01-06T07:01:34Z
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '8'
name: SFB 901 - Subprojekt A4
- _id: '2'
name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
title: Verzerrte Online-Produktbewertungen - Literaturüberblick
type: bachelorsthesis
user_id: '477'
year: '2017'
...
---
_id: '5084'
author:
- first_name: Thomas
full_name: Streck, Thomas
id: '33041'
last_name: Streck
citation:
ama: Streck T. How to Adequately Relocate Asylum Applicants within the European
Union - An Attempt to Apply Matching Theory in the Current Migration Crisis.
Universität Paderborn; 2017.
apa: Streck, T. (2017). How to adequately relocate asylum applicants within the
European Union - An attempt to apply matching theory in the current migration
crisis. Universität Paderborn.
bibtex: '@book{Streck_2017, title={How to adequately relocate asylum applicants
within the European Union - An attempt to apply matching theory in the current
migration crisis}, publisher={Universität Paderborn}, author={Streck, Thomas},
year={2017} }'
chicago: Streck, Thomas. How to Adequately Relocate Asylum Applicants within
the European Union - An Attempt to Apply Matching Theory in the Current Migration
Crisis. Universität Paderborn, 2017.
ieee: T. Streck, How to adequately relocate asylum applicants within the European
Union - An attempt to apply matching theory in the current migration crisis.
Universität Paderborn, 2017.
mla: Streck, Thomas. How to Adequately Relocate Asylum Applicants within the
European Union - An Attempt to Apply Matching Theory in the Current Migration
Crisis. Universität Paderborn, 2017.
short: T. Streck, How to Adequately Relocate Asylum Applicants within the European
Union - An Attempt to Apply Matching Theory in the Current Migration Crisis, Universität
Paderborn, 2017.
date_created: 2018-10-30T14:51:20Z
date_updated: 2022-01-06T07:01:37Z
department:
- _id: '205'
language:
- iso: eng
project:
- _id: '7'
name: SFB 901 - Subproject A3
- _id: '2'
name: SFB 901 - Project Area A
- _id: '1'
name: SFB 901
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Claus-Jochen
full_name: Haake, Claus-Jochen
id: '20801'
last_name: Haake
title: How to adequately relocate asylum applicants within the European Union - An
attempt to apply matching theory in the current migration crisis
type: mastersthesis
user_id: '477'
year: '2017'
...