---
_id: '3551'
author:
- first_name: Jürgen
full_name: König, Jürgen
id: '22358'
last_name: König
- first_name: Alexander
full_name: Mäcker, Alexander
id: '13536'
last_name: Mäcker
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Sören
full_name: Riechers, Sören
last_name: Riechers
citation:
ama: König J, Mäcker A, Meyer auf der Heide F, Riechers S. Scheduling with interjob
communication on parallel processors. Journal of Combinatorial Optimization.
2018;36(4):1356-1379. doi:10.1007/s10878-018-0325-3
apa: König, J., Mäcker, A., Meyer auf der Heide, F., & Riechers, S. (2018).
Scheduling with interjob communication on parallel processors. Journal of Combinatorial
Optimization, 36(4), 1356–1379. https://doi.org/10.1007/s10878-018-0325-3
bibtex: '@article{König_Mäcker_Meyer auf der Heide_Riechers_2018, title={Scheduling
with interjob communication on parallel processors}, volume={36}, DOI={10.1007/s10878-018-0325-3},
number={4}, journal={Journal of Combinatorial Optimization}, author={König, Jürgen
and Mäcker, Alexander and Meyer auf der Heide, Friedhelm and Riechers, Sören},
year={2018}, pages={1356–1379} }'
chicago: 'König, Jürgen, Alexander Mäcker, Friedhelm Meyer auf der Heide, and Sören
Riechers. “Scheduling with Interjob Communication on Parallel Processors.” Journal
of Combinatorial Optimization 36, no. 4 (2018): 1356–79. https://doi.org/10.1007/s10878-018-0325-3.'
ieee: J. König, A. Mäcker, F. Meyer auf der Heide, and S. Riechers, “Scheduling
with interjob communication on parallel processors,” Journal of Combinatorial
Optimization, vol. 36, no. 4, pp. 1356–1379, 2018.
mla: König, Jürgen, et al. “Scheduling with Interjob Communication on Parallel Processors.”
Journal of Combinatorial Optimization, vol. 36, no. 4, 2018, pp. 1356–79,
doi:10.1007/s10878-018-0325-3.
short: J. König, A. Mäcker, F. Meyer auf der Heide, S. Riechers, Journal of Combinatorial
Optimization 36 (2018) 1356–1379.
date_created: 2018-07-13T09:57:48Z
date_updated: 2022-01-06T06:59:24Z
ddc:
- '000'
department:
- _id: '63'
doi: 10.1007/s10878-018-0325-3
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T15:20:24Z
date_updated: 2018-11-02T15:20:24Z
file_id: '5299'
file_name: SchedulingWithInterjobCommunic.pdf
file_size: 745708
relation: main_file
success: 1
file_date_updated: 2018-11-02T15:20:24Z
has_accepted_license: '1'
intvolume: ' 36'
issue: '4'
language:
- iso: eng
page: 1356-1379
project:
- _id: '16'
name: SFB 901 - Subproject C4
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
publication: Journal of Combinatorial Optimization
status: public
title: Scheduling with interjob communication on parallel processors
type: journal_article
user_id: '477'
volume: 36
year: '2018'
...
---
_id: '3552'
author:
- first_name: Felix
full_name: Mohr, Felix
last_name: Mohr
- first_name: Marcel Dominik
full_name: Wever, Marcel Dominik
id: '33176'
last_name: Wever
orcid: ' https://orcid.org/0000-0001-9782-6818'
- first_name: Eyke
full_name: Hüllermeier, Eyke
id: '48129'
last_name: Hüllermeier
citation:
ama: 'Mohr F, Wever MD, Hüllermeier E. Reduction Stumps for Multi-Class Classification.
In: Proceedings of the Symposium on Intelligent Data Analysis. ‘s-Hertogenbosch,
the Netherlands. doi:10.1007/978-3-030-01768-2_19'
apa: Mohr, F., Wever, M. D., & Hüllermeier, E. (n.d.). Reduction Stumps for
Multi-Class Classification. In Proceedings of the Symposium on Intelligent
Data Analysis. ‘s-Hertogenbosch, the Netherlands. https://doi.org/10.1007/978-3-030-01768-2_19
bibtex: '@inproceedings{Mohr_Wever_Hüllermeier, place={‘s-Hertogenbosch, the Netherlands},
title={Reduction Stumps for Multi-Class Classification}, DOI={10.1007/978-3-030-01768-2_19},
booktitle={Proceedings of the Symposium on Intelligent Data Analysis}, author={Mohr,
Felix and Wever, Marcel Dominik and Hüllermeier, Eyke} }'
chicago: Mohr, Felix, Marcel Dominik Wever, and Eyke Hüllermeier. “Reduction Stumps
for Multi-Class Classification.” In Proceedings of the Symposium on Intelligent
Data Analysis. ‘s-Hertogenbosch, the Netherlands, n.d. https://doi.org/10.1007/978-3-030-01768-2_19.
ieee: F. Mohr, M. D. Wever, and E. Hüllermeier, “Reduction Stumps for Multi-Class
Classification,” in Proceedings of the Symposium on Intelligent Data Analysis,
‘s-Hertogenbosch, the Netherlands.
mla: Mohr, Felix, et al. “Reduction Stumps for Multi-Class Classification.” Proceedings
of the Symposium on Intelligent Data Analysis, doi:10.1007/978-3-030-01768-2_19.
short: 'F. Mohr, M.D. Wever, E. Hüllermeier, in: Proceedings of the Symposium on
Intelligent Data Analysis, ‘s-Hertogenbosch, the Netherlands, n.d.'
conference:
end_date: 2018-10-26
location: ‘s-Hertogenbosch, the Netherlands
name: Symposium on Intelligent Data Analysis
start_date: 2018-10-24
date_created: 2018-07-13T15:29:15Z
date_updated: 2022-01-06T06:59:25Z
ddc:
- '000'
department:
- _id: '355'
doi: 10.1007/978-3-030-01768-2_19
file:
- access_level: closed
content_type: application/pdf
creator: wever
date_created: 2018-11-06T15:23:02Z
date_updated: 2018-11-06T15:23:02Z
file_id: '5385'
file_name: Mohr2018_Chapter_ReductionStumpsForMulti-classC.pdf
file_size: 1348768
relation: main_file
success: 1
file_date_updated: 2018-11-06T15:23:02Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://link.springer.com/chapter/10.1007%2F978-3-030-01768-2_19
oa: '1'
place: ‘s-Hertogenbosch, the Netherlands
project:
- _id: '1'
name: SFB 901
- _id: '10'
name: SFB 901 - Subproject B2
- _id: '3'
name: SFB 901 - Project Area B
publication: Proceedings of the Symposium on Intelligent Data Analysis
publication_status: accepted
quality_controlled: '1'
status: public
title: Reduction Stumps for Multi-Class Classification
type: conference
user_id: '49109'
year: '2018'
...
---
_id: '3586'
abstract:
- lang: eng
text: Existing approaches and tools for the generation of approximate circuits often
lack generality and are restricted to certain circuit types, approximation techniques,
and quality assurance methods. Moreover, only few tools are publicly available.
This hinders the development and evaluation of new techniques for approximating
circuits and their comparison to previous approaches. In this paper, we first analyze
and classify related approaches and then present CIRCA, our flexible framework
for search-based approximate circuit generation. CIRCA is developed with a focus
on modularity and extensibility. We present the architecture of CIRCA with its
clear separation into stages and functional blocks, report on the current prototype,
and show initial experiments.
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: Hassan
full_name: Ghasemzadeh Mohammadi, Hassan
id: '61186'
last_name: Ghasemzadeh Mohammadi
- first_name: Muhammad
full_name: Awais, Muhammad
id: '64665'
last_name: Awais
orcid: https://orcid.org/0000-0003-4148-2969
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
citation:
ama: 'Witschen LM, Wiersema T, Ghasemzadeh Mohammadi H, Awais M, Platzner M. CIRCA:
Towards a Modular and Extensible Framework for Approximate Circuit Generation.
Third Workshop on Approximate Computing (AxC 2018).'
apa: 'Witschen, L. M., Wiersema, T., Ghasemzadeh Mohammadi, H., Awais, M., &
Platzner, M. (n.d.). CIRCA: Towards a Modular and Extensible Framework for Approximate
Circuit Generation. Third Workshop on Approximate Computing (AxC 2018).'
bibtex: '@article{Witschen_Wiersema_Ghasemzadeh Mohammadi_Awais_Platzner, title={CIRCA:
Towards a Modular and Extensible Framework for Approximate Circuit Generation},
journal={Third Workshop on Approximate Computing (AxC 2018)}, author={Witschen,
Linus Matthias and Wiersema, Tobias and Ghasemzadeh Mohammadi, Hassan and Awais,
Muhammad and Platzner, Marco} }'
chicago: 'Witschen, Linus Matthias, Tobias Wiersema, Hassan Ghasemzadeh Mohammadi,
Muhammad Awais, and Marco Platzner. “CIRCA: Towards a Modular and Extensible Framework
for Approximate Circuit Generation.” Third Workshop on Approximate Computing
(AxC 2018), n.d.'
ieee: 'L. M. Witschen, T. Wiersema, H. Ghasemzadeh Mohammadi, M. Awais, and M. Platzner,
“CIRCA: Towards a Modular and Extensible Framework for Approximate Circuit Generation,”
Third Workshop on Approximate Computing (AxC 2018). .'
mla: 'Witschen, Linus Matthias, et al. “CIRCA: Towards a Modular and Extensible
Framework for Approximate Circuit Generation.” Third Workshop on Approximate
Computing (AxC 2018).'
short: L.M. Witschen, T. Wiersema, H. Ghasemzadeh Mohammadi, M. Awais, M. Platzner,
Third Workshop on Approximate Computing (AxC 2018) (n.d.).
date_created: 2018-07-20T14:10:46Z
date_updated: 2022-01-06T06:59:26Z
ddc:
- '000'
department:
- _id: '78'
file:
- access_level: closed
content_type: application/pdf
creator: tobias82
date_created: 2018-07-20T14:13:31Z
date_updated: 2018-07-20T14:13:31Z
file_id: '3587'
file_name: WitschenWMAP2018.pdf
file_size: 285348
relation: main_file
success: 1
file_date_updated: 2018-07-20T14:13:31Z
has_accepted_license: '1'
keyword:
- Approximate Computing
- Framework
- Pareto Front
- Accuracy
language:
- iso: eng
page: '6'
project:
- _id: '12'
name: SFB 901 - Subproject B4
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '52'
name: Computing Resources Provided by the Paderborn Center for Parallel Computing
publication: Third Workshop on Approximate Computing (AxC 2018)
publication_status: accepted
status: public
title: 'CIRCA: Towards a Modular and Extensible Framework for Approximate Circuit
Generation'
type: preprint
user_id: '49051'
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: '3742'
author:
- first_name: Simon
full_name: Hoof, Simon
id: '59676'
last_name: Hoof
citation:
ama: 'Hoof S. Dynamic Voluntary Provision of Public Goods: The Recursive Nash Bargaining
Solution. In: Static & Dynamic Game Theory: Foundations & Applications.
Cham: Springer International Publishing; 2018:13-23. doi:10.1007/978-3-319-92988-0_2'
apa: 'Hoof, S. (2018). Dynamic Voluntary Provision of Public Goods: The Recursive
Nash Bargaining Solution. In Static & Dynamic Game Theory: Foundations
& Applications (pp. 13–23). Cham: Springer International Publishing. https://doi.org/10.1007/978-3-319-92988-0_2'
bibtex: '@inbook{Hoof_2018, place={Cham}, title={Dynamic Voluntary Provision of
Public Goods: The Recursive Nash Bargaining Solution}, DOI={10.1007/978-3-319-92988-0_2},
booktitle={Static & Dynamic Game Theory: Foundations & Applications},
publisher={Springer International Publishing}, author={Hoof, Simon}, year={2018},
pages={13–23} }'
chicago: 'Hoof, Simon. “Dynamic Voluntary Provision of Public Goods: The Recursive
Nash Bargaining Solution.” In Static & Dynamic Game Theory: Foundations
& Applications, 13–23. Cham: Springer International Publishing, 2018.
https://doi.org/10.1007/978-3-319-92988-0_2.'
ieee: 'S. Hoof, “Dynamic Voluntary Provision of Public Goods: The Recursive Nash
Bargaining Solution,” in Static & Dynamic Game Theory: Foundations &
Applications, Cham: Springer International Publishing, 2018, pp. 13–23.'
mla: 'Hoof, Simon. “Dynamic Voluntary Provision of Public Goods: The Recursive Nash
Bargaining Solution.” Static & Dynamic Game Theory: Foundations & Applications,
Springer International Publishing, 2018, pp. 13–23, doi:10.1007/978-3-319-92988-0_2.'
short: 'S. Hoof, in: Static & Dynamic Game Theory: Foundations & Applications,
Springer International Publishing, Cham, 2018, pp. 13–23.'
date_created: 2018-08-01T09:51:57Z
date_updated: 2022-01-06T06:59:34Z
ddc:
- '000'
department:
- _id: '205'
doi: 10.1007/978-3-319-92988-0_2
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T16:10:34Z
date_updated: 2018-11-02T16:10:34Z
file_id: '5325'
file_name: Hoof2018_Chapter_DynamicVoluntaryProvisionOfPub.pdf
file_size: 199568
relation: main_file
success: 1
file_date_updated: 2018-11-02T16:10:34Z
has_accepted_license: '1'
language:
- iso: eng
page: 13-23
place: Cham
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '7'
name: SFB 901 - Subproject A3
publication: 'Static & Dynamic Game Theory: Foundations & Applications'
publication_identifier:
isbn:
- '9783319929873'
- '9783319929880'
issn:
- 2363-8516
- 2363-8524
publication_status: published
publisher: Springer International Publishing
status: public
title: 'Dynamic Voluntary Provision of Public Goods: The Recursive Nash Bargaining
Solution'
type: book_chapter
user_id: '477'
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: '2933'
abstract:
- lang: eng
text: We establish axioms under which a bargaining solution can be found by the
maximization of the CES function and is unique up to specification of the distribution
and elasticity parameters. This solution is referred to as the CES solution which
includes the NASH and egalitarian solutions as special cases. Next, we consider
a normalization of the CES function and establish axioms, under which a bargaining
solution can be found by the maximization of the normalized CES and is unique
up to the specifications of the distribution and its substitution parameters.
We refer to this solution as the normalized CES solution, which includes the Nash
and Kalai-Smorodinsky solutions as special cases. Our paper contributes to bargaining
theory by establishing unified characterizations of existing as well as a great
variety of new bargaining solutions.
author:
- first_name: Claus-Jochen
full_name: Haake, Claus-Jochen
id: '20801'
last_name: Haake
- first_name: Cheng-Zhong
full_name: Qin, Cheng-Zhong
last_name: Qin
citation:
ama: 'Haake C-J, Qin C-Z. On Unification of Solutions to the Bargaining Problem.
Vol 113. Paderborn University: CIE Working Paper Series, Paderborn University;
2018.'
apa: 'Haake, C.-J., & Qin, C.-Z. (2018). On unification of solutions to the
bargaining problem (Vol. 113). Paderborn University: CIE Working Paper Series,
Paderborn University.'
bibtex: '@book{Haake_Qin_2018, place={Paderborn University}, series={Working Papers
CIE}, title={On unification of solutions to the bargaining problem}, volume={113},
publisher={CIE Working Paper Series, Paderborn University}, author={Haake, Claus-Jochen
and Qin, Cheng-Zhong}, year={2018}, collection={Working Papers CIE} }'
chicago: 'Haake, Claus-Jochen, and Cheng-Zhong Qin. On Unification of Solutions
to the Bargaining Problem. Vol. 113. Working Papers CIE. Paderborn University:
CIE Working Paper Series, Paderborn University, 2018.'
ieee: 'C.-J. Haake and C.-Z. Qin, On unification of solutions to the bargaining
problem, vol. 113. Paderborn University: CIE Working Paper Series, Paderborn
University, 2018.'
mla: Haake, Claus-Jochen, and Cheng-Zhong Qin. On Unification of Solutions to
the Bargaining Problem. Vol. 113, CIE Working Paper Series, Paderborn University,
2018.
short: C.-J. Haake, C.-Z. Qin, On Unification of Solutions to the Bargaining Problem,
CIE Working Paper Series, Paderborn University, Paderborn University, 2018.
date_created: 2018-05-28T07:00:28Z
date_updated: 2022-01-06T06:58:48Z
ddc:
- '040'
department:
- _id: '205'
- _id: '475'
file:
- access_level: closed
content_type: application/pdf
creator: cjhaake
date_created: 2018-08-09T08:15:31Z
date_updated: 2018-08-09T09:14:52Z
file_id: '3855'
file_name: On unification of solutions to the bargaining problem.pdf
file_size: 469001
relation: main_file
title: On unification of solutions to the bargaining problem
file_date_updated: 2018-08-09T09:14:52Z
has_accepted_license: '1'
intvolume: ' 113'
keyword:
- Bargaining problem
- CES Function
- Normalized CES Function
- Nash solution
- Kalai-Smorodinsky Solution
- Egalitarian Solution.
language:
- iso: eng
place: Paderborn University
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '7'
name: SFB 901 - Subproject A3
publisher: CIE Working Paper Series, Paderborn University
series_title: Working Papers CIE
status: public
title: On unification of solutions to the bargaining problem
type: working_paper
urn: '29332'
user_id: '65453'
volume: 113
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: '3098'
abstract:
- lang: eng
text: "One of the fundamental problems in applications of methods and results\r\nfrom
mechanism design and implementation theory is the effective enforcement of\r\ntheoretically
established equilibria by which social choice rules are implemented.\r\nHurwicz
(2008) and Myerson (2009) introduce different concepts of formalizing\r\nenforcement
of institutional rules via the introduction of legal and illegal games. In\r\nthis
note the relation of their concepts with that of a social system defined inDebreu\r\n(1952)
is analyzed and its potential of being instrumental for modelling institution\r\ndesign
is discussed. The existence proof for such a system, also known as generalized\r\ngame
or abstract economy had been the basis for the existence proof of a\r\ncompetitive
equilibrium of an economy."
author:
- first_name: Walter
full_name: Trockel, Walter
last_name: Trockel
- first_name: Claus-Jochen
full_name: Haake, Claus-Jochen
id: '20801'
last_name: Haake
citation:
ama: 'Trockel W, Haake C-J. Thoughts on Social Design. In: Laslier J-F, Moulin H,
Sanver R, Zwicker W, eds. Studies in Economic Design. Vol (n.d.). Studies
in Economic Design. Heidelberg: Springer.'
apa: 'Trockel, W., & Haake, C.-J. (n.d.). Thoughts on Social Design. In J.-F.
Laslier, H. Moulin, R. Sanver, & W. Zwicker (Eds.), Studies in Economic
Design (Vol. (n.d.)). Heidelberg: Springer.'
bibtex: '@inbook{Trockel_Haake, place={Heidelberg}, series={Studies in Economic
Design}, title={Thoughts on Social Design}, volume={(n.d.)}, booktitle={Studies
in Economic Design}, publisher={Springer}, author={Trockel, Walter and Haake,
Claus-Jochen}, editor={Laslier, Jean-Francois and Moulin, Herve and Sanver, Remzi
and Zwicker, WilliamEditors}, collection={Studies in Economic Design} }'
chicago: 'Trockel, Walter, and Claus-Jochen Haake. “Thoughts on Social Design.”
In Studies in Economic Design, edited by Jean-Francois Laslier, Herve Moulin,
Remzi Sanver, and William Zwicker, Vol. (n.d.). Studies in Economic Design. Heidelberg:
Springer, n.d.'
ieee: 'W. Trockel and C.-J. Haake, “Thoughts on Social Design,” in Studies in
Economic Design, vol. (n.d.), J.-F. Laslier, H. Moulin, R. Sanver, and W.
Zwicker, Eds. Heidelberg: Springer.'
mla: Trockel, Walter, and Claus-Jochen Haake. “Thoughts on Social Design.” Studies
in Economic Design, edited by Jean-Francois Laslier et al., vol. (n.d.), Springer.
short: 'W. Trockel, C.-J. Haake, in: J.-F. Laslier, H. Moulin, R. Sanver, W. Zwicker
(Eds.), Studies in Economic Design, Springer, Heidelberg, n.d.'
date_created: 2018-06-06T17:07:28Z
date_updated: 2022-01-06T06:58:55Z
ddc:
- '040'
department:
- _id: '205'
- _id: '475'
editor:
- first_name: Jean-Francois
full_name: Laslier, Jean-Francois
last_name: Laslier
- first_name: Herve
full_name: Moulin, Herve
last_name: Moulin
- first_name: Remzi
full_name: Sanver, Remzi
last_name: Sanver
- first_name: William
full_name: Zwicker, William
last_name: Zwicker
file:
- access_level: closed
content_type: application/pdf
creator: cjhaake
date_created: 2018-08-09T08:36:24Z
date_updated: 2018-08-09T09:14:11Z
file_id: '3857'
file_name: WP - Thoughts on Social Design.pdf
file_size: 141983
relation: main_file
title: Thoughts on Social Design
file_date_updated: 2018-08-09T09:14:11Z
has_accepted_license: '1'
language:
- iso: eng
place: Heidelberg
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '7'
name: SFB 901 - Subproject A3
publication: Studies in Economic Design
publication_identifier:
issn:
- 2510-3970
publication_status: accepted
publisher: Springer
quality_controlled: '1'
series_title: Studies in Economic Design
status: public
title: Thoughts on Social Design
type: book_chapter
urn: '30987'
user_id: '477'
volume: (n.d.)
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: '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: '2712'
author:
- first_name: Darius
full_name: Schlangenotto, Darius
last_name: Schlangenotto
citation:
ama: Schlangenotto D. Consumer Responses to Paid Search - Empirical Evidence
from a Bricks-and-Mortar Retailer. Universität Paderborn; 2018. doi:10.17619/UNIPB/1-312
apa: Schlangenotto, D. (2018). Consumer Responses to Paid Search - Empirical
Evidence from a Bricks-and-Mortar Retailer. Universität Paderborn. https://doi.org/10.17619/UNIPB/1-312
bibtex: '@book{Schlangenotto_2018, title={Consumer Responses to Paid Search - Empirical
Evidence from a Bricks-and-Mortar Retailer}, DOI={10.17619/UNIPB/1-312},
publisher={Universität Paderborn}, author={Schlangenotto, Darius}, year={2018}
}'
chicago: Schlangenotto, Darius. Consumer Responses to Paid Search - Empirical
Evidence from a Bricks-and-Mortar Retailer. Universität Paderborn, 2018. https://doi.org/10.17619/UNIPB/1-312.
ieee: D. Schlangenotto, Consumer Responses to Paid Search - Empirical Evidence
from a Bricks-and-Mortar Retailer. Universität Paderborn, 2018.
mla: Schlangenotto, Darius. Consumer Responses to Paid Search - Empirical Evidence
from a Bricks-and-Mortar Retailer. Universität Paderborn, 2018, doi:10.17619/UNIPB/1-312.
short: D. Schlangenotto, Consumer Responses to Paid Search - Empirical Evidence
from a Bricks-and-Mortar Retailer, Universität Paderborn, 2018.
date_created: 2018-05-09T08:34:14Z
date_updated: 2022-01-06T06:57:35Z
department:
- _id: '276'
doi: 10.17619/UNIPB/1-312
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '8'
name: SFB 901 - Subproject A4
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Dennis
full_name: Kundisch, Dennis
id: '21117'
last_name: Kundisch
title: Consumer Responses to Paid Search - Empirical Evidence from a Bricks-and-Mortar
Retailer
type: dissertation
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'
...
---
_id: '17713'
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. Automated Multi-Label Classification based
on ML-Plan. Published online 2018.
apa: Wever, M. D., Mohr, F., & Hüllermeier, E. (2018). Automated Multi-Label
Classification based on ML-Plan. Arxiv.
bibtex: '@article{Wever_Mohr_Hüllermeier_2018, title={Automated Multi-Label Classification
based on ML-Plan}, publisher={Arxiv}, author={Wever, Marcel Dominik and Mohr,
Felix and Hüllermeier, Eyke}, year={2018} }'
chicago: Wever, Marcel Dominik, Felix Mohr, and Eyke Hüllermeier. “Automated Multi-Label
Classification Based on ML-Plan.” Arxiv, 2018.
ieee: M. D. Wever, F. Mohr, and E. Hüllermeier, “Automated Multi-Label Classification
based on ML-Plan.” Arxiv, 2018.
mla: Wever, Marcel Dominik, et al. Automated Multi-Label Classification Based
on ML-Plan. Arxiv, 2018.
short: M.D. Wever, F. Mohr, E. Hüllermeier, (2018).
date_created: 2020-08-07T11:38:10Z
date_updated: 2022-01-06T06:53:17Z
department:
- _id: '34'
- _id: '355'
- _id: '26'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/pdf/1811.04060.pdf
oa: '1'
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
publisher: Arxiv
status: public
title: Automated Multi-Label Classification based on ML-Plan
type: preprint
user_id: '5786'
year: '2018'
...
---
_id: '17714'
author:
- first_name: Felix
full_name: Mohr, Felix
last_name: Mohr
- first_name: Marcel Dominik
full_name: Wever, Marcel Dominik
id: '33176'
last_name: Wever
orcid: ' https://orcid.org/0000-0001-9782-6818'
- first_name: Eyke
full_name: Hüllermeier, Eyke
id: '48129'
last_name: Hüllermeier
citation:
ama: Mohr F, Wever MD, Hüllermeier E. Automated machine learning service composition.
Published online 2018.
apa: Mohr, F., Wever, M. D., & Hüllermeier, E. (2018). Automated machine
learning service composition.
bibtex: '@article{Mohr_Wever_Hüllermeier_2018, title={Automated machine learning
service composition}, author={Mohr, Felix and Wever, Marcel Dominik and Hüllermeier,
Eyke}, year={2018} }'
chicago: Mohr, Felix, Marcel Dominik Wever, and Eyke Hüllermeier. “Automated Machine
Learning Service Composition,” 2018.
ieee: F. Mohr, M. D. Wever, and E. Hüllermeier, “Automated machine learning service
composition.” 2018.
mla: Mohr, Felix, et al. Automated Machine Learning Service Composition.
2018.
short: F. Mohr, M.D. Wever, E. Hüllermeier, (2018).
date_created: 2020-08-07T11:40:13Z
date_updated: 2022-01-06T06:53:17Z
department:
- _id: '34'
- _id: '355'
- _id: '26'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/pdf/1809.00486.pdf
oa: '1'
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
status: public
title: Automated machine learning service composition
type: preprint
user_id: '5786'
year: '2018'
...