---
_id: '16268'
author:
- first_name: Jan André
full_name: Striewe, Jan André
id: '29413'
last_name: Striewe
- first_name: C.
full_name: Reuter, C.
last_name: Reuter
- first_name: C.
full_name: Lauter, C.
last_name: Lauter
- first_name: Thomas
full_name: Tröster, Thomas
id: '553'
last_name: Tröster
citation:
ama: 'Striewe JA, Reuter C, Lauter C, Tröster T. Innovative largescale Production
Process for multilayered Sheet-Metal-FRP-Structures. In: ; 2016.'
apa: Striewe, J. A., Reuter, C., Lauter, C., & Tröster, T. (2016). Innovative
largescale Production Process for multilayered Sheet-Metal-FRP-Structures. Presented
at the 19th International Conference on Composite Structures, Porto.
bibtex: '@inproceedings{Striewe_Reuter_Lauter_Tröster_2016, title={Innovative largescale
Production Process for multilayered Sheet-Metal-FRP-Structures}, author={Striewe,
Jan André and Reuter, C. and Lauter, C. and Tröster, Thomas}, year={2016} }'
chicago: Striewe, Jan André, C. Reuter, C. Lauter, and Thomas Tröster. “Innovative
Largescale Production Process for Multilayered Sheet-Metal-FRP-Structures,” 2016.
ieee: J. A. Striewe, C. Reuter, C. Lauter, and T. Tröster, “Innovative largescale
Production Process for multilayered Sheet-Metal-FRP-Structures,” presented at
the 19th International Conference on Composite Structures, Porto, 2016.
mla: Striewe, Jan André, et al. Innovative Largescale Production Process for
Multilayered Sheet-Metal-FRP-Structures. 2016.
short: 'J.A. Striewe, C. Reuter, C. Lauter, T. Tröster, in: 2016.'
conference:
end_date: 2016-09-09
location: Porto
name: 19th International Conference on Composite Structures
start_date: 2016-09-05
date_created: 2020-03-09T09:41:43Z
date_updated: 2022-01-06T06:52:47Z
department:
- _id: '9'
- _id: '321'
- _id: '149'
- _id: '9'
language:
- iso: eng
status: public
title: Innovative largescale Production Process for multilayered Sheet-Metal-FRP-Structures
type: conference
user_id: '29413'
year: '2016'
...
---
_id: '16269'
author:
- first_name: Z.
full_name: Wang, Z.
last_name: Wang
- first_name: C.
full_name: Lauter, C.
last_name: Lauter
- first_name: Julian
full_name: Löseke, Julian
id: '27651'
last_name: Löseke
- first_name: Thomas
full_name: Tröster, Thomas
id: '553'
last_name: Tröster
citation:
ama: 'Wang Z, Lauter C, Löseke J, Tröster T. CarS: Carbon Fiber Reinforced Steel
for Structural Automotive Applications. In: ; 2016.'
apa: 'Wang, Z., Lauter, C., Löseke, J., & Tröster, T. (2016). CarS: Carbon Fiber
Reinforced Steel for Structural Automotive Applications. Presented at the International
Conference on Automotive Composites, ICAutoC 2016, Lisbon, Portugal.'
bibtex: '@inproceedings{Wang_Lauter_Löseke_Tröster_2016, title={CarS: Carbon Fiber
Reinforced Steel for Structural Automotive Applications}, author={Wang, Z. and
Lauter, C. and Löseke, Julian and Tröster, Thomas}, year={2016} }'
chicago: 'Wang, Z., C. Lauter, Julian Löseke, and Thomas Tröster. “CarS: Carbon
Fiber Reinforced Steel for Structural Automotive Applications,” 2016.'
ieee: 'Z. Wang, C. Lauter, J. Löseke, and T. Tröster, “CarS: Carbon Fiber Reinforced
Steel for Structural Automotive Applications,” presented at the International
Conference on Automotive Composites, ICAutoC 2016, Lisbon, Portugal, 2016.'
mla: 'Wang, Z., et al. CarS: Carbon Fiber Reinforced Steel for Structural Automotive
Applications. 2016.'
short: 'Z. Wang, C. Lauter, J. Löseke, T. Tröster, in: 2016.'
conference:
end_date: 2016-09-23
location: Lisbon, Portugal
name: International Conference on Automotive Composites, ICAutoC 2016
start_date: 2016-09-21
date_created: 2020-03-09T09:47:32Z
date_updated: 2022-01-06T06:52:47Z
department:
- _id: '9'
- _id: '321'
- _id: '149'
language:
- iso: eng
status: public
title: 'CarS: Carbon Fiber Reinforced Steel for Structural Automotive Applications'
type: conference
user_id: '72008'
year: '2016'
...
---
_id: '1627'
author:
- first_name: P. A. Aranda
full_name: Gutierrez, P. A. Aranda
last_name: Gutierrez
- first_name: E.
full_name: Rojas, E.
last_name: Rojas
- first_name: A.
full_name: Schwabe, A.
last_name: Schwabe
- first_name: C.
full_name: Stritzke, C.
last_name: Stritzke
- first_name: R.
full_name: Doriguzzi-Corin, R.
last_name: Doriguzzi-Corin
- first_name: A.
full_name: Leckey, A.
last_name: Leckey
- first_name: G.
full_name: Petralia, G.
last_name: Petralia
- first_name: A.
full_name: Marsico, A.
last_name: Marsico
- first_name: K.
full_name: Phemius, K.
last_name: Phemius
- first_name: S.
full_name: Tamurejo, S.
last_name: Tamurejo
citation:
ama: 'Gutierrez PAA, Rojas E, Schwabe A, et al. NetIDE: All-in-one framework for
next generation, composed SDN applications. In: 2016 IEEE NetSoft Conference
and Workshops (NetSoft). IEEE; 2016. doi:10.1109/netsoft.2016.7502408'
apa: 'Gutierrez, P. A. A., Rojas, E., Schwabe, A., Stritzke, C., Doriguzzi-Corin,
R., Leckey, A., … Tamurejo, S. (2016). NetIDE: All-in-one framework for next generation,
composed SDN applications. In 2016 IEEE NetSoft Conference and Workshops (NetSoft).
IEEE. https://doi.org/10.1109/netsoft.2016.7502408'
bibtex: '@inproceedings{Gutierrez_Rojas_Schwabe_Stritzke_Doriguzzi-Corin_Leckey_Petralia_Marsico_Phemius_Tamurejo_2016,
title={NetIDE: All-in-one framework for next generation, composed SDN applications},
DOI={10.1109/netsoft.2016.7502408},
booktitle={2016 IEEE NetSoft Conference and Workshops (NetSoft)}, publisher={IEEE},
author={Gutierrez, P. A. Aranda and Rojas, E. and Schwabe, A. and Stritzke, C.
and Doriguzzi-Corin, R. and Leckey, A. and Petralia, G. and Marsico, A. and Phemius,
K. and Tamurejo, S.}, year={2016} }'
chicago: 'Gutierrez, P. A. Aranda, E. Rojas, A. Schwabe, C. Stritzke, R. Doriguzzi-Corin,
A. Leckey, G. Petralia, A. Marsico, K. Phemius, and S. Tamurejo. “NetIDE: All-in-One
Framework for next Generation, Composed SDN Applications.” In 2016 IEEE NetSoft
Conference and Workshops (NetSoft). IEEE, 2016. https://doi.org/10.1109/netsoft.2016.7502408.'
ieee: 'P. A. A. Gutierrez et al., “NetIDE: All-in-one framework for next
generation, composed SDN applications,” in 2016 IEEE NetSoft Conference and
Workshops (NetSoft), 2016.'
mla: 'Gutierrez, P. A. Aranda, et al. “NetIDE: All-in-One Framework for next Generation,
Composed SDN Applications.” 2016 IEEE NetSoft Conference and Workshops (NetSoft),
IEEE, 2016, doi:10.1109/netsoft.2016.7502408.'
short: 'P.A.A. Gutierrez, E. Rojas, A. Schwabe, C. Stritzke, R. Doriguzzi-Corin,
A. Leckey, G. Petralia, A. Marsico, K. Phemius, S. Tamurejo, in: 2016 IEEE NetSoft
Conference and Workshops (NetSoft), IEEE, 2016.'
date_created: 2018-03-22T13:15:10Z
date_updated: 2022-01-06T06:52:47Z
department:
- _id: '75'
doi: 10.1109/netsoft.2016.7502408
ec_funded: '1'
project:
- _id: '21'
call_identifier: FP7-ICT-2013-11
grant_number: '619543'
name: An integrated development environment for portable network applications
publication: 2016 IEEE NetSoft Conference and Workshops (NetSoft)
publication_identifier:
isbn:
- '9781467394864'
publication_status: published
publisher: IEEE
status: public
title: 'NetIDE: All-in-one framework for next generation, composed SDN applications'
type: conference
user_id: '15572'
year: '2016'
...
---
_id: '16270'
author:
- first_name: T.
full_name: Hickmann, T.
last_name: Hickmann
- first_name: Dominik
full_name: Ahlers, Dominik
id: '11207'
last_name: Ahlers
- first_name: Thomas
full_name: Tröster, Thomas
id: '553'
last_name: Tröster
citation:
ama: Hickmann T, Ahlers D, Tröster T. Neue Prototypen-Werkzeugtechnologie für Bipolarplatten
und Batteriekomponenten. Der Stahlformenbauer . 2016;(5).
apa: Hickmann, T., Ahlers, D., & Tröster, T. (2016). Neue Prototypen-Werkzeugtechnologie
für Bipolarplatten und Batteriekomponenten. Der Stahlformenbauer , (5).
bibtex: '@article{Hickmann_Ahlers_Tröster_2016, title={Neue Prototypen-Werkzeugtechnologie
für Bipolarplatten und Batteriekomponenten}, number={5}, journal={Der Stahlformenbauer
}, publisher={Technischer Fachverlag Möller}, author={Hickmann, T. and Ahlers,
Dominik and Tröster, Thomas}, year={2016} }'
chicago: Hickmann, T., Dominik Ahlers, and Thomas Tröster. “Neue Prototypen-Werkzeugtechnologie
für Bipolarplatten und Batteriekomponenten.” Der Stahlformenbauer , no.
5 (2016).
ieee: T. Hickmann, D. Ahlers, and T. Tröster, “Neue Prototypen-Werkzeugtechnologie
für Bipolarplatten und Batteriekomponenten,” Der Stahlformenbauer , no.
5, 2016.
mla: Hickmann, T., et al. “Neue Prototypen-Werkzeugtechnologie für Bipolarplatten
und Batteriekomponenten.” Der Stahlformenbauer , no. 5, Technischer Fachverlag
Möller, 2016.
short: T. Hickmann, D. Ahlers, T. Tröster, Der Stahlformenbauer (2016).
date_created: 2020-03-09T09:51:21Z
date_updated: 2022-01-06T06:52:47Z
department:
- _id: '9'
- _id: '321'
- _id: '149'
- _id: '219'
issue: '5'
language:
- iso: ger
publication: 'Der Stahlformenbauer '
publisher: Technischer Fachverlag Möller
status: public
title: Neue Prototypen-Werkzeugtechnologie für Bipolarplatten und Batteriekomponenten
type: journal_article
user_id: '11207'
year: '2016'
...
---
_id: '163'
citation:
ama: Dressler F, Meyer auf der Heide F, eds. Proceedings of the 17th ACM International
Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc). ACM; 2016.
doi:10.1145/2942358
apa: 'Dressler, F., & Meyer auf der Heide, F. (Eds.). (2016). Proceedings
of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing
(MobiHoc). Presented at the MobiHoc, Paderborn, Germany: ACM. https://doi.org/10.1145/2942358'
bibtex: '@book{Dressler_Meyer auf der Heide_2016, title={Proceedings of the 17th
ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)},
DOI={10.1145/2942358}, publisher={ACM},
year={2016} }'
chicago: Dressler, Falko, and Friedhelm Meyer auf der Heide, eds. Proceedings
of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing
(MobiHoc). ACM, 2016. https://doi.org/10.1145/2942358.
ieee: F. Dressler and F. Meyer auf der Heide, Eds., Proceedings of the 17th ACM
International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc).
ACM, 2016.
mla: Dressler, Falko, and Friedhelm Meyer auf der Heide, editors. Proceedings
of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing
(MobiHoc). ACM, 2016, doi:10.1145/2942358.
short: F. Dressler, F. Meyer auf der Heide, eds., Proceedings of the 17th ACM International
Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc), ACM, 2016.
conference:
end_date: 2016-07-08
location: Paderborn, Germany
name: MobiHoc
start_date: 2016-07-04
date_created: 2017-10-17T12:41:23Z
date_updated: 2022-01-06T06:52:48Z
department:
- _id: '63'
doi: 10.1145/2942358
editor:
- first_name: Falko
full_name: Dressler, Falko
last_name: Dressler
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
project:
- _id: '1'
name: SFB 901
- _id: '16'
name: SFB 901 - Subprojekt C4
- _id: '4'
name: SFB 901 - Project Area C
publisher: ACM
status: public
title: Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking
and Computing (MobiHoc)
type: conference_editor
user_id: '15504'
year: '2016'
...
---
_id: '1630'
author:
- first_name: Antonio
full_name: Marsico, Antonio
last_name: Marsico
- first_name: Roberto
full_name: Doriguzzi-Corin, Roberto
last_name: Doriguzzi-Corin
- first_name: Matteo
full_name: Gerola, Matteo
last_name: Gerola
- first_name: Domenico
full_name: Siracusa, Domenico
last_name: Siracusa
- first_name: Arne
full_name: Schwabe, Arne
last_name: Schwabe
citation:
ama: 'Marsico A, Doriguzzi-Corin R, Gerola M, Siracusa D, Schwabe A. A non-disruptive
automated approach to update SDN applications at runtime. In: NOMS 2016 - 2016
IEEE/IFIP Network Operations and Management Symposium. IEEE; 2016. doi:10.1109/noms.2016.7502946'
apa: Marsico, A., Doriguzzi-Corin, R., Gerola, M., Siracusa, D., & Schwabe,
A. (2016). A non-disruptive automated approach to update SDN applications at runtime.
In NOMS 2016 - 2016 IEEE/IFIP Network Operations and Management Symposium.
IEEE. https://doi.org/10.1109/noms.2016.7502946
bibtex: '@inproceedings{Marsico_Doriguzzi-Corin_Gerola_Siracusa_Schwabe_2016, title={A
non-disruptive automated approach to update SDN applications at runtime}, DOI={10.1109/noms.2016.7502946},
booktitle={NOMS 2016 - 2016 IEEE/IFIP Network Operations and Management Symposium},
publisher={IEEE}, author={Marsico, Antonio and Doriguzzi-Corin, Roberto and Gerola,
Matteo and Siracusa, Domenico and Schwabe, Arne}, year={2016} }'
chicago: Marsico, Antonio, Roberto Doriguzzi-Corin, Matteo Gerola, Domenico Siracusa,
and Arne Schwabe. “A Non-Disruptive Automated Approach to Update SDN Applications
at Runtime.” In NOMS 2016 - 2016 IEEE/IFIP Network Operations and Management
Symposium. IEEE, 2016. https://doi.org/10.1109/noms.2016.7502946.
ieee: A. Marsico, R. Doriguzzi-Corin, M. Gerola, D. Siracusa, and A. Schwabe, “A
non-disruptive automated approach to update SDN applications at runtime,” in NOMS
2016 - 2016 IEEE/IFIP Network Operations and Management Symposium, 2016.
mla: Marsico, Antonio, et al. “A Non-Disruptive Automated Approach to Update SDN
Applications at Runtime.” NOMS 2016 - 2016 IEEE/IFIP Network Operations and
Management Symposium, IEEE, 2016, doi:10.1109/noms.2016.7502946.
short: 'A. Marsico, R. Doriguzzi-Corin, M. Gerola, D. Siracusa, A. Schwabe, in:
NOMS 2016 - 2016 IEEE/IFIP Network Operations and Management Symposium, IEEE,
2016.'
date_created: 2018-03-22T13:21:41Z
date_updated: 2022-01-06T06:52:48Z
department:
- _id: '75'
doi: 10.1109/noms.2016.7502946
ec_funded: '1'
project:
- _id: '21'
call_identifier: FP7-ICT-2013-11
grant_number: '619543'
name: An integrated development environment for portable network applications
publication: NOMS 2016 - 2016 IEEE/IFIP Network Operations and Management Symposium
publication_identifier:
isbn:
- '9781509002238'
publication_status: published
publisher: IEEE
status: public
title: A non-disruptive automated approach to update SDN applications at runtime
type: conference
user_id: '15572'
year: '2016'
...
---
_id: '1632'
author:
- first_name: Roberto
full_name: Doriguzzi-Corin, Roberto
last_name: Doriguzzi-Corin
- first_name: Domenico
full_name: Siracusa, Domenico
last_name: Siracusa
- first_name: Elio
full_name: Salvador, Elio
last_name: Salvador
- first_name: Arne
full_name: Schwabe, Arne
last_name: Schwabe
citation:
ama: 'Doriguzzi-Corin R, Siracusa D, Salvador E, Schwabe A. Empowering network operating
systems with memory management techniques. In: NOMS 2016 - 2016 IEEE/IFIP Network
Operations and Management Symposium. IEEE; 2016. doi:10.1109/noms.2016.7502889'
apa: Doriguzzi-Corin, R., Siracusa, D., Salvador, E., & Schwabe, A. (2016).
Empowering network operating systems with memory management techniques. In NOMS
2016 - 2016 IEEE/IFIP Network Operations and Management Symposium. IEEE. https://doi.org/10.1109/noms.2016.7502889
bibtex: '@inproceedings{Doriguzzi-Corin_Siracusa_Salvador_Schwabe_2016, title={Empowering
network operating systems with memory management techniques}, DOI={10.1109/noms.2016.7502889},
booktitle={NOMS 2016 - 2016 IEEE/IFIP Network Operations and Management Symposium},
publisher={IEEE}, author={Doriguzzi-Corin, Roberto and Siracusa, Domenico and
Salvador, Elio and Schwabe, Arne}, year={2016} }'
chicago: Doriguzzi-Corin, Roberto, Domenico Siracusa, Elio Salvador, and Arne Schwabe.
“Empowering Network Operating Systems with Memory Management Techniques.” In NOMS
2016 - 2016 IEEE/IFIP Network Operations and Management Symposium. IEEE, 2016.
https://doi.org/10.1109/noms.2016.7502889.
ieee: R. Doriguzzi-Corin, D. Siracusa, E. Salvador, and A. Schwabe, “Empowering
network operating systems with memory management techniques,” in NOMS 2016
- 2016 IEEE/IFIP Network Operations and Management Symposium, 2016.
mla: Doriguzzi-Corin, Roberto, et al. “Empowering Network Operating Systems with
Memory Management Techniques.” NOMS 2016 - 2016 IEEE/IFIP Network Operations
and Management Symposium, IEEE, 2016, doi:10.1109/noms.2016.7502889.
short: 'R. Doriguzzi-Corin, D. Siracusa, E. Salvador, A. Schwabe, in: NOMS 2016
- 2016 IEEE/IFIP Network Operations and Management Symposium, IEEE, 2016.'
date_created: 2018-03-22T13:23:06Z
date_updated: 2022-01-06T06:52:48Z
department:
- _id: '75'
doi: 10.1109/noms.2016.7502889
ec_funded: '1'
project:
- _id: '21'
call_identifier: FP7-ICT-2013-11
grant_number: '619543'
name: An integrated development environment for portable network applications
publication: NOMS 2016 - 2016 IEEE/IFIP Network Operations and Management Symposium
publication_identifier:
isbn:
- '9781509002238'
publication_status: published
publisher: IEEE
status: public
title: Empowering network operating systems with memory management techniques
type: conference
user_id: '15572'
year: '2016'
...
---
_id: '16323'
author:
- first_name: Nora Jenny
full_name: Vollmers, Nora Jenny
last_name: Vollmers
- first_name: Patrick
full_name: Müller, Patrick
id: '54037'
last_name: Müller
orcid: 0000-0003-1103-4073
- first_name: Alexander
full_name: Hoffmann, Alexander
last_name: Hoffmann
- first_name: Sonja
full_name: Herres-Pawlis, Sonja
last_name: Herres-Pawlis
- first_name: Martin
full_name: Rohrmüller, Martin
last_name: Rohrmüller
- first_name: Wolf Gero
full_name: Schmidt, Wolf Gero
last_name: Schmidt
- first_name: Uwe
full_name: Gerstmann, Uwe
last_name: Gerstmann
- first_name: Matthias
full_name: Bauer, Matthias
id: '47241'
last_name: Bauer
citation:
ama: 'Vollmers NJ, Müller P, Hoffmann A, et al. Experimental and Theoretical High-Energy-Resolution
X-ray Absorption Spectroscopy: Implications for the Investigation of the Entatic
State. Inorganic Chemistry. 2016:11694-11706. doi:10.1021/acs.inorgchem.6b01704'
apa: 'Vollmers, N. J., Müller, P., Hoffmann, A., Herres-Pawlis, S., Rohrmüller,
M., Schmidt, W. G., … Bauer, M. (2016). Experimental and Theoretical High-Energy-Resolution
X-ray Absorption Spectroscopy: Implications for the Investigation of the Entatic
State. Inorganic Chemistry, 11694–11706. https://doi.org/10.1021/acs.inorgchem.6b01704'
bibtex: '@article{Vollmers_Müller_Hoffmann_Herres-Pawlis_Rohrmüller_Schmidt_Gerstmann_Bauer_2016,
title={Experimental and Theoretical High-Energy-Resolution X-ray Absorption Spectroscopy:
Implications for the Investigation of the Entatic State}, DOI={10.1021/acs.inorgchem.6b01704},
journal={Inorganic Chemistry}, author={Vollmers, Nora Jenny and Müller, Patrick
and Hoffmann, Alexander and Herres-Pawlis, Sonja and Rohrmüller, Martin and Schmidt,
Wolf Gero and Gerstmann, Uwe and Bauer, Matthias}, year={2016}, pages={11694–11706}
}'
chicago: 'Vollmers, Nora Jenny, Patrick Müller, Alexander Hoffmann, Sonja Herres-Pawlis,
Martin Rohrmüller, Wolf Gero Schmidt, Uwe Gerstmann, and Matthias Bauer. “Experimental
and Theoretical High-Energy-Resolution X-Ray Absorption Spectroscopy: Implications
for the Investigation of the Entatic State.” Inorganic Chemistry, 2016,
11694–706. https://doi.org/10.1021/acs.inorgchem.6b01704.'
ieee: 'N. J. Vollmers et al., “Experimental and Theoretical High-Energy-Resolution
X-ray Absorption Spectroscopy: Implications for the Investigation of the Entatic
State,” Inorganic Chemistry, pp. 11694–11706, 2016.'
mla: 'Vollmers, Nora Jenny, et al. “Experimental and Theoretical High-Energy-Resolution
X-Ray Absorption Spectroscopy: Implications for the Investigation of the Entatic
State.” Inorganic Chemistry, 2016, pp. 11694–706, doi:10.1021/acs.inorgchem.6b01704.'
short: N.J. Vollmers, P. Müller, A. Hoffmann, S. Herres-Pawlis, M. Rohrmüller, W.G.
Schmidt, U. Gerstmann, M. Bauer, Inorganic Chemistry (2016) 11694–11706.
date_created: 2020-03-23T10:58:57Z
date_updated: 2022-01-06T06:52:48Z
department:
- _id: '43'
- _id: '35'
- _id: '306'
- _id: '15'
doi: 10.1021/acs.inorgchem.6b01704
language:
- iso: eng
page: 11694-11706
project:
- _id: '52'
name: Computing Resources Provided by the Paderborn Center for Parallel Computing
publication: Inorganic Chemistry
publication_identifier:
issn:
- 0020-1669
- 1520-510X
publication_status: published
status: public
title: 'Experimental and Theoretical High-Energy-Resolution X-ray Absorption Spectroscopy:
Implications for the Investigation of the Entatic State'
type: journal_article
user_id: '54038'
year: '2016'
...
---
_id: '16351'
abstract:
- lang: eng
text: "Defining, measuring, and comparing the quality and efficiency of rendering
algorithms in computer graphics is a demanding challenge: quality measures are
often application specific and efficiency is strongly influenced by properties
of the rendered scene and the used hardware. We survey the currently employed
evaluation methods for AQ1 the development process of rendering algorithms. Then,
we present our PADrend framework, which supports systematic and flexible development,
evaluation, adaptation, and comparison of rendering algorithms, and provides a
comfortable and easy-to-use platform for developers of rendering algorithms. The
system includes a new evaluation method to improve the objectivity of experimental
evaluations of rendering algorithms.\r\n"
author:
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
- first_name: Claudius
full_name: Jähn, Claudius
last_name: Jähn
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Ralf
full_name: Petring, Ralf
last_name: Petring
citation:
ama: 'Fischer M, Jähn C, Meyer auf der Heide F, Petring R. Algorithm Engineering
Aspects of Real-Time Rendering Algorithms. In: Kliemann L, Sanders P, eds. Algorithm
Engineering. Vol 9220. LNCS. Springer; 2016:226-244. doi:10.1007/978-3-319-49487-6_7 '
apa: Fischer, M., Jähn, C., Meyer auf der Heide, F., & Petring, R. (2016). Algorithm
Engineering Aspects of Real-Time Rendering Algorithms. In L. Kliemann & P.
Sanders (Eds.), Algorithm Engineering (Vol. 9220, pp. 226–244). Springer.
https://doi.org/10.1007/978-3-319-49487-6_7
bibtex: '@inproceedings{Fischer_Jähn_Meyer auf der Heide_Petring_2016, series={LNCS},
title={Algorithm Engineering Aspects of Real-Time Rendering Algorithms}, volume={9220},
DOI={10.1007/978-3-319-49487-6_7
}, booktitle={Algorithm Engineering}, publisher={Springer}, author={Fischer,
Matthias and Jähn, Claudius and Meyer auf der Heide, Friedhelm and Petring, Ralf},
editor={Kliemann, Lasse and Sanders, PeterEditors}, year={2016}, pages={226–244},
collection={LNCS} }'
chicago: Fischer, Matthias, Claudius Jähn, Friedhelm Meyer auf der Heide, and Ralf
Petring. “Algorithm Engineering Aspects of Real-Time Rendering Algorithms.” In
Algorithm Engineering, edited by Lasse Kliemann and Peter Sanders, 9220:226–44.
LNCS. Springer, 2016. https://doi.org/10.1007/978-3-319-49487-6_7
.
ieee: M. Fischer, C. Jähn, F. Meyer auf der Heide, and R. Petring, “Algorithm Engineering
Aspects of Real-Time Rendering Algorithms,” in Algorithm Engineering, 2016,
vol. 9220, pp. 226–244.
mla: Fischer, Matthias, et al. “Algorithm Engineering Aspects of Real-Time Rendering
Algorithms.” Algorithm Engineering, edited by Lasse Kliemann and Peter
Sanders, vol. 9220, Springer, 2016, pp. 226–44, doi:10.1007/978-3-319-49487-6_7 .
short: 'M. Fischer, C. Jähn, F. Meyer auf der Heide, R. Petring, in: L. Kliemann,
P. Sanders (Eds.), Algorithm Engineering, Springer, 2016, pp. 226–244.'
date_created: 2020-03-30T10:21:53Z
date_updated: 2022-01-06T06:52:49Z
department:
- _id: '63'
doi: '10.1007/978-3-319-49487-6_7 '
editor:
- first_name: Lasse
full_name: Kliemann, Lasse
last_name: Kliemann
- first_name: Peter
full_name: Sanders, Peter
last_name: Sanders
intvolume: ' 9220'
language:
- iso: eng
page: 226-244
publication: Algorithm Engineering
publisher: Springer
series_title: LNCS
status: public
title: Algorithm Engineering Aspects of Real-Time Rendering Algorithms
type: conference
user_id: '15415'
volume: 9220
year: '2016'
...
---
_id: '16358'
author:
- first_name: Shouwei
full_name: Li, Shouwei
last_name: Li
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Pavel
full_name: Podlipyan, Pavel
last_name: Podlipyan
citation:
ama: 'Li S, Meyer auf der Heide F, Podlipyan P. The impact of the Gabriel subgraph
of the visibility graph on the gathering of mobile autonomous robots. In: Algorithms
for Sensor Systems, Proceedings of the 12th International Symposium on Algorithms
and Experiments for Wireless Sensor Networks (ALGOSENSORS). Springer; 2016.
doi:10.1007/978-3-319-53058-1_5
'
apa: Li, S., Meyer auf der Heide, F., & Podlipyan, P. (2016). The impact of
the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous
robots. In Algorithms for Sensor Systems, Proceedings of the 12th International
Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS).
Springer. https://doi.org/10.1007/978-3-319-53058-1_5
bibtex: '@inproceedings{Li_Meyer auf der Heide_Podlipyan_2016, title={The impact
of the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous
robots}, DOI={10.1007/978-3-319-53058-1_5
}, booktitle={Algorithms for Sensor Systems, Proceedings of the 12th International
Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS)},
publisher={Springer}, author={Li, Shouwei and Meyer auf der Heide, Friedhelm and
Podlipyan, Pavel}, year={2016} }'
chicago: Li, Shouwei, Friedhelm Meyer auf der Heide, and Pavel Podlipyan. “The Impact
of the Gabriel Subgraph of the Visibility Graph on the Gathering of Mobile Autonomous
Robots.” In Algorithms for Sensor Systems, Proceedings of the 12th International
Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS).
Springer, 2016. https://doi.org/10.1007/978-3-319-53058-1_5
.
ieee: S. Li, F. Meyer auf der Heide, and P. Podlipyan, “The impact of the Gabriel
subgraph of the visibility graph on the gathering of mobile autonomous robots,”
in Algorithms for Sensor Systems, Proceedings of the 12th International Symposium
on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS),
2016.
mla: Li, Shouwei, et al. “The Impact of the Gabriel Subgraph of the Visibility Graph
on the Gathering of Mobile Autonomous Robots.” Algorithms for Sensor Systems,
Proceedings of the 12th International Symposium on Algorithms and Experiments
for Wireless Sensor Networks (ALGOSENSORS), Springer, 2016, doi:10.1007/978-3-319-53058-1_5 .
short: 'S. Li, F. Meyer auf der Heide, P. Podlipyan, in: Algorithms for Sensor Systems,
Proceedings of the 12th International Symposium on Algorithms and Experiments
for Wireless Sensor Networks (ALGOSENSORS), Springer, 2016.'
date_created: 2020-04-01T12:28:09Z
date_updated: 2022-01-06T06:52:49Z
department:
- _id: '63'
doi: '10.1007/978-3-319-53058-1_5 '
language:
- iso: eng
publication: Algorithms for Sensor Systems, Proceedings of the 12th International
Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS)
publisher: Springer
status: public
title: The impact of the Gabriel subgraph of the visibility graph on the gathering
of mobile autonomous robots
type: conference
user_id: '15415'
year: '2016'
...
---
_id: '16359'
abstract:
- lang: eng
text: In this paper, we solve the local gathering problem of a swarm of n indistinguishable,
point-shaped robots on a two dimensional grid in asymptotically optimal time O(n)
in the fully synchronous FSYNC time model. Given an arbitrarily distributed (yet
connected) swarm of robots, the gathering problem on the grid is to locate all
robots within a 2x2- sized area that is not known beforehand. Two robots are connected
if they are vertical or horizontal neighbors on the grid. The locality constraint
means that no global control, no compass, no global communication and only local
vision is available; hence, a robot can only see its grid neighbors up to a constant
L1-distance, which also limits its movements. A robot can move to one of its eight
neighboring grid cells and if two or more robots move to the same location they
are merged to be only one robot. The locality constraint is the significant challenging
issue here, since robot move- ments must not harm the (only globally checkable)
swarm connectivity. For solving the gathering problem, we provide a synchronous
algorithm { executed by every robot { which ensures that robots merge without
breaking the swarm con- nectivity. In our model, robots can obtain a special state,
which marks such a robot to be performing specific connec- tivity preserving movements
in order to allow later merge operations of the swarm. Compared to the grid, for
gath- ering in the Euclidean plane for the same robot and time model the best
known upper bound is O(n^2).
author:
- first_name: Andreas
full_name: Cord-Landwehr, Andreas
last_name: Cord-Landwehr
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
- first_name: Daniel
full_name: Jung, Daniel
id: '37827'
last_name: Jung
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Cord-Landwehr A, Fischer M, Jung D, Meyer auf der Heide F. Asymptotically
Optimal Gathering on a Grid. In: Proceedings of the 28th ACM Symposium on Parallelism
in Algorithms and Architectures (SPAA). ACM; 2016:301-312. doi:10.1145/2935764.2935789'
apa: Cord-Landwehr, A., Fischer, M., Jung, D., & Meyer auf der Heide, F. (2016).
Asymptotically Optimal Gathering on a Grid. In Proceedings of the 28th ACM
Symposium on Parallelism in Algorithms and Architectures (SPAA) (pp. 301–312).
ACM. https://doi.org/10.1145/2935764.2935789
bibtex: '@inproceedings{Cord-Landwehr_Fischer_Jung_Meyer auf der Heide_2016, title={Asymptotically
Optimal Gathering on a Grid}, DOI={10.1145/2935764.2935789},
booktitle={Proceedings of the 28th ACM Symposium on Parallelism in Algorithms
and Architectures (SPAA)}, publisher={ACM}, author={Cord-Landwehr, Andreas and
Fischer, Matthias and Jung, Daniel and Meyer auf der Heide, Friedhelm}, year={2016},
pages={301–312} }'
chicago: Cord-Landwehr, Andreas, Matthias Fischer, Daniel Jung, and Friedhelm Meyer
auf der Heide. “Asymptotically Optimal Gathering on a Grid.” In Proceedings
of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA),
301–12. ACM, 2016. https://doi.org/10.1145/2935764.2935789.
ieee: A. Cord-Landwehr, M. Fischer, D. Jung, and F. Meyer auf der Heide, “Asymptotically
Optimal Gathering on a Grid,” in Proceedings of the 28th ACM Symposium on Parallelism
in Algorithms and Architectures (SPAA), 2016, pp. 301–312.
mla: Cord-Landwehr, Andreas, et al. “Asymptotically Optimal Gathering on a Grid.”
Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures
(SPAA), ACM, 2016, pp. 301–12, doi:10.1145/2935764.2935789.
short: 'A. Cord-Landwehr, M. Fischer, D. Jung, F. Meyer auf der Heide, in: Proceedings
of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA),
ACM, 2016, pp. 301–312.'
date_created: 2020-04-01T12:46:35Z
date_updated: 2022-01-06T06:52:49Z
department:
- _id: '63'
doi: 10.1145/2935764.2935789
language:
- iso: eng
page: 301-312
publication: Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and
Architectures (SPAA)
publisher: ACM
status: public
title: Asymptotically Optimal Gathering on a Grid
type: conference
user_id: '15415'
year: '2016'
...
---
_id: '16360'
abstract:
- lang: eng
text: 'We consider the following variant of the two dimensional gathering problem
for swarms of robots: Given a swarm of n indistinguishable, point shaped robots
on a two dimensional grid. Initially, the robots form a closed chain on the grid
and must keep this connectivity during the whole process of their gathering. Connectivity
means, that neighboring robots of the chain need to be positioned at the same
or neighboring points of the grid. In our model, gathering means to keep shortening
the chain until the robots are located inside a 2*2 subgrid. Our model is completely
local (no global control, no global coordinates, no compass, no global communication
or vision, ...). Each robot can only see its next constant number of left and
right neighbors on the chain. This fixed constant is called the viewing path length.
All its operations and detections are restricted to this constant number of robots.
Other robots, even if located at neighboring or the same grid point cannot be
detected. Only based on the relative positions of its detectable chain neighbors,
a robot can decide to obtain a certain state. Based on this state and their local
knowledge, the robots do local modifications to the chain by moving to neighboring
grid points without breaking the chain. These modifications are performed without
the knowledge whether they lead to a global progress or not. We assume the fully
synchronous FSYNC model. For this problem, we present a gathering algorithm which
needs linear time. This result generalizes a result, where an open chain with
specified distinguishable (and fixed) endpoints is considered. '
author:
- first_name: Sebastian
full_name: Abshoff, Sebastian
last_name: Abshoff
- first_name: Andreas
full_name: Cord-Landwehr, Andreas
last_name: Cord-Landwehr
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
- first_name: Daniel
full_name: Jung, Daniel
id: '37827'
last_name: Jung
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Abshoff S, Cord-Landwehr A, Fischer M, Jung D, Meyer auf der Heide F. Gathering
a Closed Chain of Robots on a Grid. In: Proceedings of the 30th International
Parallel and Distributed Processing Symposium (IPDPS). IEEE; 2016:689-699.
doi:10.1109/IPDPS.2016.51'
apa: Abshoff, S., Cord-Landwehr, A., Fischer, M., Jung, D., & Meyer auf der
Heide, F. (2016). Gathering a Closed Chain of Robots on a Grid. In Proceedings
of the 30th International Parallel and Distributed Processing Symposium (IPDPS)
(pp. 689–699). IEEE. https://doi.org/10.1109/IPDPS.2016.51
bibtex: '@inproceedings{Abshoff_Cord-Landwehr_Fischer_Jung_Meyer auf der Heide_2016,
title={Gathering a Closed Chain of Robots on a Grid}, DOI={10.1109/IPDPS.2016.51},
booktitle={Proceedings of the 30th International Parallel and Distributed Processing
Symposium (IPDPS)}, publisher={IEEE}, author={Abshoff, Sebastian and Cord-Landwehr,
Andreas and Fischer, Matthias and Jung, Daniel and Meyer auf der Heide, Friedhelm},
year={2016}, pages={689–699} }'
chicago: Abshoff, Sebastian, Andreas Cord-Landwehr, Matthias Fischer, Daniel Jung,
and Friedhelm Meyer auf der Heide. “Gathering a Closed Chain of Robots on a Grid.”
In Proceedings of the 30th International Parallel and Distributed Processing
Symposium (IPDPS), 689–99. IEEE, 2016. https://doi.org/10.1109/IPDPS.2016.51.
ieee: S. Abshoff, A. Cord-Landwehr, M. Fischer, D. Jung, and F. Meyer auf der Heide,
“Gathering a Closed Chain of Robots on a Grid,” in Proceedings of the 30th
International Parallel and Distributed Processing Symposium (IPDPS), 2016,
pp. 689–699.
mla: Abshoff, Sebastian, et al. “Gathering a Closed Chain of Robots on a Grid.”
Proceedings of the 30th International Parallel and Distributed Processing Symposium
(IPDPS), IEEE, 2016, pp. 689–99, doi:10.1109/IPDPS.2016.51.
short: 'S. Abshoff, A. Cord-Landwehr, M. Fischer, D. Jung, F. Meyer auf der Heide,
in: Proceedings of the 30th International Parallel and Distributed Processing
Symposium (IPDPS), IEEE, 2016, pp. 689–699.'
date_created: 2020-04-01T12:56:43Z
date_updated: 2022-01-06T06:52:49Z
department:
- _id: '63'
doi: 10.1109/IPDPS.2016.51
language:
- iso: eng
page: 689-699
publication: Proceedings of the 30th International Parallel and Distributed Processing
Symposium (IPDPS)
publisher: IEEE
status: public
title: Gathering a Closed Chain of Robots on a Grid
type: conference
user_id: '15415'
year: '2016'
...
---
_id: '16364'
author:
- first_name: Alexander
full_name: Macker, Alexander
last_name: Macker
- 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: 'Macker A, Malatyali M, Meyer auf der Heide F. On Competitive Algorithms for
Approximations of Top-k-Position Monitoring of Distributed Streams. In: 2016
IEEE International Parallel and Distributed Processing Symposium (IPDPS).
; 2016. doi:10.1109/ipdps.2016.91'
apa: Macker, A., Malatyali, M., & Meyer auf der Heide, F. (2016). On Competitive
Algorithms for Approximations of Top-k-Position Monitoring of Distributed Streams.
In 2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS).
https://doi.org/10.1109/ipdps.2016.91
bibtex: '@inproceedings{Macker_Malatyali_Meyer auf der Heide_2016, title={On Competitive
Algorithms for Approximations of Top-k-Position Monitoring of Distributed Streams},
DOI={10.1109/ipdps.2016.91},
booktitle={2016 IEEE International Parallel and Distributed Processing Symposium
(IPDPS)}, author={Macker, Alexander and Malatyali, Manuel and Meyer auf der Heide,
Friedhelm}, year={2016} }'
chicago: Macker, Alexander, Manuel Malatyali, and Friedhelm Meyer auf der Heide.
“On Competitive Algorithms for Approximations of Top-k-Position Monitoring of
Distributed Streams.” In 2016 IEEE International Parallel and Distributed Processing
Symposium (IPDPS), 2016. https://doi.org/10.1109/ipdps.2016.91.
ieee: A. Macker, M. Malatyali, and F. Meyer auf der Heide, “On Competitive Algorithms
for Approximations of Top-k-Position Monitoring of Distributed Streams,” in 2016
IEEE International Parallel and Distributed Processing Symposium (IPDPS),
2016.
mla: Macker, Alexander, et al. “On Competitive Algorithms for Approximations of
Top-k-Position Monitoring of Distributed Streams.” 2016 IEEE International
Parallel and Distributed Processing Symposium (IPDPS), 2016, doi:10.1109/ipdps.2016.91.
short: 'A. Macker, M. Malatyali, F. Meyer auf der Heide, in: 2016 IEEE International
Parallel and Distributed Processing Symposium (IPDPS), 2016.'
date_created: 2020-04-02T10:14:25Z
date_updated: 2022-01-06T06:52:49Z
department:
- _id: '63'
doi: 10.1109/ipdps.2016.91
language:
- iso: eng
publication: 2016 IEEE International Parallel and Distributed Processing Symposium
(IPDPS)
publication_identifier:
isbn:
- '9781509021406'
publication_status: published
status: public
title: On Competitive Algorithms for Approximations of Top-k-Position Monitoring of
Distributed Streams
type: conference
user_id: '15415'
year: '2016'
...
---
_id: '16386'
author:
- first_name: Florian
full_name: Klingler, Florian
last_name: Klingler
- first_name: Falko
full_name: Dressler, Falko
last_name: Dressler
- first_name: Christoph
full_name: Sommer, Christoph
last_name: Sommer
citation:
ama: 'Klingler F, Dressler F, Sommer C. IEEE 802.11p unicast considered harmful.
In: 2015 IEEE Vehicular Networking Conference (VNC). ; 2016. doi:10.1109/vnc.2015.7385550'
apa: Klingler, F., Dressler, F., & Sommer, C. (2016). IEEE 802.11p unicast considered
harmful. In 2015 IEEE Vehicular Networking Conference (VNC). https://doi.org/10.1109/vnc.2015.7385550
bibtex: '@inproceedings{Klingler_Dressler_Sommer_2016, title={IEEE 802.11p unicast
considered harmful}, DOI={10.1109/vnc.2015.7385550},
booktitle={2015 IEEE Vehicular Networking Conference (VNC)}, author={Klingler,
Florian and Dressler, Falko and Sommer, Christoph}, year={2016} }'
chicago: Klingler, Florian, Falko Dressler, and Christoph Sommer. “IEEE 802.11p
Unicast Considered Harmful.” In 2015 IEEE Vehicular Networking Conference (VNC),
2016. https://doi.org/10.1109/vnc.2015.7385550.
ieee: F. Klingler, F. Dressler, and C. Sommer, “IEEE 802.11p unicast considered
harmful,” in 2015 IEEE Vehicular Networking Conference (VNC), 2016.
mla: Klingler, Florian, et al. “IEEE 802.11p Unicast Considered Harmful.” 2015
IEEE Vehicular Networking Conference (VNC), 2016, doi:10.1109/vnc.2015.7385550.
short: 'F. Klingler, F. Dressler, C. Sommer, in: 2015 IEEE Vehicular Networking
Conference (VNC), 2016.'
date_created: 2020-04-02T15:41:34Z
date_updated: 2022-01-06T06:52:50Z
doi: 10.1109/vnc.2015.7385550
publication: 2015 IEEE Vehicular Networking Conference (VNC)
publication_identifier:
isbn:
- '9781467394116'
publication_status: published
status: public
title: IEEE 802.11p unicast considered harmful
type: conference
user_id: '49153'
year: '2016'
...
---
_id: '16396'
abstract:
- lang: eng
text: "We consider a scheduling problem where machines need to be rented from the\r\ncloud
in order to process jobs. There are two types of machines available which\r\ncan
be rented for machine-type dependent prices and for arbitrary durations.\r\nHowever,
a machine-type dependent setup time is required before a machine is\r\navailable
for processing. Jobs arrive online over time, have machine-type\r\ndependent sizes
and have individual deadlines. The objective is to rent\r\nmachines and schedule
jobs so as to meet all deadlines while minimizing the\r\nrental cost.\r\n Since
we observe the slack of jobs to have a fundamental influence on the\r\ncompetitiveness,
we study the model when instances are parameterized by their\r\n(minimum) slack.
An instance is called to have a slack of $\\beta$ if, for all\r\njobs, the difference
between the job's release time and the latest point in\r\ntime at which it needs
to be started is at least $\\beta$. While for $\\beta < s$\r\nno finite competitiveness
is possible, our main result is an\r\n$O(\\frac{c}{\\varepsilon} + \\frac{1}{\\varepsilon^3})$-competitive
online\r\nalgorithm for $\\beta = (1+\\varepsilon)s$ with $\\frac{1}{s} \\leq
\\varepsilon\r\n\\leq 1$, where $s$ and $c$ denotes the largest setup time and
the cost ratio of\r\nthe machine-types, respectively. It is complemented by a
lower bound of\r\n$\\Omega(\\frac{c}{\\varepsilon})$."
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. arXiv:160901184. 2016.
apa: Mäcker, A., Malatyali, M., Meyer auf der Heide, F., & Riechers, S. (2016).
Cost-efficient Scheduling on Machines from the Cloud. ArXiv:1609.01184.
bibtex: '@article{Mäcker_Malatyali_Meyer auf der Heide_Riechers_2016, title={Cost-efficient
Scheduling on Machines from the Cloud}, journal={arXiv:1609.01184}, author={Mäcker,
Alexander and Malatyali, Manuel and Meyer auf der Heide, Friedhelm and Riechers,
Sören}, year={2016} }'
chicago: Mäcker, Alexander, Manuel Malatyali, Friedhelm Meyer auf der Heide, and
Sören Riechers. “Cost-Efficient Scheduling on Machines from the Cloud.” ArXiv:1609.01184,
2016.
ieee: A. Mäcker, M. Malatyali, F. Meyer auf der Heide, and S. Riechers, “Cost-efficient
Scheduling on Machines from the Cloud,” arXiv:1609.01184. 2016.
mla: Mäcker, Alexander, et al. “Cost-Efficient Scheduling on Machines from the Cloud.”
ArXiv:1609.01184, 2016.
short: A. Mäcker, M. Malatyali, F. Meyer auf der Heide, S. Riechers, ArXiv:1609.01184
(2016).
date_created: 2020-04-03T09:24:28Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
external_id:
arxiv:
- '1609.01184'
language:
- iso: eng
publication: arXiv:1609.01184
status: public
title: Cost-efficient Scheduling on Machines from the Cloud
type: preprint
user_id: '15415'
year: '2016'
...
---
_id: '164'
author:
- first_name: Mike
full_name: Czech, Mike
last_name: Czech
citation:
ama: Czech M. Predicting Rankings of Software Verification Tools Using Kernels
for Structured Data. Universität Paderborn; 2016.
apa: Czech, M. (2016). Predicting Rankings of Software Verification Tools Using
Kernels for Structured Data. Universität Paderborn.
bibtex: '@book{Czech_2016, title={Predicting Rankings of Software Verification Tools
Using Kernels for Structured Data}, publisher={Universität Paderborn}, author={Czech,
Mike}, year={2016} }'
chicago: Czech, Mike. Predicting Rankings of Software Verification Tools Using
Kernels for Structured Data. Universität Paderborn, 2016.
ieee: M. Czech, Predicting Rankings of Software Verification Tools Using Kernels
for Structured Data. Universität Paderborn, 2016.
mla: Czech, Mike. Predicting Rankings of Software Verification Tools Using Kernels
for Structured Data. Universität Paderborn, 2016.
short: M. Czech, Predicting Rankings of Software Verification Tools Using Kernels
for Structured Data, Universität Paderborn, 2016.
date_created: 2017-10-17T12:41:24Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '77'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '11'
name: SFB 901 - Subprojekt B3
- _id: '3'
name: SFB 901 - Project Area B
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Heike
full_name: Wehrheim, Heike
last_name: Wehrheim
title: Predicting Rankings of Software Verification Tools Using Kernels for Structured
Data
type: mastersthesis
user_id: '15504'
year: '2016'
...
---
_id: '13860'
author:
- first_name: Fabian
full_name: Bause, Fabian
last_name: Bause
citation:
ama: Bause F. Ein Ultraschallbasiertes Inverses Messverfahren Zur Charakterisierung
Viskoelastischer Materialparameter von Polymeren. Universität Paderborn; 2016.
apa: Bause, F. (2016). Ein ultraschallbasiertes inverses Messverfahren zur Charakterisierung
viskoelastischer Materialparameter von Polymeren. Universität Paderborn.
bibtex: '@book{Bause_2016, title={Ein ultraschallbasiertes inverses Messverfahren
zur Charakterisierung viskoelastischer Materialparameter von Polymeren}, publisher={Universität
Paderborn}, author={Bause, Fabian}, year={2016} }'
chicago: Bause, Fabian. Ein Ultraschallbasiertes Inverses Messverfahren Zur Charakterisierung
Viskoelastischer Materialparameter von Polymeren. Universität Paderborn, 2016.
ieee: F. Bause, Ein ultraschallbasiertes inverses Messverfahren zur Charakterisierung
viskoelastischer Materialparameter von Polymeren. Universität Paderborn, 2016.
mla: Bause, Fabian. Ein Ultraschallbasiertes Inverses Messverfahren Zur Charakterisierung
Viskoelastischer Materialparameter von Polymeren. Universität Paderborn, 2016.
short: F. Bause, Ein Ultraschallbasiertes Inverses Messverfahren Zur Charakterisierung
Viskoelastischer Materialparameter von Polymeren, Universität Paderborn, 2016.
date_created: 2019-10-15T10:38:36Z
date_updated: 2022-01-06T06:51:45Z
department:
- _id: '49'
language:
- iso: eng
publisher: Universität Paderborn
status: public
title: Ein ultraschallbasiertes inverses Messverfahren zur Charakterisierung viskoelastischer
Materialparameter von Polymeren
type: dissertation
user_id: '15911'
year: '2016'
...
---
_id: '13864'
author:
- first_name: F.
full_name: Bause, F.
last_name: Bause
- first_name: Bernd
full_name: Henning, Bernd
id: '213'
last_name: Henning
citation:
ama: 'Bause F, Henning B. 5.3.1 - Ein ultraschallbasiertes inverses Messverfahren
zur Charakterisierung viskoelastischer Materialparameter von Polymeren. In: LibreCat
University; 2016. doi:10.5162/SENSOREN2016/5.3.1'
apa: Bause, F., & Henning, B. (2016). 5.3.1 - Ein ultraschallbasiertes inverses
Messverfahren zur Charakterisierung viskoelastischer Materialparameter von Polymeren.
LibreCat University. https://doi.org/10.5162/SENSOREN2016/5.3.1
bibtex: '@inproceedings{Bause_Henning_2016, title={5.3.1 - Ein ultraschallbasiertes
inverses Messverfahren zur Charakterisierung viskoelastischer Materialparameter
von Polymeren}, DOI={10.5162/SENSOREN2016/5.3.1},
publisher={LibreCat University}, author={Bause, F. and Henning, Bernd}, year={2016}
}'
chicago: Bause, F., and Bernd Henning. “5.3.1 - Ein Ultraschallbasiertes Inverses
Messverfahren Zur Charakterisierung Viskoelastischer Materialparameter von Polymeren.”
LibreCat University, 2016. https://doi.org/10.5162/SENSOREN2016/5.3.1.
ieee: F. Bause and B. Henning, “5.3.1 - Ein ultraschallbasiertes inverses Messverfahren
zur Charakterisierung viskoelastischer Materialparameter von Polymeren,” 2016.
mla: Bause, F., and Bernd Henning. 5.3.1 - Ein Ultraschallbasiertes Inverses
Messverfahren Zur Charakterisierung Viskoelastischer Materialparameter von Polymeren.
LibreCat University, 2016, doi:10.5162/SENSOREN2016/5.3.1.
short: 'F. Bause, B. Henning, in: LibreCat University, 2016.'
date_created: 2019-10-15T11:03:43Z
date_updated: 2022-01-06T06:51:45Z
department:
- _id: '49'
doi: 10.5162/SENSOREN2016/5.3.1
language:
- iso: eng
publisher: LibreCat University
status: public
title: 5.3.1 - Ein ultraschallbasiertes inverses Messverfahren zur Charakterisierung
viskoelastischer Materialparameter von Polymeren
type: conference
user_id: '15911'
year: '2016'
...
---
_id: '13865'
author:
- first_name: S.
full_name: Ester, S.
last_name: Ester
- first_name: M.
full_name: Struschka, M.
last_name: Struschka
- first_name: Bernd
full_name: Henning, Bernd
id: '213'
last_name: Henning
citation:
ama: 'Ester S, Struschka M, Henning B. 3.2.3 - Direktgravimetrischer Partikelmasse-Sensor
zur quasikontinuierlichen Emissionsmessung. In: LibreCat University; 2016. doi:10.5162/SENSOREN2016/3.2.3'
apa: Ester, S., Struschka, M., & Henning, B. (2016). 3.2.3 - Direktgravimetrischer
Partikelmasse-Sensor zur quasikontinuierlichen Emissionsmessung. LibreCat University.
https://doi.org/10.5162/SENSOREN2016/3.2.3
bibtex: '@inproceedings{Ester_Struschka_Henning_2016, title={3.2.3 - Direktgravimetrischer
Partikelmasse-Sensor zur quasikontinuierlichen Emissionsmessung}, DOI={10.5162/SENSOREN2016/3.2.3},
publisher={LibreCat University}, author={Ester, S. and Struschka, M. and Henning,
Bernd}, year={2016} }'
chicago: Ester, S., M. Struschka, and Bernd Henning. “3.2.3 - Direktgravimetrischer
Partikelmasse-Sensor Zur Quasikontinuierlichen Emissionsmessung.” LibreCat University,
2016. https://doi.org/10.5162/SENSOREN2016/3.2.3.
ieee: S. Ester, M. Struschka, and B. Henning, “3.2.3 - Direktgravimetrischer Partikelmasse-Sensor
zur quasikontinuierlichen Emissionsmessung,” 2016.
mla: Ester, S., et al. 3.2.3 - Direktgravimetrischer Partikelmasse-Sensor Zur
Quasikontinuierlichen Emissionsmessung. LibreCat University, 2016, doi:10.5162/SENSOREN2016/3.2.3.
short: 'S. Ester, M. Struschka, B. Henning, in: LibreCat University, 2016.'
date_created: 2019-10-15T11:04:18Z
date_updated: 2022-01-06T06:51:45Z
department:
- _id: '49'
doi: 10.5162/SENSOREN2016/3.2.3
language:
- iso: eng
publisher: LibreCat University
status: public
title: 3.2.3 - Direktgravimetrischer Partikelmasse-Sensor zur quasikontinuierlichen
Emissionsmessung
type: conference
user_id: '15911'
year: '2016'
...
---
_id: '139'
abstract:
- lang: eng
text: 'We consider online optimization problems in which certain goods have to be
acquired in order to provide a service or infrastructure. Classically, decisions
for such problems are considered as final: one buys the goods. However, in many
real world applications, there is a shift away from the idea of buying goods.
Instead, leasing is often a more flexible and lucrative business model. Research
has realized this shift and recently initiated the theoretical study of leasing
models (Anthony and Gupta in Proceedings of the integer programming and combinatorial
optimization: 12th International IPCO Conference, Ithaca, NY, USA, June 25–27,
2007; Meyerson in Proceedings of the 46th Annual IEEE Symposium on Foundations
of Computer Science (FOCS 2005), 23–25 Oct 2005, Pittsburgh, PA, USA, 2005; Nagarajan
and Williamson in Discret Optim 10(4):361–370, 2013) We extend this line of work
and suggest a more systematic study of leasing aspects for a class of online optimization
problems. We provide two major technical results. We introduce the leasing variant
of online set multicover and give an O(log(mK)logn)-competitive algorithm (with
n, m, and K being the number of elements, sets, and leases, respectively). Our
results also imply improvements for the non-leasing variant of online set cover.
Moreover, we extend results for the leasing variant of online facility location.
Nagarajan and Williamson (Discret Optim 10(4):361–370, 2013) gave an O(Klogn)-competitive
algorithm for this problem (with n and K being the number of clients and leases,
respectively). We remove the dependency on n (and, thereby, on time). In general,
this leads to a bound of O(lmaxloglmax) (with the maximal lease length lmax).
For many natural problem instances, the bound improves to O(K2).'
author:
- first_name: Sebastian
full_name: Abshoff, Sebastian
last_name: Abshoff
- first_name: Peter
full_name: Kling, Peter
last_name: Kling
- first_name: Christine
full_name: Markarian, Christine
id: '37612'
last_name: Markarian
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: 'Peter '
full_name: 'Pietrzyk, Peter '
last_name: Pietrzyk
citation:
ama: Abshoff S, Kling P, Markarian C, Meyer auf der Heide F, Pietrzyk P. Towards
the price of leasing online. Journal of Combinatorial Optimization. 2016;(4):1197--1216.
doi:10.1007/s10878-015-9915-5
apa: Abshoff, S., Kling, P., Markarian, C., Meyer auf der Heide, F., & Pietrzyk,
P. (2016). Towards the price of leasing online. Journal of Combinatorial Optimization,
(4), 1197--1216. https://doi.org/10.1007/s10878-015-9915-5
bibtex: '@article{Abshoff_Kling_Markarian_Meyer auf der Heide_Pietrzyk_2016, title={Towards
the price of leasing online}, DOI={10.1007/s10878-015-9915-5},
number={4}, journal={Journal of Combinatorial Optimization}, publisher={Springer},
author={Abshoff, Sebastian and Kling, Peter and Markarian, Christine and Meyer
auf der Heide, Friedhelm and Pietrzyk, Peter }, year={2016}, pages={1197--1216}
}'
chicago: 'Abshoff, Sebastian, Peter Kling, Christine Markarian, Friedhelm Meyer
auf der Heide, and Peter Pietrzyk. “Towards the Price of Leasing Online.” Journal
of Combinatorial Optimization, no. 4 (2016): 1197--1216. https://doi.org/10.1007/s10878-015-9915-5.'
ieee: S. Abshoff, P. Kling, C. Markarian, F. Meyer auf der Heide, and P. Pietrzyk,
“Towards the price of leasing online,” Journal of Combinatorial Optimization,
no. 4, pp. 1197--1216, 2016.
mla: Abshoff, Sebastian, et al. “Towards the Price of Leasing Online.” Journal
of Combinatorial Optimization, no. 4, Springer, 2016, pp. 1197--1216, doi:10.1007/s10878-015-9915-5.
short: S. Abshoff, P. Kling, C. Markarian, F. Meyer auf der Heide, P. Pietrzyk,
Journal of Combinatorial Optimization (2016) 1197--1216.
date_created: 2017-10-17T12:41:18Z
date_updated: 2022-01-06T06:51:46Z
ddc:
- '000'
department:
- _id: '63'
doi: 10.1007/s10878-015-9915-5
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T15:57:25Z
date_updated: 2018-11-02T15:57:25Z
file_id: '5318'
file_name: Abshoff-TowardsThePriceOfLeasingOnline.pdf
file_size: 654903
relation: main_file
success: 1
file_date_updated: 2018-11-02T15:57:25Z
has_accepted_license: '1'
issue: '4'
language:
- iso: eng
page: ' 1197--1216'
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '16'
name: SFB 901 - Subprojekt C4
- _id: '2'
name: SFB 901 - Project Area A
- _id: '4'
name: SFB 901 - Project Area C
publication: Journal of Combinatorial Optimization
publisher: Springer
status: public
title: Towards the price of leasing online
type: journal_article
user_id: '477'
year: '2016'
...