---
_id: '20240'
author:
- first_name: Simon
full_name: Hoof, Simon
id: '59676'
last_name: Hoof
citation:
ama: "Hoof S. Essays on Cooperation in Differential Games.; 2020. doi:\t10.17619/UNIPB/1-1047"
apa: "Hoof, S. (2020). Essays on Cooperation in Differential Games. https://doi.org/\t10.17619/UNIPB/1-1047"
bibtex: "@book{Hoof_2020, title={Essays on Cooperation in Differential Games}, DOI={\t10.17619/UNIPB/1-1047},
author={Hoof, Simon}, year={2020} }"
chicago: "Hoof, Simon. Essays on Cooperation in Differential Games, 2020.
https://doi.org/\t10.17619/UNIPB/1-1047."
ieee: S. Hoof, Essays on Cooperation in Differential Games. 2020.
mla: "Hoof, Simon. Essays on Cooperation in Differential Games. 2020, doi:\t10.17619/UNIPB/1-1047."
short: S. Hoof, Essays on Cooperation in Differential Games, 2020.
date_created: 2020-11-02T09:56:14Z
date_updated: 2022-01-06T06:54:24Z
department:
- _id: '205'
doi: "\t10.17619/UNIPB/1-1047"
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '7'
name: SFB 901 - Subproject A3
status: public
supervisor:
- first_name: Claus-Jochen
full_name: Haake, Claus-Jochen
id: '20801'
last_name: Haake
title: Essays on Cooperation in Differential Games
type: dissertation
user_id: '15504'
year: '2020'
...
---
_id: '2834'
author:
- first_name: Dominik
full_name: Gutt, Dominik
id: '14368'
last_name: Gutt
- first_name: Tobias
full_name: von Rechenberg, Tobias
last_name: von Rechenberg
- first_name: Dennis
full_name: Kundisch, Dennis
id: '21117'
last_name: Kundisch
citation:
ama: Gutt D, von Rechenberg T, Kundisch D. Goal Achievement, Subsequent User Effort
and the Moderating Role of Goal Difficulty. Journal of Business Research.
2020;106:277-287. doi:10.1016/j.jbusres.2018.06.019
apa: Gutt, D., von Rechenberg, T., & Kundisch, D. (2020). Goal Achievement,
Subsequent User Effort and the Moderating Role of Goal Difficulty. Journal
of Business Research, 106, 277–287. https://doi.org/10.1016/j.jbusres.2018.06.019
bibtex: '@article{Gutt_von Rechenberg_Kundisch_2020, title={Goal Achievement, Subsequent
User Effort and the Moderating Role of Goal Difficulty}, volume={106}, DOI={10.1016/j.jbusres.2018.06.019},
journal={Journal of Business Research}, publisher={Elsevier}, author={Gutt, Dominik
and von Rechenberg, Tobias and Kundisch, Dennis}, year={2020}, pages={277–287}
}'
chicago: 'Gutt, Dominik, Tobias von Rechenberg, and Dennis Kundisch. “Goal Achievement,
Subsequent User Effort and the Moderating Role of Goal Difficulty.” Journal
of Business Research 106 (2020): 277–87. https://doi.org/10.1016/j.jbusres.2018.06.019.'
ieee: D. Gutt, T. von Rechenberg, and D. Kundisch, “Goal Achievement, Subsequent
User Effort and the Moderating Role of Goal Difficulty,” Journal of Business
Research, vol. 106, pp. 277–287, 2020.
mla: Gutt, Dominik, et al. “Goal Achievement, Subsequent User Effort and the Moderating
Role of Goal Difficulty.” Journal of Business Research, vol. 106, Elsevier,
2020, pp. 277–87, doi:10.1016/j.jbusres.2018.06.019.
short: D. Gutt, T. von Rechenberg, D. Kundisch, Journal of Business Research 106
(2020) 277–287.
date_created: 2018-05-23T15:08:23Z
date_updated: 2022-01-06T06:58:02Z
ddc:
- '000'
department:
- _id: '276'
doi: 10.1016/j.jbusres.2018.06.019
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T15:29:22Z
date_updated: 2018-11-02T15:29:22Z
file_id: '5304'
file_name: gutt-main.pdf
file_size: 572670
relation: main_file
success: 1
file_date_updated: 2018-11-02T15:29:22Z
has_accepted_license: '1'
intvolume: ' 106'
language:
- iso: eng
page: 277-287
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '8'
name: SFB 901 - Subproject A4
publication: Journal of Business Research
publication_status: epub_ahead
publisher: Elsevier
status: public
title: Goal Achievement, Subsequent User Effort and the Moderating Role of Goal Difficulty
type: journal_article
user_id: '16205'
volume: 106
year: '2020'
...
---
_id: '24710'
author:
- first_name: Rafael
full_name: Kurek, Rafael
last_name: Kurek
citation:
ama: Kurek R. Efficient Cryptographic Constructions with Strong Security Guarantees.;
2020.
apa: Kurek, R. (2020). Efficient Cryptographic Constructions with Strong Security
Guarantees.
bibtex: '@book{Kurek_2020, title={Efficient Cryptographic Constructions with Strong
Security Guarantees}, author={Kurek, Rafael}, year={2020} }'
chicago: Kurek, Rafael. Efficient Cryptographic Constructions with Strong Security
Guarantees, 2020.
ieee: R. Kurek, Efficient Cryptographic Constructions with Strong Security Guarantees.
2020.
mla: Kurek, Rafael. Efficient Cryptographic Constructions with Strong Security
Guarantees. 2020.
short: R. Kurek, Efficient Cryptographic Constructions with Strong Security Guarantees,
2020.
date_created: 2021-09-20T11:40:56Z
date_updated: 2022-01-06T06:56:32Z
ddc:
- '040'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2021-09-20T11:40:38Z
date_updated: 2021-09-20T11:40:38Z
file_id: '24711'
file_name: DissertationKurek.pdf
file_size: 973756
relation: main_file
success: 1
file_date_updated: 2021-09-20T11:40:38Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '13'
name: SFB 901 - Subproject C1
status: public
supervisor:
- first_name: Tibor
full_name: Jager, Tibor
id: '64669'
last_name: Jager
title: Efficient Cryptographic Constructions with Strong Security Guarantees
type: dissertation
user_id: '15504'
year: '2020'
...
---
_id: '21287'
abstract:
- lang: eng
text: Peer-to-peer markets are especially suitable for the analysis of online
ratings as they represent two-sided markets that match buyers to sellers and thus
lead to reduced scope for opportunistic behavior. We decompose the online ratings
by focusing on the customer’s decision-making process in a leading peer-to-peer
ridesharing platform. Using data from the leading peer-to-peer ridesharing platform
BlaBlaCar, we analyze 17,584 users registered between 2004 and 2014 and their
online ratings focusing on the decomposition of the explicit determinants reflecting
the variance of online ratings. We find clear evidence to suggest that a driver’s
attitude towards music, pets, smoking, and conversation has a significantly positive
influence on his received online ratings. However, we also show that the interaction
of female drivers and their attitude towards pets has a significantly negative
effect on average ratings.
article_number: '6185'
author:
- first_name: Daniel
full_name: Kaimann, Daniel
id: '18949'
last_name: Kaimann
citation:
ama: 'Kaimann D. Behind the Review Curtain: Decomposition of Online Consumer Ratings
in Peer-to-Peer Markets. Sustainability. 2020;12(15). doi:10.3390/su12156185'
apa: 'Kaimann, D. (2020). Behind the Review Curtain: Decomposition of Online Consumer
Ratings in Peer-to-Peer Markets. Sustainability, 12(15). https://doi.org/10.3390/su12156185'
bibtex: '@article{Kaimann_2020, title={Behind the Review Curtain: Decomposition
of Online Consumer Ratings in Peer-to-Peer Markets}, volume={12}, DOI={10.3390/su12156185},
number={156185}, journal={Sustainability}, author={Kaimann, Daniel}, year={2020}
}'
chicago: 'Kaimann, Daniel. “Behind the Review Curtain: Decomposition of Online Consumer
Ratings in Peer-to-Peer Markets.” Sustainability 12, no. 15 (2020). https://doi.org/10.3390/su12156185.'
ieee: 'D. Kaimann, “Behind the Review Curtain: Decomposition of Online Consumer
Ratings in Peer-to-Peer Markets,” Sustainability, vol. 12, no. 15, 2020.'
mla: 'Kaimann, Daniel. “Behind the Review Curtain: Decomposition of Online Consumer
Ratings in Peer-to-Peer Markets.” Sustainability, vol. 12, no. 15, 6185,
2020, doi:10.3390/su12156185.'
short: D. Kaimann, Sustainability 12 (2020).
date_created: 2021-02-26T13:15:09Z
date_updated: 2022-01-06T06:54:52Z
department:
- _id: '183'
doi: 10.3390/su12156185
intvolume: ' 12'
issue: '15'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '8'
name: SFB 901 - Subproject A4
publication: Sustainability
publication_identifier:
issn:
- 2071-1050
publication_status: published
status: public
title: 'Behind the Review Curtain: Decomposition of Online Consumer Ratings in Peer-to-Peer
Markets'
type: journal_article
user_id: '18949'
volume: 12
year: '2020'
...
---
_id: '21396'
abstract:
- lang: eng
text: "Verifiable random functions (VRFs) are essentially digital signatures with
additional properties, namely verifiable uniqueness and pseudorandomness, which
make VRFs a useful tool, e.g., to prevent enumeration in DNSSEC Authenticated
Denial of Existence and the CONIKS key management system, or in the random committee
selection of the Algorand blockchain.\r\n\r\nMost standard-model VRFs rely on
admissible hash functions (AHFs) to achieve security against adaptive attacks
in the standard model. Known AHF constructions are based on error-correcting codes,
which yield asymptotically efficient constructions. However, previous works do
not clarify how the code should be instantiated concretely in the real world.
The rate and the minimal distance of the selected code have significant impact
on the efficiency of the resulting cryptosystem, therefore it is unclear if and
how the aforementioned constructions can be used in practice.\r\n\r\nFirst, we
explain inherent limitations of code-based AHFs. Concretely, we assume that even
if we were given codes that achieve the well-known Gilbert-Varshamov or McEliece-Rodemich-Rumsey-Welch
bounds, existing AHF-based constructions of verifiable random functions (VRFs)
can only be instantiated quite inefficiently. Then we introduce and construct
computational AHFs (cAHFs). While classical AHFs are information-theoretic, and
therefore work even in presence of computationally unbounded adversaries, cAHFs
provide only security against computationally bounded adversaries. However, we
show that cAHFs can be instantiated significantly more efficiently. Finally, we
use our cAHF to construct the currently most efficient verifiable random function
with full adaptive security in the standard model."
author:
- first_name: Tibor
full_name: Jager, Tibor
last_name: Jager
- first_name: David
full_name: Niehues, David
id: '36113'
last_name: Niehues
citation:
ama: 'Jager T, Niehues D. On the Real-World Instantiability of Admissible Hash Functions
and Efficient Verifiable Random Functions. In: Lecture Notes in Computer Science.
Cham; 2020. doi:10.1007/978-3-030-38471-5_13'
apa: Jager, T., & Niehues, D. (2020). On the Real-World Instantiability of Admissible
Hash Functions and Efficient Verifiable Random Functions. In Lecture Notes
in Computer Science. Cham. https://doi.org/10.1007/978-3-030-38471-5_13
bibtex: '@inbook{Jager_Niehues_2020, place={Cham}, title={On the Real-World Instantiability
of Admissible Hash Functions and Efficient Verifiable Random Functions}, DOI={10.1007/978-3-030-38471-5_13},
booktitle={Lecture Notes in Computer Science}, author={Jager, Tibor and Niehues,
David}, year={2020} }'
chicago: Jager, Tibor, and David Niehues. “On the Real-World Instantiability of
Admissible Hash Functions and Efficient Verifiable Random Functions.” In Lecture
Notes in Computer Science. Cham, 2020. https://doi.org/10.1007/978-3-030-38471-5_13.
ieee: T. Jager and D. Niehues, “On the Real-World Instantiability of Admissible
Hash Functions and Efficient Verifiable Random Functions,” in Lecture Notes
in Computer Science, Cham, 2020.
mla: Jager, Tibor, and David Niehues. “On the Real-World Instantiability of Admissible
Hash Functions and Efficient Verifiable Random Functions.” Lecture Notes in
Computer Science, 2020, doi:10.1007/978-3-030-38471-5_13.
short: 'T. Jager, D. Niehues, in: Lecture Notes in Computer Science, Cham, 2020.'
conference:
end_date: 2019-08-16
location: Waterloo, Canada
name: Selected Areas in Cryptography
start_date: 2019-08-12
date_created: 2021-03-08T16:50:31Z
date_updated: 2022-01-06T06:54:58Z
ddc:
- '000'
department:
- _id: '558'
doi: 10.1007/978-3-030-38471-5_13
file:
- access_level: closed
content_type: application/pdf
creator: davnie
date_created: 2021-03-08T17:02:37Z
date_updated: 2021-03-08T17:02:37Z
file_id: '21399'
file_name: Jager und Niehues - 2020 - On the Real-World Instantiability of Admissible
Ha.pdf
file_size: 706743
relation: main_file
file_date_updated: 2021-03-08T17:02:37Z
has_accepted_license: '1'
keyword:
- Admissible hash functions
- Verifiable random functions
- Error-correcting codes
- Provable security
language:
- iso: eng
main_file_link:
- url: https://link.springer.com/content/pdf/10.1007%252F978-3-030-38471-5_13.pdf
place: Cham
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '13'
name: SFB 901 - Subproject C1
publication: Lecture Notes in Computer Science
publication_identifier:
isbn:
- '9783030384708'
- '9783030384715'
issn:
- 0302-9743
- 1611-3349
publication_status: published
quality_controlled: '1'
related_material:
link:
- relation: later_version
url: https://eprint.iacr.org/2019/1335.pdf
status: public
title: On the Real-World Instantiability of Admissible Hash Functions and Efficient
Verifiable Random Functions
type: book_chapter
user_id: '36113'
year: '2020'
...
---
_id: '17347'
abstract:
- lang: eng
text: Peer-to-Peer news portals allow Internet users to write news articles and
make them available online to interested readers. Despite the fact that authors
are free in their choice of topics, there are a number of quality characteristics
that an article must meet before it is published. In addition to meaningful titles,
comprehensibly written texts and meaning- ful images, relevant tags are an important
criteria for the quality of such news. In this case study, we discuss the challenges
and common mistakes that Peer-to-Peer reporters face when tagging news and how
incorrect information can be corrected through the orchestration of existing Natu-
ral Language Processing services. Lastly, we use this illustrative example to
give insight into the challenges of dealing with bottom-up taxonomies.
author:
- first_name: Frederik Simon
full_name: Bäumer, Frederik Simon
id: '38837'
last_name: Bäumer
- first_name: Joschka
full_name: Kersting, Joschka
id: '58701'
last_name: Kersting
- first_name: Bianca
full_name: Buff, Bianca
last_name: Buff
- first_name: Michaela
full_name: Geierhos, Michaela
id: '42496'
last_name: Geierhos
orcid: 0000-0002-8180-5606
citation:
ama: 'Bäumer FS, Kersting J, Buff B, Geierhos M. Tag Me If You Can: Insights into
the Challenges of Supporting Unrestricted P2P News Tagging. In: Audrius L, Rita
B, Daina G, Vilma S, eds. Information and Software Technologies. Vol 1283.
Communications in Computer and Information Science. Springer; 2020:368--382. doi:https://doi.org/10.1007/978-3-030-59506-7_30'
apa: 'Bäumer, F. S., Kersting, J., Buff, B., & Geierhos, M. (2020). Tag Me If
You Can: Insights into the Challenges of Supporting Unrestricted P2P News Tagging.
In L. Audrius, B. Rita, G. Daina, & S. Vilma (Eds.), Information and Software
Technologies (Vol. 1283, pp. 368--382). Kaunas, Litauen: Springer. https://doi.org/10.1007/978-3-030-59506-7_30'
bibtex: '@inbook{Bäumer_Kersting_Buff_Geierhos_2020, series={Communications in Computer
and Information Science}, title={Tag Me If You Can: Insights into the Challenges
of Supporting Unrestricted P2P News Tagging}, volume={1283}, DOI={https://doi.org/10.1007/978-3-030-59506-7_30},
booktitle={Information and Software Technologies}, publisher={Springer}, author={Bäumer,
Frederik Simon and Kersting, Joschka and Buff, Bianca and Geierhos, Michaela},
editor={Audrius, Lopata and Rita, Butkienė and Daina, Gudonienė and Vilma, SukackėEditors},
year={2020}, pages={368--382}, collection={Communications in Computer and Information
Science} }'
chicago: 'Bäumer, Frederik Simon, Joschka Kersting, Bianca Buff, and Michaela Geierhos.
“Tag Me If You Can: Insights into the Challenges of Supporting Unrestricted P2P
News Tagging.” In Information and Software Technologies, edited by Lopata
Audrius, Butkienė Rita, Gudonienė Daina, and Sukackė Vilma, 1283:368--382. Communications
in Computer and Information Science. Springer, 2020. https://doi.org/10.1007/978-3-030-59506-7_30.'
ieee: 'F. S. Bäumer, J. Kersting, B. Buff, and M. Geierhos, “Tag Me If You Can:
Insights into the Challenges of Supporting Unrestricted P2P News Tagging,” in
Information and Software Technologies, vol. 1283, L. Audrius, B. Rita,
G. Daina, and S. Vilma, Eds. Springer, 2020, pp. 368--382.'
mla: 'Bäumer, Frederik Simon, et al. “Tag Me If You Can: Insights into the Challenges
of Supporting Unrestricted P2P News Tagging.” Information and Software Technologies,
edited by Lopata Audrius et al., vol. 1283, Springer, 2020, pp. 368--382, doi:https://doi.org/10.1007/978-3-030-59506-7_30.'
short: 'F.S. Bäumer, J. Kersting, B. Buff, M. Geierhos, in: L. Audrius, B. Rita,
G. Daina, S. Vilma (Eds.), Information and Software Technologies, Springer, 2020,
pp. 368--382.'
conference:
end_date: 2020-10-17
location: Kaunas, Litauen
name: 26th International Conference on Information and Software Technologies (ICIST
2020)
start_date: 2020-10-15
date_created: 2020-06-26T14:23:52Z
date_updated: 2022-01-06T06:53:08Z
ddc:
- '004'
department:
- _id: '579'
- _id: '1'
- _id: '36'
doi: https://doi.org/10.1007/978-3-030-59506-7_30
editor:
- first_name: Lopata
full_name: Audrius, Lopata
last_name: Audrius
- first_name: Butkienė
full_name: Rita, Butkienė
last_name: Rita
- first_name: Gudonienė
full_name: Daina, Gudonienė
last_name: Daina
- first_name: Sukackė
full_name: Vilma, Sukackė
last_name: Vilma
file:
- access_level: closed
content_type: application/pdf
creator: jkers
date_created: 2020-11-07T19:47:30Z
date_updated: 2020-11-07T19:47:30Z
file_id: '20309'
file_name: Bäumer et al. (2020), Baeumer2020.pdf .pdf
file_size: 599881
relation: main_file
success: 1
file_date_updated: 2020-11-07T19:47:30Z
has_accepted_license: '1'
intvolume: ' 1283'
language:
- iso: eng
page: 368--382
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '9'
name: SFB 901 - Subproject B1
publication: Information and Software Technologies
publication_status: published
publisher: Springer
series_title: Communications in Computer and Information Science
status: public
title: 'Tag Me If You Can: Insights into the Challenges of Supporting Unrestricted
P2P News Tagging'
type: book_chapter
user_id: '58701'
volume: 1283
year: '2020'
...
---
_id: '17358'
abstract:
- lang: eng
text: 'Approximate circuits trade-off computational accuracy against improvements
in hardware area, delay, or energy consumption. IP core vendors who wish to create
such circuits need to convince consumers of the resulting approximation quality.
As a solution we propose proof-carrying approximate circuits: The vendor creates
an approximate IP core together with a certificate that proves the approximation
quality. The proof certificate is bundled with the approximate IP core and sent
off to the consumer. The consumer can formally verify the approximation quality
of the IP core at a fraction of the typical computational cost for formal verification.
In this paper, we first make the case for proof-carrying approximate circuits
and then demonstrate the feasibility of the approach by a set of synthesis experiments
using an exemplary approximation framework.'
article_type: original
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. Proof-carrying Approximate Circuits. IEEE
Transactions On Very Large Scale Integration Systems. 2020;28(9):2084-2088.
doi:10.1109/TVLSI.2020.3008061
apa: Witschen, L. M., Wiersema, T., & Platzner, M. (2020). Proof-carrying Approximate
Circuits. IEEE Transactions On Very Large Scale Integration Systems, 28(9),
2084–2088. https://doi.org/10.1109/TVLSI.2020.3008061
bibtex: '@article{Witschen_Wiersema_Platzner_2020, title={Proof-carrying Approximate
Circuits}, volume={28}, DOI={10.1109/TVLSI.2020.3008061},
number={9}, journal={IEEE Transactions On Very Large Scale Integration Systems},
publisher={IEEE}, author={Witschen, Linus Matthias and Wiersema, Tobias and Platzner,
Marco}, year={2020}, pages={2084–2088} }'
chicago: 'Witschen, Linus Matthias, Tobias Wiersema, and Marco Platzner. “Proof-Carrying
Approximate Circuits.” IEEE Transactions On Very Large Scale Integration Systems
28, no. 9 (2020): 2084–88. https://doi.org/10.1109/TVLSI.2020.3008061.'
ieee: L. M. Witschen, T. Wiersema, and M. Platzner, “Proof-carrying Approximate
Circuits,” IEEE Transactions On Very Large Scale Integration Systems, vol.
28, no. 9, pp. 2084–2088, 2020.
mla: Witschen, Linus Matthias, et al. “Proof-Carrying Approximate Circuits.” IEEE
Transactions On Very Large Scale Integration Systems, vol. 28, no. 9, IEEE,
2020, pp. 2084–88, doi:10.1109/TVLSI.2020.3008061.
short: L.M. Witschen, T. Wiersema, M. Platzner, IEEE Transactions On Very Large
Scale Integration Systems 28 (2020) 2084–2088.
date_created: 2020-07-06T11:21:30Z
date_updated: 2022-01-06T06:53:09Z
department:
- _id: '78'
doi: 10.1109/TVLSI.2020.3008061
funded_apc: '1'
intvolume: ' 28'
issue: '9'
keyword:
- Approximate circuit synthesis
- approximate computing
- error metrics
- formal verification
- proof-carrying hardware
language:
- iso: eng
page: 2084 - 2088
project:
- _id: '12'
name: SFB 901 - Subproject B4
- _id: '3'
name: SFB 901 - Project Area B
- _id: '1'
name: SFB 901
publication: IEEE Transactions On Very Large Scale Integration Systems
publication_identifier:
eissn:
- 1557-9999
issn:
- 1063-8210
publication_status: published
publisher: IEEE
quality_controlled: '1'
status: public
title: Proof-carrying Approximate Circuits
type: journal_article
user_id: '49051'
volume: 28
year: '2020'
...
---
_id: '17368'
author:
- first_name: Christian
full_name: Vorbohle, Christian
id: '29951'
last_name: Vorbohle
- first_name: Daniel
full_name: Szopinski, Daniel
id: '36372'
last_name: Szopinski
- first_name: Dennis
full_name: Kundisch, Dennis
id: '21117'
last_name: Kundisch
citation:
ama: 'Vorbohle C, Szopinski D, Kundisch D. Business Model Dependencies: Towards
conceptualizing dependencies for extending modeling languages for business models.
Shishkov B, ed. 2020;391.'
apa: 'Vorbohle, C., Szopinski, D., & Kundisch, D. (2020). Business Model Dependencies:
Towards conceptualizing dependencies for extending modeling languages for business
models. (B. Shishkov, Ed.). Presented at the 10th International Symposium on Business
Modeling and Software Design (BMSD), Potsdam, Germany: Springer.'
bibtex: '@article{Vorbohle_Szopinski_Kundisch_2020, series={Lecture Notes in Business
Information Processing}, title={Business Model Dependencies: Towards conceptualizing
dependencies for extending modeling languages for business models}, volume={391},
publisher={Springer}, author={Vorbohle, Christian and Szopinski, Daniel and Kundisch,
Dennis}, editor={Shishkov, B.Editor}, year={2020}, collection={Lecture Notes in
Business Information Processing} }'
chicago: 'Vorbohle, Christian, Daniel Szopinski, and Dennis Kundisch. “Business
Model Dependencies: Towards Conceptualizing Dependencies for Extending Modeling
Languages for Business Models.” Edited by B. Shishkov. Lecture Notes in Business
Information Processing. Springer, 2020.'
ieee: 'C. Vorbohle, D. Szopinski, and D. Kundisch, “Business Model Dependencies:
Towards conceptualizing dependencies for extending modeling languages for business
models,” vol. 391. Springer, 2020.'
mla: 'Vorbohle, Christian, et al. Business Model Dependencies: Towards Conceptualizing
Dependencies for Extending Modeling Languages for Business Models. Edited
by B. Shishkov, vol. 391, Springer, 2020.'
short: C. Vorbohle, D. Szopinski, D. Kundisch, 391 (2020).
conference:
end_date: 2020-07-08
location: Potsdam, Germany
name: 10th International Symposium on Business Modeling and Software Design (BMSD)
start_date: 2020-07-06
date_created: 2020-07-09T17:46:18Z
date_updated: 2022-01-06T06:53:09Z
ddc:
- '040'
department:
- _id: '276'
editor:
- first_name: B.
full_name: Shishkov, B.
last_name: Shishkov
file:
- access_level: closed
content_type: application/pdf
creator: dsz
date_created: 2020-09-29T07:47:23Z
date_updated: 2020-09-29T07:47:23Z
file_id: '19763'
file_name: BMSD2020_Springer_BMD.pdf
file_size: 293783
relation: main_file
success: 1
file_date_updated: 2020-09-29T07:47:23Z
has_accepted_license: '1'
intvolume: ' 391'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '17'
name: SFB 901 - Subproject C5
publication_identifier:
isbn:
- 978-3-030-52305-3
publication_status: published
publisher: Springer
series_title: Lecture Notes in Business Information Processing
status: public
title: 'Business Model Dependencies: Towards conceptualizing dependencies for extending
modeling languages for business models'
type: conference
user_id: '36372'
volume: 391
year: '2020'
...
---
_id: '17370'
abstract:
- lang: eng
text: " We consider a natural extension to the metric uncapacitated Facility Location
Problem (FLP) in which requests ask for different commodities out of a finite
set \\( S \\) of commodities.\r\n Ravi and Sinha (SODA 2004) introduced the model
as the \\emph{Multi-Commodity Facility Location Problem} (MFLP) and considered
it an offline optimization problem.\r\n The model itself is similar to the FLP:
i.e., requests are located at points of a finite metric space and the task of
an algorithm is to construct facilities and assign requests to facilities while
minimizing the construction cost and the sum over all assignment distances.\r\n
\ In addition, requests and facilities are heterogeneous; they request or offer
multiple commodities out of $S$.\r\n A request has to be connected to a set of
facilities jointly offering the commodities demanded by it.\r\n In comparison
to the FLP, an algorithm has to decide not only if and where to place facilities,
but also which commodities to offer at each.\r\n\r\n To the best of our knowledge
we are the first to study the problem in its online variant in which requests,
their positions and their commodities are not known beforehand but revealed over
time.\r\n We present results regarding the competitive ratio.\r\n On the one
hand, we show that heterogeneity influences the competitive ratio by developing
a lower bound on the competitive ratio for any randomized online algorithm of
\\( \\Omega ( \\sqrt{|S|} + \\frac{\\log n}{\\log \\log n} ) \\) that already
holds for simple line metrics.\r\n Here, \\( n \\) is the number of requests.\r\n
\ On the other side, we establish a deterministic \\( \\mathcal{O}(\\sqrt{|S|}
\\cdot \\log n) \\)-competitive algorithm and a randomized \\( \\mathcal{O}(\\sqrt{|S|}
\\cdot \\frac{\\log n}{\\log \\log n} ) \\)-competitive algorithm.\r\n Further,
we show that when considering a more special class of cost functions for the construction
cost of a facility, the competitive ratio decreases given by our deterministic
algorithm depending on the function."
author:
- first_name: Jannik
full_name: Castenow, Jannik
id: '38705'
last_name: Castenow
- first_name: Björn
full_name: Feldkord, Björn
id: '22704'
last_name: Feldkord
- first_name: Till
full_name: Knollmann, Till
id: '39241'
last_name: Knollmann
orcid: 0000-0003-2014-4696
- first_name: Manuel
full_name: Malatyali, Manuel
last_name: Malatyali
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Castenow J, Feldkord B, Knollmann T, Malatyali M, Meyer auf der Heide F. The
Online Multi-Commodity Facility Location Problem. In: Proceedings of the 32nd
ACM Symposium on Parallelism in Algorithms and Architectures. ; 2020. doi:10.1145/3350755.3400281'
apa: Castenow, J., Feldkord, B., Knollmann, T., Malatyali, M., & Meyer auf der
Heide, F. (2020). The Online Multi-Commodity Facility Location Problem. In Proceedings
of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures.
https://doi.org/10.1145/3350755.3400281
bibtex: '@inproceedings{Castenow_Feldkord_Knollmann_Malatyali_Meyer auf der Heide_2020,
title={The Online Multi-Commodity Facility Location Problem}, DOI={10.1145/3350755.3400281},
booktitle={Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms
and Architectures}, author={Castenow, Jannik and Feldkord, Björn and Knollmann,
Till and Malatyali, Manuel and Meyer auf der Heide, Friedhelm}, year={2020} }'
chicago: Castenow, Jannik, Björn Feldkord, Till Knollmann, Manuel Malatyali, and
Friedhelm Meyer auf der Heide. “The Online Multi-Commodity Facility Location Problem.”
In Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures,
2020. https://doi.org/10.1145/3350755.3400281.
ieee: J. Castenow, B. Feldkord, T. Knollmann, M. Malatyali, and F. Meyer auf der
Heide, “The Online Multi-Commodity Facility Location Problem,” in Proceedings
of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures,
2020.
mla: Castenow, Jannik, et al. “The Online Multi-Commodity Facility Location Problem.”
Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures,
2020, doi:10.1145/3350755.3400281.
short: 'J. Castenow, B. Feldkord, T. Knollmann, M. Malatyali, F. Meyer auf der Heide,
in: Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures,
2020.'
date_created: 2020-07-14T07:53:20Z
date_updated: 2022-01-06T06:53:10Z
ddc:
- '000'
department:
- _id: '63'
doi: 10.1145/3350755.3400281
external_id:
arxiv:
- '2005.08391'
file:
- access_level: closed
content_type: application/pdf
creator: tillk
date_created: 2020-07-14T07:56:52Z
date_updated: 2020-07-14T07:56:52Z
file_id: '17373'
file_name: 3350755.3400281.pdf
file_size: 1271416
relation: main_file
success: 1
file_date_updated: 2020-07-14T07:56:52Z
has_accepted_license: '1'
keyword:
- Online Multi-Commodity Facility Location
- Competitive Ratio
- Online Optimization
- Facility Location Problem
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
publication: Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and
Architectures
publication_identifier:
isbn:
- '9781450369350'
publication_status: published
status: public
title: The Online Multi-Commodity Facility Location Problem
type: conference
user_id: '39241'
year: '2020'
...
---
_id: '17407'
author:
- first_name: Alexander
full_name: Tornede, Alexander
id: '38209'
last_name: Tornede
- 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: 'Tornede A, Wever MD, Hüllermeier E. Extreme Algorithm Selection with Dyadic
Feature Representation. In: Discovery Science. ; 2020.'
apa: Tornede, A., Wever, M. D., & Hüllermeier, E. (2020). Extreme Algorithm
Selection with Dyadic Feature Representation. Discovery Science. Discovery
Science 2020.
bibtex: '@inproceedings{Tornede_Wever_Hüllermeier_2020, title={Extreme Algorithm
Selection with Dyadic Feature Representation}, booktitle={Discovery Science},
author={Tornede, Alexander and Wever, Marcel Dominik and Hüllermeier, Eyke}, year={2020}
}'
chicago: Tornede, Alexander, Marcel Dominik Wever, and Eyke Hüllermeier. “Extreme
Algorithm Selection with Dyadic Feature Representation.” In Discovery Science,
2020.
ieee: A. Tornede, M. D. Wever, and E. Hüllermeier, “Extreme Algorithm Selection
with Dyadic Feature Representation,” presented at the Discovery Science 2020,
2020.
mla: Tornede, Alexander, et al. “Extreme Algorithm Selection with Dyadic Feature
Representation.” Discovery Science, 2020.
short: 'A. Tornede, M.D. Wever, E. Hüllermeier, in: Discovery Science, 2020.'
conference:
name: Discovery Science 2020
date_created: 2020-07-21T10:06:51Z
date_updated: 2022-01-06T06:53:10Z
department:
- _id: '34'
- _id: '355'
- _id: '26'
language:
- iso: eng
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: Discovery Science
status: public
title: Extreme Algorithm Selection with Dyadic Feature Representation
type: conference
user_id: '5786'
year: '2020'
...
---
_id: '17408'
author:
- first_name: Jonas Manuel
full_name: Hanselle, Jonas Manuel
id: '43980'
last_name: Hanselle
orcid: 0000-0002-1231-4985
- first_name: Alexander
full_name: Tornede, Alexander
id: '38209'
last_name: Tornede
- 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: 'Hanselle JM, Tornede A, Wever MD, Hüllermeier E. Hybrid Ranking and Regression
for Algorithm Selection. In: KI 2020: Advances in Artificial Intelligence.
; 2020.'
apa: 'Hanselle, J. M., Tornede, A., Wever, M. D., & Hüllermeier, E. (2020).
Hybrid Ranking and Regression for Algorithm Selection. KI 2020: Advances in
Artificial Intelligence. 43rd German Conference on Artificial Intelligence.'
bibtex: '@inproceedings{Hanselle_Tornede_Wever_Hüllermeier_2020, title={Hybrid Ranking
and Regression for Algorithm Selection}, booktitle={KI 2020: Advances in Artificial
Intelligence}, author={Hanselle, Jonas Manuel and Tornede, Alexander and Wever,
Marcel Dominik and Hüllermeier, Eyke}, year={2020} }'
chicago: 'Hanselle, Jonas Manuel, Alexander Tornede, Marcel Dominik Wever, and Eyke
Hüllermeier. “Hybrid Ranking and Regression for Algorithm Selection.” In KI
2020: Advances in Artificial Intelligence, 2020.'
ieee: J. M. Hanselle, A. Tornede, M. D. Wever, and E. Hüllermeier, “Hybrid Ranking
and Regression for Algorithm Selection,” presented at the 43rd German Conference
on Artificial Intelligence, 2020.
mla: 'Hanselle, Jonas Manuel, et al. “Hybrid Ranking and Regression for Algorithm
Selection.” KI 2020: Advances in Artificial Intelligence, 2020.'
short: 'J.M. Hanselle, A. Tornede, M.D. Wever, E. Hüllermeier, in: KI 2020: Advances
in Artificial Intelligence, 2020.'
conference:
name: 43rd German Conference on Artificial Intelligence
date_created: 2020-07-21T10:21:09Z
date_updated: 2022-01-06T06:53:10Z
department:
- _id: '34'
- _id: '355'
- _id: '26'
language:
- iso: eng
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: 'KI 2020: Advances in Artificial Intelligence'
status: public
title: Hybrid Ranking and Regression for Algorithm Selection
type: conference
user_id: '5786'
year: '2020'
...
---
_id: '17424'
author:
- first_name: Tanja
full_name: Tornede, Tanja
id: '40795'
last_name: Tornede
- first_name: Alexander
full_name: Tornede, Alexander
id: '38209'
last_name: Tornede
- 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: 'Tornede T, Tornede A, Wever MD, Mohr F, Hüllermeier E. AutoML for Predictive
Maintenance: One Tool to RUL Them All. In: Proceedings of the ECMLPKDD 2020.
; 2020. doi:10.1007/978-3-030-66770-2_8'
apa: 'Tornede, T., Tornede, A., Wever, M. D., Mohr, F., & Hüllermeier, E. (2020).
AutoML for Predictive Maintenance: One Tool to RUL Them All. Proceedings of
the ECMLPKDD 2020. IOTStream Workshop @ ECMLPKDD 2020. https://doi.org/10.1007/978-3-030-66770-2_8'
bibtex: '@inproceedings{Tornede_Tornede_Wever_Mohr_Hüllermeier_2020, title={AutoML
for Predictive Maintenance: One Tool to RUL Them All}, DOI={10.1007/978-3-030-66770-2_8},
booktitle={Proceedings of the ECMLPKDD 2020}, author={Tornede, Tanja and Tornede,
Alexander and Wever, Marcel Dominik and Mohr, Felix and Hüllermeier, Eyke}, year={2020}
}'
chicago: 'Tornede, Tanja, Alexander Tornede, Marcel Dominik Wever, Felix Mohr, and
Eyke Hüllermeier. “AutoML for Predictive Maintenance: One Tool to RUL Them All.”
In Proceedings of the ECMLPKDD 2020, 2020. https://doi.org/10.1007/978-3-030-66770-2_8.'
ieee: 'T. Tornede, A. Tornede, M. D. Wever, F. Mohr, and E. Hüllermeier, “AutoML
for Predictive Maintenance: One Tool to RUL Them All,” presented at the IOTStream
Workshop @ ECMLPKDD 2020, 2020, doi: 10.1007/978-3-030-66770-2_8.'
mla: 'Tornede, Tanja, et al. “AutoML for Predictive Maintenance: One Tool to RUL
Them All.” Proceedings of the ECMLPKDD 2020, 2020, doi:10.1007/978-3-030-66770-2_8.'
short: 'T. Tornede, A. Tornede, M.D. Wever, F. Mohr, E. Hüllermeier, in: Proceedings
of the ECMLPKDD 2020, 2020.'
conference:
name: IOTStream Workshop @ ECMLPKDD 2020
date_created: 2020-07-28T09:17:41Z
date_updated: 2022-01-06T06:53:11Z
department:
- _id: '34'
- _id: '355'
- _id: '26'
doi: 10.1007/978-3-030-66770-2_8
language:
- iso: eng
project:
- _id: '52'
name: Computing Resources Provided by the Paderborn Center for Parallel Computing
- _id: '3'
name: SFB 901 - Project Area B
- _id: '10'
name: SFB 901 - Subproject B2
- _id: '1'
name: SFB 901
- _id: '52'
name: Computing Resources Provided by the Paderborn Center for Parallel Computing
publication: Proceedings of the ECMLPKDD 2020
status: public
title: 'AutoML for Predictive Maintenance: One Tool to RUL Them All'
type: conference
user_id: '5786'
year: '2020'
...
---
_id: '17836'
citation:
ama: Werneck Richa A, Scheideler C, eds. Structural Information and Communication
Complexity - 27th International Colloquium, SIROCCO 2020, Paderborn, Germany,
June 29 - July 1, 2020, Proceedings. Vol 12156. Springer; 2020. doi:10.1007/978-3-030-54921-3
apa: Werneck Richa, A., & Scheideler, C. (Eds.). (2020). Structural Information
and Communication Complexity - 27th International Colloquium, SIROCCO 2020, Paderborn,
Germany, June 29 - July 1, 2020, Proceedings (Vol. 12156). Springer. https://doi.org/10.1007/978-3-030-54921-3
bibtex: '@book{Werneck Richa_Scheideler_2020, series={Lecture Notes in Computer
Science}, title={Structural Information and Communication Complexity - 27th International
Colloquium, SIROCCO 2020, Paderborn, Germany, June 29 - July 1, 2020, Proceedings},
volume={12156}, DOI={10.1007/978-3-030-54921-3},
publisher={Springer}, year={2020}, collection={Lecture Notes in Computer Science}
}'
chicago: Werneck Richa, Andrea, and Christian Scheideler, eds. Structural Information
and Communication Complexity - 27th International Colloquium, SIROCCO 2020, Paderborn,
Germany, June 29 - July 1, 2020, Proceedings. Vol. 12156. Lecture Notes in
Computer Science. Springer, 2020. https://doi.org/10.1007/978-3-030-54921-3.
ieee: A. Werneck Richa and C. Scheideler, Eds., Structural Information and Communication
Complexity - 27th International Colloquium, SIROCCO 2020, Paderborn, Germany,
June 29 - July 1, 2020, Proceedings, vol. 12156. Springer, 2020.
mla: Werneck Richa, Andrea, and Christian Scheideler, editors. Structural Information
and Communication Complexity - 27th International Colloquium, SIROCCO 2020, Paderborn,
Germany, June 29 - July 1, 2020, Proceedings. Vol. 12156, Springer, 2020,
doi:10.1007/978-3-030-54921-3.
short: A. Werneck Richa, C. Scheideler, eds., Structural Information and Communication
Complexity - 27th International Colloquium, SIROCCO 2020, Paderborn, Germany,
June 29 - July 1, 2020, Proceedings, Springer, 2020.
date_created: 2020-08-12T07:54:22Z
date_updated: 2022-01-06T06:53:20Z
department:
- _id: '79'
doi: 10.1007/978-3-030-54921-3
editor:
- first_name: Andrea
full_name: Werneck Richa, Andrea
last_name: Werneck Richa
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
intvolume: ' 12156'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subproject A1
- _id: '2'
name: SFB 901 - Project Area A
publication_identifier:
isbn:
- 978-3-030-54920-6
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: Structural Information and Communication Complexity - 27th International Colloquium,
SIROCCO 2020, Paderborn, Germany, June 29 - July 1, 2020, Proceedings
type: conference_editor
user_id: '15504'
volume: 12156
year: '2020'
...
---
_id: '17839'
citation:
ama: 'Scheideler C, Spear M, eds. SPAA ’20: 32nd ACM Symposium on Parallelism
in Algorithms and Architectures, Virtual Event, USA, July 15-17, 2020. ACM;
2020. doi:10.1145/3350755'
apa: 'Scheideler, C., & Spear, M. (Eds.). (2020). SPAA ’20: 32nd ACM Symposium
on Parallelism in Algorithms and Architectures, Virtual Event, USA, July 15-17,
2020. ACM. https://doi.org/10.1145/3350755'
bibtex: '@book{Scheideler_Spear_2020, title={SPAA ’20: 32nd ACM Symposium on Parallelism
in Algorithms and Architectures, Virtual Event, USA, July 15-17, 2020}, DOI={10.1145/3350755}, publisher={ACM},
year={2020} }'
chicago: 'Scheideler, Christian, and Michael Spear, eds. SPAA ’20: 32nd ACM Symposium
on Parallelism in Algorithms and Architectures, Virtual Event, USA, July 15-17,
2020. ACM, 2020. https://doi.org/10.1145/3350755.'
ieee: 'C. Scheideler and M. Spear, Eds., SPAA ’20: 32nd ACM Symposium on Parallelism
in Algorithms and Architectures, Virtual Event, USA, July 15-17, 2020. ACM,
2020.'
mla: 'Scheideler, Christian, and Michael Spear, editors. SPAA ’20: 32nd ACM Symposium
on Parallelism in Algorithms and Architectures, Virtual Event, USA, July 15-17,
2020. ACM, 2020, doi:10.1145/3350755.'
short: 'C. Scheideler, M. Spear, eds., SPAA ’20: 32nd ACM Symposium on Parallelism
in Algorithms and Architectures, Virtual Event, USA, July 15-17, 2020, ACM, 2020.'
date_created: 2020-08-12T07:57:10Z
date_updated: 2022-01-06T06:53:20Z
department:
- _id: '79'
doi: 10.1145/3350755
editor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Michael
full_name: Spear, Michael
last_name: Spear
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
publication_identifier:
isbn:
- 978-1-4503-6935-0
publisher: ACM
status: public
title: 'SPAA ''20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures,
Virtual Event, USA, July 15-17, 2020'
type: conference_editor
user_id: '15504'
year: '2020'
...
---
_id: '18686'
author:
- first_name: Joschka
full_name: Kersting, Joschka
id: '58701'
last_name: Kersting
- first_name: Frederik Simon
full_name: Bäumer, Frederik Simon
id: '38837'
last_name: Bäumer
citation:
ama: 'Kersting J, Bäumer FS. SEMANTIC TAGGING OF REQUIREMENT DESCRIPTIONS: A TRANSFORMER-BASED
APPROACH. In: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON APPLIED COMPUTING
2020. IADIS; 2020:119--123.'
apa: 'Kersting, J., & Bäumer, F. S. (2020). SEMANTIC TAGGING OF REQUIREMENT
DESCRIPTIONS: A TRANSFORMER-BASED APPROACH. PROCEEDINGS OF THE INTERNATIONAL
CONFERENCE ON APPLIED COMPUTING 2020, 119--123.'
bibtex: '@inproceedings{Kersting_Bäumer_2020, title={SEMANTIC TAGGING OF REQUIREMENT
DESCRIPTIONS: A TRANSFORMER-BASED APPROACH}, booktitle={PROCEEDINGS OF THE INTERNATIONAL
CONFERENCE ON APPLIED COMPUTING 2020}, publisher={IADIS}, author={Kersting, Joschka
and Bäumer, Frederik Simon}, year={2020}, pages={119--123} }'
chicago: 'Kersting, Joschka, and Frederik Simon Bäumer. “SEMANTIC TAGGING OF REQUIREMENT
DESCRIPTIONS: A TRANSFORMER-BASED APPROACH.” In PROCEEDINGS OF THE INTERNATIONAL
CONFERENCE ON APPLIED COMPUTING 2020, 119--123. IADIS, 2020.'
ieee: 'J. Kersting and F. S. Bäumer, “SEMANTIC TAGGING OF REQUIREMENT DESCRIPTIONS:
A TRANSFORMER-BASED APPROACH,” in PROCEEDINGS OF THE INTERNATIONAL CONFERENCE
ON APPLIED COMPUTING 2020, Lisbon, Portugal, 2020, pp. 119--123.'
mla: 'Kersting, Joschka, and Frederik Simon Bäumer. “SEMANTIC TAGGING OF REQUIREMENT
DESCRIPTIONS: A TRANSFORMER-BASED APPROACH.” PROCEEDINGS OF THE INTERNATIONAL
CONFERENCE ON APPLIED COMPUTING 2020, IADIS, 2020, pp. 119--123.'
short: 'J. Kersting, F.S. Bäumer, in: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE
ON APPLIED COMPUTING 2020, IADIS, 2020, pp. 119--123.'
conference:
end_date: 20.11.2020
location: Lisbon, Portugal
name: 17th International Conference on Applied Computing
start_date: 18.11.2020
date_created: 2020-08-31T10:59:54Z
date_updated: 2022-01-06T06:53:51Z
ddc:
- '000'
department:
- _id: '579'
file:
- access_level: closed
content_type: application/pdf
creator: jkers
date_created: 2020-11-19T17:29:03Z
date_updated: 2020-11-19T17:29:03Z
file_id: '20443'
file_name: Kersting & Bäumer (2020), Kersting2020d.pdf
file_size: 1064877
relation: main_file
success: 1
file_date_updated: 2020-11-19T17:29:03Z
has_accepted_license: '1'
keyword:
- Software Requirements
- Natural Language Processing
- Transfer Learning
- On-The-Fly Computing
language:
- iso: eng
page: 119--123
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 INTERNATIONAL CONFERENCE ON APPLIED COMPUTING 2020
publisher: IADIS
status: public
title: 'SEMANTIC TAGGING OF REQUIREMENT DESCRIPTIONS: A TRANSFORMER-BASED APPROACH'
type: conference
user_id: '58701'
year: '2020'
...
---
_id: '20306'
author:
- first_name: Alexander
full_name: Tornede, Alexander
id: '38209'
last_name: Tornede
- 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: 'Tornede A, Wever MD, Hüllermeier E. Towards Meta-Algorithm Selection. In:
Workshop MetaLearn 2020 @ NeurIPS 2020. ; 2020.'
apa: Tornede, A., Wever, M. D., & Hüllermeier, E. (2020). Towards Meta-Algorithm
Selection. Workshop MetaLearn 2020 @ NeurIPS 2020. Workshop MetaLearn 2020
@ NeurIPS 2020, Online.
bibtex: '@inproceedings{Tornede_Wever_Hüllermeier_2020, title={Towards Meta-Algorithm
Selection}, booktitle={Workshop MetaLearn 2020 @ NeurIPS 2020}, author={Tornede,
Alexander and Wever, Marcel Dominik and Hüllermeier, Eyke}, year={2020} }'
chicago: Tornede, Alexander, Marcel Dominik Wever, and Eyke Hüllermeier. “Towards
Meta-Algorithm Selection.” In Workshop MetaLearn 2020 @ NeurIPS 2020, 2020.
ieee: A. Tornede, M. D. Wever, and E. Hüllermeier, “Towards Meta-Algorithm Selection,”
presented at the Workshop MetaLearn 2020 @ NeurIPS 2020, Online, 2020.
mla: Tornede, Alexander, et al. “Towards Meta-Algorithm Selection.” Workshop
MetaLearn 2020 @ NeurIPS 2020, 2020.
short: 'A. Tornede, M.D. Wever, E. Hüllermeier, in: Workshop MetaLearn 2020 @ NeurIPS
2020, 2020.'
conference:
location: Online
name: Workshop MetaLearn 2020 @ NeurIPS 2020
date_created: 2020-11-06T09:42:27Z
date_updated: 2022-01-06T06:54:26Z
department:
- _id: '34'
- _id: '355'
- _id: '26'
language:
- iso: eng
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: Workshop MetaLearn 2020 @ NeurIPS 2020
status: public
title: Towards Meta-Algorithm Selection
type: conference
user_id: '5786'
year: '2020'
...
---
_id: '20495'
author:
- first_name: Moritz
full_name: Jochmaring, Moritz
last_name: Jochmaring
citation:
ama: Jochmaring M. A Self Stabilizing Protocol for Well-Formed Trees in Hybrid
Networks.; 2020.
apa: Jochmaring, M. (2020). A self stabilizing protocol for well-formed trees
in hybrid networks.
bibtex: '@book{Jochmaring_2020, title={A self stabilizing protocol for well-formed
trees in hybrid networks}, author={Jochmaring, Moritz}, year={2020} }'
chicago: Jochmaring, Moritz. A Self Stabilizing Protocol for Well-Formed Trees
in Hybrid Networks, 2020.
ieee: M. Jochmaring, A self stabilizing protocol for well-formed trees in hybrid
networks. 2020.
mla: Jochmaring, Moritz. A Self Stabilizing Protocol for Well-Formed Trees in
Hybrid Networks. 2020.
short: M. Jochmaring, A Self Stabilizing Protocol for Well-Formed Trees in Hybrid
Networks, 2020.
date_created: 2020-11-25T07:03:16Z
date_updated: 2022-01-06T06:54:27Z
department:
- _id: '79'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subproject A1
- _id: '2'
name: SFB 901 - Project Area A
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: A self stabilizing protocol for well-formed trees in hybrid networks
type: mastersthesis
user_id: '15504'
year: '2020'
...
---
_id: '20712'
author:
- first_name: Philipp
full_name: Schubert, Philipp
id: '60543'
last_name: Schubert
orcid: 0000-0002-8674-1859
- first_name: Eric
full_name: Bodden, Eric
id: '59256'
last_name: Bodden
orcid: 0000-0003-3470-3647
- first_name: Ben
full_name: Hermann, Ben
id: '66173'
last_name: Hermann
orcid: 0000-0001-9848-2017
citation:
ama: Schubert P, Bodden E, Hermann B. Accelerating Static Call-Graph, Points-to
and Data-Flow Analysis Through Persisted Summaries.; 2020.
apa: Schubert, P., Bodden, E., & Hermann, B. (2020). Accelerating Static
Call-Graph, Points-to and Data-Flow Analysis Through Persisted Summaries.
bibtex: '@book{Schubert_Bodden_Hermann_2020, title={Accelerating Static Call-Graph,
Points-to and Data-Flow Analysis Through Persisted Summaries}, author={Schubert,
Philipp and Bodden, Eric and Hermann, Ben}, year={2020} }'
chicago: Schubert, Philipp, Eric Bodden, and Ben Hermann. Accelerating Static
Call-Graph, Points-to and Data-Flow Analysis Through Persisted Summaries,
2020.
ieee: P. Schubert, E. Bodden, and B. Hermann, Accelerating Static Call-Graph,
Points-to and Data-Flow Analysis Through Persisted Summaries. 2020.
mla: Schubert, Philipp, et al. Accelerating Static Call-Graph, Points-to and
Data-Flow Analysis Through Persisted Summaries. 2020.
short: P. Schubert, E. Bodden, B. Hermann, Accelerating Static Call-Graph, Points-to
and Data-Flow Analysis Through Persisted Summaries, 2020.
date_created: 2020-12-14T07:44:11Z
date_updated: 2022-01-06T06:54:34Z
ddc:
- '000'
department:
- _id: '76'
file:
- access_level: closed
content_type: application/pdf
creator: pdschbrt
date_created: 2020-12-14T07:39:07Z
date_updated: 2020-12-14T07:39:07Z
file_id: '20713'
file_name: main.pdf
file_size: 683576
relation: main_file
success: 1
file_date_updated: 2020-12-14T07:39:07Z
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
status: public
title: Accelerating Static Call-Graph, Points-to and Data-Flow Analysis Through Persisted
Summaries
type: report
user_id: '477'
year: '2020'
...
---
_id: '20748'
abstract:
- lang: eng
text: "On the circuit level, the design paradigm Approximate Computing seeks to
trade off computational accuracy against a target metric, e.g., energy consumption.
This trade-off is possible for many applications due to their inherent resiliency
against inaccuracies.\r\nIn the past, several automated approximation frameworks
have been presented, which either utilize designated approximation techniques
or libraries to replace approximable circuit parts with inaccurate versions. The
frameworks invoke a search algorithm to iteratively explore the search space of
performance degraded circuits, and validate their quality individually. \r\nIn
this paper, we propose to reverse this procedure. Rather than exploring the search
space, we delineate the approximate parts of the search space which are guaranteed
to lead to valid approximate circuits. Our methodology is supported by formal
verification and independent of approximation techniques. Eventually, the user
is provided with quality bounds of the individual approximable circuit parts.
Consequently, our approach guarantees that any approximate circuit which implements
these parts within the determined quality constraints satisfies the global quality
constraints, superseding a subsequent quality verification.\r\nIn our experimental
results, we present the runtimes of our approach."
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. Search Space Characterization for AxC
Synthesis. Fifth Workshop on Approximate Computing (AxC 2020).
apa: Witschen, L. M., Wiersema, T., & Platzner, M. (n.d.). Search Space Characterization
for AxC Synthesis. Fifth Workshop on Approximate Computing (AxC 2020).
bibtex: '@article{Witschen_Wiersema_Platzner, title={Search Space Characterization
for AxC Synthesis}, journal={Fifth Workshop on Approximate Computing (AxC 2020)},
author={Witschen, Linus Matthias and Wiersema, Tobias and Platzner, Marco} }'
chicago: Witschen, Linus Matthias, Tobias Wiersema, and Marco Platzner. “Search
Space Characterization for AxC Synthesis.” Fifth Workshop on Approximate Computing
(AxC 2020), n.d.
ieee: L. M. Witschen, T. Wiersema, and M. Platzner, “Search Space Characterization
for AxC Synthesis,” Fifth Workshop on Approximate Computing (AxC 2020).
.
mla: Witschen, Linus Matthias, et al. “Search Space Characterization for AxC Synthesis.”
Fifth Workshop on Approximate Computing (AxC 2020).
short: L.M. Witschen, T. Wiersema, M. Platzner, Fifth Workshop on Approximate Computing
(AxC 2020) (n.d.).
date_created: 2020-12-15T15:13:49Z
date_updated: 2022-01-06T06:54:35Z
ddc:
- '000'
department:
- _id: '78'
file:
- access_level: closed
content_type: application/pdf
creator: witschen
date_created: 2020-12-15T15:11:06Z
date_updated: 2020-12-15T15:11:06Z
file_id: '20749'
file_name: witschen20_axc.pdf
file_size: 250870
relation: main_file
success: 1
file_date_updated: 2020-12-15T15:11:06Z
has_accepted_license: '1'
language:
- iso: eng
page: '2'
project:
- _id: '12'
name: SFB 901 - Subproject B4
- _id: '3'
name: SFB 901 - Project Area B
- _id: '1'
name: SFB 901
publication: Fifth Workshop on Approximate Computing (AxC 2020)
publication_status: accepted
status: public
title: Search Space Characterization for AxC Synthesis
type: preprint
user_id: '3118'
year: '2020'
...
---
_id: '20755'
abstract:
- lang: eng
text: "We consider the problem of computing shortest paths in \\emph{hybrid networks},
in which nodes can make use of different communication modes. For example, mobile
phones may use ad-hoc connections via Bluetooth or Wi-Fi in addition to the cellular
network to solve tasks more efficiently. Like in this case, the different communication
modes may differ considerably in range, bandwidth, and flexibility. We build upon
the model of Augustine et al. [SODA '20], which captures these differences by
a \\emph{local} and a \\emph{global} mode. Specifically, the local edges model
a fixed communication network in which $O(1)$ messages of size $O(\\log n)$ can
be sent over every edge in each synchronous round. The global edges form a clique,
but nodes are only allowed to send and receive a total of at most $O(\\log n)$
messages over global edges, which restricts the nodes to use these edges only
very sparsely.\r\n\r\nWe demonstrate the power of hybrid networks by presenting
algorithms to compute Single-Source Shortest Paths and the diameter very efficiently
in \\emph{sparse graphs}. Specifically, we present exact $O(\\log n)$ time algorithms
for cactus graphs (i.e., graphs in which each edge is contained in at most one
cycle), and $3$-approximations for graphs that have at most $n + O(n^{1/3})$ edges
and arboricity $O(\\log n)$. For these graph classes, our algorithms provide exponentially
faster solutions than the best known algorithms for general graphs in this model.\r\nBeyond
shortest paths, we also provide a variety of useful tools and techniques for hybrid
networks, which may be of independent interest.\r\n"
author:
- first_name: Michael
full_name: Feldmann, Michael
id: '23538'
last_name: Feldmann
- first_name: Kristian
full_name: Hinnenthal, Kristian
id: '32229'
last_name: Hinnenthal
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Feldmann M, Hinnenthal K, Scheideler C. Fast Hybrid Network Algorithms for
Shortest Paths in Sparse Graphs. In: Proceedings of the 24th International
Conference on Principles of Distributed Systems (OPODIS). Schloss Dagstuhl
- Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.OPODIS.2020.31'
apa: Feldmann, M., Hinnenthal, K., & Scheideler, C. (2020). Fast Hybrid Network
Algorithms for Shortest Paths in Sparse Graphs. In Proceedings of the 24th
International Conference on Principles of Distributed Systems (OPODIS). Schloss
Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.OPODIS.2020.31
bibtex: '@inproceedings{Feldmann_Hinnenthal_Scheideler_2020, title={Fast Hybrid
Network Algorithms for Shortest Paths in Sparse Graphs}, DOI={10.4230/LIPIcs.OPODIS.2020.31},
booktitle={Proceedings of the 24th International Conference on Principles of Distributed
Systems (OPODIS)}, publisher={Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
author={Feldmann, Michael and Hinnenthal, Kristian and Scheideler, Christian},
year={2020} }'
chicago: Feldmann, Michael, Kristian Hinnenthal, and Christian Scheideler. “Fast
Hybrid Network Algorithms for Shortest Paths in Sparse Graphs.” In Proceedings
of the 24th International Conference on Principles of Distributed Systems (OPODIS).
Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.OPODIS.2020.31.
ieee: M. Feldmann, K. Hinnenthal, and C. Scheideler, “Fast Hybrid Network Algorithms
for Shortest Paths in Sparse Graphs,” in Proceedings of the 24th International
Conference on Principles of Distributed Systems (OPODIS), 2020.
mla: Feldmann, Michael, et al. “Fast Hybrid Network Algorithms for Shortest Paths
in Sparse Graphs.” Proceedings of the 24th International Conference on Principles
of Distributed Systems (OPODIS), Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2020, doi:10.4230/LIPIcs.OPODIS.2020.31.
short: 'M. Feldmann, K. Hinnenthal, C. Scheideler, in: Proceedings of the 24th International
Conference on Principles of Distributed Systems (OPODIS), Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2020.'
date_created: 2020-12-16T10:20:18Z
date_updated: 2022-01-06T06:54:36Z
ddc:
- '000'
department:
- _id: '79'
doi: 10.4230/LIPIcs.OPODIS.2020.31
external_id:
arxiv:
- '2007.01191'
file:
- access_level: closed
content_type: application/pdf
creator: mfeldma2
date_created: 2020-12-16T10:18:50Z
date_updated: 2020-12-16T10:18:50Z
file_id: '20756'
file_name: Fast_Hybrid_Network_Algorithms_for_Shortest_Paths_in_Sparse_Graphs.pdf
file_size: 867373
relation: main_file
success: 1
file_date_updated: 2020-12-16T10:18:50Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
- _id: '1'
name: SFB 901
publication: Proceedings of the 24th International Conference on Principles of Distributed
Systems (OPODIS)
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
status: public
title: Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs
type: conference
user_id: '23538'
year: '2020'
...