---
_id: '3588'
abstract:
- lang: eng
text: 'In scientific computing, unstructured meshes are a crucial foundation for
the simulation of real-world physical phenomena. Compared to regular grids, they
allow resembling the computational domain with a much higher accuracy, which in
turn leads to more efficient computations.
There exists a wealth of supporting
libraries and frameworks that aid programmers with the implementation of applications
working on such grids, each built on top of existing parallelization technologies.
However, many approaches require the programmer to introduce a different programming
paradigm into their application or provide different variants of the code. SYCL
is a new programming standard providing a remedy to this dilemma by building on
standard C ++17 with its so-called single-source approach: Programmers write standard
C ++ code and expose parallelism using C++17 keywords. The application is
then
transformed into a concrete implementation by the SYCL implementation. By encapsulating
the OpenCL ecosystem, different SYCL implementations enable not only the programming
of CPUs but also of heterogeneous platforms such as GPUs or other devices. For
the first time, this paper showcases a SYCL-
based solver for the nodal Discontinuous
Galerkin method for Maxwell’s equations on unstructured meshes. We compare our
solution to a previous C-based implementation with respect to programmability
and performance on heterogeneous platforms.Proceedings of the 29th Annual IEEE International
Conference on Application-Specific Systems, Architectures and Processors (ASAP).
; 2018:49-56. doi:10.1109/ASAP.2018.8445127'
apa: 'Afzal, A., Schmitt, C., Alhaddad, S., Grynko, Y., Teich, J., Förstner, J.,
& Hannig, F. (2018). Solving Maxwell’s Equations with Modern C++ and SYCL:
A Case Study. In Proceedings of the 29th Annual IEEE International Conference
on Application-specific Systems, Architectures and Processors (ASAP) (pp.
49–56). https://doi.org/10.1109/ASAP.2018.8445127'
bibtex: '@inproceedings{Afzal_Schmitt_Alhaddad_Grynko_Teich_Förstner_Hannig_2018,
title={Solving Maxwell’s Equations with Modern C++ and SYCL: A Case Study}, DOI={10.1109/ASAP.2018.8445127},
booktitle={Proceedings of the 29th Annual IEEE International Conference on Application-specific
Systems, Architectures and Processors (ASAP)}, author={Afzal, Ayesha and Schmitt,
Christian and Alhaddad, Samer and Grynko, Yevgen and Teich, Jürgen and Förstner,
Jens and Hannig, Frank}, year={2018}, pages={49–56} }'
chicago: 'Afzal, Ayesha, Christian Schmitt, Samer Alhaddad, Yevgen Grynko, Jürgen
Teich, Jens Förstner, and Frank Hannig. “Solving Maxwell’s Equations with Modern
C++ and SYCL: A Case Study.” In Proceedings of the 29th Annual IEEE International
Conference on Application-Specific Systems, Architectures and Processors (ASAP),
49–56, 2018. https://doi.org/10.1109/ASAP.2018.8445127.'
ieee: 'A. Afzal et al., “Solving Maxwell’s Equations with Modern C++ and
SYCL: A Case Study,” in Proceedings of the 29th Annual IEEE International Conference
on Application-specific Systems, Architectures and Processors (ASAP), 2018,
pp. 49–56.'
mla: 'Afzal, Ayesha, et al. “Solving Maxwell’s Equations with Modern C++ and SYCL:
A Case Study.” Proceedings of the 29th Annual IEEE International Conference
on Application-Specific Systems, Architectures and Processors (ASAP), 2018,
pp. 49–56, doi:10.1109/ASAP.2018.8445127.'
short: 'A. Afzal, C. Schmitt, S. Alhaddad, Y. Grynko, J. Teich, J. Förstner, F.
Hannig, in: Proceedings of the 29th Annual IEEE International Conference on Application-Specific
Systems, Architectures and Processors (ASAP), 2018, pp. 49–56.'
date_created: 2018-07-23T07:12:03Z
date_updated: 2022-01-06T06:59:26Z
ddc:
- '004'
department:
- _id: '61'
doi: 10.1109/ASAP.2018.8445127
file:
- access_level: request
content_type: application/pdf
creator: fossie
date_created: 2018-08-21T10:12:05Z
date_updated: 2022-01-06T06:59:26Z
embargo: 2019-09-03
embargo_to: open_access
file_id: '3986'
file_name: 2018-08 Afzal - ASAP Proceedings - Solving Maxwell equations with modern
C++ and SYCL.pdf
file_size: 252186
relation: main_file
file_date_updated: 2022-01-06T06:59:26Z
has_accepted_license: '1'
keyword:
- tet_topic_hpc
language:
- iso: eng
page: 49-56
project:
- _id: '33'
grant_number: 01|H16005
name: HighPerMeshes
- _id: '52'
name: Computing Resources Provided by the Paderborn Center for Parallel Computing
publication: Proceedings of the 29th Annual IEEE International Conference on Application-specific
Systems, Architectures and Processors (ASAP)
publication_identifier:
isbn:
- 978-1-5386-7479-6
status: public
title: 'Solving Maxwell''s Equations with Modern C++ and SYCL: A Case Study'
type: conference
user_id: '158'
year: '2018'
...
---
_id: '3720'
abstract:
- lang: eng
text: Traditional cache design uses a consolidated block of memory address bits
to index a cache set, equivalent to the use of modulo functions. While this module-based
mapping scheme is widely used in contemporary cache structures due to the simplicity
of its hardware design and its good performance for sequences of consecutive addresses,
its use may not be satisfactory for a variety of application domains having different
characteristics.This thesis presents a new type of cache mapping scheme, motivated
by programmable capabilities combined with Nature-inspired optimization of reconfigurable
hardware. This research has focussed on an FPGA-based evolvable cache structure
of the first level cache in a multi-core processor architecture, able to dynamically
change cache indexing. To solve the challenge of reconfigurable cache mappings,
a programmable Boolean circuit based on a combination of Look-up Table (LUT) memory
elements is proposed. Focusing on optimization aspects at the system level, a
Performance Measurement Infrastructure is introduced that is able to monitor the
underlying microarchitectural metrics, and an adaptive evaluation strategy is
presented that leverages on Evolutionary Algorithms, that is not only capable
of evolving application-specific address-to-cache-index mappings for level one
split caches but also of reducing optimization times. Putting this all together
and prototyping in an FPGA for a LEON3/Linux-based multi-core processor, the creation
of a system architecture reduces cache misses and improves performance over the
use of conventional caches.
- lang: ger
text: Traditionelle Cachedesigns verwenden konsolidierte Blöcke von Speicheradressbits
um einen Cachesatz zu indizieren, vergleichbar mit der Anwendung einer Modulofunktion.
Obwohl dieses modulobasierte Abbildungsschema in heutigen Cachestrukturen weit
verbreitet ist, vor allem wegen seiner einfachen Anforderungen an das Hardwaredesign
und seiner Effizienz für die Indizierung eufeinanderfolgender Speicheradressen,
kann seine Verwendung für eine Vielzahl von Anwendungsdomänen mit unterschiedlichen
Charakteristiken zu suboptimalen Ergebnissen führen. Diese Dissertation präsentiert
einen neuen Typ von Cacheabbildungsschema, motiviert durch die Kombination programmierbarer
Ressourcen mit der naturinspirierten Optimierung rekonfigurierbarer Hardware.
Im Fokus dieser Forschung steht eine FPGA-basierte Cachestruktur für den first
level Cache einer Mehrkernprozessorarchitektur, welche die Cacheindizierung dynamisch
ändern kann. Um die Herausforderung rekonfigurierbarer Cacheabbildungen zu lösen,
wird eine reprogrammierbare Boolesche Schaltung eingeführt, die auf Look-up Table
(LUT) Speicherelementen basiert. Weiterhin wird eine Infrastruktur zur Effizienzmessung
eingeführt, welche die zugrundeliege Mikroarchitektur überwachen kann, sowie eine
adaptive Evaluationsstrategie präsentiert, die evolutionäre Algorithmen wirksam
einsetzt, und die nicht nur anwendungsspezifische Abbildungen von Speicheradressen
zu Cacheindizes für level one Caches evolvieren sondern dabei auch die Optimierungszeiten
reduzieren kann. All diese Aspekte zusammen in einer prototypischen Implementierung
auf einem FPGA für einen LEON3/Linux-basierten Mehrkernprozessor zeigen, dass
evolvierbare Cacheabbildungsfunktionen Cache Misses reduzieren, sowie die Effizienz
im Vergleich zu konventionellen Caches erhöhen können.
author:
- first_name: Nam
full_name: Ho, Nam
last_name: Ho
citation:
ama: 'Ho N. FPGA-Based Reconfigurable Cache Mapping Schemes: Design and Optimization.
Universität Paderborn; 2018. doi:10.17619/UNIPB/1-376'
apa: 'Ho, N. (2018). FPGA-based Reconfigurable Cache Mapping Schemes: Design
and Optimization. Universität Paderborn. https://doi.org/10.17619/UNIPB/1-376'
bibtex: '@book{Ho_2018, title={FPGA-based Reconfigurable Cache Mapping Schemes:
Design and Optimization}, DOI={10.17619/UNIPB/1-376},
publisher={Universität Paderborn}, author={Ho, Nam}, year={2018} }'
chicago: 'Ho, Nam. FPGA-Based Reconfigurable Cache Mapping Schemes: Design and
Optimization. Universität Paderborn, 2018. https://doi.org/10.17619/UNIPB/1-376.'
ieee: 'N. Ho, FPGA-based Reconfigurable Cache Mapping Schemes: Design and Optimization.
Universität Paderborn, 2018.'
mla: 'Ho, Nam. FPGA-Based Reconfigurable Cache Mapping Schemes: Design and Optimization.
Universität Paderborn, 2018, doi:10.17619/UNIPB/1-376.'
short: 'N. Ho, FPGA-Based Reconfigurable Cache Mapping Schemes: Design and Optimization,
Universität Paderborn, 2018.'
date_created: 2018-07-27T06:41:13Z
date_updated: 2022-01-06T06:59:31Z
department:
- _id: '78'
doi: 10.17619/UNIPB/1-376
language:
- iso: eng
page: '139'
project:
- _id: '12'
name: SFB 901 - Subproject B4
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
publication_status: published
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Paul
full_name: Kaufmann, Paul
last_name: Kaufmann
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
title: 'FPGA-based Reconfigurable Cache Mapping Schemes: Design and Optimization'
type: dissertation
user_id: '477'
year: '2018'
...
---
_id: '3740'
abstract:
- lang: eng
text: Oblique propagation of semi-guided waves across slab waveguide structures
with bent corners is investigated. A critical angle can be defined beyond which
all radiation losses are suppressed. Additionally an increase of the curvature
radius of the bends also leads to low-loss configurations for incidence angles
below that critical angle. A combination of two bent corner systems represents
a step-like structure, behaving like a Fabry-Perot interferometer, with two partial
reflectors separated by the vertical height between the horizontal slabs. We numerically
analyse typical high-index-contrast Si/SiO2 structures for their reflectance and
transmittance properties. When increasing the curvature radius the resonant effect
becomes less relevant such that full transmittance is reached with less critical
conditions on the vertical distance or the incidence angle. For practical interest
3-D problems are considered, where the structures are excited by the fundamental
mode of a wide, shallow rib waveguide. High transmittance levels can be observed
also for these 3-D configurations depending on the width of the rib.
article_type: letter_note
author:
- first_name: Lena
full_name: Ebers, Lena
id: '40428'
last_name: Ebers
- first_name: Manfred
full_name: Hammer, Manfred
id: '48077'
last_name: Hammer
orcid: 0000-0002-6331-9348
- first_name: Jens
full_name: Förstner, Jens
id: '158'
last_name: Förstner
orcid: 0000-0001-7059-9862
citation:
ama: 'Ebers L, Hammer M, Förstner J. Oblique incidence of semi-guided planar waves
on slab waveguide steps: effects of rounded edges. Optics Express. 2018;26(14):18621-18632.
doi:10.1364/OE.26.018621'
apa: 'Ebers, L., Hammer, M., & Förstner, J. (2018). Oblique incidence of semi-guided
planar waves on slab waveguide steps: effects of rounded edges. Optics Express,
26(14), 18621–18632. https://doi.org/10.1364/OE.26.018621'
bibtex: '@article{Ebers_Hammer_Förstner_2018, title={Oblique incidence of semi-guided
planar waves on slab waveguide steps: effects of rounded edges}, volume={26},
DOI={10.1364/OE.26.018621},
number={14}, journal={Optics Express}, publisher={OSA Publishing}, author={Ebers,
Lena and Hammer, Manfred and Förstner, Jens}, year={2018}, pages={18621–18632}
}'
chicago: 'Ebers, Lena, Manfred Hammer, and Jens Förstner. “Oblique Incidence of
Semi-Guided Planar Waves on Slab Waveguide Steps: Effects of Rounded Edges.” Optics
Express 26, no. 14 (2018): 18621–32. https://doi.org/10.1364/OE.26.018621.'
ieee: 'L. Ebers, M. Hammer, and J. Förstner, “Oblique incidence of semi-guided planar
waves on slab waveguide steps: effects of rounded edges,” Optics Express,
vol. 26, no. 14, pp. 18621–18632, 2018.'
mla: 'Ebers, Lena, et al. “Oblique Incidence of Semi-Guided Planar Waves on Slab
Waveguide Steps: Effects of Rounded Edges.” Optics Express, vol. 26, no.
14, OSA Publishing, 2018, pp. 18621–32, doi:10.1364/OE.26.018621.'
short: L. Ebers, M. Hammer, J. Förstner, Optics Express 26 (2018) 18621–18632.
date_created: 2018-08-01T09:31:03Z
date_updated: 2022-01-06T06:59:33Z
ddc:
- '620'
department:
- _id: '61'
doi: 10.1364/OE.26.018621
file:
- access_level: open_access
content_type: application/pdf
creator: hclaudia
date_created: 2018-08-01T09:30:58Z
date_updated: 2018-08-01T09:30:58Z
file_id: '3741'
file_name: 2018-07 Ebers_Hammer_Förstner_OpticsExpress_Oblique incidence of semi
guided planar waves on slab waveguide steps_Rounded Edges.pdf
file_size: 6193865
relation: main_file
file_date_updated: 2018-08-01T09:30:58Z
has_accepted_license: '1'
intvolume: ' 26'
issue: '14'
keyword:
- tet_topic_waveguide
language:
- iso: eng
oa: '1'
page: 18621-18632
project:
- _id: '56'
name: TRR 142 - Project Area C
- _id: '53'
name: TRR 142
- _id: '75'
name: TRR 142 - Subproject C5
publication: Optics Express
publication_status: published
publisher: OSA Publishing
status: public
title: 'Oblique incidence of semi-guided planar waves on slab waveguide steps: effects
of rounded edges'
type: journal_article
urn: '37409'
user_id: '158'
volume: 26
year: '2018'
...
---
_id: '3804'
author:
- first_name: Khalid
full_name: Al Khatib, Khalid
last_name: Al Khatib
- first_name: Henning
full_name: Wachsmuth, Henning
id: '3900'
last_name: Wachsmuth
- first_name: Kevin
full_name: Lang, Kevin
last_name: Lang
- first_name: Jakob
full_name: Herpel, Jakob
last_name: Herpel
- first_name: Matthias
full_name: Hagen, Matthias
last_name: Hagen
- first_name: Benno
full_name: Stein, Benno
last_name: Stein
citation:
ama: 'Al Khatib K, Wachsmuth H, Lang K, Herpel J, Hagen M, Stein B. Modeling Deliberative
Argumentation Strategies on Wikipedia. In: Proceedings of the 56th Annual Meeting
of the Association for Computational Linguistics (Volume 1: Long Papers).
; 2018:2545-2555.'
apa: 'Al Khatib, K., Wachsmuth, H., Lang, K., Herpel, J., Hagen, M., & Stein,
B. (2018). Modeling Deliberative Argumentation Strategies on Wikipedia. In Proceedings
of the 56th Annual Meeting of the Association for Computational Linguistics (Volume
1: Long Papers) (pp. 2545–2555).'
bibtex: '@inproceedings{Al Khatib_Wachsmuth_Lang_Herpel_Hagen_Stein_2018, title={Modeling
Deliberative Argumentation Strategies on Wikipedia}, booktitle={Proceedings of
the 56th Annual Meeting of the Association for Computational Linguistics (Volume
1: Long Papers)}, author={Al Khatib, Khalid and Wachsmuth, Henning and Lang, Kevin
and Herpel, Jakob and Hagen, Matthias and Stein, Benno}, year={2018}, pages={2545–2555}
}'
chicago: 'Al Khatib, Khalid, Henning Wachsmuth, Kevin Lang, Jakob Herpel, Matthias
Hagen, and Benno Stein. “Modeling Deliberative Argumentation Strategies on Wikipedia.”
In Proceedings of the 56th Annual Meeting of the Association for Computational
Linguistics (Volume 1: Long Papers), 2545–55, 2018.'
ieee: 'K. Al Khatib, H. Wachsmuth, K. Lang, J. Herpel, M. Hagen, and B. Stein, “Modeling
Deliberative Argumentation Strategies on Wikipedia,” in Proceedings of the
56th Annual Meeting of the Association for Computational Linguistics (Volume 1:
Long Papers), 2018, pp. 2545–2555.'
mla: 'Al Khatib, Khalid, et al. “Modeling Deliberative Argumentation Strategies
on Wikipedia.” Proceedings of the 56th Annual Meeting of the Association for
Computational Linguistics (Volume 1: Long Papers), 2018, pp. 2545–55.'
short: 'K. Al Khatib, H. Wachsmuth, K. Lang, J. Herpel, M. Hagen, B. Stein, in:
Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics
(Volume 1: Long Papers), 2018, pp. 2545–2555.'
date_created: 2018-08-02T13:38:27Z
date_updated: 2022-01-06T06:59:36Z
department:
- _id: '568'
- _id: '600'
language:
- iso: eng
main_file_link:
- url: https://www.aclweb.org/anthology/P18-1237.pdf
page: 2545-2555
publication: 'Proceedings of the 56th Annual Meeting of the Association for Computational
Linguistics (Volume 1: Long Papers)'
status: public
title: Modeling Deliberative Argumentation Strategies on Wikipedia
type: conference
user_id: '82920'
year: '2018'
...
---
_id: '3806'
author:
- first_name: Ivan
full_name: Habernal, Ivan
last_name: Habernal
- first_name: Henning
full_name: Wachsmuth, Henning
id: '3900'
last_name: Wachsmuth
- first_name: Iryna
full_name: Gurevych, Iryna
last_name: Gurevych
- first_name: Benno
full_name: Stein, Benno
last_name: Stein
citation:
ama: 'Habernal I, Wachsmuth H, Gurevych I, Stein B. Before Name-Calling: Dynamics
and Triggers of Ad Hominem Fallacies in Web Argumentation. In: Proceedings
of the 2018 Conference of the North American Chapter of the Association for Computational
Linguistics: Human Language Technologies, Volume 1 (Long Papers). ; 2018:386-396.'
apa: 'Habernal, I., Wachsmuth, H., Gurevych, I., & Stein, B. (2018). Before
Name-Calling: Dynamics and Triggers of Ad Hominem Fallacies in Web Argumentation.
In Proceedings of the 2018 Conference of the North American Chapter of the
Association for Computational Linguistics: Human Language Technologies, Volume
1 (Long Papers) (pp. 386–396).'
bibtex: '@inproceedings{Habernal_Wachsmuth_Gurevych_Stein_2018, title={Before Name-Calling:
Dynamics and Triggers of Ad Hominem Fallacies in Web Argumentation}, booktitle={Proceedings
of the 2018 Conference of the North American Chapter of the Association for Computational
Linguistics: Human Language Technologies, Volume 1 (Long Papers)}, author={Habernal,
Ivan and Wachsmuth, Henning and Gurevych, Iryna and Stein, Benno}, year={2018},
pages={386–396} }'
chicago: 'Habernal, Ivan, Henning Wachsmuth, Iryna Gurevych, and Benno Stein. “Before
Name-Calling: Dynamics and Triggers of Ad Hominem Fallacies in Web Argumentation.”
In Proceedings of the 2018 Conference of the North American Chapter of the
Association for Computational Linguistics: Human Language Technologies, Volume
1 (Long Papers), 386–96, 2018.'
ieee: 'I. Habernal, H. Wachsmuth, I. Gurevych, and B. Stein, “Before Name-Calling:
Dynamics and Triggers of Ad Hominem Fallacies in Web Argumentation,” in Proceedings
of the 2018 Conference of the North American Chapter of the Association for Computational
Linguistics: Human Language Technologies, Volume 1 (Long Papers), 2018, pp.
386–396.'
mla: 'Habernal, Ivan, et al. “Before Name-Calling: Dynamics and Triggers of Ad Hominem
Fallacies in Web Argumentation.” Proceedings of the 2018 Conference of the
North American Chapter of the Association for Computational Linguistics: Human
Language Technologies, Volume 1 (Long Papers), 2018, pp. 386–96.'
short: 'I. Habernal, H. Wachsmuth, I. Gurevych, B. Stein, in: Proceedings of the
2018 Conference of the North American Chapter of the Association for Computational
Linguistics: Human Language Technologies, Volume 1 (Long Papers), 2018, pp. 386–396.'
date_created: 2018-08-02T13:38:29Z
date_updated: 2022-01-06T06:59:36Z
department:
- _id: '568'
- _id: '600'
language:
- iso: eng
main_file_link:
- url: https://www.aclweb.org/anthology/N18-1036.pdf
page: 386-396
publication: 'Proceedings of the 2018 Conference of the North American Chapter of
the Association for Computational Linguistics: Human Language Technologies, Volume
1 (Long Papers)'
status: public
title: 'Before Name-Calling: Dynamics and Triggers of Ad Hominem Fallacies in Web
Argumentation'
type: conference
user_id: '82920'
year: '2018'
...
---
_id: '3807'
author:
- first_name: Ivan
full_name: Habernal, Ivan
last_name: Habernal
- first_name: Henning
full_name: Wachsmuth, Henning
id: '3900'
last_name: Wachsmuth
- first_name: Iryna
full_name: Gurevych, Iryna
last_name: Gurevych
- first_name: Benno
full_name: Stein, Benno
last_name: Stein
citation:
ama: 'Habernal I, Wachsmuth H, Gurevych I, Stein B. SemEval-2018 Task 12: The Argument
Reasoning Comprehension Task. In: Proceedings of The 12th International Workshop
on Semantic Evaluation. ; 2018:763-772.'
apa: 'Habernal, I., Wachsmuth, H., Gurevych, I., & Stein, B. (2018). SemEval-2018
Task 12: The Argument Reasoning Comprehension Task. In Proceedings of The 12th
International Workshop on Semantic Evaluation (pp. 763–772).'
bibtex: '@inproceedings{Habernal_Wachsmuth_Gurevych_Stein_2018, title={SemEval-2018
Task 12: The Argument Reasoning Comprehension Task}, booktitle={Proceedings of
The 12th International Workshop on Semantic Evaluation}, author={Habernal, Ivan
and Wachsmuth, Henning and Gurevych, Iryna and Stein, Benno}, year={2018}, pages={763–772}
}'
chicago: 'Habernal, Ivan, Henning Wachsmuth, Iryna Gurevych, and Benno Stein. “SemEval-2018
Task 12: The Argument Reasoning Comprehension Task.” In Proceedings of The
12th International Workshop on Semantic Evaluation, 763–72, 2018.'
ieee: 'I. Habernal, H. Wachsmuth, I. Gurevych, and B. Stein, “SemEval-2018 Task
12: The Argument Reasoning Comprehension Task,” in Proceedings of The 12th
International Workshop on Semantic Evaluation, 2018, pp. 763–772.'
mla: 'Habernal, Ivan, et al. “SemEval-2018 Task 12: The Argument Reasoning Comprehension
Task.” Proceedings of The 12th International Workshop on Semantic Evaluation,
2018, pp. 763–72.'
short: 'I. Habernal, H. Wachsmuth, I. Gurevych, B. Stein, in: Proceedings of The
12th International Workshop on Semantic Evaluation, 2018, pp. 763–772.'
date_created: 2018-08-02T13:38:31Z
date_updated: 2022-01-06T06:59:36Z
department:
- _id: '600'
language:
- iso: eng
main_file_link:
- url: https://www.aclweb.org/anthology/S18-1121.pdf
page: 763-772
publication: Proceedings of The 12th International Workshop on Semantic Evaluation
status: public
title: 'SemEval-2018 Task 12: The Argument Reasoning Comprehension Task'
type: conference
user_id: '82920'
year: '2018'
...
---
_id: '3821'
author:
- first_name: Henning
full_name: Wachsmuth, Henning
id: '3900'
last_name: Wachsmuth
- first_name: Shahbaz
full_name: Syed, Shahbaz
last_name: Syed
- first_name: Benno
full_name: Stein, Benno
last_name: Stein
citation:
ama: 'Wachsmuth H, Syed S, Stein B. Retrieval of the Best Counterargument without
Prior Topic Knowledge. In: Proceedings of the 56th Annual Meeting of the Association
for Computational Linguistics (Volume 1: Long Papers). ; 2018:241-251.'
apa: 'Wachsmuth, H., Syed, S., & Stein, B. (2018). Retrieval of the Best Counterargument
without Prior Topic Knowledge. In Proceedings of the 56th Annual Meeting of
the Association for Computational Linguistics (Volume 1: Long Papers) (pp.
241–251).'
bibtex: '@inproceedings{Wachsmuth_Syed_Stein_2018, title={Retrieval of the Best
Counterargument without Prior Topic Knowledge}, booktitle={Proceedings of the
56th Annual Meeting of the Association for Computational Linguistics (Volume 1:
Long Papers)}, author={Wachsmuth, Henning and Syed, Shahbaz and Stein, Benno},
year={2018}, pages={241–251} }'
chicago: 'Wachsmuth, Henning, Shahbaz Syed, and Benno Stein. “Retrieval of the Best
Counterargument without Prior Topic Knowledge.” In Proceedings of the 56th
Annual Meeting of the Association for Computational Linguistics (Volume 1: Long
Papers), 241–51, 2018.'
ieee: 'H. Wachsmuth, S. Syed, and B. Stein, “Retrieval of the Best Counterargument
without Prior Topic Knowledge,” in Proceedings of the 56th Annual Meeting of
the Association for Computational Linguistics (Volume 1: Long Papers), 2018,
pp. 241–251.'
mla: 'Wachsmuth, Henning, et al. “Retrieval of the Best Counterargument without
Prior Topic Knowledge.” Proceedings of the 56th Annual Meeting of the Association
for Computational Linguistics (Volume 1: Long Papers), 2018, pp. 241–51.'
short: 'H. Wachsmuth, S. Syed, B. Stein, in: Proceedings of the 56th Annual Meeting
of the Association for Computational Linguistics (Volume 1: Long Papers), 2018,
pp. 241–251.'
date_created: 2018-08-02T13:38:50Z
date_updated: 2022-01-06T06:59:37Z
department:
- _id: '568'
- _id: '600'
language:
- iso: eng
main_file_link:
- url: https://www.aclweb.org/anthology/P18-1023.pdf
page: 241-251
publication: 'Proceedings of the 56th Annual Meeting of the Association for Computational
Linguistics (Volume 1: Long Papers)'
status: public
title: Retrieval of the Best Counterargument without Prior Topic Knowledge
type: conference
user_id: '82920'
year: '2018'
...
---
_id: '3851'
author:
- first_name: Samuel
full_name: Koop, Samuel
last_name: Koop
citation:
ama: Koop S. Congestion Games mit gewichteten Strategien. Universität Paderborn;
2018.
apa: Koop, S. (2018). Congestion Games mit gewichteten Strategien. Universität
Paderborn.
bibtex: '@book{Koop_2018, title={Congestion Games mit gewichteten Strategien}, publisher={Universität
Paderborn}, author={Koop, Samuel}, year={2018} }'
chicago: Koop, Samuel. Congestion Games mit gewichteten Strategien. Universität
Paderborn, 2018.
ieee: S. Koop, Congestion Games mit gewichteten Strategien. Universität Paderborn,
2018.
mla: Koop, Samuel. Congestion Games mit gewichteten Strategien. Universität
Paderborn, 2018.
short: S. Koop, Congestion Games mit gewichteten Strategien, Universität Paderborn,
2018.
date_created: 2018-08-08T11:56:37Z
date_updated: 2022-01-06T06:59:45Z
department:
- _id: '541'
- _id: '63'
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '7'
name: SFB 901 - Subproject A3
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Alexander
full_name: Skopalik, Alexander
id: '40384'
last_name: Skopalik
title: Congestion Games mit gewichteten Strategien
type: bachelorsthesis
user_id: '14052'
year: '2018'
...
---
_id: '3852'
abstract:
- lang: eng
text: "In automated machine learning (AutoML), the process of engineering machine
learning applications with respect to a specific problem is (partially) automated.\r\nVarious
AutoML tools have already been introduced to provide out-of-the-box machine learning
functionality.\r\nMore specifically, by selecting machine learning algorithms
and optimizing their hyperparameters, these tools produce a machine learning pipeline
tailored to the problem at hand.\r\nExcept for TPOT, all of these tools restrict
the maximum number of processing steps of such a pipeline.\r\nHowever, as TPOT
follows an evolutionary approach, it suffers from performance issues when dealing
with larger datasets.\r\nIn this paper, we present an alternative approach leveraging
a hierarchical planning to configure machine learning pipelines that are unlimited
in length.\r\nWe evaluate our approach and find its performance to be competitive
with other AutoML tools, including TPOT."
author:
- first_name: Marcel Dominik
full_name: Wever, Marcel Dominik
id: '33176'
last_name: Wever
orcid: ' https://orcid.org/0000-0001-9782-6818'
- first_name: Felix
full_name: Mohr, Felix
last_name: Mohr
- first_name: Eyke
full_name: Hüllermeier, Eyke
id: '48129'
last_name: Hüllermeier
citation:
ama: 'Wever MD, Mohr F, Hüllermeier E. ML-Plan for Unlimited-Length Machine Learning
Pipelines. In: ICML 2018 AutoML Workshop. ; 2018.'
apa: Wever, M. D., Mohr, F., & Hüllermeier, E. (2018). ML-Plan for Unlimited-Length
Machine Learning Pipelines. In ICML 2018 AutoML Workshop. Stockholm, Sweden.
bibtex: '@inproceedings{Wever_Mohr_Hüllermeier_2018, title={ML-Plan for Unlimited-Length
Machine Learning Pipelines}, booktitle={ICML 2018 AutoML Workshop}, author={Wever,
Marcel Dominik and Mohr, Felix and Hüllermeier, Eyke}, year={2018} }'
chicago: Wever, Marcel Dominik, Felix Mohr, and Eyke Hüllermeier. “ML-Plan for Unlimited-Length
Machine Learning Pipelines.” In ICML 2018 AutoML Workshop, 2018.
ieee: M. D. Wever, F. Mohr, and E. Hüllermeier, “ML-Plan for Unlimited-Length Machine
Learning Pipelines,” in ICML 2018 AutoML Workshop, Stockholm, Sweden, 2018.
mla: Wever, Marcel Dominik, et al. “ML-Plan for Unlimited-Length Machine Learning
Pipelines.” ICML 2018 AutoML Workshop, 2018.
short: 'M.D. Wever, F. Mohr, E. Hüllermeier, in: ICML 2018 AutoML Workshop, 2018.'
conference:
end_date: 2018-07-15
location: Stockholm, Sweden
name: ICML 2018 AutoML Workshop
start_date: 2018-07-10
date_created: 2018-08-09T06:14:54Z
date_updated: 2022-01-06T06:59:46Z
ddc:
- '006'
department:
- _id: '355'
file:
- access_level: open_access
content_type: application/pdf
creator: wever
date_created: 2018-08-09T06:14:43Z
date_updated: 2018-08-09T06:14:43Z
file_id: '3853'
file_name: 38.pdf
file_size: 297811
relation: main_file
file_date_updated: 2018-08-09T06:14:43Z
has_accepted_license: '1'
keyword:
- automated machine learning
- complex pipelines
- hierarchical planning
language:
- iso: eng
main_file_link:
- url: https://docs.google.com/viewer?a=v&pid=sites&srcid=ZGVmYXVsdGRvbWFpbnxhdXRvbWwyMDE4aWNtbHxneDo3M2Q3MjUzYjViNDRhZTAx
oa: '1'
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '10'
name: SFB 901 - Subproject B2
publication: ICML 2018 AutoML Workshop
quality_controlled: '1'
status: public
title: ML-Plan for Unlimited-Length Machine Learning Pipelines
type: conference
urn: '38527'
user_id: '49109'
year: '2018'
...
---
_id: '3874'
citation:
ama: Scheideler C, Fineman JT, eds. Proceedings of the 30th on Symposium on Parallelism
in Algorithms and Architectures. ACM; 2018.
apa: 'Scheideler, C., & Fineman, J. T. (Eds.). (2018). Proceedings of the
30th on Symposium on Parallelism in Algorithms and Architectures. Vienna,
Austria: ACM.'
bibtex: '@book{Scheideler_Fineman_2018, title={Proceedings of the 30th on Symposium
on Parallelism in Algorithms and Architectures}, publisher={ACM}, year={2018}
}'
chicago: Scheideler, Christian, and Jeremy T. Fineman, eds. Proceedings of the
30th on Symposium on Parallelism in Algorithms and Architectures. ACM, 2018.
ieee: C. Scheideler and J. T. Fineman, Eds., Proceedings of the 30th on Symposium
on Parallelism in Algorithms and Architectures. ACM, 2018.
mla: Scheideler, Christian, and Jeremy T. Fineman, editors. Proceedings of the
30th on Symposium on Parallelism in Algorithms and Architectures. ACM, 2018.
short: C. Scheideler, J.T. Fineman, eds., Proceedings of the 30th on Symposium on
Parallelism in Algorithms and Architectures, ACM, 2018.
conference:
location: Vienna, Austria
date_created: 2018-08-10T10:03:47Z
date_updated: 2022-01-06T06:59:47Z
department:
- _id: '79'
editor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Jeremy T.
full_name: Fineman, Jeremy T.
last_name: Fineman
publication_identifier:
isbn:
- 978-1-4503-5799-9
publisher: ACM
status: public
title: Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures
type: conference_editor
user_id: '15504'
year: '2018'
...
---
_id: '2965'
author:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
- first_name: Nils
full_name: Löken, Nils
id: '13703'
last_name: Löken
citation:
ama: 'Blömer J, Löken N. Cloud Architectures for Searchable Encryption. In: Proceedings
of the 13th International Conference on Availability, Reliability and Security,
ARES 2018. New York, NY, USA: ACM; :25:1--25:10. doi:10.1145/3230833.3230853'
apa: 'Blömer, J., & Löken, N. (n.d.). Cloud Architectures for Searchable Encryption.
In Proceedings of the 13th International Conference on Availability, Reliability
and Security, ARES 2018 (pp. 25:1--25:10). New York, NY, USA: ACM. https://doi.org/10.1145/3230833.3230853'
bibtex: '@inproceedings{Blömer_Löken, place={New York, NY, USA}, title={Cloud Architectures
for Searchable Encryption}, DOI={10.1145/3230833.3230853},
booktitle={Proceedings of the 13th International Conference on Availability, Reliability
and Security, ARES 2018}, publisher={ACM}, author={Blömer, Johannes and Löken,
Nils}, pages={25:1--25:10} }'
chicago: 'Blömer, Johannes, and Nils Löken. “Cloud Architectures for Searchable
Encryption.” In Proceedings of the 13th International Conference on Availability,
Reliability and Security, ARES 2018, 25:1--25:10. New York, NY, USA: ACM,
n.d. https://doi.org/10.1145/3230833.3230853.'
ieee: J. Blömer and N. Löken, “Cloud Architectures for Searchable Encryption,” in
Proceedings of the 13th International Conference on Availability, Reliability
and Security, ARES 2018, Hamburg, Germany, pp. 25:1--25:10.
mla: Blömer, Johannes, and Nils Löken. “Cloud Architectures for Searchable Encryption.”
Proceedings of the 13th International Conference on Availability, Reliability
and Security, ARES 2018, ACM, pp. 25:1--25:10, doi:10.1145/3230833.3230853.
short: 'J. Blömer, N. Löken, in: Proceedings of the 13th International Conference
on Availability, Reliability and Security, ARES 2018, ACM, New York, NY, USA,
n.d., pp. 25:1--25:10.'
conference:
location: Hamburg, Germany
name: ARES 2018
date_created: 2018-06-04T11:33:15Z
date_updated: 2022-01-06T06:58:49Z
ddc:
- '000'
department:
- _id: '64'
- _id: '568'
doi: 10.1145/3230833.3230853
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T14:39:46Z
date_updated: 2018-11-02T14:39:46Z
file_id: '5278'
file_name: a25-Blomer.pdf
file_size: 769807
relation: main_file
success: 1
file_date_updated: 2018-11-02T14:39:46Z
has_accepted_license: '1'
language:
- iso: eng
page: 25:1--25:10
place: New York, NY, USA
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '13'
name: SFB 901 - Subproject C1
publication: Proceedings of the 13th International Conference on Availability, Reliability
and Security, ARES 2018
publication_identifier:
isbn:
- 978-1-4503-6448-5
publication_status: accepted
publisher: ACM
quality_controlled: '1'
status: public
title: Cloud Architectures for Searchable Encryption
type: conference
user_id: '13703'
year: '2018'
...
---
_id: '3105'
author:
- first_name: David
full_name: Derler, David
last_name: Derler
- first_name: Tibor
full_name: Jager, Tibor
id: '64669'
last_name: Jager
- first_name: Daniel
full_name: Slamanig, Daniel
last_name: Slamanig
- first_name: Christoph
full_name: Striecks, Christoph
last_name: Striecks
citation:
ama: 'Derler D, Jager T, Slamanig D, Striecks C. Bloom Filter Encryption and Applications
to Efficient Forward-Secret 0-RTT Key Exchange. In: Advances in Cryptology
- EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications
of Cryptographic Techniques, Tel Aviv, Israel, April 29 - May 3, 2018 Proceedings,
Part III. ; 2018:425--455. doi:10.1007/978-3-319-78372-7_14'
apa: Derler, D., Jager, T., Slamanig, D., & Striecks, C. (2018). Bloom Filter
Encryption and Applications to Efficient Forward-Secret 0-RTT Key Exchange. In
Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference
on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel,
April 29 - May 3, 2018 Proceedings, Part III (pp. 425--455). https://doi.org/10.1007/978-3-319-78372-7_14
bibtex: '@inproceedings{Derler_Jager_Slamanig_Striecks_2018, title={Bloom Filter
Encryption and Applications to Efficient Forward-Secret 0-RTT Key Exchange}, DOI={10.1007/978-3-319-78372-7_14},
booktitle={Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International
Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv,
Israel, April 29 - May 3, 2018 Proceedings, Part III}, author={Derler, David and
Jager, Tibor and Slamanig, Daniel and Striecks, Christoph}, year={2018}, pages={425--455}
}'
chicago: Derler, David, Tibor Jager, Daniel Slamanig, and Christoph Striecks. “Bloom
Filter Encryption and Applications to Efficient Forward-Secret 0-RTT Key Exchange.”
In Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference
on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel,
April 29 - May 3, 2018 Proceedings, Part III, 425--455, 2018. https://doi.org/10.1007/978-3-319-78372-7_14.
ieee: D. Derler, T. Jager, D. Slamanig, and C. Striecks, “Bloom Filter Encryption
and Applications to Efficient Forward-Secret 0-RTT Key Exchange,” in Advances
in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory
and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29 - May
3, 2018 Proceedings, Part III, 2018, pp. 425--455.
mla: Derler, David, et al. “Bloom Filter Encryption and Applications to Efficient
Forward-Secret 0-RTT Key Exchange.” Advances in Cryptology - EUROCRYPT 2018
- 37th Annual International Conference on the Theory and Applications of Cryptographic
Techniques, Tel Aviv, Israel, April 29 - May 3, 2018 Proceedings, Part III,
2018, pp. 425--455, doi:10.1007/978-3-319-78372-7_14.
short: 'D. Derler, T. Jager, D. Slamanig, C. Striecks, in: Advances in Cryptology
- EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications
of Cryptographic Techniques, Tel Aviv, Israel, April 29 - May 3, 2018 Proceedings,
Part III, 2018, pp. 425--455.'
date_created: 2018-06-07T08:47:17Z
date_updated: 2022-01-06T06:58:56Z
ddc:
- '006'
department:
- _id: '558'
doi: 10.1007/978-3-319-78372-7_14
file:
- access_level: closed
content_type: application/pdf
creator: abirke
date_created: 2018-11-08T13:25:52Z
date_updated: 2018-11-08T13:25:52Z
file_id: '5453'
file_name: 2018-199.pdf
file_size: 533731
relation: main_file
success: 1
file_date_updated: 2018-11-08T13:25:52Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- url: https://eprint.iacr.org/2018/199.pdf
page: 425--455
publication: Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference
on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April
29 - May 3, 2018 Proceedings, Part III
status: public
title: Bloom Filter Encryption and Applications to Efficient Forward-Secret 0-RTT
Key Exchange
type: conference
user_id: '38235'
year: '2018'
...
---
_id: '3152'
abstract:
- lang: eng
text: To adapt to continuously changing workloads in networks, components of the
running network services may need to be replicated (scaling the network service)
and allocated to physical resources (placement) dynamically, also necessitating
dynamic re-routing of flows between service components. In this paper, we propose
JASPER, a fully automated approach to jointly optimizing scaling, placement, and
routing for complex network services, consisting of multiple (virtualized) components.
JASPER handles multiple network services that share the same substrate network;
services can be dynamically added or removed and dynamic workload changes are
handled. Our approach lets service designers specify their services on a high
level of abstraction using service templates. JASPER automatically makes scaling,
placement and routing decisions, enabling quick reaction to changes. We formalize
the problem, analyze its complexity, and develop two algorithms to solve it. Extensive
empirical results show the applicability and effectiveness of the proposed approach.
article_type: original
author:
- first_name: Sevil
full_name: Dräxler, Sevil
id: '31764'
last_name: Dräxler
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
- first_name: Zoltan Adam
full_name: Mann, Zoltan Adam
last_name: Mann
citation:
ama: 'Dräxler S, Karl H, Mann ZA. JASPER: Joint Optimization of Scaling, Placement,
and Routing of Virtual Network Services. IEEE Transactions on Network and Service
Management. 2018. doi:10.1109/TNSM.2018.2846572'
apa: 'Dräxler, S., Karl, H., & Mann, Z. A. (2018). JASPER: Joint Optimization
of Scaling, Placement, and Routing of Virtual Network Services. IEEE Transactions
on Network and Service Management. https://doi.org/10.1109/TNSM.2018.2846572'
bibtex: '@article{Dräxler_Karl_Mann_2018, title={JASPER: Joint Optimization of Scaling,
Placement, and Routing of Virtual Network Services}, DOI={10.1109/TNSM.2018.2846572},
journal={IEEE Transactions on Network and Service Management}, publisher={IEEE},
author={Dräxler, Sevil and Karl, Holger and Mann, Zoltan Adam}, year={2018} }'
chicago: 'Dräxler, Sevil, Holger Karl, and Zoltan Adam Mann. “JASPER: Joint Optimization
of Scaling, Placement, and Routing of Virtual Network Services.” IEEE Transactions
on Network and Service Management, 2018. https://doi.org/10.1109/TNSM.2018.2846572.'
ieee: 'S. Dräxler, H. Karl, and Z. A. Mann, “JASPER: Joint Optimization of Scaling,
Placement, and Routing of Virtual Network Services,” IEEE Transactions on Network
and Service Management, 2018.'
mla: 'Dräxler, Sevil, et al. “JASPER: Joint Optimization of Scaling, Placement,
and Routing of Virtual Network Services.” IEEE Transactions on Network and
Service Management, IEEE, 2018, doi:10.1109/TNSM.2018.2846572.'
short: S. Dräxler, H. Karl, Z.A. Mann, IEEE Transactions on Network and Service
Management (2018).
date_created: 2018-06-11T06:55:05Z
date_updated: 2022-01-06T06:59:00Z
ddc:
- '000'
department:
- _id: '75'
doi: 10.1109/TNSM.2018.2846572
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T15:25:49Z
date_updated: 2018-11-02T15:25:49Z
file_id: '5302'
file_name: 08382313.pdf
file_size: 1767054
relation: main_file
success: 1
- access_level: open_access
content_type: application/pdf
creator: sevilmeh
date_created: 2019-01-21T16:12:36Z
date_updated: 2019-01-21T16:12:36Z
file_id: '6950'
file_name: TNSM2846572_RIS.pdf
file_size: 2878350
relation: main_file
file_date_updated: 2019-01-21T16:12:36Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1711.10839
oa: '1'
project:
- _id: '23'
grant_number: '762057'
name: 5G Programmable Infrastructure Converging disaggregated neTwork and compUte
Resources
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '16'
name: SFB 901 - Subproject C4
publication: IEEE Transactions on Network and Service Management
publisher: IEEE
status: public
title: 'JASPER: Joint Optimization of Scaling, Placement, and Routing of Virtual Network
Services'
type: journal_article
urn: '31522'
user_id: '31764'
year: '2018'
...
---
_id: '3153'
author:
- first_name: Simon
full_name: Doherty, Simon
last_name: Doherty
- first_name: John
full_name: Derrick, John
last_name: Derrick
- first_name: Brijesh
full_name: Dongol, Brijesh
last_name: Dongol
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Doherty S, Derrick J, Dongol B, Wehrheim H. Causal Linearizability: Compositionality
for Partially Ordered Executions. CoRR. 2018.'
apa: 'Doherty, S., Derrick, J., Dongol, B., & Wehrheim, H. (2018). Causal Linearizability:
Compositionality for Partially Ordered Executions. CoRR.'
bibtex: '@article{Doherty_Derrick_Dongol_Wehrheim_2018, title={Causal Linearizability:
Compositionality for Partially Ordered Executions}, journal={CoRR}, author={Doherty,
Simon and Derrick, John and Dongol, Brijesh and Wehrheim, Heike}, year={2018}
}'
chicago: 'Doherty, Simon, John Derrick, Brijesh Dongol, and Heike Wehrheim. “Causal
Linearizability: Compositionality for Partially Ordered Executions.” CoRR,
2018.'
ieee: 'S. Doherty, J. Derrick, B. Dongol, and H. Wehrheim, “Causal Linearizability:
Compositionality for Partially Ordered Executions,” CoRR, 2018.'
mla: 'Doherty, Simon, et al. “Causal Linearizability: Compositionality for Partially
Ordered Executions.” CoRR, 2018.'
short: S. Doherty, J. Derrick, B. Dongol, H. Wehrheim, CoRR (2018).
date_created: 2018-06-13T07:26:35Z
date_updated: 2022-01-06T06:59:00Z
department:
- _id: '77'
publication: CoRR
status: public
title: 'Causal Linearizability: Compositionality for Partially Ordered Executions'
type: journal_article
user_id: '29719'
year: '2018'
...
---
_id: '2711'
abstract:
- lang: eng
text: "In recent years, researchers have developed a number of tools to conduct\r\ntaint
analysis of Android applications. While all the respective papers aim at\r\nproviding
a thorough empirical evaluation, comparability is hindered by varying\r\nor unclear
evaluation targets. Sometimes, the apps used for evaluation are not\r\nprecisely
described. In other cases, authors use an established benchmark but\r\ncover it
only partially. In yet other cases, the evaluations differ in terms of\r\nthe
data leaks searched for, or lack a ground truth to compare against. All\r\nthose
limitations make it impossible to truly compare the tools based on those\r\npublished
evaluations.\r\n We thus present ReproDroid, a framework allowing the accurate
comparison of\r\nAndroid taint analysis tools. ReproDroid supports researchers
in inferring the\r\nground truth for data leaks in apps, in automatically applying
tools to\r\nbenchmarks, and in evaluating the obtained results. We use ReproDroid
to\r\ncomparatively evaluate on equal grounds the six prominent taint analysis
tools\r\nAmandroid, DIALDroid, DidFail, DroidSafe, FlowDroid and IccTA. The results
are\r\nlargely positive although four tools violate some promises concerning features\r\nand
accuracy. Finally, we contribute to the area of unbiased benchmarking with\r\na
new and improved version of the open test suite DroidBench."
author:
- first_name: Felix
full_name: Pauck, Felix
id: '22398'
last_name: Pauck
- first_name: Eric
full_name: Bodden, Eric
id: '59256'
last_name: Bodden
orcid: 0000-0003-3470-3647
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: Pauck F, Bodden E, Wehrheim H. Do Android Taint Analysis Tools Keep their Promises?
arXiv:180402903. 2018.
apa: Pauck, F., Bodden, E., & Wehrheim, H. (2018). Do Android Taint Analysis
Tools Keep their Promises? ArXiv:1804.02903.
bibtex: '@article{Pauck_Bodden_Wehrheim_2018, title={Do Android Taint Analysis Tools
Keep their Promises?}, journal={arXiv:1804.02903}, author={Pauck, Felix and Bodden,
Eric and Wehrheim, Heike}, year={2018} }'
chicago: Pauck, Felix, Eric Bodden, and Heike Wehrheim. “Do Android Taint Analysis
Tools Keep Their Promises?” ArXiv:1804.02903, 2018.
ieee: F. Pauck, E. Bodden, and H. Wehrheim, “Do Android Taint Analysis Tools Keep
their Promises?,” arXiv:1804.02903. 2018.
mla: Pauck, Felix, et al. “Do Android Taint Analysis Tools Keep Their Promises?”
ArXiv:1804.02903, 2018.
short: F. Pauck, E. Bodden, H. Wehrheim, ArXiv:1804.02903 (2018).
date_created: 2018-05-09T08:27:11Z
date_updated: 2022-01-06T06:57:35Z
ddc:
- '000'
department:
- _id: '77'
- _id: '76'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-11-21T10:49:23Z
date_updated: 2018-11-21T10:49:23Z
file_id: '5781'
file_name: Do Android Taint Analysis Tools Keep their Promises.pdf
file_size: 1045861
relation: main_file
success: 1
file_date_updated: 2018-11-21T10:49:23Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '12'
name: SFB 901 - Subproject B4
publication: arXiv:1804.02903
status: public
title: Do Android Taint Analysis Tools Keep their Promises?
type: preprint
user_id: '477'
year: '2018'
...
---
_id: '1138'
author:
- first_name: Robert
full_name: Gmyr, Robert
last_name: Gmyr
citation:
ama: Gmyr R. Distributed Algorithms for Overlay Networks and Programmable Matter.
Universität Paderborn; 2018. doi:10.17619/UNIPB/1-265
apa: Gmyr, R. (2018). Distributed Algorithms for Overlay Networks and Programmable
Matter. Universität Paderborn. https://doi.org/10.17619/UNIPB/1-265
bibtex: '@book{Gmyr_2018, title={Distributed Algorithms for Overlay Networks and
Programmable Matter}, DOI={10.17619/UNIPB/1-265},
publisher={Universität Paderborn}, author={Gmyr, Robert}, year={2018} }'
chicago: Gmyr, Robert. Distributed Algorithms for Overlay Networks and Programmable
Matter. Universität Paderborn, 2018. https://doi.org/10.17619/UNIPB/1-265.
ieee: R. Gmyr, Distributed Algorithms for Overlay Networks and Programmable Matter.
Universität Paderborn, 2018.
mla: Gmyr, Robert. Distributed Algorithms for Overlay Networks and Programmable
Matter. Universität Paderborn, 2018, doi:10.17619/UNIPB/1-265.
short: R. Gmyr, Distributed Algorithms for Overlay Networks and Programmable Matter,
Universität Paderborn, 2018.
date_created: 2018-01-31T06:04:03Z
date_updated: 2022-01-06T06:51:00Z
department:
- _id: '79'
doi: 10.17619/UNIPB/1-265
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subproject C1
- _id: '2'
name: SFB 901 - Project Area A
- _id: '4'
name: SFB 901 - Project Area C
- _id: '5'
name: SFB 901 - Subproject A1
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: Distributed Algorithms for Overlay Networks and Programmable Matter
type: dissertation
user_id: '477'
year: '2018'
...
---
_id: '1163'
abstract:
- lang: eng
text: "In this paper we present two major results:\r\nFirst, we introduce the first
self-stabilizing version of a supervised overlay network (as introduced in~\\cite{DBLP:conf/ispan/KothapalliS05})
by presenting a self-stabilizing supervised skip ring.\r\nSecondly, we show how
to use the self-stabilizing supervised skip ring to construct an efficient self-stabilizing
publish-subscribe system.\r\nThat is, in addition to stabilizing the overlay network,
every subscriber of a topic will eventually know all of the publications that
have been issued so far for that topic. The communication work needed to processes
a subscribe or unsubscribe operation is just a constant in a legitimate state,
and the communication work of checking whether the system is still in a legitimate
state is just a constant on expectation for the supervisor as well as any process
in the system.\r\n"
author:
- first_name: Michael
full_name: Feldmann, Michael
id: '23538'
last_name: Feldmann
- first_name: Christina
full_name: Kolb, Christina
id: '43647'
last_name: Kolb
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Thim Frederik
full_name: Strothmann, Thim Frederik
id: '11319'
last_name: Strothmann
citation:
ama: 'Feldmann M, Kolb C, Scheideler C, Strothmann TF. Self-Stabilizing Supervised
Publish-Subscribe Systems. In: Proceedings of the 32nd IEEE International Parallel
& Distributed Processing Symposium (IPDPS). IEEE; 2018. doi:10.1109/IPDPS.2018.00114'
apa: 'Feldmann, M., Kolb, C., Scheideler, C., & Strothmann, T. F. (2018). Self-Stabilizing
Supervised Publish-Subscribe Systems. In Proceedings of the 32nd IEEE International
Parallel & Distributed Processing Symposium (IPDPS). Vancouver: IEEE.
https://doi.org/10.1109/IPDPS.2018.00114'
bibtex: '@inproceedings{Feldmann_Kolb_Scheideler_Strothmann_2018, title={Self-Stabilizing
Supervised Publish-Subscribe Systems}, DOI={10.1109/IPDPS.2018.00114},
booktitle={Proceedings of the 32nd IEEE International Parallel & Distributed
Processing Symposium (IPDPS)}, publisher={IEEE}, author={Feldmann, Michael and
Kolb, Christina and Scheideler, Christian and Strothmann, Thim Frederik}, year={2018}
}'
chicago: Feldmann, Michael, Christina Kolb, Christian Scheideler, and Thim Frederik
Strothmann. “Self-Stabilizing Supervised Publish-Subscribe Systems.” In Proceedings
of the 32nd IEEE International Parallel & Distributed Processing Symposium
(IPDPS). IEEE, 2018. https://doi.org/10.1109/IPDPS.2018.00114.
ieee: M. Feldmann, C. Kolb, C. Scheideler, and T. F. Strothmann, “Self-Stabilizing
Supervised Publish-Subscribe Systems,” in Proceedings of the 32nd IEEE International
Parallel & Distributed Processing Symposium (IPDPS), Vancouver, 2018.
mla: Feldmann, Michael, et al. “Self-Stabilizing Supervised Publish-Subscribe Systems.”
Proceedings of the 32nd IEEE International Parallel & Distributed Processing
Symposium (IPDPS), IEEE, 2018, doi:10.1109/IPDPS.2018.00114.
short: 'M. Feldmann, C. Kolb, C. Scheideler, T.F. Strothmann, in: Proceedings of
the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS),
IEEE, 2018.'
conference:
end_date: 2018-5-24
location: Vancouver
name: 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS)
start_date: 2018-5-22
date_created: 2018-02-01T13:56:01Z
date_updated: 2022-01-06T06:51:05Z
ddc:
- '040'
department:
- _id: '79'
- _id: '66'
doi: 10.1109/IPDPS.2018.00114
external_id:
arxiv:
- '1710.08128'
file:
- access_level: closed
content_type: application/pdf
creator: mfeldma2
date_created: 2018-10-31T13:25:37Z
date_updated: 2018-10-31T13:25:37Z
file_id: '5211'
file_name: 08425258.pdf
file_size: 239559
relation: main_file
success: 1
file_date_updated: 2018-10-31T13:25:37Z
has_accepted_license: '1'
keyword:
- Topological Self-stabilization
- Supervised Overlay
- Publish-Subscribe System
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
publication: Proceedings of the 32nd IEEE International Parallel & Distributed Processing
Symposium (IPDPS)
publisher: IEEE
status: public
title: Self-Stabilizing Supervised Publish-Subscribe Systems
type: conference
user_id: '11319'
year: '2018'
...
---
_id: '1164'
abstract:
- lang: eng
text: "We propose a distributed protocol for a queue, called Skueue, which spreads
its data fairly onto multiple processes, avoiding bottlenecks in high throughput
scenarios.\r\nSkueuecan be used in highly dynamic environments, through the addition
of join and leave requests to the standard queue operations enqueue and dequeue.\r\nFurthermore
Skueue satisfies sequential consistency in the asynchronous message passing model.\r\nScalability
is achieved by aggregating multiple requests to a batch, which can then be processed
in a distributed fashion without hurting the queue semantics.\r\nOperations in
Skueue need a logarithmic number of rounds w.h.p. until they are processed, even
under a high rate of incoming requests."
author:
- first_name: Michael
full_name: Feldmann, Michael
id: '23538'
last_name: Feldmann
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Alexander
full_name: Setzer, Alexander
id: '11108'
last_name: Setzer
citation:
ama: 'Feldmann M, Scheideler C, Setzer A. Skueue: A Scalable and Sequentially Consistent
Distributed Queue. In: Proceedings of the 32nd IEEE International Parallel
& Distributed Processing Symposium (IPDPS). IEEE; 2018. doi:10.1109/IPDPS.2018.00113'
apa: 'Feldmann, M., Scheideler, C., & Setzer, A. (2018). Skueue: A Scalable
and Sequentially Consistent Distributed Queue. In Proceedings of the 32nd IEEE
International Parallel & Distributed Processing Symposium (IPDPS). Vancouver:
IEEE. https://doi.org/10.1109/IPDPS.2018.00113'
bibtex: '@inproceedings{Feldmann_Scheideler_Setzer_2018, title={Skueue: A Scalable
and Sequentially Consistent Distributed Queue}, DOI={10.1109/IPDPS.2018.00113},
booktitle={Proceedings of the 32nd IEEE International Parallel & Distributed
Processing Symposium (IPDPS)}, publisher={IEEE}, author={Feldmann, Michael and
Scheideler, Christian and Setzer, Alexander}, year={2018} }'
chicago: 'Feldmann, Michael, Christian Scheideler, and Alexander Setzer. “Skueue:
A Scalable and Sequentially Consistent Distributed Queue.” In Proceedings of
the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS).
IEEE, 2018. https://doi.org/10.1109/IPDPS.2018.00113.'
ieee: 'M. Feldmann, C. Scheideler, and A. Setzer, “Skueue: A Scalable and Sequentially
Consistent Distributed Queue,” in Proceedings of the 32nd IEEE International
Parallel & Distributed Processing Symposium (IPDPS), Vancouver, 2018.'
mla: 'Feldmann, Michael, et al. “Skueue: A Scalable and Sequentially Consistent
Distributed Queue.” Proceedings of the 32nd IEEE International Parallel &
Distributed Processing Symposium (IPDPS), IEEE, 2018, doi:10.1109/IPDPS.2018.00113.'
short: 'M. Feldmann, C. Scheideler, A. Setzer, in: Proceedings of the 32nd IEEE
International Parallel & Distributed Processing Symposium (IPDPS), IEEE, 2018.'
conference:
end_date: 2018-5-24
location: Vancouver
name: 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS)
start_date: 2018-5-22
date_created: 2018-02-01T14:00:36Z
date_updated: 2022-01-06T06:51:05Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1109/IPDPS.2018.00113
external_id:
arxiv:
- '1802.07504'
file:
- access_level: closed
content_type: application/pdf
creator: mfeldma2
date_created: 2018-10-31T13:29:26Z
date_updated: 2018-10-31T13:29:26Z
file_id: '5212'
file_name: 08425257.pdf
file_size: 218420
relation: main_file
success: 1
file_date_updated: 2018-10-31T13:29:26Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
publication: Proceedings of the 32nd IEEE International Parallel & Distributed Processing
Symposium (IPDPS)
publisher: IEEE
status: public
title: 'Skueue: A Scalable and Sequentially Consistent Distributed Queue'
type: conference
user_id: '23538'
year: '2018'
...
---
_id: '1165'
author:
- first_name: Linus Matthias
full_name: Witschen, Linus Matthias
id: '49051'
last_name: Witschen
- first_name: Tobias
full_name: Wiersema, Tobias
id: '3118'
last_name: Wiersema
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
citation:
ama: Witschen LM, Wiersema T, Platzner M. Making the Case for Proof-carrying Approximate
Circuits. 4th Workshop On Approximate Computing (WAPCO 2018). 2018.
apa: Witschen, L. M., Wiersema, T., & Platzner, M. (2018). Making the Case for
Proof-carrying Approximate Circuits. 4th Workshop On Approximate Computing
(WAPCO 2018).
bibtex: '@article{Witschen_Wiersema_Platzner_2018, title={Making the Case for Proof-carrying
Approximate Circuits}, journal={4th Workshop On Approximate Computing (WAPCO 2018)},
author={Witschen, Linus Matthias and Wiersema, Tobias and Platzner, Marco}, year={2018}
}'
chicago: Witschen, Linus Matthias, Tobias Wiersema, and Marco Platzner. “Making
the Case for Proof-Carrying Approximate Circuits.” 4th Workshop On Approximate
Computing (WAPCO 2018), 2018.
ieee: L. M. Witschen, T. Wiersema, and M. Platzner, “Making the Case for Proof-carrying
Approximate Circuits,” 4th Workshop On Approximate Computing (WAPCO 2018).
2018.
mla: Witschen, Linus Matthias, et al. “Making the Case for Proof-Carrying Approximate
Circuits.” 4th Workshop On Approximate Computing (WAPCO 2018), 2018.
short: L.M. Witschen, T. Wiersema, M. Platzner, 4th Workshop On Approximate Computing
(WAPCO 2018) (2018).
date_created: 2018-02-01T14:24:54Z
date_updated: 2022-01-06T06:51:06Z
ddc:
- '000'
department:
- _id: '7'
- _id: '34'
- _id: '78'
file:
- access_level: closed
content_type: application/pdf
creator: tobias82
date_created: 2018-11-26T08:00:53Z
date_updated: 2018-11-26T08:00:53Z
file_id: '5821'
file_name: WitschenWP2018[1].pdf
file_size: 287224
relation: main_file
success: 1
file_date_updated: 2018-11-26T08:00:53Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '12'
name: SFB 901 - Subproject B4
- _id: '52'
name: Computing Resources Provided by the Paderborn Center for Parallel Computing
publication: 4th Workshop On Approximate Computing (WAPCO 2018)
status: public
title: Making the Case for Proof-carrying Approximate Circuits
type: preprint
user_id: '49051'
year: '2018'
...
---
_id: '2109'
abstract:
- lang: eng
text: In multinomial classification, reduction techniques are commonly used to decompose
the original learning problem into several simpler problems. For example, by recursively
bisecting the original set of classes, so-called nested dichotomies define a set
of binary classification problems that are organized in the structure of a binary
tree. In contrast to the existing one-shot heuristics for constructing nested
dichotomies and motivated by recent work on algorithm configuration, we propose
a genetic algorithm for optimizing the structure of such dichotomies. A key component
of this approach is the proposed genetic representation that facilitates the application
of standard genetic operators, while still supporting the exchange of partial
solutions under recombination. We evaluate the approach in an extensive experimental
study, showing that it yields classifiers with superior generalization performance.
author:
- first_name: Marcel Dominik
full_name: Wever, Marcel Dominik
id: '33176'
last_name: Wever
orcid: ' https://orcid.org/0000-0001-9782-6818'
- first_name: Felix
full_name: Mohr, Felix
last_name: Mohr
- first_name: Eyke
full_name: Hüllermeier, Eyke
id: '48129'
last_name: Hüllermeier
citation:
ama: 'Wever MD, Mohr F, Hüllermeier E. Ensembles of Evolved Nested Dichotomies for
Classification. In: Proceedings of the Genetic and Evolutionary Computation
Conference, GECCO 2018, Kyoto, Japan, July 15-19, 2018. Kyoto, Japan: ACM;
2018. doi:10.1145/3205455.3205562'
apa: 'Wever, M. D., Mohr, F., & Hüllermeier, E. (2018). Ensembles of Evolved
Nested Dichotomies for Classification. In Proceedings of the Genetic and Evolutionary
Computation Conference, GECCO 2018, Kyoto, Japan, July 15-19, 2018. Kyoto,
Japan: ACM. https://doi.org/10.1145/3205455.3205562'
bibtex: '@inproceedings{Wever_Mohr_Hüllermeier_2018, place={Kyoto, Japan}, title={Ensembles
of Evolved Nested Dichotomies for Classification}, DOI={10.1145/3205455.3205562},
booktitle={Proceedings of the Genetic and Evolutionary Computation Conference,
GECCO 2018, Kyoto, Japan, July 15-19, 2018}, publisher={ACM}, author={Wever, Marcel
Dominik and Mohr, Felix and Hüllermeier, Eyke}, year={2018} }'
chicago: 'Wever, Marcel Dominik, Felix Mohr, and Eyke Hüllermeier. “Ensembles of
Evolved Nested Dichotomies for Classification.” In Proceedings of the Genetic
and Evolutionary Computation Conference, GECCO 2018, Kyoto, Japan, July 15-19,
2018. Kyoto, Japan: ACM, 2018. https://doi.org/10.1145/3205455.3205562.'
ieee: M. D. Wever, F. Mohr, and E. Hüllermeier, “Ensembles of Evolved Nested Dichotomies
for Classification,” in Proceedings of the Genetic and Evolutionary Computation
Conference, GECCO 2018, Kyoto, Japan, July 15-19, 2018, Kyoto, Japan, 2018.
mla: Wever, Marcel Dominik, et al. “Ensembles of Evolved Nested Dichotomies for
Classification.” Proceedings of the Genetic and Evolutionary Computation Conference,
GECCO 2018, Kyoto, Japan, July 15-19, 2018, ACM, 2018, doi:10.1145/3205455.3205562.
short: 'M.D. Wever, F. Mohr, E. Hüllermeier, in: Proceedings of the Genetic and
Evolutionary Computation Conference, GECCO 2018, Kyoto, Japan, July 15-19, 2018,
ACM, Kyoto, Japan, 2018.'
conference:
end_date: 2018-07-19
location: Kyoto, Japan
name: GECCO 2018
start_date: 2018-07-15
date_created: 2018-03-31T13:51:23Z
date_updated: 2022-01-06T06:54:45Z
ddc:
- '000'
department:
- _id: '355'
doi: 10.1145/3205455.3205562
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T14:33:54Z
date_updated: 2018-11-02T14:33:54Z
file_id: '5275'
file_name: p561-wever.pdf
file_size: 875404
relation: main_file
success: 1
file_date_updated: 2018-11-02T14:33:54Z
has_accepted_license: '1'
keyword:
- Classification
- Hierarchical Decomposition
- Indirect Encoding
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://dl.acm.org/citation.cfm?doid=3205455.3205562
oa: '1'
place: Kyoto, Japan
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '10'
name: SFB 901 - Subproject B2
- _id: '52'
name: Computing Resources Provided by the Paderborn Center for Parallel Computing
publication: Proceedings of the Genetic and Evolutionary Computation Conference, GECCO
2018, Kyoto, Japan, July 15-19, 2018
publication_status: published
publisher: ACM
status: public
title: Ensembles of Evolved Nested Dichotomies for Classification
type: conference
user_id: '33176'
year: '2018'
...