---
_id: '46388'
abstract:
- lang: eng
text: Understanding the behaviour of well-known algorithms for classical NP-hard
optimisation problems is still a difficult task. With this paper, we contribute
to this research direction and carry out a feature based comparison of local search
and the well-known Christofides approximation algorithm for the Traveling Salesperson
Problem. We use an evolutionary algorithm approach to construct easy and hard
instances for the Christofides algorithm, where we measure hardness in terms of
approximation ratio. Our results point out important features and lead to hard
and easy instances for this famous algorithm. Furthermore, our cross-comparison
gives new insights on the complementary benefits of the different approaches.
author:
- first_name: Samadhi
full_name: Nallaperuma, Samadhi
last_name: Nallaperuma
- first_name: Markus
full_name: Wagner, Markus
last_name: Wagner
- first_name: Frank
full_name: Neumann, Frank
last_name: Neumann
- first_name: Bernd
full_name: Bischl, Bernd
last_name: Bischl
- first_name: Olaf
full_name: Mersmann, Olaf
last_name: Mersmann
- first_name: Heike
full_name: Trautmann, Heike
id: '100740'
last_name: Trautmann
orcid: 0000-0002-9788-8282
citation:
ama: 'Nallaperuma S, Wagner M, Neumann F, Bischl B, Mersmann O, Trautmann H. A Feature-Based
Comparison of Local Search and the Christofides Algorithm for the Travelling Salesperson
Problem. In: Proceedings of the Twelfth Workshop on Foundations of Genetic
Algorithms XII. FOGA XII ’13. Association for Computing Machinery; 2013:147–160.
doi:10.1145/2460239.2460253'
apa: Nallaperuma, S., Wagner, M., Neumann, F., Bischl, B., Mersmann, O., & Trautmann,
H. (2013). A Feature-Based Comparison of Local Search and the Christofides Algorithm
for the Travelling Salesperson Problem. Proceedings of the Twelfth Workshop
on Foundations of Genetic Algorithms XII, 147–160. https://doi.org/10.1145/2460239.2460253
bibtex: '@inproceedings{Nallaperuma_Wagner_Neumann_Bischl_Mersmann_Trautmann_2013,
place={New York, NY, USA}, series={FOGA XII ’13}, title={A Feature-Based Comparison
of Local Search and the Christofides Algorithm for the Travelling Salesperson
Problem}, DOI={10.1145/2460239.2460253},
booktitle={Proceedings of the Twelfth Workshop on Foundations of Genetic Algorithms
XII}, publisher={Association for Computing Machinery}, author={Nallaperuma, Samadhi
and Wagner, Markus and Neumann, Frank and Bischl, Bernd and Mersmann, Olaf and
Trautmann, Heike}, year={2013}, pages={147–160}, collection={FOGA XII ’13} }'
chicago: 'Nallaperuma, Samadhi, Markus Wagner, Frank Neumann, Bernd Bischl, Olaf
Mersmann, and Heike Trautmann. “A Feature-Based Comparison of Local Search and
the Christofides Algorithm for the Travelling Salesperson Problem.” In Proceedings
of the Twelfth Workshop on Foundations of Genetic Algorithms XII, 147–160.
FOGA XII ’13. New York, NY, USA: Association for Computing Machinery, 2013. https://doi.org/10.1145/2460239.2460253.'
ieee: 'S. Nallaperuma, M. Wagner, F. Neumann, B. Bischl, O. Mersmann, and H. Trautmann,
“A Feature-Based Comparison of Local Search and the Christofides Algorithm for
the Travelling Salesperson Problem,” in Proceedings of the Twelfth Workshop
on Foundations of Genetic Algorithms XII, 2013, pp. 147–160, doi: 10.1145/2460239.2460253.'
mla: Nallaperuma, Samadhi, et al. “A Feature-Based Comparison of Local Search and
the Christofides Algorithm for the Travelling Salesperson Problem.” Proceedings
of the Twelfth Workshop on Foundations of Genetic Algorithms XII, Association
for Computing Machinery, 2013, pp. 147–160, doi:10.1145/2460239.2460253.
short: 'S. Nallaperuma, M. Wagner, F. Neumann, B. Bischl, O. Mersmann, H. Trautmann,
in: Proceedings of the Twelfth Workshop on Foundations of Genetic Algorithms XII,
Association for Computing Machinery, New York, NY, USA, 2013, pp. 147–160.'
date_created: 2023-08-04T15:42:03Z
date_updated: 2023-10-16T13:45:53Z
department:
- _id: '34'
- _id: '819'
doi: 10.1145/2460239.2460253
keyword:
- approximation algorithms
- local search
- traveling salesperson problem
- feature selection
- prediction
- classification
language:
- iso: eng
page: 147–160
place: New York, NY, USA
publication: Proceedings of the Twelfth Workshop on Foundations of Genetic Algorithms
XII
publication_identifier:
isbn:
- '9781450319904'
publisher: Association for Computing Machinery
series_title: FOGA XII ’13
status: public
title: A Feature-Based Comparison of Local Search and the Christofides Algorithm for
the Travelling Salesperson Problem
type: conference
user_id: '15504'
year: '2013'
...
---
_id: '46390'
abstract:
- lang: eng
text: In some technical applications like multiobjective online control an evenly
spaced approximation of the Pareto front is desired. Since standard evolutionary
multiobjective optimization (EMO) algorithms have not been designed for that kind
of approximation we propose an archive-based plug-in method that builds an evenly
spaced approximation using averaged Hausdorff measure between archive and reference
front. In case of three objectives this reference font is constructed from a triangulated
approximation of the Pareto front from a previous experiment. The plug-in can
be deployed in online or offline mode for any kind of EMO algorithm.
author:
- first_name: G
full_name: Rudolph, G
last_name: Rudolph
- first_name: Heike
full_name: Trautmann, Heike
id: '100740'
last_name: Trautmann
orcid: 0000-0002-9788-8282
- first_name: S
full_name: Sengupta, S
last_name: Sengupta
- first_name: O
full_name: Schütze, O
last_name: Schütze
citation:
ama: 'Rudolph G, Trautmann H, Sengupta S, Schütze O. Evenly Spaced Pareto Front
Approximations for Tricriteria Problems Based on Triangulation. In: Purshouse
R, Fleming P, Fonseca C, Greco S, Shaw J, eds. Evolutionary Multi-Criterion
Optimization — 7$^th$ International Conference, EMO 2013, Sheffield, UK, Proceedings.
Vol 7811. Lecture Notes in Computer Science. Springer; 2013:443–458. doi:https://doi.org/10.1007/978-3-642-37140-0_34'
apa: Rudolph, G., Trautmann, H., Sengupta, S., & Schütze, O. (2013). Evenly
Spaced Pareto Front Approximations for Tricriteria Problems Based on Triangulation.
In R. Purshouse, P. Fleming, C. Fonseca, S. Greco, & J. Shaw (Eds.), Evolutionary
Multi-Criterion Optimization — 7$^th$ International Conference, EMO 2013, Sheffield,
UK, Proceedings (Vol. 7811, pp. 443–458). Springer. https://doi.org/10.1007/978-3-642-37140-0_34
bibtex: '@inproceedings{Rudolph_Trautmann_Sengupta_Schütze_2013, series={Lecture
Notes in Computer Science}, title={Evenly Spaced Pareto Front Approximations for
Tricriteria Problems Based on Triangulation}, volume={7811}, DOI={https://doi.org/10.1007/978-3-642-37140-0_34},
booktitle={Evolutionary Multi-Criterion Optimization — 7$^th$ International Conference,
EMO 2013, Sheffield, UK, Proceedings}, publisher={Springer}, author={Rudolph,
G and Trautmann, Heike and Sengupta, S and Schütze, O}, editor={Purshouse, RC
and Fleming, PJ and Fonseca, CM and Greco, S and Shaw, J}, year={2013}, pages={443–458},
collection={Lecture Notes in Computer Science} }'
chicago: Rudolph, G, Heike Trautmann, S Sengupta, and O Schütze. “Evenly Spaced
Pareto Front Approximations for Tricriteria Problems Based on Triangulation.”
In Evolutionary Multi-Criterion Optimization — 7$^th$ International Conference,
EMO 2013, Sheffield, UK, Proceedings, edited by RC Purshouse, PJ Fleming,
CM Fonseca, S Greco, and J Shaw, 7811:443–458. Lecture Notes in Computer Science.
Springer, 2013. https://doi.org/10.1007/978-3-642-37140-0_34.
ieee: 'G. Rudolph, H. Trautmann, S. Sengupta, and O. Schütze, “Evenly Spaced Pareto
Front Approximations for Tricriteria Problems Based on Triangulation,” in Evolutionary
Multi-Criterion Optimization — 7$^th$ International Conference, EMO 2013, Sheffield,
UK, Proceedings, 2013, vol. 7811, pp. 443–458, doi: https://doi.org/10.1007/978-3-642-37140-0_34.'
mla: Rudolph, G., et al. “Evenly Spaced Pareto Front Approximations for Tricriteria
Problems Based on Triangulation.” Evolutionary Multi-Criterion Optimization
— 7$^th$ International Conference, EMO 2013, Sheffield, UK, Proceedings, edited
by RC Purshouse et al., vol. 7811, Springer, 2013, pp. 443–458, doi:https://doi.org/10.1007/978-3-642-37140-0_34.
short: 'G. Rudolph, H. Trautmann, S. Sengupta, O. Schütze, in: R. Purshouse, P.
Fleming, C. Fonseca, S. Greco, J. Shaw (Eds.), Evolutionary Multi-Criterion Optimization
— 7$^th$ International Conference, EMO 2013, Sheffield, UK, Proceedings, Springer,
2013, pp. 443–458.'
date_created: 2023-08-04T15:43:38Z
date_updated: 2023-10-16T13:46:35Z
department:
- _id: '34'
- _id: '819'
doi: https://doi.org/10.1007/978-3-642-37140-0_34
editor:
- first_name: RC
full_name: Purshouse, RC
last_name: Purshouse
- first_name: PJ
full_name: Fleming, PJ
last_name: Fleming
- first_name: CM
full_name: Fonseca, CM
last_name: Fonseca
- first_name: S
full_name: Greco, S
last_name: Greco
- first_name: J
full_name: Shaw, J
last_name: Shaw
intvolume: ' 7811'
language:
- iso: eng
page: 443–458
publication: Evolutionary Multi-Criterion Optimization — 7$^th$ International Conference,
EMO 2013, Sheffield, UK, Proceedings
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: Evenly Spaced Pareto Front Approximations for Tricriteria Problems Based on
Triangulation
type: conference
user_id: '15504'
volume: 7811
year: '2013'
...
---
_id: '46391'
abstract:
- lang: eng
text: Indicator based evolutionary algorithms have caught the interest of many researchers
for the treatment of multi-objective optimization problems in the recent past
since they deliver the desired approximation of the solution set and due to a
usually better performance compared to dominance based algorithms. Nevertheless,
these methods still suffer the drawback that many function evaluations are required
to obtain a suitable representation of the solution set. The aim of this study
is to present the Directed Search (DS) Method as local searcher within global
indicator based optimization algorithms. For this, we will present the DS in the
context of hypervolume maximization leading to both a new local search algorithm
and a new memetic algorithm. Further, we will present first attempts to adapt
the DS to a class of parameter dependent problems.
author:
- first_name: VA
full_name: Sosa-Hernandez, VA
last_name: Sosa-Hernandez
- first_name: O
full_name: Schütze, O
last_name: Schütze
- first_name: G
full_name: Rudoph, G
last_name: Rudoph
- first_name: Heike
full_name: Trautmann, Heike
id: '100740'
last_name: Trautmann
orcid: 0000-0002-9788-8282
citation:
ama: 'Sosa-Hernandez V, Schütze O, Rudoph G, Trautmann H. Directed Search Method
for Indicator-based Multi-objective Evolutionary Algorithms. In: Proceeding
of the Fifteenth Annual Conference Companion on Genetic and Evolutionary Computation
Conference Companion. GECCO ’13 Companion. ACM; 2013:1699–1702. doi:10.1145/2464576.2482756'
apa: Sosa-Hernandez, V., Schütze, O., Rudoph, G., & Trautmann, H. (2013). Directed
Search Method for Indicator-based Multi-objective Evolutionary Algorithms. Proceeding
of the Fifteenth Annual Conference Companion on Genetic and Evolutionary Computation
Conference Companion, 1699–1702. https://doi.org/10.1145/2464576.2482756
bibtex: '@inproceedings{Sosa-Hernandez_Schütze_Rudoph_Trautmann_2013, place={New
York, NY, USA}, series={GECCO ’13 Companion}, title={Directed Search Method for
Indicator-based Multi-objective Evolutionary Algorithms}, DOI={10.1145/2464576.2482756},
booktitle={Proceeding of the Fifteenth Annual Conference Companion on Genetic
and Evolutionary Computation Conference Companion}, publisher={ACM}, author={Sosa-Hernandez,
VA and Schütze, O and Rudoph, G and Trautmann, Heike}, year={2013}, pages={1699–1702},
collection={GECCO ’13 Companion} }'
chicago: 'Sosa-Hernandez, VA, O Schütze, G Rudoph, and Heike Trautmann. “Directed
Search Method for Indicator-Based Multi-Objective Evolutionary Algorithms.” In
Proceeding of the Fifteenth Annual Conference Companion on Genetic and Evolutionary
Computation Conference Companion, 1699–1702. GECCO ’13 Companion. New York,
NY, USA: ACM, 2013. https://doi.org/10.1145/2464576.2482756.'
ieee: 'V. Sosa-Hernandez, O. Schütze, G. Rudoph, and H. Trautmann, “Directed Search
Method for Indicator-based Multi-objective Evolutionary Algorithms,” in Proceeding
of the Fifteenth Annual Conference Companion on Genetic and Evolutionary Computation
Conference Companion, 2013, pp. 1699–1702, doi: 10.1145/2464576.2482756.'
mla: Sosa-Hernandez, VA, et al. “Directed Search Method for Indicator-Based Multi-Objective
Evolutionary Algorithms.” Proceeding of the Fifteenth Annual Conference Companion
on Genetic and Evolutionary Computation Conference Companion, ACM, 2013, pp.
1699–1702, doi:10.1145/2464576.2482756.
short: 'V. Sosa-Hernandez, O. Schütze, G. Rudoph, H. Trautmann, in: Proceeding of
the Fifteenth Annual Conference Companion on Genetic and Evolutionary Computation
Conference Companion, ACM, New York, NY, USA, 2013, pp. 1699–1702.'
date_created: 2023-08-04T15:45:26Z
date_updated: 2023-10-16T13:46:54Z
department:
- _id: '34'
- _id: '819'
doi: 10.1145/2464576.2482756
language:
- iso: eng
page: 1699–1702
place: New York, NY, USA
publication: Proceeding of the Fifteenth Annual Conference Companion on Genetic and
Evolutionary Computation Conference Companion
publisher: ACM
series_title: GECCO ’13 Companion
status: public
title: Directed Search Method for Indicator-based Multi-objective Evolutionary Algorithms
type: conference
user_id: '15504'
year: '2013'
...
---
_id: '46387'
abstract:
- lang: eng
text: Here we address the problem of computing finite size Hausdorff approximations
of the Pareto front of four-objective optimization problems by means of evolutionary
computing. Since many applications desire an approximation evenly spread along
the Pareto front and approximations that are good in the Hausdorff sense are typically
evenly spread along the Pareto front we consider three different evolutionary
multi-objective algorithms tailored to that purpose, where two of them are based
on the Part and Selection Algorithm (PSA). Finally, we present some numerical
results indicating the strength of the novel methods.
author:
- first_name: C
full_name: Dominguez-Medina, C
last_name: Dominguez-Medina
- first_name: G
full_name: Rudolph, G
last_name: Rudolph
- first_name: O
full_name: Schütze, O
last_name: Schütze
- first_name: Heike
full_name: Trautmann, Heike
id: '100740'
last_name: Trautmann
orcid: 0000-0002-9788-8282
citation:
ama: 'Dominguez-Medina C, Rudolph G, Schütze O, Trautmann H. Evenly spaced Pareto
fronts of quad-objective problems using PSA partitioning technique. In: Proceedings
of the 2013 IEEE Congress on Evolutionary Computation (CEC). ; 2013:3190–3197.
doi:https://doi.org/10.1109/CEC.2013.6557960'
apa: Dominguez-Medina, C., Rudolph, G., Schütze, O., & Trautmann, H. (2013).
Evenly spaced Pareto fronts of quad-objective problems using PSA partitioning
technique. Proceedings of the 2013 IEEE Congress on Evolutionary Computation
(CEC), 3190–3197. https://doi.org/10.1109/CEC.2013.6557960
bibtex: '@inproceedings{Dominguez-Medina_Rudolph_Schütze_Trautmann_2013, place={Cancun,
Mexico}, title={Evenly spaced Pareto fronts of quad-objective problems using PSA
partitioning technique}, DOI={https://doi.org/10.1109/CEC.2013.6557960},
booktitle={Proceedings of the 2013 IEEE Congress on Evolutionary Computation (CEC)},
author={Dominguez-Medina, C and Rudolph, G and Schütze, O and Trautmann, Heike},
year={2013}, pages={3190–3197} }'
chicago: Dominguez-Medina, C, G Rudolph, O Schütze, and Heike Trautmann. “Evenly
Spaced Pareto Fronts of Quad-Objective Problems Using PSA Partitioning Technique.”
In Proceedings of the 2013 IEEE Congress on Evolutionary Computation (CEC),
3190–3197. Cancun, Mexico, 2013. https://doi.org/10.1109/CEC.2013.6557960.
ieee: 'C. Dominguez-Medina, G. Rudolph, O. Schütze, and H. Trautmann, “Evenly spaced
Pareto fronts of quad-objective problems using PSA partitioning technique,” in
Proceedings of the 2013 IEEE Congress on Evolutionary Computation (CEC),
2013, pp. 3190–3197, doi: https://doi.org/10.1109/CEC.2013.6557960.'
mla: Dominguez-Medina, C., et al. “Evenly Spaced Pareto Fronts of Quad-Objective
Problems Using PSA Partitioning Technique.” Proceedings of the 2013 IEEE Congress
on Evolutionary Computation (CEC), 2013, pp. 3190–3197, doi:https://doi.org/10.1109/CEC.2013.6557960.
short: 'C. Dominguez-Medina, G. Rudolph, O. Schütze, H. Trautmann, in: Proceedings
of the 2013 IEEE Congress on Evolutionary Computation (CEC), Cancun, Mexico, 2013,
pp. 3190–3197.'
date_created: 2023-08-04T15:40:15Z
date_updated: 2023-10-16T13:45:34Z
department:
- _id: '34'
- _id: '819'
doi: https://doi.org/10.1109/CEC.2013.6557960
language:
- iso: eng
page: 3190–3197
place: Cancun, Mexico
publication: Proceedings of the 2013 IEEE Congress on Evolutionary Computation (CEC)
status: public
title: Evenly spaced Pareto fronts of quad-objective problems using PSA partitioning
technique
type: conference
user_id: '15504'
year: '2013'
...
---
_id: '46389'
abstract:
- lang: eng
text: Current StarCraft bots are not very flexible in their strategy choice, most
of them just follow a manually optimized one, usually a rush. We suggest a method
of augmenting existing bots via Fuzzy Control in order to make them react on the
current game situation. According to the available information, the best matching
of a pool of strategies is chosen. While the method is very general and can be
applied easily to many bots, we implement it for the existing BTHAI bot and show
experimentally how the modifications affects its gameplay, and how it is improved
compared to the original version.
author:
- first_name: Mike
full_name: Preuss, Mike
last_name: Preuss
- first_name: Daniel
full_name: Kozakowski, Daniel
last_name: Kozakowski
- first_name: Johan
full_name: Hagelbäck, Johan
last_name: Hagelbäck
- first_name: Heike
full_name: Trautmann, Heike
id: '100740'
last_name: Trautmann
orcid: 0000-0002-9788-8282
citation:
ama: 'Preuss M, Kozakowski D, Hagelbäck J, Trautmann H. Reactive strategy choice
in StarCraft by means of Fuzzy Control. In: 2013 IEEE Conference on Computational
Inteligence in Games (CIG). ; 2013:1-8. doi:10.1109/CIG.2013.6633627'
apa: Preuss, M., Kozakowski, D., Hagelbäck, J., & Trautmann, H. (2013). Reactive
strategy choice in StarCraft by means of Fuzzy Control. 2013 IEEE Conference
on Computational Inteligence in Games (CIG), 1–8. https://doi.org/10.1109/CIG.2013.6633627
bibtex: '@inproceedings{Preuss_Kozakowski_Hagelbäck_Trautmann_2013, title={Reactive
strategy choice in StarCraft by means of Fuzzy Control}, DOI={10.1109/CIG.2013.6633627},
booktitle={2013 IEEE Conference on Computational Inteligence in Games (CIG)},
author={Preuss, Mike and Kozakowski, Daniel and Hagelbäck, Johan and Trautmann,
Heike}, year={2013}, pages={1–8} }'
chicago: Preuss, Mike, Daniel Kozakowski, Johan Hagelbäck, and Heike Trautmann.
“Reactive Strategy Choice in StarCraft by Means of Fuzzy Control.” In 2013
IEEE Conference on Computational Inteligence in Games (CIG), 1–8, 2013. https://doi.org/10.1109/CIG.2013.6633627.
ieee: 'M. Preuss, D. Kozakowski, J. Hagelbäck, and H. Trautmann, “Reactive strategy
choice in StarCraft by means of Fuzzy Control,” in 2013 IEEE Conference on
Computational Inteligence in Games (CIG), 2013, pp. 1–8, doi: 10.1109/CIG.2013.6633627.'
mla: Preuss, Mike, et al. “Reactive Strategy Choice in StarCraft by Means of Fuzzy
Control.” 2013 IEEE Conference on Computational Inteligence in Games (CIG),
2013, pp. 1–8, doi:10.1109/CIG.2013.6633627.
short: 'M. Preuss, D. Kozakowski, J. Hagelbäck, H. Trautmann, in: 2013 IEEE Conference
on Computational Inteligence in Games (CIG), 2013, pp. 1–8.'
date_created: 2023-08-04T15:42:58Z
date_updated: 2023-10-16T13:46:13Z
department:
- _id: '34'
- _id: '819'
doi: 10.1109/CIG.2013.6633627
language:
- iso: eng
page: 1-8
publication: 2013 IEEE Conference on Computational Inteligence in Games (CIG)
status: public
title: Reactive strategy choice in StarCraft by means of Fuzzy Control
type: conference
user_id: '15504'
year: '2013'
...
---
_id: '46395'
abstract:
- lang: eng
text: In multiobjective optimization, the identification of practically relevant
solutions on the Pareto-optimal front is an important research topic. Desirability
functions (DFs) allow the preferences of the decision maker to be specified in
an intuitive way. Recently, it has been shown for continuous optimization problems
that an a priori transformation of the objectives by means of DFs can be used
to focus the search of a hypervolume-based evolutionary algorithm on the desired
part of the front. In many-objective optimization, however, the computational
complexity of the hypervolume can become a crucial part. Thus, an alternative
to this approach will be presented in this paper. The new algorithm operates in
the untransformed objective space, but the desirability index (DI), that is, a
DF-based scalarization, will be used as the second-level selection criterion in
the non-dominated sorting. The diversity and uniform distribution of the resulting
approximation are ensured by the use of an external archive. In the experiments,
different preferences are specified as DFs, and their effects are investigated.
It is shown that trade-off solutions are generated in the desired regions of the
Pareto-optimal front and with a density adaptive to the DI. The efficiency of
the approach with respect to increasing objective space dimension is also analysed
using scalable test functions. The convergence speed is superior to other set-based
and preference-based evolutionary multiobjective algorithms while the approach
is of low computational complexity due to cheap DI evaluations. Copyright © 2013
John Wiley & Sons, Ltd.
author:
- first_name: Heike
full_name: Trautmann, Heike
id: '100740'
last_name: Trautmann
orcid: 0000-0002-9788-8282
- first_name: T
full_name: Wagner, T
last_name: Wagner
- first_name: D
full_name: Biermann, D
last_name: Biermann
- first_name: C
full_name: Weihs, C
last_name: Weihs
citation:
ama: Trautmann H, Wagner T, Biermann D, Weihs C. Indicator-based Selection in Evolutionary
Multiobjective Optimization Algorithms Based On the Desirability Index. Journal
of Multi-Criteria Decision Analysis. 2013;20(5-6):319–337. doi:https://doi.org/10.1002/mcda.1503
apa: Trautmann, H., Wagner, T., Biermann, D., & Weihs, C. (2013). Indicator-based
Selection in Evolutionary Multiobjective Optimization Algorithms Based On the
Desirability Index. Journal of Multi-Criteria Decision Analysis, 20(5–6),
319–337. https://doi.org/10.1002/mcda.1503
bibtex: '@article{Trautmann_Wagner_Biermann_Weihs_2013, title={Indicator-based Selection
in Evolutionary Multiobjective Optimization Algorithms Based On the Desirability
Index}, volume={20}, DOI={https://doi.org/10.1002/mcda.1503},
number={5–6}, journal={Journal of Multi-Criteria Decision Analysis}, author={Trautmann,
Heike and Wagner, T and Biermann, D and Weihs, C}, year={2013}, pages={319–337}
}'
chicago: 'Trautmann, Heike, T Wagner, D Biermann, and C Weihs. “Indicator-Based
Selection in Evolutionary Multiobjective Optimization Algorithms Based On the
Desirability Index.” Journal of Multi-Criteria Decision Analysis 20, no.
5–6 (2013): 319–337. https://doi.org/10.1002/mcda.1503.'
ieee: 'H. Trautmann, T. Wagner, D. Biermann, and C. Weihs, “Indicator-based Selection
in Evolutionary Multiobjective Optimization Algorithms Based On the Desirability
Index,” Journal of Multi-Criteria Decision Analysis, vol. 20, no. 5–6,
pp. 319–337, 2013, doi: https://doi.org/10.1002/mcda.1503.'
mla: Trautmann, Heike, et al. “Indicator-Based Selection in Evolutionary Multiobjective
Optimization Algorithms Based On the Desirability Index.” Journal of Multi-Criteria
Decision Analysis, vol. 20, no. 5–6, 2013, pp. 319–337, doi:https://doi.org/10.1002/mcda.1503.
short: H. Trautmann, T. Wagner, D. Biermann, C. Weihs, Journal of Multi-Criteria
Decision Analysis 20 (2013) 319–337.
date_created: 2023-08-04T15:50:03Z
date_updated: 2023-10-16T13:48:31Z
department:
- _id: '34'
- _id: '819'
doi: https://doi.org/10.1002/mcda.1503
intvolume: ' 20'
issue: 5-6
language:
- iso: eng
page: 319–337
publication: Journal of Multi-Criteria Decision Analysis
status: public
title: Indicator-based Selection in Evolutionary Multiobjective Optimization Algorithms
Based On the Desirability Index
type: journal_article
user_id: '15504'
volume: 20
year: '2013'
...
---
_id: '46393'
abstract:
- lang: eng
text: In multi-objective optimization, set-based performance indicators have become
the state of the art for assessing the quality of Pareto front approximations.
As a consequence, they are also more and more used within the design of multi-objective
optimization algorithms. The R2 and the Hypervolume (HV) indicator represent two
popular examples. In order to understand the behavior and the approximations preferred
by these indicators and algorithms, a comprehensive knowledge of the indicator’s
properties is required. Whereas this knowledge is available for the HV, we presented
a first approach in this direction for the R2 indicator just recently. In this
paper, we build upon this knowledge and enhance the considerations with respect
to the integration of preferences into the R2 indicator. More specifically, we
analyze the effect of the reference point, the domain of the weights, and the
distribution of weight vectors on the optimization of $\mu$ solutions with respect
to the R2 indicator. By means of theoretical findings and empirical evidence,
we show the potentials of these three possibilities using the optimal distribution
of $\mu$ solutions for exemplary setups.
author:
- first_name: Tobias
full_name: Wagner, Tobias
last_name: Wagner
- first_name: Heike
full_name: Trautmann, Heike
id: '100740'
last_name: Trautmann
orcid: 0000-0002-9788-8282
- first_name: Dimo
full_name: Brockhoff, Dimo
last_name: Brockhoff
citation:
ama: 'Wagner T, Trautmann H, Brockhoff D. Preference Articulation by Means of the
R2 Indicator. In: Purshouse RC, Fleming PJ, Fonseca CM, Greco S, Shaw J, eds.
Evolutionary Multi-Criterion Optimization. Springer Berlin Heidelberg;
2013:81–95.'
apa: Wagner, T., Trautmann, H., & Brockhoff, D. (2013). Preference Articulation
by Means of the R2 Indicator. In R. C. Purshouse, P. J. Fleming, C. M. Fonseca,
S. Greco, & J. Shaw (Eds.), Evolutionary Multi-Criterion Optimization
(pp. 81–95). Springer Berlin Heidelberg.
bibtex: '@inproceedings{Wagner_Trautmann_Brockhoff_2013, place={Berlin, Heidelberg},
title={Preference Articulation by Means of the R2 Indicator}, booktitle={Evolutionary
Multi-Criterion Optimization}, publisher={Springer Berlin Heidelberg}, author={Wagner,
Tobias and Trautmann, Heike and Brockhoff, Dimo}, editor={Purshouse, Robin C.
and Fleming, Peter J. and Fonseca, Carlos M. and Greco, Salvatore and Shaw, Jane},
year={2013}, pages={81–95} }'
chicago: 'Wagner, Tobias, Heike Trautmann, and Dimo Brockhoff. “Preference Articulation
by Means of the R2 Indicator.” In Evolutionary Multi-Criterion Optimization,
edited by Robin C. Purshouse, Peter J. Fleming, Carlos M. Fonseca, Salvatore Greco,
and Jane Shaw, 81–95. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013.'
ieee: T. Wagner, H. Trautmann, and D. Brockhoff, “Preference Articulation by Means
of the R2 Indicator,” in Evolutionary Multi-Criterion Optimization, 2013,
pp. 81–95.
mla: Wagner, Tobias, et al. “Preference Articulation by Means of the R2 Indicator.”
Evolutionary Multi-Criterion Optimization, edited by Robin C. Purshouse
et al., Springer Berlin Heidelberg, 2013, pp. 81–95.
short: 'T. Wagner, H. Trautmann, D. Brockhoff, in: R.C. Purshouse, P.J. Fleming,
C.M. Fonseca, S. Greco, J. Shaw (Eds.), Evolutionary Multi-Criterion Optimization,
Springer Berlin Heidelberg, Berlin, Heidelberg, 2013, pp. 81–95.'
date_created: 2023-08-04T15:47:49Z
date_updated: 2023-10-16T13:47:58Z
department:
- _id: '34'
- _id: '819'
editor:
- first_name: Robin C.
full_name: Purshouse, Robin C.
last_name: Purshouse
- first_name: Peter J.
full_name: Fleming, Peter J.
last_name: Fleming
- first_name: Carlos M.
full_name: Fonseca, Carlos M.
last_name: Fonseca
- first_name: Salvatore
full_name: Greco, Salvatore
last_name: Greco
- first_name: Jane
full_name: Shaw, Jane
last_name: Shaw
language:
- iso: eng
page: 81–95
place: Berlin, Heidelberg
publication: Evolutionary Multi-Criterion Optimization
publication_identifier:
isbn:
- 978-3-642-37140-0
publisher: Springer Berlin Heidelberg
status: public
title: Preference Articulation by Means of the R2 Indicator
type: conference
user_id: '15504'
year: '2013'
...
---
_id: '46392'
abstract:
- lang: eng
text: An indicator-based evolutionary multiobjective optimization algorithm (EMOA)
is introduced which incorporates the contribution to the unary R2-indicator as
the secondary selection criterion. First experiments indicate that the R2-EMOA
accurately approximates the Pareto front of the considered continuous multiobjective
optimization problems. Furthermore, decision makers’ preferences can be included
by adjusting the weight vector distributions of the indicator which results in
a focused search behavior.
author:
- first_name: Heike
full_name: Trautmann, Heike
id: '100740'
last_name: Trautmann
orcid: 0000-0002-9788-8282
- first_name: Tobias
full_name: Wagner, Tobias
last_name: Wagner
- first_name: Dimo
full_name: Brockhoff, Dimo
last_name: Brockhoff
citation:
ama: 'Trautmann H, Wagner T, Brockhoff D. R2-EMOA: Focused Multiobjective Search
Using R2-Indicator-Based Selection. In: Nicosia G, Pardalos P, eds. Learning
and Intelligent Optimization. Springer Berlin Heidelberg; 2013:70–74.'
apa: 'Trautmann, H., Wagner, T., & Brockhoff, D. (2013). R2-EMOA: Focused Multiobjective
Search Using R2-Indicator-Based Selection. In G. Nicosia & P. Pardalos (Eds.),
Learning and Intelligent Optimization (pp. 70–74). Springer Berlin Heidelberg.'
bibtex: '@inproceedings{Trautmann_Wagner_Brockhoff_2013, place={Berlin, Heidelberg},
title={R2-EMOA: Focused Multiobjective Search Using R2-Indicator-Based Selection},
booktitle={Learning and Intelligent Optimization}, publisher={Springer Berlin
Heidelberg}, author={Trautmann, Heike and Wagner, Tobias and Brockhoff, Dimo},
editor={Nicosia, Giuseppe and Pardalos, Panos}, year={2013}, pages={70–74} }'
chicago: 'Trautmann, Heike, Tobias Wagner, and Dimo Brockhoff. “R2-EMOA: Focused
Multiobjective Search Using R2-Indicator-Based Selection.” In Learning and
Intelligent Optimization, edited by Giuseppe Nicosia and Panos Pardalos, 70–74.
Berlin, Heidelberg: Springer Berlin Heidelberg, 2013.'
ieee: 'H. Trautmann, T. Wagner, and D. Brockhoff, “R2-EMOA: Focused Multiobjective
Search Using R2-Indicator-Based Selection,” in Learning and Intelligent Optimization,
2013, pp. 70–74.'
mla: 'Trautmann, Heike, et al. “R2-EMOA: Focused Multiobjective Search Using R2-Indicator-Based
Selection.” Learning and Intelligent Optimization, edited by Giuseppe Nicosia
and Panos Pardalos, Springer Berlin Heidelberg, 2013, pp. 70–74.'
short: 'H. Trautmann, T. Wagner, D. Brockhoff, in: G. Nicosia, P. Pardalos (Eds.),
Learning and Intelligent Optimization, Springer Berlin Heidelberg, Berlin, Heidelberg,
2013, pp. 70–74.'
date_created: 2023-08-04T15:47:00Z
date_updated: 2023-10-16T13:47:41Z
department:
- _id: '34'
- _id: '819'
editor:
- first_name: Giuseppe
full_name: Nicosia, Giuseppe
last_name: Nicosia
- first_name: Panos
full_name: Pardalos, Panos
last_name: Pardalos
language:
- iso: eng
page: 70–74
place: Berlin, Heidelberg
publication: Learning and Intelligent Optimization
publication_identifier:
isbn:
- 978-3-642-44973-4
publisher: Springer Berlin Heidelberg
status: public
title: 'R2-EMOA: Focused Multiobjective Search Using R2-Indicator-Based Selection'
type: conference
user_id: '15504'
year: '2013'
...
---
_id: '48889'
abstract:
- lang: eng
text: Meta-heuristics are frequently used to tackle NP-hard combinatorial optimization
problems. With this paper we contribute to the understanding of the success of
2-opt based local search algorithms for solving the traveling salesperson problem
(TSP). Although 2-opt is widely used in practice, it is hard to understand its
success from a theoretical perspective. We take a statistical approach and examine
the features of TSP instances that make the problem either hard or easy to solve.
As a measure of problem difficulty for 2-opt we use the approximation ratio that
it achieves on a given instance. Our investigations point out important features
that make TSP instances hard or easy to be approximated by 2-opt.
author:
- first_name: Olaf
full_name: Mersmann, Olaf
last_name: Mersmann
- first_name: Bernd
full_name: Bischl, Bernd
last_name: Bischl
- first_name: Heike
full_name: Trautmann, Heike
last_name: Trautmann
- first_name: Markus
full_name: Wagner, Markus
last_name: Wagner
- first_name: Jakob
full_name: Bossek, Jakob
id: '102979'
last_name: Bossek
orcid: 0000-0002-4121-4668
- first_name: Frank
full_name: Neumann, Frank
last_name: Neumann
citation:
ama: Mersmann O, Bischl B, Trautmann H, Wagner M, Bossek J, Neumann F. A Novel Feature-Based
Approach to Characterize Algorithm Performance for the Traveling Salesperson Problem.
Annals of Mathematics and Artificial Intelligence. 2013;69(2):151–182.
doi:10.1007/s10472-013-9341-2
apa: Mersmann, O., Bischl, B., Trautmann, H., Wagner, M., Bossek, J., & Neumann,
F. (2013). A Novel Feature-Based Approach to Characterize Algorithm Performance
for the Traveling Salesperson Problem. Annals of Mathematics and Artificial
Intelligence, 69(2), 151–182. https://doi.org/10.1007/s10472-013-9341-2
bibtex: '@article{Mersmann_Bischl_Trautmann_Wagner_Bossek_Neumann_2013, title={A
Novel Feature-Based Approach to Characterize Algorithm Performance for the Traveling
Salesperson Problem}, volume={69}, DOI={10.1007/s10472-013-9341-2},
number={2}, journal={Annals of Mathematics and Artificial Intelligence}, author={Mersmann,
Olaf and Bischl, Bernd and Trautmann, Heike and Wagner, Markus and Bossek, Jakob
and Neumann, Frank}, year={2013}, pages={151–182} }'
chicago: 'Mersmann, Olaf, Bernd Bischl, Heike Trautmann, Markus Wagner, Jakob Bossek,
and Frank Neumann. “A Novel Feature-Based Approach to Characterize Algorithm Performance
for the Traveling Salesperson Problem.” Annals of Mathematics and Artificial
Intelligence 69, no. 2 (2013): 151–182. https://doi.org/10.1007/s10472-013-9341-2.'
ieee: 'O. Mersmann, B. Bischl, H. Trautmann, M. Wagner, J. Bossek, and F. Neumann,
“A Novel Feature-Based Approach to Characterize Algorithm Performance for the
Traveling Salesperson Problem,” Annals of Mathematics and Artificial Intelligence,
vol. 69, no. 2, pp. 151–182, 2013, doi: 10.1007/s10472-013-9341-2.'
mla: Mersmann, Olaf, et al. “A Novel Feature-Based Approach to Characterize Algorithm
Performance for the Traveling Salesperson Problem.” Annals of Mathematics and
Artificial Intelligence, vol. 69, no. 2, 2013, pp. 151–182, doi:10.1007/s10472-013-9341-2.
short: O. Mersmann, B. Bischl, H. Trautmann, M. Wagner, J. Bossek, F. Neumann, Annals
of Mathematics and Artificial Intelligence 69 (2013) 151–182.
date_created: 2023-11-14T15:58:59Z
date_updated: 2023-12-13T10:50:41Z
department:
- _id: '819'
doi: 10.1007/s10472-013-9341-2
intvolume: ' 69'
issue: '2'
keyword:
- 2-opt
- 90B06
- Classification
- Feature selection
- MARS
- TSP
language:
- iso: eng
page: 151–182
publication: Annals of Mathematics and Artificial Intelligence
publication_identifier:
issn:
- 1012-2443
status: public
title: A Novel Feature-Based Approach to Characterize Algorithm Performance for the
Traveling Salesperson Problem
type: journal_article
user_id: '102979'
volume: 69
year: '2013'
...
---
_id: '47161'
author:
- first_name: Sascha
full_name: Fahl, Sascha
last_name: Fahl
- first_name: Marian
full_name: Harbach, Marian
last_name: Harbach
- first_name: Yasemin
full_name: Acar, Yasemin
id: '94636'
last_name: Acar
- first_name: Matthew
full_name: Smith, Matthew
last_name: Smith
citation:
ama: 'Fahl S, Harbach M, Acar Y, Smith M. On the ecological validity of a password
study. In: Proceedings of the Ninth Symposium on Usable Privacy and Security.
ACM; 2013. doi:10.1145/2501604.2501617'
apa: Fahl, S., Harbach, M., Acar, Y., & Smith, M. (2013). On the ecological
validity of a password study. Proceedings of the Ninth Symposium on Usable
Privacy and Security. https://doi.org/10.1145/2501604.2501617
bibtex: '@inproceedings{Fahl_Harbach_Acar_Smith_2013, title={On the ecological validity
of a password study}, DOI={10.1145/2501604.2501617},
booktitle={Proceedings of the Ninth Symposium on Usable Privacy and Security},
publisher={ACM}, author={Fahl, Sascha and Harbach, Marian and Acar, Yasemin and
Smith, Matthew}, year={2013} }'
chicago: Fahl, Sascha, Marian Harbach, Yasemin Acar, and Matthew Smith. “On the
Ecological Validity of a Password Study.” In Proceedings of the Ninth Symposium
on Usable Privacy and Security. ACM, 2013. https://doi.org/10.1145/2501604.2501617.
ieee: 'S. Fahl, M. Harbach, Y. Acar, and M. Smith, “On the ecological validity of
a password study,” 2013, doi: 10.1145/2501604.2501617.'
mla: Fahl, Sascha, et al. “On the Ecological Validity of a Password Study.” Proceedings
of the Ninth Symposium on Usable Privacy and Security, ACM, 2013, doi:10.1145/2501604.2501617.
short: 'S. Fahl, M. Harbach, Y. Acar, M. Smith, in: Proceedings of the Ninth Symposium
on Usable Privacy and Security, ACM, 2013.'
date_created: 2023-09-22T11:49:19Z
date_updated: 2024-06-05T13:17:57Z
department:
- _id: '34'
- _id: '858'
doi: 10.1145/2501604.2501617
extern: '1'
language:
- iso: eng
publication: Proceedings of the Ninth Symposium on Usable Privacy and Security
publication_status: published
publisher: ACM
status: public
title: On the ecological validity of a password study
type: conference
user_id: '14931'
year: '2013'
...
---
_id: '46394'
abstract:
- lang: eng
text: Meta-heuristics are frequently used to tackle NP-hard combinatorial optimization
problems. With this paper we contribute to the understanding of the success of
2-opt based local search algorithms for solving the traveling salesperson problem
(TSP). Although 2-opt is widely used in practice, it is hard to understand its
success from a theoretical perspective. We take a statistical approach and examine
the features of TSP instances that make the problem either hard or easy to solve.
As a measure of problem difficulty for 2-opt we use the approximation ratio that
it achieves on a given instance. Our investigations point out important features
that make TSP instances hard or easy to be approximated by 2-opt.
author:
- first_name: O
full_name: Mersmann, O
last_name: Mersmann
- first_name: B
full_name: Bischl, B
last_name: Bischl
- first_name: Heike
full_name: Trautmann, Heike
id: '100740'
last_name: Trautmann
orcid: 0000-0002-9788-8282
- first_name: M
full_name: Wagner, M
last_name: Wagner
- first_name: Jakob
full_name: Bossek, Jakob
id: '102979'
last_name: Bossek
orcid: 0000-0002-4121-4668
- first_name: F
full_name: Neumann, F
last_name: Neumann
citation:
ama: Mersmann O, Bischl B, Trautmann H, Wagner M, Bossek J, Neumann F. A Novel Feature-Based
Approach to Characterize Algorithm Performance for the Traveling Salesman Problem.
Annals of Mathematics and Artificial Intelligence. 2013;69:151–182.
apa: Mersmann, O., Bischl, B., Trautmann, H., Wagner, M., Bossek, J., & Neumann,
F. (2013). A Novel Feature-Based Approach to Characterize Algorithm Performance
for the Traveling Salesman Problem. Annals of Mathematics and Artificial Intelligence,
69, 151–182.
bibtex: '@article{Mersmann_Bischl_Trautmann_Wagner_Bossek_Neumann_2013, title={A
Novel Feature-Based Approach to Characterize Algorithm Performance for the Traveling
Salesman Problem}, volume={69}, journal={Annals of Mathematics and Artificial
Intelligence}, author={Mersmann, O and Bischl, B and Trautmann, Heike and Wagner,
M and Bossek, Jakob and Neumann, F}, year={2013}, pages={151–182} }'
chicago: 'Mersmann, O, B Bischl, Heike Trautmann, M Wagner, Jakob Bossek, and F
Neumann. “A Novel Feature-Based Approach to Characterize Algorithm Performance
for the Traveling Salesman Problem.” Annals of Mathematics and Artificial Intelligence
69 (2013): 151–182.'
ieee: O. Mersmann, B. Bischl, H. Trautmann, M. Wagner, J. Bossek, and F. Neumann,
“A Novel Feature-Based Approach to Characterize Algorithm Performance for the
Traveling Salesman Problem,” Annals of Mathematics and Artificial Intelligence,
vol. 69, pp. 151–182, 2013.
mla: Mersmann, O., et al. “A Novel Feature-Based Approach to Characterize Algorithm
Performance for the Traveling Salesman Problem.” Annals of Mathematics and
Artificial Intelligence, vol. 69, 2013, pp. 151–182.
short: O. Mersmann, B. Bischl, H. Trautmann, M. Wagner, J. Bossek, F. Neumann, Annals
of Mathematics and Artificial Intelligence 69 (2013) 151–182.
date_created: 2023-08-04T15:48:57Z
date_updated: 2024-06-10T11:57:43Z
department:
- _id: '34'
- _id: '819'
intvolume: ' 69'
language:
- iso: eng
page: 151–182
publication: Annals of Mathematics and Artificial Intelligence
status: public
title: A Novel Feature-Based Approach to Characterize Algorithm Performance for the
Traveling Salesman Problem
type: journal_article
user_id: '15504'
volume: 69
year: '2013'
...
---
_id: '36919'
abstract:
- lang: eng
text: Faced with increasing demands on energy efficiency, current electronic systems
operate according to complex power management schemes including more and more
fine-grained voltage frequency scaling and power shutdown scenarios. Consequently,
validation of the power design intent should begin as early as possible at electronic
system-level (ESL) together with first executable system specifications for integrity
tests. However, today's system-level design methodologies usually focus on the
abstraction of digital logic and time, so that typical low-power aspects cannot
be considered so far. In this paper, we present a high-level modeling approach
on top of the SystemC/TLM standard to simulate power distribution and voltage
based implications in a "loosely-timed" functional execution context. The approach
reuses legacy TLM models and prevents the need for detailed lock-step process
synchronization in contrast to existing methods. A case study derived from an
open source low-power design demonstrates the efficiency of our approach in terms
of simulation performance and testability.
author:
- first_name: Fabian
full_name: Mischkalla, Fabian
last_name: Mischkalla
- first_name: Wolfgang
full_name: Müller, Wolfgang
id: '16243'
last_name: Müller
citation:
ama: 'Mischkalla F, Müller W. Efficient Power-Intent Validation Using “Loosely-Timed”
Simulation Models: A Non-Invasive Approach. In: IEEE; 2013. doi:10.1109/PATMOS.2013.6662171'
apa: 'Mischkalla, F., & Müller, W. (2013). Efficient Power-Intent Validation
Using “Loosely-Timed” Simulation Models: A Non-Invasive Approach. 23rd International
Workshop on Power and Timing Modeling, Optimization and Simulation (PATMOS). https://doi.org/10.1109/PATMOS.2013.6662171'
bibtex: '@inproceedings{Mischkalla_Müller_2013, place={Karlsruhe}, title={Efficient
Power-Intent Validation Using “Loosely-Timed” Simulation Models: A Non-Invasive
Approach}, DOI={10.1109/PATMOS.2013.6662171},
publisher={IEEE}, author={Mischkalla, Fabian and Müller, Wolfgang}, year={2013}
}'
chicago: 'Mischkalla, Fabian, and Wolfgang Müller. “Efficient Power-Intent Validation
Using ‘Loosely-Timed’ Simulation Models: A Non-Invasive Approach.” Karlsruhe:
IEEE, 2013. https://doi.org/10.1109/PATMOS.2013.6662171.'
ieee: 'F. Mischkalla and W. Müller, “Efficient Power-Intent Validation Using ‘Loosely-Timed’
Simulation Models: A Non-Invasive Approach,” presented at the 23rd International
Workshop on Power and Timing Modeling, Optimization and Simulation (PATMOS), 2013,
doi: 10.1109/PATMOS.2013.6662171.'
mla: 'Mischkalla, Fabian, and Wolfgang Müller. Efficient Power-Intent Validation
Using “Loosely-Timed” Simulation Models: A Non-Invasive Approach. IEEE, 2013,
doi:10.1109/PATMOS.2013.6662171.'
short: 'F. Mischkalla, W. Müller, in: IEEE, Karlsruhe, 2013.'
conference:
name: 23rd International Workshop on Power and Timing Modeling, Optimization and
Simulation (PATMOS)
date_created: 2023-01-16T12:08:03Z
date_updated: 2023-01-16T12:08:17Z
department:
- _id: '672'
doi: 10.1109/PATMOS.2013.6662171
keyword:
- Time-varying systems
- Time-domain analysis
- Synchronization
- Context modeling
- Clocks
- Semantics
- Standards
language:
- iso: eng
place: Karlsruhe
publication_identifier:
eisbn:
- 978-1-4799-1170-7
publisher: IEEE
status: public
title: 'Efficient Power-Intent Validation Using "Loosely-Timed" Simulation Models:
A Non-Invasive Approach'
type: conference
user_id: '5786'
year: '2013'
...
---
_id: '36920'
abstract:
- lang: eng
text: 'In the electronic system development, energy consumption is clearly becoming
one of the most important design concerns. From the system level point of view,
Dynamic Power Management (DPM) and Dynamic Voltage and Frequency Scaling (DVFS)
are two mostly applied techniques to adjust the tradeoff between the performance
and power dissipation at runtime. In this paper, we study the problem of combined
application of both techniques with regard to hard real-time systems running on
cluster-based multi-core processors. To optimize the processor energy consumption,
a heuristic based on simulated annealing with efficient termination criterion
is proposed. The experiment results show that the proposed algorithm outperforms
the existing approaches in terms of the energy reduction. '
author:
- first_name: Da
full_name: He, Da
last_name: He
- first_name: Wolfgang
full_name: Müller, Wolfgang
id: '16243'
last_name: Müller
citation:
ama: 'He D, Müller W. An Energy-Efficient Heuristic for Hard Real-Time System on
Multi-Core Processors. In: Weghorn H, ed. Proceedings of the International
Conference on Applied Computing (AC). ; 2013.'
apa: He, D., & Müller, W. (2013). An Energy-Efficient Heuristic for Hard Real-Time
System on Multi-Core Processors. In H. Weghorn (Ed.), Proceedings of the International
Conference on Applied Computing (AC).
bibtex: '@inproceedings{He_Müller_2013, place={Fort Worth, Texas, USA}, title={An
Energy-Efficient Heuristic for Hard Real-Time System on Multi-Core Processors},
booktitle={Proceedings of the International Conference on Applied Computing (AC)},
author={He, Da and Müller, Wolfgang}, editor={Weghorn, Hans}, year={2013} }'
chicago: He, Da, and Wolfgang Müller. “An Energy-Efficient Heuristic for Hard Real-Time
System on Multi-Core Processors.” In Proceedings of the International Conference
on Applied Computing (AC), edited by Hans Weghorn. Fort Worth, Texas, USA,
2013.
ieee: D. He and W. Müller, “An Energy-Efficient Heuristic for Hard Real-Time System
on Multi-Core Processors,” in Proceedings of the International Conference on
Applied Computing (AC), 2013.
mla: He, Da, and Wolfgang Müller. “An Energy-Efficient Heuristic for Hard Real-Time
System on Multi-Core Processors.” Proceedings of the International Conference
on Applied Computing (AC), edited by Hans Weghorn, 2013.
short: 'D. He, W. Müller, in: H. Weghorn (Ed.), Proceedings of the International
Conference on Applied Computing (AC), Fort Worth, Texas, USA, 2013.'
date_created: 2023-01-16T12:12:58Z
date_updated: 2023-01-16T12:15:44Z
department:
- _id: '672'
editor:
- first_name: Hans
full_name: Weghorn, Hans
last_name: Weghorn
keyword:
- Dynamic Power Management
- Dynamic Voltage and Frequency Scaling
- Hard Real-Time
- Multi-core Processor
language:
- iso: eng
place: Fort Worth, Texas, USA
publication: Proceedings of the International Conference on Applied Computing (AC)
publication_identifier:
isbn:
- '978-989-8533-20-3 '
status: public
title: An Energy-Efficient Heuristic for Hard Real-Time System on Multi-Core Processors
type: conference
user_id: '5786'
year: '2013'
...
---
_id: '8425'
abstract:
- lang: eng
text: "This thesis studies three topics in quantum computation and information:
The approximability of quantum problems, quantum proof systems, and non-classical
correlations in quantum systems. \r\n\r\nIn the first area, we demonstrate a polynomial-time
(classical) approximation algorithm for dense instances of the canonical QMA-complete
quantum constraint satisfaction problem, the local Hamiltonian problem. In the
opposite direction, we next introduce a quantum generalization of the polynomial-time
hierarchy, and define problems which we prove are not only complete for the second
level of this hierarchy, but are in fact hard to approximate. \r\n\r\nIn the second
area, we study variants of the interesting and stubbornly open question of whether
a quantum proof system with multiple unentangled quantum provers is equal in expressive
power to a proof system with a single quantum prover. Our results concern classes
such as BellQMA(poly), and include a novel proof of perfect parallel repetition
for SepQMA(m) based on cone programming duality. \r\n\r\nIn the third area, we
study non-classical quantum correlations beyond entanglement, often dubbed \"non-classicality\".
Among our results are two novel schemes for quantifying non-classicality: The
first proposes the new paradigm of exploiting local unitary operations to study
non-classical correlations, and the second introduces a protocol through which
non-classical correlations in a starting system can be \"activated\" into distillable
entanglement with an ancilla system. \r\n\r\nAn introduction to all required linear
algebra and quantum mechanics is included."
author:
- first_name: Sevag
full_name: Gharibian, Sevag
id: '71541'
last_name: Gharibian
orcid: 0000-0002-9992-3379
citation:
ama: Gharibian S. Approximation, Proof Systems, and Correlations in a Quantum
World.; 2013.
apa: Gharibian, S. (2013). Approximation, Proof Systems, and Correlations in
a Quantum World.
bibtex: '@book{Gharibian_2013, title={Approximation, Proof Systems, and Correlations
in a Quantum World}, author={Gharibian, Sevag}, year={2013} }'
chicago: Gharibian, Sevag. Approximation, Proof Systems, and Correlations in
a Quantum World, 2013.
ieee: S. Gharibian, Approximation, Proof Systems, and Correlations in a Quantum
World. 2013.
mla: Gharibian, Sevag. Approximation, Proof Systems, and Correlations in a Quantum
World. 2013.
short: S. Gharibian, Approximation, Proof Systems, and Correlations in a Quantum
World, 2013.
date_created: 2019-03-06T14:35:06Z
date_updated: 2023-02-28T11:00:15Z
department:
- _id: '623'
- _id: '7'
extern: '1'
external_id:
arxiv:
- '1301.2632'
language:
- iso: eng
main_file_link:
- open_access: '1'
oa: '1'
page: '240'
related_material:
link:
- relation: confirmation
url: https://arxiv.org/abs/1301.2632
status: public
title: Approximation, Proof Systems, and Correlations in a Quantum World
type: dissertation
user_id: '71541'
year: '2013'
...
---
_id: '8173'
abstract:
- lang: eng
text: We study three variants of multi-prover quantum Merlin-Arthur proof systems.
We first show that the class of problems that can be efficiently verified using
polynomially many quantum proofs, each of logarithmic-size, is exactly MQA (also
known as QCMA), the class of problems which can be efficiently verified via a
classical proof and a quantum verifier. We then study the class BellQMA(poly),
characterized by a verifier who first applies unentangled, nonadaptive measurements
to each of the polynomially many proofs, followed by an arbitrary but efficient
quantum verification circuit on the resulting measurement outcomes. We show that
if the number of outcomes per nonadaptive measurement is a polynomially-bounded
function, then the expressive power of the proof system is exactly QMA. Finally,
we study a class equivalent to QMA(m), denoted SepQMA(m), where the verifier's
measurement operator corresponding to outcome "accept" is a fully separable operator
across the m quantum proofs. Using cone programming duality, we give an alternate
proof of a result of Harrow and Montanaro [FOCS, pp. 633--642 (2010)] that shows
a perfect parallel repetition theorem for SepQMA(m) for any m.
article_type: original
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
- first_name: Sarvagya
full_name: Upadhyay, Sarvagya
last_name: Upadhyay
citation:
ama: Gharibian S, Sikora J, Upadhyay S. QMA variants with polynomially many provers.
Quantum Information & Computation. 2013;13(1-2):135-157.
apa: Gharibian, S., Sikora, J., & Upadhyay, S. (2013). QMA variants with polynomially
many provers. Quantum Information & Computation, 13(1–2), 135–157.
bibtex: '@article{Gharibian_Sikora_Upadhyay_2013, title={QMA variants with polynomially
many provers}, volume={13}, number={1–2}, journal={Quantum Information & Computation},
author={Gharibian, Sevag and Sikora, Jamie and Upadhyay, Sarvagya}, year={2013},
pages={135–157} }'
chicago: 'Gharibian, Sevag, Jamie Sikora, and Sarvagya Upadhyay. “QMA Variants with
Polynomially Many Provers.” Quantum Information & Computation 13, no.
1–2 (2013): 135–57.'
ieee: S. Gharibian, J. Sikora, and S. Upadhyay, “QMA variants with polynomially
many provers,” Quantum Information & Computation, vol. 13, no. 1–2,
pp. 135–157, 2013.
mla: Gharibian, Sevag, et al. “QMA Variants with Polynomially Many Provers.” Quantum
Information & Computation, vol. 13, no. 1–2, 2013, pp. 135–57.
short: S. Gharibian, J. Sikora, S. Upadhyay, Quantum Information & Computation
13 (2013) 135–157.
date_created: 2019-03-01T12:00:39Z
date_updated: 2023-02-28T11:03:13Z
department:
- _id: '623'
- _id: '7'
extern: '1'
external_id:
arxiv:
- '1108.0617'
intvolume: ' 13'
issue: 1-2
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1108.0617
oa: '1'
page: 135-157
publication: Quantum Information & Computation
publication_status: published
status: public
title: QMA variants with polynomially many provers
type: journal_article
user_id: '71541'
volume: 13
year: '2013'
...
---
_id: '528'
abstract:
- lang: eng
text: Cold-boot attacks exploit the fact that DRAM contents are not immediately
lost when a PC is powered off. Instead the contents decay rather slowly, in particular
if the DRAM chips are cooled to low temperatures. This effect opens an attack
vector on cryptographic applications that keep decrypted keys in DRAM. An attacker
with access to the target computer can reboot it or remove the RAM modules and
quickly copy the RAM contents to non-volatile memory. By exploiting the known
cryptographic structure of the cipher and layout of the key data in memory, in
our application an AES key schedule with redundancy, the resulting memory image
can be searched for sections that could correspond to decayed cryptographic keys;
then, the attacker can attempt to reconstruct the original key. However, the runtime
of these algorithms grows rapidly with increasing memory image size, error rate
and complexity of the bit error model, which limits the practicability of the
approach.In this work, we study how the algorithm for key search can be accelerated
with custom computing machines. We present an FPGA-based architecture on a Maxeler
dataflow computing system that outperforms a software implementation up to 205x,
which significantly improves the practicability of cold-attacks against AES.
author:
- first_name: Heinrich
full_name: Riebler, Heinrich
id: '8961'
last_name: Riebler
- first_name: Tobias
full_name: Kenter, Tobias
id: '3145'
last_name: Kenter
- first_name: Christoph
full_name: Sorge, Christoph
last_name: Sorge
- first_name: Christian
full_name: Plessl, Christian
id: '16153'
last_name: Plessl
orcid: 0000-0001-5728-9982
citation:
ama: 'Riebler H, Kenter T, Sorge C, Plessl C. FPGA-accelerated Key Search for Cold-Boot
Attacks against AES. In: Proceedings of the International Conference on Field-Programmable
Technology (FPT). IEEE; 2013:386-389. doi:10.1109/FPT.2013.6718394'
apa: Riebler, H., Kenter, T., Sorge, C., & Plessl, C. (2013). FPGA-accelerated
Key Search for Cold-Boot Attacks against AES. Proceedings of the International
Conference on Field-Programmable Technology (FPT), 386–389. https://doi.org/10.1109/FPT.2013.6718394
bibtex: '@inproceedings{Riebler_Kenter_Sorge_Plessl_2013, title={FPGA-accelerated
Key Search for Cold-Boot Attacks against AES}, DOI={10.1109/FPT.2013.6718394},
booktitle={Proceedings of the International Conference on Field-Programmable Technology
(FPT)}, publisher={IEEE}, author={Riebler, Heinrich and Kenter, Tobias and Sorge,
Christoph and Plessl, Christian}, year={2013}, pages={386–389} }'
chicago: Riebler, Heinrich, Tobias Kenter, Christoph Sorge, and Christian Plessl.
“FPGA-Accelerated Key Search for Cold-Boot Attacks against AES.” In Proceedings
of the International Conference on Field-Programmable Technology (FPT), 386–89.
IEEE, 2013. https://doi.org/10.1109/FPT.2013.6718394.
ieee: 'H. Riebler, T. Kenter, C. Sorge, and C. Plessl, “FPGA-accelerated Key Search
for Cold-Boot Attacks against AES,” in Proceedings of the International Conference
on Field-Programmable Technology (FPT), 2013, pp. 386–389, doi: 10.1109/FPT.2013.6718394.'
mla: Riebler, Heinrich, et al. “FPGA-Accelerated Key Search for Cold-Boot Attacks
against AES.” Proceedings of the International Conference on Field-Programmable
Technology (FPT), IEEE, 2013, pp. 386–89, doi:10.1109/FPT.2013.6718394.
short: 'H. Riebler, T. Kenter, C. Sorge, C. Plessl, in: Proceedings of the International
Conference on Field-Programmable Technology (FPT), IEEE, 2013, pp. 386–389.'
date_created: 2017-10-17T12:42:35Z
date_updated: 2023-09-26T13:37:35Z
ddc:
- '040'
department:
- _id: '27'
- _id: '518'
- _id: '78'
doi: 10.1109/FPT.2013.6718394
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T10:36:08Z
date_updated: 2018-03-15T10:36:08Z
file_id: '1294'
file_name: 528-plessl13_fpt.pdf
file_size: 822680
relation: main_file
success: 1
file_date_updated: 2018-03-15T10:36:08Z
has_accepted_license: '1'
keyword:
- coldboot
language:
- iso: eng
page: 386-389
project:
- _id: '1'
grant_number: '160364472'
name: SFB 901
- _id: '14'
grant_number: '160364472'
name: SFB 901 - Subprojekt C2
- _id: '13'
name: SFB 901 - Subproject C1
- _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 International Conference on Field-Programmable Technology
(FPT)
publisher: IEEE
quality_controlled: '1'
status: public
title: FPGA-accelerated Key Search for Cold-Boot Attacks against AES
type: conference
user_id: '15278'
year: '2013'
...
---
_id: '505'
abstract:
- lang: eng
text: In this paper we introduce “On-The-Fly Computing”, our vision of future IT
services that will be provided by assembling modular software components available
on world-wide markets. After suitable components have been found, they are automatically
integrated, configured and brought to execution in an On-The-Fly Compute Center.
We envision that these future compute centers will continue to leverage three
current trends in large scale computing which are an increasing amount of parallel
processing, a trend to use heterogeneous computing resources, and—in the light
of rising energy cost—energy-efficiency as a primary goal in the design and operation
of computing systems. In this paper, we point out three research challenges and
our current work in these areas.
author:
- first_name: Markus
full_name: Happe, Markus
last_name: Happe
- first_name: Peter
full_name: Kling, Peter
last_name: Kling
- 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: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Happe M, Kling P, Plessl C, Platzner M, Meyer auf der Heide F. On-The-Fly
Computing: A Novel Paradigm for Individualized IT Services. In: Proceedings
of the 9th IEEE Workshop on Software Technology for Future Embedded and Ubiquitous
Systems (SEUS). IEEE; 2013. doi:10.1109/ISORC.2013.6913232'
apa: 'Happe, M., Kling, P., Plessl, C., Platzner, M., & Meyer auf der Heide,
F. (2013). On-The-Fly Computing: A Novel Paradigm for Individualized IT Services.
Proceedings of the 9th IEEE Workshop on Software Technology for Future Embedded
and Ubiquitous Systems (SEUS). https://doi.org/10.1109/ISORC.2013.6913232'
bibtex: '@inproceedings{Happe_Kling_Plessl_Platzner_Meyer auf der Heide_2013, title={On-The-Fly
Computing: A Novel Paradigm for Individualized IT Services}, DOI={10.1109/ISORC.2013.6913232},
booktitle={Proceedings of the 9th IEEE Workshop on Software Technology for Future
embedded and Ubiquitous Systems (SEUS)}, publisher={IEEE}, author={Happe, Markus
and Kling, Peter and Plessl, Christian and Platzner, Marco and Meyer auf der Heide,
Friedhelm}, year={2013} }'
chicago: 'Happe, Markus, Peter Kling, Christian Plessl, Marco Platzner, and Friedhelm
Meyer auf der Heide. “On-The-Fly Computing: A Novel Paradigm for Individualized
IT Services.” In Proceedings of the 9th IEEE Workshop on Software Technology
for Future Embedded and Ubiquitous Systems (SEUS). IEEE, 2013. https://doi.org/10.1109/ISORC.2013.6913232.'
ieee: 'M. Happe, P. Kling, C. Plessl, M. Platzner, and F. Meyer auf der Heide, “On-The-Fly
Computing: A Novel Paradigm for Individualized IT Services,” 2013, doi: 10.1109/ISORC.2013.6913232.'
mla: 'Happe, Markus, et al. “On-The-Fly Computing: A Novel Paradigm for Individualized
IT Services.” Proceedings of the 9th IEEE Workshop on Software Technology for
Future Embedded and Ubiquitous Systems (SEUS), IEEE, 2013, doi:10.1109/ISORC.2013.6913232.'
short: 'M. Happe, P. Kling, C. Plessl, M. Platzner, F. Meyer auf der Heide, in:
Proceedings of the 9th IEEE Workshop on Software Technology for Future Embedded
and Ubiquitous Systems (SEUS), IEEE, 2013.'
date_created: 2017-10-17T12:42:30Z
date_updated: 2023-09-26T13:38:20Z
ddc:
- '040'
department:
- _id: '63'
- _id: '27'
- _id: '518'
- _id: '78'
doi: 10.1109/ISORC.2013.6913232
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T13:38:56Z
date_updated: 2018-03-15T13:38:56Z
file_id: '1308'
file_name: 505-Plessl13_seus.pdf
file_size: 1040834
relation: main_file
success: 1
file_date_updated: 2018-03-15T13:38:56Z
has_accepted_license: '1'
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
publication: Proceedings of the 9th IEEE Workshop on Software Technology for Future
embedded and Ubiquitous Systems (SEUS)
publisher: IEEE
quality_controlled: '1'
status: public
title: 'On-The-Fly Computing: A Novel Paradigm for Individualized IT Services'
type: conference
user_id: '15278'
year: '2013'
...
---
_id: '1787'
author:
- first_name: Tim
full_name: Suess, Tim
last_name: Suess
- first_name: Andrew
full_name: Schoenrock, Andrew
last_name: Schoenrock
- first_name: Sebastian
full_name: Meisner, Sebastian
last_name: Meisner
- first_name: Christian
full_name: Plessl, Christian
id: '16153'
last_name: Plessl
orcid: 0000-0001-5728-9982
citation:
ama: 'Suess T, Schoenrock A, Meisner S, Plessl C. Parallel Macro Pipelining on the
Intel SCC Many-Core Computer. In: Proc. Int. Symp. on Parallel and Distributed
Processing Workshops (IPDPSW). IEEE Computer Society; 2013:64-73. doi:10.1109/IPDPSW.2013.136'
apa: Suess, T., Schoenrock, A., Meisner, S., & Plessl, C. (2013). Parallel Macro
Pipelining on the Intel SCC Many-Core Computer. Proc. Int. Symp. on Parallel
and Distributed Processing Workshops (IPDPSW), 64–73. https://doi.org/10.1109/IPDPSW.2013.136
bibtex: '@inproceedings{Suess_Schoenrock_Meisner_Plessl_2013, place={Washington,
DC, USA}, title={Parallel Macro Pipelining on the Intel SCC Many-Core Computer},
DOI={10.1109/IPDPSW.2013.136},
booktitle={Proc. Int. Symp. on Parallel and Distributed Processing Workshops (IPDPSW)},
publisher={IEEE Computer Society}, author={Suess, Tim and Schoenrock, Andrew and
Meisner, Sebastian and Plessl, Christian}, year={2013}, pages={64–73} }'
chicago: 'Suess, Tim, Andrew Schoenrock, Sebastian Meisner, and Christian Plessl.
“Parallel Macro Pipelining on the Intel SCC Many-Core Computer.” In Proc. Int.
Symp. on Parallel and Distributed Processing Workshops (IPDPSW), 64–73. Washington,
DC, USA: IEEE Computer Society, 2013. https://doi.org/10.1109/IPDPSW.2013.136.'
ieee: 'T. Suess, A. Schoenrock, S. Meisner, and C. Plessl, “Parallel Macro Pipelining
on the Intel SCC Many-Core Computer,” in Proc. Int. Symp. on Parallel and Distributed
Processing Workshops (IPDPSW), 2013, pp. 64–73, doi: 10.1109/IPDPSW.2013.136.'
mla: Suess, Tim, et al. “Parallel Macro Pipelining on the Intel SCC Many-Core Computer.”
Proc. Int. Symp. on Parallel and Distributed Processing Workshops (IPDPSW),
IEEE Computer Society, 2013, pp. 64–73, doi:10.1109/IPDPSW.2013.136.
short: 'T. Suess, A. Schoenrock, S. Meisner, C. Plessl, in: Proc. Int. Symp. on
Parallel and Distributed Processing Workshops (IPDPSW), IEEE Computer Society,
Washington, DC, USA, 2013, pp. 64–73.'
date_created: 2018-03-26T14:51:05Z
date_updated: 2023-09-26T13:38:05Z
department:
- _id: '27'
- _id: '518'
- _id: '78'
- _id: '63'
doi: 10.1109/IPDPSW.2013.136
language:
- iso: eng
page: 64-73
place: Washington, DC, USA
project:
- _id: '30'
grant_number: 01|H11004A
name: Enabling Heterogeneous Hardware Acceleration using Novel Programming and Scheduling
Models
publication: Proc. Int. Symp. on Parallel and Distributed Processing Workshops (IPDPSW)
publication_identifier:
isbn:
- 978-0-7695-4979-8
publisher: IEEE Computer Society
quality_controlled: '1'
status: public
title: Parallel Macro Pipelining on the Intel SCC Many-Core Computer
type: conference
user_id: '15278'
year: '2013'
...
---
_id: '15180'
author:
- first_name: G Scott
full_name: Owen, G Scott
last_name: Owen
- first_name: Gitta
full_name: Domik, Gitta
id: '90'
last_name: Domik
- first_name: David S
full_name: Ebert, David S
last_name: Ebert
- first_name: Jörn
full_name: Kohlhammer, Jörn
last_name: Kohlhammer
- first_name: Holly
full_name: Rushmeier, Holly
last_name: Rushmeier
- first_name: Beatriz Sousa
full_name: Santos, Beatriz Sousa
last_name: Santos
- first_name: Daniel
full_name: Weiskopf, Daniel
last_name: Weiskopf
citation:
ama: Owen GS, Domik G, Ebert DS, et al. How visualization courses have changed over
the past 10 years. IEEE computer graphics and applications. 2013;33(4):14-19.
doi:10.1109/MCG.2013.57
apa: Owen, G. S., Domik, G., Ebert, D. S., Kohlhammer, J., Rushmeier, H., Santos,
B. S., & Weiskopf, D. (2013). How visualization courses have changed over
the past 10 years. IEEE Computer Graphics and Applications, 33(4),
14–19. https://doi.org/10.1109/MCG.2013.57
bibtex: '@article{Owen_Domik_Ebert_Kohlhammer_Rushmeier_Santos_Weiskopf_2013, title={How
visualization courses have changed over the past 10 years}, volume={33}, DOI={10.1109/MCG.2013.57}, number={4},
journal={IEEE computer graphics and applications}, publisher={IEEE}, author={Owen,
G Scott and Domik, Gitta and Ebert, David S and Kohlhammer, Jörn and Rushmeier,
Holly and Santos, Beatriz Sousa and Weiskopf, Daniel}, year={2013}, pages={14–19}
}'
chicago: 'Owen, G Scott, Gitta Domik, David S Ebert, Jörn Kohlhammer, Holly Rushmeier,
Beatriz Sousa Santos, and Daniel Weiskopf. “How Visualization Courses Have Changed
over the Past 10 Years.” IEEE Computer Graphics and Applications 33, no.
4 (2013): 14–19. https://doi.org/10.1109/MCG.2013.57.'
ieee: 'G. S. Owen et al., “How visualization courses have changed over the
past 10 years,” IEEE computer graphics and applications, vol. 33, no. 4,
pp. 14–19, 2013, doi: 10.1109/MCG.2013.57.'
mla: Owen, G. Scott, et al. “How Visualization Courses Have Changed over the Past
10 Years.” IEEE Computer Graphics and Applications, vol. 33, no. 4, IEEE,
2013, pp. 14–19, doi:10.1109/MCG.2013.57.
short: G.S. Owen, G. Domik, D.S. Ebert, J. Kohlhammer, H. Rushmeier, B.S. Santos,
D. Weiskopf, IEEE Computer Graphics and Applications 33 (2013) 14–19.
date_created: 2019-11-26T09:17:52Z
date_updated: 2026-02-24T07:47:41Z
department:
- _id: '65'
doi: 10.1109/MCG.2013.57
intvolume: ' 33'
issue: '4'
language:
- iso: eng
page: 14-19
publication: IEEE computer graphics and applications
publisher: IEEE
status: public
title: How visualization courses have changed over the past 10 years
type: journal_article
user_id: '14972'
volume: 33
year: '2013'
...
---
_id: '60453'
abstract:
- lang: eng
text: "\r\n The most popular and actively researched class of
quad remeshing techniques is the family of\r\n parametrization
based quad meshing methods\r\n . They all strive to generate
an\r\n integer-grid map\r\n ,
i.e. a parametrization of the input surface into R\r\n 2\r\n
\ such that the canonical grid of integer iso-lines forms a quad mesh
when mapped back onto the surface in R\r\n 3\r\n
\ . An essential, albeit broadly neglected aspect of these methods is
the\r\n quad extraction\r\n step,
i.e. the materialization of an actual quad mesh from the mere \"quad texture\".
Quad (mesh) extraction is often believed to be a trivial matter but quite the
opposite is true: numerous special cases, ambiguities induced by numerical inaccuracies
and limited solver precision, as well as imperfections in the maps produced by
most methods (unless costly countermeasures are taken) pose significant challenges
to the quad extractor. We present a method to sanitize a provided parametrization
such that it becomes numerically consistent even in a limited precision floating
point representation. Based on this we are able to provide a comprehensive and
sound description of how to perform quad extraction robustly and without the need
for any complex tolerance thresholds or disambiguation rules. On top of that we
develop a novel strategy to cope with common local fold-overs in the parametrization.
This allows our method, dubbed\r\n QEx\r\n
\ , to generate all-quadrilateral meshes where otherwise holes, non-quad
polygons or no output at all would have been produced. We thus enable the practical
use of an entire class of maps that was previously considered defective. Since
state of the art quad meshing methods spend a significant share of their run time
solely to prevent local fold-overs, using our method it is now possible to obtain
quad meshes significantly quicker than before. We also provide libQEx, an open
source C++ reference implementation of our method and thus significantly lower
the bar to enter the field of quad meshing.\r\n "
alternative_title:
- robust quad mesh extraction
author:
- first_name: Hans-Christian
full_name: Ebke, Hans-Christian
last_name: Ebke
- first_name: David
full_name: Bommes, David
last_name: Bommes
- first_name: Marcel
full_name: Campen, Marcel
id: '114904'
last_name: Campen
orcid: 0000-0003-2340-3462
- first_name: Leif
full_name: Kobbelt, Leif
last_name: Kobbelt
citation:
ama: Ebke H-C, Bommes D, Campen M, Kobbelt L. QEx. ACM Transactions on Graphics.
2013;32(6):1-10. doi:10.1145/2508363.2508372
apa: Ebke, H.-C., Bommes, D., Campen, M., & Kobbelt, L. (2013). QEx. ACM
Transactions on Graphics, 32(6), 1–10. https://doi.org/10.1145/2508363.2508372
bibtex: '@article{Ebke_Bommes_Campen_Kobbelt_2013, title={QEx}, volume={32}, DOI={10.1145/2508363.2508372}, number={6},
journal={ACM Transactions on Graphics}, publisher={Association for Computing Machinery
(ACM)}, author={Ebke, Hans-Christian and Bommes, David and Campen, Marcel and
Kobbelt, Leif}, year={2013}, pages={1–10} }'
chicago: 'Ebke, Hans-Christian, David Bommes, Marcel Campen, and Leif Kobbelt. “QEx.”
ACM Transactions on Graphics 32, no. 6 (2013): 1–10. https://doi.org/10.1145/2508363.2508372.'
ieee: 'H.-C. Ebke, D. Bommes, M. Campen, and L. Kobbelt, “QEx,” ACM Transactions
on Graphics, vol. 32, no. 6, pp. 1–10, 2013, doi: 10.1145/2508363.2508372.'
mla: Ebke, Hans-Christian, et al. “QEx.” ACM Transactions on Graphics, vol.
32, no. 6, Association for Computing Machinery (ACM), 2013, pp. 1–10, doi:10.1145/2508363.2508372.
short: H.-C. Ebke, D. Bommes, M. Campen, L. Kobbelt, ACM Transactions on Graphics
32 (2013) 1–10.
date_created: 2025-06-30T07:11:12Z
date_updated: 2025-07-14T12:39:54Z
department:
- _id: '969'
doi: 10.1145/2508363.2508372
extern: '1'
intvolume: ' 32'
issue: '6'
language:
- iso: eng
page: 1-10
publication: ACM Transactions on Graphics
publication_identifier:
issn:
- 0730-0301
- 1557-7368
publication_status: published
publisher: Association for Computing Machinery (ACM)
status: public
title: QEx
type: journal_article
user_id: '117512'
volume: 32
year: '2013'
...