---
_id: '46379'
abstract:
- lang: eng
text: In multiobjective optimization, set-based performance indicators are commonly
used to assess the quality of a Pareto front approximation. Based on the scalarization
obtained by these indicators, a performance comparison of multiobjective optimization
algorithms becomes possible. The R2 and the Hypervolume (HV) indicator represent
two recommended approaches which have shown a correlated behavior in recent empirical
studies. Whereas the HV indicator has been comprehensively analyzed in the last
years, almost no studies on the R2 indicator exist. In this extended version of
our previous conference paper, we thus perform a comprehensive investigation of
the properties of the R2 indicator in a theoretical and empirical way. The influence
of the number and distribution of the weight vectors on the optimal distribution
of µ solutions is analyzed. Based on a comparative analysis, specific characteristics
and differences of the R2 and HV indicator are presented. Furthermore, the R2
indicator is integrated into an indicator-based steady-state evolutionary multiobjective
optimization algorithm (EMOA). It is shown that the so-called R2-EMOA can accurately
approximate the optimal distribution of µ solutions regarding R2.
author:
- first_name: D
full_name: Brockhoff, D
last_name: Brockhoff
- first_name: T
full_name: Wagner, T
last_name: Wagner
- first_name: Heike
full_name: Trautmann, Heike
id: '100740'
last_name: Trautmann
orcid: 0000-0002-9788-8282
citation:
ama: Brockhoff D, Wagner T, Trautmann H. R2 Indicator Based Multiobjective Search.
Evolutionary Computation Journal. 2015;23(3):369–395. doi:10.1162/EVCO_a_00135
apa: Brockhoff, D., Wagner, T., & Trautmann, H. (2015). R2 Indicator Based Multiobjective
Search. Evolutionary Computation Journal, 23(3), 369–395. https://doi.org/10.1162/EVCO_a_00135
bibtex: '@article{Brockhoff_Wagner_Trautmann_2015, title={R2 Indicator Based Multiobjective
Search}, volume={23}, DOI={10.1162/EVCO_a_00135},
number={3}, journal={Evolutionary Computation Journal}, author={Brockhoff, D and
Wagner, T and Trautmann, Heike}, year={2015}, pages={369–395} }'
chicago: 'Brockhoff, D, T Wagner, and Heike Trautmann. “R2 Indicator Based Multiobjective
Search.” Evolutionary Computation Journal 23, no. 3 (2015): 369–395. https://doi.org/10.1162/EVCO_a_00135.'
ieee: 'D. Brockhoff, T. Wagner, and H. Trautmann, “R2 Indicator Based Multiobjective
Search,” Evolutionary Computation Journal, vol. 23, no. 3, pp. 369–395,
2015, doi: 10.1162/EVCO_a_00135.'
mla: Brockhoff, D., et al. “R2 Indicator Based Multiobjective Search.” Evolutionary
Computation Journal, vol. 23, no. 3, 2015, pp. 369–395, doi:10.1162/EVCO_a_00135.
short: D. Brockhoff, T. Wagner, H. Trautmann, Evolutionary Computation Journal 23
(2015) 369–395.
date_created: 2023-08-04T15:28:25Z
date_updated: 2023-10-16T13:42:47Z
department:
- _id: '34'
- _id: '819'
doi: 10.1162/EVCO_a_00135
intvolume: ' 23'
issue: '3'
language:
- iso: eng
page: 369–395
publication: Evolutionary Computation Journal
status: public
title: R2 Indicator Based Multiobjective Search
type: journal_article
user_id: '15504'
volume: 23
year: '2015'
...
---
_id: '46374'
abstract:
- lang: eng
text: "We consider a routing problem for a single vehicle serving customer Locations
in the course of time. A subset of these customers must necessarily be served,
while the complement of this subset contains dynamic customers which request for
service over time, and which do not necessarily need to be served. The decision
maker’s conflicting goals are serving as many customers as possible as well as
minimizing total travel distance. We solve this bi-objective Problem with an evolutionary
multi-objective algorithm in order to provide an a-posteriori evaluation tool
for enabling decision makers to assess the single objective solution strategies
that they actually use in real-time. We present the modifications to be applied
to the evolutionary multi-objective algorithm NSGA2 in order to solve the routing
problem, we describe a number of real-time single-objective solution strategies,
and we finally use the gained efficient trade-off solutions of NSGA2 to exemplarily
evaluate the real-time strategies. Our results show that the evolutionary multi-objective
approach is well-suited to generate benchmarks for assessing dynamic heuristic
strategies. Our findings point into future directions for designing dynamic multi-objective
approaches for the vehicle routing problem with time windows.\r\n"
author:
- first_name: C
full_name: Grimme, C
last_name: Grimme
- first_name: S
full_name: Meisel, S
last_name: Meisel
- first_name: Heike
full_name: Trautmann, Heike
id: '100740'
last_name: Trautmann
orcid: 0000-0002-9788-8282
- first_name: G
full_name: Rudolph, G
last_name: Rudolph
- first_name: M
full_name: Wölck, M
last_name: Wölck
citation:
ama: 'Grimme C, Meisel S, Trautmann H, Rudolph G, Wölck M. Multi-Objective Analysis
of Approaches to Dynamic Routing Of a Vehicle. In: Proceedings of the European
Conference On Information Systems. ; 2015.'
apa: Grimme, C., Meisel, S., Trautmann, H., Rudolph, G., & Wölck, M. (2015).
Multi-Objective Analysis of Approaches to Dynamic Routing Of a Vehicle. Proceedings
of the European Conference On Information Systems.
bibtex: '@inproceedings{Grimme_Meisel_Trautmann_Rudolph_Wölck_2015, place={Münster,
Germany}, title={Multi-Objective Analysis of Approaches to Dynamic Routing Of
a Vehicle}, booktitle={Proceedings of the European Conference On Information Systems},
author={Grimme, C and Meisel, S and Trautmann, Heike and Rudolph, G and Wölck,
M}, year={2015} }'
chicago: Grimme, C, S Meisel, Heike Trautmann, G Rudolph, and M Wölck. “Multi-Objective
Analysis of Approaches to Dynamic Routing Of a Vehicle.” In Proceedings of
the European Conference On Information Systems. Münster, Germany, 2015.
ieee: C. Grimme, S. Meisel, H. Trautmann, G. Rudolph, and M. Wölck, “Multi-Objective
Analysis of Approaches to Dynamic Routing Of a Vehicle,” 2015.
mla: Grimme, C., et al. “Multi-Objective Analysis of Approaches to Dynamic Routing
Of a Vehicle.” Proceedings of the European Conference On Information Systems,
2015.
short: 'C. Grimme, S. Meisel, H. Trautmann, G. Rudolph, M. Wölck, in: Proceedings
of the European Conference On Information Systems, Münster, Germany, 2015.'
date_created: 2023-08-04T15:21:44Z
date_updated: 2023-10-16T13:41:16Z
department:
- _id: '34'
- _id: '819'
language:
- iso: eng
place: Münster, Germany
publication: Proceedings of the European Conference On Information Systems
status: public
title: Multi-Objective Analysis of Approaches to Dynamic Routing Of a Vehicle
type: conference
user_id: '15504'
year: '2015'
...
---
_id: '46380'
abstract:
- lang: eng
text: 'We present methods to answer two basic questions that arise when benchmarking
optimization algorithms. The first one is: which algorithm is the "best" one?
and the second one is: which algorithm should I use for my real-world problem?
Both are connected and neither is easy to answer. We present a theoretical framework
for designing and analyzing the raw data of such benchmark experiments. This represents
a first step in answering the aforementioned questions. The 2009 and 2010 BBOB
benchmark results are analyzed by means of this framework and we derive insight
regarding the answers to the two questions. Furthermore, we discuss how to properly
aggregate rankings from algorithm evaluations on individual problems into a consensus,
its theoretical background and which common pitfalls should be avoided. Finally,
we address the grouping of test problems into sets with similar optimizer rankings
and investigate whether these are reflected by already proposed test problem characteristics,
finding that this is not always the case.'
author:
- first_name: O
full_name: Mersmann, O
last_name: Mersmann
- first_name: M
full_name: Preuss, M
last_name: Preuss
- first_name: Heike
full_name: Trautmann, Heike
id: '100740'
last_name: Trautmann
orcid: 0000-0002-9788-8282
- first_name: B
full_name: Bischl, B
last_name: Bischl
- first_name: C
full_name: Weihs, C
last_name: Weihs
citation:
ama: Mersmann O, Preuss M, Trautmann H, Bischl B, Weihs C. Analyzing the BBOB Results
by Means of Benchmarking Concepts. Evolutionary Computation Journal. 2015;23(1):161–185.
apa: Mersmann, O., Preuss, M., Trautmann, H., Bischl, B., & Weihs, C. (2015).
Analyzing the BBOB Results by Means of Benchmarking Concepts. Evolutionary
Computation Journal, 23(1), 161–185.
bibtex: '@article{Mersmann_Preuss_Trautmann_Bischl_Weihs_2015, title={Analyzing
the BBOB Results by Means of Benchmarking Concepts}, volume={23}, number={1},
journal={Evolutionary Computation Journal}, author={Mersmann, O and Preuss, M
and Trautmann, Heike and Bischl, B and Weihs, C}, year={2015}, pages={161–185}
}'
chicago: 'Mersmann, O, M Preuss, Heike Trautmann, B Bischl, and C Weihs. “Analyzing
the BBOB Results by Means of Benchmarking Concepts.” Evolutionary Computation
Journal 23, no. 1 (2015): 161–185.'
ieee: O. Mersmann, M. Preuss, H. Trautmann, B. Bischl, and C. Weihs, “Analyzing
the BBOB Results by Means of Benchmarking Concepts,” Evolutionary Computation
Journal, vol. 23, no. 1, pp. 161–185, 2015.
mla: Mersmann, O., et al. “Analyzing the BBOB Results by Means of Benchmarking Concepts.”
Evolutionary Computation Journal, vol. 23, no. 1, 2015, pp. 161–185.
short: O. Mersmann, M. Preuss, H. Trautmann, B. Bischl, C. Weihs, Evolutionary Computation
Journal 23 (2015) 161–185.
date_created: 2023-08-04T15:30:11Z
date_updated: 2023-10-16T13:43:06Z
department:
- _id: '34'
- _id: '819'
intvolume: ' 23'
issue: '1'
language:
- iso: eng
page: 161–185
publication: Evolutionary Computation Journal
status: public
title: Analyzing the BBOB Results by Means of Benchmarking Concepts
type: journal_article
user_id: '15504'
volume: 23
year: '2015'
...
---
_id: '48838'
abstract:
- lang: eng
text: 'The majority of algorithms can be controlled or adjusted by parameters. Their
values can substantially affect the algorithms’ performance. Since the manual
exploration of the parameter space is tedious – even for few parameters – several
automatic procedures for parameter tuning have been proposed. Recent approaches
also take into account some characteristic properties of the problem instances,
frequently termed instance features. Our contribution is the proposal of a novel
concept for feature-based algorithm parameter tuning, which applies an approximating
surrogate model for learning the continuous feature-parameter mapping. To accomplish
this, we learn a joint model of the algorithm performance based on both the algorithm
parameters and the instance features. The required data is gathered using a recently
proposed acquisition function for model refinement in surrogate-based optimization:
the profile expected improvement. This function provides an avenue for maximizing
the information required for the feature-parameter mapping, i.e., the mapping
from instance features to the corresponding optimal algorithm parameters. The
approach is validated by applying the tuner to exemplary evolutionary algorithms
and problems, for which theoretically grounded or heuristically determined feature-parameter
mappings are available.'
author:
- first_name: Jakob
full_name: Bossek, Jakob
id: '102979'
last_name: Bossek
orcid: 0000-0002-4121-4668
- first_name: Bernd
full_name: Bischl, Bernd
last_name: Bischl
- first_name: Tobias
full_name: Wagner, Tobias
last_name: Wagner
- first_name: Günter
full_name: Rudolph, Günter
last_name: Rudolph
citation:
ama: 'Bossek J, Bischl B, Wagner T, Rudolph G. Learning Feature-Parameter Mappings
for Parameter Tuning via the Profile Expected Improvement. In: Proceedings
of the Genetic and Evolutionary Computation Conference. GECCO ’15. Association
for Computing Machinery; 2015:1319–1326. doi:10.1145/2739480.2754673'
apa: Bossek, J., Bischl, B., Wagner, T., & Rudolph, G. (2015). Learning Feature-Parameter
Mappings for Parameter Tuning via the Profile Expected Improvement. Proceedings
of the Genetic and Evolutionary Computation Conference, 1319–1326. https://doi.org/10.1145/2739480.2754673
bibtex: '@inproceedings{Bossek_Bischl_Wagner_Rudolph_2015, place={New York, NY,
USA}, series={GECCO ’15}, title={Learning Feature-Parameter Mappings for Parameter
Tuning via the Profile Expected Improvement}, DOI={10.1145/2739480.2754673},
booktitle={Proceedings of the Genetic and Evolutionary Computation Conference},
publisher={Association for Computing Machinery}, author={Bossek, Jakob and Bischl,
Bernd and Wagner, Tobias and Rudolph, Günter}, year={2015}, pages={1319–1326},
collection={GECCO ’15} }'
chicago: 'Bossek, Jakob, Bernd Bischl, Tobias Wagner, and Günter Rudolph. “Learning
Feature-Parameter Mappings for Parameter Tuning via the Profile Expected Improvement.”
In Proceedings of the Genetic and Evolutionary Computation Conference,
1319–1326. GECCO ’15. New York, NY, USA: Association for Computing Machinery,
2015. https://doi.org/10.1145/2739480.2754673.'
ieee: 'J. Bossek, B. Bischl, T. Wagner, and G. Rudolph, “Learning Feature-Parameter
Mappings for Parameter Tuning via the Profile Expected Improvement,” in Proceedings
of the Genetic and Evolutionary Computation Conference, 2015, pp. 1319–1326,
doi: 10.1145/2739480.2754673.'
mla: Bossek, Jakob, et al. “Learning Feature-Parameter Mappings for Parameter Tuning
via the Profile Expected Improvement.” Proceedings of the Genetic and Evolutionary
Computation Conference, Association for Computing Machinery, 2015, pp. 1319–1326,
doi:10.1145/2739480.2754673.
short: 'J. Bossek, B. Bischl, T. Wagner, G. Rudolph, in: Proceedings of the Genetic
and Evolutionary Computation Conference, Association for Computing Machinery,
New York, NY, USA, 2015, pp. 1319–1326.'
date_created: 2023-11-14T15:58:51Z
date_updated: 2023-12-13T10:40:30Z
department:
- _id: '819'
doi: 10.1145/2739480.2754673
extern: '1'
keyword:
- evolutionary algorithms
- model-based optimization
- parameter tuning
language:
- iso: eng
page: 1319–1326
place: New York, NY, USA
publication: Proceedings of the Genetic and Evolutionary Computation Conference
publication_identifier:
isbn:
- 978-1-4503-3472-3
publication_status: published
publisher: Association for Computing Machinery
series_title: GECCO ’15
status: public
title: Learning Feature-Parameter Mappings for Parameter Tuning via the Profile Expected
Improvement
type: conference
user_id: '102979'
year: '2015'
...
---
_id: '48887'
abstract:
- lang: eng
text: 'We evaluate the performance of a multi-objective evolutionary algorithm on
a class of dynamic routing problems with a single vehicle. In particular we focus
on relating algorithmic performance to the most prominent characteristics of problem
instances. The routing problem considers two types of customers: mandatory customers
must be visited whereas optional customers do not necessarily have to be visited.
Moreover, mandatory customers are known prior to the start of the tour whereas
optional customers request for service at later points in time with the vehicle
already being on its way. The multi-objective optimization problem then results
as maximizing the number of visited customers while simultaneously minimizing
total travel time. As an a-posteriori evaluation tool, the evolutionary algorithm
aims at approximating the related Pareto set for specifically designed benchmarking
instances differing in terms of number of customers, geographical layout, fraction
of mandatory customers, and request times of optional customers. Conceptional
and experimental comparisons to online heuristic procedures are provided.'
author:
- first_name: Stephan
full_name: Meisel, Stephan
last_name: Meisel
- first_name: Christian
full_name: Grimme, Christian
last_name: Grimme
- first_name: Jakob
full_name: Bossek, Jakob
id: '102979'
last_name: Bossek
orcid: 0000-0002-4121-4668
- first_name: Martin
full_name: Wölck, Martin
last_name: Wölck
- first_name: Günter
full_name: Rudolph, Günter
last_name: Rudolph
- first_name: Heike
full_name: Trautmann, Heike
last_name: Trautmann
citation:
ama: 'Meisel S, Grimme C, Bossek J, Wölck M, Rudolph G, Trautmann H. Evaluation
of a Multi-Objective EA on Benchmark Instances for Dynamic Routing of a Vehicle.
In: Proceedings of the Genetic and Evolutionary Computation Conference .
GECCO’15. Association for Computing Machinery; 2015:425–432. doi:10.1145/2739480.2754705'
apa: Meisel, S., Grimme, C., Bossek, J., Wölck, M., Rudolph, G., & Trautmann,
H. (2015). Evaluation of a Multi-Objective EA on Benchmark Instances for Dynamic
Routing of a Vehicle. Proceedings of the Genetic and Evolutionary Computation
Conference , 425–432. https://doi.org/10.1145/2739480.2754705
bibtex: '@inproceedings{Meisel_Grimme_Bossek_Wölck_Rudolph_Trautmann_2015, place={New
York, NY, USA}, series={GECCO’15}, title={Evaluation of a Multi-Objective EA on
Benchmark Instances for Dynamic Routing of a Vehicle}, DOI={10.1145/2739480.2754705},
booktitle={Proceedings of the Genetic and Evolutionary Computation Conference
}, publisher={Association for Computing Machinery}, author={Meisel, Stephan and
Grimme, Christian and Bossek, Jakob and Wölck, Martin and Rudolph, Günter and
Trautmann, Heike}, year={2015}, pages={425–432}, collection={GECCO’15} }'
chicago: 'Meisel, Stephan, Christian Grimme, Jakob Bossek, Martin Wölck, Günter
Rudolph, and Heike Trautmann. “Evaluation of a Multi-Objective EA on Benchmark
Instances for Dynamic Routing of a Vehicle.” In Proceedings of the Genetic
and Evolutionary Computation Conference , 425–432. GECCO’15. New York, NY,
USA: Association for Computing Machinery, 2015. https://doi.org/10.1145/2739480.2754705.'
ieee: 'S. Meisel, C. Grimme, J. Bossek, M. Wölck, G. Rudolph, and H. Trautmann,
“Evaluation of a Multi-Objective EA on Benchmark Instances for Dynamic Routing
of a Vehicle,” in Proceedings of the Genetic and Evolutionary Computation Conference
, 2015, pp. 425–432, doi: 10.1145/2739480.2754705.'
mla: Meisel, Stephan, et al. “Evaluation of a Multi-Objective EA on Benchmark Instances
for Dynamic Routing of a Vehicle.” Proceedings of the Genetic and Evolutionary
Computation Conference , Association for Computing Machinery, 2015, pp. 425–432,
doi:10.1145/2739480.2754705.
short: 'S. Meisel, C. Grimme, J. Bossek, M. Wölck, G. Rudolph, H. Trautmann, in:
Proceedings of the Genetic and Evolutionary Computation Conference , Association
for Computing Machinery, New York, NY, USA, 2015, pp. 425–432.'
date_created: 2023-11-14T15:58:59Z
date_updated: 2023-12-13T10:49:06Z
department:
- _id: '819'
doi: 10.1145/2739480.2754705
extern: '1'
keyword:
- combinatorial optimization
- metaheuristics
- multi-objective optimization
- online algorithms
- transportation
language:
- iso: eng
page: 425–432
place: New York, NY, USA
publication: 'Proceedings of the Genetic and Evolutionary Computation Conference '
publication_identifier:
isbn:
- 978-1-4503-3472-3
publisher: Association for Computing Machinery
series_title: GECCO’15
status: public
title: Evaluation of a Multi-Objective EA on Benchmark Instances for Dynamic Routing
of a Vehicle
type: conference
user_id: '102979'
year: '2015'
...
---
_id: '47233'
author:
- first_name: Henning
full_name: Perl, Henning
last_name: Perl
- first_name: Sergej
full_name: Dechand, Sergej
last_name: Dechand
- first_name: Matthew
full_name: Smith, Matthew
last_name: Smith
- first_name: Daniel
full_name: Arp, Daniel
last_name: Arp
- first_name: Fabian
full_name: Yamaguchi, Fabian
last_name: Yamaguchi
- first_name: Konrad
full_name: Rieck, Konrad
last_name: Rieck
- first_name: Sascha
full_name: Fahl, Sascha
last_name: Fahl
- first_name: Yasemin
full_name: Acar, Yasemin
id: '94636'
last_name: Acar
citation:
ama: 'Perl H, Dechand S, Smith M, et al. VCCFinder: Finding Potential Vulnerabilities
in Open-Source Projects to Assist Code Audits. In: Proceedings of the 22nd
ACM SIGSAC Conference on Computer and Communications Security. ACM; 2015.
doi:10.1145/2810103.2813604'
apa: 'Perl, H., Dechand, S., Smith, M., Arp, D., Yamaguchi, F., Rieck, K., Fahl,
S., & Acar, Y. (2015). VCCFinder: Finding Potential Vulnerabilities in Open-Source
Projects to Assist Code Audits. Proceedings of the 22nd ACM SIGSAC Conference
on Computer and Communications Security. https://doi.org/10.1145/2810103.2813604'
bibtex: '@inproceedings{Perl_Dechand_Smith_Arp_Yamaguchi_Rieck_Fahl_Acar_2015, title={VCCFinder:
Finding Potential Vulnerabilities in Open-Source Projects to Assist Code Audits},
DOI={10.1145/2810103.2813604},
booktitle={Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications
Security}, publisher={ACM}, author={Perl, Henning and Dechand, Sergej and Smith,
Matthew and Arp, Daniel and Yamaguchi, Fabian and Rieck, Konrad and Fahl, Sascha
and Acar, Yasemin}, year={2015} }'
chicago: 'Perl, Henning, Sergej Dechand, Matthew Smith, Daniel Arp, Fabian Yamaguchi,
Konrad Rieck, Sascha Fahl, and Yasemin Acar. “VCCFinder: Finding Potential Vulnerabilities
in Open-Source Projects to Assist Code Audits.” In Proceedings of the 22nd
ACM SIGSAC Conference on Computer and Communications Security. ACM, 2015.
https://doi.org/10.1145/2810103.2813604.'
ieee: 'H. Perl et al., “VCCFinder: Finding Potential Vulnerabilities in Open-Source
Projects to Assist Code Audits,” 2015, doi: 10.1145/2810103.2813604.'
mla: 'Perl, Henning, et al. “VCCFinder: Finding Potential Vulnerabilities in Open-Source
Projects to Assist Code Audits.” Proceedings of the 22nd ACM SIGSAC Conference
on Computer and Communications Security, ACM, 2015, doi:10.1145/2810103.2813604.'
short: 'H. Perl, S. Dechand, M. Smith, D. Arp, F. Yamaguchi, K. Rieck, S. Fahl,
Y. Acar, in: Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications
Security, ACM, 2015.'
date_created: 2023-09-22T12:03:10Z
date_updated: 2024-06-05T13:16:23Z
department:
- _id: '34'
- _id: '858'
doi: 10.1145/2810103.2813604
extern: '1'
language:
- iso: eng
publication: Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications
Security
publication_status: published
publisher: ACM
status: public
title: 'VCCFinder: Finding Potential Vulnerabilities in Open-Source Projects to Assist
Code Audits'
type: conference
user_id: '14931'
year: '2015'
...
---
_id: '47232'
author:
- first_name: Marten
full_name: Oltrogge, Marten
last_name: Oltrogge
- first_name: Yasemin
full_name: Acar, Yasemin
id: '94636'
last_name: Acar
- first_name: Sergej
full_name: Dechand, Sergej
last_name: Dechand
- first_name: Matthew
full_name: Smith, Matthew
last_name: Smith
- first_name: Sascha
full_name: Fahl, Sascha
last_name: Fahl
citation:
ama: 'Oltrogge M, Acar Y, Dechand S, Smith M, Fahl S. To Pin or Not to Pin-Helping
App Developers Bullet Proof Their TLS Connections. In: Jung J, Holz T, eds. 24th
USENIX Security Symposium, USENIX Security 15, Washington, D.C., USA, August 12-14,
2015. USENIX Association; 2015:239–254.'
apa: Oltrogge, M., Acar, Y., Dechand, S., Smith, M., & Fahl, S. (2015). To Pin
or Not to Pin-Helping App Developers Bullet Proof Their TLS Connections. In J.
Jung & T. Holz (Eds.), 24th USENIX Security Symposium, USENIX Security
15, Washington, D.C., USA, August 12-14, 2015 (pp. 239–254). USENIX Association.
bibtex: '@inproceedings{Oltrogge_Acar_Dechand_Smith_Fahl_2015, title={To Pin or
Not to Pin-Helping App Developers Bullet Proof Their TLS Connections}, booktitle={24th
USENIX Security Symposium, USENIX Security 15, Washington, D.C., USA, August 12-14,
2015}, publisher={USENIX Association}, author={Oltrogge, Marten and Acar, Yasemin
and Dechand, Sergej and Smith, Matthew and Fahl, Sascha}, editor={Jung, Jaeyeon
and Holz, Thorsten}, year={2015}, pages={239–254} }'
chicago: Oltrogge, Marten, Yasemin Acar, Sergej Dechand, Matthew Smith, and Sascha
Fahl. “To Pin or Not to Pin-Helping App Developers Bullet Proof Their TLS Connections.”
In 24th USENIX Security Symposium, USENIX Security 15, Washington, D.C., USA,
August 12-14, 2015, edited by Jaeyeon Jung and Thorsten Holz, 239–254. USENIX
Association, 2015.
ieee: M. Oltrogge, Y. Acar, S. Dechand, M. Smith, and S. Fahl, “To Pin or Not to
Pin-Helping App Developers Bullet Proof Their TLS Connections,” in 24th USENIX
Security Symposium, USENIX Security 15, Washington, D.C., USA, August 12-14, 2015,
2015, pp. 239–254.
mla: Oltrogge, Marten, et al. “To Pin or Not to Pin-Helping App Developers Bullet
Proof Their TLS Connections.” 24th USENIX Security Symposium, USENIX Security
15, Washington, D.C., USA, August 12-14, 2015, edited by Jaeyeon Jung and
Thorsten Holz, USENIX Association, 2015, pp. 239–254.
short: 'M. Oltrogge, Y. Acar, S. Dechand, M. Smith, S. Fahl, in: J. Jung, T. Holz
(Eds.), 24th USENIX Security Symposium, USENIX Security 15, Washington, D.C.,
USA, August 12-14, 2015, USENIX Association, 2015, pp. 239–254.'
date_created: 2023-09-22T12:01:30Z
date_updated: 2024-06-05T13:16:45Z
department:
- _id: '34'
- _id: '858'
editor:
- first_name: Jaeyeon
full_name: Jung, Jaeyeon
last_name: Jung
- first_name: Thorsten
full_name: Holz, Thorsten
last_name: Holz
extern: '1'
language:
- iso: eng
page: 239–254
publication: 24th USENIX Security Symposium, USENIX Security 15, Washington, D.C.,
USA, August 12-14, 2015
publisher: USENIX Association
status: public
title: To Pin or Not to Pin-Helping App Developers Bullet Proof Their TLS Connections
type: conference
user_id: '14931'
year: '2015'
...
---
_id: '46377'
abstract:
- lang: eng
text: 'We evaluate the performance of a multi-objective evolutionary algorithm on
a class of dynamic routing problems with a single vehicle. In particular we focus
on relating algorithmic performance to the most prominent characteristics of problem
instances. The routing problem considers two types of customers: mandatory customers
must be visited whereas optional customers do not necessarily have to be visited.
Moreover, mandatory customers are known prior to the start of the tour whereas
optional customers request for service at later points in time with the vehicle
already being on its way. The multi-objective optimization problem then results
as maximizing the number of visited customers while simultaneously minimizing
total travel time. As an a-posteriori evaluation tool, the evolutionary algorithm
aims at approximating the related Pareto set for specifically designed benchmarking
instances differing in terms of number of customers, geographical layout, fraction
of mandatory customers, and request times of optional customers. Conceptional
and experimental comparisons to online heuristic procedures are provided.'
author:
- first_name: Stephan
full_name: Meisel, Stephan
last_name: Meisel
- first_name: Christian
full_name: Grimme, Christian
last_name: Grimme
- first_name: Jakob
full_name: Bossek, Jakob
id: '102979'
last_name: Bossek
orcid: 0000-0002-4121-4668
- first_name: Martin
full_name: Wölck, Martin
last_name: Wölck
- first_name: Guenter
full_name: Rudolph, Guenter
last_name: Rudolph
- first_name: Heike
full_name: Trautmann, Heike
id: '100740'
last_name: Trautmann
orcid: 0000-0002-9788-8282
citation:
ama: 'Meisel S, Grimme C, Bossek J, Wölck M, Rudolph G, Trautmann H. Evaluation
of a Multi-Objective EA on Benchmark Instances for Dynamic Routing of a Vehicle.
In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO
’15). ; 2015:425–432. doi:10.1145/2739480.2754705'
apa: Meisel, S., Grimme, C., Bossek, J., Wölck, M., Rudolph, G., & Trautmann,
H. (2015). Evaluation of a Multi-Objective EA on Benchmark Instances for Dynamic
Routing of a Vehicle. Proceedings of the Genetic and Evolutionary Computation
Conference (GECCO ’15), 425–432. https://doi.org/10.1145/2739480.2754705
bibtex: '@inproceedings{Meisel_Grimme_Bossek_Wölck_Rudolph_Trautmann_2015, place={Madrid,
Spain}, title={Evaluation of a Multi-Objective EA on Benchmark Instances for Dynamic
Routing of a Vehicle}, DOI={10.1145/2739480.2754705},
booktitle={Proceedings of the Genetic and Evolutionary Computation Conference
(GECCO ’15)}, author={Meisel, Stephan and Grimme, Christian and Bossek, Jakob
and Wölck, Martin and Rudolph, Guenter and Trautmann, Heike}, year={2015}, pages={425–432}
}'
chicago: Meisel, Stephan, Christian Grimme, Jakob Bossek, Martin Wölck, Guenter
Rudolph, and Heike Trautmann. “Evaluation of a Multi-Objective EA on Benchmark
Instances for Dynamic Routing of a Vehicle.” In Proceedings of the Genetic
and Evolutionary Computation Conference (GECCO ’15), 425–432. Madrid, Spain,
2015. https://doi.org/10.1145/2739480.2754705.
ieee: 'S. Meisel, C. Grimme, J. Bossek, M. Wölck, G. Rudolph, and H. Trautmann,
“Evaluation of a Multi-Objective EA on Benchmark Instances for Dynamic Routing
of a Vehicle,” in Proceedings of the Genetic and Evolutionary Computation Conference
(GECCO ’15), 2015, pp. 425–432, doi: 10.1145/2739480.2754705.'
mla: Meisel, Stephan, et al. “Evaluation of a Multi-Objective EA on Benchmark Instances
for Dynamic Routing of a Vehicle.” Proceedings of the Genetic and Evolutionary
Computation Conference (GECCO ’15), 2015, pp. 425–432, doi:10.1145/2739480.2754705.
short: 'S. Meisel, C. Grimme, J. Bossek, M. Wölck, G. Rudolph, H. Trautmann, in:
Proceedings of the Genetic and Evolutionary Computation Conference (GECCO ’15),
Madrid, Spain, 2015, pp. 425–432.'
date_created: 2023-08-04T15:24:41Z
date_updated: 2024-06-10T11:57:57Z
department:
- _id: '34'
- _id: '819'
doi: 10.1145/2739480.2754705
language:
- iso: eng
page: 425–432
place: Madrid, Spain
publication: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO
’15)
publication_identifier:
isbn:
- 978-1-4503-3472-3
status: public
title: Evaluation of a Multi-Objective EA on Benchmark Instances for Dynamic Routing
of a Vehicle
type: conference
user_id: '15504'
year: '2015'
...
---
_id: '8164'
abstract:
- lang: eng
text: The study of ground state energies of local Hamiltonians has played a fundamental
role in quantum complexity theory. In this paper, we take a new direction by introducing
the physically motivated notion of ``ground state connectivity'' of local Hamiltonians,
which captures problems in areas ranging from quantum stabilizer codes to quantum
memories. We show that determining how ``connected'' the ground space of a local
Hamiltonian is can range from QCMA-complete to PSPACE-complete, as well as NEXP-complete
for an appropriately defined ``succinct'' version of the problem. As a result,
we obtain a natural QCMA-complete problem, a goal which has generally proven difficult
since the conception of QCMA over a decade ago. Our proofs rely on a new technical
tool, the Traversal Lemma, which analyzes the Hilbert space a local unitary evolution
must traverse under certain conditions. We show that this lemma is essentially
tight with respect to the length of the unitary evolution in question.
author:
- first_name: Sevag
full_name: Gharibian, Sevag
id: '71541'
last_name: Gharibian
orcid: 0000-0002-9992-3379
- first_name: Jamie
full_name: Sikora, Jamie
last_name: Sikora
citation:
ama: 'Gharibian S, Sikora J. Ground State Connectivity of Local Hamiltonians. In:
Halld{\’o}rsson MM, Iwama K, Kobayashi N, Speckmann B, eds. International Colloquium
on Automata, Languages, and Programming (ICALP 2015). Springer Berlin Heidelberg;
2015:617-628. doi:10.1007/978-3-662-47672-7_50'
apa: Gharibian, S., & Sikora, J. (2015). Ground State Connectivity of Local
Hamiltonians. In M. M. Halld{\’o}rsson, K. Iwama, N. Kobayashi, & B. Speckmann
(Eds.), International Colloquium on Automata, Languages, and Programming (ICALP
2015) (pp. 617–628). Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-662-47672-7_50
bibtex: '@inproceedings{Gharibian_Sikora_2015, place={Berlin, Heidelberg}, title={Ground
State Connectivity of Local Hamiltonians}, DOI={10.1007/978-3-662-47672-7_50},
booktitle={International Colloquium on Automata, Languages, and Programming (ICALP
2015)}, publisher={Springer Berlin Heidelberg}, author={Gharibian, Sevag and Sikora,
Jamie}, editor={Halld{\’o}rsson, Magn{\’u}s M. and Iwama, Kazuo and Kobayashi,
Naoki and Speckmann, Bettina}, year={2015}, pages={617–628} }'
chicago: 'Gharibian, Sevag, and Jamie Sikora. “Ground State Connectivity of Local
Hamiltonians.” In International Colloquium on Automata, Languages, and Programming
(ICALP 2015), edited by Magn{\’u}s M. Halld{\’o}rsson, Kazuo Iwama, Naoki
Kobayashi, and Bettina Speckmann, 617–28. Berlin, Heidelberg: Springer Berlin
Heidelberg, 2015. https://doi.org/10.1007/978-3-662-47672-7_50.'
ieee: 'S. Gharibian and J. Sikora, “Ground State Connectivity of Local Hamiltonians,”
in International Colloquium on Automata, Languages, and Programming (ICALP
2015), Kyoto, Japan, 2015, pp. 617–628, doi: 10.1007/978-3-662-47672-7_50.'
mla: Gharibian, Sevag, and Jamie Sikora. “Ground State Connectivity of Local Hamiltonians.”
International Colloquium on Automata, Languages, and Programming (ICALP 2015),
edited by Magn{\’u}s M. Halld{\’o}rsson et al., Springer Berlin Heidelberg, 2015,
pp. 617–28, doi:10.1007/978-3-662-47672-7_50.
short: 'S. Gharibian, J. Sikora, in: M.M. Halld{\’o}rsson, K. Iwama, N. Kobayashi,
B. Speckmann (Eds.), International Colloquium on Automata, Languages, and Programming
(ICALP 2015), Springer Berlin Heidelberg, Berlin, Heidelberg, 2015, pp. 617–628.'
conference:
location: Kyoto, Japan
name: International Colloquium on Automata, Languages, and Programming (ICALP)
date_created: 2019-03-01T11:37:54Z
date_updated: 2023-02-28T11:02:07Z
department:
- _id: '623'
- _id: '7'
doi: 10.1007/978-3-662-47672-7_50
editor:
- first_name: Magn{\'u}s M.
full_name: Halld{\'o}rsson, Magn{\'u}s M.
last_name: Halld{\'o}rsson
- first_name: Kazuo
full_name: Iwama, Kazuo
last_name: Iwama
- first_name: Naoki
full_name: Kobayashi, Naoki
last_name: Kobayashi
- first_name: Bettina
full_name: Speckmann, Bettina
last_name: Speckmann
external_id:
arxiv:
- '1409.3182'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1409.3182
oa: '1'
page: 617-628
place: Berlin, Heidelberg
publication: International Colloquium on Automata, Languages, and Programming (ICALP
2015)
publication_identifier:
isbn:
- 978-3-662-47672-7
publication_status: published
publisher: Springer Berlin Heidelberg
status: public
title: Ground State Connectivity of Local Hamiltonians
type: conference
user_id: '71541'
year: '2015'
...
---
_id: '8166'
abstract:
- lang: eng
text: 'Constraint satisfaction problems are a central pillar of modern computational
complexity theory. This survey provides an introduction to the rapidly growing
field of Quantum Hamiltonian Complexity, which includes the study of quantum constraint
satisfaction problems. Over the past decade and a half, this field has witnessed
fundamental breakthroughs, ranging from the establishment of a “Quantum Cook-Levin
Theorem” to deep insights into the structure of 1D low-temperature quantum systems
via so-called area laws. Our aim here is to provide a computer science-oriented
introduction to the subject in order to help bridge the language barrier between
computer scientists and physicists in the field. As such, we include the following
in this survey: (1) The motivations and history of the field, (2) a glossary of
condensed matter physics terms explained in computer-science friendly language,
(3) overviews of central ideas from condensed matter physics, such as indistinguishable
particles, mean field theory, tensor networks, and area laws, and (4) brief expositions
of selected computer science-based results in the area. For example, as part of
the latter, we provide a novel information theoretic presentation of Bravyi’s
polynomial time algorithm for Quantum 2-SAT.'
article_type: review
author:
- first_name: Sevag
full_name: Gharibian, Sevag
id: '71541'
last_name: Gharibian
orcid: 0000-0002-9992-3379
- first_name: Yichen
full_name: Huang, Yichen
last_name: Huang
- first_name: Zeph
full_name: Landau, Zeph
last_name: Landau
- first_name: Seung
full_name: Woo Shin, Seung
last_name: Woo Shin
citation:
ama: Gharibian S, Huang Y, Landau Z, Woo Shin S. Quantum Hamiltonian Complexity.
Foundations and Trends® in Theoretical Computer Science. 2015;10(3):159-282.
doi:10.1561/0400000066
apa: Gharibian, S., Huang, Y., Landau, Z., & Woo Shin, S. (2015). Quantum Hamiltonian
Complexity. Foundations and Trends® in Theoretical Computer Science, 10(3),
159–282. https://doi.org/10.1561/0400000066
bibtex: '@article{Gharibian_Huang_Landau_Woo Shin_2015, title={Quantum Hamiltonian
Complexity}, volume={10}, DOI={10.1561/0400000066},
number={3}, journal={Foundations and Trends® in Theoretical Computer Science},
author={Gharibian, Sevag and Huang, Yichen and Landau, Zeph and Woo Shin, Seung},
year={2015}, pages={159–282} }'
chicago: 'Gharibian, Sevag, Yichen Huang, Zeph Landau, and Seung Woo Shin. “Quantum
Hamiltonian Complexity.” Foundations and Trends® in Theoretical Computer Science
10, no. 3 (2015): 159–282. https://doi.org/10.1561/0400000066.'
ieee: 'S. Gharibian, Y. Huang, Z. Landau, and S. Woo Shin, “Quantum Hamiltonian
Complexity,” Foundations and Trends® in Theoretical Computer Science, vol.
10, no. 3, pp. 159–282, 2015, doi: 10.1561/0400000066.'
mla: Gharibian, Sevag, et al. “Quantum Hamiltonian Complexity.” Foundations and
Trends® in Theoretical Computer Science, vol. 10, no. 3, 2015, pp. 159–282,
doi:10.1561/0400000066.
short: S. Gharibian, Y. Huang, Z. Landau, S. Woo Shin, Foundations and Trends® in
Theoretical Computer Science 10 (2015) 159–282.
date_created: 2019-03-01T11:45:40Z
date_updated: 2023-02-28T11:02:21Z
department:
- _id: '623'
- _id: '7'
doi: 10.1561/0400000066
extern: '1'
external_id:
arxiv:
- '1401.3916'
intvolume: ' 10'
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1401.3916
oa: '1'
page: 159-282
publication: Foundations and Trends® in Theoretical Computer Science
publication_identifier:
issn:
- 1551-305X
publication_status: published
status: public
title: Quantum Hamiltonian Complexity
type: journal_article
user_id: '71541'
volume: 10
year: '2015'
...
---
_id: '8168'
abstract:
- lang: eng
text: "Tensor networks are a central tool in condensed matter physics. In this paper,
we initiate the study of tensor network non-zero testing (TNZ): Given a tensor
network T, does T represent a non-zero vector? We show that TNZ is not in the
Polynomial-Time Hierarchy unless the hierarchy collapses. We next show (among
other results) that the special cases of TNZ on non-negative and injective tensor
networks are in NP. Using this, we make a simple observation: The commuting variant
of the MA-complete stoquastic k-SAT problem on D-dimensional qudits is in NP for
logarithmic k and constant D. This reveals the first class of quantum Hamiltonians
whose commuting variant is known to be in NP for all (1) logarithmic k, (2) constant
D, and (3) for arbitrary interaction graphs.\r\n"
article_type: original
author:
- first_name: Sevag
full_name: Gharibian, Sevag
id: '71541'
last_name: Gharibian
orcid: 0000-0002-9992-3379
- first_name: Zeph
full_name: Landau, Zeph
last_name: Landau
- first_name: Seung
full_name: Woo Shin, Seung
last_name: Woo Shin
- first_name: Guoming
full_name: Wang, Guoming
last_name: Wang
citation:
ama: Gharibian S, Landau Z, Woo Shin S, Wang G. Tensor network non-zero testing.
Quantum Information & Computation. 2015;15(9{\ & }10):885-899.
apa: Gharibian, S., Landau, Z., Woo Shin, S., & Wang, G. (2015). Tensor network
non-zero testing. Quantum Information & Computation, 15(9{\
& }10), 885–899.
bibtex: '@article{Gharibian_Landau_Woo Shin_Wang_2015, title={Tensor network non-zero
testing}, volume={15}, number={9{\ & }10}, journal={Quantum Information &
Computation}, author={Gharibian, Sevag and Landau, Zeph and Woo Shin, Seung and
Wang, Guoming}, year={2015}, pages={885–899} }'
chicago: 'Gharibian, Sevag, Zeph Landau, Seung Woo Shin, and Guoming Wang. “Tensor
Network Non-Zero Testing.” Quantum Information & Computation 15, no.
9{\ & }10 (2015): 885–99.'
ieee: S. Gharibian, Z. Landau, S. Woo Shin, and G. Wang, “Tensor network non-zero
testing,” Quantum Information & Computation, vol. 15, no. 9{\ &
}10, pp. 885–899, 2015.
mla: Gharibian, Sevag, et al. “Tensor Network Non-Zero Testing.” Quantum Information
& Computation, vol. 15, no. 9{\ & }10, 2015, pp. 885–99.
short: S. Gharibian, Z. Landau, S. Woo Shin, G. Wang, Quantum Information &
Computation 15 (2015) 885–899.
date_created: 2019-03-01T11:53:08Z
date_updated: 2023-02-28T11:02:35Z
department:
- _id: '623'
- _id: '7'
extern: '1'
external_id:
arxiv:
- '1406.5279'
intvolume: ' 15'
issue: 9{\&}10
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1406.5279
oa: '1'
page: 885-899
publication: Quantum Information & Computation
publication_status: published
status: public
title: Tensor network non-zero testing
type: journal_article
user_id: '71541'
volume: 15
year: '2015'
...
---
_id: '296'
abstract:
- lang: eng
text: FPGAs are known to permit huge gains in performance and efficiency for suitable
applications but still require reduced design efforts and shorter development
cycles for wider adoption. In this work, we compare the resulting performance
of two design concepts that in different ways promise such increased productivity.
As common starting point, we employ a kernel-centric design approach, where computational
hotspots in an application are identified and individually accelerated on FPGA.
By means of a complex stereo matching application, we evaluate two fundamentally
different design philosophies and approaches for implementing the required kernels
on FPGAs. In the first implementation approach, we designed individually specialized
data flow kernels in a spatial programming language for a Maxeler FPGA platform;
in the alternative design approach, we target a vector coprocessor with large
vector lengths, which is implemented as a form of programmable overlay on the
application FPGAs of a Convey HC-1. We assess both approaches in terms of overall
system performance, raw kernel performance, and performance relative to invested
resources. After compensating for the effects of the underlying hardware platforms,
the specialized dataflow kernels on the Maxeler platform are around 3x faster
than kernels executing on the Convey vector coprocessor. In our concrete scenario,
due to trade-offs between reconfiguration overheads and exposed parallelism, the
advantage of specialized dataflow kernels is reduced to around 2.5x.
article_number: '859425'
author:
- first_name: Tobias
full_name: Kenter, Tobias
id: '3145'
last_name: Kenter
- first_name: Henning
full_name: Schmitz, Henning
last_name: Schmitz
- first_name: Christian
full_name: Plessl, Christian
id: '16153'
last_name: Plessl
orcid: 0000-0001-5728-9982
citation:
ama: Kenter T, Schmitz H, Plessl C. Exploring Tradeoffs between Specialized Kernels
and a Reusable Overlay in a Stereo-Matching Case Study. International Journal
of Reconfigurable Computing (IJRC). 2015;2015. doi:10.1155/2015/859425
apa: Kenter, T., Schmitz, H., & Plessl, C. (2015). Exploring Tradeoffs between
Specialized Kernels and a Reusable Overlay in a Stereo-Matching Case Study. International
Journal of Reconfigurable Computing (IJRC), 2015, Article 859425. https://doi.org/10.1155/2015/859425
bibtex: '@article{Kenter_Schmitz_Plessl_2015, title={Exploring Tradeoffs between
Specialized Kernels and a Reusable Overlay in a Stereo-Matching Case Study}, volume={2015},
DOI={10.1155/2015/859425}, number={859425},
journal={International Journal of Reconfigurable Computing (IJRC)}, publisher={Hindawi},
author={Kenter, Tobias and Schmitz, Henning and Plessl, Christian}, year={2015}
}'
chicago: Kenter, Tobias, Henning Schmitz, and Christian Plessl. “Exploring Tradeoffs
between Specialized Kernels and a Reusable Overlay in a Stereo-Matching Case Study.”
International Journal of Reconfigurable Computing (IJRC) 2015 (2015). https://doi.org/10.1155/2015/859425.
ieee: 'T. Kenter, H. Schmitz, and C. Plessl, “Exploring Tradeoffs between Specialized
Kernels and a Reusable Overlay in a Stereo-Matching Case Study,” International
Journal of Reconfigurable Computing (IJRC), vol. 2015, Art. no. 859425, 2015,
doi: 10.1155/2015/859425.'
mla: Kenter, Tobias, et al. “Exploring Tradeoffs between Specialized Kernels and
a Reusable Overlay in a Stereo-Matching Case Study.” International Journal
of Reconfigurable Computing (IJRC), vol. 2015, 859425, Hindawi, 2015, doi:10.1155/2015/859425.
short: T. Kenter, H. Schmitz, C. Plessl, International Journal of Reconfigurable
Computing (IJRC) 2015 (2015).
date_created: 2017-10-17T12:41:49Z
date_updated: 2023-09-26T13:29:08Z
ddc:
- '040'
department:
- _id: '27'
- _id: '518'
- _id: '78'
doi: 10.1155/2015/859425
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:47:56Z
date_updated: 2018-03-20T07:47:56Z
file_id: '1444'
file_name: 296-859425.pdf
file_size: 2993898
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:47:56Z
has_accepted_license: '1'
intvolume: ' 2015'
language:
- iso: eng
project:
- _id: '1'
grant_number: '160364472'
name: SFB 901
- _id: '14'
grant_number: '160364472'
name: SFB 901 - Subprojekt C2
- _id: '4'
name: SFB 901 - Project Area C
- _id: '34'
grant_number: '610996'
name: Self-Adaptive Virtualisation-Aware High-Performance/Low-Energy Heterogeneous
System Architectures
publication: International Journal of Reconfigurable Computing (IJRC)
publisher: Hindawi
quality_controlled: '1'
status: public
title: Exploring Tradeoffs between Specialized Kernels and a Reusable Overlay in a
Stereo-Matching Case Study
type: journal_article
user_id: '15278'
volume: 2015
year: '2015'
...
---
_id: '303'
abstract:
- lang: eng
text: This paper introduces Binary Acceleration At Runtime(BAAR), an easy-to-use
on-the-fly binary acceleration mechanismwhich aims to tackle the problem of enabling
existentsoftware to automatically utilize accelerators at runtime. BAARis based
on the LLVM Compiler Infrastructure and has aclient-server architecture. The client
runs the program to beaccelerated in an environment which allows program analysisand
profiling. Program parts which are identified as suitable forthe available accelerator
are exported and sent to the server.The server optimizes these program parts for
the acceleratorand provides RPC execution for the client. The client transformsits
program to utilize accelerated execution on the server foroffloaded program parts.
We evaluate our work with a proofof-concept implementation of BAAR that uses an
Intel XeonPhi 5110P as the acceleration target and performs automaticoffloading,
parallelization and vectorization of suitable programparts. The practicality of
BAAR for real-world examples is shownbased on a study of stencil codes. Our results
show a speedup ofup to 4 without any developer-provided hints and 5.77 withhints
over the same code compiled with the Intel Compiler atoptimization level O2 and
running on an Intel Xeon E5-2670machine. Based on our insights gained during implementationand
evaluation we outline future directions of research, e.g.,offloading more fine-granular
program parts than functions, amore sophisticated communication mechanism or introducing
onstack-replacement.
author:
- first_name: Marvin
full_name: Damschen, Marvin
last_name: Damschen
- first_name: Christian
full_name: Plessl, Christian
id: '16153'
last_name: Plessl
orcid: 0000-0001-5728-9982
citation:
ama: 'Damschen M, Plessl C. Easy-to-Use On-The-Fly Binary Program Acceleration on
Many-Cores. In: Proceedings of the 5th International Workshop on Adaptive Self-Tuning
Computing Systems (ADAPT). ; 2015.'
apa: Damschen, M., & Plessl, C. (2015). Easy-to-Use On-The-Fly Binary Program
Acceleration on Many-Cores. Proceedings of the 5th International Workshop on
Adaptive Self-Tuning Computing Systems (ADAPT).
bibtex: '@inproceedings{Damschen_Plessl_2015, title={Easy-to-Use On-The-Fly Binary
Program Acceleration on Many-Cores}, booktitle={Proceedings of the 5th International
Workshop on Adaptive Self-tuning Computing Systems (ADAPT)}, author={Damschen,
Marvin and Plessl, Christian}, year={2015} }'
chicago: Damschen, Marvin, and Christian Plessl. “Easy-to-Use On-The-Fly Binary
Program Acceleration on Many-Cores.” In Proceedings of the 5th International
Workshop on Adaptive Self-Tuning Computing Systems (ADAPT), 2015.
ieee: M. Damschen and C. Plessl, “Easy-to-Use On-The-Fly Binary Program Acceleration
on Many-Cores,” 2015.
mla: Damschen, Marvin, and Christian Plessl. “Easy-to-Use On-The-Fly Binary Program
Acceleration on Many-Cores.” Proceedings of the 5th International Workshop
on Adaptive Self-Tuning Computing Systems (ADAPT), 2015.
short: 'M. Damschen, C. Plessl, in: Proceedings of the 5th International Workshop
on Adaptive Self-Tuning Computing Systems (ADAPT), 2015.'
date_created: 2017-10-17T12:41:51Z
date_updated: 2023-09-26T13:29:59Z
ddc:
- '040'
department:
- _id: '27'
- _id: '518'
- _id: '78'
external_id:
arxiv:
- '1412.3906'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:46:46Z
date_updated: 2019-08-01T09:10:44Z
file_id: '1442'
file_name: 303-plessl15_adapt.pdf
file_size: 1176620
relation: main_file
file_date_updated: 2019-08-01T09:10:44Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
project:
- _id: '1'
grant_number: '160364472'
name: SFB 901
- _id: '14'
grant_number: '160364472'
name: SFB 901 - Subprojekt C2
- _id: '4'
name: SFB 901 - Project Area C
- _id: '34'
grant_number: '610996'
name: Self-Adaptive Virtualisation-Aware High-Performance/Low-Energy Heterogeneous
System Architectures
publication: Proceedings of the 5th International Workshop on Adaptive Self-tuning
Computing Systems (ADAPT)
quality_controlled: '1'
status: public
title: Easy-to-Use On-The-Fly Binary Program Acceleration on Many-Cores
type: conference
user_id: '15278'
year: '2015'
...
---
_id: '1773'
author:
- first_name: Jörn
full_name: Schumacher, Jörn
last_name: Schumacher
- first_name: J.
full_name: T. Anderson, J.
last_name: T. Anderson
- first_name: A.
full_name: Borga, A.
last_name: Borga
- first_name: H.
full_name: Boterenbrood, H.
last_name: Boterenbrood
- first_name: H.
full_name: Chen, H.
last_name: Chen
- first_name: K.
full_name: Chen, K.
last_name: Chen
- first_name: G.
full_name: Drake, G.
last_name: Drake
- first_name: D.
full_name: Francis, D.
last_name: Francis
- first_name: B.
full_name: Gorini, B.
last_name: Gorini
- first_name: F.
full_name: Lanni, F.
last_name: Lanni
- first_name: Giovanna
full_name: Lehmann-Miotto, Giovanna
last_name: Lehmann-Miotto
- first_name: L.
full_name: Levinson, L.
last_name: Levinson
- first_name: J.
full_name: Narevicius, J.
last_name: Narevicius
- first_name: Christian
full_name: Plessl, Christian
id: '16153'
last_name: Plessl
orcid: 0000-0001-5728-9982
- first_name: A.
full_name: Roich, A.
last_name: Roich
- first_name: S.
full_name: Ryu, S.
last_name: Ryu
- first_name: F.
full_name: P. Schreuder, F.
last_name: P. Schreuder
- first_name: Wainer
full_name: Vandelli, Wainer
last_name: Vandelli
- first_name: J.
full_name: Vermeulen, J.
last_name: Vermeulen
- first_name: J.
full_name: Zhang, J.
last_name: Zhang
citation:
ama: 'Schumacher J, T. Anderson J, Borga A, et al. Improving Packet Processing Performance
in the ATLAS FELIX Project – Analysis and Optimization of a Memory-Bounded Algorithm.
In: Proc. Int. Conf. on Distributed Event-Based Systems (DEBS). ACM; 2015.
doi:10.1145/2675743.2771824'
apa: Schumacher, J., T. Anderson, J., Borga, A., Boterenbrood, H., Chen, H., Chen,
K., Drake, G., Francis, D., Gorini, B., Lanni, F., Lehmann-Miotto, G., Levinson,
L., Narevicius, J., Plessl, C., Roich, A., Ryu, S., P. Schreuder, F., Vandelli,
W., Vermeulen, J., & Zhang, J. (2015). Improving Packet Processing Performance
in the ATLAS FELIX Project – Analysis and Optimization of a Memory-Bounded Algorithm.
Proc. Int. Conf. on Distributed Event-Based Systems (DEBS). https://doi.org/10.1145/2675743.2771824
bibtex: '@inproceedings{Schumacher_T. Anderson_Borga_Boterenbrood_Chen_Chen_Drake_Francis_Gorini_Lanni_et
al._2015, title={Improving Packet Processing Performance in the ATLAS FELIX Project
– Analysis and Optimization of a Memory-Bounded Algorithm}, DOI={10.1145/2675743.2771824},
booktitle={Proc. Int. Conf. on Distributed Event-Based Systems (DEBS)}, publisher={ACM},
author={Schumacher, Jörn and T. Anderson, J. and Borga, A. and Boterenbrood, H.
and Chen, H. and Chen, K. and Drake, G. and Francis, D. and Gorini, B. and Lanni,
F. and et al.}, year={2015} }'
chicago: Schumacher, Jörn, J. T. Anderson, A. Borga, H. Boterenbrood, H. Chen, K.
Chen, G. Drake, et al. “Improving Packet Processing Performance in the ATLAS FELIX
Project – Analysis and Optimization of a Memory-Bounded Algorithm.” In Proc.
Int. Conf. on Distributed Event-Based Systems (DEBS). ACM, 2015. https://doi.org/10.1145/2675743.2771824.
ieee: 'J. Schumacher et al., “Improving Packet Processing Performance in
the ATLAS FELIX Project – Analysis and Optimization of a Memory-Bounded Algorithm,”
2015, doi: 10.1145/2675743.2771824.'
mla: Schumacher, Jörn, et al. “Improving Packet Processing Performance in the ATLAS
FELIX Project – Analysis and Optimization of a Memory-Bounded Algorithm.” Proc.
Int. Conf. on Distributed Event-Based Systems (DEBS), ACM, 2015, doi:10.1145/2675743.2771824.
short: 'J. Schumacher, J. T. Anderson, A. Borga, H. Boterenbrood, H. Chen, K. Chen,
G. Drake, D. Francis, B. Gorini, F. Lanni, G. Lehmann-Miotto, L. Levinson, J.
Narevicius, C. Plessl, A. Roich, S. Ryu, F. P. Schreuder, W. Vandelli, J. Vermeulen,
J. Zhang, in: Proc. Int. Conf. on Distributed Event-Based Systems (DEBS), ACM,
2015.'
date_created: 2018-03-23T14:09:33Z
date_updated: 2023-09-26T13:31:01Z
department:
- _id: '27'
- _id: '518'
- _id: '78'
doi: 10.1145/2675743.2771824
language:
- iso: eng
publication: Proc. Int. Conf. on Distributed Event-Based Systems (DEBS)
publisher: ACM
quality_controlled: '1'
status: public
title: Improving Packet Processing Performance in the ATLAS FELIX Project – Analysis
and Optimization of a Memory-Bounded Algorithm
type: conference
user_id: '15278'
year: '2015'
...
---
_id: '1768'
author:
- first_name: Christian
full_name: Plessl, Christian
id: '16153'
last_name: Plessl
orcid: 0000-0001-5728-9982
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
- first_name: Peter J.
full_name: Schreier, Peter J.
last_name: Schreier
citation:
ama: 'Plessl C, Platzner M, Schreier PJ. Aktuelles Schlagwort: Approximate Computing.
Informatik Spektrum. 2015;(5):396-399. doi:10.1007/s00287-015-0911-z'
apa: 'Plessl, C., Platzner, M., & Schreier, P. J. (2015). Aktuelles Schlagwort:
Approximate Computing. Informatik Spektrum, 5, 396–399. https://doi.org/10.1007/s00287-015-0911-z'
bibtex: '@article{Plessl_Platzner_Schreier_2015, title={Aktuelles Schlagwort: Approximate
Computing}, DOI={10.1007/s00287-015-0911-z},
number={5}, journal={Informatik Spektrum}, publisher={Springer}, author={Plessl,
Christian and Platzner, Marco and Schreier, Peter J.}, year={2015}, pages={396–399}
}'
chicago: 'Plessl, Christian, Marco Platzner, and Peter J. Schreier. “Aktuelles Schlagwort:
Approximate Computing.” Informatik Spektrum, no. 5 (2015): 396–99. https://doi.org/10.1007/s00287-015-0911-z.'
ieee: 'C. Plessl, M. Platzner, and P. J. Schreier, “Aktuelles Schlagwort: Approximate
Computing,” Informatik Spektrum, no. 5, pp. 396–399, 2015, doi: 10.1007/s00287-015-0911-z.'
mla: 'Plessl, Christian, et al. “Aktuelles Schlagwort: Approximate Computing.” Informatik
Spektrum, no. 5, Springer, 2015, pp. 396–99, doi:10.1007/s00287-015-0911-z.'
short: C. Plessl, M. Platzner, P.J. Schreier, Informatik Spektrum (2015) 396–399.
date_created: 2018-03-23T13:58:34Z
date_updated: 2023-09-26T13:30:22Z
department:
- _id: '27'
- _id: '518'
- _id: '263'
- _id: '78'
doi: 10.1007/s00287-015-0911-z
issue: '5'
keyword:
- approximate computing
- survey
language:
- iso: eng
page: 396-399
publication: Informatik Spektrum
publisher: Springer
quality_controlled: '1'
status: public
title: 'Aktuelles Schlagwort: Approximate Computing'
type: journal_article
user_id: '15278'
year: '2015'
...
---
_id: '238'
abstract:
- lang: eng
text: In this paper, we study how binary applications can be transparently accelerated
with novel heterogeneous computing resources without requiring any manual porting
or developer-provided hints. Our work is based on Binary Acceleration At Runtime
(BAAR), our previously introduced binary acceleration mechanism that uses the
LLVM Compiler Infrastructure. BAAR is designed as a client-server architecture.
The client runs the program to be accelerated in an environment, which allows
program analysis and profiling and identifies and extracts suitable program parts
to be offloaded. The server compiles and optimizes these offloaded program parts
for the accelerator and offers access to these functions to the client with a
remote procedure call (RPC) interface. Our previous work proved the feasibility
of our approach, but also showed that communication time and overheads limit the
granularity of functions that can be meaningfully offloaded. In this work, we
motivate the importance of a lightweight, high-performance communication between
server and client and present a communication mechanism based on the Message Passing
Interface (MPI). We evaluate our approach by using an Intel Xeon Phi 5110P as
the acceleration target and show that the communication overhead can be reduced
from 40% to 10%, thus enabling even small hotspots to benefit from offloading
to an accelerator.
author:
- first_name: Marvin
full_name: Damschen, Marvin
last_name: Damschen
- first_name: Heinrich
full_name: Riebler, Heinrich
id: '8961'
last_name: Riebler
- first_name: Gavin Francis
full_name: Vaz, Gavin Francis
id: '30332'
last_name: Vaz
- first_name: Christian
full_name: Plessl, Christian
id: '16153'
last_name: Plessl
orcid: 0000-0001-5728-9982
citation:
ama: 'Damschen M, Riebler H, Vaz GF, Plessl C. Transparent offloading of computational
hotspots from binary code to Xeon Phi. In: Proceedings of the 2015 Conference
on Design, Automation and Test in Europe (DATE). EDA Consortium / IEEE; 2015:1078-1083.
doi:10.7873/DATE.2015.1124'
apa: Damschen, M., Riebler, H., Vaz, G. F., & Plessl, C. (2015). Transparent
offloading of computational hotspots from binary code to Xeon Phi. Proceedings
of the 2015 Conference on Design, Automation and Test in Europe (DATE), 1078–1083.
https://doi.org/10.7873/DATE.2015.1124
bibtex: '@inproceedings{Damschen_Riebler_Vaz_Plessl_2015, title={Transparent offloading
of computational hotspots from binary code to Xeon Phi}, DOI={10.7873/DATE.2015.1124},
booktitle={Proceedings of the 2015 Conference on Design, Automation and Test in
Europe (DATE)}, publisher={EDA Consortium / IEEE}, author={Damschen, Marvin and
Riebler, Heinrich and Vaz, Gavin Francis and Plessl, Christian}, year={2015},
pages={1078–1083} }'
chicago: Damschen, Marvin, Heinrich Riebler, Gavin Francis Vaz, and Christian Plessl.
“Transparent Offloading of Computational Hotspots from Binary Code to Xeon Phi.”
In Proceedings of the 2015 Conference on Design, Automation and Test in Europe
(DATE), 1078–83. EDA Consortium / IEEE, 2015. https://doi.org/10.7873/DATE.2015.1124.
ieee: 'M. Damschen, H. Riebler, G. F. Vaz, and C. Plessl, “Transparent offloading
of computational hotspots from binary code to Xeon Phi,” in Proceedings of
the 2015 Conference on Design, Automation and Test in Europe (DATE), 2015,
pp. 1078–1083, doi: 10.7873/DATE.2015.1124.'
mla: Damschen, Marvin, et al. “Transparent Offloading of Computational Hotspots
from Binary Code to Xeon Phi.” Proceedings of the 2015 Conference on Design,
Automation and Test in Europe (DATE), EDA Consortium / IEEE, 2015, pp. 1078–83,
doi:10.7873/DATE.2015.1124.
short: 'M. Damschen, H. Riebler, G.F. Vaz, C. Plessl, in: Proceedings of the 2015
Conference on Design, Automation and Test in Europe (DATE), EDA Consortium / IEEE,
2015, pp. 1078–1083.'
date_created: 2017-10-17T12:41:38Z
date_updated: 2023-09-26T13:31:44Z
ddc:
- '040'
department:
- _id: '27'
- _id: '518'
- _id: '78'
doi: 10.7873/DATE.2015.1124
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T10:29:49Z
date_updated: 2018-03-21T10:29:49Z
file_id: '1500'
file_name: 238-plessl15_date.pdf
file_size: 380552
relation: main_file
success: 1
file_date_updated: 2018-03-21T10:29:49Z
has_accepted_license: '1'
language:
- iso: eng
page: 1078-1083
project:
- _id: '1'
grant_number: '160364472'
name: SFB 901
- _id: '14'
grant_number: '160364472'
name: SFB 901 - Subprojekt C2
- _id: '4'
name: SFB 901 - Project Area C
- _id: '34'
grant_number: '610996'
name: Self-Adaptive Virtualisation-Aware High-Performance/Low-Energy Heterogeneous
System Architectures
publication: Proceedings of the 2015 Conference on Design, Automation and Test in
Europe (DATE)
publisher: EDA Consortium / IEEE
quality_controlled: '1'
status: public
title: Transparent offloading of computational hotspots from binary code to Xeon Phi
type: conference
user_id: '15278'
year: '2015'
...
---
_id: '1775'
abstract:
- lang: eng
text: The ATLAS experiment at CERN is planning full deployment of a new unified
optical link technology for connecting detector front end electronics on the timescale
of the LHC Run 4 (2025). It is estimated that roughly 8000 GBT (GigaBit Transceiver)
links, with transfer rates up to 10.24 Gbps, will replace existing links used
for readout, detector control and distribution of timing and trigger information.
A new class of devices will be needed to interface many GBT links to the rest
of the trigger, data-acquisition and detector control systems. In this paper FELIX
(Front End LInk eXchange) is presented, a PC-based device to route data from and
to multiple GBT links via a high-performance general purpose network capable of
a total throughput up to O(20 Tbps). FELIX implies architectural changes to the
ATLAS data acquisition system, such as the use of industry standard COTS components
early in the DAQ chain. Additionally the design and implementation of a FELIX
demonstration platform is presented and hardware and software aspects will be
discussed.
article_number: '082050'
author:
- first_name: J
full_name: Anderson, J
last_name: Anderson
- first_name: A
full_name: Borga, A
last_name: Borga
- first_name: H
full_name: Boterenbrood, H
last_name: Boterenbrood
- first_name: H
full_name: Chen, H
last_name: Chen
- first_name: K
full_name: Chen, K
last_name: Chen
- first_name: G
full_name: Drake, G
last_name: Drake
- first_name: D
full_name: Francis, D
last_name: Francis
- first_name: B
full_name: Gorini, B
last_name: Gorini
- first_name: F
full_name: Lanni, F
last_name: Lanni
- first_name: G
full_name: Lehmann Miotto, G
last_name: Lehmann Miotto
- first_name: L
full_name: Levinson, L
last_name: Levinson
- first_name: J
full_name: Narevicius, J
last_name: Narevicius
- first_name: Christian
full_name: Plessl, Christian
id: '16153'
last_name: Plessl
orcid: 0000-0001-5728-9982
- first_name: A
full_name: Roich, A
last_name: Roich
- first_name: S
full_name: Ryu, S
last_name: Ryu
- first_name: F
full_name: Schreuder, F
last_name: Schreuder
- first_name: Jörn
full_name: Schumacher, Jörn
last_name: Schumacher
- first_name: Wainer
full_name: Vandelli, Wainer
last_name: Vandelli
- first_name: J
full_name: Vermeulen, J
last_name: Vermeulen
- first_name: J
full_name: Zhang, J
last_name: Zhang
citation:
ama: 'Anderson J, Borga A, Boterenbrood H, et al. FELIX: a High-Throughput Network
Approach for Interfacing to Front End Electronics for ATLAS Upgrades. Journal
of Physics: Conference Series. 2015;664. doi:10.1088/1742-6596/664/8/082050'
apa: 'Anderson, J., Borga, A., Boterenbrood, H., Chen, H., Chen, K., Drake, G.,
Francis, D., Gorini, B., Lanni, F., Lehmann Miotto, G., Levinson, L., Narevicius,
J., Plessl, C., Roich, A., Ryu, S., Schreuder, F., Schumacher, J., Vandelli, W.,
Vermeulen, J., & Zhang, J. (2015). FELIX: a High-Throughput Network Approach
for Interfacing to Front End Electronics for ATLAS Upgrades. Journal of Physics:
Conference Series, 664, Article 082050. https://doi.org/10.1088/1742-6596/664/8/082050'
bibtex: '@article{Anderson_Borga_Boterenbrood_Chen_Chen_Drake_Francis_Gorini_Lanni_Lehmann
Miotto_et al._2015, title={FELIX: a High-Throughput Network Approach for Interfacing
to Front End Electronics for ATLAS Upgrades}, volume={664}, DOI={10.1088/1742-6596/664/8/082050},
number={082050}, journal={Journal of Physics: Conference Series}, publisher={IOP
Publishing}, author={Anderson, J and Borga, A and Boterenbrood, H and Chen, H
and Chen, K and Drake, G and Francis, D and Gorini, B and Lanni, F and Lehmann
Miotto, G and et al.}, year={2015} }'
chicago: 'Anderson, J, A Borga, H Boterenbrood, H Chen, K Chen, G Drake, D Francis,
et al. “FELIX: A High-Throughput Network Approach for Interfacing to Front End
Electronics for ATLAS Upgrades.” Journal of Physics: Conference Series
664 (2015). https://doi.org/10.1088/1742-6596/664/8/082050.'
ieee: 'J. Anderson et al., “FELIX: a High-Throughput Network Approach for
Interfacing to Front End Electronics for ATLAS Upgrades,” Journal of Physics:
Conference Series, vol. 664, Art. no. 082050, 2015, doi: 10.1088/1742-6596/664/8/082050.'
mla: 'Anderson, J., et al. “FELIX: A High-Throughput Network Approach for Interfacing
to Front End Electronics for ATLAS Upgrades.” Journal of Physics: Conference
Series, vol. 664, 082050, IOP Publishing, 2015, doi:10.1088/1742-6596/664/8/082050.'
short: 'J. Anderson, A. Borga, H. Boterenbrood, H. Chen, K. Chen, G. Drake, D. Francis,
B. Gorini, F. Lanni, G. Lehmann Miotto, L. Levinson, J. Narevicius, C. Plessl,
A. Roich, S. Ryu, F. Schreuder, J. Schumacher, W. Vandelli, J. Vermeulen, J. Zhang,
Journal of Physics: Conference Series 664 (2015).'
date_created: 2018-03-23T14:19:27Z
date_updated: 2023-09-26T13:31:23Z
department:
- _id: '27'
- _id: '518'
doi: 10.1088/1742-6596/664/8/082050
intvolume: ' 664'
language:
- iso: eng
publication: 'Journal of Physics: Conference Series'
publisher: IOP Publishing
quality_controlled: '1'
status: public
title: 'FELIX: a High-Throughput Network Approach for Interfacing to Front End Electronics
for ATLAS Upgrades'
type: journal_article
user_id: '15278'
volume: 664
year: '2015'
...
---
_id: '60446'
author:
- first_name: Marcel
full_name: Campen, Marcel
id: '114904'
last_name: Campen
orcid: 0000-0003-2340-3462
citation:
ama: 'Campen M. Quad Layouts: Generation and Optimization of Conforming Quadrilateral
Surface Partitions. RWTH Aachen University, Germany; 2015.'
apa: 'Campen, M. (2015). Quad layouts: generation and optimization of conforming
quadrilateral surface partitions. RWTH Aachen University, Germany.'
bibtex: '@book{Campen_2015, title={Quad layouts: generation and optimization of
conforming quadrilateral surface partitions}, publisher={RWTH Aachen University,
Germany}, author={Campen, Marcel}, year={2015} }'
chicago: 'Campen, Marcel. Quad Layouts: Generation and Optimization of Conforming
Quadrilateral Surface Partitions. RWTH Aachen University, Germany, 2015.'
ieee: 'M. Campen, Quad layouts: generation and optimization of conforming quadrilateral
surface partitions. RWTH Aachen University, Germany, 2015.'
mla: 'Campen, Marcel. Quad Layouts: Generation and Optimization of Conforming
Quadrilateral Surface Partitions. RWTH Aachen University, Germany, 2015.'
short: 'M. Campen, Quad Layouts: Generation and Optimization of Conforming Quadrilateral
Surface Partitions, RWTH Aachen University, Germany, 2015.'
date_created: 2025-06-27T10:25:19Z
date_updated: 2025-07-14T12:41:18Z
department:
- _id: '969'
extern: '1'
language:
- iso: eng
publisher: RWTH Aachen University, Germany
status: public
title: 'Quad layouts: generation and optimization of conforming quadrilateral surface
partitions'
type: dissertation
user_id: '114904'
year: '2015'
...
---
_id: '60442'
abstract:
- lang: eng
text: 'Global surface parametrization often requires the use of cuts or
charts due to non-trivial topology. In recent years a focus has been on so-calledseamlessparametrizations,
where the transition functions across the cuts are rigid transformations with
a rotation about some multiple of 90°. Of particular interest, e.g. for quadrilateral
meshing, paneling, or texturing, are those instances where in addition the translational
part of these transitions is integral (or more generally: quantized). We show
that finding not even the optimal, but just an arbitrary valid quantization (one
that does not imply parametric degeneracies), is a complex combinatorial problem.
We present a novel method that allows us to solve it, i.e. to find valid as well
as good quality quantizations. It is based on an original approach to quickly
construct solutions to linear Diophantine equation systems, exploiting the specific
geometric nature of the parametrization problem. We thereby largely outperform
the state-of-the-art, sometimes by several orders of magnitude.'
author:
- first_name: Marcel
full_name: Campen, Marcel
id: '114904'
last_name: Campen
orcid: 0000-0003-2340-3462
- first_name: David
full_name: Bommes, David
last_name: Bommes
- first_name: Leif
full_name: Kobbelt, Leif
last_name: Kobbelt
citation:
ama: Campen M, Bommes D, Kobbelt L. Quantized global parametrization. ACM Transactions
on Graphics. 2015;34(6):1-12. doi:10.1145/2816795.2818140
apa: Campen, M., Bommes, D., & Kobbelt, L. (2015). Quantized global parametrization.
ACM Transactions on Graphics, 34(6), 1–12. https://doi.org/10.1145/2816795.2818140
bibtex: '@article{Campen_Bommes_Kobbelt_2015, title={Quantized global parametrization},
volume={34}, DOI={10.1145/2816795.2818140},
number={6}, journal={ACM Transactions on Graphics}, publisher={Association for
Computing Machinery (ACM)}, author={Campen, Marcel and Bommes, David and Kobbelt,
Leif}, year={2015}, pages={1–12} }'
chicago: 'Campen, Marcel, David Bommes, and Leif Kobbelt. “Quantized Global Parametrization.”
ACM Transactions on Graphics 34, no. 6 (2015): 1–12. https://doi.org/10.1145/2816795.2818140.'
ieee: 'M. Campen, D. Bommes, and L. Kobbelt, “Quantized global parametrization,”
ACM Transactions on Graphics, vol. 34, no. 6, pp. 1–12, 2015, doi: 10.1145/2816795.2818140.'
mla: Campen, Marcel, et al. “Quantized Global Parametrization.” ACM Transactions
on Graphics, vol. 34, no. 6, Association for Computing Machinery (ACM), 2015,
pp. 1–12, doi:10.1145/2816795.2818140.
short: M. Campen, D. Bommes, L. Kobbelt, ACM Transactions on Graphics 34 (2015)
1–12.
date_created: 2025-06-27T10:19:04Z
date_updated: 2025-07-14T12:41:34Z
department:
- _id: '969'
doi: 10.1145/2816795.2818140
extern: '1'
intvolume: ' 34'
issue: '6'
language:
- iso: eng
page: 1-12
publication: ACM Transactions on Graphics
publication_identifier:
issn:
- 0730-0301
- 1557-7368
publication_status: published
publisher: Association for Computing Machinery (ACM)
status: public
title: Quantized global parametrization
type: journal_article
user_id: '117512'
volume: 34
year: '2015'
...
---
_id: '52869'
author:
- first_name: Eva
full_name: Hansen, Eva
last_name: Hansen
- first_name: Britta
full_name: Grimme, Britta
last_name: Grimme
- first_name: Hendrik
full_name: Reimann, Hendrik
last_name: Reimann
- first_name: Gregor
full_name: Schöner, Gregor
last_name: Schöner
citation:
ama: Hansen E, Grimme B, Reimann H, Schöner G. Carry-over coarticulation in joint
angles. Experimental brain research. 2015;233:2555–2569.
apa: Hansen, E., Grimme, B., Reimann, H., & Schöner, G. (2015). Carry-over coarticulation
in joint angles. Experimental Brain Research, 233, 2555–2569.
bibtex: '@article{Hansen_Grimme_Reimann_Schöner_2015, title={Carry-over coarticulation
in joint angles}, volume={233}, journal={Experimental brain research}, publisher={Springer},
author={Hansen, Eva and Grimme, Britta and Reimann, Hendrik and Schöner, Gregor},
year={2015}, pages={2555–2569} }'
chicago: 'Hansen, Eva, Britta Grimme, Hendrik Reimann, and Gregor Schöner. “Carry-over
Coarticulation in Joint Angles.” Experimental Brain Research 233 (2015):
2555–2569.'
ieee: E. Hansen, B. Grimme, H. Reimann, and G. Schöner, “Carry-over coarticulation
in joint angles,” Experimental brain research, vol. 233, pp. 2555–2569,
2015.
mla: Hansen, Eva, et al. “Carry-over Coarticulation in Joint Angles.” Experimental
Brain Research, vol. 233, Springer, 2015, pp. 2555–2569.
short: E. Hansen, B. Grimme, H. Reimann, G. Schöner, Experimental Brain Research
233 (2015) 2555–2569.
date_created: 2024-03-25T15:01:19Z
date_updated: 2026-03-19T07:49:03Z
department:
- _id: '819'
intvolume: ' 233'
page: 2555–2569
publication: Experimental brain research
publisher: Springer
status: public
title: Carry-over coarticulation in joint angles
type: journal_article
user_id: '103682'
volume: 233
year: '2015'
...