---
_id: '9913'
abstract:
- lang: eng
text: Reconfigurable hardware has received considerable attention as a platform
that enables dynamic hardware updates and thus is able to adapt new configurations
at runtime. However, due to their dynamic nature, e.g., field-programmable gate
arrays (FPGA) are subject to a constant possibility of attacks, since each new
configuration might be compromised. Trojans for reconfigurable hardware that evade
state-of-the-art detection techniques and even formal verification, are thus a
large threat to these devices. One such stealthy hardware Trojan, that is inserted
and activated in two stages by compromised electronic design automation (EDA)
tools, has recently been presented and shown to evade all forms of classical pre-configuration
detection techniques. This paper presents a successful pre-configuration countermeasure
against this ``Malicious Look-up-table (LUT)''-hardware Trojan, by employing bitstream-level
Proof-Carrying Hardware (PCH). We show that the method is able to alert innocent
module creators to infected EDA tools, and to prohibit malicious ones to sell
infected modules to unsuspecting customers.
author:
- first_name: Qazi Arbab
full_name: Ahmed, Qazi Arbab
id: '72764'
last_name: Ahmed
orcid: 0000-0002-1837-2254
- 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: 'Ahmed QA, Wiersema T, Platzner M. Proof-Carrying Hardware Versus the Stealthy
Malicious LUT Hardware Trojan. In: Hochberger C, Nelson B, Koch A, Woods R, Diniz
P, eds. Applied Reconfigurable Computing. Vol 11444. Lecture Notes in Computer
Science. Springer International Publishing; 2019:127-136. doi:10.1007/978-3-030-17227-5_10'
apa: Ahmed, Q. A., Wiersema, T., & Platzner, M. (2019). Proof-Carrying Hardware
Versus the Stealthy Malicious LUT Hardware Trojan. In C. Hochberger, B. Nelson,
A. Koch, R. Woods, & P. Diniz (Eds.), Applied Reconfigurable Computing
(Vol. 11444, pp. 127–136). Springer International Publishing. https://doi.org/10.1007/978-3-030-17227-5_10
bibtex: '@inproceedings{Ahmed_Wiersema_Platzner_2019, place={Cham}, series={Lecture
Notes in Computer Science}, title={Proof-Carrying Hardware Versus the Stealthy
Malicious LUT Hardware Trojan}, volume={11444}, DOI={10.1007/978-3-030-17227-5_10},
booktitle={Applied Reconfigurable Computing}, publisher={Springer International
Publishing}, author={Ahmed, Qazi Arbab and Wiersema, Tobias and Platzner, Marco},
editor={Hochberger, Christian and Nelson, Brent and Koch, Andreas and Woods, Roger
and Diniz, Pedro}, year={2019}, pages={127–136}, collection={Lecture Notes in
Computer Science} }'
chicago: 'Ahmed, Qazi Arbab, Tobias Wiersema, and Marco Platzner. “Proof-Carrying
Hardware Versus the Stealthy Malicious LUT Hardware Trojan.” In Applied Reconfigurable
Computing, edited by Christian Hochberger, Brent Nelson, Andreas Koch, Roger
Woods, and Pedro Diniz, 11444:127–36. Lecture Notes in Computer Science. Cham:
Springer International Publishing, 2019. https://doi.org/10.1007/978-3-030-17227-5_10.'
ieee: 'Q. A. Ahmed, T. Wiersema, and M. Platzner, “Proof-Carrying Hardware Versus
the Stealthy Malicious LUT Hardware Trojan,” in Applied Reconfigurable Computing,
Darmstadt, Germany, 2019, vol. 11444, pp. 127–136, doi: 10.1007/978-3-030-17227-5_10.'
mla: Ahmed, Qazi Arbab, et al. “Proof-Carrying Hardware Versus the Stealthy Malicious
LUT Hardware Trojan.” Applied Reconfigurable Computing, edited by Christian
Hochberger et al., vol. 11444, Springer International Publishing, 2019, pp. 127–36,
doi:10.1007/978-3-030-17227-5_10.
short: 'Q.A. Ahmed, T. Wiersema, M. Platzner, in: C. Hochberger, B. Nelson, A. Koch,
R. Woods, P. Diniz (Eds.), Applied Reconfigurable Computing, Springer International
Publishing, Cham, 2019, pp. 127–136.'
conference:
end_date: 2019-04-11
location: Darmstadt, Germany
name: 15th International Symposium on Applied Reconfigurable Computing (ARC 2019)
start_date: 2019-04-09
date_created: 2019-05-22T07:36:05Z
date_updated: 2023-05-15T08:13:37Z
ddc:
- '000'
department:
- _id: '78'
doi: 10.1007/978-3-030-17227-5_10
editor:
- first_name: Christian
full_name: Hochberger, Christian
last_name: Hochberger
- first_name: Brent
full_name: Nelson, Brent
last_name: Nelson
- first_name: Andreas
full_name: Koch, Andreas
last_name: Koch
- first_name: Roger
full_name: Woods, Roger
last_name: Woods
- first_name: Pedro
full_name: Diniz, Pedro
last_name: Diniz
file:
- access_level: closed
content_type: application/pdf
creator: qazi
date_created: 2023-05-11T09:12:33Z
date_updated: 2023-05-11T09:12:33Z
file_id: '44749'
file_name: 978-3-030-17227-5_10.pdf
file_size: 661354
relation: main_file
success: 1
file_date_updated: 2023-05-11T09:12:33Z
has_accepted_license: '1'
intvolume: ' 11444'
language:
- iso: eng
main_file_link:
- open_access: '1'
oa: '1'
page: 127-136
place: Cham
project:
- _id: '12'
name: SFB 901 - Subproject B4
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
publication: Applied Reconfigurable Computing
publication_identifier:
isbn:
- 978-3-030-17227-5
publication_status: published
publisher: Springer International Publishing
series_title: Lecture Notes in Computer Science
status: public
title: Proof-Carrying Hardware Versus the Stealthy Malicious LUT Hardware Trojan
type: conference
user_id: '72764'
volume: 11444
year: '2019'
...
---
_id: '14898'
author:
- first_name: Philipp
full_name: Schubert, Philipp
id: '60543'
last_name: Schubert
orcid: 0000-0002-8674-1859
- first_name: Richard
full_name: Leer, Richard
last_name: Leer
- first_name: Ben
full_name: Hermann, Ben
id: '66173'
last_name: Hermann
orcid: 0000-0001-9848-2017
- first_name: Eric
full_name: Bodden, Eric
id: '59256'
last_name: Bodden
orcid: 0000-0003-3470-3647
citation:
ama: 'Schubert P, Leer R, Hermann B, Bodden E. Know your analysis: how instrumentation
aids understanding static analysis. In: Proceedings of the 8th ACM SIGPLAN
International Workshop on State Of the Art in Program Analysis - SOAP 2019.
; 2019. doi:10.1145/3315568.3329965'
apa: 'Schubert, P., Leer, R., Hermann, B., & Bodden, E. (2019). Know your analysis:
how instrumentation aids understanding static analysis. Proceedings of the
8th ACM SIGPLAN International Workshop on State Of the Art in Program Analysis
- SOAP 2019. https://doi.org/10.1145/3315568.3329965'
bibtex: '@inproceedings{Schubert_Leer_Hermann_Bodden_2019, title={Know your analysis:
how instrumentation aids understanding static analysis}, DOI={10.1145/3315568.3329965},
booktitle={Proceedings of the 8th ACM SIGPLAN International Workshop on State
Of the Art in Program Analysis - SOAP 2019}, author={Schubert, Philipp and Leer,
Richard and Hermann, Ben and Bodden, Eric}, year={2019} }'
chicago: 'Schubert, Philipp, Richard Leer, Ben Hermann, and Eric Bodden. “Know Your
Analysis: How Instrumentation Aids Understanding Static Analysis.” In Proceedings
of the 8th ACM SIGPLAN International Workshop on State Of the Art in Program Analysis
- SOAP 2019, 2019. https://doi.org/10.1145/3315568.3329965.'
ieee: 'P. Schubert, R. Leer, B. Hermann, and E. Bodden, “Know your analysis: how
instrumentation aids understanding static analysis,” 2019, doi: 10.1145/3315568.3329965.'
mla: 'Schubert, Philipp, et al. “Know Your Analysis: How Instrumentation Aids Understanding
Static Analysis.” Proceedings of the 8th ACM SIGPLAN International Workshop
on State Of the Art in Program Analysis - SOAP 2019, 2019, doi:10.1145/3315568.3329965.'
short: 'P. Schubert, R. Leer, B. Hermann, E. Bodden, in: Proceedings of the 8th
ACM SIGPLAN International Workshop on State Of the Art in Program Analysis -
SOAP 2019, 2019.'
date_created: 2019-11-12T12:22:16Z
date_updated: 2023-06-15T08:52:37Z
department:
- _id: '76'
- _id: '34'
- _id: '26'
doi: 10.1145/3315568.3329965
language:
- iso: eng
project:
- _id: '12'
name: 'SFB 901 - B4: SFB 901 - Subproject B4'
- _id: '3'
name: 'SFB 901 - B: SFB 901 - Project Area B'
- _id: '1'
grant_number: '160364472'
name: 'SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen
in dynamischen Märkten '
publication: Proceedings of the 8th ACM SIGPLAN International Workshop on State Of
the Art in Program Analysis - SOAP 2019
publication_identifier:
isbn:
- '9781450367202'
publication_status: published
status: public
title: 'Know your analysis: how instrumentation aids understanding static analysis'
type: conference
user_id: '15249'
year: '2019'
...
---
_id: '2479'
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
- first_name: Amin
full_name: Faez, Amin
last_name: Faez
citation:
ama: 'Mohr F, Wever MD, Hüllermeier E, Faez A. (WIP) Towards the Automated Composition
of Machine Learning Services. In: SCC. San Francisco, CA, USA: IEEE; 2018.
doi:10.1109/SCC.2018.00039'
apa: 'Mohr, F., Wever, M. D., Hüllermeier, E., & Faez, A. (2018). (WIP) Towards
the Automated Composition of Machine Learning Services. In SCC. San Francisco,
CA, USA: IEEE. https://doi.org/10.1109/SCC.2018.00039'
bibtex: '@inproceedings{Mohr_Wever_Hüllermeier_Faez_2018, place={San Francisco,
CA, USA}, title={(WIP) Towards the Automated Composition of Machine Learning Services},
DOI={10.1109/SCC.2018.00039},
booktitle={SCC}, publisher={IEEE}, author={Mohr, Felix and Wever, Marcel Dominik
and Hüllermeier, Eyke and Faez, Amin}, year={2018} }'
chicago: 'Mohr, Felix, Marcel Dominik Wever, Eyke Hüllermeier, and Amin Faez. “(WIP)
Towards the Automated Composition of Machine Learning Services.” In SCC.
San Francisco, CA, USA: IEEE, 2018. https://doi.org/10.1109/SCC.2018.00039.'
ieee: F. Mohr, M. D. Wever, E. Hüllermeier, and A. Faez, “(WIP) Towards the Automated
Composition of Machine Learning Services,” in SCC, San Francisco, CA, USA,
2018.
mla: Mohr, Felix, et al. “(WIP) Towards the Automated Composition of Machine Learning
Services.” SCC, IEEE, 2018, doi:10.1109/SCC.2018.00039.
short: 'F. Mohr, M.D. Wever, E. Hüllermeier, A. Faez, in: SCC, IEEE, San Francisco,
CA, USA, 2018.'
conference:
end_date: 2018-07-07
location: San Francisco, CA, USA
name: IEEE International Conference on Services Computing, SCC 2018
start_date: 2018-07-02
date_created: 2018-04-24T08:34:52Z
date_updated: 2022-01-06T06:56:35Z
ddc:
- '000'
department:
- _id: '355'
doi: 10.1109/SCC.2018.00039
file:
- access_level: closed
content_type: application/pdf
creator: wever
date_created: 2018-11-06T15:08:39Z
date_updated: 2018-11-06T15:08:39Z
file_id: '5382'
file_name: 08456425.pdf
file_size: 237890
relation: main_file
file_date_updated: 2018-11-06T15:08:39Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://ieeexplore.ieee.org/document/8456425
oa: '1'
place: San Francisco, CA, USA
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '10'
name: SFB 901 - Subproject B2
publication: SCC
publication_status: published
publisher: IEEE
status: public
title: (WIP) Towards the Automated Composition of Machine Learning Services
type: conference
user_id: '49109'
year: '2018'
...
---
_id: '2857'
author:
- first_name: Felix
full_name: Mohr, Felix
last_name: Mohr
- first_name: Theodor
full_name: Lettmann, Theodor
id: '315'
last_name: Lettmann
orcid: 0000-0001-5859-2457
- first_name: Eyke
full_name: Hüllermeier, Eyke
id: '48129'
last_name: Hüllermeier
- first_name: Marcel Dominik
full_name: Wever, Marcel Dominik
id: '33176'
last_name: Wever
orcid: ' https://orcid.org/0000-0001-9782-6818'
citation:
ama: 'Mohr F, Lettmann T, Hüllermeier E, Wever MD. Programmatic Task Network Planning.
In: Proceedings of the 1st ICAPS Workshop on Hierarchical Planning. AAAI;
2018:31-39.'
apa: 'Mohr, F., Lettmann, T., Hüllermeier, E., & Wever, M. D. (2018). Programmatic
Task Network Planning. In Proceedings of the 1st ICAPS Workshop on Hierarchical
Planning (pp. 31–39). Delft, Netherlands: AAAI.'
bibtex: '@inproceedings{Mohr_Lettmann_Hüllermeier_Wever_2018, title={Programmatic
Task Network Planning}, booktitle={Proceedings of the 1st ICAPS Workshop on Hierarchical
Planning}, publisher={AAAI}, author={Mohr, Felix and Lettmann, Theodor and Hüllermeier,
Eyke and Wever, Marcel Dominik}, year={2018}, pages={31–39} }'
chicago: Mohr, Felix, Theodor Lettmann, Eyke Hüllermeier, and Marcel Dominik Wever.
“Programmatic Task Network Planning.” In Proceedings of the 1st ICAPS Workshop
on Hierarchical Planning, 31–39. AAAI, 2018.
ieee: F. Mohr, T. Lettmann, E. Hüllermeier, and M. D. Wever, “Programmatic Task
Network Planning,” in Proceedings of the 1st ICAPS Workshop on Hierarchical
Planning, Delft, Netherlands, 2018, pp. 31–39.
mla: Mohr, Felix, et al. “Programmatic Task Network Planning.” Proceedings of
the 1st ICAPS Workshop on Hierarchical Planning, AAAI, 2018, pp. 31–39.
short: 'F. Mohr, T. Lettmann, E. Hüllermeier, M.D. Wever, in: Proceedings of the
1st ICAPS Workshop on Hierarchical Planning, AAAI, 2018, pp. 31–39.'
conference:
end_date: 2018-06-29
location: Delft, Netherlands
name: 28th International Conference on Automated Planning and Scheduling
start_date: 2018-06-24
date_created: 2018-05-24T09:00:20Z
date_updated: 2022-01-06T06:58:08Z
ddc:
- '000'
department:
- _id: '355'
file:
- access_level: closed
content_type: application/pdf
creator: wever
date_created: 2018-11-06T15:18:26Z
date_updated: 2018-11-06T15:18:26Z
file_id: '5384'
file_name: Mohr18ProgrammaticPlanning.pdf
file_size: 349958
relation: main_file
success: 1
file_date_updated: 2018-11-06T15:18:26Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://icaps18.icaps-conference.org/fileadmin/alg/conferences/icaps18/workshops/workshop08/docs/Mohr18ProgrammaticPlanning.pdf
oa: '1'
page: 31-39
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '10'
name: SFB 901 - Subproject B2
publication: Proceedings of the 1st ICAPS Workshop on Hierarchical Planning
publisher: AAAI
status: public
title: Programmatic Task Network Planning
type: conference
user_id: '315'
year: '2018'
...
---
_id: '2471'
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. On-The-Fly Service Construction with Prototypes.
In: SCC. San Francisco, CA, USA: IEEE Computer Society; 2018. doi:10.1109/SCC.2018.00036'
apa: 'Mohr, F., Wever, M. D., & Hüllermeier, E. (2018). On-The-Fly Service Construction
with Prototypes. In SCC. San Francisco, CA, USA: IEEE Computer Society.
https://doi.org/10.1109/SCC.2018.00036'
bibtex: '@inproceedings{Mohr_Wever_Hüllermeier_2018, place={San Francisco, CA, USA},
title={On-The-Fly Service Construction with Prototypes}, DOI={10.1109/SCC.2018.00036},
booktitle={SCC}, publisher={IEEE Computer Society}, author={Mohr, Felix and Wever,
Marcel Dominik and Hüllermeier, Eyke}, year={2018} }'
chicago: 'Mohr, Felix, Marcel Dominik Wever, and Eyke Hüllermeier. “On-The-Fly Service
Construction with Prototypes.” In SCC. San Francisco, CA, USA: IEEE Computer
Society, 2018. https://doi.org/10.1109/SCC.2018.00036.'
ieee: F. Mohr, M. D. Wever, and E. Hüllermeier, “On-The-Fly Service Construction
with Prototypes,” in SCC, San Francisco, CA, USA, 2018.
mla: Mohr, Felix, et al. “On-The-Fly Service Construction with Prototypes.” SCC,
IEEE Computer Society, 2018, doi:10.1109/SCC.2018.00036.
short: 'F. Mohr, M.D. Wever, E. Hüllermeier, in: SCC, IEEE Computer Society, San
Francisco, CA, USA, 2018.'
conference:
end_date: 2018-07-07
location: San Francisco, CA, USA
name: IEEE International Conference on Services Computing, SCC 2018
start_date: 2018-07-02
date_created: 2018-04-23T11:40:20Z
date_updated: 2022-01-06T06:56:32Z
ddc:
- '000'
department:
- _id: '355'
doi: 10.1109/SCC.2018.00036
file:
- access_level: closed
content_type: application/pdf
creator: wever
date_created: 2018-11-06T15:15:38Z
date_updated: 2018-11-06T15:15:38Z
file_id: '5383'
file_name: 08456422.pdf
file_size: 356132
relation: main_file
success: 1
file_date_updated: 2018-11-06T15:15:38Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://ieeexplore.ieee.org/abstract/document/8456422
oa: '1'
place: San Francisco, CA, USA
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '10'
name: SFB 901 - Subproject B2
publication: SCC
publisher: IEEE Computer Society
status: public
title: On-The-Fly Service Construction with Prototypes
type: conference
user_id: '49109'
year: '2018'
...
---
_id: '3320'
author:
- first_name: Kai
full_name: Rautenberg, Kai
last_name: Rautenberg
citation:
ama: Rautenberg K. Korrektheitsbeweise für Muster von Servicekompositionen.
Universität Paderborn; 2018.
apa: Rautenberg, K. (2018). Korrektheitsbeweise für Muster von Servicekompositionen.
Universität Paderborn.
bibtex: '@book{Rautenberg_2018, title={Korrektheitsbeweise für Muster von Servicekompositionen},
publisher={Universität Paderborn}, author={Rautenberg, Kai}, year={2018} }'
chicago: Rautenberg, Kai. Korrektheitsbeweise für Muster von Servicekompositionen.
Universität Paderborn, 2018.
ieee: K. Rautenberg, Korrektheitsbeweise für Muster von Servicekompositionen.
Universität Paderborn, 2018.
mla: Rautenberg, Kai. Korrektheitsbeweise für Muster von Servicekompositionen.
Universität Paderborn, 2018.
short: K. Rautenberg, Korrektheitsbeweise für Muster von Servicekompositionen, Universität
Paderborn, 2018.
date_created: 2018-06-25T07:53:32Z
date_updated: 2022-01-06T06:59:10Z
department:
- _id: '7'
- _id: '77'
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '11'
name: SFB 901 - Subproject B3
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
title: Korrektheitsbeweise für Muster von Servicekompositionen
type: bachelorsthesis
user_id: '477'
year: '2018'
...
---
_id: '3373'
abstract:
- lang: eng
text: Modern Boolean satisfiability solvers can emit proofs of unsatisfiability.
There is substantial interest in being able to verify such proofs and also in
using them for further computations. In this paper, we present an FPGA accelerator
for checking resolution proofs, a popular proof format. Our accelerator exploits
parallelism at the low level by implementing the basic resolution step in hardware,
and at the high level by instantiating a number of parallel modules for proof
checking. Since proof checking involves highly irregular memory accesses, we employ
Hybrid Memory Cube technology for accelerator memory. The results show that while
the accelerator is scalable and achieves speedups for all benchmark proofs, performance
improvements are currently limited by the overhead of transitioning the proof
into the accelerator memory.
author:
- first_name: Tim
full_name: Hansmeier, Tim
id: '49992'
last_name: Hansmeier
orcid: 0000-0003-1377-3339
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
- first_name: David
full_name: Andrews, David
last_name: Andrews
citation:
ama: 'Hansmeier T, Platzner M, Andrews D. An FPGA/HMC-Based Accelerator for Resolution
Proof Checking. In: ARC 2018: Applied Reconfigurable Computing. Architectures,
Tools, and Applications. Vol 10824. Lecture Notes in Computer Science. Springer
International Publishing; 2018:153-165. doi:10.1007/978-3-319-78890-6_13'
apa: 'Hansmeier, T., Platzner, M., & Andrews, D. (2018). An FPGA/HMC-Based Accelerator
for Resolution Proof Checking. In ARC 2018: Applied Reconfigurable Computing.
Architectures, Tools, and Applications (Vol. 10824, pp. 153–165). Santorini,
Greece: Springer International Publishing. https://doi.org/10.1007/978-3-319-78890-6_13'
bibtex: '@inproceedings{Hansmeier_Platzner_Andrews_2018, series={Lecture Notes in
Computer Science}, title={An FPGA/HMC-Based Accelerator for Resolution Proof Checking},
volume={10824}, DOI={10.1007/978-3-319-78890-6_13},
booktitle={ARC 2018: Applied Reconfigurable Computing. Architectures, Tools, and
Applications}, publisher={Springer International Publishing}, author={Hansmeier,
Tim and Platzner, Marco and Andrews, David}, year={2018}, pages={153–165}, collection={Lecture
Notes in Computer Science} }'
chicago: 'Hansmeier, Tim, Marco Platzner, and David Andrews. “An FPGA/HMC-Based
Accelerator for Resolution Proof Checking.” In ARC 2018: Applied Reconfigurable
Computing. Architectures, Tools, and Applications, 10824:153–65. Lecture Notes
in Computer Science. Springer International Publishing, 2018. https://doi.org/10.1007/978-3-319-78890-6_13.'
ieee: 'T. Hansmeier, M. Platzner, and D. Andrews, “An FPGA/HMC-Based Accelerator
for Resolution Proof Checking,” in ARC 2018: Applied Reconfigurable Computing.
Architectures, Tools, and Applications, Santorini, Greece, 2018, vol. 10824,
pp. 153–165.'
mla: 'Hansmeier, Tim, et al. “An FPGA/HMC-Based Accelerator for Resolution Proof
Checking.” ARC 2018: Applied Reconfigurable Computing. Architectures, Tools,
and Applications, vol. 10824, Springer International Publishing, 2018, pp.
153–65, doi:10.1007/978-3-319-78890-6_13.'
short: 'T. Hansmeier, M. Platzner, D. Andrews, in: ARC 2018: Applied Reconfigurable
Computing. Architectures, Tools, and Applications, Springer International Publishing,
2018, pp. 153–165.'
conference:
end_date: 2018-05-04
location: Santorini, Greece
name: 'ARC: International Symposium on Applied Reconfigurable Computing'
start_date: 2018-05-02
date_created: 2018-06-27T09:30:24Z
date_updated: 2022-01-06T06:59:13Z
ddc:
- '000'
department:
- _id: '78'
doi: 10.1007/978-3-319-78890-6_13
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T13:55:07Z
date_updated: 2018-11-02T13:55:07Z
file_id: '5257'
file_name: AnFPGAHMC-BasedAcceleratorForR.pdf
file_size: 612367
relation: main_file
success: 1
file_date_updated: 2018-11-02T13:55:07Z
has_accepted_license: '1'
intvolume: ' 10824'
language:
- iso: eng
page: 153-165
project:
- _id: '12'
name: SFB 901 - Subproject B4
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
publication: 'ARC 2018: Applied Reconfigurable Computing. Architectures, Tools, and
Applications'
publication_identifier:
isbn:
- '9783319788890'
- '9783319788906'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer International Publishing
series_title: Lecture Notes in Computer Science
status: public
title: An FPGA/HMC-Based Accelerator for Resolution Proof Checking
type: conference
user_id: '3118'
volume: 10824
year: '2018'
...
---
_id: '3402'
abstract:
- lang: eng
text: In machine learning, so-called nested dichotomies are utilized as a reduction
technique, i.e., to decompose a multi-class classification problem into a set
of binary problems, which are solved using a simple binary classifier as a base
learner. The performance of the (multi-class) classifier thus produced strongly
depends on the structure of the decomposition. In this paper, we conduct an empirical
study, in which we compare existing heuristics for selecting a suitable structure
in the form of a nested dichotomy. Moreover, we propose two additional heuristics
as natural completions. One of them is the Best-of-K heuristic, which picks the
(presumably) best among K randomly generated nested dichotomies. Surprisingly,
and in spite of its simplicity, it turns out to outperform the state of the art.
author:
- first_name: Vitalik
full_name: Melnikov, Vitalik
last_name: Melnikov
- first_name: Eyke
full_name: Hüllermeier, Eyke
id: '48129'
last_name: Hüllermeier
citation:
ama: 'Melnikov V, Hüllermeier E. On the effectiveness of heuristics for learning
nested dichotomies: an empirical analysis. Machine Learning. 2018. doi:10.1007/s10994-018-5733-1'
apa: 'Melnikov, V., & Hüllermeier, E. (2018). On the effectiveness of heuristics
for learning nested dichotomies: an empirical analysis. Machine Learning.
https://doi.org/10.1007/s10994-018-5733-1'
bibtex: '@article{Melnikov_Hüllermeier_2018, title={On the effectiveness of heuristics
for learning nested dichotomies: an empirical analysis}, DOI={10.1007/s10994-018-5733-1},
journal={Machine Learning}, author={Melnikov, Vitalik and Hüllermeier, Eyke},
year={2018} }'
chicago: 'Melnikov, Vitalik, and Eyke Hüllermeier. “On the Effectiveness of Heuristics
for Learning Nested Dichotomies: An Empirical Analysis.” Machine Learning,
2018. https://doi.org/10.1007/s10994-018-5733-1.'
ieee: 'V. Melnikov and E. Hüllermeier, “On the effectiveness of heuristics for learning
nested dichotomies: an empirical analysis,” Machine Learning, 2018.'
mla: 'Melnikov, Vitalik, and Eyke Hüllermeier. “On the Effectiveness of Heuristics
for Learning Nested Dichotomies: An Empirical Analysis.” Machine Learning,
2018, doi:10.1007/s10994-018-5733-1.'
short: V. Melnikov, E. Hüllermeier, Machine Learning (2018).
date_created: 2018-06-29T07:44:26Z
date_updated: 2022-01-06T06:59:14Z
ddc:
- '000'
department:
- _id: '355'
doi: 10.1007/s10994-018-5733-1
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T15:30:57Z
date_updated: 2018-11-02T15:30:57Z
file_id: '5305'
file_name: OnTheEffectivenessOfHeuristics.pdf
file_size: 1482882
relation: main_file
success: 1
file_date_updated: 2018-11-02T15:30:57Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '11'
name: SFB 901 - Subproject B3
- _id: '3'
name: SFB 901 - Project Area B
- _id: '1'
name: SFB 901
publication: Machine Learning
publication_identifier:
issn:
- 1573-0565
status: public
title: 'On the effectiveness of heuristics for learning nested dichotomies: an empirical
analysis'
type: journal_article
user_id: '15504'
year: '2018'
...
---
_id: '3414'
abstract:
- lang: eng
text: "Over the years, Design by Contract (DbC) has evolved as a\r\npowerful concept
for program documentation, testing, and verification.\r\nContracts formally specify
assertions on (mostly) object-oriented programs:\r\npre- and postconditions of
methods, class invariants, allowed call\r\norders, etc. Missing in the long list
of properties specifiable by contracts\r\nare, however, method correlations: DbC
languages fall short on stating\r\nassertions relating methods.\r\nIn this paper,
we propose the novel concept of inter-method contract,\r\nallowing precisely for
expressing method correlations.We present JMC as\r\na language for specifying
and JMCTest as a tool for dynamically checking\r\ninter-method contracts on Java
programs. JMCTest fully automatically\r\ngenerates objects on which the contracted
methods are called and\r\nthe validity of the contract is checked. Using JMCTest,
we detected\r\nthat large Java code bases (e.g. JBoss, Java RT) frequently violate
standard\r\ninter-method contracts. In comparison to other verification tools\r\ninspecting
(some) inter-method contracts, JMCTest can find bugs that\r\nremain undetected
by those tools."
author:
- first_name: Paul
full_name: Börding, Paul
last_name: Börding
- first_name: Jan Frederik
full_name: Haltermann, Jan Frederik
id: '44413'
last_name: Haltermann
- first_name: Marie-Christine
full_name: Jakobs, Marie-Christine
last_name: Jakobs
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Börding P, Haltermann JF, Jakobs M-C, Wehrheim H. JMCTest: Automatically Testing
Inter-Method Contracts in Java. In: Proceedings of the IFIP International Conference
on Testing Software and Systems (ICTSS 2018). Vol 11146. Lecture Notes in
Computer Science. Springer; 2018:39--55.'
apa: 'Börding, P., Haltermann, J. F., Jakobs, M.-C., & Wehrheim, H. (2018).
JMCTest: Automatically Testing Inter-Method Contracts in Java. In Proceedings
of the IFIP International Conference on Testing Software and Systems (ICTSS 2018)
(Vol. 11146, pp. 39--55). Cádiz, Spain: Springer.'
bibtex: '@inproceedings{Börding_Haltermann_Jakobs_Wehrheim_2018, series={Lecture
Notes in Computer Science}, title={JMCTest: Automatically Testing Inter-Method
Contracts in Java}, volume={11146}, booktitle={Proceedings of the IFIP International
Conference on Testing Software and Systems (ICTSS 2018)}, publisher={Springer},
author={Börding, Paul and Haltermann, Jan Frederik and Jakobs, Marie-Christine
and Wehrheim, Heike}, year={2018}, pages={39--55}, collection={Lecture Notes in
Computer Science} }'
chicago: 'Börding, Paul, Jan Frederik Haltermann, Marie-Christine Jakobs, and Heike
Wehrheim. “JMCTest: Automatically Testing Inter-Method Contracts in Java.” In
Proceedings of the IFIP International Conference on Testing Software and Systems
(ICTSS 2018), 11146:39--55. Lecture Notes in Computer Science. Springer, 2018.'
ieee: 'P. Börding, J. F. Haltermann, M.-C. Jakobs, and H. Wehrheim, “JMCTest: Automatically
Testing Inter-Method Contracts in Java,” in Proceedings of the IFIP International
Conference on Testing Software and Systems (ICTSS 2018), Cádiz, Spain, 2018,
vol. 11146, pp. 39--55.'
mla: 'Börding, Paul, et al. “JMCTest: Automatically Testing Inter-Method Contracts
in Java.” Proceedings of the IFIP International Conference on Testing Software
and Systems (ICTSS 2018), vol. 11146, Springer, 2018, pp. 39--55.'
short: 'P. Börding, J.F. Haltermann, M.-C. Jakobs, H. Wehrheim, in: Proceedings
of the IFIP International Conference on Testing Software and Systems (ICTSS 2018),
Springer, 2018, pp. 39--55.'
conference:
end_date: 2018-10-03
location: Cádiz, Spain
name: IFIP International Conference on Testing Software and Systems
start_date: 2018-10-01
date_created: 2018-07-02T09:06:56Z
date_updated: 2022-01-06T06:59:15Z
ddc:
- '006'
department:
- _id: '7'
- _id: '77'
file:
- access_level: closed
content_type: application/pdf
creator: schlatt
date_created: 2018-11-21T09:35:35Z
date_updated: 2018-11-21T09:35:35Z
file_id: '5770'
file_name: Börding2018_Chapter_JMCTestAutomaticallyTestingInt.pdf
file_size: 574386
relation: main_file
success: 1
file_date_updated: 2018-11-21T09:35:35Z
has_accepted_license: '1'
intvolume: ' 11146'
language:
- iso: eng
page: 39--55
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '11'
name: SFB 901 - Subproject B3
publication: Proceedings of the IFIP International Conference on Testing Software
and Systems (ICTSS 2018)
publication_status: published
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: 'JMCTest: Automatically Testing Inter-Method Contracts in Java'
type: conference
user_id: '29719'
volume: 11146
year: '2018'
...
---
_id: '3510'
abstract:
- lang: eng
text: Automated machine learning (AutoML) seeks to automatically select, compose,
and parametrize machine learning algorithms, so as to achieve optimal performance
on a given task (dataset). Although current approaches to AutoML have already
produced impressive results, the field is still far from mature, and new techniques
are still being developed. In this paper, we present ML-Plan, a new approach to
AutoML based on hierarchical planning. To highlight the potential of this approach,
we compare ML-Plan to the state-of-the-art frameworks Auto-WEKA, auto-sklearn,
and TPOT. In an extensive series of experiments, we show that ML-Plan is highly
competitive and often outperforms existing approaches.
article_type: original
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. ML-Plan: Automated Machine Learning via Hierarchical
Planning. Machine Learning. Published online 2018:1495-1515. doi:10.1007/s10994-018-5735-z'
apa: 'Mohr, F., Wever, M. D., & Hüllermeier, E. (2018). ML-Plan: Automated Machine
Learning via Hierarchical Planning. Machine Learning, 1495–1515. https://doi.org/10.1007/s10994-018-5735-z'
bibtex: '@article{Mohr_Wever_Hüllermeier_2018, title={ML-Plan: Automated Machine
Learning via Hierarchical Planning}, DOI={10.1007/s10994-018-5735-z},
journal={Machine Learning}, publisher={Springer}, author={Mohr, Felix and Wever,
Marcel Dominik and Hüllermeier, Eyke}, year={2018}, pages={1495–1515} }'
chicago: 'Mohr, Felix, Marcel Dominik Wever, and Eyke Hüllermeier. “ML-Plan: Automated
Machine Learning via Hierarchical Planning.” Machine Learning, 2018, 1495–1515.
https://doi.org/10.1007/s10994-018-5735-z.'
ieee: 'F. Mohr, M. D. Wever, and E. Hüllermeier, “ML-Plan: Automated Machine Learning
via Hierarchical Planning,” Machine Learning, pp. 1495–1515, 2018, doi:
10.1007/s10994-018-5735-z.'
mla: 'Mohr, Felix, et al. “ML-Plan: Automated Machine Learning via Hierarchical
Planning.” Machine Learning, Springer, 2018, pp. 1495–515, doi:10.1007/s10994-018-5735-z.'
short: F. Mohr, M.D. Wever, E. Hüllermeier, Machine Learning (2018) 1495–1515.
conference:
end_date: 2018-09-14
location: Dublin, Ireland
name: European Conference on Machine Learning and Principles and Practice of Knowledge
Discovery in Databases
start_date: 2018-09-10
date_created: 2018-07-08T14:06:14Z
date_updated: 2022-01-06T06:59:21Z
ddc:
- '000'
department:
- _id: '355'
- _id: '34'
- _id: '7'
- _id: '26'
doi: 10.1007/s10994-018-5735-z
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T15:32:16Z
date_updated: 2018-11-02T15:32:16Z
file_id: '5306'
file_name: ML-PlanAutomatedMachineLearnin.pdf
file_size: 1070937
relation: main_file
success: 1
file_date_updated: 2018-11-02T15:32:16Z
has_accepted_license: '1'
keyword:
- AutoML
- Hierarchical Planning
- HTN planning
- ML-Plan
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://rdcu.be/3Nc2
oa: '1'
page: 1495-1515
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: Machine Learning
publication_identifier:
eissn:
- 1573-0565
issn:
- 0885-6125
publication_status: epub_ahead
publisher: Springer
status: public
title: 'ML-Plan: Automated Machine Learning via Hierarchical Planning'
type: journal_article
user_id: '5786'
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: '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: '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: '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'
...
---
_id: '2322'
abstract:
- lang: eng
text: "The vision of On-The-Fly Computing is an automatic composition\r\nof existing
software services. Based on natural language software\r\ndescriptions, end users
will receive compositions tailored to their needs.\r\nFor this reason, the quality
of the initial software service description\r\nstrongly determines whether a software
composition really meets the expectations\r\nof end users. In this paper, we expose
open NLP challenges\r\nneeded to be faced for service composition in On-The-Fly
Computing."
author:
- first_name: Frederik Simon
full_name: Bäumer, Frederik Simon
id: '38837'
last_name: Bäumer
- first_name: Michaela
full_name: Geierhos, Michaela
id: '42496'
last_name: Geierhos
orcid: 0000-0002-8180-5606
citation:
ama: 'Bäumer FS, Geierhos M. How to Deal with Inaccurate Service Descriptions in
On-The-Fly Computing: Open Challenges. In: Silberztein M, Atigui F, Kornyshova
E, Métais E, Meziane F, eds. Proceedings of the 23rd International Conference
on Natural Language and Information Systems. Vol 10859. Lecture Notes in Computer
Science. Cham, Switzerland: Springer; 2018:509-513. doi:10.1007/978-3-319-91947-8_53'
apa: 'Bäumer, F. S., & Geierhos, M. (2018). How to Deal with Inaccurate Service
Descriptions in On-The-Fly Computing: Open Challenges. In M. Silberztein, F. Atigui,
E. Kornyshova, E. Métais, & F. Meziane (Eds.), Proceedings of the 23rd
International Conference on Natural Language and Information Systems (Vol.
10859, pp. 509–513). Cham, Switzerland: Springer. https://doi.org/10.1007/978-3-319-91947-8_53'
bibtex: '@inbook{Bäumer_Geierhos_2018, place={Cham, Switzerland}, series={Lecture
Notes in Computer Science}, title={How to Deal with Inaccurate Service Descriptions
in On-The-Fly Computing: Open Challenges}, volume={10859}, DOI={10.1007/978-3-319-91947-8_53},
booktitle={Proceedings of the 23rd International Conference on Natural Language
and Information Systems}, publisher={Springer}, author={Bäumer, Frederik Simon
and Geierhos, Michaela}, editor={Silberztein, Max and Atigui, Faten and Kornyshova,
Elena and Métais, Elisabeth and Meziane, Farid Editors}, year={2018}, pages={509–513},
collection={Lecture Notes in Computer Science} }'
chicago: 'Bäumer, Frederik Simon, and Michaela Geierhos. “How to Deal with Inaccurate
Service Descriptions in On-The-Fly Computing: Open Challenges.” In Proceedings
of the 23rd International Conference on Natural Language and Information Systems,
edited by Max Silberztein, Faten Atigui, Elena Kornyshova, Elisabeth Métais,
and Farid Meziane, 10859:509–13. Lecture Notes in Computer Science. Cham, Switzerland:
Springer, 2018. https://doi.org/10.1007/978-3-319-91947-8_53.'
ieee: 'F. S. Bäumer and M. Geierhos, “How to Deal with Inaccurate Service Descriptions
in On-The-Fly Computing: Open Challenges,” in Proceedings of the 23rd International
Conference on Natural Language and Information Systems, vol. 10859, M. Silberztein,
F. Atigui, E. Kornyshova, E. Métais, and F. Meziane, Eds. Cham, Switzerland: Springer,
2018, pp. 509–513.'
mla: 'Bäumer, Frederik Simon, and Michaela Geierhos. “How to Deal with Inaccurate
Service Descriptions in On-The-Fly Computing: Open Challenges.” Proceedings
of the 23rd International Conference on Natural Language and Information Systems,
edited by Max Silberztein et al., vol. 10859, Springer, 2018, pp. 509–13, doi:10.1007/978-3-319-91947-8_53.'
short: 'F.S. Bäumer, M. Geierhos, in: M. Silberztein, F. Atigui, E. Kornyshova,
E. Métais, F. Meziane (Eds.), Proceedings of the 23rd International Conference
on Natural Language and Information Systems, Springer, Cham, Switzerland, 2018,
pp. 509–513.'
conference:
end_date: 2018-06-18
location: Paris, France
name: 23rd International Conference on Natural Language and Information Systems
start_date: 2018-06-13
date_created: 2018-04-13T08:54:56Z
date_updated: 2022-01-06T06:55:47Z
ddc:
- '000'
department:
- _id: '36'
- _id: '1'
- _id: '579'
doi: 10.1007/978-3-319-91947-8_53
editor:
- first_name: 'Max '
full_name: 'Silberztein, Max '
last_name: Silberztein
- first_name: 'Faten '
full_name: 'Atigui, Faten '
last_name: Atigui
- first_name: 'Elena '
full_name: 'Kornyshova, Elena '
last_name: Kornyshova
- first_name: 'Elisabeth '
full_name: 'Métais, Elisabeth '
last_name: Métais
- first_name: 'Farid '
full_name: 'Meziane, Farid '
last_name: Meziane
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T16:12:26Z
date_updated: 2018-11-02T16:12:26Z
file_id: '5326'
file_name: Bäumer-Geierhos2018_Chapter_HowToDealWithInaccurateService.pdf
file_size: 327508
relation: main_file
success: 1
file_date_updated: 2018-11-02T16:12:26Z
has_accepted_license: '1'
intvolume: ' 10859'
keyword:
- Requirements Extraction
- Temporal Reordering of Software Functions
- Inaccuracy Compensation
language:
- iso: eng
page: 509-513
place: Cham, Switzerland
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '9'
name: SFB 901 - Subproject B1
publication: Proceedings of the 23rd International Conference on Natural Language
and Information Systems
publication_identifier:
isbn:
- 978-3-319-91946-1
publication_status: published
publisher: Springer
quality_controlled: '1'
series_title: Lecture Notes in Computer Science
status: public
title: 'How to Deal with Inaccurate Service Descriptions in On-The-Fly Computing:
Open Challenges'
type: book_chapter
user_id: '477'
volume: 10859
year: '2018'
...