---
_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'
...
---
_id: '60452'
abstract:
- lang: eng
text: 'Quadrilateral remeshing approaches based on global parametrization
enable many desirable mesh properties. Two of the most important ones are (1)
high regularity due to explicit control over irregular vertices and (2) smooth
distribution of distortion achieved by convex variational formulations. Apart
from these strengths, state-of-the-art techniques suffer from limited reliability
on real-world input data, i.e. the determined map might have degeneracies like
(local) non-injectivities and consequently often cannot be used directly to generate
a quadrilateral mesh. In this paper we propose a novel convex Mixed-Integer Quadratic
Programming (MIQP) formulation which ensures by construction that the resulting
map is within the class of so called Integer-Grid Maps that are guaranteed to
imply a quad mesh. In order to overcome the NP-hardness of MIQP and to be able
to remesh typical input geometries in acceptable time we propose two additional
problem specific optimizations: a complexity reduction algorithm and singularity
separating conditions. While the former decouples the dimension of the MIQP search
space from the input complexity of the triangle mesh and thus is able to dramatically
speed up the computation without inducing inaccuracies, the latter improves the
continuous relaxation, which is crucial for the success of modern MIQP optimizers.
Our experiments show that the reliability of the resulting algorithm does not
only annihilate the main drawback of parametrization based quad-remeshing but
moreover enables the global search for high-quality coarse quad layouts - a difficult
task solely tackled by greedy methodologies before.'
author:
- 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: Hans-Christian
full_name: Ebke, Hans-Christian
last_name: Ebke
- first_name: Pierre
full_name: Alliez, Pierre
last_name: Alliez
- first_name: Leif
full_name: Kobbelt, Leif
last_name: Kobbelt
citation:
ama: Bommes D, Campen M, Ebke H-C, Alliez P, Kobbelt L. Integer-grid maps for reliable
quad meshing. ACM Transactions on Graphics. 2013;32(4):1-12. doi:10.1145/2461912.2462014
apa: Bommes, D., Campen, M., Ebke, H.-C., Alliez, P., & Kobbelt, L. (2013).
Integer-grid maps for reliable quad meshing. ACM Transactions on Graphics,
32(4), 1–12. https://doi.org/10.1145/2461912.2462014
bibtex: '@article{Bommes_Campen_Ebke_Alliez_Kobbelt_2013, title={Integer-grid maps
for reliable quad meshing}, volume={32}, DOI={10.1145/2461912.2462014},
number={4}, journal={ACM Transactions on Graphics}, publisher={Association for
Computing Machinery (ACM)}, author={Bommes, David and Campen, Marcel and Ebke,
Hans-Christian and Alliez, Pierre and Kobbelt, Leif}, year={2013}, pages={1–12}
}'
chicago: 'Bommes, David, Marcel Campen, Hans-Christian Ebke, Pierre Alliez, and
Leif Kobbelt. “Integer-Grid Maps for Reliable Quad Meshing.” ACM Transactions
on Graphics 32, no. 4 (2013): 1–12. https://doi.org/10.1145/2461912.2462014.'
ieee: 'D. Bommes, M. Campen, H.-C. Ebke, P. Alliez, and L. Kobbelt, “Integer-grid
maps for reliable quad meshing,” ACM Transactions on Graphics, vol. 32,
no. 4, pp. 1–12, 2013, doi: 10.1145/2461912.2462014.'
mla: Bommes, David, et al. “Integer-Grid Maps for Reliable Quad Meshing.” ACM
Transactions on Graphics, vol. 32, no. 4, Association for Computing Machinery
(ACM), 2013, pp. 1–12, doi:10.1145/2461912.2462014.
short: D. Bommes, M. Campen, H.-C. Ebke, P. Alliez, L. Kobbelt, ACM Transactions
on Graphics 32 (2013) 1–12.
date_created: 2025-06-30T07:06:50Z
date_updated: 2025-07-14T12:39:58Z
department:
- _id: '969'
doi: 10.1145/2461912.2462014
extern: '1'
intvolume: ' 32'
issue: '4'
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: Integer-grid maps for reliable quad meshing
type: journal_article
user_id: '117512'
volume: 32
year: '2013'
...
---
_id: '60451'
abstract:
- lang: eng
text: "Nowadays, digital 3D models are in widespread and ubiquitous use,
and each specific application dealing with 3D geometry has its own quality requirements
that restrict the class of acceptable and supported models. This article analyzes
typical defects that make a 3D model unsuitable for key application contexts,
and surveys existing algorithms that process, repair, and improve its structure,
geometry, and topology to make it appropriate to case-by-case requirements.\r\n
\ The analysis is focused on polygon meshes, which constitute
by far the most common 3D object representation. In particular, this article provides
a structured overview of mesh repairing techniques from the point of view of the
application context. Different types of mesh defects are classified according
to the upstream application that produced the mesh, whereas mesh quality requirements
are grouped by representative sets of downstream applications where the mesh is
to be used. The numerous mesh repair methods that have been proposed during the
last two decades are analyzed and classified in terms of their capabilities, properties,
and guarantees. Based on these classifications, guidelines can be derived to support
the identification of repairing algorithms best-suited to bridge the compatibility
gap between the quality provided by the upstream process and the quality required
by the downstream applications in a given geometry processing scenario."
alternative_title:
- An application perspective
author:
- first_name: Marco
full_name: Attene, Marco
last_name: Attene
- 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: Attene M, Campen M, Kobbelt L. Polygon mesh repairing. ACM Computing Surveys.
2013;45(2):1-33. doi:10.1145/2431211.2431214
apa: Attene, M., Campen, M., & Kobbelt, L. (2013). Polygon mesh repairing. ACM
Computing Surveys, 45(2), 1–33. https://doi.org/10.1145/2431211.2431214
bibtex: '@article{Attene_Campen_Kobbelt_2013, title={Polygon mesh repairing}, volume={45},
DOI={10.1145/2431211.2431214},
number={2}, journal={ACM Computing Surveys}, publisher={Association for Computing
Machinery (ACM)}, author={Attene, Marco and Campen, Marcel and Kobbelt, Leif},
year={2013}, pages={1–33} }'
chicago: 'Attene, Marco, Marcel Campen, and Leif Kobbelt. “Polygon Mesh Repairing.”
ACM Computing Surveys 45, no. 2 (2013): 1–33. https://doi.org/10.1145/2431211.2431214.'
ieee: 'M. Attene, M. Campen, and L. Kobbelt, “Polygon mesh repairing,” ACM Computing
Surveys, vol. 45, no. 2, pp. 1–33, 2013, doi: 10.1145/2431211.2431214.'
mla: Attene, Marco, et al. “Polygon Mesh Repairing.” ACM Computing Surveys,
vol. 45, no. 2, Association for Computing Machinery (ACM), 2013, pp. 1–33, doi:10.1145/2431211.2431214.
short: M. Attene, M. Campen, L. Kobbelt, ACM Computing Surveys 45 (2013) 1–33.
date_created: 2025-06-30T07:05:12Z
date_updated: 2025-07-14T12:40:08Z
department:
- _id: '969'
doi: 10.1145/2431211.2431214
extern: '1'
intvolume: ' 45'
issue: '2'
language:
- iso: eng
page: 1-33
publication: ACM Computing Surveys
publication_identifier:
issn:
- 0360-0300
- 1557-7341
publication_status: published
publisher: Association for Computing Machinery (ACM)
status: public
title: Polygon mesh repairing
type: journal_article
user_id: '114904'
volume: 45
year: '2013'
...
---
_id: '60450'
abstract:
- lang: eng
text: AbstractThe computation of intrinsic, geodesic
distances and geodesic paths on surfaces is a fundamental low‐level building block
in countless Computer Graphics and Geometry Processing applications. This demand
led to the development of numerous algorithms – some for the exact, others for
the approximative computation, some focussing on speed, others providing strict
guarantees. Most of these methods are designed for computing distances according
to the standard Riemannian metric induced by the surface's embedding in Euclidean
space. Generalization to other, especially anisotropic, metrics – which more recently
gained interest in several application areas – is not rarely hampered by fundamental
problems. We explore and discuss possibilities for the generalization and extension
of well‐known methods to the anisotropic case, evaluate their relative performance
in terms of accuracy and speed, and propose a novel algorithm, the Short‐Term
Vector Dijkstra. This algorithm is strikingly simple to implement
and proves to provide practical accuracy at a higher speed than generalized previous
methods.
author:
- first_name: Marcel
full_name: Campen, Marcel
id: '114904'
last_name: Campen
orcid: 0000-0003-2340-3462
- first_name: Martin
full_name: Heistermann, Martin
last_name: Heistermann
- first_name: Leif
full_name: Kobbelt, Leif
last_name: Kobbelt
citation:
ama: Campen M, Heistermann M, Kobbelt L. Practical Anisotropic Geodesy. Computer
Graphics Forum. 2013;32(5):63-71. doi:10.1111/cgf.12173
apa: Campen, M., Heistermann, M., & Kobbelt, L. (2013). Practical Anisotropic
Geodesy. Computer Graphics Forum, 32(5), 63–71. https://doi.org/10.1111/cgf.12173
bibtex: '@article{Campen_Heistermann_Kobbelt_2013, title={Practical Anisotropic
Geodesy}, volume={32}, DOI={10.1111/cgf.12173},
number={5}, journal={Computer Graphics Forum}, publisher={Wiley}, author={Campen,
Marcel and Heistermann, Martin and Kobbelt, Leif}, year={2013}, pages={63–71}
}'
chicago: 'Campen, Marcel, Martin Heistermann, and Leif Kobbelt. “Practical Anisotropic
Geodesy.” Computer Graphics Forum 32, no. 5 (2013): 63–71. https://doi.org/10.1111/cgf.12173.'
ieee: 'M. Campen, M. Heistermann, and L. Kobbelt, “Practical Anisotropic Geodesy,”
Computer Graphics Forum, vol. 32, no. 5, pp. 63–71, 2013, doi: 10.1111/cgf.12173.'
mla: Campen, Marcel, et al. “Practical Anisotropic Geodesy.” Computer Graphics
Forum, vol. 32, no. 5, Wiley, 2013, pp. 63–71, doi:10.1111/cgf.12173.
short: M. Campen, M. Heistermann, L. Kobbelt, Computer Graphics Forum 32 (2013)
63–71.
date_created: 2025-06-30T06:53:20Z
date_updated: 2025-07-14T12:40:27Z
department:
- _id: '969'
doi: 10.1111/cgf.12173
extern: '1'
intvolume: ' 32'
issue: '5'
language:
- iso: eng
page: 63-71
publication: Computer Graphics Forum
publication_identifier:
issn:
- 0167-7055
- 1467-8659
publication_status: published
publisher: Wiley
status: public
title: Practical Anisotropic Geodesy
type: journal_article
user_id: '117512'
volume: 32
year: '2013'
...
---
_id: '60454'
author:
- first_name: Henrik
full_name: Zimmer, Henrik
last_name: Zimmer
- 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: 'Zimmer H, Campen M, Kobbelt L. Efficient Computation of Shortest Path-Concavity
for 3D Meshes. In: 2013 IEEE Conference on Computer Vision and Pattern Recognition.
IEEE; 2013. doi:10.1109/cvpr.2013.280'
apa: Zimmer, H., Campen, M., & Kobbelt, L. (2013). Efficient Computation of
Shortest Path-Concavity for 3D Meshes. 2013 IEEE Conference on Computer Vision
and Pattern Recognition. https://doi.org/10.1109/cvpr.2013.280
bibtex: '@inproceedings{Zimmer_Campen_Kobbelt_2013, title={Efficient Computation
of Shortest Path-Concavity for 3D Meshes}, DOI={10.1109/cvpr.2013.280},
booktitle={2013 IEEE Conference on Computer Vision and Pattern Recognition}, publisher={IEEE},
author={Zimmer, Henrik and Campen, Marcel and Kobbelt, Leif}, year={2013} }'
chicago: Zimmer, Henrik, Marcel Campen, and Leif Kobbelt. “Efficient Computation
of Shortest Path-Concavity for 3D Meshes.” In 2013 IEEE Conference on Computer
Vision and Pattern Recognition. IEEE, 2013. https://doi.org/10.1109/cvpr.2013.280.
ieee: 'H. Zimmer, M. Campen, and L. Kobbelt, “Efficient Computation of Shortest
Path-Concavity for 3D Meshes,” 2013, doi: 10.1109/cvpr.2013.280.'
mla: Zimmer, Henrik, et al. “Efficient Computation of Shortest Path-Concavity for
3D Meshes.” 2013 IEEE Conference on Computer Vision and Pattern Recognition,
IEEE, 2013, doi:10.1109/cvpr.2013.280.
short: 'H. Zimmer, M. Campen, L. Kobbelt, in: 2013 IEEE Conference on Computer Vision
and Pattern Recognition, IEEE, 2013.'
date_created: 2025-06-30T07:17:02Z
date_updated: 2025-07-14T12:39:49Z
department:
- _id: '969'
doi: 10.1109/cvpr.2013.280
language:
- iso: eng
publication: 2013 IEEE Conference on Computer Vision and Pattern Recognition
publication_status: published
publisher: IEEE
status: public
title: Efficient Computation of Shortest Path-Concavity for 3D Meshes
type: conference
user_id: '117512'
year: '2013'
...
---
_id: '2504'
author:
- first_name: Rana Azeem M.
full_name: Khan, Rana Azeem M.
last_name: Khan
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: Khan RAM, Karl H. Simulating Cooperative Diversity Protocols for Multi-Hop
Wireless and Sensor Networks.; 2012.
apa: Khan, R. A. M., & Karl, H. (2012). Simulating Cooperative Diversity
Protocols for Multi-hop Wireless and Sensor Networks.
bibtex: '@book{Khan_Karl_2012, title={Simulating Cooperative Diversity Protocols
for Multi-hop Wireless and Sensor Networks}, author={Khan, Rana Azeem M. and Karl,
Holger}, year={2012} }'
chicago: Khan, Rana Azeem M., and Holger Karl. Simulating Cooperative Diversity
Protocols for Multi-Hop Wireless and Sensor Networks, 2012.
ieee: R. A. M. Khan and H. Karl, Simulating Cooperative Diversity Protocols for
Multi-hop Wireless and Sensor Networks. 2012.
mla: Khan, Rana Azeem M., and Holger Karl. Simulating Cooperative Diversity Protocols
for Multi-Hop Wireless and Sensor Networks. 2012.
short: R.A.M. Khan, H. Karl, Simulating Cooperative Diversity Protocols for Multi-Hop
Wireless and Sensor Networks, 2012.
date_created: 2018-04-26T10:33:57Z
date_updated: 2022-01-06T06:56:44Z
department:
- _id: '75'
main_file_link:
- url: https://pdfs.semanticscholar.org/d44f/54184aee09de1c22906b7515976de801d473.pdf
status: public
title: Simulating Cooperative Diversity Protocols for Multi-hop Wireless and Sensor
Networks
type: report
user_id: '15572'
year: '2012'
...
---
_id: '2505'
author:
- first_name: Christian
full_name: Dannewitz, Christian
last_name: Dannewitz
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
- first_name: Aditya
full_name: Yadav, Aditya
last_name: Yadav
citation:
ama: Dannewitz C, Karl H, Yadav A. Report on Locality in DNS Requests – Evaluation
and Impact on Future Internet Architectures.; 2012.
apa: Dannewitz, C., Karl, H., & Yadav, A. (2012). Report on Locality in DNS
Requests – Evaluation and Impact on Future Internet Architectures.
bibtex: '@book{Dannewitz_Karl_Yadav_2012, title={Report on Locality in DNS Requests
– Evaluation and Impact on Future Internet Architectures}, author={Dannewitz,
Christian and Karl, Holger and Yadav, Aditya}, year={2012} }'
chicago: Dannewitz, Christian, Holger Karl, and Aditya Yadav. Report on Locality
in DNS Requests – Evaluation and Impact on Future Internet Architectures,
2012.
ieee: C. Dannewitz, H. Karl, and A. Yadav, Report on Locality in DNS Requests
– Evaluation and Impact on Future Internet Architectures. 2012.
mla: Dannewitz, Christian, et al. Report on Locality in DNS Requests – Evaluation
and Impact on Future Internet Architectures. 2012.
short: C. Dannewitz, H. Karl, A. Yadav, Report on Locality in DNS Requests – Evaluation
and Impact on Future Internet Architectures, 2012.
date_created: 2018-04-26T10:38:06Z
date_updated: 2022-01-06T06:56:44Z
ddc:
- '000'
department:
- _id: '75'
file:
- access_level: closed
content_type: application/pdf
creator: tabu
date_created: 2018-04-26T10:37:47Z
date_updated: 2018-04-26T10:37:47Z
file_id: '2507'
file_name: Dannewitz-Report_on_Locality_in_DNS_Requests.pdf
file_size: 284669
relation: main_file
success: 1
file_date_updated: 2018-04-26T10:37:47Z
has_accepted_license: '1'
status: public
title: Report on Locality in DNS Requests – Evaluation and Impact on Future Internet
Architectures
type: report
user_id: '15572'
year: '2012'
...
---
_id: '20173'
abstract:
- lang: eng
text: This paper investigates the properties required to evolve Artificial Neural
Networks for distributed control in modular robotics, which typically involves
non-linear dynamics and complex interactions in the sensori-motor space. We investigate
the relation between macro-scale properties (such as modularity and regularity)
and micro-scale properties in Neural Network controllers. We show how neurons
capable of multiplicative-like arithmetic operations may increase the performance
of controllers in several ways whenever challenging control problems with non-linear
dynamics are involved. This paper provides evidence that performance and robustness
of evolved controllers can be improved by a combination of carefully chosen micro-
and macro-scale neural network properties.
author:
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
- first_name: Jürgen
full_name: Stradner, Jürgen
last_name: Stradner
- first_name: Nicolas
full_name: Bredeche, Nicolas
last_name: Bredeche
- first_name: Leo
full_name: Cazenille, Leo
last_name: Cazenille
citation:
ama: 'Hamann H, Stradner J, Bredeche N, Cazenille L. Impact of Neuron Models and
Network Structure on Evolving Modular Robot Neural Network Controllers. In: 14th
Annual Genetic and Evolutionary Computation Conference, GECCO 2012. ACM; 2012:89-96.
doi:10.1145/2330163.2330177'
apa: Hamann, H., Stradner, J., Bredeche, N., & Cazenille, L. (2012). Impact
of Neuron Models and Network Structure on Evolving Modular Robot Neural Network
Controllers. In 14th Annual Genetic and Evolutionary Computation Conference,
GECCO 2012 (pp. 89–96). ACM. https://doi.org/10.1145/2330163.2330177
bibtex: '@inproceedings{Hamann_Stradner_Bredeche_Cazenille_2012, title={Impact of
Neuron Models and Network Structure on Evolving Modular Robot Neural Network Controllers},
DOI={10.1145/2330163.2330177},
booktitle={14th Annual Genetic and Evolutionary Computation Conference, GECCO
2012}, publisher={ACM}, author={Hamann, Heiko and Stradner, Jürgen and Bredeche,
Nicolas and Cazenille, Leo}, year={2012}, pages={89–96} }'
chicago: Hamann, Heiko, Jürgen Stradner, Nicolas Bredeche, and Leo Cazenille. “Impact
of Neuron Models and Network Structure on Evolving Modular Robot Neural Network
Controllers.” In 14th Annual Genetic and Evolutionary Computation Conference,
GECCO 2012, 89–96. ACM, 2012. https://doi.org/10.1145/2330163.2330177.
ieee: H. Hamann, J. Stradner, N. Bredeche, and L. Cazenille, “Impact of Neuron Models
and Network Structure on Evolving Modular Robot Neural Network Controllers,” in
14th Annual Genetic and Evolutionary Computation Conference, GECCO 2012,
2012, pp. 89–96.
mla: Hamann, Heiko, et al. “Impact of Neuron Models and Network Structure on Evolving
Modular Robot Neural Network Controllers.” 14th Annual Genetic and Evolutionary
Computation Conference, GECCO 2012, ACM, 2012, pp. 89–96, doi:10.1145/2330163.2330177.
short: 'H. Hamann, J. Stradner, N. Bredeche, L. Cazenille, in: 14th Annual Genetic
and Evolutionary Computation Conference, GECCO 2012, ACM, 2012, pp. 89–96.'
date_created: 2020-10-22T09:32:13Z
date_updated: 2022-01-06T06:54:21Z
department:
- _id: '63'
- _id: '238'
doi: 10.1145/2330163.2330177
language:
- iso: eng
page: 89-96
publication: 14th Annual Genetic and Evolutionary Computation Conference, GECCO 2012
publisher: ACM
status: public
title: Impact of Neuron Models and Network Structure on Evolving Modular Robot Neural
Network Controllers
type: conference
user_id: '15415'
year: '2012'
...
---
_id: '20174'
abstract:
- lang: eng
text: 'As a contribution to the efforts towards robotic systems of higher flexibility
we present our concept of morphologically dynamic robots. Within the projects
SYMBRION and REPLICATOR, that focus on modular robotics, we have developed bio-inspired
control techniques to achieve new concepts of dynamic, autonomous morphological
structures. We propose three modes of coupling between robot modules: swarm, team,
and organism mode. We demonstrate our concepts along with simple robot experiments.'
author:
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
- first_name: Thomas
full_name: Schmickl, Thomas
last_name: Schmickl
- first_name: Jürgen
full_name: Stradner, Jürgen
last_name: Stradner
citation:
ama: 'Hamann H, Schmickl T, Stradner J. Towards Morphological Flexibility: Modular
Robotics and Bio-inspired Control. In: Austrian Robotics Workshop (Operational
Programme Slovenia-Austria). ; 2012.'
apa: 'Hamann, H., Schmickl, T., & Stradner, J. (2012). Towards Morphological
Flexibility: Modular Robotics and Bio-inspired Control. In Austrian Robotics
Workshop (Operational Programme Slovenia-Austria).'
bibtex: '@inproceedings{Hamann_Schmickl_Stradner_2012, title={Towards Morphological
Flexibility: Modular Robotics and Bio-inspired Control}, booktitle={Austrian Robotics
Workshop (Operational Programme Slovenia-Austria)}, author={Hamann, Heiko and
Schmickl, Thomas and Stradner, Jürgen}, year={2012} }'
chicago: 'Hamann, Heiko, Thomas Schmickl, and Jürgen Stradner. “Towards Morphological
Flexibility: Modular Robotics and Bio-Inspired Control.” In Austrian Robotics
Workshop (Operational Programme Slovenia-Austria), 2012.'
ieee: 'H. Hamann, T. Schmickl, and J. Stradner, “Towards Morphological Flexibility:
Modular Robotics and Bio-inspired Control,” in Austrian Robotics Workshop (Operational
Programme Slovenia-Austria), 2012.'
mla: 'Hamann, Heiko, et al. “Towards Morphological Flexibility: Modular Robotics
and Bio-Inspired Control.” Austrian Robotics Workshop (Operational Programme
Slovenia-Austria), 2012.'
short: 'H. Hamann, T. Schmickl, J. Stradner, in: Austrian Robotics Workshop (Operational
Programme Slovenia-Austria), 2012.'
date_created: 2020-10-22T09:36:02Z
date_updated: 2022-01-06T06:54:21Z
department:
- _id: '63'
- _id: '238'
language:
- iso: eng
publication: Austrian Robotics Workshop (Operational Programme Slovenia-Austria)
status: public
title: 'Towards Morphological Flexibility: Modular Robotics and Bio-inspired Control'
type: conference
user_id: '15415'
year: '2012'
...
---
_id: '20175'
author:
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
- first_name: Thomas
full_name: Schmickl, Thomas
last_name: Schmickl
- first_name: Jürgen
full_name: Stradner, Jürgen
last_name: Stradner
- first_name: Karl
full_name: Crailsheim, Karl
last_name: Crailsheim
- first_name: Payam
full_name: Zahadat, Payam
last_name: Zahadat
- first_name: Christoph
full_name: Adami, Christoph
last_name: Adami
- first_name: David M.
full_name: Bryson, David M.
last_name: Bryson
- first_name: Charles
full_name: Ofria, Charles
last_name: Ofria
- first_name: Robert T.
full_name: Pennock, Robert T.
last_name: Pennock
citation:
ama: 'Hamann H, Schmickl T, Stradner J, et al. On-line, On-board Evolution of Reaction-Diffusion
Control for Self-Adaptation. In: Alife XIII. MIT Press; 2012:597-598.'
apa: Hamann, H., Schmickl, T., Stradner, J., Crailsheim, K., Zahadat, P., Adami,
C., … Pennock, R. T. (2012). On-line, On-board Evolution of Reaction-Diffusion
Control for Self-Adaptation. In Alife XIII (pp. 597–598). MIT Press.
bibtex: '@inproceedings{Hamann_Schmickl_Stradner_Crailsheim_Zahadat_Adami_Bryson_Ofria_Pennock_2012,
title={On-line, On-board Evolution of Reaction-Diffusion Control for Self-Adaptation},
booktitle={Alife XIII}, publisher={MIT Press}, author={Hamann, Heiko and Schmickl,
Thomas and Stradner, Jürgen and Crailsheim, Karl and Zahadat, Payam and Adami,
Christoph and Bryson, David M. and Ofria, Charles and Pennock, Robert T.}, year={2012},
pages={597–598} }'
chicago: Hamann, Heiko, Thomas Schmickl, Jürgen Stradner, Karl Crailsheim, Payam
Zahadat, Christoph Adami, David M. Bryson, Charles Ofria, and Robert T. Pennock.
“On-Line, On-Board Evolution of Reaction-Diffusion Control for Self-Adaptation.”
In Alife XIII, 597–98. MIT Press, 2012.
ieee: H. Hamann et al., “On-line, On-board Evolution of Reaction-Diffusion
Control for Self-Adaptation,” in Alife XIII, 2012, pp. 597–598.
mla: Hamann, Heiko, et al. “On-Line, On-Board Evolution of Reaction-Diffusion Control
for Self-Adaptation.” Alife XIII, MIT Press, 2012, pp. 597–98.
short: 'H. Hamann, T. Schmickl, J. Stradner, K. Crailsheim, P. Zahadat, C. Adami,
D.M. Bryson, C. Ofria, R.T. Pennock, in: Alife XIII, MIT Press, 2012, pp. 597–598.'
date_created: 2020-10-22T09:42:43Z
date_updated: 2022-01-06T06:54:21Z
department:
- _id: '63'
- _id: '238'
language:
- iso: eng
page: 597-598
publication: Alife XIII
publisher: MIT Press
status: public
title: On-line, On-board Evolution of Reaction-Diffusion Control for Self-Adaptation
type: conference
user_id: '15415'
year: '2012'
...