---
_id: '8059'
author:
- first_name: Gregor
full_name: Engels, Gregor
id: '107'
last_name: Engels
citation:
ama: 'Engels G. On-the-Fly Computing - Das Entwicklungs- und Betriebsparadigma für
Softwaresysteme der Zukunft. In: Software Engineering 2013. Vol P-213.
LNI. ; 2013:17-18.'
apa: Engels, G. (2013). On-the-Fly Computing - Das Entwicklungs- und Betriebsparadigma
für Softwaresysteme der Zukunft. In Software Engineering 2013 (Vol. P-213,
pp. 17–18).
bibtex: '@inproceedings{Engels_2013, series={LNI}, title={On-the-Fly Computing -
Das Entwicklungs- und Betriebsparadigma für Softwaresysteme der Zukunft}, volume={P-213},
booktitle={Software Engineering 2013}, author={Engels, Gregor}, year={2013}, pages={17–18},
collection={LNI} }'
chicago: Engels, Gregor. “On-the-Fly Computing - Das Entwicklungs- Und Betriebsparadigma
Für Softwaresysteme Der Zukunft.” In Software Engineering 2013, P-213:17–18.
LNI, 2013.
ieee: G. Engels, “On-the-Fly Computing - Das Entwicklungs- und Betriebsparadigma
für Softwaresysteme der Zukunft,” in Software Engineering 2013, 2013, vol.
P-213, pp. 17–18.
mla: Engels, Gregor. “On-the-Fly Computing - Das Entwicklungs- Und Betriebsparadigma
Für Softwaresysteme Der Zukunft.” Software Engineering 2013, vol. P-213,
2013, pp. 17–18.
short: 'G. Engels, in: Software Engineering 2013, 2013, pp. 17–18.'
date_created: 2019-02-21T21:09:31Z
date_updated: 2022-01-06T07:03:50Z
department:
- _id: '66'
language:
- iso: eng
page: 17-18
publication: Software Engineering 2013
series_title: LNI
status: public
title: On-the-Fly Computing - Das Entwicklungs- und Betriebsparadigma für Softwaresysteme
der Zukunft
type: conference
user_id: '52534'
volume: P-213
year: '2013'
...
---
_id: '8060'
author:
- first_name: Zille
full_name: Huma, Zille
last_name: Huma
- first_name: Christian
full_name: Gerth, Christian
last_name: Gerth
- first_name: Gregor
full_name: Engels, Gregor
id: '107'
last_name: Engels
- first_name: Oliver
full_name: Juwig, Oliver
last_name: Juwig
citation:
ama: 'Huma Z, Gerth C, Engels G, Juwig O. Automated Service Composition for On-the-Fly
SOAs. In: Proceedings of the 11th International Conference on Service Oriented
Computing (ICSOC’13). Vol 8274. LNCS . Berlin/Heidelberg: Springer-Verlag;
2013:524-532.'
apa: 'Huma, Z., Gerth, C., Engels, G., & Juwig, O. (2013). Automated Service
Composition for On-the-Fly SOAs. In Proceedings of the 11th International Conference
on Service Oriented Computing (ICSOC’13) (Vol. 8274, pp. 524–532). Berlin/Heidelberg:
Springer-Verlag.'
bibtex: '@inproceedings{Huma_Gerth_Engels_Juwig_2013, place={Berlin/Heidelberg},
series={LNCS }, title={Automated Service Composition for On-the-Fly SOAs}, volume={8274},
booktitle={Proceedings of the 11th International Conference on Service Oriented
Computing (ICSOC’13)}, publisher={Springer-Verlag}, author={Huma, Zille and Gerth,
Christian and Engels, Gregor and Juwig, Oliver}, year={2013}, pages={524–532},
collection={LNCS } }'
chicago: 'Huma, Zille, Christian Gerth, Gregor Engels, and Oliver Juwig. “Automated
Service Composition for On-the-Fly SOAs.” In Proceedings of the 11th International
Conference on Service Oriented Computing (ICSOC’13), 8274:524–32. LNCS . Berlin/Heidelberg:
Springer-Verlag, 2013.'
ieee: Z. Huma, C. Gerth, G. Engels, and O. Juwig, “Automated Service Composition
for On-the-Fly SOAs,” in Proceedings of the 11th International Conference on
Service Oriented Computing (ICSOC’13), 2013, vol. 8274, pp. 524–532.
mla: Huma, Zille, et al. “Automated Service Composition for On-the-Fly SOAs.” Proceedings
of the 11th International Conference on Service Oriented Computing (ICSOC’13),
vol. 8274, Springer-Verlag, 2013, pp. 524–32.
short: 'Z. Huma, C. Gerth, G. Engels, O. Juwig, in: Proceedings of the 11th International
Conference on Service Oriented Computing (ICSOC’13), Springer-Verlag, Berlin/Heidelberg,
2013, pp. 524–532.'
date_created: 2019-02-21T21:09:33Z
date_updated: 2022-01-06T07:03:50Z
department:
- _id: '66'
intvolume: ' 8274'
language:
- iso: eng
page: 524-532
place: Berlin/Heidelberg
publication: Proceedings of the 11th International Conference on Service Oriented
Computing (ICSOC'13)
publisher: Springer-Verlag
series_title: 'LNCS '
status: public
title: Automated Service Composition for On-the-Fly SOAs
type: conference
user_id: '52534'
volume: 8274
year: '2013'
...
---
_id: '8061'
author:
- first_name: Markus
full_name: Luckey, Markus
last_name: Luckey
- first_name: Gregor
full_name: Engels, Gregor
id: '107'
last_name: Engels
citation:
ama: 'Luckey M, Engels G. High-Quality Specification of Self-Adaptive Software
Systems. In: Proceeding of the 8th International Symposium on Software Engineering
for Adaptive and Self-Managing Systems. SEAMS ’13. New York, NY, USA: ACM;
2013:143-152.'
apa: 'Luckey, M., & Engels, G. (2013). High-Quality Specification of Self-Adaptive
Software Systems. In Proceeding of the 8th international symposium on Software
engineering for adaptive and self-managing systems (pp. 143–152). New York,
NY, USA: ACM.'
bibtex: '@inproceedings{Luckey_Engels_2013, place={New York, NY, USA}, series={SEAMS
’13}, title={High-Quality Specification of Self-Adaptive Software Systems},
booktitle={Proceeding of the 8th international symposium on Software engineering
for adaptive and self-managing systems}, publisher={ACM}, author={Luckey, Markus
and Engels, Gregor}, year={2013}, pages={143–152}, collection={SEAMS ’13} }'
chicago: 'Luckey, Markus, and Gregor Engels. “High-Quality Specification of Self-Adaptive
Software Systems.” In Proceeding of the 8th International Symposium on Software
Engineering for Adaptive and Self-Managing Systems, 143–52. SEAMS ’13. New
York, NY, USA: ACM, 2013.'
ieee: M. Luckey and G. Engels, “High-Quality Specification of Self-Adaptive Software
Systems,” in Proceeding of the 8th international symposium on Software engineering
for adaptive and self-managing systems, 2013, pp. 143–152.
mla: Luckey, Markus, and Gregor Engels. “High-Quality Specification of Self-Adaptive
Software Systems.” Proceeding of the 8th International Symposium on Software
Engineering for Adaptive and Self-Managing Systems, ACM, 2013, pp. 143–52.
short: 'M. Luckey, G. Engels, in: Proceeding of the 8th International Symposium
on Software Engineering for Adaptive and Self-Managing Systems, ACM, New York,
NY, USA, 2013, pp. 143–152.'
date_created: 2019-02-21T21:09:34Z
date_updated: 2022-01-06T07:03:50Z
department:
- _id: '66'
language:
- iso: eng
page: 143-152
place: New York, NY, USA
publication: Proceeding of the 8th international symposium on Software engineering
for adaptive and self-managing systems
publisher: ACM
related_material:
link:
- relation: confirmation
url: http://dl.acm.org/citation.cfm?id=2487336.2487359
series_title: SEAMS '13
status: public
title: High-Quality Specification of Self-Adaptive Software Systems
type: conference
user_id: '52534'
year: '2013'
...
---
_id: '8062'
author:
- first_name: Frank
full_name: Brüseke, Frank
last_name: Brüseke
- first_name: Steffen
full_name: Becker, Steffen
last_name: Becker
- first_name: Gregor
full_name: Engels, Gregor
id: '107'
last_name: Engels
citation:
ama: 'Brüseke F, Becker S, Engels G. Decision Support via Automated Metric Comparison
for the Palladio-based Performance Blame Analysis. In: Proceedings of the 4th
ACM/SPEC International Conference on Performance Engineering (ICPE 2013), Prague
(Czech Republic). ACM New York, NY, USA; 2013:77-88.'
apa: Brüseke, F., Becker, S., & Engels, G. (2013). Decision Support via Automated
Metric Comparison for the Palladio-based Performance Blame Analysis. In Proceedings
of the 4th ACM/SPEC International Conference on Performance Engineering (ICPE
2013), Prague (Czech Republic) (pp. 77–88). ACM New York, NY, USA.
bibtex: '@inproceedings{Brüseke_Becker_Engels_2013, title={Decision Support via
Automated Metric Comparison for the Palladio-based Performance Blame Analysis},
booktitle={Proceedings of the 4th ACM/SPEC International Conference on Performance
Engineering (ICPE 2013), Prague (Czech Republic)}, publisher={ACM New York, NY,
USA}, author={Brüseke, Frank and Becker, Steffen and Engels, Gregor}, year={2013},
pages={77–88} }'
chicago: Brüseke, Frank, Steffen Becker, and Gregor Engels. “Decision Support via
Automated Metric Comparison for the Palladio-Based Performance Blame Analysis.”
In Proceedings of the 4th ACM/SPEC International Conference on Performance
Engineering (ICPE 2013), Prague (Czech Republic), 77–88. ACM New York, NY,
USA, 2013.
ieee: F. Brüseke, S. Becker, and G. Engels, “Decision Support via Automated Metric
Comparison for the Palladio-based Performance Blame Analysis,” in Proceedings
of the 4th ACM/SPEC International Conference on Performance Engineering (ICPE
2013), Prague (Czech Republic), 2013, pp. 77–88.
mla: Brüseke, Frank, et al. “Decision Support via Automated Metric Comparison for
the Palladio-Based Performance Blame Analysis.” Proceedings of the 4th ACM/SPEC
International Conference on Performance Engineering (ICPE 2013), Prague (Czech
Republic), ACM New York, NY, USA, 2013, pp. 77–88.
short: 'F. Brüseke, S. Becker, G. Engels, in: Proceedings of the 4th ACM/SPEC International
Conference on Performance Engineering (ICPE 2013), Prague (Czech Republic), ACM
New York, NY, USA, 2013, pp. 77–88.'
date_created: 2019-02-21T21:09:35Z
date_updated: 2022-01-06T07:03:50Z
department:
- _id: '66'
language:
- iso: eng
page: 77-88
publication: Proceedings of the 4th ACM/SPEC International Conference on Performance
Engineering (ICPE 2013), Prague (Czech Republic)
publisher: ACM New York, NY, USA
status: public
title: Decision Support via Automated Metric Comparison for the Palladio-based Performance
Blame Analysis
type: conference
user_id: '52534'
year: '2013'
...
---
_id: '8063'
author:
- first_name: Matthias
full_name: Becker, Matthias
last_name: Becker
- first_name: Markus
full_name: Luckey, Markus
last_name: Luckey
- first_name: Steffen
full_name: Becker, Steffen
last_name: Becker
citation:
ama: 'Becker M, Luckey M, Becker S. Performance Analysis of Self-Adaptive Systems
for Requirements Validation at Design-Time. In: Ninth International ACM Sigsoft
Conference on the Quality of Software Architectures. QoSA 2013. New York,
NY, USA: ACM New York, NY, USA; 2013:43-52.'
apa: 'Becker, M., Luckey, M., & Becker, S. (2013). Performance Analysis of Self-Adaptive
Systems for Requirements Validation at Design-Time. In Ninth International
ACM Sigsoft Conference on the Quality of Software Architectures (pp. 43–52).
New York, NY, USA: ACM New York, NY, USA.'
bibtex: '@inproceedings{Becker_Luckey_Becker_2013, place={New York, NY, USA}, series={QoSA
2013}, title={Performance Analysis of Self-Adaptive Systems for Requirements Validation
at Design-Time}, booktitle={Ninth International ACM Sigsoft Conference on the
Quality of Software Architectures}, publisher={ACM New York, NY, USA}, author={Becker,
Matthias and Luckey, Markus and Becker, Steffen}, year={2013}, pages={43–52},
collection={QoSA 2013} }'
chicago: 'Becker, Matthias, Markus Luckey, and Steffen Becker. “Performance Analysis
of Self-Adaptive Systems for Requirements Validation at Design-Time.” In Ninth
International ACM Sigsoft Conference on the Quality of Software Architectures,
43–52. QoSA 2013. New York, NY, USA: ACM New York, NY, USA, 2013.'
ieee: M. Becker, M. Luckey, and S. Becker, “Performance Analysis of Self-Adaptive
Systems for Requirements Validation at Design-Time,” in Ninth International
ACM Sigsoft Conference on the Quality of Software Architectures, 2013, pp.
43–52.
mla: Becker, Matthias, et al. “Performance Analysis of Self-Adaptive Systems for
Requirements Validation at Design-Time.” Ninth International ACM Sigsoft Conference
on the Quality of Software Architectures, ACM New York, NY, USA, 2013, pp.
43–52.
short: 'M. Becker, M. Luckey, S. Becker, in: Ninth International ACM Sigsoft Conference
on the Quality of Software Architectures, ACM New York, NY, USA, New York, NY,
USA, 2013, pp. 43–52.'
date_created: 2019-02-21T21:09:36Z
date_updated: 2022-01-06T07:03:50Z
department:
- _id: '66'
language:
- iso: eng
page: 43-52
place: New York, NY, USA
publication: Ninth International ACM Sigsoft Conference on the Quality of Software
Architectures
publisher: ACM New York, NY, USA
series_title: QoSA 2013
status: public
title: Performance Analysis of Self-Adaptive Systems for Requirements Validation at
Design-Time
type: conference
user_id: '52534'
year: '2013'
...
---
_id: '8222'
author:
- first_name: Jochen
full_name: Küster, Jochen
last_name: Küster
- first_name: Dániel
full_name: Kovács, Dániel
last_name: Kovács
- first_name: Eduard
full_name: Bauer, Eduard
last_name: Bauer
- first_name: Christian
full_name: Gerth, Christian
last_name: Gerth
citation:
ama: 'Küster J, Kovács D, Bauer E, Gerth C. Integrating Coverage Analysis into
Test-Driven Development of Model Transformations. Zurich: IBM Research; 2013.'
apa: 'Küster, J., Kovács, D., Bauer, E., & Gerth, C. (2013). Integrating
Coverage Analysis into Test-driven Development of Model Transformations. Zurich:
IBM Research.'
bibtex: '@book{Küster_Kovács_Bauer_Gerth_2013, place={Zurich}, series={IBM Research
Report}, title={Integrating Coverage Analysis into Test-driven Development of
Model Transformations}, publisher={IBM Research}, author={Küster, Jochen and Kovács,
Dániel and Bauer, Eduard and Gerth, Christian}, year={2013}, collection={IBM Research
Report} }'
chicago: 'Küster, Jochen, Dániel Kovács, Eduard Bauer, and Christian Gerth. Integrating
Coverage Analysis into Test-Driven Development of Model Transformations. IBM
Research Report. Zurich: IBM Research, 2013.'
ieee: 'J. Küster, D. Kovács, E. Bauer, and C. Gerth, Integrating Coverage Analysis
into Test-driven Development of Model Transformations. Zurich: IBM Research,
2013.'
mla: Küster, Jochen, et al. Integrating Coverage Analysis into Test-Driven Development
of Model Transformations. IBM Research, 2013.
short: J. Küster, D. Kovács, E. Bauer, C. Gerth, Integrating Coverage Analysis into
Test-Driven Development of Model Transformations, IBM Research, Zurich, 2013.
date_created: 2019-03-03T16:13:22Z
date_updated: 2022-01-06T07:03:52Z
department:
- _id: '66'
language:
- iso: eng
place: Zurich
publisher: IBM Research
report_number: RZ 3846
series_title: IBM Research Report
status: public
title: Integrating Coverage Analysis into Test-driven Development of Model Transformations
type: report
user_id: '52534'
year: '2013'
...
---
_id: '8223'
author:
- first_name: Zille
full_name: Huma, Zille
last_name: Huma
- first_name: Christian
full_name: Gerth, Christian
last_name: Gerth
- first_name: Gregor
full_name: Engels, Gregor
id: '107'
last_name: Engels
citation:
ama: Huma Z, Gerth C, Engels G. Automated Service Discovery and Composition for
On-the-Fly SOAs. University of Paderborn, Germany; 2013.
apa: Huma, Z., Gerth, C., & Engels, G. (2013). Automated Service Discovery
and Composition for On-the-Fly SOAs. University of Paderborn, Germany.
bibtex: '@book{Huma_Gerth_Engels_2013, title={Automated Service Discovery and Composition
for On-the-Fly SOAs}, publisher={University of Paderborn, Germany}, author={Huma,
Zille and Gerth, Christian and Engels, Gregor}, year={2013} }'
chicago: Huma, Zille, Christian Gerth, and Gregor Engels. Automated Service Discovery
and Composition for On-the-Fly SOAs. University of Paderborn, Germany, 2013.
ieee: Z. Huma, C. Gerth, and G. Engels, Automated Service Discovery and Composition
for On-the-Fly SOAs. University of Paderborn, Germany, 2013.
mla: Huma, Zille, et al. Automated Service Discovery and Composition for On-the-Fly
SOAs. University of Paderborn, Germany, 2013.
short: Z. Huma, C. Gerth, G. Engels, Automated Service Discovery and Composition
for On-the-Fly SOAs, University of Paderborn, Germany, 2013.
date_created: 2019-03-03T16:13:23Z
date_updated: 2022-01-06T07:03:52Z
department:
- _id: '66'
language:
- iso: eng
publisher: University of Paderborn, Germany
report_number: tr-ri-13-333
status: public
title: Automated Service Discovery and Composition for On-the-Fly SOAs
type: report
user_id: '52534'
year: '2013'
...
---
_id: '5752'
author:
- first_name: Enes
full_name: Yigitbas, Enes
id: '8447'
last_name: Yigitbas
orcid: 0000-0002-5967-833X
- first_name: Christian
full_name: Gerth, Christian
last_name: Gerth
- first_name: Stefan
full_name: Sauer, Stefan
id: '447'
last_name: Sauer
citation:
ama: 'Yigitbas E, Gerth C, Sauer S. Konzeption modellbasierter Benutzungsschnittstellen
für verteilte Selbstbedienungssysteme. In: Informatik 2013, 43. Jahrestagung
Der Gesellschaft Für Informatik e.V. (GI), Informatik Angepasst an Mensch, Organisation
Und Umwelt, 16.-20. September 2013, Koblenz, Deutschland. ; 2013:2714-2723.'
apa: Yigitbas, E., Gerth, C., & Sauer, S. (2013). Konzeption modellbasierter
Benutzungsschnittstellen für verteilte Selbstbedienungssysteme. In Informatik
2013, 43. Jahrestagung der Gesellschaft für Informatik e.V. (GI), Informatik angepasst
an Mensch, Organisation und Umwelt, 16.-20. September 2013, Koblenz, Deutschland
(pp. 2714–2723).
bibtex: '@inproceedings{Yigitbas_Gerth_Sauer_2013, title={Konzeption modellbasierter
Benutzungsschnittstellen für verteilte Selbstbedienungssysteme}, booktitle={Informatik
2013, 43. Jahrestagung der Gesellschaft für Informatik e.V. (GI), Informatik angepasst
an Mensch, Organisation und Umwelt, 16.-20. September 2013, Koblenz, Deutschland},
author={Yigitbas, Enes and Gerth, Christian and Sauer, Stefan}, year={2013}, pages={2714–2723}
}'
chicago: Yigitbas, Enes, Christian Gerth, and Stefan Sauer. “Konzeption Modellbasierter
Benutzungsschnittstellen Für Verteilte Selbstbedienungssysteme.” In Informatik
2013, 43. Jahrestagung Der Gesellschaft Für Informatik e.V. (GI), Informatik Angepasst
an Mensch, Organisation Und Umwelt, 16.-20. September 2013, Koblenz, Deutschland,
2714–23, 2013.
ieee: E. Yigitbas, C. Gerth, and S. Sauer, “Konzeption modellbasierter Benutzungsschnittstellen
für verteilte Selbstbedienungssysteme,” in Informatik 2013, 43. Jahrestagung
der Gesellschaft für Informatik e.V. (GI), Informatik angepasst an Mensch, Organisation
und Umwelt, 16.-20. September 2013, Koblenz, Deutschland, 2013, pp. 2714–2723.
mla: Yigitbas, Enes, et al. “Konzeption Modellbasierter Benutzungsschnittstellen
Für Verteilte Selbstbedienungssysteme.” Informatik 2013, 43. Jahrestagung Der
Gesellschaft Für Informatik e.V. (GI), Informatik Angepasst an Mensch, Organisation
Und Umwelt, 16.-20. September 2013, Koblenz, Deutschland, 2013, pp. 2714–23.
short: 'E. Yigitbas, C. Gerth, S. Sauer, in: Informatik 2013, 43. Jahrestagung Der
Gesellschaft Für Informatik e.V. (GI), Informatik Angepasst an Mensch, Organisation
Und Umwelt, 16.-20. September 2013, Koblenz, Deutschland, 2013, pp. 2714–2723.'
date_created: 2018-11-19T15:18:20Z
date_updated: 2022-01-06T07:02:38Z
department:
- _id: '66'
language:
- iso: eng
page: 2714-2723
publication: Informatik 2013, 43. Jahrestagung der Gesellschaft für Informatik e.V.
(GI), Informatik angepasst an Mensch, Organisation und Umwelt, 16.-20. September
2013, Koblenz, Deutschland
status: public
title: Konzeption modellbasierter Benutzungsschnittstellen für verteilte Selbstbedienungssysteme
type: conference
user_id: '8447'
year: '2013'
...
---
_id: '6276'
author:
- first_name: Florian
full_name: Klompmaker, Florian
last_name: Klompmaker
- first_name: Volker
full_name: Paelke, Volker
last_name: Paelke
- first_name: Holger Gerhard
full_name: Fischer, Holger Gerhard
id: '30457'
last_name: Fischer
citation:
ama: 'Klompmaker F, Paelke V, Fischer HG. A Taxonomy-Based Approach towards NUI
Interaction Design. In: Distributed, Ambient, and Pervasive Interactions.
Vol 8028. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin
Heidelberg; 2013:32-41. doi:10.1007/978-3-642-39351-8_4'
apa: 'Klompmaker, F., Paelke, V., & Fischer, H. G. (2013). A Taxonomy-Based
Approach towards NUI Interaction Design. In Distributed, Ambient, and Pervasive
Interactions (Vol. 8028, pp. 32–41). Berlin, Heidelberg: Springer Berlin Heidelberg.
https://doi.org/10.1007/978-3-642-39351-8_4'
bibtex: '@inbook{Klompmaker_Paelke_Fischer_2013, place={Berlin, Heidelberg}, series={Lecture
Notes in Computer Science}, title={A Taxonomy-Based Approach towards NUI Interaction
Design}, volume={8028}, DOI={10.1007/978-3-642-39351-8_4},
booktitle={Distributed, Ambient, and Pervasive Interactions}, publisher={Springer
Berlin Heidelberg}, author={Klompmaker, Florian and Paelke, Volker and Fischer,
Holger Gerhard}, year={2013}, pages={32–41}, collection={Lecture Notes in Computer
Science} }'
chicago: 'Klompmaker, Florian, Volker Paelke, and Holger Gerhard Fischer. “A Taxonomy-Based
Approach towards NUI Interaction Design.” In Distributed, Ambient, and Pervasive
Interactions, 8028:32–41. Lecture Notes in Computer Science. Berlin, Heidelberg:
Springer Berlin Heidelberg, 2013. https://doi.org/10.1007/978-3-642-39351-8_4.'
ieee: 'F. Klompmaker, V. Paelke, and H. G. Fischer, “A Taxonomy-Based Approach towards
NUI Interaction Design,” in Distributed, Ambient, and Pervasive Interactions,
vol. 8028, Berlin, Heidelberg: Springer Berlin Heidelberg, 2013, pp. 32–41.'
mla: Klompmaker, Florian, et al. “A Taxonomy-Based Approach towards NUI Interaction
Design.” Distributed, Ambient, and Pervasive Interactions, vol. 8028, Springer
Berlin Heidelberg, 2013, pp. 32–41, doi:10.1007/978-3-642-39351-8_4.
short: 'F. Klompmaker, V. Paelke, H.G. Fischer, in: Distributed, Ambient, and Pervasive
Interactions, Springer Berlin Heidelberg, Berlin, Heidelberg, 2013, pp. 32–41.'
conference:
end_date: 2013-07-26
location: Las Vegas, USA
name: International Conference on Distributed, Ambient, and Pervasive Interactions
(DAPI) as part of HCI International 2013
start_date: 2013-07-21
date_created: 2018-12-18T12:42:33Z
date_updated: 2022-01-06T07:02:59Z
department:
- _id: '66'
- _id: '534'
- _id: '221'
doi: 10.1007/978-3-642-39351-8_4
intvolume: ' 8028'
language:
- iso: eng
page: 32-41
place: Berlin, Heidelberg
publication: Distributed, Ambient, and Pervasive Interactions
publication_identifier:
isbn:
- '9783642393501'
- '9783642393518'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer Berlin Heidelberg
series_title: Lecture Notes in Computer Science
status: public
title: A Taxonomy-Based Approach towards NUI Interaction Design
type: book_chapter
user_id: '30457'
volume: 8028
year: '2013'
...
---
_id: '6279'
author:
- first_name: Holger Gerhard
full_name: Fischer, Holger Gerhard
id: '30457'
last_name: Fischer
- first_name: Benjamin
full_name: Strenge, Benjamin
last_name: Strenge
- first_name: Karsten
full_name: Nebe, Karsten
last_name: Nebe
citation:
ama: 'Fischer HG, Strenge B, Nebe K. Towards a Holistic Tool for the Selection and
Validation of Usability Method Sets Supporting Human-Centered Design. In: Design,
User Experience, and Usability. Design Philosophy, Methods, and Tools. Vol
8012. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg;
2013:252-261. doi:10.1007/978-3-642-39229-0_28'
apa: 'Fischer, H. G., Strenge, B., & Nebe, K. (2013). Towards a Holistic Tool
for the Selection and Validation of Usability Method Sets Supporting Human-Centered
Design. In Design, User Experience, and Usability. Design Philosophy, Methods,
and Tools (Vol. 8012, pp. 252–261). Berlin, Heidelberg: Springer Berlin Heidelberg.
https://doi.org/10.1007/978-3-642-39229-0_28'
bibtex: '@inbook{Fischer_Strenge_Nebe_2013, place={Berlin, Heidelberg}, series={Lecture
Notes in Computer Science}, title={Towards a Holistic Tool for the Selection and
Validation of Usability Method Sets Supporting Human-Centered Design}, volume={8012},
DOI={10.1007/978-3-642-39229-0_28},
booktitle={Design, User Experience, and Usability. Design Philosophy, Methods,
and Tools}, publisher={Springer Berlin Heidelberg}, author={Fischer, Holger Gerhard
and Strenge, Benjamin and Nebe, Karsten}, year={2013}, pages={252–261}, collection={Lecture
Notes in Computer Science} }'
chicago: 'Fischer, Holger Gerhard, Benjamin Strenge, and Karsten Nebe. “Towards
a Holistic Tool for the Selection and Validation of Usability Method Sets Supporting
Human-Centered Design.” In Design, User Experience, and Usability. Design Philosophy,
Methods, and Tools, 8012:252–61. Lecture Notes in Computer Science. Berlin,
Heidelberg: Springer Berlin Heidelberg, 2013. https://doi.org/10.1007/978-3-642-39229-0_28.'
ieee: 'H. G. Fischer, B. Strenge, and K. Nebe, “Towards a Holistic Tool for the
Selection and Validation of Usability Method Sets Supporting Human-Centered Design,”
in Design, User Experience, and Usability. Design Philosophy, Methods, and
Tools, vol. 8012, Berlin, Heidelberg: Springer Berlin Heidelberg, 2013, pp.
252–261.'
mla: Fischer, Holger Gerhard, et al. “Towards a Holistic Tool for the Selection
and Validation of Usability Method Sets Supporting Human-Centered Design.” Design,
User Experience, and Usability. Design Philosophy, Methods, and Tools, vol.
8012, Springer Berlin Heidelberg, 2013, pp. 252–61, doi:10.1007/978-3-642-39229-0_28.
short: 'H.G. Fischer, B. Strenge, K. Nebe, in: Design, User Experience, and Usability.
Design Philosophy, Methods, and Tools, Springer Berlin Heidelberg, Berlin, Heidelberg,
2013, pp. 252–261.'
conference:
end_date: 2013-07-26
location: Las Vegas, USA
name: International Conference of Design, User Experience, and Usability (DUXU)
as part of HCI International 2013
start_date: 2013-07-21
date_created: 2018-12-18T12:44:48Z
date_updated: 2022-01-06T07:02:59Z
department:
- _id: '66'
- _id: '534'
- _id: '221'
doi: 10.1007/978-3-642-39229-0_28
intvolume: ' 8012'
language:
- iso: eng
page: 252-261
place: Berlin, Heidelberg
publication: Design, User Experience, and Usability. Design Philosophy, Methods, and
Tools
publication_identifier:
isbn:
- '9783642392283'
- '9783642392290'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer Berlin Heidelberg
series_title: Lecture Notes in Computer Science
status: public
title: Towards a Holistic Tool for the Selection and Validation of Usability Method
Sets Supporting Human-Centered Design
type: book_chapter
user_id: '30457'
volume: 8012
year: '2013'
...
---
_id: '6284'
author:
- first_name: Holger Gerhard
full_name: Fischer, Holger Gerhard
id: '30457'
last_name: Fischer
- first_name: Thomas
full_name: Geis, Thomas
last_name: Geis
- first_name: Rolf
full_name: Molich, Rolf
last_name: Molich
- first_name: Oliver
full_name: Kluge, Oliver
last_name: Kluge
- first_name: Rüdiger
full_name: Heimgärtner, Rüdiger
last_name: Heimgärtner
- first_name: Peter
full_name: Hunkirchen, Peter
last_name: Hunkirchen
citation:
ama: 'Fischer HG, Geis T, Molich R, Kluge O, Heimgärtner R, Hunkirchen P. Do You
Speak Usability? - Aktueller Stand des Glossars und des Curriculums für den Certified
Professional for Usability and User Experience (CPUX) der German UPA. In: Jahresband
Usability Professionals. German UPA; 2013:28-34.'
apa: Fischer, H. G., Geis, T., Molich, R., Kluge, O., Heimgärtner, R., & Hunkirchen,
P. (2013). Do You Speak Usability? - Aktueller Stand des Glossars und des Curriculums
für den Certified Professional for Usability and User Experience (CPUX) der German
UPA. In Jahresband Usability Professionals (pp. 28–34). German UPA.
bibtex: '@inproceedings{Fischer_Geis_Molich_Kluge_Heimgärtner_Hunkirchen_2013, title={Do
You Speak Usability? - Aktueller Stand des Glossars und des Curriculums für den
Certified Professional for Usability and User Experience (CPUX) der German UPA},
booktitle={Jahresband Usability Professionals}, publisher={German UPA}, author={Fischer,
Holger Gerhard and Geis, Thomas and Molich, Rolf and Kluge, Oliver and Heimgärtner,
Rüdiger and Hunkirchen, Peter}, year={2013}, pages={28–34} }'
chicago: Fischer, Holger Gerhard, Thomas Geis, Rolf Molich, Oliver Kluge, Rüdiger
Heimgärtner, and Peter Hunkirchen. “Do You Speak Usability? - Aktueller Stand
des Glossars und des Curriculums für den Certified Professional for Usability
and User Experience (CPUX) der German UPA.” In Jahresband Usability Professionals,
28–34. German UPA, 2013.
ieee: H. G. Fischer, T. Geis, R. Molich, O. Kluge, R. Heimgärtner, and P. Hunkirchen,
“Do You Speak Usability? - Aktueller Stand des Glossars und des Curriculums für
den Certified Professional for Usability and User Experience (CPUX) der German
UPA,” in Jahresband Usability Professionals, 2013, pp. 28–34.
mla: Fischer, Holger Gerhard, et al. “Do You Speak Usability? - Aktueller Stand
des Glossars und des Curriculums für den Certified Professional for Usability
and User Experience (CPUX) der German UPA.” Jahresband Usability Professionals,
German UPA, 2013, pp. 28–34.
short: 'H.G. Fischer, T. Geis, R. Molich, O. Kluge, R. Heimgärtner, P. Hunkirchen,
in: Jahresband Usability Professionals, German UPA, 2013, pp. 28–34.'
date_created: 2018-12-18T12:48:22Z
date_updated: 2022-01-06T07:02:59Z
department:
- _id: '66'
- _id: '534'
- _id: '221'
language:
- iso: ger
page: 28-34
publication: Jahresband Usability Professionals
publisher: German UPA
status: public
title: Do You Speak Usability? - Aktueller Stand des Glossars und des Curriculums
für den Certified Professional for Usability and User Experience (CPUX) der German
UPA
type: conference
user_id: '30457'
year: '2013'
...
---
_id: '469'
abstract:
- lang: eng
text: Runtime monitoring aims at ensuring program safety by monitoring the program's
behaviour during execution and taking appropriate action before a program violates
some property.Runtime monitoring is in particular important when an exhaustive
formal verification fails. While the approach allows for a safe execution of programs,
it may impose a significant runtime overhead.In this paper, we propose a novel
technique combining verification and monitoring which incurs no overhead during
runtime at all. The technique proceeds by using the inconclusive result of a verification
run as the basis for transforming the program into one where all potential points
of failure are replaced by HALT statements. The new program is safe by construction,
behaviourally equivalent to the original program (except for unsafe behaviour),and
has the same performance characteristics.
author:
- first_name: Daniel
full_name: Wonisch, Daniel
last_name: Wonisch
- first_name: Alexander
full_name: Schremmer, Alexander
last_name: Schremmer
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Wonisch D, Schremmer A, Wehrheim H. Zero Overhead Runtime Monitoring. In:
Proceedings of the 11th International Conference on Software Engineering and
Formal Methods (SEFM). LNCS. ; 2013:244-258. doi:10.1007/978-3-642-40561-7_17'
apa: Wonisch, D., Schremmer, A., & Wehrheim, H. (2013). Zero Overhead Runtime
Monitoring. In Proceedings of the 11th International Conference on Software
Engineering and Formal Methods (SEFM) (pp. 244–258). https://doi.org/10.1007/978-3-642-40561-7_17
bibtex: '@inproceedings{Wonisch_Schremmer_Wehrheim_2013, series={LNCS}, title={Zero
Overhead Runtime Monitoring}, DOI={10.1007/978-3-642-40561-7_17},
booktitle={Proceedings of the 11th International Conference on Software Engineering
and Formal Methods (SEFM)}, author={Wonisch, Daniel and Schremmer, Alexander and
Wehrheim, Heike}, year={2013}, pages={244–258}, collection={LNCS} }'
chicago: Wonisch, Daniel, Alexander Schremmer, and Heike Wehrheim. “Zero Overhead
Runtime Monitoring.” In Proceedings of the 11th International Conference on
Software Engineering and Formal Methods (SEFM), 244–58. LNCS, 2013. https://doi.org/10.1007/978-3-642-40561-7_17.
ieee: D. Wonisch, A. Schremmer, and H. Wehrheim, “Zero Overhead Runtime Monitoring,”
in Proceedings of the 11th International Conference on Software Engineering
and Formal Methods (SEFM), 2013, pp. 244–258.
mla: Wonisch, Daniel, et al. “Zero Overhead Runtime Monitoring.” Proceedings
of the 11th International Conference on Software Engineering and Formal Methods
(SEFM), 2013, pp. 244–58, doi:10.1007/978-3-642-40561-7_17.
short: 'D. Wonisch, A. Schremmer, H. Wehrheim, in: Proceedings of the 11th International
Conference on Software Engineering and Formal Methods (SEFM), 2013, pp. 244–258.'
date_created: 2017-10-17T12:42:23Z
date_updated: 2022-01-06T07:01:18Z
ddc:
- '040'
department:
- _id: '77'
doi: 10.1007/978-3-642-40561-7_17
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-16T11:18:41Z
date_updated: 2018-03-16T11:18:41Z
file_id: '1332'
file_name: 469-WSW2013-2.pdf
file_size: 394804
relation: main_file
success: 1
file_date_updated: 2018-03-16T11:18:41Z
has_accepted_license: '1'
language:
- iso: eng
page: 244-258
project:
- _id: '1'
name: SFB 901
- _id: '12'
name: SFB 901 - Subprojekt B4
- _id: '3'
name: SFB 901 - Project Area B
publication: Proceedings of the 11th International Conference on Software Engineering
and Formal Methods (SEFM)
series_title: LNCS
status: public
title: Zero Overhead Runtime Monitoring
type: conference
user_id: '477'
year: '2013'
...
---
_id: '470'
abstract:
- lang: eng
text: In OpenFlow [1], multiple switches share the same control plane which is centralized
atwhat is called the OpenFlow controller. A switch only consists of a forwarding
plane. Rules for forwarding individual packets (called ow entries in OpenFlow)
are pushed from the controller to the switches. In a network with a high arrival
rate of new ows, such as in a data center, the control trac between the switch
and controller can become very high. As a consequence, routing of new ows will
be slow. One way to reduce control trac is to use wildcarded ow entries. Wildcard
ow entries can be used to create default routes in the network. However, since
switches do not keep track of ows covered by a wildcard ow entry, the controller
no longer has knowledge about individual ows. To nd out about these individual
ows we propose an extension to the current OpenFlow standard to enable packet
sampling of wildcard ow entries.
author:
- first_name: Philip
full_name: Wette, Philip
last_name: Wette
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: 'Wette P, Karl H. Which Flows Are Hiding Behind My Wildcard Rule? Adding Packet
Sampling to OpenFlow. In: Proceedings of the ACM SIGCOMM ’13. Digital Library.
; 2013:541-542. doi:10.1145/2486001.2491710'
apa: Wette, P., & Karl, H. (2013). Which Flows Are Hiding Behind My Wildcard
Rule? Adding Packet Sampling to OpenFlow. In Proceedings of the ACM SIGCOMM
’13 (pp. 541–542). https://doi.org/10.1145/2486001.2491710
bibtex: '@inproceedings{Wette_Karl_2013, series={Digital Library}, title={Which
Flows Are Hiding Behind My Wildcard Rule? Adding Packet Sampling to OpenFlow},
DOI={10.1145/2486001.2491710},
booktitle={Proceedings of the ACM SIGCOMM ’13}, author={Wette, Philip and Karl,
Holger}, year={2013}, pages={541–542}, collection={Digital Library} }'
chicago: Wette, Philip, and Holger Karl. “Which Flows Are Hiding Behind My Wildcard
Rule? Adding Packet Sampling to OpenFlow.” In Proceedings of the ACM SIGCOMM
’13, 541–42. Digital Library, 2013. https://doi.org/10.1145/2486001.2491710.
ieee: P. Wette and H. Karl, “Which Flows Are Hiding Behind My Wildcard Rule? Adding
Packet Sampling to OpenFlow,” in Proceedings of the ACM SIGCOMM ’13, 2013,
pp. 541–542.
mla: Wette, Philip, and Holger Karl. “Which Flows Are Hiding Behind My Wildcard
Rule? Adding Packet Sampling to OpenFlow.” Proceedings of the ACM SIGCOMM ’13,
2013, pp. 541–42, doi:10.1145/2486001.2491710.
short: 'P. Wette, H. Karl, in: Proceedings of the ACM SIGCOMM ’13, 2013, pp. 541–542.'
date_created: 2017-10-17T12:42:23Z
date_updated: 2022-01-06T07:01:19Z
ddc:
- '040'
department:
- _id: '75'
doi: 10.1145/2486001.2491710
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-16T11:18:01Z
date_updated: 2018-03-16T11:18:01Z
file_id: '1331'
file_name: 470-p541-wette_01.pdf
file_size: 446835
relation: main_file
success: 1
file_date_updated: 2018-03-16T11:18:01Z
has_accepted_license: '1'
page: 541-542
project:
- _id: '1'
name: SFB 901
- _id: '6'
name: SFB 901 - Subprojekt A2
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the ACM SIGCOMM '13
series_title: Digital Library
status: public
title: Which Flows Are Hiding Behind My Wildcard Rule? Adding Packet Sampling to OpenFlow
type: conference
user_id: '15572'
year: '2013'
...
---
_id: '471'
author:
- first_name: Alina
full_name: Tezer, Alina
last_name: Tezer
citation:
ama: Tezer A. Verteilte Erstellung und Aktualisierung von Schlüsselservern in
identitätsbasierten Verschlüsselungssystemen. Universität Paderborn; 2013.
apa: Tezer, A. (2013). Verteilte Erstellung und Aktualisierung von Schlüsselservern
in identitätsbasierten Verschlüsselungssystemen. Universität Paderborn.
bibtex: '@book{Tezer_2013, title={Verteilte Erstellung und Aktualisierung von Schlüsselservern
in identitätsbasierten Verschlüsselungssystemen}, publisher={Universität Paderborn},
author={Tezer, Alina}, year={2013} }'
chicago: Tezer, Alina. Verteilte Erstellung und Aktualisierung von Schlüsselservern
in identitätsbasierten Verschlüsselungssystemen. Universität Paderborn, 2013.
ieee: A. Tezer, Verteilte Erstellung und Aktualisierung von Schlüsselservern
in identitätsbasierten Verschlüsselungssystemen. Universität Paderborn, 2013.
mla: Tezer, Alina. Verteilte Erstellung und Aktualisierung von Schlüsselservern
in identitätsbasierten Verschlüsselungssystemen. Universität Paderborn, 2013.
short: A. Tezer, Verteilte Erstellung und Aktualisierung von Schlüsselservern in
identitätsbasierten Verschlüsselungssystemen, Universität Paderborn, 2013.
date_created: 2017-10-17T12:42:23Z
date_updated: 2022-01-06T07:01:19Z
department:
- _id: '64'
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
- _id: '43'
name: Securing the Financial Cloud
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
title: Verteilte Erstellung und Aktualisierung von Schlüsselservern in identitätsbasierten
Verschlüsselungssystemen
type: bachelorsthesis
user_id: '477'
year: '2013'
...
---
_id: '476'
abstract:
- lang: eng
text: 'An elementary h-route ow, for an integer h 1, is a set of h edge- disjoint
paths between a source and a sink, each path carrying a unit of ow, and an h-route
ow is a non-negative linear combination of elementary h-routeows. An h-route cut
is a set of edges whose removal decreases the maximum h-route ow between a given
source-sink pair (or between every source-sink pair in the multicommodity setting)
to zero. The main result of this paper is an approximate duality theorem for multicommodity
h-route cuts and ows, for h 3: The size of a minimum h-route cut is at least f=h
and at most O(log4 k f) where f is the size of the maximum h-routeow and k is
the number of commodities. The main step towards the proof of this duality is
the design and analysis of a polynomial-time approximation algorithm for the minimum
h-route cut problem for h = 3 that has an approximation ratio of O(log4 k). Previously,
polylogarithmic approximation was known only for h-route cuts for h 2. A key ingredient
of our algorithm is a novel rounding technique that we call multilevel ball-growing.
Though the proof of the duality relies on this algorithm, it is not a straightforward
corollary of it as in the case of classical multicommodity ows and cuts. Similar
results are shown also for the sparsest multiroute cut problem.'
author:
- first_name: Petr
full_name: Kolman, Petr
last_name: Kolman
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Kolman P, Scheideler C. Towards Duality of Multicommodity Multiroute Cuts
and Flows: Multilevel Ball-Growing. Theory of Computing Systems. 2013;(2):341-363.
doi:10.1007/s00224-013-9454-3'
apa: 'Kolman, P., & Scheideler, C. (2013). Towards Duality of Multicommodity
Multiroute Cuts and Flows: Multilevel Ball-Growing. Theory of Computing Systems,
(2), 341–363. https://doi.org/10.1007/s00224-013-9454-3'
bibtex: '@article{Kolman_Scheideler_2013, title={Towards Duality of Multicommodity
Multiroute Cuts and Flows: Multilevel Ball-Growing}, DOI={10.1007/s00224-013-9454-3},
number={2}, journal={Theory of Computing Systems}, publisher={Springer}, author={Kolman,
Petr and Scheideler, Christian}, year={2013}, pages={341–363} }'
chicago: 'Kolman, Petr, and Christian Scheideler. “Towards Duality of Multicommodity
Multiroute Cuts and Flows: Multilevel Ball-Growing.” Theory of Computing Systems,
no. 2 (2013): 341–63. https://doi.org/10.1007/s00224-013-9454-3.'
ieee: 'P. Kolman and C. Scheideler, “Towards Duality of Multicommodity Multiroute
Cuts and Flows: Multilevel Ball-Growing,” Theory of Computing Systems,
no. 2, pp. 341–363, 2013.'
mla: 'Kolman, Petr, and Christian Scheideler. “Towards Duality of Multicommodity
Multiroute Cuts and Flows: Multilevel Ball-Growing.” Theory of Computing Systems,
no. 2, Springer, 2013, pp. 341–63, doi:10.1007/s00224-013-9454-3.'
short: P. Kolman, C. Scheideler, Theory of Computing Systems (2013) 341–363.
date_created: 2017-10-17T12:42:24Z
date_updated: 2022-01-06T07:01:21Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1007/s00224-013-9454-3
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T14:07:18Z
date_updated: 2018-03-15T14:07:18Z
file_id: '1326'
file_name: 476-tocsrevised3b.pdf
file_size: 264308
relation: main_file
success: 1
file_date_updated: 2018-03-15T14:07:18Z
has_accepted_license: '1'
issue: '2'
page: 341-363
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Theory of Computing Systems
publisher: Springer
status: public
title: 'Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing'
type: journal_article
user_id: '477'
year: '2013'
...
---
_id: '477'
abstract:
- lang: eng
text: We consider the k-token dissemination problem, where k initially arbitrarily
distributed tokens have to be disseminated to all nodes in a dynamic network (as
introduced by Kuhn et al., STOC 2010). In contrast to general dynamic networks,
our dynamic networks are unit disk graphs, i.e., nodes are embedded into the Euclidean
plane and two nodes are connected if and only if their distance is at most R.
Our worst-case adversary is allowed to move the nodes on the plane, but the maximum
velocity v_max of each node is limited and the graph must be connected in each
round. For this model, we provide almost tight lower and upper bounds for k-token
dissemination if nodes are restricted to send only one token per round. It turns
out that the maximum velocity v_max is a meaningful parameter to characterize
dynamics in our model.
author:
- first_name: Sebastian
full_name: Abshoff, Sebastian
last_name: Abshoff
- first_name: Markus
full_name: Benter, Markus
last_name: Benter
- first_name: Andreas
full_name: Cord-Landwehr, Andreas
last_name: Cord-Landwehr
- first_name: Manuel
full_name: Malatyali, Manuel
last_name: Malatyali
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Abshoff S, Benter M, Cord-Landwehr A, Malatyali M, Meyer auf der Heide F.
Token Dissemination in Geometric Dynamic Networks. In: Algorithms for Sensor
Systems - 9th International Symposium on Algorithms and Experiments for Sensor
Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS} 2013, Sophia
Antipolis, France, September 5-6, 2013, Revised Selected Papers. Lecture Notes
in Computer Science. ; 2013:22-34. doi:10.1007/978-3-642-45346-5_3'
apa: Abshoff, S., Benter, M., Cord-Landwehr, A., Malatyali, M., & Meyer auf
der Heide, F. (2013). Token Dissemination in Geometric Dynamic Networks. In Algorithms
for Sensor Systems - 9th International Symposium on Algorithms and Experiments
for Sensor Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS}
2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers
(pp. 22–34). https://doi.org/10.1007/978-3-642-45346-5_3
bibtex: '@inproceedings{Abshoff_Benter_Cord-Landwehr_Malatyali_Meyer auf der Heide_2013,
series={Lecture Notes in Computer Science}, title={Token Dissemination in Geometric
Dynamic Networks}, DOI={10.1007/978-3-642-45346-5_3},
booktitle={Algorithms for Sensor Systems - 9th International Symposium on Algorithms
and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics,
{ALGOSENSORS} 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected
Papers}, author={Abshoff, Sebastian and Benter, Markus and Cord-Landwehr, Andreas
and Malatyali, Manuel and Meyer auf der Heide, Friedhelm}, year={2013}, pages={22–34},
collection={Lecture Notes in Computer Science} }'
chicago: Abshoff, Sebastian, Markus Benter, Andreas Cord-Landwehr, Manuel Malatyali,
and Friedhelm Meyer auf der Heide. “Token Dissemination in Geometric Dynamic Networks.”
In Algorithms for Sensor Systems - 9th International Symposium on Algorithms
and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics,
{ALGOSENSORS} 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected
Papers, 22–34. Lecture Notes in Computer Science, 2013. https://doi.org/10.1007/978-3-642-45346-5_3.
ieee: S. Abshoff, M. Benter, A. Cord-Landwehr, M. Malatyali, and F. Meyer auf der
Heide, “Token Dissemination in Geometric Dynamic Networks,” in Algorithms for
Sensor Systems - 9th International Symposium on Algorithms and Experiments for
Sensor Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS} 2013,
Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers, 2013,
pp. 22–34.
mla: Abshoff, Sebastian, et al. “Token Dissemination in Geometric Dynamic Networks.”
Algorithms for Sensor Systems - 9th International Symposium on Algorithms and
Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS}
2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers,
2013, pp. 22–34, doi:10.1007/978-3-642-45346-5_3.
short: 'S. Abshoff, M. Benter, A. Cord-Landwehr, M. Malatyali, F. Meyer auf der
Heide, in: Algorithms for Sensor Systems - 9th International Symposium on Algorithms
and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics,
{ALGOSENSORS} 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected
Papers, 2013, pp. 22–34.'
date_created: 2017-10-17T12:42:25Z
date_updated: 2022-01-06T07:01:21Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1007/978-3-642-45346-5_3
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T14:06:38Z
date_updated: 2018-03-15T14:06:38Z
file_id: '1325'
file_name: 477-geometric-dynamic-networks_01.pdf
file_size: 193169
relation: main_file
success: 1
file_date_updated: 2018-03-15T14:06:38Z
has_accepted_license: '1'
page: 22-34
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Algorithms for Sensor Systems - 9th International Symposium on Algorithms
and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics,
{ALGOSENSORS} 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected
Papers
series_title: Lecture Notes in Computer Science
status: public
title: Token Dissemination in Geometric Dynamic Networks
type: conference
user_id: '15504'
year: '2013'
...
---
_id: '478'
abstract:
- lang: eng
text: 'Software systems are playing an increasing role in our everyday life, and
as the amount of software applications grows, so does their complexity and the
relevance of their computations. Software components can be found in many systems
that are charged with safety-critical tasks, such as control systems for aviation
or power plants. Hence, software verification techniques that are capable of proving
the absence of critical errors are becoming more and more important in the field
software engineering. A well-established approach to software verification is
model checking. Applying this technique involves an exhaustive exploration of
a state space model corresponding to the system under consideration. The major
challenge in model checking is the so-called state explosion problem: The state
space of a software system grows exponentially with its size. Thus, the straightforward
modelling of real-life systems practically impossible. A common approach to this
problem is the application of abstraction techniques, which reduce the original
state space by mapping it on a significantly smaller abstract one. Abstraction
inherently involves a loss of information, and thus, the resulting abstract model
may be too imprecise for a definite result in verification. Therefore, abstraction
is typically combined with abstraction refinement: An initially very coarse abstract
model is iteratively refined, i.e. enriched with new details about the original
system, until a level of abstraction is reached that is precise enough for a definite
outcome. Abstraction refinement-based model checking is fully automatable and
it is considered as one of the most promising approaches to the state explosion
problem in verification. However, it is still faced with a number of challenges.
There exist several types of abstraction techniques and not every type is equally
well-suited for all kinds of systems and verification tasks. Moreover, the selection
of adequate refinement steps is nontrivial and typically the most crucial part
of the overall approach: Unfavourable refinement decisions can compromise the
state space-reducing effect of abstraction, and as a consequence, can easily lead
to the failure of verification. It is, however, hard to predict which refinement
steps will eventually be expedient for verification – and which not.'
author:
- first_name: Nils
full_name: Timm, Nils
last_name: Timm
citation:
ama: Timm N. Three-Valued Abstraction and Heuristic-Guided Refinement for Verifying
Concurrent Systems. Universität Paderborn; 2013.
apa: Timm, N. (2013). Three-Valued Abstraction and Heuristic-Guided Refinement
for Verifying Concurrent Systems. Universität Paderborn.
bibtex: '@book{Timm_2013, title={Three-Valued Abstraction and Heuristic-Guided Refinement
for Verifying Concurrent Systems}, publisher={Universität Paderborn}, author={Timm,
Nils}, year={2013} }'
chicago: Timm, Nils. Three-Valued Abstraction and Heuristic-Guided Refinement
for Verifying Concurrent Systems. Universität Paderborn, 2013.
ieee: N. Timm, Three-Valued Abstraction and Heuristic-Guided Refinement for Verifying
Concurrent Systems. Universität Paderborn, 2013.
mla: Timm, Nils. Three-Valued Abstraction and Heuristic-Guided Refinement for
Verifying Concurrent Systems. Universität Paderborn, 2013.
short: N. Timm, Three-Valued Abstraction and Heuristic-Guided Refinement for Verifying
Concurrent Systems, Universität Paderborn, 2013.
date_created: 2017-10-17T12:42:25Z
date_updated: 2022-01-06T07:01:22Z
ddc:
- '040'
department:
- _id: '77'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T14:06:05Z
date_updated: 2018-03-15T14:06:05Z
file_id: '1324'
file_name: 478-Dissertation-Timm.pdf
file_size: 931458
relation: main_file
success: 1
file_date_updated: 2018-03-15T14:06:05Z
has_accepted_license: '1'
project:
- _id: '1'
name: SFB 901
- _id: '12'
name: SFB 901 - Subprojekt B4
- _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: Three-Valued Abstraction and Heuristic-Guided Refinement for Verifying Concurrent
Systems
type: dissertation
user_id: '477'
year: '2013'
...
---
_id: '481'
abstract:
- lang: eng
text: Cloud computing offers high availability, dynamic scalability, and elasticity
requiring only very little administration. However, this service comes with financial
costs. Peer-to-peer systems, in contrast, operate at very low costs but cannot
match the quality of service of the cloud. This paper focuses on the case study
of Wikipedia and presents an approach to reduce the operational costs of hosting
similar websites in the cloud by using a practical peer-to-peer approach. The
visitors of the site are joining a Chord overlay, which acts as first cache for
article lookups. Simulation results show, that up to 72% of the article lookups
in Wikipedia could be answered by other visitors instead of using the cloud.
author:
- first_name: Kalman
full_name: Graffi, Kalman
last_name: Graffi
- first_name: Lars
full_name: Bremer, Lars
last_name: Bremer
citation:
ama: 'Graffi K, Bremer L. Symbiotic Coupling of P2P and Cloud Systems: The Wikipedia
Case. In: Proceedings of the International Conference on Communications (ICC’13).
; 2013:3444-3449. doi:10.1109/ICC.2013.6655082'
apa: 'Graffi, K., & Bremer, L. (2013). Symbiotic Coupling of P2P and Cloud Systems:
The Wikipedia Case. In Proceedings of the International Conference on Communications
(ICC’13) (pp. 3444–3449). https://doi.org/10.1109/ICC.2013.6655082'
bibtex: '@inproceedings{Graffi_Bremer_2013, title={Symbiotic Coupling of P2P and
Cloud Systems: The Wikipedia Case}, DOI={10.1109/ICC.2013.6655082},
booktitle={Proceedings of the International Conference on Communications (ICC’13)},
author={Graffi, Kalman and Bremer, Lars}, year={2013}, pages={3444–3449} }'
chicago: 'Graffi, Kalman, and Lars Bremer. “Symbiotic Coupling of P2P and Cloud
Systems: The Wikipedia Case.” In Proceedings of the International Conference
on Communications (ICC’13), 3444–49, 2013. https://doi.org/10.1109/ICC.2013.6655082.'
ieee: 'K. Graffi and L. Bremer, “Symbiotic Coupling of P2P and Cloud Systems: The
Wikipedia Case,” in Proceedings of the International Conference on Communications
(ICC’13), 2013, pp. 3444–3449.'
mla: 'Graffi, Kalman, and Lars Bremer. “Symbiotic Coupling of P2P and Cloud Systems:
The Wikipedia Case.” Proceedings of the International Conference on Communications
(ICC’13), 2013, pp. 3444–49, doi:10.1109/ICC.2013.6655082.'
short: 'K. Graffi, L. Bremer, in: Proceedings of the International Conference on
Communications (ICC’13), 2013, pp. 3444–3449.'
date_created: 2017-10-17T12:42:26Z
date_updated: 2022-01-06T07:01:25Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1109/ICC.2013.6655082
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T14:02:01Z
date_updated: 2018-03-15T14:02:01Z
file_id: '1321'
file_name: 481-Symbiotic.Coupling.of.P2P.and.Cloud.Systems.The.Wikipedia.Case2.pdf
file_size: 1405789
relation: main_file
success: 1
file_date_updated: 2018-03-15T14:02:01Z
has_accepted_license: '1'
language:
- iso: eng
page: '3444 - 3449 '
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the International Conference on Communications (ICC'13)
status: public
title: 'Symbiotic Coupling of P2P and Cloud Systems: The Wikipedia Case'
type: conference
user_id: '477'
year: '2013'
...
---
_id: '484'
abstract:
- lang: eng
text: One of the main ideas of Service-Oriented Computing (SOC) is the delivery
of flexibly composable services provided on world-wide markets. For a successful
service discovery,service requests have to be matched with the available service
offers. However, in a situation in which no service that completely matches the
request can be discovered, the customer may tolerate slight discrepancies between
request and offer. Some existing fuzzy matching approaches are able to detectsuch
service variants, but they do not allow to explicitly specify which parts of a
request are not mandatory. In this paper, we improve an existing service matching
approach based onVisual Contracts leveraging our preliminary work of design pattern
detection. Thereby, we support explicit specifications of service variants and
realize gradual matching results that can be ranked in order to discover the service
offer that matches a customer’s request best.
author:
- first_name: Marie Christin
full_name: Platenius, Marie Christin
last_name: Platenius
- first_name: Markus
full_name: von Detten, Markus
last_name: von Detten
- first_name: Christian
full_name: Gerth, Christian
last_name: Gerth
- first_name: Wilhelm
full_name: Schäfer, Wilhelm
last_name: Schäfer
- first_name: Gregor
full_name: Engels, Gregor
id: '107'
last_name: Engels
citation:
ama: 'Platenius MC, von Detten M, Gerth C, Schäfer W, Engels G. Service Matching
under Consideration of Explicitly Specified Service Variants. In: IEEE 20th
International Conference on Web Services (ICWS 2013). ; 2013:613-614. doi:10.1109/ICWS.2013.98'
apa: Platenius, M. C., von Detten, M., Gerth, C., Schäfer, W., & Engels, G.
(2013). Service Matching under Consideration of Explicitly Specified Service Variants.
In IEEE 20th International Conference on Web Services (ICWS 2013) (pp.
613–614). https://doi.org/10.1109/ICWS.2013.98
bibtex: '@inproceedings{Platenius_von Detten_Gerth_Schäfer_Engels_2013, title={Service
Matching under Consideration of Explicitly Specified Service Variants}, DOI={10.1109/ICWS.2013.98}, booktitle={IEEE
20th International Conference on Web Services (ICWS 2013)}, author={Platenius,
Marie Christin and von Detten, Markus and Gerth, Christian and Schäfer, Wilhelm
and Engels, Gregor}, year={2013}, pages={613–614} }'
chicago: Platenius, Marie Christin, Markus von Detten, Christian Gerth, Wilhelm
Schäfer, and Gregor Engels. “Service Matching under Consideration of Explicitly
Specified Service Variants.” In IEEE 20th International Conference on Web Services
(ICWS 2013), 613–14, 2013. https://doi.org/10.1109/ICWS.2013.98.
ieee: M. C. Platenius, M. von Detten, C. Gerth, W. Schäfer, and G. Engels, “Service
Matching under Consideration of Explicitly Specified Service Variants,” in IEEE
20th International Conference on Web Services (ICWS 2013), 2013, pp. 613–614.
mla: Platenius, Marie Christin, et al. “Service Matching under Consideration of
Explicitly Specified Service Variants.” IEEE 20th International Conference
on Web Services (ICWS 2013), 2013, pp. 613–14, doi:10.1109/ICWS.2013.98.
short: 'M.C. Platenius, M. von Detten, C. Gerth, W. Schäfer, G. Engels, in: IEEE
20th International Conference on Web Services (ICWS 2013), 2013, pp. 613–614.'
date_created: 2017-10-17T12:42:26Z
date_updated: 2022-01-06T07:01:27Z
ddc:
- '040'
department:
- _id: '66'
- _id: '76'
doi: 10.1109/ICWS.2013.98
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T13:57:42Z
date_updated: 2018-03-15T13:57:42Z
file_id: '1319'
file_name: 484-Platenius_et_al_ICWS2013.pdf
file_size: 262082
relation: main_file
success: 1
file_date_updated: 2018-03-15T13:57:42Z
has_accepted_license: '1'
language:
- iso: eng
page: 613-614
project:
- _id: '1'
name: SFB 901
- _id: '9'
name: SFB 901 - Subprojekt B1
- _id: '3'
name: SFB 901 - Project Area B
publication: IEEE 20th International Conference on Web Services (ICWS 2013)
status: public
title: Service Matching under Consideration of Explicitly Specified Service Variants
type: conference
user_id: '477'
year: '2013'
...
---
_id: '485'
abstract:
- lang: eng
text: Software composition has been studied as a subject of state based planning
for decades. Existing composition approaches that are efficient enough to be used
in practice are limited to sequential arrangements of software components. This
restriction dramatically reduces the number of composition problems that can be
solved. However, there are many composition problems that could be solved by existing
approaches if they had a possibility to combine components in very simple non-sequential
ways. To this end, we present an approach that arranges not only basic components
but also composite components. Composite components enhance the structure of the
composition by conditional control flows. Through algorithms that are written
by experts, composite components are automatically generated before the composition
process starts. Therefore, our approach is not a substitute for existing composition
algorithms but complements them with a preprocessing step. We verified the validity
of our approach through implementation of the presented algorithms.
author:
- first_name: Felix
full_name: Mohr, Felix
last_name: Mohr
- first_name: Hans
full_name: Kleine Büning, Hans
last_name: Kleine Büning
citation:
ama: 'Mohr F, Kleine Büning H. Semi-Automated Software Composition Through Generated
Components. In: Proceedings of the 15th International Conference on Information
Integration and Web-Based Applications & Services (IiWAS). ; 2013:676-680.
doi:10.1145/2539150.2539235'
apa: Mohr, F., & Kleine Büning, H. (2013). Semi-Automated Software Composition
Through Generated Components. In Proceedings of the 15th International Conference
on Information Integration and Web-based Applications & Services (iiWAS)
(pp. 676–680). https://doi.org/10.1145/2539150.2539235
bibtex: '@inproceedings{Mohr_Kleine Büning_2013, title={Semi-Automated Software
Composition Through Generated Components}, DOI={10.1145/2539150.2539235},
booktitle={Proceedings of the 15th International Conference on Information Integration
and Web-based Applications & Services (iiWAS)}, author={Mohr, Felix and Kleine
Büning, Hans}, year={2013}, pages={676–680} }'
chicago: Mohr, Felix, and Hans Kleine Büning. “Semi-Automated Software Composition
Through Generated Components.” In Proceedings of the 15th International Conference
on Information Integration and Web-Based Applications & Services (IiWAS),
676–80, 2013. https://doi.org/10.1145/2539150.2539235.
ieee: F. Mohr and H. Kleine Büning, “Semi-Automated Software Composition Through
Generated Components,” in Proceedings of the 15th International Conference
on Information Integration and Web-based Applications & Services (iiWAS),
2013, pp. 676–680.
mla: Mohr, Felix, and Hans Kleine Büning. “Semi-Automated Software Composition Through
Generated Components.” Proceedings of the 15th International Conference on
Information Integration and Web-Based Applications & Services (IiWAS),
2013, pp. 676–80, doi:10.1145/2539150.2539235.
short: 'F. Mohr, H. Kleine Büning, in: Proceedings of the 15th International Conference
on Information Integration and Web-Based Applications & Services (IiWAS),
2013, pp. 676–680.'
date_created: 2017-10-17T12:42:26Z
date_updated: 2022-01-06T07:01:27Z
ddc:
- '040'
department:
- _id: '355'
doi: 10.1145/2539150.2539235
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T13:56:49Z
date_updated: 2018-03-15T13:56:49Z
file_id: '1318'
file_name: 485-paper86_mohr.pdf
file_size: 368152
relation: main_file
success: 1
file_date_updated: 2018-03-15T13:56:49Z
has_accepted_license: '1'
language:
- iso: eng
page: 676-680
project:
- _id: '1'
name: SFB 901
- _id: '10'
name: SFB 901 - Subprojekt B2
- _id: '3'
name: SFB 901 - Project Area B
publication: Proceedings of the 15th International Conference on Information Integration
and Web-based Applications & Services (iiWAS)
status: public
title: Semi-Automated Software Composition Through Generated Components
type: conference
user_id: '477'
year: '2013'
...