---
_id: '15422'
author:
- first_name: Nam
full_name: Ho, Nam
last_name: Ho
- first_name: Paul
full_name: Kaufmann, Paul
last_name: Kaufmann
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
citation:
ama: 'Ho N, Kaufmann P, Platzner M. Optimization of Application-specific L1 Cache
Translation Functions of the LEON3 Processor. In: World Congress on Nature
and Biologically Inspired Computing (NaBIC). Advances in Nature and Biologically
Inspired Computing. Springer; 2019.'
apa: Ho, N., Kaufmann, P., & Platzner, M. (2019). Optimization of Application-specific
L1 Cache Translation Functions of the LEON3 Processor. In World Congress on
Nature and Biologically Inspired Computing (NaBIC). Springer.
bibtex: '@inproceedings{Ho_Kaufmann_Platzner_2019, series={Advances in Nature and
Biologically Inspired Computing}, title={Optimization of Application-specific
L1 Cache Translation Functions of the LEON3 Processor}, booktitle={World Congress
on Nature and Biologically Inspired Computing (NaBIC)}, publisher={Springer},
author={Ho, Nam and Kaufmann, Paul and Platzner, Marco}, year={2019}, collection={Advances
in Nature and Biologically Inspired Computing} }'
chicago: Ho, Nam, Paul Kaufmann, and Marco Platzner. “Optimization of Application-Specific
L1 Cache Translation Functions of the LEON3 Processor.” In World Congress on
Nature and Biologically Inspired Computing (NaBIC). Advances in Nature and
Biologically Inspired Computing. Springer, 2019.
ieee: N. Ho, P. Kaufmann, and M. Platzner, “Optimization of Application-specific
L1 Cache Translation Functions of the LEON3 Processor,” in World Congress on
Nature and Biologically Inspired Computing (NaBIC), 2019.
mla: Ho, Nam, et al. “Optimization of Application-Specific L1 Cache Translation
Functions of the LEON3 Processor.” World Congress on Nature and Biologically
Inspired Computing (NaBIC), Springer, 2019.
short: 'N. Ho, P. Kaufmann, M. Platzner, in: World Congress on Nature and Biologically
Inspired Computing (NaBIC), Springer, 2019.'
date_created: 2019-12-30T13:55:49Z
date_updated: 2022-01-06T06:52:25Z
department:
- _id: '78'
language:
- iso: eng
publication: World Congress on Nature and Biologically Inspired Computing (NaBIC)
publisher: Springer
series_title: Advances in Nature and Biologically Inspired Computing
status: public
title: Optimization of Application-specific L1 Cache Translation Functions of the
LEON3 Processor
type: conference
user_id: '398'
year: '2019'
...
---
_id: '15430'
author:
- first_name: Enes
full_name: Yigitbas, Enes
id: '8447'
last_name: Yigitbas
orcid: 0000-0002-5967-833X
citation:
ama: Yigitbas E. Model-Driven Engineering of Self-Adaptive User Interfaces.;
2019.
apa: Yigitbas, E. (2019). Model-Driven Engineering of Self-Adaptive User Interfaces.
bibtex: '@book{Yigitbas_2019, title={Model-Driven Engineering of Self-Adaptive User
Interfaces}, author={Yigitbas, Enes}, year={2019} }'
chicago: Yigitbas, Enes. Model-Driven Engineering of Self-Adaptive User Interfaces,
2019.
ieee: E. Yigitbas, Model-Driven Engineering of Self-Adaptive User Interfaces.
2019.
mla: Yigitbas, Enes. Model-Driven Engineering of Self-Adaptive User Interfaces.
2019.
short: E. Yigitbas, Model-Driven Engineering of Self-Adaptive User Interfaces, 2019.
date_created: 2020-01-06T14:03:32Z
date_updated: 2022-01-06T06:52:25Z
department:
- _id: '66'
- _id: '534'
language:
- iso: eng
status: public
title: Model-Driven Engineering of Self-Adaptive User Interfaces
type: dissertation
user_id: '8447'
year: '2019'
...
---
_id: '15478'
abstract:
- lang: eng
text: Stratix 10 FPGA cards have a good potential for the acceleration of HPC workloads
since the Stratix 10 product line introduces devices with a large number of DSP
and memory blocks. The high level synthesis of OpenCL codes can play a fundamental
role for FPGAs in HPC, because it allows to implement different designs with lower
development effort compared to hand optimized HDL. However, Stratix 10 cards are
still hard to fully exploit using the Intel FPGA SDK for OpenCL. The implementation
of designs with thousands of concurrent arithmetic operations often suffers from
place and route problems that limit the maximum frequency or entirely prevent
a successful synthesis. In order to overcome these issues for the implementation
of the matrix multiplication, we formulate Cannon's matrix multiplication algorithm
with regard to its efficient synthesis within the FPGA logic. We obtain a two-level
block algorithm, where the lower level sub-matrices are multiplied using our Cannon's
algorithm implementation. Following this design approach with multiple compute
units, we are able to get maximum frequencies close to and above 300 MHz with
high utilization of DSP and memory blocks. This allows for performance results
above 1 TeraFLOPS.
author:
- first_name: Paolo
full_name: Gorlani, Paolo
id: '72045'
last_name: Gorlani
- first_name: Tobias
full_name: Kenter, Tobias
id: '3145'
last_name: Kenter
- first_name: Christian
full_name: Plessl, Christian
id: '16153'
last_name: Plessl
orcid: 0000-0001-5728-9982
citation:
ama: 'Gorlani P, Kenter T, Plessl C. OpenCL Implementation of Cannon’s Matrix Multiplication
Algorithm on Intel Stratix 10 FPGAs. In: Proceedings of the International Conference
on Field-Programmable Technology (FPT). IEEE; 2019. doi:10.1109/ICFPT47387.2019.00020'
apa: Gorlani, P., Kenter, T., & Plessl, C. (2019). OpenCL Implementation of
Cannon’s Matrix Multiplication Algorithm on Intel Stratix 10 FPGAs. In Proceedings
of the International Conference on Field-Programmable Technology (FPT). IEEE.
https://doi.org/10.1109/ICFPT47387.2019.00020
bibtex: '@inproceedings{Gorlani_Kenter_Plessl_2019, title={OpenCL Implementation
of Cannon’s Matrix Multiplication Algorithm on Intel Stratix 10 FPGAs}, DOI={10.1109/ICFPT47387.2019.00020},
booktitle={Proceedings of the International Conference on Field-Programmable Technology
(FPT)}, publisher={IEEE}, author={Gorlani, Paolo and Kenter, Tobias and Plessl,
Christian}, year={2019} }'
chicago: Gorlani, Paolo, Tobias Kenter, and Christian Plessl. “OpenCL Implementation
of Cannon’s Matrix Multiplication Algorithm on Intel Stratix 10 FPGAs.” In Proceedings
of the International Conference on Field-Programmable Technology (FPT). IEEE,
2019. https://doi.org/10.1109/ICFPT47387.2019.00020.
ieee: P. Gorlani, T. Kenter, and C. Plessl, “OpenCL Implementation of Cannon’s Matrix
Multiplication Algorithm on Intel Stratix 10 FPGAs,” in Proceedings of the
International Conference on Field-Programmable Technology (FPT), 2019.
mla: Gorlani, Paolo, et al. “OpenCL Implementation of Cannon’s Matrix Multiplication
Algorithm on Intel Stratix 10 FPGAs.” Proceedings of the International Conference
on Field-Programmable Technology (FPT), IEEE, 2019, doi:10.1109/ICFPT47387.2019.00020.
short: 'P. Gorlani, T. Kenter, C. Plessl, in: Proceedings of the International Conference
on Field-Programmable Technology (FPT), IEEE, 2019.'
conference:
name: International Conference on Field-Programmable Technology (FPT)
date_created: 2020-01-09T12:54:48Z
date_updated: 2022-01-06T06:52:26Z
ddc:
- '004'
department:
- _id: '27'
- _id: '518'
doi: 10.1109/ICFPT47387.2019.00020
file:
- access_level: closed
content_type: application/pdf
creator: plessl
date_created: 2020-01-09T12:53:57Z
date_updated: 2020-01-09T12:53:57Z
file_id: '15479'
file_name: gorlani19_fpt.pdf
file_size: 250559
relation: main_file
success: 1
file_date_updated: 2020-01-09T12:53:57Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '33'
grant_number: 01|H16005
name: HighPerMeshes
- _id: '32'
grant_number: PL 595/2-1
name: Performance and Efficiency in HPC with Custom Computing
publication: Proceedings of the International Conference on Field-Programmable Technology
(FPT)
publisher: IEEE
quality_controlled: '1'
status: public
title: OpenCL Implementation of Cannon's Matrix Multiplication Algorithm on Intel
Stratix 10 FPGAs
type: conference
user_id: '3145'
year: '2019'
...
---
_id: '15578'
author:
- first_name: Cruz
full_name: Izu, Cruz
last_name: Izu
- first_name: Carsten
full_name: Schulte, Carsten
id: '60311'
last_name: Schulte
- first_name: Ashish
full_name: Aggarwal, Ashish
last_name: Aggarwal
- first_name: Quintin
full_name: I. Cutts, Quintin
last_name: I. Cutts
- first_name: Rodrigo
full_name: Duran, Rodrigo
last_name: Duran
- first_name: Mirela
full_name: Gutica, Mirela
last_name: Gutica
- first_name: Birte
full_name: Heinemann, Birte
last_name: Heinemann
- first_name: Eileen
full_name: Kraemer, Eileen
last_name: Kraemer
- first_name: Violetta
full_name: Lonati, Violetta
last_name: Lonati
- first_name: Claudio
full_name: Mirolo, Claudio
last_name: Mirolo
- first_name: Renske
full_name: Weeda, Renske
last_name: Weeda
citation:
ama: 'Izu C, Schulte C, Aggarwal A, et al. Program Comprehension: Identifying Learning
Trajectories for Novice Programmers. In: Proceedings of the 2019 (ACM) Conference
on Innovation and Technology in Computer Science Education, Aberdeen, Scotland,
UK, July 15-17, 2019. ; 2019:261-262. doi:10.1145/3304221.3325531'
apa: 'Izu, C., Schulte, C., Aggarwal, A., I. Cutts, Q., Duran, R., Gutica, M., …
Weeda, R. (2019). Program Comprehension: Identifying Learning Trajectories for
Novice Programmers. In Proceedings of the 2019 (ACM) Conference on Innovation
and Technology in Computer Science Education, Aberdeen, Scotland, UK, July 15-17,
2019 (pp. 261–262). https://doi.org/10.1145/3304221.3325531'
bibtex: '@inproceedings{Izu_Schulte_Aggarwal_I. Cutts_Duran_Gutica_Heinemann_Kraemer_Lonati_Mirolo_et
al._2019, title={Program Comprehension: Identifying Learning Trajectories for
Novice Programmers}, DOI={10.1145/3304221.3325531},
booktitle={Proceedings of the 2019 (ACM) Conference on Innovation and Technology
in Computer Science Education, Aberdeen, Scotland, UK, July 15-17, 2019}, author={Izu,
Cruz and Schulte, Carsten and Aggarwal, Ashish and I. Cutts, Quintin and Duran,
Rodrigo and Gutica, Mirela and Heinemann, Birte and Kraemer, Eileen and Lonati,
Violetta and Mirolo, Claudio and et al.}, year={2019}, pages={261–262} }'
chicago: 'Izu, Cruz, Carsten Schulte, Ashish Aggarwal, Quintin I. Cutts, Rodrigo
Duran, Mirela Gutica, Birte Heinemann, et al. “Program Comprehension: Identifying
Learning Trajectories for Novice Programmers.” In Proceedings of the 2019 (ACM)
Conference on Innovation and Technology in Computer Science Education, Aberdeen,
Scotland, UK, July 15-17, 2019, 261–62, 2019. https://doi.org/10.1145/3304221.3325531.'
ieee: 'C. Izu et al., “Program Comprehension: Identifying Learning Trajectories
for Novice Programmers,” in Proceedings of the 2019 (ACM) Conference on Innovation
and Technology in Computer Science Education, Aberdeen, Scotland, UK, July 15-17,
2019, 2019, pp. 261–262.'
mla: 'Izu, Cruz, et al. “Program Comprehension: Identifying Learning Trajectories
for Novice Programmers.” Proceedings of the 2019 (ACM) Conference on Innovation
and Technology in Computer Science Education, Aberdeen, Scotland, UK, July 15-17,
2019, 2019, pp. 261–62, doi:10.1145/3304221.3325531.'
short: 'C. Izu, C. Schulte, A. Aggarwal, Q. I. Cutts, R. Duran, M. Gutica, B. Heinemann,
E. Kraemer, V. Lonati, C. Mirolo, R. Weeda, in: Proceedings of the 2019 (ACM)
Conference on Innovation and Technology in Computer Science Education, Aberdeen,
Scotland, UK, July 15-17, 2019, 2019, pp. 261–262.'
date_created: 2020-01-15T07:55:25Z
date_updated: 2022-01-06T06:52:29Z
department:
- _id: '67'
doi: 10.1145/3304221.3325531
language:
- iso: eng
page: 261-262
publication: Proceedings of the 2019 (ACM) Conference on Innovation and Technology
in Computer Science Education, Aberdeen, Scotland, UK, July 15-17, 2019
status: public
title: 'Program Comprehension: Identifying Learning Trajectories for Novice Programmers'
type: conference
user_id: '21145'
year: '2019'
...
---
_id: '15579'
author:
- first_name: Florian
full_name: Kapp, Florian
last_name: Kapp
- first_name: Carsten
full_name: Schulte, Carsten
id: '60311'
last_name: Schulte
citation:
ama: 'Kapp F, Schulte C. Einsatz von Jupyter Notebooks am Beispiel eines fiktiven
Kriminalfalls. In: Informatik für alle, 18. GI-Fachtagung Informatik und Schule,
(INFOS) 2019, 16.-18. September 2019, Dortmund. ; 2019:247-256. doi:10.18420/infos2019-c10'
apa: Kapp, F., & Schulte, C. (2019). Einsatz von Jupyter Notebooks am Beispiel
eines fiktiven Kriminalfalls. In Informatik für alle, 18. GI-Fachtagung Informatik
und Schule, (INFOS) 2019, 16.-18. September 2019, Dortmund (pp. 247–256).
https://doi.org/10.18420/infos2019-c10
bibtex: '@inproceedings{Kapp_Schulte_2019, title={Einsatz von Jupyter Notebooks
am Beispiel eines fiktiven Kriminalfalls}, DOI={10.18420/infos2019-c10},
booktitle={Informatik für alle, 18. GI-Fachtagung Informatik und Schule, (INFOS)
2019, 16.-18. September 2019, Dortmund}, author={Kapp, Florian and Schulte, Carsten},
year={2019}, pages={247–256} }'
chicago: Kapp, Florian, and Carsten Schulte. “Einsatz von Jupyter Notebooks am Beispiel
eines fiktiven Kriminalfalls.” In Informatik für alle, 18. GI-Fachtagung Informatik
und Schule, (INFOS) 2019, 16.-18. September 2019, Dortmund, 247–56, 2019.
https://doi.org/10.18420/infos2019-c10.
ieee: F. Kapp and C. Schulte, “Einsatz von Jupyter Notebooks am Beispiel eines fiktiven
Kriminalfalls,” in Informatik für alle, 18. GI-Fachtagung Informatik und Schule,
(INFOS) 2019, 16.-18. September 2019, Dortmund, 2019, pp. 247–256.
mla: Kapp, Florian, and Carsten Schulte. “Einsatz von Jupyter Notebooks am Beispiel
eines fiktiven Kriminalfalls.” Informatik für alle, 18. GI-Fachtagung Informatik
und Schule, (INFOS) 2019, 16.-18. September 2019, Dortmund, 2019, pp. 247–56,
doi:10.18420/infos2019-c10.
short: 'F. Kapp, C. Schulte, in: Informatik für alle, 18. GI-Fachtagung Informatik
und Schule, (INFOS) 2019, 16.-18. September 2019, Dortmund, 2019, pp. 247–256.'
date_created: 2020-01-15T08:05:13Z
date_updated: 2022-01-06T06:52:29Z
department:
- _id: '67'
doi: 10.18420/infos2019-c10
language:
- iso: ger
page: 247-256
publication: Informatik für alle, 18. GI-Fachtagung Informatik und Schule, (INFOS)
2019, 16.-18. September 2019, Dortmund
status: public
title: Einsatz von Jupyter Notebooks am Beispiel eines fiktiven Kriminalfalls
type: conference
user_id: '21145'
year: '2019'
...
---
_id: '15581'
author:
- first_name: Kathrin
full_name: Müller, Kathrin
last_name: Müller
- first_name: Carsten
full_name: Schulte, Carsten
id: '60311'
last_name: Schulte
- first_name: Johannes
full_name: Magenheim, Johannes
last_name: Magenheim
citation:
ama: 'Müller K, Schulte C, Magenheim J. Zur Relevanz eines Prozessbereiches Interaktion
und Exploration im Kontext informatischer Bildung im Primarbereich. In: Informatik
für alle, 18. GI-Fachtagung Informatik und Schule, (INFOS) 2019, 16.-18. September
2019, Dortmund. ; 2019:139-148. doi:10.18420/infos2019-b10'
apa: Müller, K., Schulte, C., & Magenheim, J. (2019). Zur Relevanz eines Prozessbereiches
Interaktion und Exploration im Kontext informatischer Bildung im Primarbereich.
In Informatik für alle, 18. GI-Fachtagung Informatik und Schule, (INFOS) 2019,
16.-18. September 2019, Dortmund (pp. 139–148). https://doi.org/10.18420/infos2019-b10
bibtex: '@inproceedings{Müller_Schulte_Magenheim_2019, title={Zur Relevanz eines
Prozessbereiches Interaktion und Exploration im Kontext informatischer Bildung
im Primarbereich}, DOI={10.18420/infos2019-b10},
booktitle={Informatik für alle, 18. GI-Fachtagung Informatik und Schule, (INFOS)
2019, 16.-18. September 2019, Dortmund}, author={Müller, Kathrin and Schulte,
Carsten and Magenheim, Johannes}, year={2019}, pages={139–148} }'
chicago: Müller, Kathrin, Carsten Schulte, and Johannes Magenheim. “Zur Relevanz
eines Prozessbereiches Interaktion und Exploration im Kontext informatischer Bildung
im Primarbereich.” In Informatik für alle, 18. GI-Fachtagung Informatik und
Schule, (INFOS) 2019, 16.-18. September 2019, Dortmund, 139–48, 2019. https://doi.org/10.18420/infos2019-b10.
ieee: K. Müller, C. Schulte, and J. Magenheim, “Zur Relevanz eines Prozessbereiches
Interaktion und Exploration im Kontext informatischer Bildung im Primarbereich,”
in Informatik für alle, 18. GI-Fachtagung Informatik und Schule, (INFOS) 2019,
16.-18. September 2019, Dortmund, 2019, pp. 139–148.
mla: Müller, Kathrin, et al. “Zur Relevanz eines Prozessbereiches Interaktion und
Exploration im Kontext informatischer Bildung im Primarbereich.” Informatik
für alle, 18. GI-Fachtagung Informatik und Schule, (INFOS) 2019, 16.-18. September
2019, Dortmund, 2019, pp. 139–48, doi:10.18420/infos2019-b10.
short: 'K. Müller, C. Schulte, J. Magenheim, in: Informatik für alle, 18. GI-Fachtagung
Informatik und Schule, (INFOS) 2019, 16.-18. September 2019, Dortmund, 2019, pp.
139–148.'
date_created: 2020-01-15T08:34:49Z
date_updated: 2022-01-06T06:52:29Z
department:
- _id: '67'
doi: 10.18420/infos2019-b10
language:
- iso: ger
page: 139-148
publication: Informatik für alle, 18. GI-Fachtagung Informatik und Schule, (INFOS)
2019, 16.-18. September 2019, Dortmund
status: public
title: Zur Relevanz eines Prozessbereiches Interaktion und Exploration im Kontext
informatischer Bildung im Primarbereich
type: conference
user_id: '21145'
year: '2019'
...
---
_id: '15583'
author:
- first_name: Ann-Katrin
full_name: Schmidt, Ann-Katrin
last_name: Schmidt
- first_name: Carsten
full_name: Schulte, Carsten
id: '60311'
last_name: Schulte
citation:
ama: 'Schmidt A-K, Schulte C. Das RetiBNE Café. In: Informatik für alle, 18.
GI-Fachtagung Informatik und Schule, (INFOS) 2019, 16.-18. September 2019, Dortmund.
; 2019:315-324. doi:10.18420/infos2019-c17'
apa: Schmidt, A.-K., & Schulte, C. (2019). Das RetiBNE Café. In Informatik
für alle, 18. GI-Fachtagung Informatik und Schule, (INFOS) 2019, 16.-18. September
2019, Dortmund (pp. 315–324). https://doi.org/10.18420/infos2019-c17
bibtex: '@inproceedings{Schmidt_Schulte_2019, title={Das RetiBNE Café}, DOI={10.18420/infos2019-c17}, booktitle={Informatik
für alle, 18. GI-Fachtagung Informatik und Schule, (INFOS) 2019, 16.-18. September
2019, Dortmund}, author={Schmidt, Ann-Katrin and Schulte, Carsten}, year={2019},
pages={315–324} }'
chicago: Schmidt, Ann-Katrin, and Carsten Schulte. “Das RetiBNE Café.” In Informatik
für alle, 18. GI-Fachtagung Informatik und Schule, (INFOS) 2019, 16.-18. September
2019, Dortmund, 315–24, 2019. https://doi.org/10.18420/infos2019-c17.
ieee: A.-K. Schmidt and C. Schulte, “Das RetiBNE Café,” in Informatik für alle,
18. GI-Fachtagung Informatik und Schule, (INFOS) 2019, 16.-18. September 2019,
Dortmund, 2019, pp. 315–324.
mla: Schmidt, Ann-Katrin, and Carsten Schulte. “Das RetiBNE Café.” Informatik
für alle, 18. GI-Fachtagung Informatik und Schule, (INFOS) 2019, 16.-18. September
2019, Dortmund, 2019, pp. 315–24, doi:10.18420/infos2019-c17.
short: 'A.-K. Schmidt, C. Schulte, in: Informatik für alle, 18. GI-Fachtagung Informatik
und Schule, (INFOS) 2019, 16.-18. September 2019, Dortmund, 2019, pp. 315–324.'
date_created: 2020-01-15T08:43:51Z
date_updated: 2022-01-06T06:52:30Z
department:
- _id: '67'
doi: 10.18420/infos2019-c17
language:
- iso: ger
page: 315-324
publication: Informatik für alle, 18. GI-Fachtagung Informatik und Schule, (INFOS)
2019, 16.-18. September 2019, Dortmund
status: public
title: Das RetiBNE Café
type: conference
user_id: '21145'
year: '2019'
...
---
_id: '15720'
author:
- first_name: Adrian
full_name: Wilke, Adrian
id: '9101'
last_name: Wilke
orcid: 0000-0002-6575-807X
- first_name: Johannes
full_name: Magenheim, Johannes
last_name: Magenheim
citation:
ama: 'Wilke A, Magenheim J. Critical Incidents for Technology Enhanced Learning
in Vocational Education and Training. In: IEEE Global Engineering Education
Conference, EDUCON 2019, Dubai, United Arab Emirates, April 8-11, 2019. ;
2019:892-899. doi:10.1109/EDUCON.2019.8725025'
apa: Wilke, A., & Magenheim, J. (2019). Critical Incidents for Technology Enhanced
Learning in Vocational Education and Training. In IEEE Global Engineering Education
Conference, EDUCON 2019, Dubai, United Arab Emirates, April 8-11, 2019 (pp.
892–899). https://doi.org/10.1109/EDUCON.2019.8725025
bibtex: '@inproceedings{Wilke_Magenheim_2019, title={Critical Incidents for Technology
Enhanced Learning in Vocational Education and Training}, DOI={10.1109/EDUCON.2019.8725025},
booktitle={IEEE Global Engineering Education Conference, EDUCON 2019, Dubai, United
Arab Emirates, April 8-11, 2019}, author={Wilke, Adrian and Magenheim, Johannes},
year={2019}, pages={892–899} }'
chicago: Wilke, Adrian, and Johannes Magenheim. “Critical Incidents for Technology
Enhanced Learning in Vocational Education and Training.” In IEEE Global Engineering
Education Conference, EDUCON 2019, Dubai, United Arab Emirates, April 8-11, 2019,
892–99, 2019. https://doi.org/10.1109/EDUCON.2019.8725025.
ieee: A. Wilke and J. Magenheim, “Critical Incidents for Technology Enhanced Learning
in Vocational Education and Training,” in IEEE Global Engineering Education
Conference, EDUCON 2019, Dubai, United Arab Emirates, April 8-11, 2019, 2019,
pp. 892–899.
mla: Wilke, Adrian, and Johannes Magenheim. “Critical Incidents for Technology Enhanced
Learning in Vocational Education and Training.” IEEE Global Engineering Education
Conference, EDUCON 2019, Dubai, United Arab Emirates, April 8-11, 2019, 2019,
pp. 892–99, doi:10.1109/EDUCON.2019.8725025.
short: 'A. Wilke, J. Magenheim, in: IEEE Global Engineering Education Conference,
EDUCON 2019, Dubai, United Arab Emirates, April 8-11, 2019, 2019, pp. 892–899.'
date_created: 2020-01-30T10:39:45Z
date_updated: 2022-01-06T06:52:32Z
department:
- _id: '67'
doi: 10.1109/EDUCON.2019.8725025
language:
- iso: eng
page: 892-899
publication: IEEE Global Engineering Education Conference, EDUCON 2019, Dubai, United
Arab Emirates, April 8-11, 2019
status: public
title: Critical Incidents for Technology Enhanced Learning in Vocational Education
and Training
type: conference
user_id: '21145'
year: '2019'
...
---
_id: '15721'
author:
- first_name: Olaf
full_name: Köller, Olaf
last_name: Köller
- first_name: Johannes
full_name: Magenheim, Johannes
last_name: Magenheim
- first_name: Heike
full_name: Molitor, Heike
last_name: Molitor
- first_name: Uwe
full_name: Pfenning, Uwe
last_name: Pfenning
- first_name: J{\
full_name: Ramseger, J{\
last_name: Ramseger
- first_name: Mirjam
full_name: Steffensky, Mirjam
last_name: Steffensky
- first_name: Christian
full_name: Wiesmüller, Christian
last_name: Wiesmüller
- first_name: Esther
full_name: Winther, Esther
last_name: Winther
- first_name: Bernd
full_name: Wollring, Bernd
last_name: Wollring
citation:
ama: Köller O, Magenheim J, Molitor H, et al. Zieldimensionen Für Multiplikatorinnen
Und Multiplikatoren Früher MINT-Bildung. Verlag Barbara Budrich; 2019.
apa: Köller, O., Magenheim, J., Molitor, H., Pfenning, U., Ramseger, J., Steffensky,
M., … Wollring, B. (2019). Zieldimensionen für Multiplikatorinnen und Multiplikatoren
früher MINT-Bildung. Verlag Barbara Budrich.
bibtex: '@book{Köller_Magenheim_Molitor_Pfenning_Ramseger_Steffensky_Wiesmüller_Winther_Wollring_2019,
title={Zieldimensionen für Multiplikatorinnen und Multiplikatoren früher MINT-Bildung},
publisher={Verlag Barbara Budrich}, author={Köller, Olaf and Magenheim, Johannes
and Molitor, Heike and Pfenning, Uwe and Ramseger, J{\ and Steffensky, Mirjam
and Wiesmüller, Christian and Winther, Esther and Wollring, Bernd}, year={2019}
}'
chicago: Köller, Olaf, Johannes Magenheim, Heike Molitor, Uwe Pfenning, J{\ Ramseger,
Mirjam Steffensky, Christian Wiesmüller, Esther Winther, and Bernd Wollring. Zieldimensionen
Für Multiplikatorinnen Und Multiplikatoren Früher MINT-Bildung. Verlag Barbara
Budrich, 2019.
ieee: O. Köller et al., Zieldimensionen für Multiplikatorinnen und Multiplikatoren
früher MINT-Bildung. Verlag Barbara Budrich, 2019.
mla: Köller, Olaf, et al. Zieldimensionen Für Multiplikatorinnen Und Multiplikatoren
Früher MINT-Bildung. Verlag Barbara Budrich, 2019.
short: O. Köller, J. Magenheim, H. Molitor, U. Pfenning, J. Ramseger, M. Steffensky,
C. Wiesmüller, E. Winther, B. Wollring, Zieldimensionen Für Multiplikatorinnen
Und Multiplikatoren Früher MINT-Bildung, Verlag Barbara Budrich, 2019.
date_created: 2020-01-30T10:46:26Z
date_updated: 2022-01-06T06:52:32Z
department:
- _id: '67'
language:
- iso: eng
publisher: Verlag Barbara Budrich
status: public
title: Zieldimensionen für Multiplikatorinnen und Multiplikatoren früher MINT-Bildung
type: book
user_id: '21145'
year: '2019'
...
---
_id: '15741'
abstract:
- lang: eng
text: "\r\nIn many cyber–physical systems, we encounter the problem of remote state
estimation of geo- graphically distributed and remote physical processes. This
paper studies the scheduling of sensor transmissions to estimate the states of
multiple remote, dynamic processes. Information from the different sensors has
to be transmitted to a central gateway over a wireless network for monitoring
purposes, where typically fewer wireless channels are available than there are
processes to be monitored. For effective estimation at the gateway, the sensors
need to be scheduled appropriately, i.e., at each time instant one needs to decide
which sensors have network access and which ones do not. To address this scheduling
problem, we formulate an associated Markov decision process (MDP). This MDP is
then solved using a Deep Q-Network, a recent deep reinforcement learning algorithm
that is at once scalable and model-free. We compare our scheduling algorithm to
popular scheduling algorithms such as round-robin and reduced-waiting-time, among
others. Our algorithm is shown to significantly outperform these algorithms for
many example scenario"
article_number: '108759'
author:
- first_name: Alex S.
full_name: Leong, Alex S.
last_name: Leong
- first_name: Arunselvan
full_name: Ramaswamy, Arunselvan
id: '66937'
last_name: Ramaswamy
orcid: https://orcid.org/ 0000-0001-7547-8111
- first_name: Daniel E.
full_name: Quevedo, Daniel E.
last_name: Quevedo
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
- first_name: Ling
full_name: Shi, Ling
last_name: Shi
citation:
ama: Leong AS, Ramaswamy A, Quevedo DE, Karl H, Shi L. Deep reinforcement learning
for wireless sensor scheduling in cyber–physical systems. Automatica. 2019.
doi:10.1016/j.automatica.2019.108759
apa: Leong, A. S., Ramaswamy, A., Quevedo, D. E., Karl, H., & Shi, L. (2019).
Deep reinforcement learning for wireless sensor scheduling in cyber–physical systems.
Automatica. https://doi.org/10.1016/j.automatica.2019.108759
bibtex: '@article{Leong_Ramaswamy_Quevedo_Karl_Shi_2019, title={Deep reinforcement
learning for wireless sensor scheduling in cyber–physical systems}, DOI={10.1016/j.automatica.2019.108759},
number={108759}, journal={Automatica}, author={Leong, Alex S. and Ramaswamy, Arunselvan
and Quevedo, Daniel E. and Karl, Holger and Shi, Ling}, year={2019} }'
chicago: Leong, Alex S., Arunselvan Ramaswamy, Daniel E. Quevedo, Holger Karl, and
Ling Shi. “Deep Reinforcement Learning for Wireless Sensor Scheduling in Cyber–Physical
Systems.” Automatica, 2019. https://doi.org/10.1016/j.automatica.2019.108759.
ieee: A. S. Leong, A. Ramaswamy, D. E. Quevedo, H. Karl, and L. Shi, “Deep reinforcement
learning for wireless sensor scheduling in cyber–physical systems,” Automatica,
2019.
mla: Leong, Alex S., et al. “Deep Reinforcement Learning for Wireless Sensor Scheduling
in Cyber–Physical Systems.” Automatica, 108759, 2019, doi:10.1016/j.automatica.2019.108759.
short: A.S. Leong, A. Ramaswamy, D.E. Quevedo, H. Karl, L. Shi, Automatica (2019).
date_created: 2020-01-31T15:55:27Z
date_updated: 2022-01-06T06:52:32Z
ddc:
- '000'
department:
- _id: '7'
- _id: '34'
- _id: '3'
- _id: '75'
- _id: '57'
doi: 10.1016/j.automatica.2019.108759
file:
- access_level: closed
content_type: application/pdf
creator: hkarl
date_created: 2020-01-31T15:57:50Z
date_updated: 2020-01-31T15:57:50Z
file_id: '15743'
file_name: leoram20a.pdf
file_size: '675382'
relation: main_file
success: 1
file_date_updated: 2020-01-31T15:57:50Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '24'
name: Netzgewahre Regelung & regelungsgewahre Netze
publication: Automatica
publication_identifier:
issn:
- 0005-1098
publication_status: published
quality_controlled: '1'
status: public
title: Deep reinforcement learning for wireless sensor scheduling in cyber–physical
systems
type: journal_article
user_id: '126'
year: '2019'
...
---
_id: '15746'
author:
- first_name: Oliver
full_name: Otte, Oliver
last_name: Otte
citation:
ama: Otte O. Outsourced Decryption of Attribute-Based Ciphertexts.; 2019.
apa: Otte, O. (2019). Outsourced Decryption of Attribute-based Ciphertexts.
bibtex: '@book{Otte_2019, title={Outsourced Decryption of Attribute-based Ciphertexts},
author={Otte, Oliver}, year={2019} }'
chicago: Otte, Oliver. Outsourced Decryption of Attribute-Based Ciphertexts,
2019.
ieee: O. Otte, Outsourced Decryption of Attribute-based Ciphertexts. 2019.
mla: Otte, Oliver. Outsourced Decryption of Attribute-Based Ciphertexts.
2019.
short: O. Otte, Outsourced Decryption of Attribute-Based Ciphertexts, 2019.
date_created: 2020-02-03T09:43:19Z
date_updated: 2022-01-06T06:52:32Z
department:
- _id: '64'
language:
- iso: eng
status: public
title: Outsourced Decryption of Attribute-based Ciphertexts
type: mastersthesis
user_id: '13703'
year: '2019'
...
---
_id: '15747'
author:
- first_name: Nico Christof
full_name: Wördenweber, Nico Christof
last_name: Wördenweber
citation:
ama: Wördenweber NC. On the Security of the Rouselakis-Waters Ciphertext-Policy
Attribute-Based Encryption Scheme in the Random Oracle Model.; 2019.
apa: Wördenweber, N. C. (2019). On the Security of the Rouselakis-Waters Ciphertext-Policy
Attribute-Based Encryption Scheme in the Random Oracle Model.
bibtex: '@book{Wördenweber_2019, title={On the Security of the Rouselakis-Waters
Ciphertext-Policy Attribute-Based Encryption Scheme in the Random Oracle Model},
author={Wördenweber, Nico Christof}, year={2019} }'
chicago: Wördenweber, Nico Christof. On the Security of the Rouselakis-Waters
Ciphertext-Policy Attribute-Based Encryption Scheme in the Random Oracle Model,
2019.
ieee: N. C. Wördenweber, On the Security of the Rouselakis-Waters Ciphertext-Policy
Attribute-Based Encryption Scheme in the Random Oracle Model. 2019.
mla: Wördenweber, Nico Christof. On the Security of the Rouselakis-Waters Ciphertext-Policy
Attribute-Based Encryption Scheme in the Random Oracle Model. 2019.
short: N.C. Wördenweber, On the Security of the Rouselakis-Waters Ciphertext-Policy
Attribute-Based Encryption Scheme in the Random Oracle Model, 2019.
date_created: 2020-02-03T09:45:01Z
date_updated: 2022-01-06T06:52:32Z
department:
- _id: '64'
language:
- iso: eng
status: public
title: On the Security of the Rouselakis-Waters Ciphertext-Policy Attribute-Based
Encryption Scheme in the Random Oracle Model
type: bachelorsthesis
user_id: '13703'
year: '2019'
...
---
_id: '15819'
author:
- first_name: Matthias
full_name: Leutnant, Matthias
last_name: Leutnant
citation:
ama: Leutnant M. Experimentelle Untersuchung Des SEM-Algorithmus.; 2019.
apa: Leutnant, M. (2019). Experimentelle Untersuchung des SEM-Algorithmus.
bibtex: '@book{Leutnant_2019, title={Experimentelle Untersuchung des SEM-Algorithmus},
author={Leutnant, Matthias}, year={2019} }'
chicago: Leutnant, Matthias. Experimentelle Untersuchung Des SEM-Algorithmus,
2019.
ieee: M. Leutnant, Experimentelle Untersuchung des SEM-Algorithmus. 2019.
mla: Leutnant, Matthias. Experimentelle Untersuchung Des SEM-Algorithmus.
2019.
short: M. Leutnant, Experimentelle Untersuchung Des SEM-Algorithmus, 2019.
date_created: 2020-02-06T08:51:51Z
date_updated: 2022-01-06T06:52:37Z
department:
- _id: '64'
language:
- iso: eng
status: public
supervisor:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
title: Experimentelle Untersuchung des SEM-Algorithmus
type: bachelorsthesis
user_id: '13291'
year: '2019'
...
---
_id: '15838'
abstract:
- lang: eng
text: In the field of software analysis a trade-off between scalability and accuracy
always exists. In this respect, Android app analysis is no exception, in particular,
analyzing large or many apps can be challenging. Dealing with many small apps
is a typical challenge when facing micro-benchmarks such as DROIDBENCH or ICC-BENCH.
These particular benchmarks are not only used for the evaluation of novel tools
but also in continuous integration pipelines of existing mature tools to maintain
and guarantee a certain quality-level. Considering this latter usage it becomes
very important to be able to achieve benchmark results as fast as possible. Hence,
benchmarks have to be optimized for this purpose. One approach to do so is app
merging. We implemented the Android Merge Tool (AMT) following this approach and
show that its novel aspects can be used to produce scaled up and accurate benchmarks.
For such benchmarks Android app analysis tools do not suffer from the scalability-accuracy
trade-off anymore. We show this throughout detailed experiments on DROIDBENCH
employing three different analysis tools (AMANDROID, ICCTA, FLOWDROID). Benchmark
execution times are largely reduced without losing benchmark accuracy. Moreover,
we argue why AMT is an advantageous successor of the state-of-the-art app merging
tool (APKCOMBINER) in analysis lift-up scenarios.
author:
- first_name: Felix
full_name: Pauck, Felix
id: '22398'
last_name: Pauck
- first_name: Shikun
full_name: Zhang, Shikun
last_name: Zhang
citation:
ama: 'Pauck F, Zhang S. Android App Merging for Benchmark Speed-Up and Analysis
Lift-Up. In: 2019 34th IEEE/ACM International Conference on Automated Software
Engineering Workshop (ASEW). ; 2019. doi:10.1109/asew.2019.00019'
apa: Pauck, F., & Zhang, S. (2019). Android App Merging for Benchmark Speed-Up
and Analysis Lift-Up. In 2019 34th IEEE/ACM International Conference on Automated
Software Engineering Workshop (ASEW). https://doi.org/10.1109/asew.2019.00019
bibtex: '@inproceedings{Pauck_Zhang_2019, title={Android App Merging for Benchmark
Speed-Up and Analysis Lift-Up}, DOI={10.1109/asew.2019.00019},
booktitle={2019 34th IEEE/ACM International Conference on Automated Software Engineering
Workshop (ASEW)}, author={Pauck, Felix and Zhang, Shikun}, year={2019} }'
chicago: Pauck, Felix, and Shikun Zhang. “Android App Merging for Benchmark Speed-Up
and Analysis Lift-Up.” In 2019 34th IEEE/ACM International Conference on Automated
Software Engineering Workshop (ASEW), 2019. https://doi.org/10.1109/asew.2019.00019.
ieee: F. Pauck and S. Zhang, “Android App Merging for Benchmark Speed-Up and Analysis
Lift-Up,” in 2019 34th IEEE/ACM International Conference on Automated Software
Engineering Workshop (ASEW), 2019.
mla: Pauck, Felix, and Shikun Zhang. “Android App Merging for Benchmark Speed-Up
and Analysis Lift-Up.” 2019 34th IEEE/ACM International Conference on Automated
Software Engineering Workshop (ASEW), 2019, doi:10.1109/asew.2019.00019.
short: 'F. Pauck, S. Zhang, in: 2019 34th IEEE/ACM International Conference on Automated
Software Engineering Workshop (ASEW), 2019.'
date_created: 2020-02-06T17:06:51Z
date_updated: 2022-01-06T06:52:38Z
ddc:
- '004'
department:
- _id: '77'
doi: 10.1109/asew.2019.00019
file:
- access_level: closed
content_type: application/pdf
creator: fpauck
date_created: 2020-02-06T17:09:45Z
date_updated: 2020-02-06T17:09:45Z
file_id: '15839'
file_name: AMT_final.pdf
file_size: 644517
relation: main_file
file_date_updated: 2020-02-06T17:09:45Z
has_accepted_license: '1'
keyword:
- Program Analysis
- Android App Analysis
- Taint Analysis
- App Merging
- Benchmark
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: 2019 34th IEEE/ACM International Conference on Automated Software Engineering
Workshop (ASEW)
publication_identifier:
isbn:
- '9781728141367'
publication_status: published
status: public
title: Android App Merging for Benchmark Speed-Up and Analysis Lift-Up
type: conference
user_id: '477'
year: '2019'
...
---
_id: '15883'
author:
- first_name: Shankar
full_name: Kumar Jeyakumar, Shankar
last_name: Kumar Jeyakumar
citation:
ama: Kumar Jeyakumar S. Incremental Learning with Support Vector Machine on Embedded
Platforms.; 2019.
apa: Kumar Jeyakumar, S. (2019). Incremental learning with Support Vector Machine
on embedded platforms.
bibtex: '@book{Kumar Jeyakumar_2019, title={Incremental learning with Support Vector
Machine on embedded platforms}, author={Kumar Jeyakumar, Shankar}, year={2019}
}'
chicago: Kumar Jeyakumar, Shankar. Incremental Learning with Support Vector Machine
on Embedded Platforms, 2019.
ieee: S. Kumar Jeyakumar, Incremental learning with Support Vector Machine on
embedded platforms. 2019.
mla: Kumar Jeyakumar, Shankar. Incremental Learning with Support Vector Machine
on Embedded Platforms. 2019.
short: S. Kumar Jeyakumar, Incremental Learning with Support Vector Machine on Embedded
Platforms, 2019.
date_created: 2020-02-11T16:43:38Z
date_updated: 2022-01-06T06:52:39Z
department:
- _id: '78'
language:
- iso: eng
status: public
supervisor:
- first_name: Hassan
full_name: Ghasemzadeh Mohammadi, Hassan
id: '61186'
last_name: Ghasemzadeh Mohammadi
title: Incremental learning with Support Vector Machine on embedded platforms
type: mastersthesis
user_id: '61186'
year: '2019'
...
---
_id: '15920'
abstract:
- lang: eng
text: "Secure hardware design is the most important aspect to be considered in addition
to functional correctness. Achieving hardware security in today’s globalized Integrated
Cir- cuit(IC) supply chain is a challenging task. One solution that is widely
considered to help achieve secure hardware designs is Information Flow Tracking(IFT).
It provides an ap- proach to verify that the systems adhere to security properties
either by static verification during design phase or dynamic checking during runtime.\r\nProof-Carrying
Hardware(PCH) is an approach to verify a functional design prior to using it in
hardware. It is a two-party verification approach, where the target party, the
consumer requests new functionalities with pre-defined properties to the producer.
In response, the producer designs the IP (Intellectual Property) cores with the
requested functionalities that adhere to the consumer-defined properties. The
producer provides the IP cores and a proof certificate combined into a proof-carrying
bitstream to the consumer to verify it. If the verification is successful, the
consumer can use the IP cores in his hardware. In essence, the consumer can only
run verified IP cores. Correctly applied, PCH techniques can help consumers to
defend against many unintentional modifications and malicious alterations of the
modules they receive. There are numerous published examples of how to use PCH
to detect any change in the functionality of a circuit, i.e., pairing a PCH approach
with functional equivalence checking for combinational or sequential circuits.
For non-functional properties, since opening new covert channels to leak secret
information from secure circuits is a viable attack vector for hardware trojans,
i.e., intentionally added malicious circuitry, IFT technique is employed to make
sure that secret/untrusted information never reaches any unclassified/trusted
outputs.\r\nThis master thesis aims to explore the possibility of adapting Information
Flow Tracking into a Proof-Carrying Hardware scenario. It aims to create a method
that combines Infor- mation Flow Tracking(IFT) with a PCH approach at bitstream
level enabling consumers to validate the trustworthiness of a module’s information
flow without the computational costs of a complete flow analysis."
author:
- first_name: Monica
full_name: Keerthipati, Monica
last_name: Keerthipati
citation:
ama: Keerthipati M. A Bitstream-Level Proof-Carrying Hardware Technique for Information
Flow Tracking. Universität Paderborn; 2019.
apa: Keerthipati, M. (2019). A Bitstream-Level Proof-Carrying Hardware Technique
for Information Flow Tracking. Universität Paderborn.
bibtex: '@book{Keerthipati_2019, title={A Bitstream-Level Proof-Carrying Hardware
Technique for Information Flow Tracking}, publisher={Universität Paderborn}, author={Keerthipati,
Monica}, year={2019} }'
chicago: Keerthipati, Monica. A Bitstream-Level Proof-Carrying Hardware Technique
for Information Flow Tracking. Universität Paderborn, 2019.
ieee: M. Keerthipati, A Bitstream-Level Proof-Carrying Hardware Technique for
Information Flow Tracking. Universität Paderborn, 2019.
mla: Keerthipati, Monica. A Bitstream-Level Proof-Carrying Hardware Technique
for Information Flow Tracking. Universität Paderborn, 2019.
short: M. Keerthipati, A Bitstream-Level Proof-Carrying Hardware Technique for Information
Flow Tracking, Universität Paderborn, 2019.
date_created: 2020-02-17T12:03:40Z
date_updated: 2022-01-06T06:52:41Z
department:
- _id: '78'
language:
- iso: eng
project:
- _id: '12'
name: SFB 901 - Subproject B4
- _id: '3'
name: SFB 901 - Project Area B
- _id: '1'
name: SFB 901
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Tobias
full_name: Wiersema, Tobias
id: '3118'
last_name: Wiersema
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
- first_name: Sybille
full_name: Hellebrand, Sybille
id: '209'
last_name: Hellebrand
orcid: 0000-0002-3717-3939
title: A Bitstream-Level Proof-Carrying Hardware Technique for Information Flow Tracking
type: mastersthesis
user_id: '477'
year: '2019'
...
---
_id: '15921'
abstract:
- lang: eng
text: "Ranking plays a central role in a large number of applications driven by
RDF knowledge graphs. Over the last years, many popular RDF knowledge graphs have
grown so large that rankings for the facts they contain cannot be computed directly
using the currently common 64-bit platforms. In this paper, we tackle two problems:\r\nComputing
ranks on such large knowledge bases efficiently and incrementally. First, we present
D-HARE, a distributed approach for computing ranks on very large knowledge graphs.
D-HARE assumes the random surfer model and relies on data partitioning to compute
matrix multiplications and transpositions on disk for matrices of arbitrary size.
Moreover, the data partitioning underlying D-HARE allows the execution of most
of its steps in parallel.\r\nAs very large knowledge graphs are often updated
periodically, we tackle the incremental computation of ranks on large knowledge
bases as a second problem. We address this problem by presenting\r\nI-HARE, an
approximation technique for calculating the overall ranking scores of a knowledge
without the need to recalculate the ranking from scratch at each new revision.
We evaluate our approaches by calculating ranks on the 3 × 10^9 and 2.4 × 10^9
triples from Wikidata resp. LinkedGeoData. Our evaluation demonstrates\r\nthat
D-HARE is the first holistic approach for computing ranks on very large RDF knowledge
graphs. In addition, our incremental approach achieves a root mean squared error
of less than 10E−7 in the best case. Both D-HARE\r\n and I-HARE are open-source
and are available at: https://github.com/dice-group/incrementalHARE.\r\n"
author:
- first_name: Abdelmoneim Amer
full_name: Desouki, Abdelmoneim Amer
last_name: Desouki
- first_name: Michael
full_name: Röder, Michael
last_name: Röder
- first_name: Axel-Cyrille
full_name: Ngonga Ngomo, Axel-Cyrille
last_name: Ngonga Ngomo
citation:
ama: 'Desouki AA, Röder M, Ngonga Ngomo A-C. Ranking on Very Large Knowledge Graphs.
In: Proceedings of the 30th ACM Conference on Hypertext and Social Media -
HT ’19. ACM; 2019:163-171. doi:10.1145/3342220.3343660'
apa: Desouki, A. A., Röder, M., & Ngonga Ngomo, A.-C. (2019). Ranking on Very
Large Knowledge Graphs. In Proceedings of the 30th ACM Conference on Hypertext
and Social Media - HT ’19 (pp. 163–171). ACM. https://doi.org/10.1145/3342220.3343660
bibtex: '@inproceedings{Desouki_Röder_Ngonga Ngomo_2019, title={Ranking on Very
Large Knowledge Graphs}, DOI={10.1145/3342220.3343660},
booktitle={Proceedings of the 30th ACM Conference on Hypertext and Social Media
- HT ’19}, publisher={ACM}, author={Desouki, Abdelmoneim Amer and Röder, Michael
and Ngonga Ngomo, Axel-Cyrille}, year={2019}, pages={163–171} }'
chicago: Desouki, Abdelmoneim Amer, Michael Röder, and Axel-Cyrille Ngonga Ngomo.
“Ranking on Very Large Knowledge Graphs.” In Proceedings of the 30th ACM Conference
on Hypertext and Social Media - HT ’19, 163–71. ACM, 2019. https://doi.org/10.1145/3342220.3343660.
ieee: A. A. Desouki, M. Röder, and A.-C. Ngonga Ngomo, “Ranking on Very Large Knowledge
Graphs,” in Proceedings of the 30th ACM Conference on Hypertext and Social
Media - HT ’19, 2019, pp. 163–171.
mla: Desouki, Abdelmoneim Amer, et al. “Ranking on Very Large Knowledge Graphs.”
Proceedings of the 30th ACM Conference on Hypertext and Social Media - HT
’19, ACM, 2019, pp. 163–71, doi:10.1145/3342220.3343660.
short: 'A.A. Desouki, M. Röder, A.-C. Ngonga Ngomo, in: Proceedings of the 30th
ACM Conference on Hypertext and Social Media - HT ’19, ACM, 2019, pp. 163–171.'
conference:
end_date: 2019-09-20
name: 30th ACM Conference on Hypertext and Social Media
start_date: 2019-09-17
date_created: 2020-02-18T16:39:35Z
date_updated: 2022-01-06T06:52:41Z
department:
- _id: '574'
doi: 10.1145/3342220.3343660
keyword:
- Knowledge Graphs
- Ranking
- RDF
language:
- iso: eng
page: 163-171
project:
- _id: '52'
name: Computing Resources Provided by the Paderborn Center for Parallel Computing
publication: Proceedings of the 30th ACM Conference on Hypertext and Social Media -
HT '19
publication_identifier:
isbn:
- '9781450368858'
publication_status: published
publisher: ACM
status: public
title: Ranking on Very Large Knowledge Graphs
type: conference
user_id: '69382'
year: '2019'
...
---
_id: '14568'
author:
- first_name: Stefan
full_name: Heindorf, Stefan
id: '11871'
last_name: Heindorf
orcid: 0000-0002-4525-6865
- first_name: Yan
full_name: Scholten, Yan
last_name: Scholten
- first_name: Gregor
full_name: Engels, Gregor
id: '107'
last_name: Engels
- first_name: Martin
full_name: Potthast, Martin
last_name: Potthast
citation:
ama: 'Heindorf S, Scholten Y, Engels G, Potthast M. Debiasing Vandalism Detection
Models at Wikidata (Extended Abstract). In: INFORMATIK. ; 2019:289-290.
doi:10.18420/inf2019_48'
apa: Heindorf, S., Scholten, Y., Engels, G., & Potthast, M. (2019). Debiasing
Vandalism Detection Models at Wikidata (Extended Abstract). In INFORMATIK
(pp. 289–290). https://doi.org/10.18420/inf2019_48
bibtex: '@inproceedings{Heindorf_Scholten_Engels_Potthast_2019, title={Debiasing
Vandalism Detection Models at Wikidata (Extended Abstract)}, DOI={10.18420/inf2019_48},
booktitle={INFORMATIK}, author={Heindorf, Stefan and Scholten, Yan and Engels,
Gregor and Potthast, Martin}, year={2019}, pages={289–290} }'
chicago: Heindorf, Stefan, Yan Scholten, Gregor Engels, and Martin Potthast. “Debiasing
Vandalism Detection Models at Wikidata (Extended Abstract).” In INFORMATIK,
289–90, 2019. https://doi.org/10.18420/inf2019_48.
ieee: S. Heindorf, Y. Scholten, G. Engels, and M. Potthast, “Debiasing Vandalism
Detection Models at Wikidata (Extended Abstract),” in INFORMATIK, 2019,
pp. 289–290.
mla: Heindorf, Stefan, et al. “Debiasing Vandalism Detection Models at Wikidata
(Extended Abstract).” INFORMATIK, 2019, pp. 289–90, doi:10.18420/inf2019_48.
short: 'S. Heindorf, Y. Scholten, G. Engels, M. Potthast, in: INFORMATIK, 2019,
pp. 289–290.'
date_created: 2019-11-05T15:48:52Z
date_updated: 2022-01-06T06:52:03Z
department:
- _id: '66'
doi: 10.18420/inf2019_48
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://dl.gi.de/bitstream/handle/20.500.12116/24997/paper3_25.pdf
oa: '1'
page: 289-290
publication: INFORMATIK
status: public
title: Debiasing Vandalism Detection Models at Wikidata (Extended Abstract)
type: conference
user_id: '11871'
year: '2019'
...
---
_id: '14817'
article_number: '101975'
author:
- first_name: Christoph
full_name: Sommer, Christoph
id: '49154'
last_name: Sommer
orcid: 0000-0002-4336-7350
- first_name: Stefano
full_name: Basagni, Stefano
last_name: Basagni
citation:
ama: Sommer C, Basagni S. Advances and novel applications of mobile wireless networking.
Ad Hoc Networks. 2019. doi:10.1016/j.adhoc.2019.101975
apa: Sommer, C., & Basagni, S. (2019). Advances and novel applications of mobile
wireless networking. Ad Hoc Networks. https://doi.org/10.1016/j.adhoc.2019.101975
bibtex: '@article{Sommer_Basagni_2019, title={Advances and novel applications of
mobile wireless networking}, DOI={10.1016/j.adhoc.2019.101975},
number={101975}, journal={Ad Hoc Networks}, author={Sommer, Christoph and Basagni,
Stefano}, year={2019} }'
chicago: Sommer, Christoph, and Stefano Basagni. “Advances and Novel Applications
of Mobile Wireless Networking.” Ad Hoc Networks, 2019. https://doi.org/10.1016/j.adhoc.2019.101975.
ieee: C. Sommer and S. Basagni, “Advances and novel applications of mobile wireless
networking,” Ad Hoc Networks, 2019.
mla: Sommer, Christoph, and Stefano Basagni. “Advances and Novel Applications of
Mobile Wireless Networking.” Ad Hoc Networks, 101975, 2019, doi:10.1016/j.adhoc.2019.101975.
short: C. Sommer, S. Basagni, Ad Hoc Networks (2019).
date_created: 2019-11-05T18:38:44Z
date_updated: 2022-01-06T06:52:06Z
department:
- _id: '589'
doi: 10.1016/j.adhoc.2019.101975
language:
- iso: eng
publication: Ad Hoc Networks
publication_identifier:
issn:
- 1570-8705
publication_status: published
status: public
title: Advances and novel applications of mobile wireless networking
type: journal_article
user_id: '49154'
year: '2019'
...
---
_id: '14819'
author:
- first_name: Julian
full_name: Heinovski, Julian
last_name: Heinovski
- first_name: Lukas
full_name: Stratmann, Lukas
last_name: Stratmann
- first_name: Dominik S.
full_name: Buse, Dominik S.
last_name: Buse
- first_name: Florian
full_name: Klingler, Florian
last_name: Klingler
- first_name: Mario
full_name: Franke, Mario
last_name: Franke
- first_name: Marie-Christin H.
full_name: Oczko, Marie-Christin H.
last_name: Oczko
- first_name: Christoph
full_name: Sommer, Christoph
id: '49154'
last_name: Sommer
orcid: 0000-0002-4336-7350
- first_name: Ingrid
full_name: Scharlau, Ingrid
last_name: Scharlau
- first_name: Falko
full_name: Dressler, Falko
last_name: Dressler
citation:
ama: 'Heinovski J, Stratmann L, Buse DS, et al. Modeling Cycling Behavior to Improve
Bicyclists’ Safety at Intersections - A Networking Perspective. In: 2019 IEEE
20th International Symposium on “A World of Wireless, Mobile and Multimedia Networks”
(WoWMoM). ; 2019. doi:10.1109/wowmom.2019.8793008'
apa: Heinovski, J., Stratmann, L., Buse, D. S., Klingler, F., Franke, M., Oczko,
M.-C. H., … Dressler, F. (2019). Modeling Cycling Behavior to Improve Bicyclists’
Safety at Intersections - A Networking Perspective. In 2019 IEEE 20th International
Symposium on “A World of Wireless, Mobile and Multimedia Networks” (WoWMoM).
https://doi.org/10.1109/wowmom.2019.8793008
bibtex: '@inproceedings{Heinovski_Stratmann_Buse_Klingler_Franke_Oczko_Sommer_Scharlau_Dressler_2019,
title={Modeling Cycling Behavior to Improve Bicyclists’ Safety at Intersections
- A Networking Perspective}, DOI={10.1109/wowmom.2019.8793008},
booktitle={2019 IEEE 20th International Symposium on “A World of Wireless, Mobile
and Multimedia Networks” (WoWMoM)}, author={Heinovski, Julian and Stratmann, Lukas
and Buse, Dominik S. and Klingler, Florian and Franke, Mario and Oczko, Marie-Christin
H. and Sommer, Christoph and Scharlau, Ingrid and Dressler, Falko}, year={2019}
}'
chicago: Heinovski, Julian, Lukas Stratmann, Dominik S. Buse, Florian Klingler,
Mario Franke, Marie-Christin H. Oczko, Christoph Sommer, Ingrid Scharlau, and
Falko Dressler. “Modeling Cycling Behavior to Improve Bicyclists’ Safety at Intersections
- A Networking Perspective.” In 2019 IEEE 20th International Symposium on “A
World of Wireless, Mobile and Multimedia Networks” (WoWMoM), 2019. https://doi.org/10.1109/wowmom.2019.8793008.
ieee: J. Heinovski et al., “Modeling Cycling Behavior to Improve Bicyclists’
Safety at Intersections - A Networking Perspective,” in 2019 IEEE 20th International
Symposium on “A World of Wireless, Mobile and Multimedia Networks” (WoWMoM),
2019.
mla: Heinovski, Julian, et al. “Modeling Cycling Behavior to Improve Bicyclists’
Safety at Intersections - A Networking Perspective.” 2019 IEEE 20th International
Symposium on “A World of Wireless, Mobile and Multimedia Networks” (WoWMoM),
2019, doi:10.1109/wowmom.2019.8793008.
short: 'J. Heinovski, L. Stratmann, D.S. Buse, F. Klingler, M. Franke, M.-C.H. Oczko,
C. Sommer, I. Scharlau, F. Dressler, in: 2019 IEEE 20th International Symposium
on “A World of Wireless, Mobile and Multimedia Networks” (WoWMoM), 2019.'
date_created: 2019-11-05T18:38:48Z
date_updated: 2022-01-06T06:52:06Z
department:
- _id: '589'
doi: 10.1109/wowmom.2019.8793008
language:
- iso: eng
publication: 2019 IEEE 20th International Symposium on "A World of Wireless, Mobile
and Multimedia Networks" (WoWMoM)
publication_identifier:
isbn:
- '9781728102702'
publication_status: published
status: public
title: Modeling Cycling Behavior to Improve Bicyclists' Safety at Intersections -
A Networking Perspective
type: conference
user_id: '49154'
year: '2019'
...